{"meta":{"query_hash":"3c29a04d9409","filters":{"venue":"Discrete Optimization"},"cohort_total":58,"direct_labels_cover":0,"predictions_cover":58,"exported":58,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3c29a04d9409","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+Optimization"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017486512446671036,"score_gpt":0.2802205927815007,"score_spread":0.26273408033482964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968959377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014992018,0.000036650763,0.989228,0.003625886,0.00009879256,0.00023069752,0.0000038682015,0.00017729253,0.005099601],"genre_scores_gemma":[0.4082297,0.0000068810155,0.58669305,0.00013683057,0.00006943197,0.000034155375,0.000026865364,0.000018188337,0.004784865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989257,0.000061741826,0.00010838811,0.0003414177,0.0002778049,0.00028496448],"domain_scores_gemma":[0.9992808,0.000025604379,0.00004307454,0.00045823157,0.00010498615,0.000087301196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015051813,0.0001024644,0.00008974989,0.00014931193,0.00013053342,0.00033495273,0.00053045107,0.000039628165,0.000013801581],"category_scores_gemma":[0.00006797445,0.0000973815,0.00003671803,0.0007213426,0.00002458786,0.0008311907,0.00017583038,0.000069781134,0.000034250123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008388226,0.000017004031,0.00017249903,0.0000035182843,0.0000031658087,0.0000036264769,0.00011363145,0.8956466,0.0013122741,0.09707227,0.00070497964,0.004942047],"study_design_scores_gemma":[0.00036626973,0.0000968069,0.00081887876,0.000015722793,0.000002833302,0.0000057235757,0.00005860907,0.9611083,0.007315007,0.02388349,0.005986789,0.00034152615],"about_ca_topic_score_codex":0.000012046491,"about_ca_topic_score_gemma":0.0000050888516,"teacher_disagreement_score":0.4067305,"about_ca_system_score_codex":0.000038347578,"about_ca_system_score_gemma":0.000017553544,"threshold_uncertainty_score":0.39711022},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023063067758610504,"score_gpt":0.2875200500293179,"score_spread":0.2644569822707074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970402125","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012497966,0.000075727614,0.9964208,0.00022000128,0.00011517401,0.0010774598,0.000024791128,0.00021397122,0.00060225074],"genre_scores_gemma":[0.48658404,0.0000031371358,0.51294005,0.000012727146,0.00002356248,0.00014212121,0.0002438014,0.000027239064,0.000023321516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989101,0.00004645019,0.00052845076,0.0001415244,0.00018055766,0.0001928876],"domain_scores_gemma":[0.99853694,0.0004973196,0.00015346838,0.00017609374,0.00059461227,0.000041540254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025006925,0.00014213669,0.000180123,0.00009081279,0.00022878057,0.00007661102,0.0001408366,0.00007495007,0.000083541134],"category_scores_gemma":[0.00017875578,0.0001212481,0.00005866179,0.00051795604,0.00005014903,0.00032611552,0.000016338092,0.00008891718,0.000006358015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003121528,0.000013143418,0.0005822707,0.000055235043,0.000043676355,7.604618e-9,0.0010742933,0.9928979,0.00006160797,0.0015846838,0.000372073,0.003311959],"study_design_scores_gemma":[0.00035256188,0.000019777857,0.00069570955,0.000035098594,0.00003708344,6.0468244e-7,0.00032657187,0.9975382,0.00021966423,0.00060341065,0.000032782762,0.00013852808],"about_ca_topic_score_codex":0.00002155626,"about_ca_topic_score_gemma":0.0000032573082,"teacher_disagreement_score":0.48533422,"about_ca_system_score_codex":0.000051904357,"about_ca_system_score_gemma":0.000029294499,"threshold_uncertainty_score":0.4944354},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0061230829875364,"score_gpt":0.2052522143263091,"score_spread":0.19912913133877272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975310381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024202233,0.00013197598,0.9954543,0.000060828803,0.00023037143,0.0005160567,0.000038578157,0.00020396018,0.00094371935],"genre_scores_gemma":[0.42222312,0.00017239271,0.5728885,0.0001552526,0.00051884947,0.00047988512,0.00071466307,0.00016625276,0.002681076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993209,0.000012646465,0.00018872405,0.00016457014,0.00008648257,0.00022666338],"domain_scores_gemma":[0.999658,0.000027169792,0.0000313305,0.00014352787,0.00006789952,0.000072093564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007074403,0.00013916251,0.0001466175,0.000057855537,0.0000793017,0.00009919885,0.000103263745,0.0000764669,0.00043478297],"category_scores_gemma":[0.00001967075,0.00013368962,0.000061199,0.00009834574,0.000023100987,0.00026010518,0.000016125934,0.000058446018,0.00010877382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032358712,0.000008486413,0.000017720165,0.000023314245,0.000026907077,4.31003e-7,0.00014023836,0.91543275,0.0014162805,0.000034698478,0.0057837316,0.077112205],"study_design_scores_gemma":[0.000169374,0.000026726191,0.00003072615,0.000012049966,0.000013959772,0.0000017666434,0.000021157488,0.994987,0.003458704,0.00003881661,0.0010580934,0.00018163618],"about_ca_topic_score_codex":0.0000382928,"about_ca_topic_score_gemma":0.0000012327027,"teacher_disagreement_score":0.4225658,"about_ca_system_score_codex":0.000037696198,"about_ca_system_score_gemma":0.000008909207,"threshold_uncertainty_score":0.5451705},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10718468775808698,"score_gpt":0.382185916378766,"score_spread":0.275001228620679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976051387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006502611,0.00016162606,0.993755,0.0030613046,0.00026063868,0.0010323446,0.00002136403,0.00006178504,0.000995675],"genre_scores_gemma":[0.44008416,0.0000056551144,0.55904675,0.00023933426,0.00011251658,0.0000424902,0.000064036016,0.00001159991,0.00039348035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980841,0.000058681413,0.0005429601,0.00043278153,0.0005174792,0.0003639922],"domain_scores_gemma":[0.99812144,0.00077023235,0.0002721612,0.0003461842,0.00041537572,0.0000746087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002574597,0.00015008745,0.00020716534,0.00011021366,0.0009957278,0.0006207232,0.00043003136,0.00007782656,0.000018197565],"category_scores_gemma":[0.0010434126,0.00009651772,0.00023310333,0.000531185,0.00005241294,0.00021081543,0.000022644123,0.00009353835,0.0000021974686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005616245,0.00004765323,0.000022359709,0.0000028649436,0.000022530014,5.6471173e-8,0.0006428819,0.98621666,0.000027368696,0.0026231217,0.00079646695,0.009541853],"study_design_scores_gemma":[0.0006663783,0.000118635755,0.00010554013,0.00001293053,0.000060713184,0.0000019781967,0.0013260252,0.9915622,0.00003316566,0.0049662525,0.0010059975,0.00014018324],"about_ca_topic_score_codex":0.000007874716,"about_ca_topic_score_gemma":0.0000020740738,"teacher_disagreement_score":0.43943387,"about_ca_system_score_codex":0.000047352132,"about_ca_system_score_gemma":0.000070915936,"threshold_uncertainty_score":0.76584345},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.005582494992715322,"score_gpt":0.1959777075951276,"score_spread":0.19039521260241227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980190773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094623756,0.00023612879,0.99735713,0.00018762301,0.0001696633,0.0009347134,0.00001956093,0.00037494654,0.0006256111],"genre_scores_gemma":[0.09064643,0.0014384018,0.9009346,0.000097684075,0.00028448968,0.0006936515,0.0019300292,0.00021147821,0.003763232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925435,0.000015155194,0.00024513976,0.00019151655,0.00009551459,0.00019834135],"domain_scores_gemma":[0.9995056,0.00009287324,0.000061339066,0.00017298626,0.00011602843,0.000051181352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092319875,0.00016758862,0.00012673879,0.00006132412,0.00018969164,0.00009606239,0.000085010404,0.000113654656,0.00009333799],"category_scores_gemma":[0.00005721086,0.00013188513,0.00003380214,0.0001519168,0.00004876491,0.0003223834,0.000021646658,0.000103314684,0.000027308179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012232583,0.000005277759,0.0000037203336,0.00002457712,0.0000275743,9.028217e-8,0.00013292348,0.9869198,0.00004307713,0.00012147134,0.0002605847,0.01245964],"study_design_scores_gemma":[0.00034890548,0.000032565884,0.000056556866,0.00001908764,0.000039516766,0.0000027800495,0.00002493112,0.9979522,0.00019557768,0.00059957587,0.0005488894,0.00017940832],"about_ca_topic_score_codex":0.000009845711,"about_ca_topic_score_gemma":6.2352234e-7,"teacher_disagreement_score":0.09642252,"about_ca_system_score_codex":0.000027554546,"about_ca_system_score_gemma":0.000006689215,"threshold_uncertainty_score":0.53781193},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006429571201527289,"score_gpt":0.215421699780067,"score_spread":0.20899212857853972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981813514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019249482,0.00033304686,0.97055316,0.00009936393,0.00005399534,0.00021644078,0.00001708346,0.00095099374,0.008526454],"genre_scores_gemma":[0.8721289,0.0004564991,0.12716143,0.00002778643,0.00006866045,0.000021361564,0.00005810302,0.00002563605,0.000051636747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995159,0.000015819951,0.00014209894,0.00013269928,0.000069465226,0.00012401615],"domain_scores_gemma":[0.9997468,0.00001346098,0.000015226174,0.00015473607,0.000021916625,0.00004789005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007608257,0.00010616337,0.00009789769,0.00004492513,0.00004173977,0.00003726056,0.000053213196,0.000071742106,0.00005255138],"category_scores_gemma":[0.000016168953,0.00010246002,0.000023307355,0.00008184054,0.000021414367,0.00025392967,0.000015313879,0.00005678135,0.0000052490745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040033956,0.000008283042,0.0006006711,0.000022567743,0.000010195658,5.130915e-7,0.00027553912,0.97563165,0.00077517546,0.00015061755,0.0004176386,0.02210313],"study_design_scores_gemma":[0.00012468547,0.000013614938,0.0007799493,0.000012764358,0.000009498379,0.0000018372291,0.000019886638,0.9952716,0.002500131,0.00006635375,0.0010651917,0.00013447601],"about_ca_topic_score_codex":0.00001607108,"about_ca_topic_score_gemma":0.000033670185,"teacher_disagreement_score":0.8528794,"about_ca_system_score_codex":0.000033114982,"about_ca_system_score_gemma":0.0000029705936,"threshold_uncertainty_score":0.41781983},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01236291145485941,"score_gpt":0.23366009205835583,"score_spread":0.22129718060349643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982713256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015921688,0.0000426987,0.9897717,0.0016482489,0.00016108713,0.00024111109,0.000005158003,0.00009464808,0.0064431746],"genre_scores_gemma":[0.5328751,0.00004044624,0.4666281,0.000100980134,0.00005606125,0.000033815133,0.00001610333,0.000010654845,0.00023873585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992623,0.00003375835,0.00013894819,0.00023359848,0.00015640853,0.0001749926],"domain_scores_gemma":[0.99936324,0.00012349206,0.000089476634,0.00024637987,0.00011259834,0.000064835855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020463625,0.00010103836,0.00007731058,0.000047584075,0.0005363298,0.00038294905,0.00031115522,0.000042277832,0.0000146864795],"category_scores_gemma":[0.000042492895,0.00006896999,0.000019366726,0.00027153562,0.00016278008,0.00040473967,0.00009345962,0.00014905247,0.0000023931768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010101295,0.000025172167,0.0003425946,0.000009005592,0.00003693014,0.0000037042926,0.0016077484,0.018037068,0.00045282813,0.94926125,0.00008114103,0.030132487],"study_design_scores_gemma":[0.00029550446,0.000048281563,0.0008016586,0.000013843043,0.0000084956855,0.000024818977,0.00004821374,0.99592745,0.00013178239,0.0017530014,0.00081909524,0.00012783441],"about_ca_topic_score_codex":0.0000051336156,"about_ca_topic_score_gemma":0.000026276828,"teacher_disagreement_score":0.97789043,"about_ca_system_score_codex":0.0000046214286,"about_ca_system_score_gemma":0.000046233872,"threshold_uncertainty_score":0.41250694},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06296760241526711,"score_gpt":0.3605790427625292,"score_spread":0.2976114403472621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984167047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00731531,0.00019532448,0.9851884,0.0025839005,0.00028488657,0.00047628258,0.000022875027,0.000051591538,0.003881425],"genre_scores_gemma":[0.68956554,0.00035771748,0.30900523,0.00019074438,0.00023661889,0.000007763082,0.00040351812,0.00003366317,0.00019922061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970641,0.00041954644,0.0007666958,0.00070330733,0.0007804183,0.00026590342],"domain_scores_gemma":[0.9976083,0.0006778223,0.00050454127,0.00085418933,0.0002759294,0.00007921239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023222645,0.00021743015,0.0002922986,0.0002719841,0.00033102042,0.0005150644,0.0007436599,0.00011748491,0.00007247719],"category_scores_gemma":[0.0011163409,0.00013653006,0.00003134893,0.0012065062,0.00017780084,0.0022730904,0.00036040516,0.00023536496,0.00000771503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008909644,0.00002392612,0.0052543897,0.0000012100321,0.00001169067,0.0000019751433,0.0015360706,0.9814086,8.5012175e-7,0.002118602,0.00034430064,0.009209283],"study_design_scores_gemma":[0.00101634,0.00006711279,0.0011288321,0.000047119225,0.000026121596,0.000011241989,0.0008185401,0.99498624,0.000010182077,0.00044145394,0.00125068,0.00019614998],"about_ca_topic_score_codex":0.0000480604,"about_ca_topic_score_gemma":0.00006939826,"teacher_disagreement_score":0.6822502,"about_ca_system_score_codex":0.000055610708,"about_ca_system_score_gemma":0.000072199975,"threshold_uncertainty_score":0.5567534},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.023079159256816015,"score_gpt":0.27368003639205085,"score_spread":0.2506008771352348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986446280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024669289,0.000104265026,0.9985096,0.00017569373,0.0001660354,0.0003654426,0.00003802273,0.000079069905,0.00031521186],"genre_scores_gemma":[0.055108078,0.000026466552,0.94432884,0.000077084536,0.00009315988,0.00012480015,0.00020022881,0.000011132288,0.000030202973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894166,0.0000769939,0.0002799813,0.0002326934,0.00019153453,0.00027714006],"domain_scores_gemma":[0.9990117,0.00010960841,0.00018975059,0.00047167935,0.00014392311,0.000073346055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006203407,0.00011825577,0.00018678268,0.00018441114,0.00028534315,0.00012268432,0.0004862555,0.000051170406,0.000022140237],"category_scores_gemma":[0.00001934861,0.00009084869,0.0001552613,0.0011876031,0.00007063785,0.0009961926,0.000109732326,0.000065822045,7.7964853e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007317036,0.00014254963,0.0006800777,0.000022630107,0.00035871557,2.3043552e-7,0.0017485941,0.77723384,0.00001643919,0.061576486,0.000029290166,0.15818386],"study_design_scores_gemma":[0.0001582351,0.000051092924,0.00076125085,0.000007965163,0.00020246279,0.0000013858048,0.000086276596,0.9956384,0.00022416598,0.0025819363,0.00015970912,0.00012714011],"about_ca_topic_score_codex":0.000037149854,"about_ca_topic_score_gemma":0.00001039688,"teacher_disagreement_score":0.21840456,"about_ca_system_score_codex":0.000017425047,"about_ca_system_score_gemma":0.000018839419,"threshold_uncertainty_score":0.3704702},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017727372656691377,"score_gpt":0.24723899472558208,"score_spread":0.2295116220688907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986491739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03495982,0.000213156,0.9632294,0.00013149447,0.00017476399,0.00046462772,0.00003770839,0.00022870033,0.00056029425],"genre_scores_gemma":[0.5654709,0.00024709516,0.433852,0.000043496035,0.000049178758,0.000082724015,0.00016054428,0.000045270946,0.000048832746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875546,0.000027234431,0.00046752862,0.0002728876,0.00023195962,0.0002449314],"domain_scores_gemma":[0.99933577,0.000094657364,0.00010084509,0.00019700022,0.00016750155,0.000104230945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022431093,0.00020939321,0.00027845523,0.00014667813,0.00014422747,0.00003559324,0.00011508646,0.00013872403,0.000027723772],"category_scores_gemma":[0.00023416491,0.00020655671,0.000090897855,0.00026688253,0.00010414443,0.00024251798,0.000021896263,0.000119572534,0.0000030898177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004652612,0.00002680394,0.00060136785,0.00010043434,0.000044353234,0.0000011238498,0.00028270698,0.9967763,0.000035249843,0.0017547031,0.000048495534,0.000281923],"study_design_scores_gemma":[0.0008058599,0.000067315785,0.0003681399,0.00006238395,0.000038682814,0.0000066602083,0.000050808052,0.9972374,0.00070052966,0.00039620584,0.00002173854,0.00024426612],"about_ca_topic_score_codex":0.0000039867323,"about_ca_topic_score_gemma":6.9900943e-7,"teacher_disagreement_score":0.5305111,"about_ca_system_score_codex":0.000023737563,"about_ca_system_score_gemma":0.000023490958,"threshold_uncertainty_score":0.8423138},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02244022931863883,"score_gpt":0.25673848990929843,"score_spread":0.2342982605906596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992769367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006707916,0.00007005527,0.9973019,0.00020997037,0.00018110804,0.00063727295,0.000025256524,0.00037809002,0.00052555674],"genre_scores_gemma":[0.15943478,0.000042758133,0.8400558,0.000076867145,0.00012520114,0.00003826369,0.00003975519,0.000071759634,0.00011478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876416,0.000112671216,0.0003349766,0.0002926137,0.00015612211,0.00033945256],"domain_scores_gemma":[0.9990881,0.00035519167,0.00010133899,0.0002453136,0.00008818936,0.00012183157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728916,0.00023351592,0.00021322364,0.000058031903,0.00028168038,0.00017793804,0.00014909197,0.00013027534,0.00003126754],"category_scores_gemma":[0.00016333476,0.00019849106,0.00006194803,0.00020565744,0.00008324117,0.00027502817,0.00004001522,0.00017399789,0.0000024156209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027419078,0.0000051891902,0.00018357612,0.000020229238,0.000040915802,8.7676625e-8,0.0003288847,0.889507,0.00012564917,0.00078396645,0.00003766554,0.1089641],"study_design_scores_gemma":[0.0010876169,0.0000252518,0.0004906297,0.000037769438,0.000058094833,0.0000057035,0.00014312375,0.99711734,0.00048569235,0.00012161497,0.00017230565,0.0002548579],"about_ca_topic_score_codex":0.00004917153,"about_ca_topic_score_gemma":0.000011204293,"teacher_disagreement_score":0.15876399,"about_ca_system_score_codex":0.00006732005,"about_ca_system_score_gemma":0.000027112901,"threshold_uncertainty_score":0.809423},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Margin (machine learning); Mathematical optimization; Algorithm; Computer science; Graph","score_opus":0.0066513854110430695,"score_gpt":0.21806962236898966,"score_spread":0.2114182369579466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996281476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09638609,0.00089822116,0.89590126,0.0019964916,0.00037236288,0.00031977255,0.000025272175,0.00046973405,0.0036308025],"genre_scores_gemma":[0.65521836,0.0010664887,0.34321663,0.00007808281,0.00011248799,0.000012804293,0.00008598991,0.00005412671,0.00015501006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915665,0.000027492142,0.0003017069,0.00015200741,0.0001734472,0.00018868875],"domain_scores_gemma":[0.99948674,0.00005438861,0.000086499625,0.00025404757,0.000061659564,0.000056680343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018121244,0.00014183536,0.00014096749,0.000072240604,0.00014304685,0.00010381794,0.00017519896,0.00006501185,0.000019108706],"category_scores_gemma":[0.00010141327,0.00011843567,0.000038111895,0.00020203635,0.00003661212,0.00018727576,0.000029231906,0.00009754179,0.0000011880744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011349663,0.0000052350742,0.00018842709,0.000011600325,0.000017223736,6.94328e-7,0.00029538834,0.9934813,0.0002666705,0.00026043926,0.00012771328,0.0053339563],"study_design_scores_gemma":[0.00039961535,0.000021963408,0.0006812649,0.000044772623,0.000016869537,0.0000029062367,0.00017684295,0.9964903,0.0013735116,0.000556737,0.00009357248,0.00014165214],"about_ca_topic_score_codex":0.000006793438,"about_ca_topic_score_gemma":0.0000024204617,"teacher_disagreement_score":0.5588323,"about_ca_system_score_codex":0.000018745142,"about_ca_system_score_gemma":0.0000061918236,"threshold_uncertainty_score":0.48296666},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Quadratic equation; Sequential quadratic programming; Geometry","score_opus":0.007785666697622099,"score_gpt":0.23544298419849105,"score_spread":0.22765731750086896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999004550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009022885,0.000046293928,0.97639775,0.0039919843,0.00024012795,0.00047873834,0.0000012024024,0.00034193989,0.018492913],"genre_scores_gemma":[0.044151437,0.00027642617,0.95294875,0.0006275635,0.00009620572,0.00013180995,0.000094096584,0.000036053007,0.0016376871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801207,0.00030934307,0.00040377516,0.00042509398,0.00044316688,0.00040655542],"domain_scores_gemma":[0.9984979,0.00018224232,0.0002013131,0.0007050864,0.0002800428,0.00013341986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077048555,0.00019256346,0.00015771446,0.00009560929,0.00074812054,0.00085799,0.0008714455,0.00008404893,0.000051133822],"category_scores_gemma":[0.00022119384,0.00013920382,0.00006583469,0.00074150914,0.000082388244,0.0009862737,0.00016799304,0.00014131259,0.000041473377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048030465,0.000014714275,0.00003809469,0.0000075108183,0.00000782426,2.1504749e-7,0.00016971769,0.91652113,0.000010043775,0.07848099,0.00046418142,0.0042807595],"study_design_scores_gemma":[0.000400867,0.000074202275,0.00002498263,0.000018269682,0.0000051212805,0.0000027500612,0.000024147823,0.9949742,0.00005113534,0.0014492994,0.002776656,0.00019836017],"about_ca_topic_score_codex":0.000008087029,"about_ca_topic_score_gemma":0.000005786737,"teacher_disagreement_score":0.078453064,"about_ca_system_score_codex":0.000049310867,"about_ca_system_score_gemma":0.00006669731,"threshold_uncertainty_score":0.8273617},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00380459814755335,"score_gpt":0.1846824485308133,"score_spread":0.18087785038325996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000678401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72559494,0.0005167913,0.22385523,0.000234185,0.00047754264,0.0004317184,0.000031683034,0.0006764092,0.04818152],"genre_scores_gemma":[0.99853015,0.000049297018,0.0011241785,0.00006620292,0.000022673725,0.0000037268178,0.00003507978,0.000014014209,0.0001546519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958783,0.000018852485,0.00010443738,0.00010031096,0.00007631211,0.0001122591],"domain_scores_gemma":[0.99980474,0.000012282107,0.000014735866,0.00011239244,0.000012059351,0.000043785785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062055944,0.00009355565,0.00008269633,0.00005851524,0.000041039482,0.000033909073,0.00003911112,0.00004386161,0.00004317407],"category_scores_gemma":[0.0000070771375,0.00008593677,0.000019480402,0.0000990917,0.000011396675,0.00012130932,0.000003111316,0.00005181114,0.0000071514446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129553055,0.0000047431267,0.000027085467,0.000009332726,0.000008057647,0.0000013651714,0.00015857331,0.9848409,0.0004809269,0.012513533,0.00037961488,0.0015628632],"study_design_scores_gemma":[0.0005140448,0.00018839978,0.0014947478,0.00006205543,0.000017048375,0.000003489664,0.00013239255,0.9937773,0.00072239764,0.002136949,0.00065103645,0.00030015918],"about_ca_topic_score_codex":0.0000011484726,"about_ca_topic_score_gemma":7.792742e-7,"teacher_disagreement_score":0.27293524,"about_ca_system_score_codex":0.000012281886,"about_ca_system_score_gemma":0.0000017871057,"threshold_uncertainty_score":0.35044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01482290958933528,"score_gpt":0.2092666094721759,"score_spread":0.19444369988284063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002576503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032578453,0.0002081937,0.99409395,0.00016182389,0.00007767681,0.00085380167,0.000043570224,0.00051569514,0.0040126904],"genre_scores_gemma":[0.1510077,0.00014081539,0.8471633,0.00007164814,0.00013820504,0.00024030724,0.00091676845,0.00009588218,0.0002253493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886775,0.00002449899,0.0002996477,0.00029202932,0.00019078376,0.00032530428],"domain_scores_gemma":[0.9992503,0.00013344864,0.000102100465,0.0003054348,0.00013781826,0.00007090391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013195141,0.0002665272,0.00018276359,0.00009283417,0.00030737725,0.000117217445,0.00014779961,0.00011314946,0.000021326796],"category_scores_gemma":[0.00004989019,0.00019348224,0.000055124587,0.00027348145,0.00006616258,0.00037493123,0.000024821533,0.00014132564,0.0000018798297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041515043,0.00003457156,0.0000059231825,0.000039596944,0.000043355496,2.0648896e-7,0.0002461735,0.9972475,0.000016266195,0.0008836663,0.00012876825,0.0013124492],"study_design_scores_gemma":[0.00061736983,0.000076543234,0.0000028301629,0.000025362358,0.000094489034,0.0000038287512,0.000119575794,0.99785835,0.0003072831,0.000027077229,0.00056939543,0.00029791816],"about_ca_topic_score_codex":0.0000029834855,"about_ca_topic_score_gemma":0.0000051307356,"teacher_disagreement_score":0.15097512,"about_ca_system_score_codex":0.00009951637,"about_ca_system_score_gemma":0.000017543209,"threshold_uncertainty_score":0.78899765},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","score_opus":0.1211367297478479,"score_gpt":0.3512656153859113,"score_spread":0.23012888563806339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004802557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51647997,0.0002018354,0.48124784,0.0004803266,0.00015461218,0.00016144254,0.00010828289,0.000051020972,0.001114679],"genre_scores_gemma":[0.92946947,0.00018379981,0.07008627,0.000014285408,0.000031604694,0.0000045250963,0.00004137777,0.000008658678,0.0001600101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860436,0.000045769884,0.00046604374,0.00030822924,0.00040148915,0.00017413007],"domain_scores_gemma":[0.9987611,0.00048371346,0.0002304427,0.00023506406,0.00020053587,0.00008910615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066689134,0.000103699625,0.0001909567,0.0002660585,0.000538885,0.0000953307,0.00011192445,0.00006464822,0.000013819199],"category_scores_gemma":[0.001486432,0.00008878815,0.000046707104,0.0006802664,0.00016245642,0.0004699276,0.00007687978,0.00007021131,0.0000020511352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060536546,0.000016034006,0.026291508,0.000006062977,0.000023374598,0.0000022816619,0.0036987092,0.96661186,0.00004936731,0.0024276685,0.00013719249,0.0006754046],"study_design_scores_gemma":[0.00080689794,0.000067017965,0.027573975,0.00003283606,0.00002427132,0.000026393605,0.0005708608,0.9685028,0.00018671199,0.0018128171,0.00024153639,0.00015386232],"about_ca_topic_score_codex":0.00008590375,"about_ca_topic_score_gemma":0.000024048064,"teacher_disagreement_score":0.4129895,"about_ca_system_score_codex":0.000011883963,"about_ca_system_score_gemma":0.000030359779,"threshold_uncertainty_score":0.41447225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Transitive relation; Discrete mathematics; Path (computing); Computer science","score_opus":0.006986559510435831,"score_gpt":0.18918722940017602,"score_spread":0.18220066988974018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006549279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8769119,0.00013746729,0.113679565,0.000013950151,0.0002517546,0.00019498574,0.000019988041,0.00022663208,0.008563748],"genre_scores_gemma":[0.99938405,0.000085925385,0.00032823274,0.000007780572,0.000019870651,0.000015046843,0.000084210966,0.000026536442,0.000048355716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936414,0.000041875097,0.00018795012,0.00013211273,0.00009600016,0.00017792097],"domain_scores_gemma":[0.99976635,0.000026494614,0.000020272206,0.00012267439,0.000016410817,0.000047791593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056884215,0.00013121645,0.00014403767,0.00013813385,0.000060533424,0.000012416623,0.000069854286,0.00007710901,0.00004659355],"category_scores_gemma":[0.000008413016,0.00012846477,0.00005918494,0.0003300799,0.000037300764,0.00022103504,0.000004583814,0.00008234705,0.000008139655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010135084,0.000018327884,0.0073704496,0.000018942095,0.000015468562,0.00000864394,0.0034626476,0.9879148,0.00045328043,0.0006412019,0.000032664833,0.00005342419],"study_design_scores_gemma":[0.0005985959,0.00005146659,0.015017474,0.000060033562,0.000011700972,0.000009235708,0.0012392071,0.97969145,0.0025547585,0.0002821531,0.000091197166,0.0003927489],"about_ca_topic_score_codex":0.000024932686,"about_ca_topic_score_gemma":0.000017392795,"teacher_disagreement_score":0.12247213,"about_ca_system_score_codex":0.000022204646,"about_ca_system_score_gemma":0.000005264064,"threshold_uncertainty_score":0.52386415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05474765679449342,"score_gpt":0.31433579169288123,"score_spread":0.25958813489838783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008488464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113098346,0.00041108465,0.8681722,0.0009884197,0.00027581677,0.0003648154,0.000017419025,0.00012343378,0.016548423],"genre_scores_gemma":[0.66505307,0.00009179959,0.3333602,0.0000727994,0.00006777324,0.000022690889,0.00004435941,0.000018389534,0.0012689638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709046,0.00012725196,0.00062836165,0.0005519423,0.0012093614,0.00039263946],"domain_scores_gemma":[0.99839634,0.0002366873,0.00034786685,0.00043099982,0.00043350144,0.0001545899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649213,0.00020518925,0.0002869747,0.0002319628,0.0008845376,0.00028130054,0.00041006596,0.00008384445,0.00038959953],"category_scores_gemma":[0.00048921525,0.00013985147,0.00009913357,0.0012382598,0.00015415408,0.0007035015,0.00004716985,0.00017250571,0.00004635176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004564511,0.000049003167,0.0070408788,0.0000029204637,0.000028848985,0.000009457528,0.0016052956,0.98868215,0.00007449938,0.0004701262,0.00049992686,0.0014912495],"study_design_scores_gemma":[0.0013107071,0.00021476808,0.0040686536,0.00016620908,0.000067443936,0.00008633085,0.0025900921,0.98538876,0.0006078221,0.0022928263,0.0026050506,0.0006013445],"about_ca_topic_score_codex":0.00006235853,"about_ca_topic_score_gemma":0.000044976096,"teacher_disagreement_score":0.5519547,"about_ca_system_score_codex":0.0000752917,"about_ca_system_score_gemma":0.00019293846,"threshold_uncertainty_score":0.6803237},"labels":[],"label_agreement":null},{"id":"W2010049762","doi":"10.1016/j.disopt.2006.01.001","title":"Facets of the independent path-matching polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Matching (statistics); Mathematics; Combinatorics; Path (computing); Birkhoff polytope; Convex polytope; Independent set; Convex hull; Intersection (aeronautics); Matroid; Regular polygon; Convex set; Computer science; Convex optimization; Graph","score_opus":0.007936245868375578,"score_gpt":0.2477247421725551,"score_spread":0.23978849630417953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010049762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012393355,0.000060010156,0.9832856,0.0003572616,0.000112631526,0.00018178491,0.0000040722102,0.000047250032,0.003558018],"genre_scores_gemma":[0.9390572,0.0000069548905,0.06050607,0.00003686908,0.000018283721,0.000007762536,0.0000059979243,0.000008773607,0.00035214404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989373,0.000111038986,0.0001838541,0.00020522777,0.0003822888,0.00018028163],"domain_scores_gemma":[0.9992502,0.00004065346,0.000115734525,0.00048792383,0.0000792416,0.000026243786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022232924,0.00008263501,0.000087918386,0.00006501845,0.000134912,0.00006430189,0.0007227067,0.000039894112,0.000015170617],"category_scores_gemma":[0.000029295143,0.000058668455,0.000057477777,0.00046888413,0.000057986257,0.0004235035,0.00029615447,0.00010793412,0.0000037940338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038972144,0.000017120277,0.00086230313,0.0000057415255,0.0000034982043,7.2712385e-7,0.00017746033,0.8402511,0.0018683865,0.15598346,0.000026207517,0.0008000817],"study_design_scores_gemma":[0.00050907413,0.00004541298,0.008655564,0.00005619941,0.0000062706613,0.00000791356,0.000093281196,0.88431144,0.018414745,0.08750283,0.00014643246,0.0002508454],"about_ca_topic_score_codex":0.000055734174,"about_ca_topic_score_gemma":0.000009056662,"teacher_disagreement_score":0.9266638,"about_ca_system_score_codex":0.000026084314,"about_ca_system_score_gemma":0.000033137378,"threshold_uncertainty_score":0.23924302},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005526421708420291,"score_gpt":0.22781572212310086,"score_spread":0.22228930041468056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013219867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031201102,0.0001040457,0.99702364,0.000094186355,0.00034773193,0.0004985542,0.0000054274706,0.0009165739,0.00069781666],"genre_scores_gemma":[0.045972828,0.000091939866,0.95332617,0.000025403895,0.0003166869,0.00013941358,0.000052831845,0.000051110397,0.0000236373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993381,0.0000059389786,0.0001484265,0.00014937346,0.00007691294,0.0002812301],"domain_scores_gemma":[0.9994774,0.0001148508,0.000029409817,0.00030045438,0.000042179163,0.000035718713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001231435,0.00012592963,0.000098235745,0.000017516411,0.0001620234,0.000061745406,0.00021317274,0.00011321925,0.000019317193],"category_scores_gemma":[0.000030245816,0.000092246475,0.000033188517,0.00021593239,0.000052439118,0.00025100645,0.000022453381,0.00021688675,0.000002187807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016580857,0.0000029440107,0.000019787685,0.000004923098,0.000009787014,1.660112e-7,0.000018791843,0.8902695,0.00012037598,0.0019466797,0.00015028131,0.10745508],"study_design_scores_gemma":[0.00011615926,0.00003024691,0.000044434575,0.000008250072,0.00001576469,0.0000013405789,0.000035233283,0.9962278,0.00014780424,0.0016060558,0.0016298584,0.00013704339],"about_ca_topic_score_codex":0.0000011288422,"about_ca_topic_score_gemma":0.000006842261,"teacher_disagreement_score":0.107318036,"about_ca_system_score_codex":0.0000161061,"about_ca_system_score_gemma":0.0000046280475,"threshold_uncertainty_score":0.37617022},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011853492358565813,"score_gpt":0.2624375729190806,"score_spread":0.2505840805605148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015967296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004269584,0.00015569078,0.9901495,0.0020115247,0.00011766982,0.00072748004,0.000010475843,0.00013693872,0.006648043],"genre_scores_gemma":[0.15684378,0.00008280433,0.83694595,0.000299849,0.00027160093,0.00063615065,0.00013956799,0.000058862275,0.004721412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889207,0.000061856124,0.0001782319,0.000305575,0.0002364664,0.00032581834],"domain_scores_gemma":[0.9990562,0.00018587406,0.00008127585,0.00049998664,0.0001407595,0.000035871188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488966,0.00011803397,0.00009082053,0.000072123505,0.00034885496,0.00017051006,0.00074936746,0.000042630814,0.000042229694],"category_scores_gemma":[0.000039861363,0.00007956,0.00007469219,0.00044129512,0.0000793549,0.0005069401,0.0001317729,0.00007919474,0.000016216134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013726218,0.00001501206,0.000040562263,0.000006921211,0.000007052126,4.1055526e-7,0.00006619934,0.28003088,0.00009977879,0.715303,0.00055002334,0.0038664648],"study_design_scores_gemma":[0.00027309818,0.000038360115,0.00004181915,0.00000640331,0.0000049898126,0.0000019318366,0.000013871437,0.80222696,0.0008378217,0.19280858,0.003628142,0.00011800127],"about_ca_topic_score_codex":0.000012308842,"about_ca_topic_score_gemma":0.00000538228,"teacher_disagreement_score":0.5224944,"about_ca_system_score_codex":0.000026795888,"about_ca_system_score_gemma":0.000026978701,"threshold_uncertainty_score":0.32443625},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014338220414387697,"score_gpt":0.2744137807614725,"score_spread":0.2600755603470848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020257725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010052926,0.00006947979,0.9847389,0.0005828374,0.00027507255,0.0007669163,0.00013921305,0.00030520247,0.012117128],"genre_scores_gemma":[0.67414993,0.00016793754,0.29330346,0.0001967869,0.0010737034,0.00038566912,0.009865349,0.00011219363,0.020744959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988123,0.00006566128,0.0002882988,0.00027142023,0.00028772876,0.00027459167],"domain_scores_gemma":[0.9994003,0.000054855744,0.0001286208,0.000110863955,0.0002385134,0.000066819106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037509133,0.0001251364,0.00012937633,0.00008845861,0.0005085746,0.00019543181,0.00012160723,0.00011879132,0.00023804483],"category_scores_gemma":[0.000052103114,0.00013006815,0.00006002594,0.00026058315,0.00006889451,0.00042049983,0.0000050837652,0.000047012374,0.000017082286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013340914,0.000039309045,0.0011880851,0.0000075490766,0.0000068415916,7.350832e-7,0.0011478631,0.9932056,0.00008134489,0.0025771589,0.0012796883,0.00045246846],"study_design_scores_gemma":[0.0009106224,0.00009024787,0.0012588467,0.00005973823,0.00007215713,7.941072e-7,0.00059199973,0.9790028,0.00012397589,0.00092676,0.016499484,0.0004625884],"about_ca_topic_score_codex":0.00062271795,"about_ca_topic_score_gemma":0.0002021682,"teacher_disagreement_score":0.6914354,"about_ca_system_score_codex":0.0000560503,"about_ca_system_score_gemma":0.000076941746,"threshold_uncertainty_score":0.53040254},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02141643991881777,"score_gpt":0.3003653373785734,"score_spread":0.27894889745975565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023058821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46422416,0.00018961409,0.5170193,0.002128881,0.00011493851,0.0007569846,0.000013174673,0.0003507573,0.015202206],"genre_scores_gemma":[0.9062754,0.000036651993,0.09319792,0.00014901112,0.00008648246,0.000016219252,0.00003992498,0.000010920285,0.00018749644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993386,0.000045894714,0.00018213667,0.000191499,0.00008182225,0.000160013],"domain_scores_gemma":[0.99951565,0.00008085041,0.000076580094,0.00024064914,0.00003059959,0.000055673805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002731769,0.000099523524,0.0001108173,0.000023106175,0.00019371072,0.000055203214,0.00007525214,0.00005812281,0.000043914857],"category_scores_gemma":[0.00008012222,0.00009127744,0.000036279078,0.00013771592,0.000047195106,0.00013796354,0.000019330175,0.000078147415,0.0000022966992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005411108,0.00010946682,0.0009762539,0.000045758912,0.000025903977,0.0000021425965,0.000658372,0.13008282,0.00010804138,0.8627055,0.001493843,0.0037377893],"study_design_scores_gemma":[0.00024593406,0.00005837865,0.0024612253,0.000037103146,0.00006817723,0.000010444177,0.000027713633,0.118007705,0.00007147535,0.87819946,0.00062440324,0.00018795488],"about_ca_topic_score_codex":9.772453e-7,"about_ca_topic_score_gemma":0.0000011850515,"teacher_disagreement_score":0.4420512,"about_ca_system_score_codex":0.00001162562,"about_ca_system_score_gemma":0.000006813739,"threshold_uncertainty_score":0.3722186},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Minimax; Mathematics; Ackermann function; Interval (graph theory); Euclidean geometry; Mathematical optimization; Combinatorics; Function (biology); Facility location problem; Euclidean distance; Inverse; Statistics; Geometry","score_opus":0.018481360770615185,"score_gpt":0.20495056616455862,"score_spread":0.18646920539394343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030028156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07553337,0.000068660134,0.7106835,0.07604997,0.00052211276,0.0035428684,0.00004384221,0.0008459051,0.13270973],"genre_scores_gemma":[0.9951908,0.000011328077,0.00048575646,0.0025606262,0.00019000933,0.000089933346,0.0006351628,0.000010487921,0.0008258825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990685,0.00001521847,0.00020477451,0.00025335787,0.000286018,0.00017212344],"domain_scores_gemma":[0.9994213,0.000012564836,0.0000740622,0.00030984622,0.00017276283,0.000009494125],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030331287,0.0001449539,0.00008583332,0.00008272759,0.00025038156,0.00016617043,0.00016575903,0.00003341896,0.0010289345],"category_scores_gemma":[0.00006058652,0.00009150859,0.000026096752,0.0004635595,0.000048111626,0.00060559704,0.00003676491,0.000078129924,0.0004502689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038977138,0.000044276858,0.0003752138,0.000044750926,0.000012452755,1.0639013e-7,0.000060700462,0.9819416,0.0000033928343,0.013173147,0.0022538707,0.002051547],"study_design_scores_gemma":[0.00029224815,0.00001663445,0.0012744685,0.000028095637,0.000025006779,1.5402111e-7,0.00025041038,0.9329316,0.000012969061,0.00009170177,0.0648963,0.00018041905],"about_ca_topic_score_codex":0.00041963998,"about_ca_topic_score_gemma":0.0006501616,"teacher_disagreement_score":0.91965747,"about_ca_system_score_codex":0.00004801088,"about_ca_system_score_gemma":0.00001148478,"threshold_uncertainty_score":0.99988425},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05430893569011083,"score_gpt":0.26720224455301966,"score_spread":0.21289330886290883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036207413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01686083,0.0001664934,0.9393926,0.001251513,0.00024004072,0.00041894885,0.0003100584,0.000059858008,0.041299604],"genre_scores_gemma":[0.9843713,0.0000990211,0.011975876,0.00063023233,0.00012077859,0.000018960296,0.00014122155,0.00003211678,0.002610517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908274,0.000071765506,0.00028845924,0.00014676065,0.00024982676,0.00016044077],"domain_scores_gemma":[0.9988806,0.00041777958,0.00021394536,0.0003793789,0.00007360965,0.000034655448],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019309045,0.00013599702,0.00017043302,0.000035805555,0.000121831705,0.000051964744,0.0002682432,0.000055980934,0.0010608827],"category_scores_gemma":[0.0002709685,0.00007242124,0.000070235146,0.00023319117,0.000054713586,0.00014108092,0.000033759035,0.000104164115,0.000013543169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002962884,0.00015043409,0.001843939,0.000105603394,0.00019325857,0.0000039727074,0.016549602,0.0009841262,0.00001691208,0.95335734,0.0262028,0.00029569835],"study_design_scores_gemma":[0.004802504,0.0006583886,0.006184672,0.0012631946,0.0004822001,0.00001357835,0.010498675,0.101977825,0.007970606,0.83750695,0.02695018,0.0016912152],"about_ca_topic_score_codex":0.00020720325,"about_ca_topic_score_gemma":0.000023494898,"teacher_disagreement_score":0.96751046,"about_ca_system_score_codex":0.00001788797,"about_ca_system_score_gemma":0.00003086287,"threshold_uncertainty_score":0.9998523},"labels":[],"label_agreement":null},{"id":"W2041745502","doi":"10.1016/j.disopt.2010.08.004","title":"Generalized resolution search","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Resolution (logic); Mathematics; Mathematical optimization; Branch and bound; Flexibility (engineering); Process (computing); Guided Local Search; Algorithm; Search algorithm; Computer science; Artificial intelligence","score_opus":0.011816408719509652,"score_gpt":0.2546175475482703,"score_spread":0.24280113882876067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041745502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004244527,0.000008267522,0.9873836,0.0013608208,0.0006043422,0.00016975799,0.0000026837354,0.00029359572,0.005932389],"genre_scores_gemma":[0.37308958,0.000029702593,0.62611467,0.00019157307,0.00008361483,0.000013287509,0.00007173539,0.000011426206,0.00039440749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.00006247719,0.00019186328,0.00029931637,0.00024403723,0.00019985017],"domain_scores_gemma":[0.9992739,0.000023093491,0.00006128454,0.00039788382,0.0001484319,0.00009540353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023044967,0.000106409374,0.00008753308,0.00014867671,0.00020210409,0.00022194548,0.00028406532,0.000093493436,0.00037994696],"category_scores_gemma":[0.00005654201,0.00010542213,0.000047805195,0.00044260695,0.000047792924,0.00077744445,0.00008047161,0.0001768784,0.000044749482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006647,0.000015805035,0.00048855075,0.0000033076658,0.000006343714,0.0000015402544,0.00022562301,0.8628638,0.0021424233,0.12124784,0.00029747427,0.012700655],"study_design_scores_gemma":[0.00031893933,0.000015243349,0.0011254238,0.0000030191502,0.0000032320008,0.000011231493,0.000013980407,0.9965625,0.0008374019,0.00022138855,0.0007495973,0.00013807816],"about_ca_topic_score_codex":0.000024691471,"about_ca_topic_score_gemma":0.000025420182,"teacher_disagreement_score":0.36884505,"about_ca_system_score_codex":0.000023446115,"about_ca_system_score_gemma":0.000064158055,"threshold_uncertainty_score":0.42989898},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011725880689997945,"score_gpt":0.19932865616627973,"score_spread":0.1876027754762818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064816527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012417078,0.0013267805,0.9811237,0.00024179068,0.00012229275,0.00061929156,0.000024956811,0.00069814303,0.003425999],"genre_scores_gemma":[0.5418719,0.0012621032,0.45527253,0.000043861204,0.000092653274,0.0000771334,0.00024261697,0.00013931037,0.0009978941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856305,0.000050381543,0.00035176074,0.0003339689,0.00034448496,0.00035632428],"domain_scores_gemma":[0.99934447,0.00006695664,0.00009761749,0.0002505655,0.000116472904,0.00012394854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024601162,0.00028485316,0.00020220071,0.00007219983,0.00058105664,0.00019198666,0.00017403539,0.00010445341,0.000040500287],"category_scores_gemma":[0.000028394728,0.00021176333,0.000033842807,0.00026443126,0.00012135493,0.00032936904,0.00003874699,0.00022786568,0.000017265544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016174075,0.000015364769,0.00024402484,0.000030611816,0.000047282392,0.000007513815,0.00051492057,0.99761814,0.0004549061,0.00006309851,0.000008551435,0.0009794261],"study_design_scores_gemma":[0.00055952807,0.000071666975,0.000018716231,0.00008681413,0.000034284163,0.00012857556,0.000116455994,0.99750715,0.001081247,0.00004465852,0.00003159177,0.00031933564],"about_ca_topic_score_codex":0.000016283213,"about_ca_topic_score_gemma":0.000017593033,"teacher_disagreement_score":0.5294548,"about_ca_system_score_codex":0.000078471334,"about_ca_system_score_gemma":0.00003629341,"threshold_uncertainty_score":0.86354584},"labels":[],"label_agreement":null},{"id":"W2065255395","doi":"10.1016/j.disopt.2009.01.004","title":"On the feedback vertex set polytope of a series–parallel graph","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Polytope; Pathwidth; Indifference graph; Feedback vertex set; Discrete mathematics; Subdivision; Graph; Line graph","score_opus":0.016480448800378945,"score_gpt":0.2701992797922433,"score_spread":0.2537188309918643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065255395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00224272,0.0000473959,0.9860125,0.00419256,0.0000711274,0.00028128776,0.0000070895635,0.00007463003,0.007070678],"genre_scores_gemma":[0.90322816,0.00009695882,0.09507663,0.0008130573,0.00001740222,0.000017894079,0.000026721336,0.000014722997,0.0007084416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988312,0.00013432962,0.00018631617,0.00026778964,0.00034121377,0.00023911968],"domain_scores_gemma":[0.9989482,0.00011230313,0.00009598156,0.0006789694,0.00010573534,0.000058803224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025986845,0.00012463023,0.00012926818,0.00012273646,0.00015185367,0.000076840835,0.00080416095,0.00004533764,0.000056592096],"category_scores_gemma":[0.00011552829,0.000086952365,0.000070576665,0.00083210727,0.00009980366,0.000611685,0.000085114785,0.00012480721,0.000016812794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067145425,0.00002314793,0.000016295562,0.0000027021747,0.000007980218,0.0000017045151,0.0002729674,0.329119,0.00016735496,0.668322,0.00049356127,0.0015061127],"study_design_scores_gemma":[0.0006361553,0.00075095345,0.000995064,0.000055388973,0.0000072170237,0.000009451831,0.00012258424,0.6572419,0.00257904,0.337143,0.00016151239,0.00029773565],"about_ca_topic_score_codex":0.0000029628873,"about_ca_topic_score_gemma":9.765682e-7,"teacher_disagreement_score":0.9009855,"about_ca_system_score_codex":0.000017745262,"about_ca_system_score_gemma":0.000030685234,"threshold_uncertainty_score":0.35458145},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05271715870122828,"score_gpt":0.27900776822092493,"score_spread":0.22629060951969665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068748054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035883848,0.00013529838,0.9603801,0.00002908441,0.00027137084,0.00025318906,0.000009183523,0.0003765376,0.002661397],"genre_scores_gemma":[0.6282443,0.000074192656,0.371456,0.000024177873,0.00004829127,0.000013332101,0.000037638638,0.00006570903,0.000036379213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987544,0.000108932894,0.00033413534,0.000260067,0.00015274767,0.00038975652],"domain_scores_gemma":[0.9994308,0.000074197684,0.00008597912,0.00021336057,0.000076679986,0.00011903116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038168253,0.00022267015,0.00020228662,0.00018731649,0.0003151978,0.00012065222,0.00012404336,0.00013024078,0.00016285504],"category_scores_gemma":[0.00010812444,0.00024203972,0.00004950493,0.00034356464,0.000051300194,0.0006269599,0.00006282007,0.00017930164,0.000006673576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008812529,0.000009882788,0.0007133554,0.000049358317,0.000028220815,0.00000231801,0.001660003,0.9954739,0.0006251348,0.0005663254,0.000014132662,0.00084851345],"study_design_scores_gemma":[0.00027104546,0.000011184008,0.0003237609,0.000109626664,0.00005105129,0.000010883935,0.00045996025,0.9973753,0.00097207195,0.00010533846,0.000020876243,0.00028887144],"about_ca_topic_score_codex":0.000114918425,"about_ca_topic_score_gemma":0.000014323525,"teacher_disagreement_score":0.59236044,"about_ca_system_score_codex":0.00010915653,"about_ca_system_score_gemma":0.000021732307,"threshold_uncertainty_score":0.98700935},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Negativity effect; Lattice (music); Algorithm; Cognitive psychology; Psychology; Physics","score_opus":0.013313346936846226,"score_gpt":0.2658952204674746,"score_spread":0.2525818735306284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070134421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10494244,0.000012428805,0.8870531,0.000038718474,0.0006417223,0.00018364539,0.000017246097,0.00041645815,0.006694266],"genre_scores_gemma":[0.385296,0.000008692391,0.61436874,0.000015905198,0.00013530925,0.000007107777,0.00003655844,0.00006977809,0.00006190988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881065,0.000057814723,0.00033311007,0.00025332693,0.0002258604,0.0003192316],"domain_scores_gemma":[0.99904203,0.00010494564,0.00009204416,0.0005437571,0.00010318103,0.00011403293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003803287,0.00022752552,0.00020340385,0.00014432122,0.0001739052,0.00012180242,0.0002672225,0.00017776119,0.00020264921],"category_scores_gemma":[0.0003743549,0.00024991995,0.00006347978,0.00044507044,0.000050383307,0.0005040528,0.00008008471,0.000371314,0.000009517537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035571927,0.000008318727,0.0008038559,0.000023472521,0.00001912487,0.000001168057,0.00024092369,0.98724955,0.010337116,0.00017995831,0.000063457934,0.0010695003],"study_design_scores_gemma":[0.0004028547,0.000008804565,0.00027233697,0.000025754463,0.000033252374,0.000006219895,0.00003992092,0.9914193,0.0072940877,0.00010414452,0.00010321988,0.0002900806],"about_ca_topic_score_codex":0.000018217215,"about_ca_topic_score_gemma":0.000012409378,"teacher_disagreement_score":0.28035355,"about_ca_system_score_codex":0.00004780588,"about_ca_system_score_gemma":0.000027329823,"threshold_uncertainty_score":0.9999953},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010305201646056453,"score_gpt":0.26270929347325445,"score_spread":0.252404091827198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077167828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037973376,0.000019434714,0.99373573,0.00020543076,0.0015898142,0.00040300493,0.00002510631,0.000129542,0.00009461177],"genre_scores_gemma":[0.029580137,0.000021231088,0.9695107,0.00010070152,0.00021387222,0.00008010321,0.00011707068,0.000017967102,0.000358267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899185,0.000018132723,0.00017980617,0.00043554374,0.00015169627,0.00022300129],"domain_scores_gemma":[0.9992567,0.00007300564,0.00008506013,0.00035353468,0.00010489103,0.0001268246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001789593,0.00013524339,0.0001250631,0.000117939744,0.00022992116,0.00029438516,0.00027148623,0.00008648187,0.000017956134],"category_scores_gemma":[0.00010809088,0.00012476713,0.000035329525,0.00023847578,0.000018688374,0.00076588575,0.000196644,0.00013291556,0.0000073183687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002595147,0.000063739404,0.00020182905,0.00002123596,0.00002102769,0.0000021482183,0.0005385537,0.021949766,0.005255904,0.0036752864,0.0038060613,0.9644385],"study_design_scores_gemma":[0.00031956282,0.000081983555,0.00019554916,0.00002377579,0.0000065217023,0.000009952775,0.00001121069,0.9916376,0.005137717,0.00011275106,0.0022890898,0.0001742696],"about_ca_topic_score_codex":0.000017052744,"about_ca_topic_score_gemma":0.0000026913917,"teacher_disagreement_score":0.9696879,"about_ca_system_score_codex":0.0000158799,"about_ca_system_score_gemma":0.000024152276,"threshold_uncertainty_score":0.5087856},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Edmond de Rothschild Foundation; University of Haifa","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Transitive relation; Vertex (graph theory); Discrete mathematics; Time complexity; Graph","score_opus":0.010924037940400132,"score_gpt":0.2639048718195904,"score_spread":0.25298083387919024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081923266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057341423,0.00019637374,0.93987924,0.00026993753,0.000051784264,0.0002731009,0.000010229439,0.000117273405,0.0018606499],"genre_scores_gemma":[0.9238585,0.000077792356,0.07584306,0.0000399538,0.000015314628,0.00002508715,0.00006502044,0.000017136515,0.000058094563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985307,0.0001463612,0.0002480313,0.0004708122,0.00024649917,0.000357607],"domain_scores_gemma":[0.9993797,0.00013773215,0.00007079874,0.00028053718,0.000064115346,0.000067142566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023788451,0.00016813727,0.00018152481,0.0003509352,0.00015816277,0.00014276139,0.00030819795,0.000070224414,0.0000122235715],"category_scores_gemma":[0.000026395539,0.00016567667,0.00004182166,0.00089521974,0.000114733986,0.0008711408,0.00009719954,0.00015441429,0.0000033007425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019776604,0.00038675973,0.015268351,0.000086416534,0.000046267105,0.00011153561,0.002767106,0.2750591,0.013919096,0.6678979,0.00007437456,0.02418538],"study_design_scores_gemma":[0.00072912103,0.00007212375,0.014015041,0.000059938076,0.000004274228,0.000010427331,0.000080966754,0.9417709,0.0014910125,0.04147549,0.000027821292,0.00026288067],"about_ca_topic_score_codex":0.00006630516,"about_ca_topic_score_gemma":0.00005940466,"teacher_disagreement_score":0.8665171,"about_ca_system_score_codex":0.00004638874,"about_ca_system_score_gemma":0.000022519405,"threshold_uncertainty_score":0.6756099},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Scheduling (production processes); Computer science; Path (computing); Time complexity; Node (physics); Computer network; Distributed computing; Mathematical optimization; Mathematics; Algorithm; Engineering","score_opus":0.024719906679499283,"score_gpt":0.27085628613100643,"score_spread":0.24613637945150715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084046657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015969684,0.00022445046,0.98644334,0.0006331061,0.0005907208,0.0003215567,0.0000022778645,0.00026940877,0.011355455],"genre_scores_gemma":[0.41316062,0.0006472453,0.5833369,0.00021254571,0.00025747225,0.0001153531,0.0002190646,0.00003685572,0.0020139525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986262,0.00012638443,0.00029705817,0.00024547373,0.00033226653,0.0003726293],"domain_scores_gemma":[0.99911106,0.000013119586,0.00013014281,0.0004044706,0.00016477091,0.00017646584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004384249,0.00013510272,0.000102211,0.00012366204,0.00020163815,0.00012271572,0.0003541439,0.00007312315,0.00025791215],"category_scores_gemma":[0.00006793436,0.00012537107,0.00004775721,0.0006464201,0.000018380175,0.0025496327,0.00011275467,0.000093105984,0.00009888375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002932874,0.00008609896,0.0029206316,0.00002203896,0.000009745966,3.3624312e-7,0.0016889881,0.91582215,0.00013750551,0.074061215,0.003189594,0.0020587516],"study_design_scores_gemma":[0.00018918501,0.000041442225,0.0005430616,0.000011345195,0.0000041347225,0.0000026148111,0.000027442726,0.9946676,0.00008001074,0.00042434732,0.0038081799,0.00020061954],"about_ca_topic_score_codex":0.000009646862,"about_ca_topic_score_gemma":0.0000015899009,"teacher_disagreement_score":0.41300094,"about_ca_system_score_codex":0.00004621119,"about_ca_system_score_gemma":0.000033122113,"threshold_uncertainty_score":0.5112484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08774811797470744,"score_gpt":0.42137295086084653,"score_spread":0.3336248328861391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087975652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013215509,0.00016765489,0.9901849,0.0036554504,0.00007191705,0.00074253546,0.000027725036,0.00007199442,0.0037562742],"genre_scores_gemma":[0.023766117,0.0013433121,0.9690571,0.00085416145,0.00013337225,0.00018805086,0.00007312296,0.000078516074,0.0045062415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982032,0.000601595,0.00026668076,0.00028302387,0.00039551142,0.00024996558],"domain_scores_gemma":[0.99701595,0.0022997065,0.00014566218,0.00033778782,0.0001415978,0.000059289043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094412616,0.00017989027,0.00021190106,0.000102017315,0.0007858965,0.000100422265,0.00016392542,0.00007937811,0.0002807364],"category_scores_gemma":[0.0019418538,0.00009985884,0.000049908052,0.0003824595,0.00043689352,0.00028958637,0.00012357031,0.00029178915,0.0000050362573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079566997,0.000094091796,0.00013932174,0.00004510434,0.0001848745,0.000009507422,0.0045531197,0.45610914,0.000042191532,0.5285299,0.006890368,0.0026067595],"study_design_scores_gemma":[0.0011295275,0.000047242294,0.000053261927,0.00001573974,0.000024909348,0.00005404987,0.000532626,0.9769164,0.00014296161,0.020290464,0.0006310538,0.00016177337],"about_ca_topic_score_codex":0.000042407002,"about_ca_topic_score_gemma":0.0000025465856,"teacher_disagreement_score":0.52080727,"about_ca_system_score_codex":0.000041151252,"about_ca_system_score_gemma":0.00007267009,"threshold_uncertainty_score":0.604456},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022019800699498385,"score_gpt":0.2781955289469787,"score_spread":0.2561757282474803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088165054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016639743,0.0002031214,0.9957844,0.0006144092,0.00014234975,0.0011250497,0.000045074157,0.0004076051,0.001511599],"genre_scores_gemma":[0.12783661,0.00009212217,0.870411,0.00038395848,0.00013979811,0.000115337236,0.0003480818,0.00010617458,0.00056694524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794525,0.00020669677,0.00043035878,0.00038411326,0.00038378834,0.00064981676],"domain_scores_gemma":[0.9989017,0.00021445153,0.00005316631,0.00045630487,0.00023713811,0.00013722424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012283691,0.00027899363,0.00027555818,0.00011999349,0.0003640782,0.00018840986,0.00032420247,0.00018482505,0.00010849772],"category_scores_gemma":[0.000060940733,0.00023193202,0.0001068213,0.00055220246,0.000052548123,0.00023113022,0.00006530378,0.00029805783,0.000008129137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051238174,0.0000512546,0.00006571642,0.00003722892,0.00005255341,6.434843e-7,0.0006749187,0.9923336,0.00052043947,0.001280794,0.0005536294,0.004378011],"study_design_scores_gemma":[0.0015237588,0.00007687167,0.00007790971,0.000039490533,0.000053632866,0.0000033864344,0.00057738036,0.9940298,0.00211534,0.000042140426,0.0011741001,0.0002861613],"about_ca_topic_score_codex":0.000012112501,"about_ca_topic_score_gemma":0.0000018620677,"teacher_disagreement_score":0.12767021,"about_ca_system_score_codex":0.00018947672,"about_ca_system_score_gemma":0.000053583888,"threshold_uncertainty_score":0.9457913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00744222266980682,"score_gpt":0.2617487429915411,"score_spread":0.2543065203217343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088470271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034225236,0.00033260946,0.9922551,0.0015016445,0.00014310736,0.00027168533,0.0000020377895,0.00005826254,0.002013043],"genre_scores_gemma":[0.95992124,0.00003705149,0.039548185,0.00012177908,0.000073895484,0.000030359739,0.000014433995,0.000008791705,0.00024423638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991564,0.00015036017,0.00011139818,0.00015843996,0.00019785861,0.0002255305],"domain_scores_gemma":[0.9993926,0.00014533676,0.00006068784,0.00027881138,0.000054870714,0.000067670524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051028497,0.000088042514,0.00008885794,0.00006150728,0.00022003605,0.00015011788,0.00024222325,0.00003954644,0.000019562422],"category_scores_gemma":[0.00012041106,0.000056857887,0.000030310006,0.00029070393,0.00016231684,0.0010157188,0.00015614729,0.00009979907,0.000006437936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048473004,0.000013491625,0.00033928177,0.000007680066,0.00001255162,5.586224e-7,0.0015567717,0.056565404,0.000044430475,0.93307865,0.00008992276,0.008242778],"study_design_scores_gemma":[0.0014451331,0.000030134663,0.0014440854,0.00000824061,0.000009772786,0.000036376186,0.00010600967,0.98108673,0.0004405421,0.014884413,0.0003358666,0.00017272173],"about_ca_topic_score_codex":0.000005787086,"about_ca_topic_score_gemma":8.032125e-7,"teacher_disagreement_score":0.95649874,"about_ca_system_score_codex":0.000020824773,"about_ca_system_score_gemma":0.000011397737,"threshold_uncertainty_score":0.23185974},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024395901651674753,"score_gpt":0.315726119814678,"score_spread":0.29133021816300325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090424186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008361168,0.00016836298,0.9900421,0.0002404199,0.000096241,0.00067147,0.0000027939536,0.000026787271,0.00039064337],"genre_scores_gemma":[0.8136248,0.00021498052,0.18578462,0.000029876599,0.000042120053,0.000099722514,0.0000046953355,0.00001712823,0.00018207148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991273,0.00006579408,0.00019622597,0.00021337389,0.00019032825,0.00020697643],"domain_scores_gemma":[0.9985304,0.00076379423,0.00009120645,0.00036618262,0.0002155086,0.000032899487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017087964,0.00007588561,0.000070963106,0.00003112857,0.0004249659,0.00011261505,0.0003087338,0.00003502524,0.000004494607],"category_scores_gemma":[0.00018827649,0.00004387145,0.000048033857,0.00042924844,0.00023922302,0.00029024735,0.00006330529,0.00008092382,2.3332069e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001473191,0.0002335667,0.009292975,0.00018275202,0.0002422455,0.0000016605566,0.014386183,0.14826193,0.0015852145,0.6685717,0.00012415505,0.15564442],"study_design_scores_gemma":[0.00050038076,0.00011853892,0.0013135744,0.000016026584,0.000015600514,0.000007028231,0.0007234169,0.9233694,0.0032646589,0.0700316,0.0004910532,0.00014870489],"about_ca_topic_score_codex":0.000013344925,"about_ca_topic_score_gemma":0.000025107576,"teacher_disagreement_score":0.8052636,"about_ca_system_score_codex":0.000016565169,"about_ca_system_score_gemma":0.000029486897,"threshold_uncertainty_score":0.32685372},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04587999302022705,"score_gpt":0.29869370758595015,"score_spread":0.2528137145657231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090914983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007962426,0.00017897954,0.98210806,0.0009808035,0.00010259355,0.0006223628,0.00001696101,0.00010229908,0.0079254955],"genre_scores_gemma":[0.9434117,0.0006932203,0.054708797,0.00017303217,0.00007039579,0.00007669467,0.000071949806,0.000014845919,0.0007793625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993992,0.00006743337,0.00015760766,0.00013790614,0.00010466879,0.00013319685],"domain_scores_gemma":[0.9995687,0.00014974276,0.00008816181,0.00006017322,0.00009189454,0.00004133571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045555894,0.00007024152,0.000076873795,0.00003753749,0.0005686823,0.00007696164,0.000057222514,0.00006081179,0.000030263294],"category_scores_gemma":[0.00008671486,0.00005437969,0.000020062422,0.000112235815,0.000121619094,0.00028229842,0.000005967252,0.000041250827,3.8731022e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001453422,0.00003158209,0.026885599,0.00012739122,0.00006301232,5.406197e-7,0.2981934,0.29608694,0.000016431957,0.37082663,0.0002567832,0.007366382],"study_design_scores_gemma":[0.0045346688,0.000736515,0.06022049,0.0005292789,0.0007396126,0.0000064224305,0.09854063,0.7790857,0.0009026443,0.034325827,0.018349463,0.0020287482],"about_ca_topic_score_codex":0.0006212598,"about_ca_topic_score_gemma":0.00029026065,"teacher_disagreement_score":0.9354493,"about_ca_system_score_codex":0.0000103052835,"about_ca_system_score_gemma":0.000035357785,"threshold_uncertainty_score":0.43739024},"labels":[],"label_agreement":null},{"id":"W2094860999","doi":"10.1016/j.disopt.2005.08.003","title":"Wavelength routing of uniform instances in all-optical rings","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Wavelength; Routing (electronic design automation); Computer science; Computer network; Optoelectronics; Materials science","score_opus":0.010179135015785585,"score_gpt":0.233660605169615,"score_spread":0.22348147015382944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094860999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17926511,0.00020970512,0.7940629,0.0002585011,0.00008833157,0.00023912067,0.000004703149,0.00073040195,0.025141232],"genre_scores_gemma":[0.6792863,0.00024532166,0.32039207,0.000010260997,0.00002058406,0.000006522875,0.000011132278,0.00001747957,0.000010344672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999204,0.0000051556303,0.0003014101,0.00013036556,0.00011468133,0.00024440477],"domain_scores_gemma":[0.9997203,0.00004394823,0.00003729116,0.00014507039,0.000024371904,0.000029044133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007890248,0.00011973392,0.00016342914,0.000095121024,0.000016942842,0.00001162508,0.00012619045,0.00010446767,0.00001817491],"category_scores_gemma":[0.00008044908,0.00011785952,0.000026255744,0.0003022264,0.00006144797,0.00033113375,0.000038657123,0.00015718504,0.0000037637687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005509396,0.000008116136,0.00028464766,0.000014489029,0.0000068964214,8.262697e-7,0.00009053471,0.9593106,0.00009981391,0.011007446,0.0000066694815,0.029164473],"study_design_scores_gemma":[0.00021661096,0.000017488364,0.0002414908,0.00004899249,0.0000053085196,8.841177e-7,0.00013808515,0.99706316,0.001646395,0.00029578837,0.00018978344,0.00013603707],"about_ca_topic_score_codex":0.0000016112584,"about_ca_topic_score_gemma":0.000020106638,"teacher_disagreement_score":0.50002116,"about_ca_system_score_codex":0.00008947162,"about_ca_system_score_gemma":0.0000049213754,"threshold_uncertainty_score":0.48061717},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.008249441214177488,"score_gpt":0.20286649082871577,"score_spread":0.1946170496145383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098775996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057007303,0.00014112318,0.9507948,0.0006341761,0.00012887311,0.00036208684,0.000010058921,0.00092866423,0.041299492],"genre_scores_gemma":[0.8359119,0.000049731647,0.16217025,0.00041811442,0.00009738463,0.000014872517,0.0007446456,0.00006432853,0.00052874646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920684,0.000026677037,0.00018556812,0.00017549362,0.00021804497,0.00018739539],"domain_scores_gemma":[0.9996576,0.000017511475,0.000049058275,0.00015420189,0.00005643536,0.00006524683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000863405,0.00014621028,0.00011645689,0.00010427934,0.00010847646,0.000083929524,0.000065845554,0.00006810923,0.00015152994],"category_scores_gemma":[0.0000103631,0.00014068447,0.000026783322,0.0003342442,0.000017043454,0.00028757466,0.000006056087,0.000094505805,0.000013958182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025654095,0.000014091484,0.000068261405,0.000009119767,0.000014616307,0.0000011932656,0.00021442382,0.9964524,0.00032117366,0.0003668515,0.0006956907,0.0018165371],"study_design_scores_gemma":[0.00058126723,0.00010441637,0.00032728232,0.00008961975,0.000023818857,0.0000058692426,0.00004741199,0.99618953,0.0013067715,0.000078025034,0.0009916611,0.0002543345],"about_ca_topic_score_codex":0.0000020964994,"about_ca_topic_score_gemma":0.0000026530772,"teacher_disagreement_score":0.8302112,"about_ca_system_score_codex":0.000059662118,"about_ca_system_score_gemma":0.000011121901,"threshold_uncertainty_score":0.57369465},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Travelling salesman problem; Heuristic; Integer programming; Window (computing); Computer science; Mathematics; Algorithm","score_opus":0.004443702601807077,"score_gpt":0.20733811642787947,"score_spread":0.2028944138260724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114675299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013880298,0.000047713067,0.9590134,0.00030550038,0.00023753512,0.0004991359,0.000008232161,0.0008180517,0.025190106],"genre_scores_gemma":[0.12618151,0.00007392123,0.87189025,0.000063912885,0.00015078986,0.00006991058,0.00010534643,0.0001330401,0.0013313426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915165,0.000047473448,0.00019976651,0.00016786919,0.00018206511,0.0002512075],"domain_scores_gemma":[0.9993715,0.00008424199,0.00005342299,0.0003200938,0.000100918594,0.000069769776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029274903,0.00016083181,0.00010920259,0.00005087367,0.00025529708,0.0001605237,0.00019304671,0.000090353664,0.00013095069],"category_scores_gemma":[0.000035447105,0.00011332545,0.00003154452,0.00028650102,0.00006742566,0.00024569267,0.000026234435,0.00024019304,0.000043422362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010788756,0.000003844435,0.00019393145,0.0000075999174,0.00002070124,8.764058e-7,0.000085704436,0.99525374,0.0011039727,0.00026724374,0.00031840743,0.0027331782],"study_design_scores_gemma":[0.00025847583,0.000021126876,0.00014898992,0.000012304013,0.000019055064,0.00000863436,0.00002173137,0.9962091,0.0009268818,0.000029914716,0.002160989,0.00018278789],"about_ca_topic_score_codex":0.000003712311,"about_ca_topic_score_gemma":0.000011814115,"teacher_disagreement_score":0.11230121,"about_ca_system_score_codex":0.000023270146,"about_ca_system_score_gemma":0.000020666068,"threshold_uncertainty_score":0.46212777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03037697177775578,"score_gpt":0.28519658192086494,"score_spread":0.25481961014310917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115713772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027774707,0.000010942017,0.9948063,0.0006982392,0.00027463393,0.0003451415,0.000015080444,0.000079434794,0.000992767],"genre_scores_gemma":[0.311536,0.000027832015,0.6879593,0.00022804842,0.000093734954,0.000029535131,0.00005399735,0.000012517363,0.00005899628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890363,0.0000907933,0.0002743238,0.00027185056,0.0002692525,0.00019011846],"domain_scores_gemma":[0.9990168,0.00021787947,0.00019071321,0.00032921912,0.00021085433,0.000034497898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032297845,0.0001270241,0.00014064435,0.0000928116,0.00044408522,0.00007193668,0.0004426467,0.000059249123,0.000016534448],"category_scores_gemma":[0.00005744183,0.00010150715,0.0001355175,0.00050940504,0.00012751545,0.00027351215,0.00009547338,0.0000934137,0.0000024917283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003186111,0.00021316964,0.00020358594,0.00003468681,0.00008148729,0.0000053812155,0.0031982313,0.2544032,0.000064782325,0.67388135,0.000853181,0.06702907],"study_design_scores_gemma":[0.00030960274,0.000090237954,0.00024653214,0.000027943159,0.0000072998505,0.000018990493,0.000034607558,0.99140096,0.0008190744,0.006806163,0.0001128017,0.00012581791],"about_ca_topic_score_codex":0.000022087264,"about_ca_topic_score_gemma":0.0000015449461,"teacher_disagreement_score":0.7369977,"about_ca_system_score_codex":0.00002456526,"about_ca_system_score_gemma":0.000046796227,"threshold_uncertainty_score":0.41393414},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021739337531294353,"score_gpt":0.2639957199895441,"score_spread":0.2422563824582497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163661406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17644794,0.00038006922,0.821523,0.000055826054,0.00042766178,0.00027400933,0.00012467889,0.00033196117,0.00043486652],"genre_scores_gemma":[0.7591885,0.00012976797,0.23806322,0.00013598205,0.00045260237,0.0010340171,0.0007784248,0.00017523093,0.000042297874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983074,0.00006355561,0.0004419438,0.00034693655,0.0002554895,0.0005846597],"domain_scores_gemma":[0.99832815,0.000805949,0.00022951506,0.00042398443,0.000087371656,0.00012505805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076232746,0.00031159472,0.00020873161,0.00012751795,0.0005156173,0.00030153882,0.00027195987,0.0003106475,0.000022512522],"category_scores_gemma":[0.000320588,0.00031212263,0.00029404974,0.00030514173,0.000064137246,0.00081666297,0.00008605369,0.00022173602,0.000014344604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012368307,0.000030316023,0.00002004251,0.00017935614,0.0002230201,0.00000262111,0.002143817,0.11130063,0.0032211335,0.8808284,0.0004714951,0.0014555143],"study_design_scores_gemma":[0.000492869,0.00015861061,0.000029141393,0.00016099852,0.00022661069,0.000020369016,0.00044307855,0.9800216,0.016386354,0.00020183047,0.0015234278,0.0003351181],"about_ca_topic_score_codex":0.00009959757,"about_ca_topic_score_gemma":0.000028526649,"teacher_disagreement_score":0.88062656,"about_ca_system_score_codex":0.00002930746,"about_ca_system_score_gemma":0.000042173848,"threshold_uncertainty_score":0.99993306},"labels":[],"label_agreement":null},{"id":"W2298220966","doi":"10.1016/j.disopt.2017.09.003","title":"The quadratic minimum spanning tree problem and its variations","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Minimum spanning tree; Distributed minimum spanning tree; Combinatorics; Euclidean minimum spanning tree; Matroid; Mathematics; Context (archaeology); Kruskal's algorithm; Bottleneck; k-minimum spanning tree; Quadratic equation; Tree (set theory); Simple (philosophy); Minimum degree spanning tree; Discrete mathematics; Binary tree; K-ary tree; Computer science; Tree structure","score_opus":0.02206177484825251,"score_gpt":0.28212960636901624,"score_spread":0.26006783152076374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298220966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005528744,0.001464627,0.98112065,0.00068316277,0.00080098206,0.00084840524,0.000039140952,0.00051005976,0.013980111],"genre_scores_gemma":[0.29289743,0.003093948,0.70055073,0.00003327843,0.0004383675,0.00040284832,0.000568462,0.00027486501,0.0017400543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983207,0.0001738504,0.0005105073,0.00040567646,0.0002537406,0.00033550634],"domain_scores_gemma":[0.9984717,0.0002176262,0.00032639407,0.0006976426,0.00018356457,0.00010307699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006945721,0.0003660784,0.0003197145,0.00011746582,0.0008214271,0.00090884394,0.00044074553,0.0003393145,0.000018978719],"category_scores_gemma":[0.00046771337,0.0003223426,0.00008110269,0.000118627984,0.00006120301,0.00027261907,0.000323547,0.0005012257,0.0000068703644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039581296,0.0000043332084,0.000064445536,0.0001461101,0.00007646427,9.4946466e-7,0.00056314457,0.9946676,0.000038103182,0.001587335,0.00016829361,0.0026792623],"study_design_scores_gemma":[0.00021756694,0.00001068669,0.0001855217,0.00019780632,0.00010554959,0.000003095239,0.000047761197,0.99755067,0.000062321706,0.0010755165,0.00018214172,0.00036134833],"about_ca_topic_score_codex":0.0000089929,"about_ca_topic_score_gemma":0.0000108211525,"teacher_disagreement_score":0.29234454,"about_ca_system_score_codex":0.00009122933,"about_ca_system_score_gemma":0.00007506086,"threshold_uncertainty_score":0.9999229},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023612876139482653,"score_gpt":0.27394445528749767,"score_spread":0.250331579148015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507811569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010529001,0.00012017216,0.992031,0.00038223286,0.0017751377,0.0010272482,0.000483444,0.00033835645,0.0037371162],"genre_scores_gemma":[0.008198366,0.00020322802,0.9889076,0.00019525918,0.0002441181,0.00041049015,0.0014857232,0.000044465687,0.00031078365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978424,0.00009015902,0.000374653,0.00095843186,0.00032282824,0.00041153468],"domain_scores_gemma":[0.997921,0.00014807061,0.00031139038,0.0010174351,0.00048690964,0.00011520715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033587523,0.00034341263,0.0003441891,0.00026067207,0.00031979784,0.00047735398,0.0012693639,0.00025889446,0.00011198865],"category_scores_gemma":[0.00011488952,0.00035282836,0.00028342695,0.0004391629,0.00018274492,0.00047493158,0.0010496535,0.00025646004,0.000008366823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060099672,0.00013204548,0.000043065193,0.00024690205,0.00021201305,0.0000051390834,0.001606869,0.7822602,0.000008302079,0.18651175,0.013844112,0.015069544],"study_design_scores_gemma":[0.00031436322,0.00010408056,0.000016585049,0.00009988493,0.000028480772,0.0000019024017,0.000044995213,0.88259137,0.00021158837,0.112975925,0.003185087,0.000425739],"about_ca_topic_score_codex":0.000033663047,"about_ca_topic_score_gemma":0.000010720647,"teacher_disagreement_score":0.10033122,"about_ca_system_score_codex":0.000081589475,"about_ca_system_score_gemma":0.0001893076,"threshold_uncertainty_score":0.99989235},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02309696272240792,"score_gpt":0.2800881309899574,"score_spread":0.2569911682675495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509691293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020748933,0.00028178608,0.99357885,0.0008693097,0.00053274655,0.0012697929,0.00054214057,0.00014390885,0.0007065558],"genre_scores_gemma":[0.105449684,0.00036099026,0.8915211,0.0002533452,0.00022744501,0.00030371302,0.0016893843,0.000049500217,0.00014482754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801195,0.000091931935,0.00031816427,0.0009163271,0.0003105046,0.00035114933],"domain_scores_gemma":[0.99832094,0.000105112435,0.00036375053,0.0009084482,0.00021544879,0.00008629985],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028779602,0.00040208967,0.00041346866,0.00022029523,0.0006390857,0.0011241724,0.0010474763,0.0001814696,0.000013024457],"category_scores_gemma":[0.00003535495,0.0003504372,0.000113192174,0.00013274507,0.00016567504,0.00067564443,0.0011960994,0.00033731724,8.357142e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003266572,0.00013854276,0.0012351042,0.00039991795,0.0008442619,0.00003029799,0.0031507278,0.80066925,0.000022734854,0.15080832,0.000772087,0.041602094],"study_design_scores_gemma":[0.001239601,0.0003509393,0.0006124368,0.00047584905,0.00012899736,0.000009775055,0.00011514043,0.99121326,0.00045906915,0.0043320064,0.00026344717,0.0007994758],"about_ca_topic_score_codex":0.00064840313,"about_ca_topic_score_gemma":0.00005362893,"teacher_disagreement_score":0.19054401,"about_ca_system_score_codex":0.000058889134,"about_ca_system_score_gemma":0.00021682006,"threshold_uncertainty_score":0.99991274},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015549613876668566,"score_gpt":0.24941590798724567,"score_spread":0.2338662941105771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745314127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093290786,0.00044361103,0.99346983,0.0021847691,0.0010624505,0.00044600636,0.000028830893,0.00015918766,0.002112002],"genre_scores_gemma":[0.008376775,0.001840494,0.9874742,0.0004555397,0.00037331102,0.00017502242,0.00026625098,0.00003369043,0.0010046996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985352,0.00013774478,0.00028874955,0.0005281425,0.0002736547,0.00023652008],"domain_scores_gemma":[0.9986565,0.00010343761,0.00021616355,0.00078735413,0.00016544497,0.00007109851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003246463,0.00021413557,0.00017972729,0.00008385352,0.0006662394,0.001036474,0.0008544025,0.00015483609,0.000025311143],"category_scores_gemma":[0.000050005237,0.0001646349,0.00008183726,0.00021049725,0.00015454771,0.00042010084,0.0014180556,0.00022994913,0.000012417607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008237298,0.00002441633,0.000028731558,0.00003353745,0.000083377,0.0000012266466,0.0005884331,0.3045964,0.000004172054,0.686292,0.0031083848,0.005231073],"study_design_scores_gemma":[0.00017660127,0.000020557056,0.000093061084,0.00003315073,0.000017251548,0.0000022617355,0.0000030060341,0.79983246,0.000010073976,0.19783236,0.0017951838,0.00018403657],"about_ca_topic_score_codex":0.000042045605,"about_ca_topic_score_gemma":0.0000054150273,"teacher_disagreement_score":0.49523607,"about_ca_system_score_codex":0.00003845503,"about_ca_system_score_gemma":0.000109247376,"threshold_uncertainty_score":0.9994743},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Hamiltonian path; Algorithm; Graph; Discrete mathematics","score_opus":0.020127424260410667,"score_gpt":0.2707476361752828,"score_spread":0.25062021191487216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783589701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09048519,0.0002313863,0.9067416,0.000984285,0.00029029098,0.00044999793,0.00023550006,0.00018818263,0.00039354927],"genre_scores_gemma":[0.3006951,0.0012116767,0.6943742,0.0006180558,0.00064747385,0.0007759868,0.00069814426,0.00026619175,0.00071317883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970631,0.0001222722,0.0005112562,0.00090972637,0.0006770201,0.00071665226],"domain_scores_gemma":[0.9969477,0.0006037748,0.0005255494,0.0014972468,0.00018147964,0.00024423611],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010008399,0.00039170592,0.00027399248,0.00015426437,0.002051993,0.000804919,0.0012606937,0.00028509312,0.000009203649],"category_scores_gemma":[0.0003261277,0.0003462219,0.00028745568,0.0003085718,0.0004523656,0.0010745978,0.00059714296,0.0004511661,0.00009175299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013736615,0.00007808116,0.000002881558,0.000056566667,0.00010704731,0.000037986953,0.00047899602,0.088016205,0.00029189957,0.9038758,0.00007392748,0.006843215],"study_design_scores_gemma":[0.00085910305,0.0003875118,0.00004268718,0.0002248715,0.000085338586,0.00006024826,0.000086263964,0.993951,0.0008261456,0.0025881976,0.00053286855,0.0003557606],"about_ca_topic_score_codex":0.000044275148,"about_ca_topic_score_gemma":0.00002014772,"teacher_disagreement_score":0.9059348,"about_ca_system_score_codex":0.00001806125,"about_ca_system_score_gemma":0.00014955441,"threshold_uncertainty_score":0.99989897},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04017734624734458,"score_gpt":0.28953988569646294,"score_spread":0.24936253944911835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894812324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018716636,0.000043001615,0.9942153,0.0005607739,0.00044080243,0.0005386477,0.0000013956223,0.0027904457,0.0012224321],"genre_scores_gemma":[0.0510679,0.000033822012,0.9480601,0.00019422658,0.0001787391,0.00014782441,0.00015803779,0.000040776198,0.00011857728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811596,0.00007808072,0.00037567952,0.00051254,0.00035684067,0.00056092936],"domain_scores_gemma":[0.9990093,0.000089962574,0.00018315912,0.00049106666,0.00013462105,0.00009184995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033787166,0.00021283544,0.00020516536,0.00013799955,0.00031384945,0.00022274887,0.00061590096,0.000098809134,0.000019169529],"category_scores_gemma":[0.00017221863,0.00021190051,0.00008418348,0.0024165388,0.000051872332,0.000908109,0.00027599023,0.0001361203,0.000024165289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038621306,0.000008088374,0.00008195752,0.0000070557835,0.000010488972,0.0000059983986,0.0016123524,0.955761,0.000003943111,0.03175353,0.00008937803,0.01066234],"study_design_scores_gemma":[0.00023197614,0.00007015122,0.000072384144,0.000025248455,0.0000091109805,0.0000075908233,0.0000997778,0.99723095,0.000038056925,0.001479221,0.00049361074,0.00024191254],"about_ca_topic_score_codex":0.000004824495,"about_ca_topic_score_gemma":0.0000017812581,"teacher_disagreement_score":0.050880734,"about_ca_system_score_codex":0.000044143882,"about_ca_system_score_gemma":0.000035976063,"threshold_uncertainty_score":0.86410517},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02363428599131756,"score_gpt":0.2764234025157367,"score_spread":0.25278911652441916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919667091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74938345,0.00007542448,0.21246783,0.00046187337,0.00038676508,0.00062737096,0.00005993662,0.00004166895,0.03649568],"genre_scores_gemma":[0.9966126,0.000031185817,0.0022526218,0.000037960617,0.000012617092,0.0000081172775,0.00001218662,0.000009547244,0.0010231677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993645,0.000037497168,0.00026872306,0.0000863166,0.00016190686,0.00008106474],"domain_scores_gemma":[0.9989794,0.00041709247,0.00021474177,0.00020724745,0.00016835373,0.000013190181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020526683,0.00006989381,0.00015364357,0.0001148384,0.000026150768,0.000010931717,0.00010603019,0.000034729517,0.00066947506],"category_scores_gemma":[0.0005599454,0.000046140158,0.000060035516,0.0003221615,0.00003865586,0.00007794232,0.0000311342,0.0000534178,0.0000081193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063474705,0.00010729441,0.0005869049,0.0003506345,0.00009354547,1.5301787e-7,0.001730406,0.052355018,0.00011156167,0.9428156,0.0011415861,0.0006437981],"study_design_scores_gemma":[0.0036548334,0.0026899644,0.0014679732,0.0018045626,0.00041786287,0.00001070393,0.031559855,0.55390036,0.04491523,0.3570286,0.0013746226,0.0011754006],"about_ca_topic_score_codex":0.00004027199,"about_ca_topic_score_gemma":0.0000064091905,"teacher_disagreement_score":0.585787,"about_ca_system_score_codex":0.000015834556,"about_ca_system_score_gemma":0.000020028087,"threshold_uncertainty_score":0.73302823},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.014847516591581499,"score_gpt":0.23939515683151302,"score_spread":0.2245476402399315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923556723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002153324,0.000017293274,0.98929715,0.00023861995,0.0005798664,0.0003635479,0.000008628362,0.00014552326,0.007196018],"genre_scores_gemma":[0.50394154,0.000093091745,0.49451095,0.00019228988,0.00010048433,0.0000252373,0.0007411702,0.000026678441,0.0003685645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906516,0.000046352816,0.00015267324,0.0003610928,0.00020952262,0.00016521743],"domain_scores_gemma":[0.99936604,0.00003907188,0.00012165113,0.00032801047,0.00009191054,0.00005333994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012496226,0.00013402218,0.00013142425,0.00010000473,0.00012922927,0.00049409794,0.00023937206,0.000037067835,0.00008537112],"category_scores_gemma":[0.0000177969,0.00011712255,0.000017024384,0.0003062956,0.00004011503,0.0025656454,0.00018028423,0.0000704629,0.000016159469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000533781,0.00004902344,0.0010999001,0.000023795648,0.000025089985,0.000006064646,0.00009222897,0.90619045,0.0000067197047,0.09039252,0.00023884326,0.0018219798],"study_design_scores_gemma":[0.0007985167,0.0001860358,0.00014821196,0.00003389612,0.000011988241,0.000010255279,0.000096419746,0.99782205,0.00004326311,0.00021688952,0.00045540265,0.00017707798],"about_ca_topic_score_codex":0.00007948567,"about_ca_topic_score_gemma":0.0000056699087,"teacher_disagreement_score":0.5017882,"about_ca_system_score_codex":0.000057101654,"about_ca_system_score_gemma":0.00001674526,"threshold_uncertainty_score":0.4776119},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08705139819538114,"score_gpt":0.36025948128975266,"score_spread":0.2732080830943715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081538319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012142276,0.000075827505,0.9885487,0.0074749975,0.00007564727,0.0026438087,0.00011612764,0.00030061984,0.0007521485],"genre_scores_gemma":[0.0047084894,0.000065776534,0.9923094,0.00082698994,0.000163133,0.00062068086,0.00066740665,0.00013594261,0.00050220155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977933,0.00014843418,0.00056356634,0.00048837106,0.0005515482,0.00045474328],"domain_scores_gemma":[0.99759805,0.0008974341,0.0003084518,0.00043773162,0.00057443284,0.0001838832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043540247,0.00028971717,0.00030428873,0.00009392267,0.00051278237,0.00022979364,0.00041207354,0.00012931088,0.00079866085],"category_scores_gemma":[0.0015922687,0.00022470694,0.00012818238,0.000862108,0.00010053745,0.00050144165,0.000076655924,0.00019989151,0.0000133145995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011320948,0.00003737241,0.000014014293,0.00017385182,0.00003831022,7.3772145e-7,0.00042538857,0.99173933,0.000014694969,0.0042090896,0.0027434311,0.00049054873],"study_design_scores_gemma":[0.0012801525,0.00014090029,9.74901e-7,0.000032388718,0.000076698154,8.3800404e-7,0.00035625184,0.9947708,0.00034730096,0.0014850404,0.0012274941,0.00028111532],"about_ca_topic_score_codex":0.0000059552976,"about_ca_topic_score_gemma":0.000004047506,"teacher_disagreement_score":0.0066480073,"about_ca_system_score_codex":0.000100579804,"about_ca_system_score_gemma":0.00020081304,"threshold_uncertainty_score":0.91632825},"labels":[],"label_agreement":null},{"id":"W3184586842","doi":"10.1016/j.disopt.2021.100658","title":"Preface: Optimization and Discrete Geometry","year":2021,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Discrete geometry; Geometry; Mathematical optimization","score_opus":0.006629734632258789,"score_gpt":0.21738132398167087,"score_spread":0.21075158934941207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184586842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024090123,0.001185968,0.99089366,0.0001880378,0.00041573154,0.00014978243,0.000029664146,0.0005415816,0.0041865394],"genre_scores_gemma":[0.102329515,0.002105024,0.89321876,0.00013531865,0.00016374596,0.000034426863,0.0010850842,0.00011709552,0.00081103365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988348,0.000045678833,0.00030236808,0.000332597,0.00021738869,0.0002671706],"domain_scores_gemma":[0.9993324,0.0000388769,0.000051321236,0.00027763975,0.00015744769,0.00014229452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000110915156,0.00022836556,0.0002079614,0.00013802032,0.00014753833,0.00020548514,0.000087860695,0.00015585289,0.00046011235],"category_scores_gemma":[0.00010347946,0.00024525676,0.0000518701,0.000640193,0.000045229408,0.00043372123,0.000051701038,0.00015088097,0.000011977885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039207694,0.000009010273,0.00023620708,0.000033305398,0.00003366153,0.0000047061026,0.00013778087,0.9983689,0.00005455269,0.00018915036,0.00010280839,0.00082598673],"study_design_scores_gemma":[0.00045641523,0.000014315943,0.00011550388,0.0000370825,0.000038735343,0.000018322835,0.00017874375,0.99735636,0.0012544174,0.000024953815,0.00019614463,0.0003090281],"about_ca_topic_score_codex":0.0000025208315,"about_ca_topic_score_gemma":0.0000015689366,"teacher_disagreement_score":0.099920504,"about_ca_system_score_codex":0.00004802299,"about_ca_system_score_gemma":0.000028987359,"threshold_uncertainty_score":0.99999994},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Mathematics; Quadric; Combinatorics; Discrete mathematics; Bipartite graph; Clique; Duality (order theory); Graph","score_opus":0.004837548440651212,"score_gpt":0.1978723109585278,"score_spread":0.1930347625178766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187519750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009865656,0.001536586,0.9722475,0.0002724307,0.00022116821,0.000105323605,0.0000057139305,0.00063875475,0.023985991],"genre_scores_gemma":[0.9662557,0.002976264,0.02782762,0.00014772112,0.00016912402,0.000055529144,0.00014120908,0.000077522665,0.0023492565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995132,0.000024258672,0.000128035,0.000095511205,0.0000884345,0.00015057476],"domain_scores_gemma":[0.9996733,0.000023964098,0.000016028423,0.00021135787,0.000040535924,0.00003480706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007215102,0.0000818691,0.00006620461,0.00002384732,0.00011674845,0.000100929305,0.00008282963,0.000045322115,0.00007442736],"category_scores_gemma":[0.000025308904,0.00006420299,0.0000374161,0.0002158819,0.000018434235,0.00011812435,0.000017782217,0.00006958542,0.000021617496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004135953,0.000008419239,0.00026414002,0.000018834848,0.000035578803,0.000009897046,0.00016877458,0.96709466,0.0038651484,0.0043621175,0.007710049,0.016458252],"study_design_scores_gemma":[0.00009938059,0.000013279525,0.00021809379,0.000018574516,0.000014712316,0.000006557165,0.000070482936,0.95805776,0.023984218,0.00028858695,0.017052658,0.00017566959],"about_ca_topic_score_codex":0.0000032243418,"about_ca_topic_score_gemma":0.0000077728155,"teacher_disagreement_score":0.9652692,"about_ca_system_score_codex":0.000021822205,"about_ca_system_score_gemma":0.000010658434,"threshold_uncertainty_score":0.2618122},"labels":[],"label_agreement":null},{"id":"W4399114203","doi":"10.1016/j.disopt.2024.100845","title":"Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Single-machine scheduling; Computer science; Sequence (biology); Mathematical optimization; Simulated annealing; Schedule; Set (abstract data type); Job shop; Scheduling (production processes); Due date; Flow shop scheduling; Algorithm; Mathematics","score_opus":0.01598366804719975,"score_gpt":0.25198201115861185,"score_spread":0.2359983431114121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399114203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026860869,0.0013623703,0.9628311,0.00020905225,0.00051559956,0.00046538972,0.000048565125,0.0011117627,0.0065953406],"genre_scores_gemma":[0.787469,0.00015389151,0.21074566,0.000040302846,0.00008244149,0.000046573106,0.00024422642,0.000112396294,0.0011054932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989216,0.000026403663,0.00023523871,0.00032448914,0.0002410108,0.00025128116],"domain_scores_gemma":[0.99957603,0.000027539916,0.000029447618,0.0001850705,0.00006843344,0.00011347849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015373384,0.00024267579,0.00018357912,0.00015576415,0.00009177329,0.00028751572,0.00009011376,0.00009092339,0.00016938226],"category_scores_gemma":[0.000008890063,0.00020638392,0.000037331865,0.00037039863,0.00004736402,0.0004456386,0.000031924315,0.00018172397,0.000021625532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010697892,0.0000059977874,0.00033424536,0.00013798154,0.00007082563,0.000015888401,0.00092106726,0.99738044,0.00013839197,0.00029668372,0.00007094716,0.00061681244],"study_design_scores_gemma":[0.00044041075,0.000058598675,0.000026948945,0.00020569022,0.00007154993,0.000030074707,0.00022895055,0.9979599,0.0005742055,0.000031285774,0.00007265555,0.00029971503],"about_ca_topic_score_codex":0.000025109624,"about_ca_topic_score_gemma":0.000019841907,"teacher_disagreement_score":0.76060814,"about_ca_system_score_codex":0.00007522924,"about_ca_system_score_gemma":0.00003851844,"threshold_uncertainty_score":0.8416092},"labels":[],"label_agreement":null},{"id":"W4401688606","doi":"10.1016/j.disopt.2024.100858","title":"Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Binary number; Mathematical optimization; Constraint (computer-aided design); Quadratic equation; Quadratic programming; Applied mathematics; Geometry; Arithmetic","score_opus":0.007762357146174873,"score_gpt":0.21547855321190684,"score_spread":0.20771619606573197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401688606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080716255,0.0008770318,0.992375,0.0014190247,0.00018278403,0.00054020376,0.0000407807,0.0004304437,0.003327547],"genre_scores_gemma":[0.763167,0.0010306359,0.23460133,0.000067127105,0.00015406903,0.00006794014,0.00037883775,0.00010931411,0.0004237257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989432,0.0000650059,0.00038856218,0.00023175839,0.00019885764,0.00017258713],"domain_scores_gemma":[0.9994321,0.00009826424,0.0000854505,0.00020685545,0.000115272975,0.000062060644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014184082,0.0001937515,0.00017956016,0.00015560452,0.0001868409,0.00021478349,0.00010199137,0.00011044009,0.0000698665],"category_scores_gemma":[0.000050103507,0.00014235677,0.000051359373,0.0007570862,0.00017187964,0.00047276507,0.000035365287,0.00019757591,0.0000020997898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020513023,0.000008290719,0.00018002656,0.00030764446,0.000045401,0.0000010637069,0.00044896317,0.9878883,0.000118960415,0.01023178,0.00006153138,0.00070598675],"study_design_scores_gemma":[0.00019207688,0.00003068979,0.00005802214,0.000776734,0.00008304256,0.000012892638,0.00010186472,0.9980737,0.00018951413,0.00013603074,0.00016026366,0.0001851774],"about_ca_topic_score_codex":0.000002756885,"about_ca_topic_score_gemma":0.0000016204649,"teacher_disagreement_score":0.76235986,"about_ca_system_score_codex":0.000038267677,"about_ca_system_score_gemma":0.00007098319,"threshold_uncertainty_score":0.5805141},"labels":[],"label_agreement":null},{"id":"W4402564803","doi":"10.1016/j.disopt.2024.100860","title":"Approximation schemes for Min-Sum <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si35.svg\" display=\"inline\" id=\"d1e488\"><mml:mi>k</mml:mi></mml:math>-Clustering","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Mathematics; Algorithm; Computer science; Combinatorics; Computer graphics (images); Statistics","score_opus":0.020656615144146215,"score_gpt":0.2545916724953852,"score_spread":0.233935057351239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402564803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086258866,0.00029769744,0.9103513,0.00053922646,0.0010746132,0.00012909336,0.000063106134,0.00035019958,0.0009359342],"genre_scores_gemma":[0.51082903,0.00019318251,0.4863345,0.00034586483,0.0006355766,0.00042548336,0.0009308825,0.000117920186,0.00018755047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978969,0.000045779452,0.0004725413,0.000662812,0.00047143234,0.0004505111],"domain_scores_gemma":[0.9987583,0.00019604528,0.0002288339,0.0006162429,0.00007595655,0.00012461274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043692967,0.0002672958,0.0001577482,0.00016993503,0.00048439676,0.00089000433,0.00063611125,0.00023414173,0.000020454183],"category_scores_gemma":[0.00012642784,0.00031005547,0.00026447978,0.00050031295,0.00012827707,0.0012405484,0.0004685876,0.00023031935,0.00010353293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029003928,0.000036851055,0.000001356016,0.00033341226,0.00007195606,0.000015577109,0.0007540971,0.051230427,0.00017689624,0.9396007,0.00021097653,0.007538713],"study_design_scores_gemma":[0.00029094546,0.00014573129,0.0000064540177,0.00029733608,0.0000658153,0.00004506041,0.0001377735,0.99214876,0.001755534,0.0014991565,0.0032915946,0.0003158481],"about_ca_topic_score_codex":0.00003611124,"about_ca_topic_score_gemma":0.000022422773,"teacher_disagreement_score":0.9409183,"about_ca_system_score_codex":0.000020655718,"about_ca_system_score_gemma":0.00012563495,"threshold_uncertainty_score":0.99993515},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"George (robot); Mathematics; Mathematical economics; Operations research; Computer science; Artificial intelligence","score_opus":0.01855816165973135,"score_gpt":0.31031889184915556,"score_spread":0.2917607301894242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6625772","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008990467,0.00031634327,0.027688425,0.00032819132,0.002529776,0.00022046018,0.00001199593,0.000037828668,0.95987654],"genre_scores_gemma":[0.89007765,0.0007917368,0.017390558,0.0008765031,0.012861499,0.00009153653,0.00013736081,0.000113327165,0.07765984],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895364,0.0001010198,0.00032671823,0.00029246,0.0001206589,0.00020547457],"domain_scores_gemma":[0.99951124,0.000044317607,0.00012930493,0.00022942027,0.000039755505,0.000045975034],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000113122216,0.00010847185,0.0002241785,0.00017534023,0.000053064457,0.0000014676903,0.00016561856,0.00020958047,0.007850826],"category_scores_gemma":[0.000058082856,0.00011058604,0.00005413597,0.00032668674,0.00023607913,0.00008235122,0.000027250033,0.00022097395,0.00012437372],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017421065,0.0012582644,0.030464618,0.00004121863,0.0001749864,0.00026829034,0.112381846,0.07193776,0.00022336685,0.093610205,0.67513,0.0127673205],"study_design_scores_gemma":[0.018388923,0.0018304598,0.19124569,0.00016487855,0.00019241693,0.0006104963,0.023398498,0.024565915,0.00031508337,0.0066591967,0.7296467,0.0029817421],"about_ca_topic_score_codex":0.000111794405,"about_ca_topic_score_gemma":0.0000048292713,"teacher_disagreement_score":0.8822167,"about_ca_system_score_codex":0.00008483232,"about_ca_system_score_gemma":0.000018658964,"threshold_uncertainty_score":0.9930561},"labels":[],"label_agreement":null}]}