{"meta":{"query_hash":"c1fe0075ff10","filters":{"topic":"Optimization and Packing Problems"},"cohort_total":349,"direct_labels_cover":0,"predictions_cover":349,"exported":349,"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/c1fe0075ff10","api":"https://metacan.xera.ac/api/v1/cohort?topic=Optimization+and+Packing+Problems"},"results":[{"id":"W100499361","doi":"","title":"Static symmetry breaking in circle packing","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Circle packing; Square (algebra); RADIUS; Packing problems; Symmetry breaking; Combinatorics; Unit square; Symmetry (geometry); Unit (ring theory); Mathematics; Unit circle; Work (physics); Physics; Geometry; Computer science; Quantum mechanics","score_opus":0.006615354732950662,"score_gpt":0.21828412523455074,"score_spread":0.21166877050160007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100499361","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.91403437,0.00028038654,0.045415588,0.0006152549,0.021395545,0.0013194847,0.000014890308,0.0013410939,0.015583394],"genre_scores_gemma":[0.99680823,0.00033460854,0.002547823,0.00010760867,0.000058101006,0.000031523497,0.00003822728,0.000046072637,0.000027815779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989294,0.00004427141,0.0003136962,0.0002581671,0.00016020822,0.0002942982],"domain_scores_gemma":[0.99942696,0.00015520053,0.000068732705,0.00019133821,0.000060122806,0.00009765827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025623146,0.00019650349,0.00023174142,0.00034550802,0.0001186745,0.0001317024,0.00011692586,0.0002189291,0.000071956674],"category_scores_gemma":[0.00008942131,0.00022597633,0.000042876498,0.00073304656,0.000055476936,0.00018545636,0.000030129546,0.00046603073,0.000004392824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003774457,0.00011898073,0.003507146,0.00005160482,0.00002498094,0.000005316166,0.00027583874,0.94334656,0.0001715966,0.041172948,0.00037641518,0.010910875],"study_design_scores_gemma":[0.003473814,0.00018241495,0.0038074183,0.00025739553,0.000035519508,0.000008689735,0.00016248832,0.9792481,0.00022179673,0.010602336,0.0013217325,0.0006782628],"about_ca_topic_score_codex":0.000006568988,"about_ca_topic_score_gemma":0.000022802316,"teacher_disagreement_score":0.08277386,"about_ca_system_score_codex":0.000034365083,"about_ca_system_score_gemma":0.000015477824,"threshold_uncertainty_score":0.92150474},"labels":[],"label_agreement":null},{"id":"W10708998","doi":"10.1007/978-3-319-14803-8_23","title":"Evolving Point Packings in the Plane","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Simple (philosophy); Representation (politics); Computer science; Point (geometry); Plane (geometry); Algorithm; Square (algebra); Mathematical optimization; Theoretical computer science; Mathematics; Geometry","score_opus":0.021004706060826515,"score_gpt":0.22670166798611055,"score_spread":0.20569696192528403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10708998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000409688,0.00085759995,0.9670489,0.00034069706,0.001051992,0.00023089493,0.0000038993903,0.00013130473,0.030293772],"genre_scores_gemma":[0.9076552,0.00012845144,0.08923704,0.0017510022,0.0006926836,0.000010781678,0.000028593799,0.000098497105,0.00039776074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.00001351492,0.00024109268,0.00032528964,0.00043223123,0.00029884867],"domain_scores_gemma":[0.9992653,0.00017923367,0.000047745954,0.0003909521,0.00006601267,0.000050768787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075157266,0.00023893092,0.00021255949,0.00034263442,0.000052034946,0.00021110846,0.00072769634,0.00016584324,0.000054160882],"category_scores_gemma":[0.000048867943,0.00018143511,0.000033465345,0.00027692446,0.00015025289,0.0001518707,0.00010188714,0.0006099611,0.000030500885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4731047e-7,0.0000036216327,0.000054752734,0.0000306653,0.0000026483208,0.000025106387,0.0021398633,0.956387,0.000011829911,0.0010204259,0.00030557523,0.04001759],"study_design_scores_gemma":[0.00020304669,0.00004311267,0.000096097276,0.00046891312,0.0000042482766,0.00005497351,7.785566e-7,0.95425785,0.00006318191,0.036912117,0.007460796,0.00043486472],"about_ca_topic_score_codex":0.000013442855,"about_ca_topic_score_gemma":0.00010420568,"teacher_disagreement_score":0.90761423,"about_ca_system_score_codex":0.00016089367,"about_ca_system_score_gemma":0.000075672535,"threshold_uncertainty_score":0.7398709},"labels":[],"label_agreement":null},{"id":"W121264847","doi":"","title":"An optimal algorithm for a parallel cutting problem.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm; Mathematical optimization","score_opus":0.009004668301635259,"score_gpt":0.23071513929540002,"score_spread":0.22171047099376476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121264847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37219477,0.001667009,0.44937807,0.0005656994,0.0076041003,0.0054590967,0.00016659498,0.009599646,0.15336502],"genre_scores_gemma":[0.52106494,0.000115690294,0.4769348,0.0001191154,0.000049742062,0.0002214163,0.00012425956,0.00013623913,0.0012338179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992233,0.00001645761,0.00019699633,0.0001744522,0.00009767039,0.00029111808],"domain_scores_gemma":[0.9996127,0.000029328205,0.000019689567,0.00019581005,0.000042288902,0.000100200625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013673033,0.00014571268,0.00014308891,0.000043531683,0.000101139434,0.00007782057,0.00015434969,0.000086113054,0.00032065512],"category_scores_gemma":[0.000003673351,0.00015983635,0.000049337483,0.00014093705,0.000015970278,0.0002089498,0.000006184118,0.000103310864,0.00006230878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013541902,0.00011653942,0.00009569572,0.000063131534,0.000054457192,0.0000033630615,0.00079613394,0.7031518,0.00008388124,0.02388828,0.004149179,0.26758394],"study_design_scores_gemma":[0.0011138098,0.00011901632,0.00003727787,0.000024731218,0.00001278344,0.0000053255003,0.00002249119,0.9572283,0.00028817652,0.015034883,0.025838604,0.0002746141],"about_ca_topic_score_codex":0.0000045064203,"about_ca_topic_score_gemma":4.7737365e-7,"teacher_disagreement_score":0.26730934,"about_ca_system_score_codex":0.000029121265,"about_ca_system_score_gemma":0.000013187236,"threshold_uncertainty_score":0.65179366},"labels":[],"label_agreement":null},{"id":"W12471151","doi":"","title":"Worst-case analysis for new online bin packing problems","year":2013,"lang":"en","type":"article","venue":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bin packing problem; Bin; Upper and lower bounds; Online algorithm; Mathematics; Combinatorics; Competitive analysis; Type (biology); Process (computing); Algorithm; Discrete mathematics; Computer science","score_opus":0.044267123835705066,"score_gpt":0.28047768718913574,"score_spread":0.23621056335343066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12471151","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.18204205,0.0038861514,0.54789305,0.005849842,0.0110226665,0.022450661,0.000979743,0.009337534,0.21653831],"genre_scores_gemma":[0.9202538,0.00008442253,0.031523686,0.00012725609,0.0012329613,0.002198411,0.0010738743,0.00019151703,0.043314032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99691683,0.00005388687,0.0011681268,0.0007484799,0.0003315943,0.00078106864],"domain_scores_gemma":[0.99651444,0.00015780864,0.00032598825,0.0016322798,0.0006742524,0.000695213],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032598013,0.00046812504,0.0005920748,0.000738697,0.0005287109,0.0019037111,0.0011391583,0.00025233362,0.00039542204],"category_scores_gemma":[0.00008712662,0.00048460526,0.00032400462,0.002295969,0.000052908756,0.001720553,0.00025432926,0.0002974118,0.00006773721],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034996123,0.0017317468,0.3810794,0.0006115448,0.0056698727,0.000061000017,0.0034392185,0.3858041,0.0033964436,0.08184703,0.10914291,0.027181752],"study_design_scores_gemma":[0.0034416332,0.0002794624,0.1065799,0.00020563434,0.0019758355,0.00083661405,0.00090503605,0.16633083,0.003918781,0.0027542303,0.7089326,0.0038394518],"about_ca_topic_score_codex":0.0033640095,"about_ca_topic_score_gemma":0.00029680185,"teacher_disagreement_score":0.7382118,"about_ca_system_score_codex":0.0003577837,"about_ca_system_score_gemma":0.00021304545,"threshold_uncertainty_score":0.99976057},"labels":[],"label_agreement":null},{"id":"W131027357","doi":"10.1007/978-3-540-74456-6_11","title":"New Approximability Results for 2-Dimensional Packing Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Rectangle; Bin packing problem; Approximation algorithm; Combinatorics; Packing problems; Mathematics; Constant (computer programming); Square (algebra); Time complexity; Unit square; Bin; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Geometry","score_opus":0.030671216822183375,"score_gpt":0.24976073389741507,"score_spread":0.2190895170752317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131027357","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.000012838111,0.00027374396,0.98887086,0.00013531321,0.0015243231,0.00062672334,0.000020234578,0.00026566384,0.008270323],"genre_scores_gemma":[0.018761743,0.000022544758,0.9787966,0.00041632392,0.0008124002,0.000009883528,0.00006892429,0.00009274346,0.0010188548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785703,0.0000060769917,0.0005003475,0.00071077084,0.0004496182,0.00047614225],"domain_scores_gemma":[0.9987152,0.00038313307,0.00010271108,0.0004928241,0.00015748349,0.000148648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009074321,0.000360426,0.00033073666,0.00038757277,0.00011542087,0.00013390247,0.0004878213,0.00032149127,0.000022354614],"category_scores_gemma":[0.000087226865,0.00034420693,0.00009614081,0.0002671332,0.00017843227,0.00014583071,0.00011978435,0.00048509118,0.000011712332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009365594,0.000004549213,0.000005707104,0.00008250506,0.000005972916,0.0000017556694,0.00022028277,0.80655664,0.00003536206,0.0005871156,0.00012692103,0.19236383],"study_design_scores_gemma":[0.00062582875,0.000079412275,0.000019769857,0.00047666632,0.000008200876,0.0000137459,4.9249785e-8,0.92269546,0.0008186977,0.06201823,0.012674454,0.0005694939],"about_ca_topic_score_codex":0.000009103145,"about_ca_topic_score_gemma":0.000077639685,"teacher_disagreement_score":0.19179434,"about_ca_system_score_codex":0.00021640913,"about_ca_system_score_gemma":0.00019512005,"threshold_uncertainty_score":0.999901},"labels":[],"label_agreement":null},{"id":"W143115087","doi":"","title":"The Maximum Number of Lines Contained in Subsets of PG(k, 2).","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics; Animal science; Biology","score_opus":0.006931192562698387,"score_gpt":0.22332458191907395,"score_spread":0.21639338935637556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143115087","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.97996384,0.0001319963,0.000007749051,0.000050249488,0.00037805582,0.00009312788,0.0000021836531,0.00004408016,0.019328704],"genre_scores_gemma":[0.99936604,0.00019691461,0.000087378365,0.000008557785,0.0000024576655,0.000005125122,0.0000036331517,0.00001371169,0.0003161765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994912,0.000021637823,0.00023776104,0.000054463188,0.00008249994,0.000112410366],"domain_scores_gemma":[0.9996806,0.0000794348,0.000027559841,0.00015425951,0.00003782544,0.00002033379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012880206,0.000067808614,0.00012606193,0.00002253404,0.000017629827,0.000007881973,0.00011040951,0.000047820715,0.00020709574],"category_scores_gemma":[0.000017379696,0.000056205645,0.000028593397,0.00019311915,0.000031195843,0.00004118025,0.000007175127,0.00006966416,0.000024749703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020410516,0.0003937182,0.2314976,0.00041537726,0.0001988803,0.000013493048,0.003536815,0.16401055,0.001584538,0.55989903,0.008010483,0.030235438],"study_design_scores_gemma":[0.015487755,0.00029421708,0.08124715,0.00061321957,0.00006603719,0.000023973022,0.00036921527,0.13600008,0.040179554,0.6741513,0.050247636,0.0013198594],"about_ca_topic_score_codex":0.00003865366,"about_ca_topic_score_gemma":0.000020175905,"teacher_disagreement_score":0.15025045,"about_ca_system_score_codex":0.000012441701,"about_ca_system_score_gemma":0.000009540676,"threshold_uncertainty_score":0.22919998},"labels":[],"label_agreement":null},{"id":"W1494494416","doi":"","title":"On packing squares with resource augmentation: maximizing the profit","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Unit square; Packing problems; Square (algebra); Mathematics; Profit (economics); Bounded function; Mathematical optimization; Combinatorics; Economics; Microeconomics; Geometry","score_opus":0.00814501994240998,"score_gpt":0.1936452724177778,"score_spread":0.1855002524753678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494494416","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05532254,0.00027926816,0.18103883,0.012290059,0.00022379805,0.00083519676,0.000003837894,0.0021706652,0.7478358],"genre_scores_gemma":[0.98960865,0.000008696145,0.007318971,0.0007941733,0.00008383862,0.00001892291,0.000006824883,0.000029156208,0.0021307848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995595,0.000012889022,0.000092906375,0.00008336236,0.00012522926,0.00012607813],"domain_scores_gemma":[0.99975723,0.00004751707,0.000015229658,0.00014026334,0.000014036726,0.000025701556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007882121,0.000084869076,0.000051728945,0.000034768796,0.00009658665,0.00007403151,0.00007453788,0.000023151904,0.00029523516],"category_scores_gemma":[0.0000043471946,0.000051237625,0.000015101087,0.00012547437,0.000014979703,0.00008013877,0.0000069273547,0.0000903372,0.0000797393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007722531,0.000003587929,0.0002165227,0.000010717665,0.00001346529,5.565642e-7,0.0007056136,0.9793078,0.00003763962,0.005570355,0.0064271726,0.007698865],"study_design_scores_gemma":[0.0016434917,0.00017390733,0.0014397886,0.00023531714,0.000034734006,0.000027131318,0.0014720081,0.663062,0.012477808,0.000291315,0.31847665,0.00066587486],"about_ca_topic_score_codex":0.0000026137766,"about_ca_topic_score_gemma":0.000020272193,"teacher_disagreement_score":0.9342861,"about_ca_system_score_codex":0.000028740349,"about_ca_system_score_gemma":0.000004176995,"threshold_uncertainty_score":0.3232618},"labels":[],"label_agreement":null},{"id":"W1506514157","doi":"10.1109/wescan.1993.270559","title":"A practical method to optimize negotiable call accesses for broadband communication networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Computer science; Heuristic; Mathematical optimization; Class (philosophy); Bandwidth (computing); Broadband; Mathematics; Computer network; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.056561610706443194,"score_gpt":0.3247307835829653,"score_spread":0.2681691728765221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506514157","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.000011316447,0.00018200833,0.9578782,0.001429713,0.00009860667,0.00033239348,0.0000018485604,0.00032381454,0.039742112],"genre_scores_gemma":[0.027195761,0.00040796387,0.9679726,0.0006320264,0.00004866143,0.00009379562,0.000016271726,0.000035968384,0.003596975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940455,0.00003751545,0.00017688204,0.00011654327,0.000064600135,0.0001999271],"domain_scores_gemma":[0.9991876,0.00036774846,0.000019920635,0.0002607058,0.00006715434,0.00009687241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020129261,0.0001020438,0.00013058969,0.000047069418,0.00007713293,0.00012350173,0.00013232359,0.00008157187,0.00066751166],"category_scores_gemma":[0.0000714512,0.00009780177,0.000034259723,0.00019524508,0.000008262475,0.00020184297,0.00003086839,0.000105428444,0.000038379923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004705952,0.000019163464,0.00001149593,0.00001722218,0.000017131712,1.4432872e-7,0.00009759164,0.8802444,0.000014406825,0.0012986127,0.115005836,0.0032692882],"study_design_scores_gemma":[0.000258511,0.000019261195,0.000006030411,0.000012753157,0.00001330194,0.0000037668915,0.000013567794,0.8778367,0.00024245337,0.00004851164,0.12142185,0.00012329961],"about_ca_topic_score_codex":0.00001779583,"about_ca_topic_score_gemma":0.000018092915,"teacher_disagreement_score":0.03614514,"about_ca_system_score_codex":0.000023445404,"about_ca_system_score_gemma":0.000003840224,"threshold_uncertainty_score":0.7308785},"labels":[],"label_agreement":null},{"id":"W1515159858","doi":"","title":"Packing balanced complete multipartite graphs with hexagons","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Physics; Quantum","score_opus":0.012193956852142687,"score_gpt":0.20602796421070085,"score_spread":0.19383400735855816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515159858","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.97829884,0.00020591829,0.005298335,0.00021939861,0.00203631,0.0003660509,0.00001586913,0.0014164163,0.012142876],"genre_scores_gemma":[0.99675316,0.000032777003,0.0030084264,0.000080675796,0.000004890127,0.000017535325,0.000022137257,0.00004576432,0.000034639168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992636,0.00001258643,0.00015465493,0.00015308335,0.00014151401,0.00027458262],"domain_scores_gemma":[0.9995725,0.000024857947,0.000029437744,0.00023053399,0.00004691217,0.000095749674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006345122,0.00015952627,0.00016054117,0.000073226394,0.00009439045,0.000055511297,0.000119751654,0.000054955246,0.000031831023],"category_scores_gemma":[0.000008432578,0.00015102433,0.00003734321,0.0003262264,0.000040290834,0.00013190963,0.000015296228,0.00015129923,0.00007604899],"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.000015087244,0.00007206911,0.010083741,0.00006651248,0.00009508285,0.000019427633,0.0009208201,0.62762225,0.0023806787,0.35782838,0.00054186437,0.00035406934],"study_design_scores_gemma":[0.035086397,0.0010615613,0.05864587,0.0016807206,0.00022723166,0.0001575128,0.0005228694,0.1318008,0.029710544,0.68944126,0.04657206,0.0050931806],"about_ca_topic_score_codex":0.0000177334,"about_ca_topic_score_gemma":0.000020206176,"teacher_disagreement_score":0.49582148,"about_ca_system_score_codex":0.000050123206,"about_ca_system_score_gemma":0.000015801048,"threshold_uncertainty_score":0.6158594},"labels":[],"label_agreement":null},{"id":"W1516165084","doi":"10.1007/11523468_15","title":"Worst Case Optimal Union-Intersection Expression Evaluation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Expression (computer science); Computer science; Upper and lower bounds; Set (abstract data type); Algorithm; Mathematical optimization; Discrete mathematics; Mathematics","score_opus":0.01933709617362351,"score_gpt":0.24935654607429186,"score_spread":0.23001944990066836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516165084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031602092,0.00024662426,0.9909965,0.000057077246,0.0019667072,0.0002937465,0.0000035219325,0.00021030109,0.005909544],"genre_scores_gemma":[0.80909586,0.00005040781,0.18944664,0.00014533325,0.00083832856,0.000013129335,0.00003257361,0.00006809098,0.00030961813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985367,0.000019839908,0.00027817927,0.0004505943,0.00046425406,0.00025042958],"domain_scores_gemma":[0.9992757,0.000078997546,0.000073650146,0.00035116952,0.00014297961,0.00007752668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061994785,0.0002746141,0.00018987458,0.0004945716,0.00013058858,0.00015983911,0.00025653548,0.00024349986,0.00020744337],"category_scores_gemma":[0.00002483554,0.00026935313,0.000053487805,0.00021923945,0.00012210353,0.0002664277,0.00009208419,0.0004521216,0.000031939708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013639816,0.0000034049278,0.0000022462962,0.000014151625,0.0000026004516,0.000024368357,0.00034855824,0.7644801,0.00010856585,0.000078253586,0.000022790839,0.23491356],"study_design_scores_gemma":[0.00018310902,0.000030923726,0.0000041721046,0.00033113884,0.000009545901,0.00030419635,3.534238e-7,0.99481493,0.0013784125,0.0014485966,0.0011920183,0.00030262378],"about_ca_topic_score_codex":0.0000066365733,"about_ca_topic_score_gemma":0.00008070159,"teacher_disagreement_score":0.80877984,"about_ca_system_score_codex":0.0004136865,"about_ca_system_score_gemma":0.00007937128,"threshold_uncertainty_score":0.99997586},"labels":[],"label_agreement":null},{"id":"W1517042457","doi":"10.1007/978-3-540-68891-4_13","title":"A Polynomial Time Approximation Scheme for the Square Packing Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Square (algebra); Bin packing problem; Polynomial-time approximation scheme; Combinatorics; Approximation algorithm; Packing problems; Bin; Mathematical optimization; Time complexity; Scheme (mathematics); Discrete mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.0155292284007949,"score_gpt":0.2150886482293441,"score_spread":0.1995594198285492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517042457","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.00001200908,0.0004561446,0.9941858,0.00023622398,0.0005311327,0.00073085487,0.000010325573,0.00022007707,0.0036174117],"genre_scores_gemma":[0.04417531,0.00024909675,0.9516403,0.0006995398,0.0015076185,0.00009715959,0.00008773236,0.00018670791,0.0013565301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987015,0.0000064868364,0.00027920227,0.00038846987,0.00030224855,0.00032205024],"domain_scores_gemma":[0.9991432,0.00025633868,0.0000864638,0.00035587043,0.00010958057,0.000048592006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029671163,0.0002821973,0.0002310697,0.0002324033,0.00023113505,0.00018226643,0.0005144439,0.00020582901,0.000033138647],"category_scores_gemma":[0.000027992515,0.00022269224,0.00008519211,0.0002045483,0.00020154208,0.00015545814,0.000087691966,0.00035592986,0.000026007006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032861765,0.0000037228212,0.0000057347347,0.000080389626,0.000011114011,0.0000013300044,0.00071540615,0.86501527,0.00009777507,0.00011804745,0.0007481732,0.13319977],"study_design_scores_gemma":[0.00018388967,0.000027850812,0.0000060660705,0.00019383251,0.0000064196242,0.000017669532,8.5144755e-8,0.9830505,0.00035823975,0.00087215274,0.014994669,0.0002886147],"about_ca_topic_score_codex":0.0000025727954,"about_ca_topic_score_gemma":0.000008160205,"teacher_disagreement_score":0.13291115,"about_ca_system_score_codex":0.00013840351,"about_ca_system_score_gemma":0.00009273361,"threshold_uncertainty_score":0.9081126},"labels":[],"label_agreement":null},{"id":"W1517789689","doi":"","title":"On Packing Rectangles with Resource Augmentation: Maximizing the Profit","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Unit square; Combinatorics; Packing problems; Mathematics; Profit (economics); Bounded function; Square (algebra); Mathematical optimization; Microeconomics; Economics; Geometry","score_opus":0.07067051632240474,"score_gpt":0.3019838953193751,"score_spread":0.23131337899697035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517789689","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.5887814,0.0016654999,0.19418752,0.016585173,0.00082290126,0.0059747766,0.00007306723,0.002301579,0.18960807],"genre_scores_gemma":[0.9780873,0.00030684072,0.016130276,0.00016860098,0.00022390364,0.00033083349,0.00006749871,0.00007832541,0.004606437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859405,0.00016434389,0.00017505132,0.00020019188,0.00053696096,0.00032940452],"domain_scores_gemma":[0.9991471,0.0002543125,0.000008079381,0.00033568195,0.00018970949,0.00006509332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051716756,0.00012278266,0.000094899515,0.00019574891,0.0011845265,0.00017117869,0.00021874366,0.00005336074,0.00014562282],"category_scores_gemma":[0.00007374929,0.00008441774,0.000023595538,0.00081689184,0.00015737486,0.00017044277,0.000030052113,0.00046912054,0.00015762485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147056,0.000019932782,0.0001416573,0.000015301555,0.000040954998,0.000019248107,0.0031443248,0.9804142,0.00033291333,0.0032975208,0.006929942,0.005629282],"study_design_scores_gemma":[0.0009811269,0.0002884802,0.00064898905,0.0001537258,0.000010314406,0.00017133016,0.0017067433,0.96727407,0.004476945,0.00013934266,0.023762042,0.00038689672],"about_ca_topic_score_codex":0.000042254895,"about_ca_topic_score_gemma":0.000058681504,"teacher_disagreement_score":0.3893059,"about_ca_system_score_codex":0.00011097446,"about_ca_system_score_gemma":0.00007272899,"threshold_uncertainty_score":0.91105396},"labels":[],"label_agreement":null},{"id":"W1521776486","doi":"","title":"AN IMPROVED HEURISTIC FOR THE TWO-DIMENSIONAL CUTTING STOCK PROBLEM WITH MULTIPLE SIZED STOCK SHEETS","year":2006,"lang":"en","type":"article","venue":"International journal of industrial engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Toronto Metropolitan University","funders":"","keywords":"Trim; Stock (firearms); Cutting stock problem; Mathematical optimization; Heuristic; Computer science; Mathematics; Algorithm; Engineering; Optimization problem; Mechanical engineering","score_opus":0.016105469810080028,"score_gpt":0.2370942091565639,"score_spread":0.2209887393464839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521776486","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.21860695,0.00037221092,0.77187735,0.00076091377,0.0062257955,0.001271699,0.00010028289,0.00038788607,0.00039689612],"genre_scores_gemma":[0.97557896,0.0000029764387,0.0223817,0.000022138614,0.0018796045,0.00002265744,0.000022631217,0.00005869726,0.000030649564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987118,0.000016159715,0.00055829546,0.00011696778,0.00037145324,0.00022532554],"domain_scores_gemma":[0.9987644,0.00041894364,0.00020088948,0.0001080353,0.00042800853,0.000079740326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036673268,0.00019613492,0.00020827672,0.0001800979,0.000066199085,0.00015368989,0.0003645779,0.00008873872,0.000029564404],"category_scores_gemma":[0.00014333508,0.00014451165,0.00009735513,0.00013079004,0.000018200175,0.00029594998,0.000018505001,0.0003923391,9.0169317e-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.00015832573,0.000033300403,0.00038198268,0.000007754063,0.00017725558,0.0000080060745,0.00005117908,0.98783195,0.0059694643,0.000081520855,0.0003862696,0.004912995],"study_design_scores_gemma":[0.004205937,0.00014570024,0.00018366956,0.00016361049,0.000043214404,0.000112596936,0.000014825513,0.9912563,0.0020815122,0.00002995521,0.0015700085,0.00019268089],"about_ca_topic_score_codex":0.000035036286,"about_ca_topic_score_gemma":0.00001103851,"teacher_disagreement_score":0.756972,"about_ca_system_score_codex":0.00013267333,"about_ca_system_score_gemma":0.000081661005,"threshold_uncertainty_score":0.5893014},"labels":[],"label_agreement":null},{"id":"W1527133581","doi":"","title":"Using Pattern Databases to Find Macro Operators","year":2000,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Heuristics; Macro; Table (database); Simple (philosophy); Operator (biology); Notation; Heuristic; Computer science; Space (punctuation); Theoretical computer science; Mathematics; Algorithm; Sequence (biology); Abstraction; State (computer science); Data mining; Mathematical optimization; Artificial intelligence; Arithmetic; Programming language","score_opus":0.22378880669472126,"score_gpt":0.3662642560339946,"score_spread":0.14247544933927334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527133581","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.19592725,0.00003410342,0.7370683,0.0007737402,0.00082223443,0.00049091305,0.00033617037,0.00044980334,0.064097516],"genre_scores_gemma":[0.99542546,0.000028358112,0.0034330175,0.0006212913,0.0001084607,0.000011358189,0.00004170447,0.000019672534,0.00031068551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897087,0.000023662868,0.0002669459,0.00021291719,0.00033026346,0.00019532186],"domain_scores_gemma":[0.999521,0.000050397037,0.00001638137,0.00012729947,0.00018365664,0.000101248195],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013738683,0.00014181969,0.00010702073,0.00012573284,0.000103336075,0.000119225,0.00016853202,0.00004492653,0.008402381],"category_scores_gemma":[0.000053668926,0.00015040326,0.000027083848,0.00030392662,0.000030007675,0.0001451162,0.000013576592,0.00013463746,0.0016716354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009404169,0.000028486229,0.000032985034,0.0000065022878,0.0000074178843,0.0000016381231,0.00021926331,0.8343249,0.002028202,0.018764589,0.00032159855,0.14425504],"study_design_scores_gemma":[0.00002019942,0.000031048774,0.000140763,0.000072535746,0.0000036300933,0.0000030707859,0.000056421115,0.96681726,0.026300272,0.0020456433,0.0042206636,0.00028847886],"about_ca_topic_score_codex":0.000038486087,"about_ca_topic_score_gemma":0.000055406977,"teacher_disagreement_score":0.7994982,"about_ca_system_score_codex":0.00006696852,"about_ca_system_score_gemma":0.000061444305,"threshold_uncertainty_score":0.9991057},"labels":[],"label_agreement":null},{"id":"W154580602","doi":"10.1007/978-3-319-04657-0_13","title":"The ${\\mathcal{G}}$ -Packing with t-Overlap Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Packing problems; Disjoint sets; Combinatorics; Clique; Set packing; Bounded function; Focus (optics); Mathematics; Discrete mathematics; Computer science; Physics","score_opus":0.00879632036603044,"score_gpt":0.1979327203784873,"score_spread":0.18913640001245685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154580602","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.000012414495,0.00031737215,0.97492737,0.00021130682,0.0007390048,0.0002549578,0.0000017403604,0.00023903442,0.023296805],"genre_scores_gemma":[0.41769713,0.00056135707,0.5734887,0.0017396675,0.0015733286,0.000042405627,0.000021657515,0.00038435482,0.004491414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840313,0.000010853788,0.0002630936,0.00043318415,0.00047007474,0.00041963474],"domain_scores_gemma":[0.998917,0.00027331556,0.000085547865,0.0005422516,0.00010166394,0.00008024554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043792507,0.00033453206,0.00025070817,0.00018524427,0.0002514243,0.00041293175,0.00073342014,0.00017386573,0.000015856842],"category_scores_gemma":[0.000016680842,0.00021801525,0.00004649286,0.00023544344,0.00039300698,0.00009900974,0.000119378485,0.00058355264,0.00003374918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020329003,0.0000013764344,0.000032055403,0.000042729742,0.000008714048,0.0000043418436,0.0001993347,0.80940825,0.000010531314,0.0068500424,0.000036492474,0.18340407],"study_design_scores_gemma":[0.00019748141,0.000082921004,0.000022667733,0.0006774145,0.000009638852,0.000039500723,1.6260451e-7,0.9420814,0.00021083692,0.021875916,0.034237392,0.0005647026],"about_ca_topic_score_codex":0.0000035469322,"about_ca_topic_score_gemma":0.00009320176,"teacher_disagreement_score":0.4176847,"about_ca_system_score_codex":0.00011905219,"about_ca_system_score_gemma":0.000086266846,"threshold_uncertainty_score":0.8890404},"labels":[],"label_agreement":null},{"id":"W1566305412","doi":"","title":"Minimum Cost Flow Problem on Dynamic Multi Generative Network flows","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimum-cost flow problem; Flow network; Multi-commodity flow problem; Mathematical optimization; Computer science; Computation; Flow (mathematics); Time horizon; Mathematics; Algorithm","score_opus":0.04003761077161055,"score_gpt":0.33751022360090305,"score_spread":0.2974726128292925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566305412","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.063132204,0.00051829993,0.8837163,0.0031718928,0.006159337,0.00820852,0.0004073068,0.0018932845,0.032792892],"genre_scores_gemma":[0.3394892,0.0002531424,0.65021926,0.00014449272,0.00087433355,0.0010086513,0.00046208253,0.00015544418,0.007393402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981409,0.00015677474,0.00030741194,0.0003499145,0.0004294084,0.0006156113],"domain_scores_gemma":[0.99881077,0.00013418244,0.000009007282,0.00046554138,0.0003920111,0.00018848365],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008089573,0.00021100057,0.000178784,0.00026318082,0.0006682373,0.0003380371,0.00031105016,0.00019272103,0.0005342792],"category_scores_gemma":[0.00008080183,0.00020192117,0.000051271305,0.00080051046,0.000101152815,0.00020911424,0.00006083252,0.0012309308,0.00085569307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003773984,0.000062110805,0.0000150246315,0.000012496732,0.000031257543,0.0000046571217,0.00048807377,0.9759745,0.0053410945,0.00070552784,0.0040448853,0.0133165885],"study_design_scores_gemma":[0.00049181277,0.000064666034,0.00007675841,0.000026237913,0.0000039478746,0.000007215976,0.00004327316,0.989058,0.00052532845,0.000071662085,0.009403591,0.00022750466],"about_ca_topic_score_codex":0.00004543645,"about_ca_topic_score_gemma":0.0021690645,"teacher_disagreement_score":0.276357,"about_ca_system_score_codex":0.00010835261,"about_ca_system_score_gemma":0.00012345186,"threshold_uncertainty_score":0.9999223},"labels":[],"label_agreement":null},{"id":"W1569707558","doi":"","title":"Variants of Shortest Path Problems","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Longest path problem; Combinatorics; Shortest path problem; Bottleneck; Discrete mathematics; Path (computing); Algebraic number; Mathematical optimization; Graph; Computer science","score_opus":0.1195355251014714,"score_gpt":0.31015488838466304,"score_spread":0.19061936328319162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569707558","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.103525884,0.0014729957,0.48054865,0.00028284805,0.0015436182,0.0036827552,0.0002384645,0.0011938595,0.40751094],"genre_scores_gemma":[0.9682594,0.00026998713,0.030280992,0.0000066147263,0.00005082753,0.00008601726,0.000029636669,0.000032867483,0.0009836376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896604,0.00007295938,0.00025420316,0.0001466712,0.00028274537,0.0002774042],"domain_scores_gemma":[0.9992646,0.000034343975,0.000006319718,0.00028827827,0.0003264111,0.00008006115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713394,0.00008776308,0.00011556974,0.00023847684,0.00013026556,0.00004189072,0.00021198095,0.0000730449,0.0008324671],"category_scores_gemma":[0.000046566733,0.000084396364,0.000026620553,0.00061786984,0.00008440462,0.00018792083,0.000040027786,0.0002472638,0.00015578564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008767937,0.00051099947,0.0020336362,0.00018811876,0.00019363487,0.000018006109,0.014350069,0.91281116,0.017594146,0.022821771,0.005011247,0.024458472],"study_design_scores_gemma":[0.00026628893,0.00010713774,0.0023026268,0.000055267265,0.00000570636,0.00000904499,0.00018187864,0.99189365,0.0034053714,0.0002977091,0.0013121098,0.00016320046],"about_ca_topic_score_codex":0.00021960225,"about_ca_topic_score_gemma":0.00006752473,"teacher_disagreement_score":0.8647335,"about_ca_system_score_codex":0.000031675285,"about_ca_system_score_gemma":0.000065432556,"threshold_uncertainty_score":0.91149306},"labels":[],"label_agreement":null},{"id":"W1575996043","doi":"10.1007/978-3-540-77120-3_28","title":"Approximability of Packing Disjoint Cycles","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Disjoint sets; Packing problems; Mathematics; Undirected graph; Binary logarithm; Upper and lower bounds; Omega; Vertex (graph theory); Approximation algorithm; Graph; Log-log plot; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Physics","score_opus":0.02392553823466615,"score_gpt":0.24292505205181883,"score_spread":0.21899951381715269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575996043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020110537,0.00027032668,0.98119223,0.000024917705,0.0007228036,0.00017142454,0.000005096459,0.00013433909,0.017277768],"genre_scores_gemma":[0.7017211,0.00006735595,0.29771128,0.00012638983,0.00021984002,0.0000022080583,0.000008959771,0.000056165216,0.000086702814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986094,0.000006326931,0.00037109695,0.00037866188,0.0003584257,0.0002760429],"domain_scores_gemma":[0.9991641,0.00016005768,0.000084704654,0.00043844312,0.0000892451,0.0000634654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005168485,0.00024339701,0.00030878725,0.00035776905,0.000045069002,0.00005561944,0.0004191241,0.00019770347,0.00004304986],"category_scores_gemma":[0.000035567402,0.00022888782,0.00007184603,0.00023380123,0.0003860875,0.000098898636,0.00012457918,0.000392458,0.0000062695913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015284638,0.000006695583,0.00015166002,0.00013138907,0.000005256862,0.0000030699787,0.00035569642,0.7496028,0.00007000709,0.0016565401,0.000002772004,0.2480126],"study_design_scores_gemma":[0.00016112151,0.000041803465,0.00030789708,0.00055551855,0.0000077663435,0.000010827784,2.062221e-7,0.9534868,0.004332279,0.03978683,0.00081276125,0.00049621233],"about_ca_topic_score_codex":0.0000058253954,"about_ca_topic_score_gemma":0.00002875857,"teacher_disagreement_score":0.70151997,"about_ca_system_score_codex":0.00012163546,"about_ca_system_score_gemma":0.0000536352,"threshold_uncertainty_score":0.9333774},"labels":[],"label_agreement":null},{"id":"W1576467755","doi":"","title":"Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling","year":2007,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Windsor","funders":"","keywords":"Travelling salesman problem; Scheme (mathematics); Generalization; Mathematics; Combinatorics; Mathematical optimization","score_opus":0.09858564593074017,"score_gpt":0.3929758128072795,"score_spread":0.29439016687653935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576467755","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.11848883,0.0017926826,0.8740072,0.0016746277,0.0006640285,0.0026402816,0.00035144456,0.0000936018,0.00028726284],"genre_scores_gemma":[0.9775227,0.0007474265,0.020364821,0.00006109974,0.00045847002,0.00030186013,0.00018384833,0.00003174535,0.00032807613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990267,0.000053649394,0.00025843788,0.00014805028,0.0002211484,0.00029197018],"domain_scores_gemma":[0.998086,0.0012261096,0.000015774354,0.00019669942,0.00042593438,0.000049477316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021278362,0.00009123256,0.00010306319,0.00011593785,0.0011339345,0.000118478856,0.00017425699,0.00006605776,0.000031746276],"category_scores_gemma":[0.00023585142,0.00006420689,0.00004613663,0.00034671885,0.0001713697,0.0002236123,0.000028164957,0.00024430887,0.0000025111037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034815144,0.000105518404,0.00022504822,0.00027747772,0.00019215663,0.0000013789282,0.0032664798,0.90739226,0.02628923,0.048616886,0.0037272447,0.009871504],"study_design_scores_gemma":[0.00040674218,0.000075021264,0.0008368585,0.000024324663,0.000018509989,0.0000066636417,0.0007211848,0.99279916,0.002452688,0.000682863,0.0018861797,0.00008982657],"about_ca_topic_score_codex":0.00007012824,"about_ca_topic_score_gemma":0.00008469322,"teacher_disagreement_score":0.8590338,"about_ca_system_score_codex":0.000037965638,"about_ca_system_score_gemma":0.00007303814,"threshold_uncertainty_score":0.8721422},"labels":[],"label_agreement":null},{"id":"W1579101463","doi":"10.1007/978-3-642-13193-6_26","title":"New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Constraint (computer-aided design); Constructive; Bin packing problem; Mathematical optimization; Computer science; Packing problems; Algorithm; Mathematics; Geometry; Programming language","score_opus":0.013193319874155925,"score_gpt":0.21468690292949866,"score_spread":0.20149358305534273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579101463","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.0000032239452,0.00022362413,0.9943003,0.00035912433,0.0010502998,0.0006102642,0.00001836923,0.00017102077,0.0032637964],"genre_scores_gemma":[0.04237249,0.00005778355,0.9558281,0.0003777219,0.0007089935,0.0000115691755,0.000017354405,0.00008945517,0.0005365469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985999,0.0000042154584,0.0002818677,0.00041543416,0.0003252516,0.00037335098],"domain_scores_gemma":[0.9987986,0.00037964943,0.00010251697,0.00046287593,0.00015455548,0.000101766775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028720495,0.00034083048,0.0002641337,0.00017092413,0.00018195945,0.00029577725,0.00068111497,0.00021531165,0.000036127152],"category_scores_gemma":[0.000038522554,0.00023160482,0.00005383423,0.00019217355,0.00037953875,0.00007742096,0.00009879371,0.0007210546,0.0000051789434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003199936,0.0000025452086,0.000012383744,0.000047331985,0.000014475096,0.000003052811,0.0002964162,0.7790682,0.00006920551,0.00238147,0.000072495306,0.21802926],"study_design_scores_gemma":[0.00049349375,0.00012536281,0.000014518876,0.00043795255,0.000031468717,0.000059390517,4.7274435e-7,0.96091205,0.00084499386,0.014468846,0.022018239,0.0005932044],"about_ca_topic_score_codex":0.000007938289,"about_ca_topic_score_gemma":0.00014789267,"teacher_disagreement_score":0.21743606,"about_ca_system_score_codex":0.0000659577,"about_ca_system_score_gemma":0.00023173605,"threshold_uncertainty_score":0.94445705},"labels":[],"label_agreement":null},{"id":"W1586057070","doi":"10.37236/398","title":"Optimal Packings of 13 and 46 Unit Squares in a Square","year":2010,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Square (algebra); Unit square; Unit (ring theory); Combinatorics; Mathematics; Least-squares function approximation; Statistics; Geometry","score_opus":0.008462670007025372,"score_gpt":0.2243424269833705,"score_spread":0.21587975697634515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586057070","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.9795197,0.009289951,0.009033083,0.00037080896,0.0009026866,0.0002132617,0.0000046487226,0.000036219306,0.0006295892],"genre_scores_gemma":[0.99509776,0.004649938,0.0000901171,0.000010344056,0.000055798017,0.0000030523975,0.0000030861297,0.000043916356,0.0000459635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986358,0.000078448466,0.0005301478,0.000101363206,0.0002866989,0.00036751968],"domain_scores_gemma":[0.99893636,0.00013523825,0.0003881131,0.0002602714,0.00022006783,0.000059964725],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.000909617,0.00022698192,0.0004546327,0.00027468192,0.000034559238,0.00005201355,0.00045676646,0.00028340323,0.000016032036],"category_scores_gemma":[0.000066116234,0.00018095816,0.000105507046,0.0002712784,0.00006470781,0.000075611046,0.00011981617,0.0028760508,7.600301e-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.00006933661,0.00012407039,0.00350413,0.00067728414,0.00025966569,0.0000122341025,0.0030331598,0.88912684,0.00035341163,0.10150161,0.00031268696,0.0010255914],"study_design_scores_gemma":[0.0074151424,0.0020086805,0.007895992,0.0030849024,0.0006152676,0.0006854144,0.001149038,0.21901603,0.00779817,0.7320967,0.016232261,0.0020023924],"about_ca_topic_score_codex":0.000017308676,"about_ca_topic_score_gemma":0.000034742156,"teacher_disagreement_score":0.67011076,"about_ca_system_score_codex":0.00012459011,"about_ca_system_score_gemma":0.00027560204,"threshold_uncertainty_score":0.99942434},"labels":[],"label_agreement":null},{"id":"W1588607283","doi":"10.37236/2444","title":"The $n$-Card Problem, Stochastic Matrices, and the Extreme Principle","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Permutation (music); Permutation matrix; Interval (graph theory); Matrix (chemical analysis); Discrete mathematics; Extreme point; Mathematical optimization","score_opus":0.008278334828841038,"score_gpt":0.20739113680537857,"score_spread":0.19911280197653752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588607283","genre_codex":"review","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.14502938,0.4185201,0.40684554,0.008539414,0.005816614,0.0019586768,0.0000030017036,0.0003000936,0.012987181],"genre_scores_gemma":[0.9946341,0.0048783384,0.000025026293,0.000030004394,0.00013172229,0.0000059120457,2.4068052e-7,0.000023415141,0.0002712573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988025,0.00011574083,0.00030566647,0.00003977605,0.00026289906,0.00047346114],"domain_scores_gemma":[0.99908715,0.0004046437,0.00017036311,0.0001841724,0.000091697046,0.00006199749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002182313,0.00011854918,0.00015484945,0.00003643841,0.00028191553,0.00008768042,0.00035223446,0.00004013971,0.0000045402944],"category_scores_gemma":[0.00006295677,0.000053260974,0.00006536397,0.00024647772,0.00009077356,0.0001369174,0.000038460377,0.0006187313,0.000005101051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004906701,0.000025352543,0.00015694716,0.000019179939,0.00015878482,2.9124502e-7,0.0010263494,0.03428745,0.000022516553,0.96229905,0.0008069668,0.0011480203],"study_design_scores_gemma":[0.007769093,0.00043855357,0.0010124655,0.00014178069,0.0006121588,0.0011754008,0.0006523077,0.08137183,0.00024552157,0.6571498,0.24875148,0.00067963597],"about_ca_topic_score_codex":0.0000015528684,"about_ca_topic_score_gemma":0.0000019219497,"teacher_disagreement_score":0.8496047,"about_ca_system_score_codex":0.00012118211,"about_ca_system_score_gemma":0.00006777951,"threshold_uncertainty_score":0.2688114},"labels":[],"label_agreement":null},{"id":"W1594807353","doi":"10.1007/978-3-540-69338-3_18","title":"Evaluation of Offset Assignment Heuristics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","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 Alberta","funders":"","keywords":"Heuristics; Computer science; Offset (computer science); Partition (number theory); Parallel computing; Computation; Heuristic; Overhead (engineering); Algorithm; Optimization problem; Permutation (music); Mathematics; Artificial intelligence","score_opus":0.046179339151198893,"score_gpt":0.27764341996179565,"score_spread":0.23146408081059675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594807353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024343608,0.000335254,0.9793477,0.000016979242,0.0010478863,0.0001906371,0.000006014061,0.00005324242,0.018977921],"genre_scores_gemma":[0.7791057,0.00011696051,0.2200016,0.00019080291,0.00032979329,0.0000043891364,0.000029551118,0.000058358408,0.00016279699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982692,0.00001196087,0.00028444655,0.00023840525,0.0010239448,0.00017203609],"domain_scores_gemma":[0.99920154,0.000099409786,0.00007850047,0.00028082216,0.00029566156,0.00004406426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014938044,0.00016830997,0.0001824646,0.00033730303,0.000030968386,0.00003628997,0.0002684915,0.0001558143,0.0000889104],"category_scores_gemma":[0.000052566545,0.00016584335,0.000033661792,0.00016889193,0.00014191729,0.000051332598,0.000055713434,0.00023744283,0.0000099907675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2162603e-7,0.0000031244701,0.00000770632,0.000020700409,0.000004556444,8.1844126e-7,0.000099526194,0.7292898,0.000023309885,0.0003730594,0.000015460719,0.27016145],"study_design_scores_gemma":[0.00012612277,0.000026267866,0.00003159639,0.00017757015,0.000020021736,0.0000031349573,4.109497e-8,0.9839214,0.0009732291,0.013738432,0.00081140647,0.0001707443],"about_ca_topic_score_codex":0.0000018705286,"about_ca_topic_score_gemma":0.000016420241,"teacher_disagreement_score":0.7790814,"about_ca_system_score_codex":0.00023882605,"about_ca_system_score_gemma":0.00012703484,"threshold_uncertainty_score":0.67628956},"labels":[],"label_agreement":null},{"id":"W1616987857","doi":"10.1007/978-3-642-40104-6_3","title":"Smart-Grid Electricity Allocation via Strip Packing with Slicing","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Rectangle; Slicing; Grid; Packing problems; Computer science; Schedule; STRIPS; Stacking; Mathematical optimization; Polynomial-time approximation scheme; Bin packing problem; Time complexity; Algorithm; Heuristic; Set (abstract data type); Electricity; Mathematics; Geometry; Bin; Electrical engineering; Computer graphics (images); Engineering","score_opus":0.009862472271955308,"score_gpt":0.19581568218619436,"score_spread":0.18595320991423905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616987857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023278304,0.00018593833,0.99236834,0.00007821519,0.0007655361,0.00031281286,0.0000017360845,0.0002764797,0.005778129],"genre_scores_gemma":[0.7736538,0.00013172237,0.22437482,0.0006261211,0.000676847,0.00001550696,0.000037986345,0.00012641301,0.00035675947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998363,0.000010412446,0.00028266376,0.00049398496,0.00042350852,0.0004264277],"domain_scores_gemma":[0.99913824,0.00011727171,0.00010094843,0.0003967052,0.00015611647,0.000090749185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025689113,0.00034865085,0.00028516605,0.00045191142,0.00013922341,0.0002500226,0.00044042926,0.00020974422,0.00005978606],"category_scores_gemma":[0.000016682852,0.0003072926,0.00003875867,0.00043213478,0.00013732011,0.00026621867,0.00006994171,0.00057892245,0.000043412063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013938951,0.0000036749293,0.0000727247,0.00004119755,0.0000093750605,0.0000033682677,0.00020148027,0.8185881,0.00025734317,0.00025221115,0.000021938336,0.18054721],"study_design_scores_gemma":[0.0001488385,0.00006888915,0.00010764888,0.00032195472,0.000009340867,0.000022930753,7.769604e-8,0.9932122,0.0020814142,0.0026320014,0.0009415497,0.0004531486],"about_ca_topic_score_codex":0.00003417506,"about_ca_topic_score_gemma":0.00008442956,"teacher_disagreement_score":0.77342105,"about_ca_system_score_codex":0.0002335471,"about_ca_system_score_gemma":0.00009312776,"threshold_uncertainty_score":0.9999379},"labels":[],"label_agreement":null},{"id":"W1629073290","doi":"","title":"A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Mathematical optimization; Integer programming; Trim; Stochastic programming; Nonlinear system; Nonlinear programming; Class (philosophy); Exploit; Branch and price; Mathematics; Computer science; Artificial intelligence","score_opus":0.07428170403181933,"score_gpt":0.35446976122891016,"score_spread":0.28018805719709083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629073290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012341519,0.00011930648,0.99427724,0.00028177348,0.00015372843,0.0015266592,0.000035408717,0.00030901426,0.0020627077],"genre_scores_gemma":[0.62082493,0.000023747214,0.3737363,0.000037762577,0.00037558237,0.00067236694,0.00085357705,0.000055939676,0.0034198365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855626,0.00007784601,0.0002619257,0.00026856974,0.00032796498,0.0005074151],"domain_scores_gemma":[0.9991133,0.000053157615,0.000008162827,0.00028239895,0.00042430082,0.00011867121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076926156,0.0001483306,0.00015092295,0.0002883475,0.000384272,0.00027605315,0.00021240744,0.000099125966,0.000041230353],"category_scores_gemma":[0.000092760405,0.00014482833,0.00005927042,0.00065660285,0.00006863843,0.00022886031,0.000024207662,0.00037708922,0.00005376815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072868893,0.00013131983,0.0000011387186,0.000027668706,0.000019959096,6.722279e-7,0.00036316042,0.9663126,0.001074199,0.0017920844,0.0006308639,0.029639037],"study_design_scores_gemma":[0.00062503846,0.00015885741,0.0000064184132,0.000019128001,0.000005962274,0.0000059802933,0.00015736466,0.9967373,0.00029309266,0.000053974847,0.0017706045,0.00016629201],"about_ca_topic_score_codex":0.0000393443,"about_ca_topic_score_gemma":0.000038745125,"teacher_disagreement_score":0.620541,"about_ca_system_score_codex":0.00012378712,"about_ca_system_score_gemma":0.000083557774,"threshold_uncertainty_score":0.5905928},"labels":[],"label_agreement":null},{"id":"W1642480478","doi":"10.1109/ijcnn.2015.7280846","title":"Packing equal circles in a damaged square","year":2015,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square (algebra); Simulated annealing; Packing problems; Vacancy defect; Mathematical optimization; Container (type theory); Algorithm; Greedy algorithm; Mathematics; Computer science; Combinatorics; Geometry; Engineering; Physics; Condensed matter physics; Mechanical engineering","score_opus":0.04480836509454603,"score_gpt":0.23366477621212323,"score_spread":0.1888564111175772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1642480478","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.3897561,0.00036559632,0.22878471,0.00029195257,0.0008774778,0.0002983753,0.000004773037,0.0018235579,0.37779745],"genre_scores_gemma":[0.99693567,0.000005112004,0.0027373661,0.000043355474,0.000023937515,0.0000037356108,0.000006553214,0.000015281308,0.0002290002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963224,0.000013912413,0.00010111304,0.00006135076,0.00007158938,0.00011981895],"domain_scores_gemma":[0.9998213,0.00001539876,0.00000625507,0.00008462936,0.000018014216,0.000054412692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001268196,0.000056040513,0.000065491105,0.00007133475,0.000009399949,0.000029871868,0.00005002128,0.000037148588,0.000106761945],"category_scores_gemma":[0.000024673904,0.00005699713,0.000011825443,0.00015772815,0.000006223986,0.00008985603,0.000010839448,0.0000729782,0.00008269816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024994577,0.000013688346,0.027546838,0.00003176218,0.0000059599834,0.0000049297328,0.0020727557,0.96104807,0.00017055924,0.0021116016,0.0024390435,0.004552295],"study_design_scores_gemma":[0.002046374,0.00005122808,0.015126047,0.00011873248,0.0000058311703,0.000008415198,0.0016995248,0.95597553,0.0016006614,0.0019957642,0.020779906,0.0005919796],"about_ca_topic_score_codex":0.00002742392,"about_ca_topic_score_gemma":0.00012337614,"teacher_disagreement_score":0.6071795,"about_ca_system_score_codex":0.000029620756,"about_ca_system_score_gemma":0.000009585398,"threshold_uncertainty_score":0.23242755},"labels":[],"label_agreement":null},{"id":"W173519685","doi":"","title":"A Run-length Operator on Partitions of Integers, Applied to Inventory Chains.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Operator (biology); Combinatorics; Chemistry","score_opus":0.012275942785862082,"score_gpt":0.21424280984692787,"score_spread":0.20196686706106579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173519685","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.77966493,0.0001616635,0.0019699142,0.00017663625,0.0043263966,0.00083526835,0.000022551434,0.0006520269,0.21219061],"genre_scores_gemma":[0.9991115,0.000019333134,0.00041087164,0.00017521375,0.0000043664986,0.000048431524,0.000007978744,0.000029809944,0.0001925282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993858,0.00002327965,0.00018527838,0.00012248624,0.00011641487,0.00016675574],"domain_scores_gemma":[0.999612,0.000023861481,0.000020829932,0.00019471264,0.000039730392,0.000108895765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012365408,0.000115504154,0.00014663006,0.000102522026,0.000042896852,0.000016943039,0.00008809292,0.000059922764,0.00020482528],"category_scores_gemma":[0.00003943298,0.00012377334,0.00003351342,0.00028331086,0.000017980485,0.000036707737,0.0000106075995,0.00011305233,0.00018246635],"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.0000057788293,0.00010070347,0.00035671284,0.00003940322,0.000035925445,8.24575e-7,0.00068116555,0.07097793,0.0010879285,0.91489166,0.011609551,0.0002124006],"study_design_scores_gemma":[0.012541854,0.0016327228,0.0022964205,0.0010308108,0.0001756715,0.000010368779,0.0018772779,0.05088253,0.30809364,0.18455221,0.43273434,0.0041721477],"about_ca_topic_score_codex":0.0000017446574,"about_ca_topic_score_gemma":0.0000021277522,"teacher_disagreement_score":0.73033947,"about_ca_system_score_codex":0.00005078632,"about_ca_system_score_gemma":0.000021481317,"threshold_uncertainty_score":0.504733},"labels":[],"label_agreement":null},{"id":"W1746386106","doi":"10.48550/arxiv.1306.0442","title":"Evolutionary Approach for the Containers Bin-Packing Problem","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Container (type theory); Computer science; Port (circuit theory); Scheduling (production processes); Mathematical optimization; Genetic algorithm; Distributed computing; Operations research; Bin; Packing problems; Job shop scheduling; Computer network; Engineering; Algorithm; Mathematics","score_opus":0.060320063824008764,"score_gpt":0.16824955338360828,"score_spread":0.10792948955959952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1746386106","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.0037153782,0.00042336993,0.97713995,0.00006716443,0.0005872314,0.0015264435,0.00005424097,0.0006675714,0.015818626],"genre_scores_gemma":[0.98491603,0.00043175957,0.011270736,0.000053511252,0.00013583542,0.000026303234,0.0001825737,0.00007154867,0.0029117197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893063,0.000037991307,0.0001857728,0.00045028864,0.000060533468,0.0003347715],"domain_scores_gemma":[0.9990167,0.00013072176,0.00009751371,0.00051433855,0.00014989583,0.000090805595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016252926,0.0003027027,0.00024409722,0.00014754312,0.0001947004,0.000087672684,0.0005418081,0.00028361395,0.0000706549],"category_scores_gemma":[0.000014730915,0.0002802364,0.00019949314,0.00026690276,0.00008787034,0.00014235383,0.00022394717,0.00046386867,0.0000334189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010068847,0.00001891127,0.00035669564,0.00026328437,0.00017164001,0.00000203726,0.00013103729,0.968161,0.000014048792,0.025293294,0.0054067574,0.0001712434],"study_design_scores_gemma":[0.00040285947,0.000013426397,0.000105432606,0.00005481227,0.00010674848,0.0000019560005,0.00016518024,0.9886108,0.000012802637,0.004636168,0.0055331085,0.0003567122],"about_ca_topic_score_codex":0.00007092812,"about_ca_topic_score_gemma":0.000005279503,"teacher_disagreement_score":0.98120064,"about_ca_system_score_codex":0.00020829946,"about_ca_system_score_gemma":0.00006285759,"threshold_uncertainty_score":0.99996495},"labels":[],"label_agreement":null},{"id":"W1937270683","doi":"10.1002/atr.1180","title":"Fleet size determination for a truckload distribution center","year":2012,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Transport engineering; Center (category theory); Distribution (mathematics); Distribution center; Engineering; Mathematics; Business; Chemistry; Marketing","score_opus":0.008079725794617984,"score_gpt":0.24106570769574506,"score_spread":0.23298598190112707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1937270683","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.34637025,0.0002054314,0.65158606,0.000064151296,0.0013479036,0.00019447818,0.0000920155,0.000052645573,0.00008705075],"genre_scores_gemma":[0.97482395,0.00009304305,0.024745513,0.000016931703,0.00014523228,0.000006867669,0.00013699733,0.0000147425235,0.00001672851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9994122,0.000006810947,0.000313865,0.00003545026,0.00010523415,0.00012644214],"domain_scores_gemma":[0.9995938,0.000051102474,0.00012812894,0.000037859558,0.00013078452,0.00005831416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001232553,0.000072502,0.000104751896,0.000037481,0.00002816652,0.0000100365405,0.00003588319,0.000042925712,0.000017233337],"category_scores_gemma":[0.000026171123,0.00006995188,0.00007424074,0.00008209509,0.0000063895527,0.0006275205,2.5143004e-7,0.00006492648,0.0000012303344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024180369,0.00015777878,0.009166854,0.0003216862,0.0000639285,0.000001938256,0.003710783,0.8978042,0.015737755,0.00086132024,0.0006085886,0.07132338],"study_design_scores_gemma":[0.015535753,0.0008055032,0.72377276,0.00064728083,0.00043368616,0.000093771145,0.0010117168,0.02972694,0.06511321,0.0024209619,0.15922706,0.0012113802],"about_ca_topic_score_codex":1.3505681e-7,"about_ca_topic_score_gemma":0.000002451854,"teacher_disagreement_score":0.8680772,"about_ca_system_score_codex":0.000047293073,"about_ca_system_score_gemma":0.000006284838,"threshold_uncertainty_score":0.2852555},"labels":[],"label_agreement":null},{"id":"W1963008840","doi":"10.3968/j.css.1923669720060203.004","title":"Research Again On the Cutting Plane Method Resolving ILP Problems","year":2009,"lang":"en","type":"article","venue":"Canadian social science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Cutting-plane method; Integer programming; Mathematics; Plane (geometry); Philosophy; Algorithm; Geometry","score_opus":0.05337700396393399,"score_gpt":0.3241982947621521,"score_spread":0.27082129079821815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963008840","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004296197,0.000068610185,0.0019324353,0.0048669768,0.00027182058,0.00031384715,0.000009431789,0.00015459448,0.9880861],"genre_scores_gemma":[0.997105,0.000008410973,0.0014996012,0.00086436106,0.00015014457,0.0000065861677,0.0000017425833,0.000010050379,0.0003540872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986241,0.00008388389,0.00010506795,0.00017668009,0.000380617,0.0006296836],"domain_scores_gemma":[0.9993996,0.00012881355,0.000014030708,0.00013969134,0.00008899964,0.00022886827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028616616,0.00007275953,0.000067072906,0.00022973637,0.0012272581,0.00023284755,0.00043347586,0.00005502164,0.00006637855],"category_scores_gemma":[0.00020995009,0.00006109046,0.000018583325,0.0014658793,0.00017040822,0.000106062216,0.000011740656,0.0003426025,0.000047619913],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048759925,0.000023807368,0.0008248888,0.000048293517,0.000017814991,0.000041779964,0.03310831,0.14919141,0.0139829,0.48535565,0.10419669,0.2132036],"study_design_scores_gemma":[0.0005101025,0.00023555671,0.0072199577,0.0004065321,0.000011152385,0.000016667562,0.0073608556,0.37053677,0.005483174,0.013499967,0.59331584,0.0014034589],"about_ca_topic_score_codex":0.0013094682,"about_ca_topic_score_gemma":0.003044937,"teacher_disagreement_score":0.9928088,"about_ca_system_score_codex":0.00039813877,"about_ca_system_score_gemma":0.00022836046,"threshold_uncertainty_score":0.94392014},"labels":[],"label_agreement":null},{"id":"W1965685568","doi":"10.4236/ajor.2013.32024","title":"A Particle Swarm Optimization Algorithm for a 2-D Irregular Strip Packing Problem","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Particle swarm optimization; Packing problems; Algorithm; Benchmark (surveying); Generator (circuit theory); Set (abstract data type); Circle packing; Sequence (biology); Mathematical optimization; Multi-swarm optimization; Phase (matter); Mathematics; Optimization problem; Computer science; Combinatorics; Power (physics)","score_opus":0.03452771659394198,"score_gpt":0.3214010978096618,"score_spread":0.2868733812157198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965685568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019618627,0.00017063937,0.97830224,0.0008262228,0.000093913695,0.0005560065,0.0000075510147,0.00004683917,0.00037798175],"genre_scores_gemma":[0.53949267,0.00019297455,0.45974198,0.00003694655,0.0001441146,0.00011090365,0.00001049157,0.000038962367,0.00023096458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986541,0.00012300207,0.00041644712,0.00010493567,0.0003654527,0.00033604781],"domain_scores_gemma":[0.9982326,0.00012215626,0.000045483717,0.00014678031,0.0012903315,0.00016267378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007792157,0.00009758362,0.0001888803,0.000249952,0.00022286673,0.0003194941,0.00019088827,0.000032036412,0.00015792492],"category_scores_gemma":[0.00009868884,0.000087242224,0.00006454567,0.0008008621,0.00012743428,0.000513528,0.000019767667,0.00025987954,0.000022929486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003109927,0.000038254853,0.000035667166,0.000009206074,0.000038799746,8.850566e-7,0.00045780276,0.8976051,0.00062527903,0.00013557174,0.00093959563,0.10011073],"study_design_scores_gemma":[0.0004042574,0.00035778122,0.00003980881,0.00003982534,0.000008059431,0.000022077636,0.00078232476,0.9956167,0.0012734955,0.00006739428,0.001285996,0.00010228644],"about_ca_topic_score_codex":0.000051353527,"about_ca_topic_score_gemma":0.000006746508,"teacher_disagreement_score":0.51987404,"about_ca_system_score_codex":0.0000963984,"about_ca_system_score_gemma":0.00011049947,"threshold_uncertainty_score":0.35576347},"labels":[],"label_agreement":null},{"id":"W1967332144","doi":"10.1080/09511920802403933","title":"Optimal layout and path planning for flame cutting of sheet metals","year":2009,"lang":"en","type":"article","venue":"International Journal of Computer Integrated Manufacturing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematical optimization; Path (computing); Computer science; Heuristic; Block (permutation group theory); Path length; Algorithm; Mathematics","score_opus":0.013107781187262706,"score_gpt":0.25171816102382394,"score_spread":0.23861037983656122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967332144","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.40316656,0.0001963532,0.59529114,0.00010480697,0.00082721363,0.00006865302,0.000010748944,0.000043386222,0.00029113857],"genre_scores_gemma":[0.895005,0.000034998742,0.104581594,0.00008384158,0.0002529747,7.403788e-7,0.000009934945,0.000014197966,0.000016718914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904937,0.000015258209,0.00051178806,0.000086206106,0.00020843562,0.00012894208],"domain_scores_gemma":[0.99933606,0.00009072385,0.00021838323,0.00005471038,0.00024341285,0.000056734974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021924746,0.00013880686,0.00024105672,0.0002683109,0.00002331655,0.00009858764,0.00023516742,0.000055665983,0.000014660897],"category_scores_gemma":[0.000018728384,0.00011982922,0.000098301985,0.000037662983,0.000015641788,0.00025609115,0.00001999539,0.00018735522,5.073173e-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.000045605506,0.000016896547,0.00009630961,0.000021878634,0.00020197331,0.000016751215,0.0006450648,0.96951884,0.00093697297,0.00013831838,0.00053442415,0.027826967],"study_design_scores_gemma":[0.00147039,0.00032108417,0.0020151436,0.0009990159,0.000049023827,0.00031011435,0.00013099734,0.90361637,0.08433098,0.0006110053,0.00586803,0.00027783363],"about_ca_topic_score_codex":0.000001929648,"about_ca_topic_score_gemma":1.29138e-7,"teacher_disagreement_score":0.49183846,"about_ca_system_score_codex":0.000042552998,"about_ca_system_score_gemma":0.000017528875,"threshold_uncertainty_score":0.48864937},"labels":[],"label_agreement":null},{"id":"W1967724669","doi":"10.1145/2816795.2818087","title":"Dapper","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Science and Technology Planning Project of Guangdong Province; Israel Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; 3D printing; Decomposition; Volume (thermodynamics); Key (lock); Simulated annealing; Container (type theory); Object (grammar); Pruning; Algorithm; Focus (optics); Mathematical optimization; Mathematics; Mechanical engineering; Artificial intelligence; Engineering","score_opus":0.0425676426562453,"score_gpt":0.24013298035322755,"score_spread":0.19756533769698226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967724669","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.0037378557,0.0001292838,0.9792965,0.00066256546,0.0010352812,0.0001125313,0.000015865413,0.0009282569,0.014081858],"genre_scores_gemma":[0.99264145,0.00017437409,0.0064823227,0.00030061175,0.000022533579,0.000013600791,0.0000068257195,0.000029688366,0.00032859793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999607,0.000009491776,0.00008845848,0.00007625757,0.00010847164,0.00011029843],"domain_scores_gemma":[0.9995715,0.000022790387,0.0000061879514,0.000272643,0.00003569489,0.00009117139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006657239,0.000079024176,0.000060437786,0.0001218042,0.000045887293,0.000022008493,0.00011272683,0.0000659318,0.000075622615],"category_scores_gemma":[0.000007427565,0.00008022969,0.000040725383,0.00030860325,0.000020432853,0.000078994664,7.908698e-7,0.00015795506,0.00011154408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070501806,0.000053615364,0.00013244501,0.000017829132,0.000050718958,0.0000017889388,0.0005834733,0.9821044,0.00005247758,0.0016391051,0.0046244483,0.010732599],"study_design_scores_gemma":[0.0031595186,0.0003663152,0.0007153559,0.00011311119,0.00013417492,0.00005072229,0.00053586374,0.3231184,0.0066836653,0.025324477,0.63832176,0.0014766183],"about_ca_topic_score_codex":0.000004002153,"about_ca_topic_score_gemma":0.000016173039,"teacher_disagreement_score":0.9889036,"about_ca_system_score_codex":0.000014704862,"about_ca_system_score_gemma":0.000010163349,"threshold_uncertainty_score":0.32716718},"labels":[],"label_agreement":null},{"id":"W1969327924","doi":"10.1287/opre.2013.1248","title":"Combinatorial Benders' Cuts for the Strip Packing Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bounding overwatch; Packing problems; Benchmark (surveying); Scheduling (production processes); Heuristic; Mathematical optimization; Benders' decomposition; Computer science; Heuristics; Bin packing problem; Set (abstract data type); Preprocessor; Algorithm; Container (type theory); Set packing; Mathematics; Artificial intelligence","score_opus":0.0674461263503884,"score_gpt":0.3422510084130599,"score_spread":0.2748048820626715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969327924","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.0029691125,0.0003165211,0.87872845,0.004615261,0.00201513,0.002957553,0.00003919589,0.0004951482,0.10786361],"genre_scores_gemma":[0.993718,0.000067174326,0.0040138834,0.000031356103,0.0003362412,0.0003033297,0.000040130464,0.000032768738,0.0014570986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991048,0.000087972454,0.00014150854,0.00012331292,0.0002583961,0.00028403132],"domain_scores_gemma":[0.9990617,0.000367808,0.0000042280817,0.00024137417,0.0002717093,0.000053195385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087293,0.000072836265,0.00007254749,0.0000952672,0.000679765,0.0003234018,0.00020664923,0.000061031442,0.00009137813],"category_scores_gemma":[0.00018650698,0.000055613044,0.000030779298,0.00032166374,0.000051188665,0.00011940146,0.000030342722,0.0002472229,0.00005574595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003826489,0.000019480154,0.00003736382,0.000032499745,0.000021788868,8.036543e-8,0.000495293,0.8276622,0.00045974957,0.15377286,0.012616507,0.004878336],"study_design_scores_gemma":[0.00041471227,0.000046566533,0.000031025967,0.000014134096,0.0000037884877,6.838497e-7,0.00011346182,0.86817545,0.00054247235,0.0016752292,0.12890156,0.00008090717],"about_ca_topic_score_codex":0.000032812564,"about_ca_topic_score_gemma":0.00010055332,"teacher_disagreement_score":0.9907489,"about_ca_system_score_codex":0.00004514353,"about_ca_system_score_gemma":0.000044511544,"threshold_uncertainty_score":0.52282715},"labels":[],"label_agreement":null},{"id":"W1972546074","doi":"10.1007/s10898-010-9572-2","title":"The small hexagon and heptagon with maximum sum of distances between vertices","year":2010,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Polygon (computer graphics); Euclidean distance; Quadratic equation; Geometry","score_opus":0.0062024863561351016,"score_gpt":0.20360904081886025,"score_spread":0.19740655446272515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972546074","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.5657944,0.0010578604,0.42813212,0.0005814409,0.0008169839,0.00015781389,0.000018792853,0.0000489425,0.0033916605],"genre_scores_gemma":[0.9702143,0.00045197573,0.0292223,0.000008920067,0.00007757753,5.305263e-7,0.00000287189,0.000009764206,0.000011767442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994047,0.000017368036,0.00028403095,0.00004932539,0.00014402223,0.000100516416],"domain_scores_gemma":[0.99945897,0.000049944967,0.00018967286,0.00007785334,0.00016521536,0.0000583259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019528597,0.00008329523,0.00013720115,0.000023636938,0.00006193713,0.00007162511,0.00010824176,0.000052463674,0.000007860967],"category_scores_gemma":[0.000032818825,0.00005307455,0.000026551952,0.00016765401,0.00006221147,0.00018390667,0.000009400085,0.00012449232,2.8577705e-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.000042715896,0.000009973859,0.03810312,0.00003074377,0.000053949418,9.4918846e-7,0.000072581686,0.95662665,0.00008659591,0.00041229514,0.00008134307,0.004479097],"study_design_scores_gemma":[0.004814635,0.0013549626,0.10397803,0.00057714194,0.0005853113,0.00022518449,0.0007079908,0.85962415,0.0038257053,0.0019982955,0.021355072,0.0009535257],"about_ca_topic_score_codex":0.0000047707645,"about_ca_topic_score_gemma":0.00007205406,"teacher_disagreement_score":0.4044199,"about_ca_system_score_codex":0.000019732017,"about_ca_system_score_gemma":0.000023832523,"threshold_uncertainty_score":0.21643172},"labels":[],"label_agreement":null},{"id":"W1972590396","doi":"10.1007/s10732-010-9150-2","title":"A tabu search algorithm for the covering design problem","year":2010,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Block (permutation group theory); Algorithm; Set (abstract data type); Exploit; Mathematics; Computer science; Mathematical optimization; Combinatorics; Order (exchange); Space (punctuation)","score_opus":0.02156927472276331,"score_gpt":0.24791430362817013,"score_spread":0.2263450289054068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972590396","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.00033985852,0.00016027517,0.9980146,0.000113596274,0.000902794,0.00014547637,0.0000072808202,0.000025291427,0.00029082742],"genre_scores_gemma":[0.10562535,0.0003276794,0.8930854,0.00005382709,0.00064361293,0.0000054544685,0.0000011978505,0.0000453422,0.00021213833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942315,0.000012200514,0.00023882862,0.000036920483,0.00014813144,0.00014079077],"domain_scores_gemma":[0.99928236,0.00031722826,0.00006199807,0.00008880292,0.00019341962,0.00005619322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005536678,0.000070760056,0.00010517587,0.000050497085,0.00007431919,0.00007131498,0.00015774807,0.00004788891,0.000028761106],"category_scores_gemma":[0.00007462422,0.000048997805,0.000052872587,0.000081621605,0.000021396376,0.00005868018,0.000010362652,0.0003574379,0.0000041196745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009082352,0.000019525314,0.000063226806,0.000051914656,0.000067153,0.0000070628043,0.000305501,0.9347387,0.0019304699,0.00035582602,0.009797076,0.052654486],"study_design_scores_gemma":[0.00034094768,0.00007016152,0.000053680113,0.00002256605,0.000029485502,0.0000928814,0.000025388437,0.953251,0.0014648648,0.00042179038,0.04414887,0.00007836076],"about_ca_topic_score_codex":8.976331e-7,"about_ca_topic_score_gemma":9.3365884e-7,"teacher_disagreement_score":0.10528549,"about_ca_system_score_codex":0.0000147438695,"about_ca_system_score_gemma":0.0000426251,"threshold_uncertainty_score":0.19980726},"labels":[],"label_agreement":null},{"id":"W1981124180","doi":"10.1002/pts.543","title":"Optimal portion control using variable cutter‐blade spacing in can‐filling","year":2001,"lang":"en","type":"article","venue":"Packaging Technology and Science","topic":"Optimization and Packing Problems","field":"Engineering","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blade (archaeology); Context (archaeology); Interval (graph theory); Process (computing); Constant (computer programming); Optimal control; Fish <Actinopterygii>; Mathematics; Variable (mathematics); Control theory (sociology); Computer science; Engineering; Mathematical optimization; Control (management); Mechanical engineering; Artificial intelligence; Mathematical analysis; Geology","score_opus":0.009657347332921298,"score_gpt":0.22056249330027114,"score_spread":0.21090514596734983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981124180","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.67096007,0.00016116281,0.32703945,0.0003325806,0.00015122033,0.00007950644,0.0000010265035,0.00033687093,0.00093811273],"genre_scores_gemma":[0.97026545,0.000054745335,0.029575054,0.000058840807,0.000013357732,0.0000041921003,6.233583e-7,0.000010232697,0.000017483168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912405,0.000007999349,0.00016940359,0.0002247541,0.00009955677,0.00037421664],"domain_scores_gemma":[0.99972343,0.000017930846,0.0000323788,0.00014639455,0.000033652315,0.000046203768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042646614,0.00010243268,0.00012980691,0.00070159405,0.00019746536,0.00006142723,0.00014695342,0.00009551003,0.000012915096],"category_scores_gemma":[0.00006398856,0.00010872154,0.000008984546,0.0014960122,0.00024322925,0.00023168116,0.000035317138,0.00021718444,0.000002315689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023025018,0.0000066758425,0.08850408,0.000013187579,0.0000037979275,0.000013364711,0.00021517984,0.87325656,0.033796664,0.0027819353,0.0000045941933,0.0014016615],"study_design_scores_gemma":[0.00029719237,0.000010239606,0.0010358875,0.00008138958,0.0000055177434,0.000101725,0.00012898404,0.99364054,0.0032857975,0.0010860572,0.00017019315,0.00015647372],"about_ca_topic_score_codex":0.000023404205,"about_ca_topic_score_gemma":0.000007920691,"teacher_disagreement_score":0.2993054,"about_ca_system_score_codex":0.00006904176,"about_ca_system_score_gemma":0.000034839977,"threshold_uncertainty_score":0.44335356},"labels":[],"label_agreement":null},{"id":"W1982112521","doi":"10.1287/moor.1110.0515","title":"A Polynomial Time <i>OPT</i> + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Bin packing problem; Bin; Constant (computer programming); Time complexity; Combinatorics; Cutting stock problem; Object (grammar); Integer (computer science); Mathematical optimization; Algorithm; Discrete mathematics; Optimization problem; Computer science; Artificial intelligence","score_opus":0.06488040621657191,"score_gpt":0.32069476667941305,"score_spread":0.2558143604628411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982112521","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.02078968,0.00018399372,0.8785082,0.00015955686,0.000080380516,0.0046757925,0.00024887192,0.00018123264,0.09517231],"genre_scores_gemma":[0.21529378,0.000037440117,0.7828625,0.000004909125,0.00002967537,0.00031578497,0.000011474761,0.000054977547,0.0013894615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989749,0.00003914608,0.00035393215,0.00010217771,0.00030174875,0.00022806192],"domain_scores_gemma":[0.9987754,0.00036899687,0.00003243394,0.00028447722,0.0004988124,0.000039840943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008670966,0.00010150099,0.00019092824,0.00009731765,0.00017444092,0.00004576814,0.00022170959,0.00005162349,0.00025816684],"category_scores_gemma":[0.00008197782,0.00006865686,0.000043855372,0.00032325438,0.00016626684,0.000098043,0.000039585462,0.00016434646,0.000021805508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020542397,0.0029217924,0.0005469689,0.006465664,0.0024706228,0.000008993279,0.1515901,0.6534234,0.032702263,0.051764797,0.030492488,0.067407496],"study_design_scores_gemma":[0.00044768918,0.000111893634,0.0000031227878,0.00016417041,0.000022216438,0.000013392591,0.000720074,0.9869955,0.010957085,0.00013163575,0.00032912163,0.00010405912],"about_ca_topic_score_codex":0.000045570378,"about_ca_topic_score_gemma":0.000017706985,"teacher_disagreement_score":0.33357215,"about_ca_system_score_codex":0.000022839611,"about_ca_system_score_gemma":0.00011297759,"threshold_uncertainty_score":0.28267458},"labels":[],"label_agreement":null},{"id":"W1991548888","doi":"10.1287/opre.2014.1307","title":"An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université Laval","funders":"","keywords":"Bin packing problem; Packing problems; Mathematical optimization; Algorithm; Set packing; Benchmark (surveying); Branch and cut; Benders' decomposition; Preprocessor; Integer programming; Cutting stock problem; Relaxation (psychology); Heuristics; Computer science; Mathematics; Exact solutions in general relativity; Integer (computer science); Optimization problem; Bin","score_opus":0.0416455721630172,"score_gpt":0.3361884072885659,"score_spread":0.2945428351255487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991548888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008509349,0.000051219413,0.9842901,0.0004455524,0.00011223407,0.0009312357,0.00004212221,0.00017757906,0.0054405765],"genre_scores_gemma":[0.85995096,0.000006116979,0.1391225,0.000048700724,0.00017053401,0.0002271889,0.00009868562,0.00003993009,0.0003354025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988074,0.00012199344,0.0001605086,0.0001972405,0.00035948146,0.0003534033],"domain_scores_gemma":[0.9989106,0.00034298137,0.0000074820205,0.00024774327,0.00038899982,0.00010217961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206418,0.00010956083,0.00009502714,0.000128784,0.0008278057,0.00034528135,0.00018250404,0.00004622171,0.0002708994],"category_scores_gemma":[0.000043212767,0.00007512651,0.000024620938,0.00033475278,0.00017227278,0.00022784875,0.000019884536,0.0002893749,0.00003188619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034564105,0.000019771722,0.000067609995,0.000011306497,0.000023500306,5.16984e-7,0.00021160625,0.92928785,0.0012246758,0.0059360177,0.00026338565,0.06295033],"study_design_scores_gemma":[0.00046790863,0.000098636316,0.0000716455,0.00003066808,0.0000058637665,0.000013407083,0.00008834985,0.99606293,0.0007162737,0.00009532561,0.0022308005,0.00011818594],"about_ca_topic_score_codex":0.000023717197,"about_ca_topic_score_gemma":0.00016507991,"teacher_disagreement_score":0.85144156,"about_ca_system_score_codex":0.000043477914,"about_ca_system_score_gemma":0.000097957636,"threshold_uncertainty_score":0.6366896},"labels":[],"label_agreement":null},{"id":"W1993924585","doi":"10.1002/net.20448","title":"Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Pickup; Travelling salesman problem; Benchmark (surveying); Stack (abstract data type); Constraint (computer-aided design); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Artificial intelligence; Computer network","score_opus":0.014590875047121185,"score_gpt":0.21152627650574535,"score_spread":0.19693540145862415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993924585","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.018421052,0.0028988975,0.97609574,0.000059384533,0.00021681366,0.00057214533,0.000011164373,0.00018721966,0.0015375649],"genre_scores_gemma":[0.9947367,0.00033362606,0.004370584,0.00007774628,0.0002856326,0.000045346944,0.000023351651,0.0000432766,0.00008376279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930805,0.000015263045,0.00010841834,0.000094877,0.000078924175,0.00039444858],"domain_scores_gemma":[0.9995618,0.00018385061,0.000015349902,0.00012328826,0.000036954043,0.00007879168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025908757,0.000112461115,0.00009474437,0.000019141231,0.00015955529,0.000054692704,0.000070901864,0.00007580817,0.000019209081],"category_scores_gemma":[0.0000029948455,0.00007802997,0.00002207838,0.000101198435,0.000020568756,0.00011549956,0.000018813567,0.00018120224,0.000002640102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020542591,0.000017786602,0.039187748,0.000052618565,0.00005410043,2.120729e-7,0.0013433393,0.95128536,0.000009979227,0.0008193396,0.0006715589,0.0065374286],"study_design_scores_gemma":[0.00069159805,0.000030216212,0.0027711084,0.000037243062,0.000023816956,0.000003847524,0.000179404,0.9890074,0.000036795034,0.000009904175,0.007073642,0.00013498754],"about_ca_topic_score_codex":0.000004738752,"about_ca_topic_score_gemma":0.00004388416,"teacher_disagreement_score":0.9763156,"about_ca_system_score_codex":0.000014394971,"about_ca_system_score_gemma":0.0000072909947,"threshold_uncertainty_score":0.31819698},"labels":[],"label_agreement":null},{"id":"W1994121331","doi":"10.1108/13552510310493738","title":"Availability modeling and optimization of reconfigurable manufacturing systems","year":2003,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Control reconfiguration; Mathematical optimization; Integer programming; Linear programming; Computer science; Production (economics); Reliability engineering; Component (thermodynamics); Failure rate; Basis (linear algebra); Stochastic programming; Robust optimization; Engineering; Mathematics; Embedded system","score_opus":0.02289221077093223,"score_gpt":0.23764739873515703,"score_spread":0.2147551879642248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994121331","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.2561338,0.0008669951,0.7417042,0.000020008925,0.00050704787,0.000097701166,0.0000023114128,0.000034544704,0.00063335005],"genre_scores_gemma":[0.9786188,0.0004691844,0.020848166,0.0000047437693,0.000020022371,0.0000018790419,5.5925966e-7,0.000019935915,0.00001668447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.00005466,0.0008530773,0.00008377085,0.00014301621,0.00018077373],"domain_scores_gemma":[0.99947363,0.00009016882,0.00015356737,0.00011616428,0.00010674092,0.000059719016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001564567,0.00012071817,0.00033497837,0.00018126644,0.000014022986,0.000028181792,0.00007556009,0.00007234551,0.00001355403],"category_scores_gemma":[0.00029045937,0.00011809819,0.000046380836,0.00013048116,0.00001211962,0.00024539104,0.000004447143,0.00023831597,3.238997e-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.000005433297,0.000009523174,0.00031358356,0.00042168173,0.00001648792,0.0000016750787,0.00025505797,0.9975483,0.00061878405,0.0007104513,0.00000747559,0.000091568116],"study_design_scores_gemma":[0.0003810254,0.00001578279,0.0001254867,0.00039396467,0.00000574032,0.000032356296,0.00022321987,0.9967077,0.0017928518,0.000065342225,0.0001296503,0.00012689801],"about_ca_topic_score_codex":0.000012415091,"about_ca_topic_score_gemma":0.0000016270299,"teacher_disagreement_score":0.72248507,"about_ca_system_score_codex":0.00009541213,"about_ca_system_score_gemma":0.000016938173,"threshold_uncertainty_score":0.48159045},"labels":[],"label_agreement":null},{"id":"W1999168546","doi":"10.1109/sws.2010.5607474","title":"A general social intelligent algorithmic framework for packing problem with multi-processors","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Packing problems; Computer science; Rectangle; Set packing; Construct (python library); Bin packing problem; Algorithm; Circle packing; Algorithm design; Theoretical computer science; Mathematics; Set (abstract data type)","score_opus":0.019992981875487235,"score_gpt":0.2663601429557878,"score_spread":0.24636716108030057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999168546","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.0073606283,0.000016304084,0.98955286,0.0001442265,0.00033068995,0.00040820037,0.000007513634,0.00053966895,0.0016399234],"genre_scores_gemma":[0.23194763,0.000008212066,0.76693565,0.000094587114,0.00027430203,0.00011130427,0.000016565635,0.00006239345,0.00054938474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927783,0.0000049696205,0.00016987597,0.00016740776,0.00010055419,0.00027933414],"domain_scores_gemma":[0.999689,0.0000309712,0.00003114577,0.000102539256,0.0000814189,0.00006495208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096458345,0.00016088848,0.00013803801,0.00006202613,0.00012061236,0.00008765849,0.00011724591,0.00015453574,0.00015400098],"category_scores_gemma":[0.000014052665,0.00013270158,0.000046958186,0.00016694207,0.000030624895,0.00008985152,0.000012929226,0.00028732728,0.000016417294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008299479,0.00030012525,0.0029581361,0.001187714,0.00044612322,0.000006267805,0.014153948,0.6442546,0.007940218,0.17964435,0.0038308708,0.14519463],"study_design_scores_gemma":[0.00076611724,0.00006525763,0.00015249211,0.00005495525,0.000029508717,0.000008818567,0.00017594997,0.97011954,0.009358822,0.003376361,0.0153177725,0.0005743931],"about_ca_topic_score_codex":0.000007346122,"about_ca_topic_score_gemma":0.00007850815,"teacher_disagreement_score":0.32586494,"about_ca_system_score_codex":0.000018287532,"about_ca_system_score_gemma":0.000019856416,"threshold_uncertainty_score":0.54114133},"labels":[],"label_agreement":null},{"id":"W2000933343","doi":"10.1115/1.1395020","title":"Stamping Blank Optimal Layout and Coil Slitting Widths for Single and Multiple Blanks","year":2000,"lang":"en","type":"article","venue":"Journal of Engineering Materials and Technology","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Blank; Stamping; STRIPS; Electromagnetic coil; Die (integrated circuit); Scrap; Mechanical engineering; Raw material; Engineering drawing; Engineering; Materials science; Composite material; Electrical engineering","score_opus":0.006038137746723978,"score_gpt":0.18106335611782393,"score_spread":0.17502521837109994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000933343","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.9922122,0.0008843364,0.0063251806,0.00010927437,0.00019779381,0.00008620534,0.000013093268,0.00012907894,0.000042842472],"genre_scores_gemma":[0.9778254,0.00054316357,0.021493096,0.000008786894,0.000081166574,0.000002658553,0.000001642412,0.000028484848,0.00001561577],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993893,0.000004828054,0.00029816673,0.00008786186,0.000042357104,0.00017751637],"domain_scores_gemma":[0.9997298,0.000065635984,0.000057392794,0.000058252754,0.00003927123,0.000049664424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017118698,0.00012437739,0.00025894612,0.00017364016,0.000040978353,0.00007611797,0.00005128978,0.00013612535,0.000021991727],"category_scores_gemma":[0.00007034516,0.000118055985,0.000014388087,0.00007277483,0.00003171244,0.00009917953,0.000017971053,0.00009330562,3.486272e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041361756,0.000020116895,0.000595203,0.0005377745,0.00011261933,0.00001635918,0.00030986327,0.16038094,0.8211725,0.00038309488,0.00006757037,0.01636264],"study_design_scores_gemma":[0.007580079,0.0015764828,0.001532764,0.0014272727,0.00022025543,0.0028654933,0.0003486788,0.40248662,0.54451144,0.00086275203,0.03514478,0.0014433602],"about_ca_topic_score_codex":0.0000014903453,"about_ca_topic_score_gemma":3.295779e-7,"teacher_disagreement_score":0.276661,"about_ca_system_score_codex":0.000011975724,"about_ca_system_score_gemma":0.0000043557634,"threshold_uncertainty_score":0.4814183},"labels":[],"label_agreement":null},{"id":"W2007666940","doi":"10.1007/978-3-642-21311-3_13","title":"On Counting Lattice Points and Chvátal-Gomory Cutting Planes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Polytechnique Montréal","funders":"","keywords":"Hyperplane; Combinatorics; Lattice (music); Computer science; Integer programming; Set (abstract data type); Counting problem; Mathematics; Algorithm; Physics","score_opus":0.015720405695315368,"score_gpt":0.20746679450639208,"score_spread":0.1917463888110767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007666940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076054165,0.00052296795,0.95637995,0.00006609197,0.00138658,0.0001940346,0.0000058914857,0.00028568943,0.040398274],"genre_scores_gemma":[0.7021155,0.00046159013,0.29268223,0.0026410075,0.0009365598,0.000008021215,0.000028423863,0.00023226233,0.00089442625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883175,0.0000069619487,0.00021689781,0.00041151114,0.00025061998,0.00028227927],"domain_scores_gemma":[0.99932384,0.000242818,0.000068513844,0.00025238673,0.000046254474,0.00006618189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003139344,0.00026844922,0.00022327567,0.00030230335,0.000110818335,0.00014961412,0.00029311716,0.00017798568,0.000054574637],"category_scores_gemma":[0.000041248837,0.000259444,0.000025982143,0.00011237813,0.00018030519,0.00013322984,0.00010822658,0.00045496225,0.00003208423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070701367,0.000011245749,0.00025538236,0.00032761288,0.000023708293,0.00005170626,0.0024228578,0.6182761,0.000051955125,0.013982412,0.00004979535,0.36454016],"study_design_scores_gemma":[0.00027921895,0.00008363058,0.0001608452,0.0013925681,0.000014408683,0.00007803861,2.8964442e-7,0.9309366,0.00062731584,0.06301739,0.002585245,0.0008244943],"about_ca_topic_score_codex":0.00000679837,"about_ca_topic_score_gemma":0.000013116506,"teacher_disagreement_score":0.7013549,"about_ca_system_score_codex":0.00005372949,"about_ca_system_score_gemma":0.000030246165,"threshold_uncertainty_score":0.99998575},"labels":[],"label_agreement":null},{"id":"W2009313397","doi":"10.1139/l03-101","title":"Using genetic algorithms in solving the one-dimensional cutting stock problem in the construction industry","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Construction waste; Stock (firearms); Integer programming; Cutting stock problem; Genetic algorithm; Profit (economics); Engineering; Linear programming; Mathematical optimization; Optimization problem; Computer science; Operations research; Waste management; Mathematics; Economics; Mechanical engineering","score_opus":0.020057648885477543,"score_gpt":0.2078137493595844,"score_spread":0.18775610047410687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009313397","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.85060275,0.002938071,0.14160731,0.0009498093,0.0017429789,0.0005223138,0.000007446267,0.000061892104,0.0015674074],"genre_scores_gemma":[0.9759951,0.00001167151,0.023765717,0.00004915573,0.00014550077,0.000002726095,6.268129e-7,0.000027727096,0.0000017231844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.000025443265,0.00040351192,0.00007368487,0.00016194549,0.00032187585],"domain_scores_gemma":[0.9996083,0.00004872186,0.00006874029,0.00009991173,0.000048019305,0.00012629972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044424503,0.00012851325,0.0001467963,0.00039436473,0.00007615684,0.00008537278,0.00019562746,0.00012497952,0.00002721707],"category_scores_gemma":[0.000049094975,0.00010569988,0.000041625928,0.0005014155,0.000028638864,0.00016589908,0.000006410765,0.000917312,7.6528687e-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":[4.84386e-7,0.000002698851,0.0019885497,0.000022318885,0.000012063544,0.00004530505,0.0010626754,0.9959828,0.00019098666,0.00014286514,0.000012700038,0.00053651683],"study_design_scores_gemma":[0.00093002047,0.00003133912,0.011608258,0.0013242208,0.000025629368,0.0014613019,0.0005544994,0.98241156,0.0001970341,0.0005357394,0.0005820093,0.00033839446],"about_ca_topic_score_codex":0.0008343588,"about_ca_topic_score_gemma":0.01708474,"teacher_disagreement_score":0.12539238,"about_ca_system_score_codex":0.00034712843,"about_ca_system_score_gemma":0.00032891368,"threshold_uncertainty_score":0.9533686},"labels":[],"label_agreement":null},{"id":"W2013696768","doi":"10.5555/1109557.1109575","title":"An asymptotic approximation algorithm for 3D-strip packing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bin packing problem; Approximation algorithm; Mathematics; Algorithm; Combinatorics; Packing problems; Bin; Set (abstract data type); Computer science","score_opus":0.00843081260272268,"score_gpt":0.23180925757714604,"score_spread":0.22337844497442336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013696768","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.00075562706,0.000104109626,0.9850903,0.00012757636,0.0009192692,0.0007267048,0.00016416311,0.0010154577,0.011096787],"genre_scores_gemma":[0.27304322,0.00012968875,0.7195329,0.0002511725,0.0020719504,0.00049157406,0.0026597567,0.0004041378,0.0014155911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998365,0.00004086063,0.00041337594,0.00039705457,0.00028734357,0.0004963777],"domain_scores_gemma":[0.9992401,0.0000653622,0.00008013572,0.00040043585,0.000090599875,0.00012336895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023627738,0.00033696066,0.00026676906,0.00019269103,0.00018356237,0.00021701989,0.00021873356,0.00017835495,0.000037726106],"category_scores_gemma":[0.000006511974,0.0003373019,0.00011531054,0.00028454876,0.00004081532,0.00038327402,0.000013948303,0.00016657403,0.00004851236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001276793,0.00013758382,0.00007903466,0.00013369843,0.000063359075,0.0000041879066,0.00024252893,0.8815109,0.0041821604,0.0023699482,0.001773908,0.109489925],"study_design_scores_gemma":[0.0008240507,0.0001926222,0.00013433602,0.00005223328,0.000034075023,0.000006212303,0.00003182553,0.9872912,0.0043751923,0.000710742,0.00588572,0.00046177336],"about_ca_topic_score_codex":0.000024019557,"about_ca_topic_score_gemma":0.00000525147,"teacher_disagreement_score":0.2722876,"about_ca_system_score_codex":0.00011182166,"about_ca_system_score_gemma":0.000019343948,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null},{"id":"W2014875639","doi":"10.3166/jds.12.79-92","title":"Availability Optimization of Fault-Tolerant Systems","year":2003,"lang":"en","type":"article","venue":"Journal of Decision System","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Humanities; Philosophy","score_opus":0.014258095576729291,"score_gpt":0.225807895212078,"score_spread":0.2115497996353487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014875639","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.041403253,0.0014991943,0.9484093,0.000004576949,0.0025527664,0.00016831783,0.000006789418,0.000052732812,0.00590306],"genre_scores_gemma":[0.9781876,0.00007804319,0.02160415,0.00000276713,0.00004733825,0.0000010028549,7.5829684e-7,0.000021357448,0.00005697993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980706,0.00012086624,0.0011734493,0.00007948843,0.00044132068,0.000114251205],"domain_scores_gemma":[0.9986146,0.00016106399,0.00040053696,0.0002171916,0.0005133069,0.000093297946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273045,0.000114115326,0.0003991545,0.00020454037,0.000027975362,0.000048004495,0.00014234602,0.000098556746,0.00006159834],"category_scores_gemma":[0.00015662827,0.00008999957,0.00011672515,0.0002940629,0.000013174442,0.00017092252,0.0000066375023,0.00012295447,0.0000216048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014630527,0.000018391229,0.000579179,0.000205192,0.000029632816,0.000006476249,0.00009653308,0.9974727,0.000105707026,0.00027531214,0.00087462284,0.0003216124],"study_design_scores_gemma":[0.0012445267,0.00011026457,0.00014581205,0.001334871,0.000041435538,0.00060422043,0.0005830916,0.9853273,0.0010899168,0.000017689583,0.009309302,0.00019158851],"about_ca_topic_score_codex":0.000001214335,"about_ca_topic_score_gemma":2.487387e-7,"teacher_disagreement_score":0.9367843,"about_ca_system_score_codex":0.00010909799,"about_ca_system_score_gemma":0.000038872877,"threshold_uncertainty_score":0.3670076},"labels":[],"label_agreement":null},{"id":"W2015024493","doi":"10.1007/s10107-003-0469-4","title":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Cutting-plane method; Column generation; Branch and bound; Bin packing problem; Algorithm; Interior point method; Mathematics; Bin; Mathematical optimization; Branching (polymer chemistry); Point (geometry); Dual (grammatical number); Plane (geometry); Tree (set theory); Computer science; Integer programming; Geometry; Combinatorics","score_opus":0.017040599436853755,"score_gpt":0.275635538636096,"score_spread":0.25859493919924226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015024493","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.009144701,0.00008410742,0.9893991,0.00008345889,0.00007808447,0.00024567582,0.0000011686598,0.00022510998,0.00073861255],"genre_scores_gemma":[0.22006103,0.000008423529,0.7798103,0.000014898788,0.000026741749,0.00002679579,0.0000049819773,0.000025818248,0.000020964748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991521,0.00003727309,0.00037634216,0.00011768831,0.0001356857,0.00018090974],"domain_scores_gemma":[0.999515,0.0001512572,0.00006898249,0.00015937393,0.00003746419,0.00006793807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007315122,0.00012369205,0.00017281252,0.00004180088,0.000092842885,0.00012026493,0.00010717859,0.000059749374,0.000010285031],"category_scores_gemma":[0.00014171483,0.000086097745,0.000034736266,0.00014553769,0.000055552864,0.00013382567,0.000028239721,0.00017237614,0.0000062239515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007816571,0.000056192956,0.0000048987476,0.00036573948,0.000052985633,0.0000029394841,0.010994081,0.0179323,0.0032682612,0.03544141,0.0000043663185,0.93186903],"study_design_scores_gemma":[0.0004836683,0.00014241022,0.000011052119,0.0004587414,0.000032376327,0.00009300052,0.0013389239,0.93087167,0.019230334,0.04673723,0.00035916344,0.00024145145],"about_ca_topic_score_codex":0.000007526978,"about_ca_topic_score_gemma":0.000007782868,"teacher_disagreement_score":0.9316276,"about_ca_system_score_codex":0.00002783488,"about_ca_system_score_gemma":0.00000847879,"threshold_uncertainty_score":0.35109642},"labels":[],"label_agreement":null},{"id":"W2015457254","doi":"10.1007/s11227-007-0144-2","title":"A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Computer science; Heuristic; Multiprocessing; Parallel computing; Overhead (engineering); Change-making problem; Mathematical optimization; Algorithm; Continuous knapsack problem; Mathematics","score_opus":0.03654757383663416,"score_gpt":0.2712778168740724,"score_spread":0.23473024303743822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015457254","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.23680905,0.00041500683,0.7617663,0.00010155068,0.00044470147,0.00028072455,0.0000056148992,0.00009872428,0.00007830686],"genre_scores_gemma":[0.81639886,0.000005414893,0.1831199,0.00015135201,0.00025408747,0.0000011057776,0.0000040209725,0.00004253067,0.00002272088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.000039675444,0.0006384781,0.00008898877,0.00023512098,0.00034263072],"domain_scores_gemma":[0.99716985,0.0021275529,0.00014190954,0.000116896124,0.00033257963,0.000111235175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017659136,0.00017424674,0.00022892414,0.0001442911,0.00018852533,0.000037001173,0.00025179132,0.00007411065,0.000015667514],"category_scores_gemma":[0.00048084892,0.0001258095,0.00011513593,0.00020654056,0.00003824161,0.0001359721,0.000021568665,0.0003210536,0.0000053520803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055420325,0.0000556723,0.0026495606,0.00015315608,0.000045244942,0.0000034820878,0.00077494717,0.98866516,0.004447985,0.000009299385,0.0003730942,0.0027669554],"study_design_scores_gemma":[0.0020462202,0.00007113505,0.0018056937,0.00023251207,0.000044824097,0.00006595229,0.00013175736,0.9916015,0.0026648524,0.000018273564,0.0011465055,0.00017074365],"about_ca_topic_score_codex":0.000009757843,"about_ca_topic_score_gemma":0.00002232053,"teacher_disagreement_score":0.57958984,"about_ca_system_score_codex":0.000058791113,"about_ca_system_score_gemma":0.000039308972,"threshold_uncertainty_score":0.51303625},"labels":[],"label_agreement":null},{"id":"W2018050678","doi":"10.1109/icsmc.2012.6377989","title":"Optimization/simulation-based framework for the evaluation of supply chain management policies in the forest product industry","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Supply chain; Supply chain management; Product (mathematics); Computer science; Chain (unit); Business; Marketing","score_opus":0.055645870007668845,"score_gpt":0.3172410658829411,"score_spread":0.26159519587527225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018050678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046731564,0.00023029931,0.9894165,0.0013216365,0.00022963547,0.0015534481,0.000005898767,0.000057746238,0.0025117227],"genre_scores_gemma":[0.9719847,0.000010541287,0.02738386,0.00020506614,0.00009298823,0.00023386625,0.00002751169,0.000015346277,0.00004616362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929386,0.000053893495,0.00018947014,0.00006352182,0.00024578892,0.00015345497],"domain_scores_gemma":[0.9991882,0.000440286,0.00003904216,0.00022956339,0.00008780864,0.000015139178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011964274,0.000080672515,0.000065275635,0.00008419597,0.000058858583,0.000028009026,0.00012922483,0.0000725279,0.00013454845],"category_scores_gemma":[0.00014996578,0.000050255618,0.000027016134,0.00034551194,0.00002035089,0.00008840558,0.000007720475,0.000111545436,0.0000014995818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027588537,0.000025582482,0.009034604,0.00003810059,0.0000146640095,6.043729e-9,0.00074593,0.9756515,4.9310216e-7,0.012873717,0.00021718844,0.0013954258],"study_design_scores_gemma":[0.00025720114,0.000006057395,0.014476673,0.00002676089,0.000037424797,7.326773e-8,0.0003466703,0.98375607,0.00005654752,0.00042391743,0.0005482153,0.00006436537],"about_ca_topic_score_codex":0.000012845913,"about_ca_topic_score_gemma":0.000013981729,"teacher_disagreement_score":0.9673115,"about_ca_system_score_codex":0.000032687403,"about_ca_system_score_gemma":0.0000125689385,"threshold_uncertainty_score":0.20493646},"labels":[],"label_agreement":null},{"id":"W2018407890","doi":"10.1016/j.eswa.2013.03.037","title":"An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems","year":2013,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Bin packing problem; Mathematical optimization; Benchmark (surveying); Iterated local search; Metaheuristic; Computer science; Packing problems; Scheduling (production processes); Heuristic; Generalization; Iterated function; Upper and lower bounds; Job shop scheduling; Bin; Algorithm; Mathematics","score_opus":0.04250410525338499,"score_gpt":0.2585666167977702,"score_spread":0.21606251154438522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018407890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00271181,0.000589838,0.99318177,0.00006961641,0.00005119862,0.0027948509,0.00004191523,0.00039047372,0.00016852499],"genre_scores_gemma":[0.96715254,0.000040562558,0.026158914,0.000031304306,0.00007485361,0.0062076435,0.00013433938,0.000059730264,0.0001401304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990528,0.000038236845,0.00025866777,0.0002690431,0.00012924396,0.00025199883],"domain_scores_gemma":[0.99928814,0.000042946525,0.000039718,0.00030796367,0.00014057856,0.00018062862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013584581,0.00017895002,0.00017850245,0.000081388,0.0001891294,0.00019729993,0.0001096521,0.00007607823,0.000019473244],"category_scores_gemma":[0.0000032153948,0.00014724892,0.000016787593,0.00018801661,0.000058074387,0.00017172175,0.000010509762,0.00010022421,0.000025874411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012930191,0.0003048926,0.0018209984,0.00091396127,0.0001369426,5.593703e-7,0.0061954563,0.9600126,0.015107162,0.004331816,0.0014047287,0.009757941],"study_design_scores_gemma":[0.0005642327,0.000059940554,0.00024804717,0.0000860214,0.0000064561723,0.000013329515,0.00025787269,0.9913531,0.00041963765,0.000015261501,0.0067532016,0.00022292377],"about_ca_topic_score_codex":0.00043497997,"about_ca_topic_score_gemma":0.00003103783,"teacher_disagreement_score":0.96702284,"about_ca_system_score_codex":0.00006841919,"about_ca_system_score_gemma":0.000013415667,"threshold_uncertainty_score":0.6004637},"labels":[],"label_agreement":null},{"id":"W2020936051","doi":"10.1115/imece2002-33572","title":"Stamping Die Strip Optimization for Paired Parts","year":2002,"lang":"en","type":"article","venue":"Manufacturing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Stamping; Blank; Die (integrated circuit); STRIPS; Computer science; Nesting (process); Engineering drawing; Algorithm; Mechanical engineering; Engineering","score_opus":0.03182347864987441,"score_gpt":0.20126647456725266,"score_spread":0.16944299591737827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020936051","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.019887056,0.00038337518,0.9682325,0.00014047888,0.00077221385,0.0004802812,0.000017144635,0.0012246115,0.008862332],"genre_scores_gemma":[0.98144644,0.00017392501,0.01745541,0.00006657526,0.00012133495,0.00004201594,0.000036479403,0.000053389533,0.00060445064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993652,0.000008405775,0.00017067541,0.00013535596,0.000081680744,0.00023869169],"domain_scores_gemma":[0.9997251,0.00003877944,0.000026763973,0.00013841433,0.000015117383,0.000055844725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006632563,0.00012590678,0.00010991335,0.00007314743,0.00010168897,0.00007699591,0.00007427598,0.00006014694,0.00037013227],"category_scores_gemma":[0.000013326341,0.00013580894,0.000046387802,0.000039139566,0.000008244793,0.00014954682,0.0000124833,0.00006717763,0.000022334909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014891582,0.000005529422,0.000019965242,0.00007628144,0.000014288316,8.812054e-7,0.00021407465,0.98710465,0.0000277975,0.000014484927,0.0011872033,0.01133335],"study_design_scores_gemma":[0.0003241803,0.000011895622,0.00004541811,0.00003187658,0.000008458705,0.0000010935227,0.00001844493,0.9627173,0.012532856,0.000043316977,0.024086783,0.00017840193],"about_ca_topic_score_codex":0.0000020573757,"about_ca_topic_score_gemma":0.0000029348637,"teacher_disagreement_score":0.96155936,"about_ca_system_score_codex":0.00005688697,"about_ca_system_score_gemma":0.0000018606398,"threshold_uncertainty_score":0.55381274},"labels":[],"label_agreement":null},{"id":"W2023329664","doi":"10.5539/jmr.v1n2p184","title":"Formulation of Matrix Pade Approximation in Rectangular Full Packed Storage","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Padé approximant; Triangular matrix; Mathematics; Matrix (chemical analysis); Square matrix; Polynomial matrix; Inverse; Band matrix; Single-entry matrix; Matrix polynomial; Polynomial; Combinatorics; Mathematical analysis; Geometry; Symmetric matrix; Pure mathematics; Physics; Materials science","score_opus":0.05501864690917481,"score_gpt":0.3548638293826694,"score_spread":0.2998451824734946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023329664","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.85087186,0.0005011833,0.14493982,0.00021945484,0.00010529643,0.0003002954,0.0000022881181,0.000029748537,0.0030300268],"genre_scores_gemma":[0.94831604,0.00014222683,0.051424567,0.0000020415027,0.000036808236,0.0000010254583,0.000001936971,0.0000132399155,0.00006212606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985921,0.000066019966,0.0005737064,0.000043660268,0.0005607857,0.00016372127],"domain_scores_gemma":[0.9992619,0.00014237687,0.00014478626,0.00012584098,0.00027663738,0.000048437447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021658647,0.000066504545,0.00020245307,0.0005651691,0.00002179833,0.000030918796,0.00013867998,0.000076585406,0.000041996627],"category_scores_gemma":[0.00023811976,0.00005828779,0.000050321072,0.00045924616,0.000013086984,0.00019178558,0.000008918308,0.00032114744,0.0000059068025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010502301,0.0007126615,0.0003603348,0.0021871054,0.000072083116,0.00003556982,0.013330575,0.81694824,0.13665515,0.019247659,0.0021609662,0.008184608],"study_design_scores_gemma":[0.0009397046,0.00033632625,0.0008590038,0.0005489427,0.00001067191,0.000050328836,0.00060551555,0.9513095,0.012626219,0.032336246,0.0002486607,0.00012889807],"about_ca_topic_score_codex":7.838303e-7,"about_ca_topic_score_gemma":0.0000016312373,"teacher_disagreement_score":0.13436122,"about_ca_system_score_codex":0.000102652084,"about_ca_system_score_gemma":0.000028919223,"threshold_uncertainty_score":0.23769072},"labels":[],"label_agreement":null},{"id":"W2024624524","doi":"10.1016/s0304-3975(03)00363-3","title":"An asymptotic fully polynomial time approximation scheme for bin covering","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bin packing problem; Bin; Mathematics; Polynomial-time approximation scheme; Scheme (mathematics); Time complexity; Approximation algorithm; Polynomial; Combinatorics; Dual (grammatical number); Mathematical optimization; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.006235549382664906,"score_gpt":0.2174321802765514,"score_spread":0.2111966308938865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024624524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03940375,0.000006670499,0.9550976,0.00002697901,0.00032988112,0.00017563565,0.0000021740198,0.00025783258,0.0046994854],"genre_scores_gemma":[0.7710934,6.5499944e-7,0.22876541,0.000057588335,0.000053438223,0.000005992489,0.0000030831784,0.000012333291,0.000008090927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916565,0.00002422965,0.00014417607,0.00021224872,0.00016796714,0.0002857274],"domain_scores_gemma":[0.9995338,0.00005760781,0.000015991574,0.00020726213,0.000058205795,0.00012714813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058382505,0.000101848025,0.00010045151,0.00008829785,0.00014435156,0.00019021984,0.00025821934,0.00003962737,0.00009077325],"category_scores_gemma":[0.000042125936,0.000097187854,0.000026278487,0.0003142588,0.00033644852,0.00028763842,0.000021149759,0.00006559361,0.000052427786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062010204,0.000026359603,0.00002168149,0.000026209724,0.000003756329,3.3155447e-7,0.00020121054,0.2501109,0.01322657,0.73305345,0.000087887216,0.0032354228],"study_design_scores_gemma":[0.00020581852,0.00007887188,0.00002791758,0.000011979876,0.0000026247724,0.0000052038863,0.0000017405259,0.98371214,0.010238528,0.0053628413,0.00021143147,0.00014090241],"about_ca_topic_score_codex":1.537321e-7,"about_ca_topic_score_gemma":4.5314483e-8,"teacher_disagreement_score":0.7336012,"about_ca_system_score_codex":0.00004087485,"about_ca_system_score_gemma":0.000029902996,"threshold_uncertainty_score":0.39632055},"labels":[],"label_agreement":null},{"id":"W202515706","doi":"10.1007/978-3-642-41019-2_19","title":"Column Generation Based Heuristic for the Three Dimensional Vehicle Loading Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Concordia University","funders":"","keywords":"Column generation; Computer science; Heuristic; Set (abstract data type); Mathematical optimization; Column (typography); Greedy algorithm; Decomposition; Integer programming; Integer (computer science); Set cover problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.022216607706858082,"score_gpt":0.21634171917539294,"score_spread":0.19412511146853487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202515706","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.000047875375,0.00029262537,0.9969483,0.00028686106,0.0010758882,0.00066093786,0.000007430522,0.00011120171,0.00056888396],"genre_scores_gemma":[0.38313153,0.000018458068,0.6134506,0.001485557,0.0010907003,0.00011422606,0.000057762176,0.00011353886,0.0005376336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889684,0.000005640704,0.00022597656,0.0003394621,0.0002806401,0.00025146996],"domain_scores_gemma":[0.9990944,0.000376047,0.000058908947,0.00028855875,0.00013283956,0.00004924694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027526057,0.00021175861,0.00016481156,0.00013939699,0.0002234054,0.0002478018,0.0003593847,0.00013690698,0.000080669764],"category_scores_gemma":[0.000025055379,0.000166123,0.00005220556,0.00013280664,0.0001466127,0.00010345247,0.000056039855,0.00025678976,0.00002372196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.972917e-7,0.0000026850792,0.000008909088,0.000034572982,0.000005226398,6.02526e-7,0.000044077162,0.95330614,0.0002228664,0.000666614,0.00023814404,0.04546915],"study_design_scores_gemma":[0.00015326781,0.000032019503,0.00001789163,0.00011632865,0.000008327864,0.000002375299,1.5855857e-8,0.99130887,0.0004488742,0.0062583545,0.0014425137,0.00021116588],"about_ca_topic_score_codex":0.000008716315,"about_ca_topic_score_gemma":0.000104269435,"teacher_disagreement_score":0.38349771,"about_ca_system_score_codex":0.00010705036,"about_ca_system_score_gemma":0.000091499176,"threshold_uncertainty_score":0.67743},"labels":[],"label_agreement":null},{"id":"W2028182063","doi":"10.1115/1.4027538","title":"A New Approach to Planning Plungers Paths for Efficient 2½-Axis Computer Numerically Controlled Plunge Milling of Complex Pockets With Islands","year":2014,"lang":"en","type":"article","venue":"Journal of Manufacturing Science and Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Plunger; Machining; Mechanical engineering; Engineering drawing; Engineering; Computer science","score_opus":0.012062566205693216,"score_gpt":0.21153368324705318,"score_spread":0.19947111704135997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028182063","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.19829315,0.000045852576,0.8008774,0.00002846927,0.0001976747,0.00017335985,0.0000011716357,0.000036404155,0.000346502],"genre_scores_gemma":[0.8145425,0.0000050941057,0.18527941,0.000032489777,0.00011071488,0.0000029930868,6.000528e-7,0.000018994499,0.000007217722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987749,0.0000072323387,0.00038779745,0.00015695563,0.0003707904,0.00030231004],"domain_scores_gemma":[0.99929285,0.00012956523,0.00011987885,0.00010876195,0.00012055961,0.0002283606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007784826,0.00017077064,0.0004153472,0.0003741682,0.00008197969,0.000098766046,0.00022429395,0.000037556016,0.0000027665692],"category_scores_gemma":[0.000055971395,0.00013096056,0.00006055695,0.00021460807,0.000031520194,0.00013402895,0.000025544736,0.00013830369,3.6869844e-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.00006385661,0.000010262247,0.000036996447,0.00012172309,0.000037254158,8.2398554e-7,0.0011097853,0.9915221,0.004097608,0.00002699717,0.000098917866,0.0028736785],"study_design_scores_gemma":[0.0019097939,0.00023010753,0.001066079,0.00022823931,0.000028585244,0.000040558745,0.00005178661,0.98861206,0.006648103,0.0000044794574,0.0009911903,0.00018900546],"about_ca_topic_score_codex":0.000002052622,"about_ca_topic_score_gemma":1.2124825e-7,"teacher_disagreement_score":0.6162493,"about_ca_system_score_codex":0.000053262447,"about_ca_system_score_gemma":0.00004146295,"threshold_uncertainty_score":0.53404164},"labels":[],"label_agreement":null},{"id":"W2028676775","doi":"10.1007/s00453-010-9393-1","title":"Algorithms for Marketing-Mix Optimization","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","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":"Carleton University","funders":"","keywords":"Homothetic transformation; Mathematical optimization; Product (mathematics); Theory of computation; Quality (philosophy); Set (abstract data type); Constant (computer programming); Mathematics; Order (exchange); Upper and lower bounds; Profit (economics); Computer science; Combinatorics; Algorithm; Economics; Microeconomics","score_opus":0.009867990062831065,"score_gpt":0.22807056870951145,"score_spread":0.21820257864668038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028676775","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.00058585475,0.000045536864,0.9871949,0.00019187164,0.0019516587,0.00034110976,0.000036433437,0.0007199445,0.0089327125],"genre_scores_gemma":[0.038223155,0.000051012772,0.95943934,0.00012850789,0.0006342196,0.0001153519,0.00017328929,0.00010942977,0.001125702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992779,0.00001279812,0.0001927481,0.00016967939,0.000099057084,0.00024784295],"domain_scores_gemma":[0.99948394,0.00011382986,0.000028818542,0.00020258775,0.00008668365,0.000084118765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027438314,0.00014050749,0.0001228642,0.00008150469,0.00008874183,0.000066404755,0.00013854828,0.00013020278,0.00035473748],"category_scores_gemma":[0.00008285382,0.00014889329,0.000058979793,0.00016172367,0.000026557034,0.0001159523,0.0000148408935,0.00017688228,0.000033911238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011743034,0.00003158166,0.000045710356,0.000078421144,0.00004739029,0.0000012751271,0.00011890694,0.8733893,0.0014800943,0.00063221017,0.0122140525,0.111949295],"study_design_scores_gemma":[0.00035154034,0.00001392017,0.000044426397,0.000008626445,0.000011356451,0.0000068298973,0.000007995117,0.94299865,0.0015531941,0.00011751257,0.054690793,0.00019514009],"about_ca_topic_score_codex":0.0000021336205,"about_ca_topic_score_gemma":0.0000031229872,"teacher_disagreement_score":0.11175416,"about_ca_system_score_codex":0.0000140656075,"about_ca_system_score_gemma":0.000013503222,"threshold_uncertainty_score":0.6071692},"labels":[],"label_agreement":null},{"id":"W2029049650","doi":"10.1016/j.ejor.2007.01.054","title":"Solving circle packing problems by global optimization: Numerical results and industrial applications","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circle packing; Rectangle; Packing problems; Container (type theory); Heuristic; Mathematical optimization; Global optimization; Computer science; Set packing; Work (physics); Mathematics; Combinatorics; Geometry; Engineering; Mechanical engineering","score_opus":0.06645379157372057,"score_gpt":0.3199350637391034,"score_spread":0.25348127216538285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029049650","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.0026338864,0.0007559313,0.96060914,0.0008318141,0.00019996543,0.0002949929,0.000037436504,0.000054451593,0.0345824],"genre_scores_gemma":[0.9808667,0.00021944704,0.017985411,0.000049335624,0.0006533358,0.000002837054,0.000042167216,0.00003373173,0.0001470456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801004,0.00025323057,0.00064144825,0.00015072443,0.0006534467,0.00029111476],"domain_scores_gemma":[0.9987792,0.00020368182,0.00008551938,0.0001149264,0.0005877474,0.00022897338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047058496,0.000101974474,0.00013032582,0.0001499778,0.00027724003,0.00028709654,0.00021593271,0.000046373163,0.00006118492],"category_scores_gemma":[0.0003244874,0.000102967984,0.000033837507,0.00057457126,0.00008153556,0.00030501332,0.000054799668,0.00051922235,0.000021022874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005342534,0.000046830875,0.0005298397,0.000015214028,0.000036330992,0.000019753435,0.00023712189,0.9630729,0.0004923679,0.00036885723,0.0120700635,0.023057282],"study_design_scores_gemma":[0.007992225,0.0011306225,0.006196234,0.0006140917,0.00004439718,0.00088730163,0.0007144261,0.5665427,0.0015953513,0.0002884672,0.4128763,0.0011178814],"about_ca_topic_score_codex":0.0000023273024,"about_ca_topic_score_gemma":0.0000010383509,"teacher_disagreement_score":0.9782328,"about_ca_system_score_codex":0.00012116578,"about_ca_system_score_gemma":0.000086953805,"threshold_uncertainty_score":0.41989124},"labels":[],"label_agreement":null},{"id":"W2031089199","doi":"10.1007/s11590-014-0789-8","title":"Characterizing the optimality gap and the optimal packings for the bin packing problem","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","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 Waterloo","funders":"","keywords":"Bin packing problem; Column generation; Benchmark (surveying); Mathematical optimization; Bin; Heuristic; Set (abstract data type); Lagrangian relaxation; Column (typography); Relaxation (psychology); Packing problems; Mathematics; Set packing; Computer science; Algorithm","score_opus":0.011155338939447047,"score_gpt":0.202790661698188,"score_spread":0.19163532275874096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031089199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019775708,0.00014382823,0.96562225,0.029475695,0.00038230987,0.0010650015,0.000009283384,0.00026094605,0.0010631115],"genre_scores_gemma":[0.86605835,0.0006270722,0.115782365,0.015675133,0.00068881846,0.0006683012,0.00009975638,0.00018957745,0.00021062329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987376,0.00014323714,0.00034580688,0.00023816513,0.0001925155,0.00034272185],"domain_scores_gemma":[0.99860126,0.00076122856,0.00013453451,0.00038196056,0.0000722997,0.000048704936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013233343,0.00023999553,0.00020520033,0.000051194067,0.00069464225,0.00048334006,0.00032304964,0.00007169849,0.00004040511],"category_scores_gemma":[0.00011466526,0.00012856566,0.00009812881,0.00024787933,0.00025317247,0.00025421873,0.00005874115,0.00023137171,0.000004916859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002578396,0.0000041473854,0.000070526825,0.000041195457,0.000053169486,9.998168e-8,0.0014630489,0.9919087,0.00028995573,0.002946642,0.0015505016,0.0016462276],"study_design_scores_gemma":[0.0009892777,0.000011685115,0.00010447648,0.0000351382,0.00005958879,0.000007476863,0.000116744486,0.9821942,0.0001638072,0.00004628993,0.016073264,0.00019809442],"about_ca_topic_score_codex":0.0000106734715,"about_ca_topic_score_gemma":0.0000025619634,"teacher_disagreement_score":0.8640808,"about_ca_system_score_codex":0.000030410009,"about_ca_system_score_gemma":0.000008350646,"threshold_uncertainty_score":0.5342697},"labels":[],"label_agreement":null},{"id":"W2031238785","doi":"10.1109/icc.2013.6655233","title":"Power strip packing of malleable demands in smart grid","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Smart grid; Computer science; Grid; Power (physics); Power grid; Electrical engineering; Engineering; Mathematics; Physics; Geometry","score_opus":0.006164943365157329,"score_gpt":0.1785292178977312,"score_spread":0.17236427453257389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031238785","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30211863,0.0002133815,0.02634337,0.0001956946,0.00065168564,0.00033948733,0.0000033472336,0.00038233065,0.66975206],"genre_scores_gemma":[0.9957085,0.000031913318,0.002915137,0.000040092797,0.000010228707,0.0000070342358,0.0000037212553,0.000013828561,0.001269512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995829,0.0000063122047,0.0001617172,0.00005976759,0.000059246533,0.00013004687],"domain_scores_gemma":[0.9998201,0.000017224882,0.000013104053,0.0000966198,0.000024121482,0.000028835531],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000064854794,0.00006195486,0.000093284136,0.00007678443,0.000008212261,0.000017499573,0.00005486223,0.000044419536,0.003035848],"category_scores_gemma":[0.000007779297,0.000056390338,0.000019145824,0.00014310426,0.0000074265035,0.00011901324,0.000011416297,0.000059172755,0.000095022355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033393185,0.000060249335,0.09039535,0.0001547188,0.000038276143,0.0000020037062,0.00075162423,0.86867005,0.0032940707,0.003051359,0.031660106,0.0019188486],"study_design_scores_gemma":[0.0020594567,0.00010984078,0.09694827,0.0002588355,0.000009575474,0.000006949204,0.00054899487,0.84842646,0.014321313,0.0011103728,0.03539368,0.0008062271],"about_ca_topic_score_codex":0.00006421281,"about_ca_topic_score_gemma":0.000025706473,"teacher_disagreement_score":0.6935899,"about_ca_system_score_codex":0.000012215803,"about_ca_system_score_gemma":0.000004434043,"threshold_uncertainty_score":0.9978755},"labels":[],"label_agreement":null},{"id":"W2032499563","doi":"10.1007/s10732-011-9175-1","title":"Quadratic bottleneck knapsack problems","year":2011,"lang":"fr","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Bottleneck; Heuristic; Continuous knapsack problem; Polynomial-time approximation scheme; Mathematical optimization; Mathematics; Quadratic equation; Point (geometry); Computational complexity theory; Approximation algorithm; Computer science; Algorithm","score_opus":0.04580082402390537,"score_gpt":0.21986558980538526,"score_spread":0.1740647657814799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032499563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008815225,0.051933724,0.824473,0.0022045884,0.025917986,0.00045150603,0.000067684625,0.00014673577,0.08598952],"genre_scores_gemma":[0.5738665,0.014220984,0.39303878,0.00027621284,0.0020739462,0.000002885187,0.000007158844,0.00022943977,0.016284103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981701,0.000082209786,0.0009958878,0.00010209918,0.0002993722,0.00035034574],"domain_scores_gemma":[0.9986072,0.000088399494,0.00045754976,0.0002097694,0.0003860109,0.00025105267],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000472522,0.0002350367,0.00040128618,0.00017056,0.00006030148,0.000070888564,0.0002623918,0.0002008423,0.0017059236],"category_scores_gemma":[0.00018696068,0.00023144032,0.00017071785,0.00024110086,0.00008555807,0.00024578744,0.000027837934,0.0005965101,0.000269819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010126031,0.0013651196,0.008332464,0.0043364246,0.0011666716,0.00093430857,0.020926682,0.6950602,0.00057095755,0.05155579,0.19161232,0.024037821],"study_design_scores_gemma":[0.0039466694,0.0026409246,0.004418287,0.0048924997,0.0014497901,0.003251989,0.0006915361,0.23225006,0.002687862,0.039466236,0.70241505,0.0018891044],"about_ca_topic_score_codex":0.000024768802,"about_ca_topic_score_gemma":0.000009695691,"teacher_disagreement_score":0.56505126,"about_ca_system_score_codex":0.00011015455,"about_ca_system_score_gemma":0.000126234,"threshold_uncertainty_score":0.99920666},"labels":[],"label_agreement":null},{"id":"W2036642374","doi":"10.1057/palgrave.jors.2602526","title":"Modelling and analysis of Canadian Forces strategic lift and pre-positioning options","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Lift (data mining); Strategic planning; Operations research; Computer science; Airlift; Engineering; Business; Marketing","score_opus":0.07323123270736108,"score_gpt":0.32877240577378425,"score_spread":0.25554117306642316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036642374","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.94009787,0.0011229042,0.055323437,0.00090058876,0.000064642685,0.000116852345,0.00002458891,0.000005540781,0.0023435515],"genre_scores_gemma":[0.98745745,0.001035916,0.011325568,0.000024844545,0.000039309132,6.521904e-7,0.000004228153,0.000005114749,0.00010691838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992723,0.000036049092,0.00021243752,0.000045581775,0.00030277675,0.00013089525],"domain_scores_gemma":[0.9992992,0.00013780838,0.000034969988,0.00005115773,0.0003653709,0.00011147864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015789447,0.0000425298,0.000092713635,0.00031088127,0.00028057475,0.00009877277,0.00007867686,0.000044922723,0.00002566998],"category_scores_gemma":[0.000023588276,0.000031538955,0.00007971945,0.00083171786,0.00007178271,0.00015428578,0.000014391228,0.00024643284,1.1742831e-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.0000024432693,0.000003989018,0.0011704807,0.000011339551,0.00022555797,2.5377057e-7,0.0010712831,0.9929057,0.0006042189,0.003836384,0.00013496874,0.000033378594],"study_design_scores_gemma":[0.000093440576,0.00001830341,0.0037422914,0.000031094256,0.000050648327,0.000005982603,0.0004946826,0.9947041,0.00019984422,0.0004548448,0.0001695933,0.00003514422],"about_ca_topic_score_codex":0.0011716719,"about_ca_topic_score_gemma":0.0022034221,"teacher_disagreement_score":0.047359556,"about_ca_system_score_codex":0.00006262555,"about_ca_system_score_gemma":0.00012447449,"threshold_uncertainty_score":0.21579824},"labels":[],"label_agreement":null},{"id":"W2041693766","doi":"10.1057/jors.2011.134","title":"Automatic aircraft cargo load planning","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Fuel efficiency; Purchasing; Pallet; Software; Operations research; Task (project management); Set (abstract data type); Project management; Integer programming; Linear programming; Moment (physics); Mathematical optimization; Industrial engineering; Simulation; Automotive engineering; Systems engineering; Engineering; Operations management; Operating system; Algorithm","score_opus":0.10699615674093656,"score_gpt":0.3363804880498422,"score_spread":0.22938433130890568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041693766","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.8621867,0.003885879,0.035860397,0.005245736,0.0036056128,0.0009400036,0.000024456132,0.0002462121,0.088005014],"genre_scores_gemma":[0.98202586,0.00010035909,0.016592663,0.00014281571,0.00020284056,0.0000037611608,7.647183e-7,0.000017769247,0.00091314205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986311,0.0000873301,0.0002459916,0.000048788534,0.0008088348,0.00017791653],"domain_scores_gemma":[0.99913234,0.00009974977,0.00003909995,0.00011266747,0.00054300245,0.000073133655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592539,0.000062941996,0.000092074595,0.000033112712,0.00022781217,0.00007074047,0.0002996865,0.000055072418,0.00042845905],"category_scores_gemma":[0.00017263959,0.000041242718,0.00014737085,0.0002375593,0.00006772488,0.00021106961,0.000044477372,0.0005243643,0.00002098379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001579204,0.00010157633,0.0062439283,0.0001376578,0.00037005293,0.000010434804,0.027171465,0.65790224,0.0046018367,0.0021349671,0.29971132,0.0015987254],"study_design_scores_gemma":[0.0010094035,0.00014238861,0.021546563,0.00042692013,0.000025402414,0.00014151658,0.0014999625,0.94040203,0.005555236,0.0020631475,0.0269269,0.0002605426],"about_ca_topic_score_codex":0.000006203067,"about_ca_topic_score_gemma":0.0000013820921,"teacher_disagreement_score":0.28249976,"about_ca_system_score_codex":0.0001940007,"about_ca_system_score_gemma":0.00027372682,"threshold_uncertainty_score":0.4691326},"labels":[],"label_agreement":null},{"id":"W2043624414","doi":"10.1016/s0890-6955(00)00024-9","title":"Optimization of hole-making operations: a tabu-search approach","year":2000,"lang":"en","type":"article","venue":"International Journal of Machine Tools and Manufacture","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":77,"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":"Tabu search; Mathematical optimization; Guided Local Search; Computer science; Engineering; Engineering drawing; Operations research; Industrial engineering; Mathematics","score_opus":0.013254667375312862,"score_gpt":0.2526689565358197,"score_spread":0.23941428916050686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043624414","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.13752475,0.0025221715,0.83621764,0.0009975838,0.0008011187,0.00029056708,0.00016878996,0.00008484271,0.021392537],"genre_scores_gemma":[0.9634551,0.0011449904,0.03489254,0.00011536164,0.00013867233,0.0000014269167,0.000046648904,0.000016535698,0.0001887487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992036,0.000024070227,0.00034428388,0.00007026405,0.00027494584,0.00008281506],"domain_scores_gemma":[0.9996471,0.000027495464,0.00005431805,0.00006316707,0.00016586744,0.000042062915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016930663,0.00010046701,0.0001512418,0.00014546335,0.000031107444,0.00011124832,0.00018267379,0.000057796096,0.0007666238],"category_scores_gemma":[0.000018825245,0.000082641905,0.00005561452,0.00006185652,0.000023785884,0.00033639313,0.000014994576,0.00019745089,0.0000017774573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032402615,0.000030077988,0.000083031046,0.00002003283,0.00008376934,0.0000038993207,0.00035401166,0.95943606,0.00012278942,0.00019364161,0.00015820331,0.03948206],"study_design_scores_gemma":[0.00082490937,0.000055969376,0.0008601281,0.00010182737,0.000022869744,0.00016405593,0.00005395604,0.9908316,0.0009864658,0.000073378564,0.00588665,0.00013819907],"about_ca_topic_score_codex":0.0000064742703,"about_ca_topic_score_gemma":0.0000021423803,"teacher_disagreement_score":0.8259303,"about_ca_system_score_codex":0.000022872713,"about_ca_system_score_gemma":0.000017274766,"threshold_uncertainty_score":0.83939934},"labels":[],"label_agreement":null},{"id":"W2043985142","doi":"10.1007/s00453-009-9349-5","title":"Approximability of Packing Disjoint Cycles","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Theory of computation; Combinatorics; Packing problems; Set packing; Computer science; Mathematics; Algorithm; Set (abstract data type)","score_opus":0.007440738904930359,"score_gpt":0.20749748112562644,"score_spread":0.20005674222069608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043985142","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.20354167,0.00093683955,0.67192525,0.0009977447,0.0009933563,0.0007182821,0.000051959618,0.0020197004,0.118815206],"genre_scores_gemma":[0.97592354,0.00002124676,0.02392649,0.000033699813,0.000040518156,0.0000020815671,0.000008101168,0.000010625093,0.000033689714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994958,0.000010836332,0.00017909483,0.00009519693,0.000087826775,0.00013124598],"domain_scores_gemma":[0.9997155,0.000020428703,0.000022969234,0.00017469928,0.000027371538,0.000039028517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008621725,0.00008239915,0.0001262439,0.000040344126,0.000021075224,0.000012346723,0.00007968315,0.000044596793,0.000051406063],"category_scores_gemma":[0.000015176375,0.00007985308,0.000045042052,0.00013002846,0.000023443961,0.00006456019,0.000007890922,0.0000752228,0.000010970894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012585545,0.00023666992,0.0013736539,0.00021264252,0.00007626222,0.000004716247,0.0017007216,0.19738688,0.009022572,0.01035995,0.0019018088,0.7777115],"study_design_scores_gemma":[0.0008545967,0.00014979689,0.019961199,0.00012202049,0.000033731638,0.000012799072,0.00011424035,0.8807839,0.07436653,0.016447982,0.0065010274,0.00065215066],"about_ca_topic_score_codex":0.00000320876,"about_ca_topic_score_gemma":4.9661463e-7,"teacher_disagreement_score":0.7770594,"about_ca_system_score_codex":0.00001773414,"about_ca_system_score_gemma":0.0000054440497,"threshold_uncertainty_score":0.3256314},"labels":[],"label_agreement":null},{"id":"W2044393101","doi":"10.2298/yjor0402147c","title":"On some interconnections between combinatorial optimization and extremal graph theory","year":2004,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Maxima and minima; Heuristics; Combinatorial optimization; Extremal graph theory; Extremal optimization; Mathematics; Graph theory; Graph; Optimization problem; Mathematical optimization; Combinatorics; Computer science; Line graph; Voltage graph; Meta-optimization","score_opus":0.045286675876232176,"score_gpt":0.32504776984781975,"score_spread":0.27976109397158755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044393101","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.4391547,0.0007037696,0.55312324,0.0014912813,0.0015685017,0.00045102587,0.000022325696,0.000113607115,0.0033715153],"genre_scores_gemma":[0.99230844,0.00037733084,0.006928308,0.000018604376,0.00025074175,0.0000068600425,0.000008900629,0.000025509291,0.000075298376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886644,0.00016783805,0.0003345087,0.00009649071,0.00034269702,0.000192027],"domain_scores_gemma":[0.9991163,0.00021421353,0.000021812122,0.00012373397,0.00039721676,0.00012669699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010910104,0.00009741777,0.00015195142,0.00066925003,0.00032094758,0.00021481562,0.00013971755,0.00008538355,0.000111191875],"category_scores_gemma":[0.00025341613,0.00008721745,0.000048608035,0.00042290436,0.000095188094,0.0004823504,0.000023755067,0.00054541667,0.000013266281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013693838,0.000040618554,0.000046001907,0.000009065979,0.00004377745,0.0000037195957,0.00045402185,0.8823443,0.00020800764,0.11632139,0.0001521192,0.00036324508],"study_design_scores_gemma":[0.020272175,0.005997056,0.001961501,0.0016508665,0.00023348762,0.00054123957,0.0031345317,0.38265276,0.019664628,0.5597867,0.0023494011,0.0017556947],"about_ca_topic_score_codex":0.000006900007,"about_ca_topic_score_gemma":0.000005559673,"teacher_disagreement_score":0.5531537,"about_ca_system_score_codex":0.00011002553,"about_ca_system_score_gemma":0.00008931237,"threshold_uncertainty_score":0.35566244},"labels":[],"label_agreement":null},{"id":"W2046102647","doi":"10.1016/j.tcs.2009.08.006","title":"A sublinear-time approximation scheme for bin packing","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","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":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bin packing problem; Sublinear function; Mathematics; Constant (computer programming); Approximation algorithm; Combinatorics; Exponential function; Sampling (signal processing); Function (biology); Running time; Bin; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.008633049583876605,"score_gpt":0.22843081015668698,"score_spread":0.21979776057281036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046102647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009467225,0.000010986845,0.98568875,0.0003325909,0.00016567571,0.00017084579,0.0000014885752,0.00036801933,0.0037943963],"genre_scores_gemma":[0.716029,0.0000014007047,0.28370184,0.0001675623,0.00007757374,0.0000031319814,0.0000037119307,0.000006601323,0.000009180398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992263,0.000010112125,0.00013889556,0.00017987678,0.00017968554,0.00026516768],"domain_scores_gemma":[0.99959016,0.000053810367,0.000015169087,0.00016841057,0.00008285447,0.00008962589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050868484,0.00008954479,0.00009549785,0.00010041415,0.0001257624,0.00018370934,0.00026197892,0.000034633853,0.000046875175],"category_scores_gemma":[0.000039495248,0.00008004402,0.000030136815,0.0004745215,0.00026034252,0.00021846658,0.000024552799,0.00006742987,0.000043500775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052734226,0.000019321182,0.000006599989,0.000014976396,0.00000205228,3.3111934e-7,0.00020283624,0.04954891,0.005589296,0.91664773,0.00019890236,0.027763749],"study_design_scores_gemma":[0.00015489088,0.00006282792,0.00005011458,0.000018343031,0.0000017805132,0.000002951247,9.138117e-7,0.9665317,0.004706321,0.028159034,0.00019892692,0.00011218781],"about_ca_topic_score_codex":6.591226e-8,"about_ca_topic_score_gemma":1.6671796e-8,"teacher_disagreement_score":0.9169828,"about_ca_system_score_codex":0.000025907357,"about_ca_system_score_gemma":0.000015099551,"threshold_uncertainty_score":0.32641003},"labels":[],"label_agreement":null},{"id":"W2050024620","doi":"10.1080/00207160.2012.685468","title":"Packing equal circles into a circle with circular prohibited areas","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Circle packing; Mathematics; Packing problems; Domain (mathematical analysis); RADIUS; Lattice (music); Sphere packing; Hexagonal lattice; Maxima and minima; Hexagonal crystal system; Maxima; Geometry; Combinatorics; Mathematical analysis; Computer science","score_opus":0.012305536176817277,"score_gpt":0.23221358098748876,"score_spread":0.21990804481067147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050024620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11182474,0.00015592913,0.8862665,0.000104465944,0.0009503751,0.00006761349,0.0000015844807,0.00007184158,0.000556921],"genre_scores_gemma":[0.86763793,0.000017110577,0.1316276,0.00007571202,0.00059984584,0.000001473384,0.0000038983744,0.00003049711,0.0000059210306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988633,0.000018173265,0.00042760314,0.000054087,0.00047292167,0.00016395068],"domain_scores_gemma":[0.99915725,0.000075197764,0.00020598761,0.000104392515,0.00035214509,0.00010503564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027091728,0.000121117555,0.0001876204,0.0002013834,0.000025810636,0.000112040485,0.00028271446,0.000045652705,0.00003932136],"category_scores_gemma":[0.000018902116,0.00010771365,0.00007370925,0.000109488574,0.000024504094,0.00038362024,0.00003377772,0.0001633835,0.000019175493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069503614,0.0013386109,0.015251835,0.0010009597,0.003217968,0.00021921091,0.037546683,0.83138525,0.003588169,0.020485634,0.0038599598,0.08203623],"study_design_scores_gemma":[0.004414104,0.0003984431,0.008291907,0.0033905983,0.00023512104,0.0053614792,0.0005256513,0.93938404,0.007136618,0.014296972,0.015200408,0.0013646517],"about_ca_topic_score_codex":8.6258984e-7,"about_ca_topic_score_gemma":5.1261605e-7,"teacher_disagreement_score":0.7558132,"about_ca_system_score_codex":0.000078018005,"about_ca_system_score_gemma":0.00002345075,"threshold_uncertainty_score":0.4392435},"labels":[],"label_agreement":null},{"id":"W2050370986","doi":"10.1109/cec.2012.6256537","title":"SaFESST: Stochastic Fleet Estimation under Steady State Tasking via evolutionary fleet scheduling","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Task (project management); Set (abstract data type); State (computer science); Fleet management; Stochastic process; Operations research; Real-time computing; Distributed computing; Simulation; Mathematical optimization; Engineering; Algorithm; Mathematics; Systems engineering","score_opus":0.01680088718730294,"score_gpt":0.24022066868272765,"score_spread":0.2234197814954247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050370986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008602369,0.00033632363,0.98314834,0.00006209141,0.0010224846,0.00017929987,0.000008061212,0.00071536907,0.005925637],"genre_scores_gemma":[0.93261546,0.000010046208,0.06649714,0.00008891461,0.00010311062,0.000015436668,0.000079875244,0.000050482384,0.0005395507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989669,0.000028124003,0.00027285755,0.00013295515,0.0001987263,0.0004004488],"domain_scores_gemma":[0.99951315,0.00006936154,0.00005618313,0.0001764207,0.0000500327,0.00013487361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020088606,0.00018106573,0.00014259382,0.00013779536,0.000121337944,0.000047000853,0.00008709038,0.00008052031,0.00042796577],"category_scores_gemma":[0.000025891148,0.00018574952,0.000038250204,0.0002293837,0.00002269101,0.0005503059,0.000029847768,0.00016323444,0.00035169924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032506337,0.000021802713,0.0002256085,0.000039944924,0.000030204284,2.4540915e-7,0.0003724547,0.9951167,0.00031016953,0.0017506304,0.00030321526,0.001825758],"study_design_scores_gemma":[0.00024528647,0.000009627931,0.0010237729,0.000046650217,0.000017610959,0.000011077682,0.0000803102,0.9970178,0.00015155753,0.00092864543,0.00021297406,0.00025471044],"about_ca_topic_score_codex":0.00001123767,"about_ca_topic_score_gemma":0.0000059267063,"teacher_disagreement_score":0.9240131,"about_ca_system_score_codex":0.0001264254,"about_ca_system_score_gemma":0.000016907137,"threshold_uncertainty_score":0.7574645},"labels":[],"label_agreement":null},{"id":"W2051064851","doi":"10.1007/s00453-007-9146-y","title":"Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Victoria; University of Waterloo","funders":"","keywords":"Algorithm; Theory of computation; Packing problems; Time complexity; Matching (statistics); Mathematics; Exponent; Dynamic programming; Set (abstract data type); Approximation algorithm; Combinatorics; Computer science; Mathematical optimization","score_opus":0.019633130731243408,"score_gpt":0.24728522079454746,"score_spread":0.22765209006330406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051064851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017990049,0.0003670433,0.9768158,0.00010258369,0.0005994524,0.0005214321,0.00002498152,0.00044419357,0.0031344665],"genre_scores_gemma":[0.6277224,0.00008687621,0.3700938,0.00029569978,0.00042141485,0.00007221799,0.00006532247,0.00016129045,0.0010810138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988176,0.000009621864,0.00031603614,0.00024558685,0.00013091577,0.0004801936],"domain_scores_gemma":[0.99939305,0.00022081089,0.000043949858,0.00016765208,0.000050793173,0.00012377695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062642,0.00020940868,0.00021017535,0.00012515181,0.000118519776,0.0001328652,0.00010336239,0.00013202339,0.000040480798],"category_scores_gemma":[0.000019288442,0.00020840949,0.000059395712,0.00015222254,0.000031348987,0.00025661875,0.000025650917,0.00017848134,0.000015897273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038208535,0.00012647152,0.0007380048,0.00091265474,0.00033194583,0.000019251138,0.006285457,0.09888449,0.010923521,0.0017610003,0.0030854193,0.8768936],"study_design_scores_gemma":[0.0024975603,0.00019590455,0.0008603611,0.00027466752,0.000096470234,0.00012139651,0.00045878833,0.85734373,0.019623546,0.008130377,0.10897589,0.0014213134],"about_ca_topic_score_codex":0.000012837567,"about_ca_topic_score_gemma":0.000011139773,"teacher_disagreement_score":0.87547225,"about_ca_system_score_codex":0.000035578327,"about_ca_system_score_gemma":0.000007652138,"threshold_uncertainty_score":0.84986925},"labels":[],"label_agreement":null},{"id":"W2052697378","doi":"10.1007/s10898-014-0189-8","title":"Exact solution approach for a class of nonlinear bilevel knapsack problems","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":13,"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":"Air Force Office of Scientific Research; National Science Foundation; Division of Civil, Mechanical and Manufacturing Innovation; U.S. Air Force; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Knapsack problem; Mathematics; Continuous knapsack problem; Mathematical optimization; Constraint (computer-aided design); Nonlinear system; Class (philosophy); Binary number; Function (biology); Integer (computer science); Change-making problem; Quadratic equation; Computer science; Artificial intelligence; Arithmetic","score_opus":0.015973272061729608,"score_gpt":0.23259356394478178,"score_spread":0.21662029188305218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052697378","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.00070220674,0.00012252254,0.9953811,0.00007220801,0.00033157947,0.00023179819,0.00002430463,0.000044817672,0.0030894272],"genre_scores_gemma":[0.34187105,0.000119043296,0.6577025,0.000030257383,0.00017646755,0.0000049464957,0.00004651651,0.000024699837,0.00002451922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.000036755457,0.00059985905,0.000091024915,0.00021558299,0.0001653682],"domain_scores_gemma":[0.99898624,0.000031948846,0.0003544334,0.000111294496,0.00044016537,0.00007590629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004348592,0.00013217286,0.00026926515,0.00008393372,0.000038936312,0.000034733708,0.00013509867,0.0001237342,0.00001523366],"category_scores_gemma":[0.000104174156,0.00012028868,0.00012329093,0.0003085792,0.000025764157,0.00026276006,0.00001091076,0.00009151571,9.904708e-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.00003027165,0.000066421126,0.00023819048,0.00016672022,0.00004577835,7.952785e-8,0.00005337359,0.9959371,0.00014691465,0.00045306937,0.0009828861,0.0018791577],"study_design_scores_gemma":[0.00097530603,0.00019360997,0.00008079893,0.00006869784,0.00004565384,0.000020191288,0.000014062222,0.9964446,0.00016642884,0.00013092294,0.0017402779,0.00011946287],"about_ca_topic_score_codex":0.0000021271067,"about_ca_topic_score_gemma":0.0000011540162,"teacher_disagreement_score":0.34116885,"about_ca_system_score_codex":0.000114391805,"about_ca_system_score_gemma":0.000041719853,"threshold_uncertainty_score":0.490523},"labels":[],"label_agreement":null},{"id":"W2053149459","doi":"10.1590/s0103-65132006000300007","title":"Problema de estoque e roteirização: revisão bibliográfica","year":2006,"lang":"pt","type":"article","venue":"Production","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Adidas (Canada)","funders":"","keywords":"Mathematics; Economics; Humanities; Philosophy","score_opus":0.012843715429877207,"score_gpt":0.2222357455367187,"score_spread":0.20939203010684151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053149459","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.09813513,0.027635418,0.70830667,0.03705557,0.024122233,0.008470607,0.000110306704,0.0089284945,0.087235555],"genre_scores_gemma":[0.9585046,0.0017865169,0.012489799,0.00006829233,0.0025651122,0.00009718809,0.0001335701,0.00017264266,0.024182264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.998128,0.00010106765,0.0004955597,0.0005072679,0.00024727944,0.00052085274],"domain_scores_gemma":[0.99910635,0.000016074948,0.0001373045,0.00047533866,0.00016876573,0.00009615014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058384973,0.00031155895,0.0002537724,0.0009787111,0.00019271388,0.00020458628,0.00015099665,0.00023102832,0.0003352016],"category_scores_gemma":[0.0000979959,0.00035412528,0.00010436133,0.0029123032,0.000044022247,0.00037154055,0.00003186978,0.00035774265,0.00038934982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018507388,0.0001659529,0.002598418,0.0009997382,0.00004680195,0.0000045083566,0.00043664698,0.8705639,0.013778492,0.0014451975,0.101832695,0.008109109],"study_design_scores_gemma":[0.0020640031,0.0004154167,0.01850768,0.002655699,0.00055792584,0.00051384827,0.00021160005,0.26777095,0.14142914,0.0071988804,0.5550258,0.0036490378],"about_ca_topic_score_codex":0.00016051077,"about_ca_topic_score_gemma":0.000029595325,"teacher_disagreement_score":0.8603695,"about_ca_system_score_codex":0.00017394252,"about_ca_system_score_gemma":0.00006061477,"threshold_uncertainty_score":0.9998911},"labels":[],"label_agreement":null},{"id":"W2056580825","doi":"10.1108/01445150510579021","title":"Online cutting stock optimization with prioritized orders","year":2005,"lang":"en","type":"article","venue":"Assembly Automation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Build to order; Industrial engineering; Production (economics); Engineering; Mathematics","score_opus":0.009452139076230177,"score_gpt":0.22817855280493587,"score_spread":0.2187264137287057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056580825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101772144,0.000056022476,0.8895537,0.0004381977,0.00014710173,0.00031746636,0.0000053434296,0.0020438593,0.0056661437],"genre_scores_gemma":[0.74964035,0.000031013955,0.24976051,0.000091272406,0.0001005007,0.000015076825,0.00017749975,0.000044107313,0.00013969258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992807,0.000022000148,0.00022205595,0.00013280325,0.00016905782,0.00017338223],"domain_scores_gemma":[0.9996406,0.000029371082,0.000059341244,0.00014133974,0.000083708386,0.000045683573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010316629,0.00013177573,0.00011496025,0.000113394155,0.00007861236,0.00007515569,0.00006814872,0.0000740537,0.000074587755],"category_scores_gemma":[0.000022719303,0.00012938897,0.00002192769,0.00030751975,0.00000974035,0.00046009774,0.000007617831,0.00009295849,0.000031245607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003064721,0.00002477808,0.00015354058,0.000026454161,0.00001615067,3.8126902e-7,0.00019639233,0.98413086,0.00025190838,0.00012327956,0.00031524993,0.01475792],"study_design_scores_gemma":[0.0005833378,0.000021453876,0.00079750945,0.000054062002,0.000014750687,0.000006298135,0.000031257754,0.9954413,0.00058359734,0.000005087268,0.002288739,0.0001725899],"about_ca_topic_score_codex":0.0000055294363,"about_ca_topic_score_gemma":0.000024880319,"teacher_disagreement_score":0.6478682,"about_ca_system_score_codex":0.00007687658,"about_ca_system_score_gemma":0.000021391379,"threshold_uncertainty_score":0.5276329},"labels":[],"label_agreement":null},{"id":"W2056811204","doi":"10.1002/pamm.200700535","title":"Convex separable minimization with box constraints","year":2007,"lang":"en","type":"article","venue":"PAMM","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Separable space; Mathematics; Mathematical optimization; Regular polygon; Convex analysis; Convergence (economics); Minification; Convex function; Constraint (computer-aided design); Linear matrix inequality; Convex optimization; Function (biology); Proper convex function; Economics","score_opus":0.007464599209002998,"score_gpt":0.20600814576678103,"score_spread":0.19854354655777803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056811204","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.013407572,0.000118803066,0.72750854,0.000049746992,0.0002936156,0.0001631749,0.0000052148416,0.00053897605,0.25791436],"genre_scores_gemma":[0.98727787,0.000024051944,0.011762905,0.00009044691,0.00003391788,0.0000026189748,0.000020679598,0.000020536187,0.000767003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960214,0.0000043960317,0.00009934161,0.00007041495,0.00007333762,0.00015038476],"domain_scores_gemma":[0.9997998,0.000023887917,0.000014832082,0.00007962897,0.000030063533,0.000051796607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009110574,0.00006859557,0.00006807314,0.000043553424,0.000028935903,0.000021309424,0.00003588331,0.0000413873,0.00044379162],"category_scores_gemma":[0.0000065908384,0.00006325346,0.000010668294,0.00013225895,0.0000341566,0.00005759001,0.0000031226436,0.000053264073,0.00008802675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003317869,0.000041736155,0.011453403,0.00013585307,0.00008902392,0.00002792157,0.0013873486,0.9470784,0.0011096924,0.0036434215,0.009614061,0.025385946],"study_design_scores_gemma":[0.00438968,0.00021881303,0.00819232,0.00030096635,0.000085907755,0.00014483597,0.0007129282,0.6282963,0.053397514,0.00045627047,0.3021555,0.0016489237],"about_ca_topic_score_codex":0.0000022817792,"about_ca_topic_score_gemma":0.000009431007,"teacher_disagreement_score":0.9738703,"about_ca_system_score_codex":0.000015871141,"about_ca_system_score_gemma":0.00000869434,"threshold_uncertainty_score":0.48592073},"labels":[],"label_agreement":null},{"id":"W2059652052","doi":"10.1007/s00039-004-0486-3","title":"On Convexified Packing and Entropy Duality","year":2004,"lang":"en","type":"article","venue":"Geometric and Functional Analysis","topic":"Optimization and Packing Problems","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 Alberta","funders":"","keywords":"Mathematics; Entropy (arrow of time); Combinatorics; Duality (order theory); Pure mathematics; Physics","score_opus":0.012781348938374045,"score_gpt":0.19435224014814115,"score_spread":0.1815708912097671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059652052","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.44590786,0.0021303368,0.54629624,0.00037901558,0.00035515003,0.00008458931,0.000030507823,0.000306263,0.00451001],"genre_scores_gemma":[0.9988924,0.00028532156,0.0003618413,0.00011147164,0.00004148826,0.000003275179,0.00003961916,0.0000072049424,0.0002573399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994805,0.000006823683,0.00012058729,0.00015076685,0.0001370359,0.0001042795],"domain_scores_gemma":[0.99975735,0.00006789553,0.000015218924,0.00006603522,0.00002775453,0.00006574973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011537049,0.00008872816,0.00013597422,0.00080968573,0.000069651316,0.00006224592,0.00001589391,0.00004556354,0.0001933327],"category_scores_gemma":[0.000027889748,0.000076780234,0.000058192185,0.0021918665,0.000024782836,0.000050133454,0.000010479149,0.00008365461,0.000034876644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011574592,0.000022533632,0.008116996,0.00004190835,0.0010024272,0.0000028237341,0.00008288116,0.95308894,0.000038005837,0.034226477,0.0003483735,0.0030170488],"study_design_scores_gemma":[0.0035289745,0.00026889556,0.46363112,0.00007171449,0.0036476448,0.000036950838,0.000280867,0.46697396,0.00049831736,0.046221547,0.013429753,0.0014102603],"about_ca_topic_score_codex":0.00002077042,"about_ca_topic_score_gemma":0.0000041482967,"teacher_disagreement_score":0.5529846,"about_ca_system_score_codex":0.000026897833,"about_ca_system_score_gemma":0.0000048133,"threshold_uncertainty_score":0.31310073},"labels":[],"label_agreement":null},{"id":"W2059707428","doi":"10.1137/s1052623497321432","title":"Approximating the Single-Sink Link-Installation Problem in Network Design","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Sink (geography); Mathematical optimization; Network planning and design; Graph; Mathematics; Topology (electrical circuits); Upper and lower bounds; Computer science; Combinatorics; Computer network","score_opus":0.02689754769041781,"score_gpt":0.21637426638135435,"score_spread":0.18947671869093655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059707428","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.00025588047,0.00019977998,0.9793468,0.0006800603,0.00039920342,0.00035618106,3.9751413e-7,0.00018042333,0.01858124],"genre_scores_gemma":[0.32760537,0.0013259876,0.6691473,0.0004166732,0.0010254047,0.000027096645,0.0000340889,0.0001264237,0.00029160516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861103,0.0001598531,0.0005379122,0.00013057745,0.0002443804,0.0003162343],"domain_scores_gemma":[0.99941206,0.000117200936,0.0001720193,0.00014155725,0.000090924295,0.00006624076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085527054,0.00017799396,0.00015612096,0.0001642603,0.00023687867,0.00026618998,0.00014574936,0.000117379364,0.000108774955],"category_scores_gemma":[0.000057638274,0.0001421485,0.00004833905,0.00072357815,0.00002084375,0.00033702678,0.0000120199,0.00042606075,0.000014526643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002204613,0.000022812132,0.00017740582,0.000010928868,0.000013021377,0.0000055738833,0.00034613663,0.9860526,0.000027662163,0.00042867413,0.00042776595,0.012465409],"study_design_scores_gemma":[0.00045092904,0.0000774353,0.00006138006,0.00018945927,0.0000082871065,0.00007112037,0.000034427718,0.9962603,0.000026016629,0.0010059585,0.0016458341,0.00016885091],"about_ca_topic_score_codex":8.1412975e-7,"about_ca_topic_score_gemma":0.000002824114,"teacher_disagreement_score":0.3273495,"about_ca_system_score_codex":0.0001652593,"about_ca_system_score_gemma":0.000024743124,"threshold_uncertainty_score":0.57966477},"labels":[],"label_agreement":null},{"id":"W2061918649","doi":"10.1016/j.tcs.2014.02.045","title":"Online algorithms for 1-space bounded 2-dimensional bin packing and square packing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"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 Windsor","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bin packing problem; Bounded function; Bin; Square (algebra); Competitive analysis; Mathematics; Packing problems; Combinatorics; Unit square; Space (punctuation); Sequence (biology); Upper and lower bounds; Online algorithm; Algorithm; Best bin first; Computer science; Geometry; Mathematical analysis; Artificial intelligence; k-nearest neighbors algorithm; Chemistry","score_opus":0.013697621675699418,"score_gpt":0.246702862499147,"score_spread":0.2330052408234476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061918649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04023371,0.000036182748,0.95800257,0.0004116529,0.00047527178,0.00014625238,0.0000069287285,0.00025250902,0.00043490503],"genre_scores_gemma":[0.7571019,0.000003870923,0.2425249,0.00020234227,0.00013502482,0.0000034235713,0.0000061947762,0.000016369793,0.0000059735407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988914,0.000029639144,0.00016405243,0.00030263845,0.00024986762,0.00036237785],"domain_scores_gemma":[0.99923956,0.0002649942,0.000023140201,0.00019698043,0.00010998714,0.00016532208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069579424,0.00014401689,0.00015446501,0.0001050482,0.0002602681,0.00021540606,0.00022090951,0.000050231913,0.000022319797],"category_scores_gemma":[0.00007712924,0.00012589559,0.000031883876,0.00030622273,0.00073293305,0.00015866295,0.00011077389,0.000116027935,0.0000057209786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000483425,0.000030022804,0.00008751739,0.000053447082,0.0000064923647,8.2182305e-7,0.00035451356,0.07392674,0.0007462883,0.88492364,0.00008570829,0.039779987],"study_design_scores_gemma":[0.00028904006,0.00007389189,0.00018229503,0.00006465953,0.000005005272,0.000010894052,0.000005271793,0.96647674,0.001219333,0.030908244,0.0005832606,0.00018138824],"about_ca_topic_score_codex":9.0745607e-7,"about_ca_topic_score_gemma":9.533139e-7,"teacher_disagreement_score":0.89255,"about_ca_system_score_codex":0.0000272212,"about_ca_system_score_gemma":0.000017869246,"threshold_uncertainty_score":0.5133873},"labels":[],"label_agreement":null},{"id":"W2072075444","doi":"10.1007/978-1-4757-3145-3_23","title":"A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Subgradient method; Cutting-plane method; Lagrangian relaxation; Mathematical optimization; Mathematics; Heuristics; Relaxation (psychology); Linear programming relaxation; Integer programming; Plane (geometry); Algorithm; Geometry","score_opus":0.013227652469904759,"score_gpt":0.20594573672711045,"score_spread":0.19271808425720569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072075444","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.00007930937,0.00067467,0.9059638,0.00018364284,0.00011385869,0.0030277516,0.00034711554,0.0006697571,0.08894013],"genre_scores_gemma":[0.0425356,0.006085805,0.87983775,0.0005416883,0.0004102199,0.001036604,0.0046396703,0.0009616168,0.06395105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985579,0.00002777967,0.00060877233,0.00038133733,0.00021643097,0.00020774287],"domain_scores_gemma":[0.9988113,0.00005908593,0.0003688271,0.00037899695,0.0002604252,0.00012135241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013322562,0.00038080107,0.00035044094,0.0001999863,0.00022678028,0.00009107052,0.0002113547,0.00032199136,0.00030034178],"category_scores_gemma":[0.0000074531226,0.00031855147,0.000067696965,0.00020149985,0.00009621224,0.00025245317,0.00002888105,0.00035728558,0.0000144495625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024027595,0.000060341543,0.000018027446,0.00037799243,0.0001948926,9.074837e-7,0.002444747,0.96230227,0.00033400484,0.007261127,0.00008755701,0.026894098],"study_design_scores_gemma":[0.00082037726,0.00007907242,0.000014270798,0.0004988898,0.00013155275,0.000022576245,0.000108619446,0.98623747,0.0003585221,0.0001602291,0.011075676,0.0004927333],"about_ca_topic_score_codex":0.0000126058885,"about_ca_topic_score_gemma":0.00003588271,"teacher_disagreement_score":0.042456288,"about_ca_system_score_codex":0.00006945918,"about_ca_system_score_gemma":0.000058572903,"threshold_uncertainty_score":0.9999266},"labels":[],"label_agreement":null},{"id":"W2072078883","doi":"10.1287/opre.1060.0278","title":"Dual-Optimal Inequalities for Stabilized Column Generation","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Dual (grammatical number); Mathematical optimization; Column generation; Mathematics; Linear programming; Column (typography); Binary number; Convergence (economics); Reduction (mathematics); Degeneracy (biology); Computer science","score_opus":0.12007847672213226,"score_gpt":0.35955937299492363,"score_spread":0.23948089627279137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072078883","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.61211795,0.00043010223,0.3580205,0.0011982069,0.00059446506,0.0022581643,0.00025014026,0.00061263127,0.024517845],"genre_scores_gemma":[0.9516672,0.000046585974,0.033444893,0.000017751694,0.00047564987,0.0006323897,0.0006912465,0.000040150586,0.012984124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990798,0.000069749636,0.00022069961,0.00013703955,0.00023321105,0.00025948792],"domain_scores_gemma":[0.9992871,0.000089189416,0.0000043373075,0.0001661158,0.00041445918,0.00003876365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061904243,0.00007598206,0.00008781269,0.00016859105,0.00040224462,0.000322883,0.00006472718,0.00006590577,0.000361585],"category_scores_gemma":[0.00008245633,0.00008058489,0.000029639321,0.00030321686,0.000047870522,0.000202597,0.00001488418,0.00012141491,0.000057235466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034717316,0.00002389052,0.000023856388,0.00002519279,0.0000065077597,2.5171843e-7,0.00023036177,0.9329107,0.028296484,0.016492642,0.02175947,0.00022716225],"study_design_scores_gemma":[0.00040667775,0.00004343287,0.000040548442,0.000005830163,0.0000024686476,0.0000011247271,0.0001217358,0.95179063,0.011243285,0.0001068622,0.03612456,0.000112842965],"about_ca_topic_score_codex":0.00016807884,"about_ca_topic_score_gemma":0.0010421947,"teacher_disagreement_score":0.33954927,"about_ca_system_score_codex":0.00008227115,"about_ca_system_score_gemma":0.00006467147,"threshold_uncertainty_score":0.3959102},"labels":[],"label_agreement":null},{"id":"W2077707231","doi":"10.1016/j.ejor.2005.07.032","title":"Computing the asymptotic worst-case of bin packing lower bounds","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"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":"Université de Montréal","keywords":"Bin packing problem; Upper and lower bounds; Bin; Mathematics; Asymptotic analysis; Combinatorics; Mathematical optimization; Computer science; Algorithm; Mathematical analysis","score_opus":0.04496201590172233,"score_gpt":0.3090551839637535,"score_spread":0.26409316806203115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077707231","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.8469993,0.0011088497,0.05818454,0.0011886238,0.0008117357,0.00022389421,0.00000835037,0.00004373777,0.09143099],"genre_scores_gemma":[0.99643755,0.000027106076,0.0026679805,0.000026146661,0.0004467882,2.2931236e-7,0.000003107137,0.000029511453,0.00036157086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982166,0.0005065533,0.0004945161,0.000070182665,0.0005142684,0.00019783012],"domain_scores_gemma":[0.99878335,0.00031413708,0.00007352438,0.0001221974,0.00065128313,0.00005553418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072573,0.00007940369,0.00011158894,0.00020937732,0.0002448668,0.00020379473,0.00023209791,0.000015849992,0.00017147305],"category_scores_gemma":[0.00018144013,0.00005654732,0.00006290789,0.00037757197,0.00010282797,0.00014714204,0.000046463683,0.0004629565,0.000034918354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014665029,0.000041764983,0.00056891306,0.000022422477,0.00003323003,0.00047430227,0.00039588276,0.98339635,0.0019985042,0.0034813052,0.0073911375,0.0021815218],"study_design_scores_gemma":[0.0032827551,0.0009568217,0.022575121,0.0010487878,0.00004482962,0.007025453,0.0009700791,0.8903613,0.004297168,0.0007938569,0.06796967,0.00067414495],"about_ca_topic_score_codex":0.00000703667,"about_ca_topic_score_gemma":0.0000048960037,"teacher_disagreement_score":0.14943829,"about_ca_system_score_codex":0.000046660698,"about_ca_system_score_gemma":0.000070905175,"threshold_uncertainty_score":0.23059328},"labels":[],"label_agreement":null},{"id":"W2078289810","doi":"10.1016/s0305-0548(03)00244-2","title":"An analysis of lower bound procedures for the bin packing problem","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":26,"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 à Montréal; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Bin packing problem; Bin; Algorithm","score_opus":0.050963526312924515,"score_gpt":0.35254170867511886,"score_spread":0.30157818236219436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078289810","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.03953164,0.00034586503,0.95749533,0.00024480873,0.00019940195,0.00093330815,0.000019411433,0.00010621946,0.0011240176],"genre_scores_gemma":[0.97303295,0.00006829169,0.026494328,0.000027740103,0.000030530526,0.000120735116,0.00003880941,0.00002089808,0.00016572916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.00010384013,0.000210161,0.00016144273,0.00023163734,0.00024143035],"domain_scores_gemma":[0.99898326,0.00023033247,0.000009403768,0.00032256695,0.00039806403,0.000056387555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000815127,0.00008351196,0.00013380045,0.0004090903,0.00038294564,0.00028535104,0.00024122081,0.000045783898,0.00006937351],"category_scores_gemma":[0.00008121521,0.00006461242,0.00006795676,0.0014431649,0.00007931451,0.00015287338,0.000016174949,0.00013805654,0.0000040752525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031506913,0.000040116265,0.00020326769,0.000036298716,0.0002016554,2.2794887e-7,0.0007785988,0.9879604,0.0008734852,0.008048424,0.001051874,0.0008025027],"study_design_scores_gemma":[0.00013983226,0.000067731555,0.00026764316,0.000017386092,0.00004699884,7.968954e-7,0.00014264729,0.9949522,0.00082903565,0.00006696819,0.0033875187,0.00008123634],"about_ca_topic_score_codex":0.000028073202,"about_ca_topic_score_gemma":0.0003649349,"teacher_disagreement_score":0.9335013,"about_ca_system_score_codex":0.00004207261,"about_ca_system_score_gemma":0.0000944046,"threshold_uncertainty_score":0.29453468},"labels":[],"label_agreement":null},{"id":"W2079519561","doi":"10.1016/j.dam.2004.06.014","title":"The maximum traveling salesman problem on van der Veen matrices","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Mathematical optimization","score_opus":0.010447572942887381,"score_gpt":0.21582752492751808,"score_spread":0.20537995198463072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079519561","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.012876841,0.00032443795,0.51622784,0.0004935429,0.00029809616,0.0013888946,0.000020686794,0.0014529553,0.46691668],"genre_scores_gemma":[0.85964066,0.00032157247,0.13913682,0.000124062,0.00012637222,0.00013571826,0.000035970585,0.0001651145,0.00031368516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990015,0.0000044962003,0.00031796438,0.00014741273,0.0002233568,0.0003052531],"domain_scores_gemma":[0.9994423,0.000085317224,0.000066305874,0.00031782594,0.000019499135,0.000068746194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001806532,0.00021115849,0.00017046295,0.000042818665,0.00020749026,0.00014338885,0.00023883542,0.000083194864,0.000024167346],"category_scores_gemma":[0.000007682089,0.00015083353,0.000054899538,0.00014841143,0.00004092612,0.0000451754,0.000025267731,0.00018709902,0.00025844475],"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.000007922476,0.00005950005,0.0000035867322,0.0004319504,0.000103942315,0.0000025427937,0.004828431,0.6693779,0.0010019625,0.3189401,0.0004103784,0.0048317285],"study_design_scores_gemma":[0.002728394,0.00013606103,0.000055416655,0.00064096827,0.00022210494,0.000026894782,0.0030263755,0.0945156,0.016191738,0.8574323,0.02332319,0.0017009588],"about_ca_topic_score_codex":0.0000011614126,"about_ca_topic_score_gemma":0.0000060373413,"teacher_disagreement_score":0.84676385,"about_ca_system_score_codex":0.00004844999,"about_ca_system_score_gemma":0.000013623352,"threshold_uncertainty_score":0.61508125},"labels":[],"label_agreement":null},{"id":"W2083686860","doi":"10.1016/j.dam.2012.12.002","title":"Corner cuts are close to optimal: From solid grids to polygons and back","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","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":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Maximum cut; Cut; Minimum cut; Grid; Combinatorics; Limiting; Mathematical optimization; Graph; Geometry; Computer science","score_opus":0.015290763607425633,"score_gpt":0.2407192676714727,"score_spread":0.22542850406404707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083686860","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.44230333,0.0002794496,0.48142865,0.00042389487,0.00061678025,0.0014206626,0.00037782415,0.0008163924,0.072332986],"genre_scores_gemma":[0.70334786,0.00003210762,0.29530665,0.0003927421,0.00018655403,0.00007409401,0.00005115063,0.00011432468,0.0004944908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910194,0.0000043796745,0.00024754653,0.00015667306,0.0001374485,0.00035200582],"domain_scores_gemma":[0.99924386,0.00005323176,0.0000383277,0.00031480656,0.000018106792,0.00033167854],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008920736,0.00021347639,0.00026071948,0.00006933513,0.000049594768,0.000072830684,0.00012526612,0.00008568457,0.00018591227],"category_scores_gemma":[0.000015292717,0.00019915779,0.000031135914,0.00016271751,0.000017431385,0.000074605145,0.00008699874,0.00010362472,0.0010670742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107933214,0.0006323649,0.0017440565,0.0022838148,0.00081590115,0.000009415085,0.13307656,0.49092212,0.07901976,0.09533212,0.18957226,0.0064836815],"study_design_scores_gemma":[0.0066361567,0.00036521847,0.007286085,0.0024766321,0.0010789401,0.00007387201,0.025044622,0.45967865,0.13424441,0.02261271,0.3294658,0.011036896],"about_ca_topic_score_codex":0.0000028177578,"about_ca_topic_score_gemma":0.000003084351,"teacher_disagreement_score":0.26104456,"about_ca_system_score_codex":0.000023168457,"about_ca_system_score_gemma":0.0000042248053,"threshold_uncertainty_score":0.99971074},"labels":[],"label_agreement":null},{"id":"W2084296369","doi":"10.1016/j.ejor.2005.12.049","title":"Alternative configurations for cutting machines in a tube cutting mill","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Mill; Tube (container); Manufacturing engineering; Computer science; Cutting tool; Engineering drawing; Mechanical engineering; Engineering","score_opus":0.06251405671264575,"score_gpt":0.3424651484516882,"score_spread":0.2799510917390424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084296369","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.30365667,0.0015788017,0.43001932,0.0038386574,0.0011352006,0.0010892033,0.00009382482,0.000103664104,0.25848466],"genre_scores_gemma":[0.9820125,0.00004012594,0.016658416,0.000036380647,0.0006163711,0.000005164205,0.00002466357,0.000035246707,0.00057111913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850863,0.00031437888,0.0005016504,0.00008971588,0.00037493015,0.00021067924],"domain_scores_gemma":[0.9987784,0.00035562395,0.000054244338,0.00006253842,0.00069659797,0.00005257141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027631028,0.000082791965,0.00011426031,0.0003599118,0.00015966967,0.00017362609,0.00017830018,0.000015606616,0.00009841963],"category_scores_gemma":[0.00042577097,0.00007522542,0.000049242233,0.00025925704,0.00003581314,0.00025513547,0.000018687473,0.00034516348,0.000020307489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018839675,0.00003368814,0.00072886125,0.00002379176,0.00001808013,0.000032340708,0.00045214902,0.97894293,0.006172239,0.007168692,0.0040234276,0.0023849725],"study_design_scores_gemma":[0.0019022378,0.00020199585,0.0056748586,0.00026728885,0.0000057155225,0.00009120768,0.00015574969,0.9545739,0.003072931,0.001304443,0.03253113,0.00021853532],"about_ca_topic_score_codex":0.000014578967,"about_ca_topic_score_gemma":0.00001057407,"teacher_disagreement_score":0.6783559,"about_ca_system_score_codex":0.000071786315,"about_ca_system_score_gemma":0.00006544028,"threshold_uncertainty_score":0.30676037},"labels":[],"label_agreement":null},{"id":"W2094814392","doi":"10.1002/net.10001","title":"Maximizing residual flow under an arc destruction","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Windsor","funders":"","keywords":"Residual; Arc (geometry); Flow (mathematics); Flow network; Maximum flow problem; Mathematics; Multi-commodity flow problem; Mathematical optimization; Computer science; Algorithm; Geometry","score_opus":0.01790803809284282,"score_gpt":0.21797649310930473,"score_spread":0.2000684550164619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094814392","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.03801974,0.00026950796,0.9436379,0.000099246914,0.001180899,0.000091849484,8.2634983e-7,0.0008212961,0.015878707],"genre_scores_gemma":[0.9783296,0.0002926261,0.02028476,0.00012249514,0.00062932697,0.000005193364,0.00004320628,0.000041693704,0.00025108323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995204,0.000017528515,0.00010734508,0.00010040422,0.0000687922,0.00018548443],"domain_scores_gemma":[0.99976397,0.000011892536,0.000012475971,0.00013711739,0.000013955545,0.000060566443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007336334,0.000084026586,0.000068209774,0.000040257382,0.00006303392,0.000054257314,0.00005884213,0.00009375912,0.00018133252],"category_scores_gemma":[0.000002029192,0.00009076899,0.00001730749,0.00015520692,0.000011755792,0.00014096535,0.0000076930755,0.00014541554,0.000017898152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039603797,0.0000039473503,0.00054277777,0.0000030324586,0.0000070826873,0.0000020327977,0.00005459126,0.97868216,0.000015987665,0.00034801377,0.00094468665,0.01939172],"study_design_scores_gemma":[0.000161085,0.000012844837,0.0013425775,0.000014702091,0.0000058537303,0.000022432288,0.000020897038,0.99360496,0.00001788648,0.00054761145,0.0041310946,0.0001180473],"about_ca_topic_score_codex":0.000005526635,"about_ca_topic_score_gemma":0.00003629484,"teacher_disagreement_score":0.9403099,"about_ca_system_score_codex":0.00002695552,"about_ca_system_score_gemma":0.0000039354636,"threshold_uncertainty_score":0.3701452},"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":"W2102019950","doi":"10.1109/tsmca.2005.851140","title":"A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Heuristic; Mathematical optimization; Mathematics; Change-making problem; Relaxation (psychology); Series (stratigraphy); Function (biology); Cutting stock problem; Linear programming; Value (mathematics); Computer science; Applied mathematics; Algorithm; Optimization problem; Statistics","score_opus":0.019118764139625197,"score_gpt":0.2262011737155466,"score_spread":0.2070824095759214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102019950","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.013403905,0.004596359,0.97358686,0.00026429267,0.002570367,0.0026571904,0.00013182715,0.00049269886,0.0022964892],"genre_scores_gemma":[0.98688406,0.00036477472,0.0018976717,0.000041874417,0.00040093414,0.00023529382,0.0000070141828,0.00006910877,0.0100992555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986599,0.000043063243,0.00048659768,0.00029460096,0.00019704796,0.00031878424],"domain_scores_gemma":[0.9992392,0.00019294726,0.000077263,0.0002375804,0.000072767965,0.00018022873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025029317,0.0002789145,0.00030627614,0.000098571436,0.00043561868,0.00027543135,0.00009141726,0.00013013622,0.000020467758],"category_scores_gemma":[0.000002516776,0.00022301805,0.000071706294,0.00008560358,0.000054097683,0.000101266356,0.0000019163986,0.00019571607,0.000024038485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019496903,0.000055693778,0.000017374046,0.0006538345,0.00017088074,0.0000011075371,0.0034930827,0.9805105,0.00042693567,0.0038573497,0.008204101,0.0025896546],"study_design_scores_gemma":[0.001337075,0.00012267494,0.00003865901,0.000517885,0.0001271857,0.00005108118,0.0005483868,0.7411802,0.00012134834,0.000018081848,0.25551054,0.00042688995],"about_ca_topic_score_codex":0.0001936207,"about_ca_topic_score_gemma":0.0002647657,"teacher_disagreement_score":0.97348017,"about_ca_system_score_codex":0.000042316835,"about_ca_system_score_gemma":0.000021092892,"threshold_uncertainty_score":0.90944123},"labels":[],"label_agreement":null},{"id":"W2103112015","doi":"10.1109/idam.2014.6912668","title":"Structural steel truck loading problem: Documenting expert loaders reasoning","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vocabulary; Set (abstract data type); Documentation; Process (computing); Computer science; Expert system; Truck; Engineering; Artificial intelligence; Engineering drawing; Programming language; Linguistics","score_opus":0.01034198727133246,"score_gpt":0.2216376054823852,"score_spread":0.21129561821105275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103112015","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14766486,0.0005225526,0.21864778,0.0003055078,0.0017471348,0.00058804103,0.0000020956397,0.0040347143,0.6264873],"genre_scores_gemma":[0.9473931,0.000019214629,0.0507428,0.00015306324,0.00012664276,0.000010393452,0.000009542531,0.000048718164,0.0014965074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990747,0.000024218,0.00023633012,0.00018261833,0.00014385516,0.0003382834],"domain_scores_gemma":[0.99964416,0.000036000532,0.000034868957,0.00016845559,0.000027401915,0.00008911592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015787831,0.00017266245,0.00015076304,0.00008233411,0.00011936497,0.00016067152,0.00012644319,0.0000712299,0.00053590996],"category_scores_gemma":[0.000022649925,0.00016103638,0.000047825717,0.00015750698,0.000019038443,0.00028569964,0.000026643811,0.00013625536,0.000058166544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064183846,0.0000068223057,0.004468584,0.0001926387,0.00009375614,0.0000018336557,0.004176524,0.92483765,0.011463757,0.018891545,0.006257094,0.029603388],"study_design_scores_gemma":[0.0006006653,0.000021398533,0.0003345356,0.00012458884,0.000009491648,0.000013136307,0.000340335,0.97438073,0.0059893853,0.0003905194,0.017326085,0.00046911777],"about_ca_topic_score_codex":0.000029027284,"about_ca_topic_score_gemma":0.000010608134,"teacher_disagreement_score":0.7997283,"about_ca_system_score_codex":0.000042785796,"about_ca_system_score_gemma":0.0000055157443,"threshold_uncertainty_score":0.6566873},"labels":[],"label_agreement":null},{"id":"W2114172542","doi":"10.1287/ijoc.13.3.245.12633","title":"On the Design Problem of Multitechnology Networks","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Tabu search; Network planning and design; Mathematical optimization; Heuristic; Integer programming; Modular design; Computer science; Integer (computer science); Port (circuit theory); Upper and lower bounds; Branch and bound; Topology (electrical circuits); Algorithm; Mathematics; Engineering; Computer network; Combinatorics","score_opus":0.019565517382526265,"score_gpt":0.22006778884535558,"score_spread":0.2005022714628293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114172542","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.028586686,0.000051981893,0.95888454,0.00021468787,0.00032756355,0.00014056842,1.88262e-7,0.0001666209,0.01162715],"genre_scores_gemma":[0.9870892,0.0000915828,0.012436995,0.0002526775,0.00007927442,8.1465396e-7,4.5411528e-7,0.000015985415,0.000033018936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929816,0.00001736179,0.00031962333,0.000045339984,0.000120265315,0.00019924132],"domain_scores_gemma":[0.9994386,0.0002517453,0.000119707234,0.00010593045,0.00004827231,0.00003578483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000454965,0.000099639576,0.000115725954,0.00011964583,0.00012235816,0.000049478447,0.00018624686,0.00007817954,0.00004158889],"category_scores_gemma":[0.00003564706,0.000061521496,0.000045922705,0.00023382081,0.00002378377,0.000052874,0.000017636541,0.0004894759,0.000017693292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009466765,0.000007975306,0.000168112,0.000004270423,0.000019579238,0.0000038573435,0.00013097886,0.95857704,0.000012470338,0.004063943,0.0006947546,0.03630753],"study_design_scores_gemma":[0.00024506813,0.0001202075,0.00008385845,0.00016044838,0.0000027452134,0.00010454414,0.000025968822,0.99487627,0.00018437687,0.00074477284,0.003368233,0.00008348482],"about_ca_topic_score_codex":6.031358e-7,"about_ca_topic_score_gemma":2.965861e-7,"teacher_disagreement_score":0.95850253,"about_ca_system_score_codex":0.000031902844,"about_ca_system_score_gemma":0.0000093603085,"threshold_uncertainty_score":0.25087738},"labels":[],"label_agreement":null},{"id":"W2115819683","doi":"10.1590/s0101-74382012005000005","title":"Accelerating benders decomposition with heuristicmaster problem solutions","year":2012,"lang":"en","type":"article","venue":"Pesquisa Operacional","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Montfort Hospital; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Benders' decomposition; Generality; Mathematical optimization; Decomposition; Computer science; Scheme (mathematics); Heuristic; Decomposition method (queueing theory); Algorithm; Mathematics; Discrete mathematics","score_opus":0.02978486250149506,"score_gpt":0.2427013799541104,"score_spread":0.21291651745261533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115819683","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.18542983,0.0012618789,0.6396037,0.0014065906,0.001610192,0.0010507675,0.00009281379,0.0017509533,0.16779327],"genre_scores_gemma":[0.9526069,0.000011220605,0.0466702,0.00013297351,0.00021900158,0.000040014387,0.000107556065,0.000033422206,0.00017872287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919075,0.00002115435,0.00016393155,0.00010774382,0.00016216261,0.00035426134],"domain_scores_gemma":[0.9996818,0.00002905289,0.000020631638,0.00009790253,0.000053274103,0.00011737193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012045888,0.00013675944,0.00009632303,0.00006541939,0.00019617059,0.00007332443,0.00006724399,0.000049600985,0.0007519088],"category_scores_gemma":[0.0000042651773,0.000121558216,0.000027734903,0.00012569144,0.000026077409,0.00042649,0.000020631887,0.0001412724,0.00013685394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018230232,0.00012753271,0.008899559,0.00009190767,0.00008686327,0.0000017913547,0.001980495,0.9633502,0.0019250849,0.016536638,0.0041145096,0.0028671962],"study_design_scores_gemma":[0.0028755504,0.0002332054,0.021904357,0.00039096567,0.00015730846,0.00047961334,0.00066730066,0.88303643,0.0028205016,0.00037507527,0.08485535,0.0022043115],"about_ca_topic_score_codex":0.000003266428,"about_ca_topic_score_gemma":0.00000796857,"teacher_disagreement_score":0.76717705,"about_ca_system_score_codex":0.000053726642,"about_ca_system_score_gemma":0.000016187725,"threshold_uncertainty_score":0.8232874},"labels":[],"label_agreement":null},{"id":"W2116455242","doi":"10.1016/j.ic.2004.10.001","title":"Fast approximate PCPs for multidimensional bin-packing problems","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Bin packing problem; Bin; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.012181791405063412,"score_gpt":0.21943732164037733,"score_spread":0.2072555302353139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116455242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019069748,0.000037391972,0.97879523,0.00011363481,0.00021045275,0.00034465367,0.000012048422,0.0003044224,0.0011124406],"genre_scores_gemma":[0.9091993,0.000029574932,0.090068534,0.00020832758,0.000029509994,0.000048865524,0.0003881624,0.000013745713,0.000014004945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995037,0.000003995123,0.00023540638,0.00005410653,0.000092045026,0.0001107655],"domain_scores_gemma":[0.99976385,0.00001819704,0.000051539628,0.000037593745,0.00008804306,0.000040760206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092310984,0.00008828566,0.00007345309,0.00011011598,0.00009904124,0.00007454739,0.000022282491,0.000046474153,0.000004776191],"category_scores_gemma":[0.000008630896,0.00008918382,0.000021294847,0.00010596856,0.000012716,0.0006612324,0.000007741667,0.00004746192,0.000021763446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034649706,0.0000052302566,0.000019532963,0.000117642376,0.00000704874,3.369171e-8,0.0013176095,0.96879995,0.00009187047,0.0054267356,0.00012215614,0.024088698],"study_design_scores_gemma":[0.0010856319,0.00002685421,0.0002284685,0.000049062823,0.00000470862,0.0000068014306,0.00011265916,0.9911222,0.00042205205,0.0014060329,0.005403754,0.00013180761],"about_ca_topic_score_codex":0.0000038093337,"about_ca_topic_score_gemma":0.0000018251005,"teacher_disagreement_score":0.8901295,"about_ca_system_score_codex":0.000031756088,"about_ca_system_score_gemma":0.000013226479,"threshold_uncertainty_score":0.36368108},"labels":[],"label_agreement":null},{"id":"W2119863390","doi":"10.82308/26339","title":"Odd cycles in planar graphs","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Computer science; Mathematics","score_opus":0.012312377118995821,"score_gpt":0.22242165553931975,"score_spread":0.21010927842032392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119863390","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.5750099,0.0010352246,6.064932e-7,0.000010614451,0.0020990244,0.0006213109,0.0007123557,0.0011791864,0.41933176],"genre_scores_gemma":[0.98806196,0.001909895,0.0016799147,0.00014394725,0.000061135215,0.0001243255,0.0022755582,0.000393103,0.005350166],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99718964,0.00011141524,0.0008593311,0.0006483013,0.000489974,0.0007013492],"domain_scores_gemma":[0.99883556,0.00009980764,0.00018018694,0.0005351816,0.00010912702,0.00024013741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038546222,0.0007330312,0.0006478962,0.00087235373,0.0003014972,0.0000942481,0.0005106822,0.00093116646,0.00044712043],"category_scores_gemma":[0.000107692154,0.00086622476,0.00024188872,0.00077477086,0.000024958583,0.00053201,0.000023818833,0.0015374357,0.00048618083],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029605936,0.0005769717,0.0006528516,0.0031217579,0.00083147,0.00030897497,0.00016043293,0.22434509,0.025434675,0.29300523,0.0002702878,0.4509962],"study_design_scores_gemma":[0.007984841,0.00035230725,0.019696098,0.006042562,0.0006478911,0.00012997222,0.0014171412,0.010143716,0.095919274,0.07463685,0.7708836,0.012145742],"about_ca_topic_score_codex":0.00009601313,"about_ca_topic_score_gemma":0.00474788,"teacher_disagreement_score":0.7706133,"about_ca_system_score_codex":0.00041842824,"about_ca_system_score_gemma":0.000020820633,"threshold_uncertainty_score":0.99937886},"labels":[],"label_agreement":null},{"id":"W2120279149","doi":"10.1007/s11590-008-0085-6","title":"On a posterior evaluation of a simple greedy method for set packing","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Set packing; Mathematics; Mathematical optimization; Set (abstract data type); Upper and lower bounds; Greedy algorithm; Relaxation (psychology); Packing problems; Function (biology); Linear programming relaxation; Combinatorics; Computer science; Linear programming","score_opus":0.04883040661566376,"score_gpt":0.2983069939448683,"score_spread":0.24947658732920455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120279149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023464898,0.00001889248,0.97467506,0.00030579395,0.00019892825,0.00053315546,0.00003351172,0.00014370643,0.0006260549],"genre_scores_gemma":[0.60916466,0.0000215557,0.38891813,0.0012123857,0.00007085023,0.00012637016,0.00037089616,0.000080257196,0.000034904035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907875,0.00007203167,0.00026567685,0.00015276662,0.00027575472,0.00015503366],"domain_scores_gemma":[0.99941736,0.00010949049,0.00008359153,0.00017277124,0.00017848551,0.000038285725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040997524,0.00012902713,0.00015786376,0.00016464667,0.00008160668,0.000017842698,0.000076318865,0.000059089998,0.00018602342],"category_scores_gemma":[0.0000983754,0.00013879257,0.00006418573,0.00023172582,0.000019407133,0.00013260124,0.000007906264,0.0000544521,0.000004638245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014625728,0.000010133082,0.00007859829,0.00003538449,0.000026513815,2.9378842e-7,0.0005423995,0.99302316,0.0018756794,0.00006335241,0.0027821986,0.0015476457],"study_design_scores_gemma":[0.0009116404,0.000038829457,0.000081069054,0.0000259635,0.000037396803,0.00000699419,0.000016367469,0.9966922,0.0016441657,0.000039075436,0.00035957037,0.00014677327],"about_ca_topic_score_codex":0.000005007127,"about_ca_topic_score_gemma":0.0000019230697,"teacher_disagreement_score":0.58575696,"about_ca_system_score_codex":0.00006564155,"about_ca_system_score_gemma":0.000019988862,"threshold_uncertainty_score":0.56597966},"labels":[],"label_agreement":null},{"id":"W2124475618","doi":"10.1287/ijoc.1100.0406","title":"A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Mathematical optimization; Set packing; Bin; Branch and bound; Mathematics; Heuristics; Branch and cut; Algorithm; Branching (polymer chemistry); Set (abstract data type); Scheduling (production processes); Computer science; Integer programming","score_opus":0.0101253620362066,"score_gpt":0.22448248848650484,"score_spread":0.21435712645029825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124475618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03277739,0.00008670631,0.96017957,0.00030898923,0.0008319357,0.00035440436,0.000002815363,0.00019883744,0.0052593416],"genre_scores_gemma":[0.90467983,0.00005216349,0.09407566,0.000532773,0.0005141559,0.000005883625,0.0000023436924,0.000047383157,0.00008979822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992295,0.0000049391415,0.00026176186,0.000076105236,0.0001598299,0.000267873],"domain_scores_gemma":[0.99933696,0.00025474167,0.00011381583,0.0001028005,0.00009748437,0.00009422675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048238356,0.00014204762,0.00012885303,0.00008501181,0.00035794353,0.00034107032,0.00014372553,0.00006029195,0.000012452828],"category_scores_gemma":[0.000025808331,0.00008236067,0.000040453902,0.00014236421,0.00003239046,0.00015917874,0.000020416193,0.00060764106,0.0000052939326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010660698,0.000008357406,0.00036503948,0.000049972045,0.000068616864,0.0000029651962,0.0016918811,0.40175146,0.00018601211,0.0013021149,0.00023215135,0.5943308],"study_design_scores_gemma":[0.0009396694,0.000110761,0.0005018059,0.00015371697,0.00001365413,0.00041528352,0.00005474735,0.9385872,0.000341705,0.00015907527,0.05852293,0.0001994429],"about_ca_topic_score_codex":0.0000021127964,"about_ca_topic_score_gemma":0.0000034755035,"teacher_disagreement_score":0.87190247,"about_ca_system_score_codex":0.000016628584,"about_ca_system_score_gemma":0.000022020204,"threshold_uncertainty_score":0.33585706},"labels":[],"label_agreement":null},{"id":"W2126475333","doi":"10.1287/trsc.1050.0145","title":"A Tabu Search Algorithm for a Routing and Container Loading Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":325,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Routing (electronic design automation); Guided Local Search; Container (type theory); Mathematical optimization; Algorithm; Computer science; Search algorithm; Engineering; Mathematics; Computer network","score_opus":0.012469214015357563,"score_gpt":0.2430320924813416,"score_spread":0.23056287846598406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126475333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06856596,0.0000465425,0.9293441,0.000048096008,0.000087511595,0.00027973903,0.00001835894,0.00017939965,0.0014302601],"genre_scores_gemma":[0.9046504,0.0000060516472,0.09512366,0.000018016963,0.000023764143,0.0000197302,0.000019483929,0.000010196524,0.0001286978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993468,0.0000028223349,0.00015268686,0.00014721563,0.0001529128,0.00019756629],"domain_scores_gemma":[0.9997751,0.000025379628,0.000017149094,0.0000494667,0.0000896984,0.00004318941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032017153,0.0000645819,0.00006629786,0.00009107279,0.00014106826,0.00007875682,0.000063595326,0.000021606176,0.000009703219],"category_scores_gemma":[0.0000029388684,0.00006443155,0.000014384014,0.0003647553,0.000077501485,0.0002720483,0.0000011026247,0.00004239432,0.0000017788133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006441535,0.000027960874,0.012576284,0.00018539546,0.00000967353,0.0000030820263,0.0047852346,0.8440365,0.043492574,0.030774545,0.00019536576,0.06390691],"study_design_scores_gemma":[0.00043746675,0.00001764206,0.011113876,0.00002971446,0.0000062723266,0.0000015709926,0.00011748228,0.9811672,0.005942456,0.00035144843,0.0006722938,0.00014256629],"about_ca_topic_score_codex":0.000050876828,"about_ca_topic_score_gemma":0.000042444768,"teacher_disagreement_score":0.8360844,"about_ca_system_score_codex":0.000019944904,"about_ca_system_score_gemma":0.000027420145,"threshold_uncertainty_score":0.26274425},"labels":[],"label_agreement":null},{"id":"W2130428886","doi":"10.1007/s00453-014-9955-8","title":"Online Bin Packing with Advice","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"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":"Bin packing problem; Advice (programming); Bin; Computer science; Theory of computation; Combinatorics; Mathematics; Algorithm; Programming language","score_opus":0.005320935873254548,"score_gpt":0.1880935076917519,"score_spread":0.18277257181849735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130428886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030809727,0.00023367463,0.881315,0.0008095019,0.0009016106,0.00031416686,0.00003601439,0.0038287104,0.08175158],"genre_scores_gemma":[0.86724526,0.00003362047,0.13110368,0.00037241873,0.0003173375,0.0000087277285,0.00007700394,0.00007988106,0.0007620708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951196,0.000012578219,0.00010383589,0.00010864669,0.00009418192,0.00016879199],"domain_scores_gemma":[0.99970096,0.000031902127,0.00001655768,0.00016113611,0.00003122523,0.00005821874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006026307,0.00010285505,0.000099156976,0.000052045685,0.000036932637,0.000028897217,0.000085474,0.00004325614,0.000080485916],"category_scores_gemma":[0.000008876626,0.00008867042,0.000017817647,0.00017341715,0.000016456403,0.000069065056,0.000010532951,0.00010717054,0.00007541384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012566493,0.00013457432,0.0010358242,0.00016360485,0.00014158452,0.000010718966,0.0008034272,0.70503205,0.00081846095,0.002658922,0.009473987,0.27971426],"study_design_scores_gemma":[0.00041445103,0.000050600254,0.0004550545,0.000048662016,0.000012501636,0.000012495486,0.000024034818,0.89256006,0.0008245139,0.00011174891,0.10525631,0.00022957905],"about_ca_topic_score_codex":0.000009371729,"about_ca_topic_score_gemma":0.0000157267,"teacher_disagreement_score":0.83643556,"about_ca_system_score_codex":0.000014310451,"about_ca_system_score_gemma":0.000005637155,"threshold_uncertainty_score":0.3615875},"labels":[],"label_agreement":null},{"id":"W2133331715","doi":"10.1016/j.dam.2012.07.020","title":"On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Circle packing; Mathematics; Square (algebra); Packing problems; Combinatorics; Branch and bound; Symmetry (geometry); Symmetry breaking; Mathematical optimization; Geometry","score_opus":0.01938644715395996,"score_gpt":0.26391685446127905,"score_spread":0.2445304073073191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133331715","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.78321016,0.00004627445,0.18615244,0.000033187847,0.000108592896,0.0010783958,0.00007480651,0.00010826388,0.029187897],"genre_scores_gemma":[0.99760497,0.000005806098,0.0022290447,0.000020343765,0.000034879515,0.00005021894,0.000011571213,0.00004037462,0.0000027996327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928284,0.000008208395,0.00025086539,0.00008902968,0.000117692034,0.00025138762],"domain_scores_gemma":[0.99923694,0.00044071834,0.00007801914,0.00018360683,0.000013922138,0.00004679157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027896068,0.00014926716,0.00021726631,0.0000819106,0.00004741767,0.0000336085,0.00008000341,0.00006828809,0.00005688711],"category_scores_gemma":[0.00005779979,0.000111178146,0.0000666934,0.00011886861,0.00005588569,0.000038408798,0.000014835086,0.00011873524,0.00000706121],"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.00009027952,0.00037129284,0.0011922606,0.0021423523,0.00031082926,7.1563846e-7,0.021490932,0.13705306,0.010242568,0.7750585,0.00031952438,0.05172765],"study_design_scores_gemma":[0.00757426,0.0008051205,0.018263137,0.0037034985,0.00023860933,0.000029905656,0.005127941,0.7540325,0.040767413,0.16685331,0.000117674776,0.0024866543],"about_ca_topic_score_codex":0.000007467865,"about_ca_topic_score_gemma":0.0000035652147,"teacher_disagreement_score":0.6169794,"about_ca_system_score_codex":0.000040354254,"about_ca_system_score_gemma":0.000008421131,"threshold_uncertainty_score":0.45337132},"labels":[],"label_agreement":null},{"id":"W2139110007","doi":"10.1016/j.cor.2009.03.032","title":"Heuristics for the mixed swapping problem","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Mathematics","score_opus":0.07886540970125167,"score_gpt":0.34786934665482566,"score_spread":0.269003936953574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139110007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048199602,0.00028855316,0.99236923,0.0027307584,0.00031171282,0.0007184095,0.000006481079,0.00018698572,0.0029058713],"genre_scores_gemma":[0.8265691,0.00027480768,0.17053539,0.00027735948,0.000367138,0.00015943356,0.0000653707,0.00003578822,0.0017156231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992042,0.000048302634,0.00015971097,0.00012558728,0.00018629107,0.00027591127],"domain_scores_gemma":[0.9991948,0.0002558561,0.000004055177,0.000231341,0.00025919906,0.00005473984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050936354,0.00007802176,0.00007643188,0.00011696755,0.00055922195,0.00033274482,0.0002595603,0.000041975916,0.000023336763],"category_scores_gemma":[0.000052156043,0.0000618876,0.000033442215,0.0003827683,0.00004105238,0.00008664259,0.000026135136,0.00021569648,0.000044168763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016728194,0.000013887393,0.0000028659579,0.0000147982055,0.00001275962,3.9165457e-7,0.00035376247,0.9343392,0.00026875595,0.007509176,0.03951127,0.017971436],"study_design_scores_gemma":[0.00017572845,0.00004775887,0.000097884,0.000023007391,0.0000029254315,0.000002075267,0.000039354378,0.94935423,0.00024770014,0.00030825674,0.049622986,0.00007807437],"about_ca_topic_score_codex":0.000005432589,"about_ca_topic_score_gemma":0.000016736738,"teacher_disagreement_score":0.8260871,"about_ca_system_score_codex":0.000046020865,"about_ca_system_score_gemma":0.000038339138,"threshold_uncertainty_score":0.43011394},"labels":[],"label_agreement":null},{"id":"W2142502904","doi":"10.1142/s0219198901000415","title":"GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY","year":2001,"lang":"en","type":"article","venue":"International Game Theory Review","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Travelling salesman problem; Scheme (mathematics); Mathematics; Identification (biology); Combinatorics; Mathematical optimization; Biology","score_opus":0.019547953420292846,"score_gpt":0.2408912196229989,"score_spread":0.22134326620270606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142502904","genre_codex":"review","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.1268737,0.40871745,0.08659096,0.022140665,0.0062995716,0.009338067,0.00067312096,0.0012911077,0.33807534],"genre_scores_gemma":[0.9139988,0.07853985,0.0015293179,0.0017348372,0.00016964506,0.00011793368,0.0000994601,0.00006674896,0.0037434343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842435,0.00044484768,0.00053179485,0.00017209699,0.00027130346,0.00015561131],"domain_scores_gemma":[0.9989385,0.0003411426,0.00016127135,0.0003337476,0.00018075369,0.000044566175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020829183,0.00018264429,0.00028621362,0.0000487528,0.000075170174,0.000043865777,0.00046584383,0.000052266983,0.00035407496],"category_scores_gemma":[0.00028020435,0.00011348663,0.00013890104,0.00027608682,0.00025812272,0.00011008968,0.00007482338,0.00022524579,0.000021277685],"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.0002613867,0.00022753107,0.015822591,0.004024947,0.0014764263,0.00001051702,0.003938218,0.13038135,0.0009978875,0.75919133,0.008254065,0.07541373],"study_design_scores_gemma":[0.01173033,0.00012746293,0.07430232,0.02761571,0.0011564378,0.0010760934,0.00040706215,0.28556445,0.0011265661,0.16279481,0.43067414,0.0034246298],"about_ca_topic_score_codex":0.000021927055,"about_ca_topic_score_gemma":0.00003632182,"teacher_disagreement_score":0.78712505,"about_ca_system_score_codex":0.00003619697,"about_ca_system_score_gemma":0.000029915145,"threshold_uncertainty_score":0.46278507},"labels":[],"label_agreement":null},{"id":"W2144900108","doi":"10.1111/j.1475-3995.2009.00723.x","title":"Optimal aircraft load balancing","year":2009,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mathematical optimization; Payload (computing); Set (abstract data type); Integer programming; Function (biology); Linear programming; Macro; Position (finance); Cardinality (data modeling); Orientation (vector space); Operations research; Mathematics","score_opus":0.040974556188726634,"score_gpt":0.35167667460582114,"score_spread":0.3107021184170945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144900108","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.036887873,0.00030922747,0.71733886,0.010534871,0.0018546245,0.0005815776,0.00007142746,0.0004649304,0.23195659],"genre_scores_gemma":[0.98593724,0.00019227539,0.010244292,0.00013216953,0.00013457675,0.00004002049,0.000035169523,0.0000151539125,0.003269104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984195,0.000047156656,0.00026459055,0.0001827528,0.00082927593,0.0002567149],"domain_scores_gemma":[0.9992963,0.00011751639,0.00000745297,0.00011412249,0.00039783271,0.00006676847],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006277828,0.00009923556,0.00008587579,0.0004026101,0.00012891517,0.00015158091,0.00024135238,0.00007898262,0.0023215008],"category_scores_gemma":[0.000058357175,0.00010943835,0.000042170308,0.00044120266,0.000040433155,0.00038827374,0.000004175995,0.00048659323,0.00017927287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014210689,0.00006528853,0.00010808344,0.0000037146108,0.000014862632,0.0000065045438,0.00028491722,0.9880625,0.0015239001,0.0026784563,0.00076658,0.006470958],"study_design_scores_gemma":[0.00065334793,0.000048751812,0.0034515248,0.000057689165,0.0000017918084,0.000026581873,0.00010837576,0.94962627,0.001933275,0.00061365205,0.043279335,0.00019938515],"about_ca_topic_score_codex":0.00003050838,"about_ca_topic_score_gemma":0.000071015485,"teacher_disagreement_score":0.94904935,"about_ca_system_score_codex":0.00048349355,"about_ca_system_score_gemma":0.00014793215,"threshold_uncertainty_score":0.9985905},"labels":[],"label_agreement":null},{"id":"W2147243846","doi":"10.1051/ro/2014019","title":"Block decomposition approach to compute a minimum geodetic set","year":2014,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Geodetic datum; Block (permutation group theory); Set (abstract data type); Decomposition; Computer science; Algorithm; Mathematics; Arithmetic; Geodesy; Combinatorics; Geology; Programming language; Chemistry","score_opus":0.05863119614734241,"score_gpt":0.3485741806096815,"score_spread":0.28994298446233907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147243846","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.106645204,0.000056246714,0.8251098,0.0012892509,0.0002728746,0.0010334951,0.000026962818,0.0005115758,0.06505461],"genre_scores_gemma":[0.9583023,0.000013748105,0.039815165,0.00011188787,0.0001428896,0.00012658762,0.00012871041,0.00003646429,0.0013222048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987258,0.00017356535,0.0001983964,0.00022329323,0.0003326363,0.0003463612],"domain_scores_gemma":[0.99921685,0.000083094994,0.0000038749386,0.00031596018,0.0002056079,0.00017457927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062676595,0.00011074761,0.00012348978,0.00032007767,0.00033382373,0.00026837105,0.00021183083,0.00007634677,0.00006110694],"category_scores_gemma":[0.000059852006,0.00011341397,0.00003105728,0.0006284258,0.000036452282,0.00011184377,0.00006053813,0.00026117466,0.00056249154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026414343,0.00004209968,0.000017109724,0.000031180276,0.000010995489,2.2873014e-7,0.00073237094,0.98333377,0.002065528,0.0023824943,0.0104434835,0.0009380944],"study_design_scores_gemma":[0.00023456458,0.000056756944,0.00017315683,0.00002098922,0.000002854599,0.000006359481,0.000042973526,0.9813603,0.0009369389,0.000041028452,0.01698471,0.00013937199],"about_ca_topic_score_codex":0.00003070145,"about_ca_topic_score_gemma":0.000043756492,"teacher_disagreement_score":0.85165715,"about_ca_system_score_codex":0.0000733031,"about_ca_system_score_gemma":0.000029664727,"threshold_uncertainty_score":0.72298783},"labels":[],"label_agreement":null},{"id":"W2151593109","doi":"10.1109/isic.2002.1157770","title":"An adaptive fuzzy algorithm for cut sequencing of solid wood in furniture component production","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Adaptability; Production (economics); Fuzzy logic; Component (thermodynamics); Algorithm; Process (computing); Computer science; STRIPS; Solid wood; Artificial intelligence; Materials science; Layer (electronics); Composite material","score_opus":0.02288766735146257,"score_gpt":0.245421220449971,"score_spread":0.22253355309850842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151593109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02802819,0.00012186324,0.960604,0.000039450875,0.0006762182,0.0007190043,0.000023131639,0.0002739867,0.009514144],"genre_scores_gemma":[0.86347926,0.000018090223,0.13626789,0.000013550879,0.000034553563,0.00002019695,0.000015993912,0.00001926544,0.00013121407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995102,0.000021054835,0.00016833558,0.00011187292,0.00006307091,0.00012542107],"domain_scores_gemma":[0.99977267,0.000010866184,0.00002476859,0.00010374545,0.000057401085,0.000030543255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014542026,0.000081784645,0.000115469185,0.00008680147,0.000019965213,0.000006960452,0.000037653845,0.000053395204,0.000021451737],"category_scores_gemma":[0.000010663913,0.000080149824,0.000022283262,0.00013674724,0.000009895686,0.000119899196,0.0000022505508,0.00007225592,0.0000018494395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004007689,0.000033274267,0.000030250774,0.00004103697,0.000015140664,3.7843074e-7,0.00094923715,0.9814601,0.01148997,0.0011497027,0.00014690286,0.0046800263],"study_design_scores_gemma":[0.0004895866,0.000117152034,0.00004729006,0.000056003915,0.000009312583,0.000007951229,0.0009645943,0.8657084,0.13094309,0.00070320105,0.00075195363,0.00020144985],"about_ca_topic_score_codex":0.000012447702,"about_ca_topic_score_gemma":0.00004733622,"teacher_disagreement_score":0.83545107,"about_ca_system_score_codex":0.000060784805,"about_ca_system_score_gemma":0.00001744965,"threshold_uncertainty_score":0.3268415},"labels":[],"label_agreement":null},{"id":"W2155714059","doi":"10.1016/j.cor.2006.03.026","title":"Roll assortment optimization in a paper mill: An integer programming approach","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Trim; Computer science; Mill; Mathematical optimization; Pooling; Integer programming; Operations research; Mathematics; Engineering; Algorithm","score_opus":0.03790654818600927,"score_gpt":0.30589590689821033,"score_spread":0.2679893587122011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155714059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005367372,0.00016724378,0.98378134,0.00023835307,0.00016673024,0.00083404756,0.0000037819427,0.00028903288,0.009152093],"genre_scores_gemma":[0.66567975,0.000039703114,0.33296493,0.000043659245,0.00016330087,0.0002586614,0.00044352163,0.00004930244,0.00035717702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854296,0.00018101661,0.0002960359,0.0002698417,0.0003246625,0.00038545727],"domain_scores_gemma":[0.99940956,0.00003900394,0.0000072525063,0.00027383995,0.00019147858,0.00007883886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064087764,0.00013291923,0.00013315461,0.00044528052,0.00019347583,0.0004190131,0.00020874963,0.00009200299,0.00006352409],"category_scores_gemma":[0.000016878763,0.00013366257,0.000029419836,0.00087516266,0.000048373633,0.000450545,0.00005046658,0.00032345013,0.000020587191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002846099,0.00016314157,0.00020881888,0.00001950139,0.000007718904,0.0000023982946,0.00045034147,0.994146,0.000104398576,0.0012265182,0.0010511082,0.0026172139],"study_design_scores_gemma":[0.00036510493,0.00004414586,0.00028056337,0.000024570852,0.0000018245144,0.000003432536,0.00008135223,0.9948902,0.00006556787,0.000029453158,0.0040661213,0.00014766639],"about_ca_topic_score_codex":0.00023784219,"about_ca_topic_score_gemma":0.00025271604,"teacher_disagreement_score":0.66031235,"about_ca_system_score_codex":0.00018915925,"about_ca_system_score_gemma":0.000046630663,"threshold_uncertainty_score":0.54506016},"labels":[],"label_agreement":null},{"id":"W2156398306","doi":"10.1002/net.21459","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Stack (abstract data type); Computer science; Constraint (computer-aided design); Algorithm; 2-opt; Branch and cut; Mathematical optimization; Mathematics; Integer programming; Artificial intelligence","score_opus":0.01037015660828235,"score_gpt":0.1923077332894443,"score_spread":0.18193757668116195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156398306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008639148,0.004132618,0.986077,0.00003900324,0.00019385928,0.00042468993,0.0000063540747,0.00014239314,0.00034492486],"genre_scores_gemma":[0.96128756,0.00076164916,0.037343156,0.000092118724,0.00030514377,0.00005974834,0.00001456899,0.00004138806,0.000094653806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994696,0.00001008784,0.00010666907,0.000095286836,0.000054956898,0.00026340704],"domain_scores_gemma":[0.9996274,0.0001633427,0.000020875303,0.00009210443,0.000024978608,0.000071292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001524062,0.000116276526,0.00010197956,0.000016672531,0.00012724375,0.00005300264,0.00004560814,0.000072572395,0.0000064659903],"category_scores_gemma":[0.0000027456947,0.00008166702,0.000017465769,0.000068776426,0.00003284804,0.000109772,0.000013796466,0.00013316439,9.1141055e-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.000013822374,0.000011535551,0.007621985,0.00005732895,0.000077551296,2.5680637e-7,0.0012207935,0.7233991,0.00000970682,0.00010460591,0.0006722231,0.2668111],"study_design_scores_gemma":[0.0005849453,0.000026233167,0.0015278982,0.00004601428,0.000031631916,0.000009899257,0.000052262243,0.9897737,0.000019310208,0.000016209568,0.007776457,0.00013546029],"about_ca_topic_score_codex":0.000009905557,"about_ca_topic_score_gemma":0.000051119485,"teacher_disagreement_score":0.9526484,"about_ca_system_score_codex":0.000009568793,"about_ca_system_score_gemma":0.0000043772116,"threshold_uncertainty_score":0.33302844},"labels":[],"label_agreement":null},{"id":"W2158742617","doi":"10.1016/j.amc.2012.03.052","title":"The three-dimensional knapsack problem with balancing constraints","year":2012,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Knapsack problem; Continuous knapsack problem; Heuristics; Packing problems; Mathematical optimization; Mathematics; Cutting stock problem; Heuristic; Change-making problem; Upper and lower bounds; Polynomial-time approximation scheme; Combinatorial optimization; Extension (predicate logic); Computer science; Optimization problem; Algorithm","score_opus":0.010221874808091894,"score_gpt":0.2026838768217767,"score_spread":0.1924620020136848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158742617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044531718,0.00016377405,0.9358588,0.00005219272,0.000082215105,0.00033766622,0.0000015587409,0.00018478106,0.018787324],"genre_scores_gemma":[0.85753566,0.000006973175,0.1423653,0.000021246562,0.000023063005,0.00001684622,0.0000071876793,0.0000152290495,0.0000085144275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959224,0.0000019966635,0.00012128384,0.000050990144,0.00009726338,0.00013624084],"domain_scores_gemma":[0.99976206,0.0000904392,0.000034062272,0.000051693634,0.000020581701,0.00004119163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014411345,0.00008003943,0.00007186094,0.00001591464,0.00011739752,0.00005161078,0.000027258422,0.000025667616,0.0000071609043],"category_scores_gemma":[0.0000015125602,0.000052877105,0.000007732724,0.00006110564,0.00004426026,0.00004179353,0.000010048399,0.000056262736,0.000013951042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007895019,0.00006760464,0.0003261946,0.0003420851,0.000098653036,4.513013e-7,0.0024782296,0.61860573,0.0007311698,0.27480212,0.0008520839,0.10168776],"study_design_scores_gemma":[0.00040056108,0.00001674264,0.0003662893,0.000059528895,0.000022620532,0.000027808137,0.00017062413,0.9836958,0.00023811973,0.014304196,0.00050421053,0.00019347802],"about_ca_topic_score_codex":4.4622158e-7,"about_ca_topic_score_gemma":0.0000027842502,"teacher_disagreement_score":0.8130039,"about_ca_system_score_codex":0.000008728405,"about_ca_system_score_gemma":0.000005562155,"threshold_uncertainty_score":0.21562658},"labels":[],"label_agreement":null},{"id":"W2168358943","doi":"10.1016/j.jda.2011.12.006","title":"Chains-into-bins processes","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Optimization and Packing Problems","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":"Simon Fraser University","funders":"","keywords":"Bin; Ball (mathematics); Chain (unit); Combinatorics; Set (abstract data type); Object (grammar); Mathematics; Computer science; Process (computing); Mathematical optimization; Algorithm; Discrete mathematics; Geometry; Artificial intelligence; Physics","score_opus":0.021561247602419897,"score_gpt":0.22196563655160817,"score_spread":0.20040438894918827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168358943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026839726,0.00668779,0.8751342,0.00043024847,0.0038479052,0.00031150205,0.000023792481,0.00048115756,0.086243644],"genre_scores_gemma":[0.9060419,0.0013843968,0.09148162,0.00007945076,0.00042583645,0.0000030485178,0.0000037073323,0.000059973823,0.0005200514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.000011947688,0.0003214515,0.000059833506,0.0001769034,0.0001531513],"domain_scores_gemma":[0.99950355,0.000016158916,0.00011028325,0.00009464988,0.0001656071,0.00010977749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014634954,0.000112475595,0.00017065863,0.000121127756,0.000038423463,0.000030380186,0.00017652397,0.000054560798,0.00018388923],"category_scores_gemma":[0.000035641755,0.00009020832,0.000068859634,0.00021920305,0.000025943467,0.00027742534,0.000012555609,0.00017234267,0.000018874474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040165763,0.0012275301,0.016467614,0.0051668994,0.0037082296,0.001117303,0.1354447,0.37152,0.007627358,0.008061005,0.04791091,0.40134677],"study_design_scores_gemma":[0.011022825,0.0040027327,0.013126946,0.0027126851,0.0008145295,0.0022611297,0.0051569855,0.5485396,0.13087448,0.017988872,0.25878334,0.0047158655],"about_ca_topic_score_codex":0.0000055079695,"about_ca_topic_score_gemma":0.000004357739,"teacher_disagreement_score":0.8792022,"about_ca_system_score_codex":0.000025078614,"about_ca_system_score_gemma":0.000040336912,"threshold_uncertainty_score":0.36785886},"labels":[],"label_agreement":null},{"id":"W2175876344","doi":"","title":"Improved Adaptive Genetic Algorithm in Optimal Layout of Leather Rectangular Parts","year":2015,"lang":"en","type":"article","venue":"Advances in natural science/Advances in natural sciences","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Crossover; Rectangle; Genetic algorithm; Mass customization; Algorithm; Mathematical optimization; Convergence (economics); Key (lock); Engineering; Computer science; Personalization; Mathematics; Artificial intelligence","score_opus":0.010754058599900156,"score_gpt":0.2735975248051858,"score_spread":0.26284346620528565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175876344","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.55534774,0.40726373,0.005987134,0.00024495498,0.011900255,0.0018484611,0.000027094711,0.0003887608,0.016991902],"genre_scores_gemma":[0.89946204,0.0026192237,0.09772889,0.00003846518,0.00005823268,0.000027860167,0.0000023075436,0.000014753526,0.000048232112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966213,0.00007983841,0.0006967228,0.000733031,0.000913748,0.00095534296],"domain_scores_gemma":[0.99911517,0.00016682214,0.00017303639,0.00023889338,0.00015460268,0.00015146504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014312987,0.00033840927,0.000455203,0.0008094531,0.00011804008,0.0000879067,0.0011470756,0.00010737249,0.000015025403],"category_scores_gemma":[0.00029128688,0.00027074065,0.000059391692,0.004806128,0.0017491442,0.0042157164,0.00014408758,0.00057071674,0.0000044265557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029647723,0.00003402295,0.0061036423,0.0000213731,0.0000018566209,0.000012854397,0.00091067416,0.8605949,0.00070140784,0.00045063184,0.0000053227986,0.13113362],"study_design_scores_gemma":[0.0010633417,0.00025150986,0.0031315316,0.00024377844,0.0000035526416,0.00001860063,0.0014654188,0.9834558,0.0041767135,0.0033298463,0.002224526,0.0006353752],"about_ca_topic_score_codex":0.000110050125,"about_ca_topic_score_gemma":0.0011507096,"teacher_disagreement_score":0.4046445,"about_ca_system_score_codex":0.00040308482,"about_ca_system_score_gemma":0.0002231491,"threshold_uncertainty_score":0.9999745},"labels":[],"label_agreement":null},{"id":"W2263556125","doi":"10.1080/03155986.2003.11732685","title":"On The Relations Between Optimal Solutions For Different Types Of<i>Min-Sum</i>Balanced Jit Optimisation Problems","year":2003,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Property (philosophy); Mathematics; Set (abstract data type); Mathematical optimization; Combinatorics; Applied mathematics; Computer science","score_opus":0.07693416596278509,"score_gpt":0.30100458000275154,"score_spread":0.22407041403996647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263556125","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.13825512,0.0007197325,0.7519494,0.001772309,0.0010012878,0.007899373,0.00095655496,0.00031795664,0.09712823],"genre_scores_gemma":[0.9977436,0.000048903374,0.0008558144,0.00003096505,0.00004380136,0.00045451525,0.00027376393,0.000011512793,0.00053710665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857163,0.00008331487,0.0005374333,0.00008061456,0.0004684701,0.00025850764],"domain_scores_gemma":[0.99832183,0.0007716712,0.0000758315,0.0001580477,0.0006060556,0.00006655913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014771598,0.000116506766,0.00014878689,0.00023924735,0.0005444419,0.00027003157,0.00010312539,0.00010303169,0.000054341283],"category_scores_gemma":[0.0004277471,0.000084036656,0.000040745945,0.0002714729,0.00007056777,0.0006496739,0.000018646055,0.00019539736,0.000043655695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053474096,0.0000062653053,0.0003068961,0.000094407515,0.000028709328,8.560169e-9,0.0006680138,0.6758692,0.00003678429,0.3197031,0.0030465496,0.00023470854],"study_design_scores_gemma":[0.0010248589,0.00020680597,0.002147551,0.00021779242,0.00001629905,0.0000040357295,0.0008576,0.8836354,0.00059909845,0.0009137317,0.110100314,0.00027650298],"about_ca_topic_score_codex":0.00001331826,"about_ca_topic_score_gemma":0.000003526768,"teacher_disagreement_score":0.8594885,"about_ca_system_score_codex":0.00007815336,"about_ca_system_score_gemma":0.00008368552,"threshold_uncertainty_score":0.41874623},"labels":[],"label_agreement":null},{"id":"W2288980828","doi":"","title":"Bound constraints for Point Packing in a Square","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Square (algebra); Computer science; Point (geometry); Packing problems; Upper and lower bounds; Mathematical optimization; Mathematics; Algorithm; Geometry; Mathematical analysis","score_opus":0.022184027722259934,"score_gpt":0.2285077954032597,"score_spread":0.20632376768099975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288980828","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.19604169,0.0017046654,0.68967634,0.00053963077,0.027865063,0.0073770573,0.000106965934,0.0025376994,0.07415088],"genre_scores_gemma":[0.99391663,0.00038902595,0.00532571,0.000086669876,0.000034686058,0.00011371906,0.00005683147,0.000042176518,0.000034550005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905324,0.000036440924,0.00030269302,0.00023917433,0.000095989024,0.00027244375],"domain_scores_gemma":[0.9995354,0.00010136003,0.00006422039,0.00013511292,0.0000806512,0.0000832555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021763648,0.00019614266,0.00022934932,0.00024384577,0.0001070462,0.00006849696,0.00008861136,0.00018544024,0.00010792388],"category_scores_gemma":[0.00006257224,0.00020895182,0.00005821108,0.00037437363,0.00008826255,0.0001466618,0.000018783368,0.00015767959,0.0000018034449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006218198,0.00041233678,0.0030920296,0.00017753987,0.000096112875,0.00001044949,0.002634078,0.77203655,0.000039732695,0.20618677,0.0015649251,0.013127661],"study_design_scores_gemma":[0.013035457,0.0010145754,0.0027432006,0.0007939327,0.00010107079,0.000011995168,0.0010522322,0.92041993,0.00045007703,0.057388354,0.001584097,0.001405086],"about_ca_topic_score_codex":0.0000033854142,"about_ca_topic_score_gemma":0.000008482183,"teacher_disagreement_score":0.7978749,"about_ca_system_score_codex":0.000047502865,"about_ca_system_score_gemma":0.000016642412,"threshold_uncertainty_score":0.8520808},"labels":[],"label_agreement":null},{"id":"W2294852551","doi":"","title":"Online Packing of Equilateral Triangles","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Equilateral triangle; Competitive analysis; Online algorithm; Computer science; Sequence (biology); Packing problems; Unit (ring theory); Upper and lower bounds; Algorithm; Combinatorics; Mathematics; Geometry","score_opus":0.07778953216714346,"score_gpt":0.26259192413017024,"score_spread":0.18480239196302678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294852551","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.8083494,0.00042149538,0.07638551,0.0019286957,0.002417353,0.0004653151,0.0010534613,0.00045941726,0.1085194],"genre_scores_gemma":[0.9951204,0.0000045341985,0.004204007,0.00020633572,0.00005462231,0.0000018017058,0.00025145183,0.000015755542,0.00014106817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934334,0.000016059397,0.0001903039,0.00010244277,0.00016828549,0.0001796023],"domain_scores_gemma":[0.99932104,0.000044405293,0.000031195497,0.00008859241,0.00020528564,0.0003094515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009373517,0.00010040996,0.00013375297,0.00041076777,0.000024961875,0.0000370349,0.00011358329,0.00006068604,0.0002533832],"category_scores_gemma":[0.000036144473,0.00010959701,0.000028436489,0.00033877903,0.00003055485,0.000066920715,0.0000070376514,0.00009979757,0.00004922162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035798869,0.000012922396,0.0007057324,0.000017603024,0.00001993711,0.0000047373173,0.00015738592,0.9772466,0.000009477647,0.015395365,0.0020433627,0.0043833037],"study_design_scores_gemma":[0.000792282,0.000091205875,0.005285889,0.00010237863,0.0000081067565,0.000008524442,0.00020323445,0.9807888,0.000075532414,0.00708104,0.0052675814,0.00029541252],"about_ca_topic_score_codex":0.0010492707,"about_ca_topic_score_gemma":0.003128967,"teacher_disagreement_score":0.18677108,"about_ca_system_score_codex":0.00010542217,"about_ca_system_score_gemma":0.00036001473,"threshold_uncertainty_score":0.4469236},"labels":[],"label_agreement":null},{"id":"W2296334577","doi":"10.1145/2766912","title":"Foldabilizing furniture","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Folding (DSP implementation); Computer science; Object (grammar); Design for manufacturability; Mathematical optimization; Granularity; Set (abstract data type); Packing problems; Process (computing); Topology (electrical circuits); Graph; Algorithm; Mathematics; Theoretical computer science; Combinatorics; Artificial intelligence; Programming language; Engineering","score_opus":0.04175396911881586,"score_gpt":0.24077964785714184,"score_spread":0.199025678738326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296334577","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.006762558,0.00028573233,0.9804246,0.00084101653,0.0014026703,0.00017604214,0.000017022121,0.0013429607,0.008747406],"genre_scores_gemma":[0.9926759,0.00017800849,0.0066538923,0.00025364483,0.00003053833,0.00001511295,0.0000068445484,0.000035369805,0.0001506831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949706,0.000014716228,0.00011510694,0.00009913611,0.00013394817,0.00014006553],"domain_scores_gemma":[0.9994739,0.00004068293,0.000010074505,0.0003153839,0.00004980533,0.00011010841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009339667,0.00010484734,0.00008115081,0.00015098495,0.00006761724,0.000032042804,0.00013692035,0.00009829922,0.00005366535],"category_scores_gemma":[0.00001511009,0.00010556581,0.000058727772,0.00039186334,0.000023075978,0.000104307735,0.0000011485487,0.00024438126,0.000056512177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008868646,0.00005670348,0.00017504203,0.000034243734,0.000059346465,0.000002616786,0.00088839815,0.9827644,0.00011029134,0.001581153,0.0024605687,0.011858317],"study_design_scores_gemma":[0.005039585,0.0006408373,0.00090063247,0.00024824328,0.00029590912,0.00010947331,0.0016587686,0.34419918,0.012790189,0.06837427,0.5631114,0.002631473],"about_ca_topic_score_codex":0.000003866338,"about_ca_topic_score_gemma":0.000026554928,"teacher_disagreement_score":0.98591334,"about_ca_system_score_codex":0.000023410046,"about_ca_system_score_gemma":0.000013633284,"threshold_uncertainty_score":0.43048486},"labels":[],"label_agreement":null},{"id":"W2335025365","doi":"10.1115/imece2005-81508","title":"Automated Optimal Design for Manufacturability of Sheet/Plate Assemblies","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Design for manufacturability; Blank; Nesting (process); Computer science; Parametric statistics; Product (mathematics); Product design; Dimension (graph theory); Parametric design; CAD; Engineering drawing; Raw material; Mechanical engineering; Manufacturing engineering; Engineering; Mathematics","score_opus":0.026977690177638704,"score_gpt":0.25707534975469526,"score_spread":0.23009765957705655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335025365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044708133,0.00004566125,0.94697046,0.00011617402,0.00011308188,0.0003300371,0.000009596397,0.0016245409,0.006082321],"genre_scores_gemma":[0.6804145,0.000010142808,0.31923112,0.00001855299,0.000014761984,0.000012099566,0.0000082005945,0.000014155268,0.00027645382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995261,0.000010732914,0.00019002857,0.00008341511,0.00005752005,0.0001322187],"domain_scores_gemma":[0.9997047,0.00008842471,0.000019946812,0.00011473129,0.00003973831,0.000032451167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015148721,0.00008663419,0.000119876226,0.00004678415,0.000022286908,0.0000185783,0.00006718007,0.000055794677,0.0002671235],"category_scores_gemma":[0.000017161941,0.0000769258,0.000039845017,0.000064336746,0.000014447746,0.000115202354,0.000006716273,0.00003472981,0.00001705737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078897965,0.0000111572435,0.000030092533,0.000048951715,0.000017974167,4.922407e-8,0.00010533892,0.99194556,0.0013684937,0.00015709017,0.0047149416,0.0015924601],"study_design_scores_gemma":[0.00022648656,0.00002298403,0.00022176748,0.0000070552383,0.000006333416,8.5928417e-7,0.000009937405,0.9055861,0.09131871,0.00003216278,0.0024788752,0.00008869574],"about_ca_topic_score_codex":0.0000025545846,"about_ca_topic_score_gemma":0.0000027438546,"teacher_disagreement_score":0.63570637,"about_ca_system_score_codex":0.00002125378,"about_ca_system_score_gemma":0.000007855551,"threshold_uncertainty_score":0.3136943},"labels":[],"label_agreement":null},{"id":"W2340033801","doi":"10.5278/ojs.td.v1i1.5473","title":"Vehicle Routing with Cross-Docking","year":2020,"lang":"en","type":"article","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Vehicle routing problem; DOCK; Computer science; Routing (electronic design automation); Docking (animal); Operations research; Engineering; Computer network; Marine engineering; Medicine","score_opus":0.014137275899264135,"score_gpt":0.19213337167723024,"score_spread":0.1779960957779661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340033801","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.5492479,0.0004864914,0.30407313,0.00233001,0.00023077,0.0016244508,0.00021762759,0.0029399185,0.13884972],"genre_scores_gemma":[0.97908455,0.00026243977,0.019868134,0.000084406165,0.00003559032,1.4569963e-7,0.000020943558,0.000061100436,0.00058266596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744195,0.000109395885,0.00045596753,0.00068405486,0.00067284267,0.00063580734],"domain_scores_gemma":[0.99794155,0.00028861783,0.00031336927,0.0006350672,0.00033040784,0.000490974],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036378144,0.00044508348,0.0008389209,0.00025571737,0.00035007118,0.00004027712,0.001404185,0.00058865716,0.0013752326],"category_scores_gemma":[0.0001242408,0.00055530376,0.0003678796,0.0013611879,0.0008789362,0.0005419701,0.0006111162,0.0009840189,0.00015570714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009123154,0.002625275,0.11476931,0.0043880874,0.0026404783,0.0037189696,0.006801366,0.5595381,0.19654639,0.028303482,0.05060611,0.020939272],"study_design_scores_gemma":[0.047638945,0.007854759,0.19465429,0.0060769846,0.0036036947,0.00073236873,0.012796376,0.43711576,0.03016454,0.0013732832,0.24410374,0.013885253],"about_ca_topic_score_codex":0.00013719496,"about_ca_topic_score_gemma":0.00020658488,"teacher_disagreement_score":0.4298367,"about_ca_system_score_codex":0.00026016182,"about_ca_system_score_gemma":0.00012599438,"threshold_uncertainty_score":0.9996898},"labels":[],"label_agreement":null},{"id":"W2368270781","doi":"10.1631/jzus.2007.a1944","title":"Layer-layout-based heuristics for loading homogeneous items into a single container","year":2007,"lang":"en","type":"article","venue":"Journal of Zhejiang University. Science A","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Heuristics; Container (type theory); Heuristic; Layer (electronics); Computer science; Packing problems; Computation; Block (permutation group theory); Homogeneous; Face (sociological concept); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Engineering; Materials science; Mechanical engineering; Geometry; Operating system","score_opus":0.01660040312727486,"score_gpt":0.22677603409684793,"score_spread":0.21017563096957306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2368270781","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.19215664,0.00010481707,0.8034837,0.00015226491,0.00072535034,0.00010845662,0.000004401986,0.00006153359,0.0032028174],"genre_scores_gemma":[0.96731514,0.0000064805345,0.032260045,0.00007182548,0.000080089005,3.8401506e-8,7.7056114e-7,0.000010789219,0.00025483314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992171,0.0000103613775,0.00018811208,0.00009026394,0.00024267653,0.00025146684],"domain_scores_gemma":[0.9991419,0.00013411006,0.00011714024,0.000091091264,0.00034987295,0.00016593948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089688145,0.000085449115,0.00013197154,0.0004935501,0.00018987211,0.00006631562,0.00030025106,0.000046105197,0.0000107048145],"category_scores_gemma":[0.0001260548,0.00008731849,0.00007404896,0.0006510074,0.00012183369,0.0002947918,0.00001731888,0.00011008928,0.000003316076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017220096,0.00010638386,0.0017104851,0.00008918875,0.000045569388,0.0002738842,0.0021583438,0.8345081,0.1529129,0.0012252291,0.0018663623,0.00493134],"study_design_scores_gemma":[0.0056365044,0.0014541271,0.0011359797,0.00054118456,0.0002085154,0.0003272382,0.005517046,0.6736105,0.113716215,0.0003764742,0.19634514,0.0011310361],"about_ca_topic_score_codex":0.0000067854567,"about_ca_topic_score_gemma":0.000021354885,"teacher_disagreement_score":0.77515846,"about_ca_system_score_codex":0.00030345438,"about_ca_system_score_gemma":0.00012535808,"threshold_uncertainty_score":0.35607448},"labels":[],"label_agreement":null},{"id":"W2374538697","doi":"","title":"0/1 Knapsack Problem","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Backtracking; Continuous knapsack problem; Computer science; Mathematical optimization; Cutting stock problem; Greedy algorithm; Change-making problem; Polynomial-time approximation scheme; Branch and bound; Realization (probability); Optimization problem; Algorithm; Mathematics","score_opus":0.004686204796815385,"score_gpt":0.2035872261520742,"score_spread":0.1989010213552588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2374538697","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.00040652943,0.000110533125,0.96257126,0.000059756723,0.000019634406,0.00033873977,0.000003636471,0.00063207,0.03585783],"genre_scores_gemma":[0.07835665,0.00003362188,0.920068,0.0003094869,0.0002467676,0.00013259362,0.00006168061,0.00004829008,0.0007428822],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994703,0.000002797134,0.00017158463,0.0001204178,0.00005066936,0.00018424998],"domain_scores_gemma":[0.9997206,0.000019451087,0.000015523117,0.00014707306,0.000033568653,0.00006380625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009345249,0.00008877216,0.00006696245,0.00007460599,0.0000625641,0.000037503112,0.00013417828,0.00004940466,0.000054124794],"category_scores_gemma":[4.913194e-8,0.00009615309,0.000029801691,0.0002547066,0.00001596949,0.000049903694,0.000019253212,0.0000842346,0.00043192873],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002531389,0.000116741096,0.00070904667,0.00016107416,0.00006867523,0.0000018934822,0.0008920512,0.12666748,0.021965725,0.019728953,0.053252343,0.77643347],"study_design_scores_gemma":[0.00011906265,0.0000037258874,0.00034468982,0.000006006271,0.0000038266026,0.000008401995,0.000005618081,0.0050885845,0.0041380636,0.00050860044,0.9896384,0.00013500651],"about_ca_topic_score_codex":0.0000014912426,"about_ca_topic_score_gemma":0.0000047266863,"teacher_disagreement_score":0.93638605,"about_ca_system_score_codex":0.000027148526,"about_ca_system_score_gemma":0.000005096372,"threshold_uncertainty_score":0.5551714},"labels":[],"label_agreement":null},{"id":"W2383786611","doi":"","title":"Discussion on the 0/1 Knapsack Problem","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Computer science; Simulated annealing; Greedy algorithm; Mathematical optimization; Continuous knapsack problem; Heuristic; Algorithm; Artificial intelligence; Mathematics","score_opus":0.008073139094559676,"score_gpt":0.21068873605826763,"score_spread":0.20261559696370796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383786611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043612387,0.000029577754,0.97267306,0.0012364944,0.000023475648,0.00054441084,0.000004028626,0.00037124273,0.024681577],"genre_scores_gemma":[0.5224281,0.00007179209,0.46871483,0.0029544975,0.0007948236,0.000731766,0.0001311406,0.00014836165,0.0040246937],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999495,0.0000069088696,0.00014931468,0.0001198585,0.000067826055,0.00016106623],"domain_scores_gemma":[0.9996606,0.00004790882,0.00001834878,0.00020746271,0.00002188014,0.00004379195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013932226,0.000093700415,0.000055687877,0.00004932576,0.00013111584,0.000047026035,0.00017737735,0.000041495245,0.00005810662],"category_scores_gemma":[1.3969843e-7,0.00005332778,0.000033358745,0.0002327065,0.000020439702,0.00003102748,0.000022576105,0.000121209276,0.000425808],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056787535,0.00017100833,0.0002480028,0.000080748105,0.000059483435,0.0000010242267,0.0015469263,0.152356,0.014253004,0.07136007,0.11883677,0.6410813],"study_design_scores_gemma":[0.00008678868,0.0000071674713,0.0003176412,0.000015179484,0.0000034413426,0.0000030786769,0.000015915326,0.0060886387,0.0041651973,0.000875868,0.98830736,0.00011372987],"about_ca_topic_score_codex":8.342344e-7,"about_ca_topic_score_gemma":0.0000030867884,"teacher_disagreement_score":0.8694706,"about_ca_system_score_codex":0.000026278389,"about_ca_system_score_gemma":0.0000040442897,"threshold_uncertainty_score":0.5473042},"labels":[],"label_agreement":null},{"id":"W2402912519","doi":"","title":"Dual Helly-Type Theorems For Unions Of Sets Starshaped Via Staircase Paths.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Type (biology); Combinatorics; Discrete mathematics; Linguistics","score_opus":0.011388452935265074,"score_gpt":0.22248788142018214,"score_spread":0.21109942848491706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402912519","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.9844706,0.0003436098,0.004533748,0.00016519435,0.0042878673,0.0011822595,0.00006782103,0.0005356145,0.004413282],"genre_scores_gemma":[0.99819714,0.00004239333,0.0014047801,0.000036064324,0.0000067236674,0.00003477654,0.00006397151,0.00004465271,0.00016949243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929243,0.00002381836,0.00023119654,0.00012006969,0.00011090357,0.00022156989],"domain_scores_gemma":[0.99935174,0.000100494064,0.000045768735,0.00022612876,0.00018984092,0.00008602376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012587677,0.00013351295,0.0001704607,0.000068684065,0.000052540592,0.000027340264,0.00010403012,0.00008668605,0.00025823497],"category_scores_gemma":[0.0000367356,0.00013388699,0.00005065719,0.00021048353,0.000033819746,0.00013025982,0.00002303695,0.00008981802,0.000058050795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057126275,0.00045102974,0.0021981795,0.00082260644,0.00034780108,0.000008411932,0.0031332897,0.067866735,0.022031365,0.8576351,0.035826735,0.009621624],"study_design_scores_gemma":[0.0035874725,0.0005708792,0.0010319916,0.00010721965,0.00006737525,0.000010609587,0.00028436526,0.3408909,0.014842716,0.62621486,0.01156905,0.0008225392],"about_ca_topic_score_codex":0.000025911231,"about_ca_topic_score_gemma":0.000003221675,"teacher_disagreement_score":0.27302417,"about_ca_system_score_codex":0.000027620408,"about_ca_system_score_gemma":0.000021536705,"threshold_uncertainty_score":0.54597527},"labels":[],"label_agreement":null},{"id":"W2403305660","doi":"","title":"Two new classes of spectrally arbitrary sign patterns.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sign (mathematics); Mathematical analysis","score_opus":0.010400029965071549,"score_gpt":0.2249128926916732,"score_spread":0.21451286272660164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403305660","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.87289786,0.0008025768,0.004575597,0.00052958285,0.003187964,0.00034826598,0.000009488209,0.0010405976,0.11660807],"genre_scores_gemma":[0.9976976,0.00009060522,0.001827692,0.00014611022,0.000015373806,9.061071e-7,0.000008939994,0.00001910088,0.00019368094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941593,0.000012788829,0.0001909886,0.000100348516,0.00011638574,0.00016355631],"domain_scores_gemma":[0.9996772,0.000025936446,0.000031469048,0.0001772658,0.00002322827,0.000064905835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005107742,0.00011390386,0.00014980651,0.000060912476,0.000017625709,0.000023449205,0.00013243266,0.000049190974,0.00013072044],"category_scores_gemma":[0.00000782145,0.00012216448,0.000046894984,0.00015707375,0.000008640756,0.000108629254,0.0000069663447,0.000116766285,0.000024867197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021241676,0.00020264352,0.012992294,0.00012364767,0.00010332508,0.000024506973,0.0008387753,0.057488784,0.0075288056,0.88075733,0.028733902,0.011184729],"study_design_scores_gemma":[0.004974132,0.0006409793,0.050793253,0.00032527835,0.00006895439,0.000015519567,0.000066002875,0.020217841,0.0739357,0.8402972,0.007487861,0.0011772449],"about_ca_topic_score_codex":0.000015138574,"about_ca_topic_score_gemma":0.0000027828235,"teacher_disagreement_score":0.12479973,"about_ca_system_score_codex":0.000019525345,"about_ca_system_score_gemma":0.000025403588,"threshold_uncertainty_score":0.49817228},"labels":[],"label_agreement":null},{"id":"W2473424882","doi":"10.3329/ganit.v34i0.28549","title":"A New Decomposition-Based Pricing Technique For Solving Large-Scale Mixed IP with a Computer Technique","year":2016,"lang":"en","type":"article","venue":"GANIT Journal of Bangladesh Mathematical Society","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decomposition; Integer programming; Computer science; Scale (ratio); Benders' decomposition; Mathematical optimization; Decomposition method (queueing theory); Filter (signal processing); Algorithm; Mathematics; Statistics","score_opus":0.008430422427400646,"score_gpt":0.22844857184265463,"score_spread":0.220018149415254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473424882","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.0010663569,0.000034278775,0.997686,0.00031004826,0.00006263062,0.00051760976,0.00000917508,0.00014991961,0.00016393528],"genre_scores_gemma":[0.10836754,0.0000116354195,0.8911817,0.00011282724,0.00017497355,0.000043579716,0.0000023979837,0.000059954702,0.000045351957],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99880445,0.000019735497,0.00048200358,0.00011816359,0.00023159878,0.00034407174],"domain_scores_gemma":[0.9989481,0.00035103734,0.00017278404,0.00014290794,0.00019987558,0.00018530466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053477444,0.0001919653,0.0003401573,0.00006349283,0.000094208604,0.00006419926,0.00016504273,0.00015300576,0.00016400786],"category_scores_gemma":[0.000028028362,0.0001239555,0.0002666295,0.00020080862,0.00003216894,0.00016711063,0.000017932656,0.00019977795,0.0000053742006],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004204365,0.0016894218,0.0021985215,0.008124818,0.0020878026,0.000059337497,0.011502413,0.11569149,0.70022905,0.012297737,0.11831184,0.027387125],"study_design_scores_gemma":[0.009742483,0.0014198008,0.00034416182,0.010183728,0.0004674126,0.00084546476,0.00037627495,0.46680105,0.4801869,0.020308493,0.0076492503,0.0016749537],"about_ca_topic_score_codex":3.8449048e-7,"about_ca_topic_score_gemma":9.71756e-7,"teacher_disagreement_score":0.35110956,"about_ca_system_score_codex":0.00014040076,"about_ca_system_score_gemma":0.00008084923,"threshold_uncertainty_score":0.5054758},"labels":[],"label_agreement":null},{"id":"W2519344319","doi":"","title":"Dynamic scaling in the Mesh Adaptive Direct Search algorithm for blackbox optimization","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Convergence (economics); Mathematical optimization; Class (philosophy); Algorithm; Artificial intelligence; Mathematics","score_opus":0.00979682331321541,"score_gpt":0.22566657401248685,"score_spread":0.21586975069927145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519344319","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.0010633437,0.00027249046,0.9945603,0.00054652325,0.00011891095,0.0009786864,0.00003631219,0.00066070503,0.001762728],"genre_scores_gemma":[0.47540703,0.00020492099,0.5229853,0.00048896164,0.000064960695,0.00052550837,0.00007878988,0.00008843286,0.00015609163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843794,0.00016651733,0.00034834133,0.0002726045,0.00024217284,0.0005324233],"domain_scores_gemma":[0.99905777,0.00028753994,0.00005459384,0.00041487723,0.00008921326,0.00009601537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012544926,0.00024848778,0.00025530125,0.00033614654,0.00015907467,0.00016657512,0.00036525566,0.00020212571,0.000016360742],"category_scores_gemma":[0.00008904811,0.0002225151,0.00010347586,0.0005932602,0.00004473552,0.00020774794,0.000038485563,0.0003158333,0.0000058285177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010531348,0.000036157093,0.00017304799,0.000025435047,0.00001781182,0.0000015361126,0.0005295946,0.9591308,0.000081189784,0.0018933656,0.00032340296,0.037777096],"study_design_scores_gemma":[0.00043198033,0.000065997665,0.00045839153,0.00005003665,0.000015539455,0.000010035271,0.0001405916,0.99703634,0.0005139546,0.000310414,0.0007041053,0.00026261393],"about_ca_topic_score_codex":0.00040658916,"about_ca_topic_score_gemma":0.00043731878,"teacher_disagreement_score":0.4743437,"about_ca_system_score_codex":0.00024966148,"about_ca_system_score_gemma":0.00003984724,"threshold_uncertainty_score":0.90739024},"labels":[],"label_agreement":null},{"id":"W2559457754","doi":"10.1016/j.ejor.2016.11.042","title":"An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Knapsack problem; Enumeration; Benchmark (surveying); Heuristics; Mathematical optimization; Mathematics; Constraint (computer-aided design); Limit (mathematics); Combinatorial optimization; Convergence (economics); Computer science; Algorithm; Combinatorics","score_opus":0.10061928635637359,"score_gpt":0.340530058788879,"score_spread":0.23991077243250541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559457754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016897231,0.00030347242,0.9750347,0.001955823,0.0003117185,0.00082375726,0.000055997505,0.00005035201,0.004566964],"genre_scores_gemma":[0.90844434,0.000107462656,0.08964273,0.000085746346,0.0007966363,0.000024604191,0.000033489858,0.00005729029,0.0008077084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762565,0.00072581536,0.00049296796,0.0001716946,0.0007099312,0.00027394886],"domain_scores_gemma":[0.99633056,0.0017399455,0.00007771892,0.00018588266,0.0015172377,0.00014864914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038754845,0.00013986397,0.000134571,0.00018409644,0.0004409291,0.00022666923,0.00033784032,0.000032590782,0.00014527334],"category_scores_gemma":[0.0008680125,0.00007738049,0.000077683944,0.00019847424,0.00010589553,0.0006674994,0.000030748884,0.00033991752,0.000038322556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016819929,0.00016341996,0.0009296609,0.0000369186,0.00013914666,0.000007531139,0.0013115957,0.8791366,0.08653414,0.0043904823,0.014835362,0.012346925],"study_design_scores_gemma":[0.0034776183,0.0007589275,0.0052668066,0.00015381552,0.000018292923,0.000093100854,0.00018558986,0.9293881,0.0049333773,0.000104230734,0.05530743,0.00031271178],"about_ca_topic_score_codex":0.0000017424292,"about_ca_topic_score_gemma":0.000002801565,"teacher_disagreement_score":0.8915471,"about_ca_system_score_codex":0.0000846643,"about_ca_system_score_gemma":0.000113525515,"threshold_uncertainty_score":0.3391315},"labels":[],"label_agreement":null},{"id":"W2567974663","doi":"10.1007/978-3-642-19222-7_32","title":"Chains-into-Bins Processes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Simon Fraser University","funders":"","keywords":"Bin; Chain (unit); Ball (mathematics); Set (abstract data type); Object (grammar); Process (computing)","score_opus":0.01687628384205723,"score_gpt":0.21315763434362395,"score_spread":0.19628135050156673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567974663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011946655,0.0006649956,0.96405196,0.00006066323,0.0011365424,0.00015897816,0.00000275588,0.00031347442,0.033598684],"genre_scores_gemma":[0.5504924,0.0013555546,0.4401218,0.0015743676,0.0013642653,0.000026868773,0.000036866342,0.00028897982,0.004738898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876195,0.000003790436,0.00022648524,0.00043039306,0.00027732682,0.0003000666],"domain_scores_gemma":[0.99929994,0.000069518086,0.000053668497,0.00036963404,0.00012307355,0.00008416247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015920804,0.0002958757,0.00024081438,0.0003753181,0.00008707639,0.00012065395,0.0006176993,0.00021277307,0.000116168405],"category_scores_gemma":[0.00003190198,0.0002774913,0.00003885672,0.00029754927,0.00023816884,0.0001518979,0.00011499889,0.00038876713,0.0000633725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016163576,0.000008423725,0.000031905824,0.00031811683,0.000010348172,0.0000142124045,0.0019881933,0.7406614,0.000031410156,0.0032218033,0.00004004867,0.25367254],"study_design_scores_gemma":[0.00031896838,0.00013356326,0.000037986112,0.0012298906,0.000017373544,0.000043420674,1.7524273e-7,0.85402596,0.003913288,0.10750224,0.031272974,0.001504188],"about_ca_topic_score_codex":0.000007410802,"about_ca_topic_score_gemma":0.00008332262,"teacher_disagreement_score":0.5504805,"about_ca_system_score_codex":0.00009351556,"about_ca_system_score_gemma":0.00015201107,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W2578864413","doi":"","title":"An approximation algorithm for the subpath planning problem","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Shortest path problem; Motion planning; Computer science; Mathematical optimization; Routing (electronic design automation); Approximation algorithm; Robot; Graph; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.10361960595376998,"score_gpt":0.3155399262039841,"score_spread":0.2119203202502141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578864413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072800694,0.000013111704,0.992576,0.0013302488,0.0009981298,0.0003578692,0.000050122886,0.00024063115,0.0037058778],"genre_scores_gemma":[0.9710719,0.00006475572,0.02800925,0.00014139466,0.0002933462,0.00016325523,0.000030658928,0.000028987826,0.00019644687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989513,0.000022888487,0.00035938068,0.00022618784,0.00023844639,0.00020180547],"domain_scores_gemma":[0.9992643,0.000143797,0.00007312437,0.00019826989,0.00026010044,0.000060385104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028555098,0.0001532229,0.0001064388,0.00010978225,0.00010781426,0.00018038084,0.0003469759,0.000066052504,0.0003382255],"category_scores_gemma":[0.00004604763,0.000098116965,0.000055803208,0.00008797301,0.000068776084,0.00026073807,0.00001617201,0.00007938786,0.00013645868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015923359,0.000040346207,0.000013699771,0.0000060391626,0.000029201667,9.025794e-7,0.00040864918,0.067782395,0.00688725,0.18986115,0.00016087669,0.73479354],"study_design_scores_gemma":[0.000044084994,0.00007671219,0.00003820216,0.00010694984,0.000005443716,0.000003148792,0.00015576373,0.93336403,0.03515688,0.02942692,0.001458709,0.00016317236],"about_ca_topic_score_codex":0.00000725302,"about_ca_topic_score_gemma":0.000009747672,"teacher_disagreement_score":0.9703439,"about_ca_system_score_codex":0.00006768814,"about_ca_system_score_gemma":0.00002729704,"threshold_uncertainty_score":0.40010935},"labels":[],"label_agreement":null},{"id":"W2579916312","doi":"10.1287/ijoc.2017.0746","title":"Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Lagrangian relaxation; Column generation; Sizing; Heuristic; Computer science; Selection (genetic algorithm); Mathematics; Machine learning","score_opus":0.022874710092888276,"score_gpt":0.306114812320784,"score_spread":0.28324010222789575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579916312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014600843,0.00024342108,0.98111564,0.00041171125,0.00071582117,0.0005132708,0.0000010764401,0.00017375073,0.002224487],"genre_scores_gemma":[0.824193,0.000044878823,0.1749645,0.00013897273,0.00052581186,0.000010494141,0.0000013648837,0.000038591403,0.00008235177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918777,0.000011301664,0.00030905099,0.000089587076,0.0001430951,0.000259225],"domain_scores_gemma":[0.9991026,0.00024892244,0.0003240575,0.00012167088,0.0001327975,0.00006993434],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008620859,0.00013906411,0.00014781917,0.000071188566,0.0015914094,0.0009012691,0.00020113718,0.00006243234,0.0000066711614],"category_scores_gemma":[0.00014612993,0.0000920075,0.00005854672,0.000055339475,0.000025875626,0.00026856913,0.000040864776,0.00037357473,0.0000024651172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018782815,0.000006039082,0.0009783232,0.00007035894,0.00008516631,0.0000019566294,0.00085525546,0.7555943,0.000090970825,0.0006920485,0.00023973238,0.24136707],"study_design_scores_gemma":[0.0005755965,0.000094509065,0.0007611046,0.00021949639,0.000018195966,0.00024771743,0.000057679747,0.9923177,0.00025810744,0.00025288056,0.005063645,0.000133361],"about_ca_topic_score_codex":0.0000042062716,"about_ca_topic_score_gemma":0.00000176249,"teacher_disagreement_score":0.8095922,"about_ca_system_score_codex":0.000048533042,"about_ca_system_score_gemma":0.00002454939,"threshold_uncertainty_score":0.99970835},"labels":[],"label_agreement":null},{"id":"W2583058118","doi":"","title":"On the Impact of Symmetry-Breaking Constraints on Spatial Branch-and-Bound for Circle Packing in a Square","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Homogeneous space; Square (algebra); Symmetry (geometry); Point (geometry); Branch and bound; Node (physics); Task (project management); Relaxation (psychology); Mathematics; Regular polygon; Packing problems; Symmetry breaking; Square root; Linear programming relaxation; Upper and lower bounds; Branch and cut; Mathematical optimization; Computer science; Linear programming; Geometry; Mathematical analysis; Physics; Engineering","score_opus":0.018688709998038396,"score_gpt":0.22758614048801823,"score_spread":0.20889743048997983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583058118","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.9679251,0.000041076077,0.024932133,0.000039581566,0.00013913578,0.0003047632,0.000030918192,0.00006520002,0.006522112],"genre_scores_gemma":[0.9993012,0.000013795182,0.00054656644,0.00005112973,0.000031086725,0.000015421572,0.0000060839516,0.000027320284,0.000007377813],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99941653,0.00002905807,0.00017207823,0.000120271376,0.00007733477,0.00018475496],"domain_scores_gemma":[0.9995359,0.00022690883,0.00004741335,0.00013094525,0.000022193075,0.000036639958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017137198,0.00012207137,0.00015456376,0.000118398326,0.00007457043,0.000026606647,0.00007716066,0.000096484175,0.000095469746],"category_scores_gemma":[0.00007869541,0.00009931139,0.00007535257,0.00012201041,0.0001163481,0.00004318375,0.0000062819004,0.00017574549,0.0000028018585],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005689879,0.00038330365,0.045196295,0.000825065,0.0006226206,0.00002571021,0.06322972,0.13290168,0.0044995197,0.3049334,0.00086351647,0.4459502],"study_design_scores_gemma":[0.013531894,0.0036567058,0.5206082,0.0030357467,0.00016739233,0.00009849536,0.0030638436,0.31480208,0.031471826,0.10611544,0.00041072638,0.0030376655],"about_ca_topic_score_codex":0.00018077559,"about_ca_topic_score_gemma":0.00004123456,"teacher_disagreement_score":0.4754119,"about_ca_system_score_codex":0.000069598755,"about_ca_system_score_gemma":0.000012735498,"threshold_uncertainty_score":0.4049801},"labels":[],"label_agreement":null},{"id":"W2592306931","doi":"10.1007/978-3-319-50920-4_6","title":"Permutation Problems, Genetic Algorithms, and Dynamic Representations","year":2017,"lang":"en","type":"book-chapter","venue":"Modeling and optimization in science and technologies","topic":"Optimization and Packing Problems","field":"Engineering","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 Guelph; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Permutation (music); Travelling salesman problem; Metaheuristic; Popularity; Genetic algorithm; Computer science; Algorithm; Mathematical optimization; Mathematics","score_opus":0.024169035997621935,"score_gpt":0.25688868198896997,"score_spread":0.23271964599134803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592306931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012613398,0.012570688,0.9486437,0.0007058412,0.00026672878,0.00080143666,0.000030786563,0.0014434456,0.03427605],"genre_scores_gemma":[0.58289397,0.15527366,0.25025284,0.000038052553,0.000027211696,0.00010742388,0.00008627779,0.00012457017,0.011196026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990207,0.0000030555398,0.00024336613,0.000383753,0.00018232033,0.00016680449],"domain_scores_gemma":[0.99949723,0.000017150694,0.0000721998,0.00024111869,0.00013971653,0.000032607863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020399514,0.0001845664,0.00017948778,0.0005410207,0.00035501271,0.0003145537,0.00015388365,0.00022767478,0.0000035660441],"category_scores_gemma":[0.00008579065,0.00018594737,0.000010423031,0.00007871777,0.0005238663,0.0003271009,0.0001039069,0.00020198768,7.2826776e-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":[5.132116e-7,0.0000014714267,0.000032736603,0.000053666994,0.0000036791077,0.0000011031535,0.00021980892,0.96908516,0.0000095258,0.001376113,0.00000616541,0.029210033],"study_design_scores_gemma":[0.00013448534,0.000013959382,0.000014384195,0.0001696273,0.00001214775,0.000012743494,0.000119858756,0.98949933,0.000005578492,0.009640675,0.00016664054,0.0002105561],"about_ca_topic_score_codex":0.000011826322,"about_ca_topic_score_gemma":0.000021190355,"teacher_disagreement_score":0.69839084,"about_ca_system_score_codex":0.00004138707,"about_ca_system_score_gemma":0.000039340473,"threshold_uncertainty_score":0.75827134},"labels":[],"label_agreement":null},{"id":"W2595226875","doi":"10.1007/s10107-017-1123-x","title":"Integral simplex using decomposition with primal cutting planes","year":2017,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Simplex; Decomposition; Numerical analysis; Mathematical optimization; Combinatorics; Mathematical analysis","score_opus":0.020101511409667684,"score_gpt":0.24078163670356342,"score_spread":0.22068012529389575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595226875","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.79847467,0.00007413866,0.039904386,0.00030455948,0.0004992446,0.00035299847,0.00012164997,0.00045991634,0.15980844],"genre_scores_gemma":[0.9856921,0.00005746695,0.0116855195,0.00005394816,0.00010430094,0.000004120875,0.00012821838,0.000051469764,0.0022228605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864715,0.000044742166,0.00021184616,0.00035899543,0.00024180968,0.00049548043],"domain_scores_gemma":[0.99918866,0.000059569837,0.00013468333,0.0004105046,0.00008096599,0.00012558933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001066376,0.00032197166,0.00030682344,0.00019435545,0.0010666094,0.00019021204,0.00046484233,0.00008665959,0.00009285972],"category_scores_gemma":[0.0000087833205,0.00030583647,0.00007780703,0.00009344994,0.00023380626,0.0004615531,0.00023989333,0.00024168994,0.000049566577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004945999,0.00024985668,0.129889,0.0004985722,0.0010381471,0.0008489037,0.0029132408,0.7892873,0.006002866,0.06255828,0.0020785371,0.0041406862],"study_design_scores_gemma":[0.0077429465,0.0006800089,0.2223437,0.0012966377,0.00092293374,0.0012594842,0.0020530852,0.6637403,0.0061995233,0.0010001552,0.0885634,0.0041978518],"about_ca_topic_score_codex":0.000043304717,"about_ca_topic_score_gemma":0.000078428144,"teacher_disagreement_score":0.18721743,"about_ca_system_score_codex":0.00014139853,"about_ca_system_score_gemma":0.00004601967,"threshold_uncertainty_score":0.9999394},"labels":[],"label_agreement":null},{"id":"W2597366498","doi":"","title":"The Small Hexagon and Heptagon with Maximum Sum of Distances Between Vertices","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Euclidean distance; Polygon (computer graphics); Euclidean geometry; Geometry; Computer science","score_opus":0.011964853333809911,"score_gpt":0.19509871245716853,"score_spread":0.1831338591233586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597366498","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.7050534,0.004656231,0.28660977,0.00083065225,0.00008513434,0.00045030794,0.000032898457,0.0006550039,0.0016266175],"genre_scores_gemma":[0.9816505,0.0018603983,0.016012305,0.0000669508,0.000042948133,0.00006425257,0.000010921312,0.000046115783,0.00024564835],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990177,0.00003737588,0.00027658575,0.00016476747,0.0001663073,0.00033725708],"domain_scores_gemma":[0.99928075,0.00013237578,0.0000833341,0.00032863184,0.000054411532,0.00012048841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020557753,0.00019319935,0.00022455452,0.00009841302,0.00023289656,0.00006500126,0.00021737827,0.00010444998,0.0000049935193],"category_scores_gemma":[0.000025879435,0.00014144937,0.00004226658,0.00026813094,0.00017065686,0.00014514015,0.000040361105,0.00019002528,0.0000015391366],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019963308,0.00010611668,0.8277296,0.00037125472,0.00032422572,0.00003716819,0.002326181,0.10847644,0.0031416134,0.008377208,0.001655678,0.047254886],"study_design_scores_gemma":[0.0025730229,0.00086451636,0.54892737,0.0004635346,0.00021909927,0.00023916371,0.0007022863,0.3172797,0.07757646,0.0029271808,0.046308916,0.0019187937],"about_ca_topic_score_codex":0.00077392964,"about_ca_topic_score_gemma":0.001935626,"teacher_disagreement_score":0.27880228,"about_ca_system_score_codex":0.00005519303,"about_ca_system_score_gemma":0.00003855419,"threshold_uncertainty_score":0.57681376},"labels":[],"label_agreement":null},{"id":"W2608166121","doi":"","title":"An Efficient Solution Approach for Combinatorial Bandwidth Packing Problem with Queuing Delays","year":2014,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bandwidth (computing); Integer programming; Computer science; Mathematical optimization; Linear programming; Queueing theory; Bandwidth allocation; Cutting-plane method; Telecommunications network; Revenue; Piecewise linear function; Computer network; Mathematics","score_opus":0.021059696683055323,"score_gpt":0.26922525115405044,"score_spread":0.24816555447099511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608166121","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.27509904,0.00043890416,0.4704249,0.00018590689,0.004819222,0.013673165,0.00026909093,0.0019984902,0.23309131],"genre_scores_gemma":[0.9559202,0.00041816424,0.04199903,0.000011317097,0.00035726407,0.00066499267,0.00040055867,0.00016798795,0.00006044142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748254,0.00016840587,0.0005340623,0.0007510019,0.0002447084,0.00081929704],"domain_scores_gemma":[0.99860805,0.00019549835,0.00012318738,0.00070685253,0.00017103786,0.00019537313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001787883,0.0003618514,0.000495005,0.00035043454,0.00021044137,0.00030972384,0.00046843514,0.0004867656,0.000009167189],"category_scores_gemma":[0.000060702867,0.00037745945,0.00010108238,0.0001327425,0.000119239536,0.00009031484,0.0001769587,0.0011766218,0.0000016293307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076954835,0.000100599515,0.00035176543,0.0006552895,0.0000595909,9.2674935e-7,0.00045970493,0.98204565,0.00006359907,0.0010940825,0.000025460846,0.015066399],"study_design_scores_gemma":[0.0011045178,0.00015008642,0.00006477151,0.00024043303,0.000011846714,0.0000039318593,0.000110272726,0.99565345,0.00011411865,0.0004611518,0.0016268041,0.00045858734],"about_ca_topic_score_codex":0.000025291678,"about_ca_topic_score_gemma":0.00004136098,"teacher_disagreement_score":0.68082124,"about_ca_system_score_codex":0.0008035376,"about_ca_system_score_gemma":0.00020704762,"threshold_uncertainty_score":0.99986774},"labels":[],"label_agreement":null},{"id":"W2614904859","doi":"10.3166/jesa.49.659-676","title":"Le problème de livraisons jointes multiproduits multisites","year":2016,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Psychology","score_opus":0.01829092880083242,"score_gpt":0.23761610649254372,"score_spread":0.2193251776917113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614904859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04176993,0.044818595,0.87527686,0.015392671,0.0050927536,0.0009004976,0.00018708139,0.0018671528,0.014694423],"genre_scores_gemma":[0.6612193,0.008052274,0.28584436,0.0001811748,0.0013093235,0.000029028495,0.0000056725157,0.00038081224,0.042978033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639904,0.0005477092,0.0010826482,0.0003926628,0.0004315105,0.001146413],"domain_scores_gemma":[0.99771637,0.00043836577,0.00043945995,0.00041707454,0.00039786004,0.00059086323],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009854748,0.00054460333,0.00059083506,0.00036529553,0.0005789637,0.0006363787,0.0004934153,0.000289615,0.0008895923],"category_scores_gemma":[0.0010195472,0.00044513174,0.0003194945,0.00047600653,0.00030324052,0.0010958824,0.00012165503,0.00057817495,0.0012781315],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023814508,0.00036300096,0.010932618,0.001221556,0.0005864856,0.00040185865,0.0043417895,0.064836495,0.027589692,0.02628837,0.034819018,0.8285953],"study_design_scores_gemma":[0.006864882,0.0008349063,0.29907373,0.01921393,0.00041808284,0.013688567,0.00045045142,0.40379307,0.013221303,0.016010985,0.22338423,0.0030458553],"about_ca_topic_score_codex":0.00015074361,"about_ca_topic_score_gemma":0.000093944946,"teacher_disagreement_score":0.8255494,"about_ca_system_score_codex":0.00058493926,"about_ca_system_score_gemma":0.00042258817,"threshold_uncertainty_score":0.9998},"labels":[],"label_agreement":null},{"id":"W2625411102","doi":"","title":"Dual-optimal Inequalities for Stabilized Column Generation","year":2003,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Dual (grammatical number); Mathematical optimization; Column generation; Mathematics; Linear programming; Column (typography); Convergence (economics); Binary number; Degeneracy (biology)","score_opus":0.02676783419656683,"score_gpt":0.2297629505321584,"score_spread":0.20299511633559156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625411102","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.2145748,0.006748877,0.7599296,0.0024995236,0.0064872974,0.001122879,0.00026920348,0.0004032991,0.007964549],"genre_scores_gemma":[0.3164055,0.0018265641,0.60515076,0.0006979612,0.0016783999,0.00035495448,0.0005577128,0.0002528139,0.073075324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850094,0.00015397799,0.00044726778,0.00028036392,0.00016436844,0.00045307356],"domain_scores_gemma":[0.99920535,0.00019276912,0.00008593026,0.00022739633,0.0001586337,0.00012994042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047520048,0.00027398998,0.00029486985,0.000105926134,0.0003362317,0.00020284526,0.00007004305,0.0003745957,0.0009130521],"category_scores_gemma":[0.0002549055,0.00034317235,0.00014296552,0.00021417321,0.00015987897,0.00025402932,0.00000757177,0.00024728093,0.000048576814],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021875694,0.00007503551,0.00020376385,0.00048473376,0.00013049119,0.0000049190694,0.00895215,0.3523126,0.0032406538,0.61017346,0.02157943,0.0028209032],"study_design_scores_gemma":[0.0026819922,0.00019002375,0.00003737159,0.000064541346,0.00012201728,0.000033638415,0.0012597725,0.20031995,0.010305316,0.004175973,0.7799838,0.0008255836],"about_ca_topic_score_codex":0.00007388198,"about_ca_topic_score_gemma":0.00007873716,"teacher_disagreement_score":0.7584044,"about_ca_system_score_codex":0.00030262064,"about_ca_system_score_gemma":0.00008404185,"threshold_uncertainty_score":0.999902},"labels":[],"label_agreement":null},{"id":"W2724743195","doi":"10.20382/jocg.v9i1a10","title":"Placing your Coins on a Shelf","year":2017,"lang":"en","type":"preprint","venue":"Research Publications (Maastricht University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"RADIUS; Point (geometry); Combinatorics; Binary logarithm; Mathematics; Computer science; Geometry","score_opus":0.14914448130632757,"score_gpt":0.3374513350256297,"score_spread":0.18830685371930211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724743195","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.0031101767,0.00017942522,0.035342306,0.0030673973,0.00057875353,0.0011260104,0.00035157945,0.0016973928,0.954547],"genre_scores_gemma":[0.8170404,0.0025796364,0.0043973927,0.000032472413,0.00047140507,0.00004806752,0.0010424142,0.00018126496,0.17420693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978992,0.00016646659,0.0001951284,0.0005126181,0.0006301375,0.0005964956],"domain_scores_gemma":[0.99713874,0.0002124658,0.00009509577,0.0015069301,0.0007258408,0.00032094028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006343224,0.00025163082,0.00024685837,0.003304648,0.00084784796,0.0007063492,0.0015743814,0.0003899967,0.00022384184],"category_scores_gemma":[0.00040447796,0.00030920107,0.00012119665,0.001341051,0.00016108977,0.000342155,0.0007717544,0.001915912,0.00038096792],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028435665,0.00025540253,0.0010765939,0.00040323383,0.00039575523,0.000045797,0.0006940359,0.7060344,0.00008513417,0.09520779,0.18746547,0.0083079105],"study_design_scores_gemma":[0.0005186357,0.00005004133,0.0010727867,0.00024751568,0.00003265168,0.0000037651498,0.00021128217,0.08922492,0.00008717946,0.0005294201,0.90753657,0.00048521583],"about_ca_topic_score_codex":0.0000656133,"about_ca_topic_score_gemma":0.000031850614,"teacher_disagreement_score":0.8139302,"about_ca_system_score_codex":0.0007015069,"about_ca_system_score_gemma":0.00052411103,"threshold_uncertainty_score":0.999936},"labels":[],"label_agreement":null},{"id":"W2749062520","doi":"10.1002/net.20192","title":"A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":203,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Consiglio Nazionale delle Ricerche; Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vehicle routing problem; Tabu search; Heuristics; Mathematical optimization; Computer science; Minification; Heuristic; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.014262556199855739,"score_gpt":0.2389436817591051,"score_spread":0.22468112555924935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749062520","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.010314933,0.00027879642,0.98336756,0.00008496494,0.00026022427,0.0005007061,0.000003384642,0.00024960557,0.004939819],"genre_scores_gemma":[0.98907274,0.0000066757593,0.010393956,0.000115830255,0.0002309796,0.000015582445,0.000011542526,0.0000376352,0.00011503874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991623,0.000012278692,0.00016855235,0.00012954122,0.00013273694,0.00039458586],"domain_scores_gemma":[0.9992848,0.00043867392,0.000025397758,0.000117126496,0.000066201195,0.000067793284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135296,0.00011241049,0.00009838953,0.000031386717,0.0001972439,0.00005955363,0.000092649665,0.000055691133,0.000052623254],"category_scores_gemma":[0.000010823539,0.000081226935,0.000029677722,0.00019680835,0.00007091053,0.000046304067,0.000016940738,0.0002332224,0.0000068682334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001921824,0.0000059827585,0.00093090965,0.000016699281,0.000032005166,0.000002886848,0.00018896771,0.9858066,0.00005213347,0.0010591015,0.00047074942,0.011414787],"study_design_scores_gemma":[0.00057650055,0.000026602676,0.0003542832,0.00008408965,0.000015166603,0.000015582058,0.00004877845,0.99808276,0.00008885846,0.00003656487,0.0005489868,0.00012182388],"about_ca_topic_score_codex":0.0000076268675,"about_ca_topic_score_gemma":0.00002494307,"teacher_disagreement_score":0.9787578,"about_ca_system_score_codex":0.00003452299,"about_ca_system_score_gemma":0.000017989154,"threshold_uncertainty_score":0.33123383},"labels":[],"label_agreement":null},{"id":"W2754603391","doi":"10.1186/s40929-017-0012-0","title":"Modelling and optimizing a system for testing electronic circuit boards","year":2017,"lang":"en","type":"article","venue":"Mathematics-in-Industry Case Studies","topic":"Optimization and Packing Problems","field":"Engineering","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":"Group for Research in Decision Analysis; Université du Québec à Montréal; University of Toronto; HEC Montréal; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Test (biology); Electronic systems; Printed circuit board; Mathematical optimization; Industrial engineering; Operations research; Engineering; Mathematics; Electronic engineering","score_opus":0.09908133979152094,"score_gpt":0.2945399299416964,"score_spread":0.19545859015017547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754603391","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.84577465,0.0028298453,0.13541774,0.00011565056,0.00048738593,0.0014322473,0.000021493894,0.0005756322,0.013345341],"genre_scores_gemma":[0.9762554,0.00006646606,0.023360856,0.0000037755867,0.000057966874,0.000117090814,6.4872114e-7,0.000045723336,0.00009203424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892783,0.0000106236575,0.00036509897,0.00019851651,0.00008383324,0.00041409725],"domain_scores_gemma":[0.99928164,0.00022991379,0.000102392674,0.00027767342,0.000064789165,0.000043587737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047512082,0.00020438535,0.00038909228,0.000116450814,0.00031784442,0.0001370459,0.00010418741,0.00015800337,0.0000012212612],"category_scores_gemma":[0.00019423918,0.00020550989,0.000032532873,0.00008645471,0.00004352828,0.000150702,0.000056410037,0.00034998707,0.0000014248644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018345123,0.000017619956,0.00038171452,0.0022520595,0.0000736983,0.00024645572,0.0037473605,0.99044687,0.000044412933,0.002119999,0.000022784345,0.00064521184],"study_design_scores_gemma":[0.0005842635,0.000020257572,0.0000038071646,0.0010230782,0.000033263495,0.0005426484,0.0050691166,0.9913078,0.0001825865,0.0009722099,0.00002434799,0.00023664434],"about_ca_topic_score_codex":0.00002180681,"about_ca_topic_score_gemma":0.0000397587,"teacher_disagreement_score":0.13048078,"about_ca_system_score_codex":0.00020227864,"about_ca_system_score_gemma":0.000022943566,"threshold_uncertainty_score":0.838045},"labels":[],"label_agreement":null},{"id":"W2754611409","doi":"10.1155/2017/1670709","title":"A Parallel Biased Random‐Key Genetic Algorithm with Multiple Populations Applied to Irregular Strip Packing Problems","year":2017,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Key (lock); Algorithm; Genetic algorithm; Computer science; Mathematics; Machine learning","score_opus":0.024421722242736862,"score_gpt":0.22584187228715238,"score_spread":0.20142015004441552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754611409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041400995,0.00008424846,0.9914114,0.00007975356,0.00016232282,0.0015473758,0.000011223676,0.0006162728,0.001947322],"genre_scores_gemma":[0.6700163,0.000010948072,0.3292691,0.000014261822,0.000054349428,0.00044707127,0.000014896002,0.00012218588,0.000050871764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979209,0.0000158964,0.0006556499,0.00039206902,0.00035063314,0.00066488073],"domain_scores_gemma":[0.99871624,0.00011367496,0.00009533354,0.0007769247,0.0000496239,0.00024823696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035385185,0.00043168533,0.0005485335,0.00029414563,0.00019565667,0.00033269162,0.00044929187,0.0001641288,0.00004445929],"category_scores_gemma":[0.00016620726,0.0003996271,0.000073168245,0.0002953388,0.00004456774,0.0002103456,0.00009034635,0.00035305455,0.000058914688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066058738,0.000060410206,0.00043267309,0.0006089813,0.000039102637,0.0000070866954,0.0007229765,0.9941593,0.0006511595,0.0010012296,0.000036202466,0.0022742634],"study_design_scores_gemma":[0.00245973,0.000036507496,0.0012576462,0.00079886673,0.000025816475,0.000015153797,0.000018614046,0.99206424,0.00015841535,0.0022524295,0.00033304136,0.00057956256],"about_ca_topic_score_codex":0.000017836694,"about_ca_topic_score_gemma":0.000037773643,"teacher_disagreement_score":0.6658762,"about_ca_system_score_codex":0.000107047825,"about_ca_system_score_gemma":0.000016722113,"threshold_uncertainty_score":0.99984556},"labels":[],"label_agreement":null},{"id":"W2792362373","doi":"10.1287/trsc.2019.0941","title":"A Primal Adjacency-Based Algorithm for the Shortest Path Problem with Resource Constraints","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Shortest path problem; K shortest path routing; Mathematical optimization; Column generation; Yen's algorithm; Constrained Shortest Path First; Path (computing); Adjacency list; Computer science; Shortest Path Faster Algorithm; Longest path problem; Algorithm; Mathematics; Dijkstra's algorithm; Theoretical computer science; Graph","score_opus":0.017771996696405667,"score_gpt":0.21916256803372688,"score_spread":0.20139057133732122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792362373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011219337,0.000035921465,0.9963282,0.00072827726,0.000034440276,0.00051897473,0.000078203535,0.0002350586,0.00091901765],"genre_scores_gemma":[0.83336365,0.0000054458324,0.16602685,0.00045553833,0.0000214856,0.00006112445,0.000036179805,0.000016937714,0.000012813725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991696,0.0000046436876,0.00016086201,0.00019469805,0.00027712638,0.00019310658],"domain_scores_gemma":[0.99961,0.000059058424,0.000032847198,0.00009872534,0.00009926345,0.00010009496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002050106,0.000096584714,0.000079686484,0.0000331424,0.00016353627,0.00006423297,0.00020320358,0.000022450507,0.000052248604],"category_scores_gemma":[0.0000070570877,0.00006804636,0.000025015299,0.0006011441,0.00030895267,0.000152335,9.562903e-7,0.00007768799,0.0000039936967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014850654,0.000013658221,0.000751611,0.000045632787,0.0000087028275,0.000002281852,0.0027774998,0.9316031,0.00097377755,0.0009505199,0.00020184215,0.06265657],"study_design_scores_gemma":[0.0005379705,0.00009179331,0.0023844738,0.000030534287,0.000019860425,8.742121e-7,0.00021015678,0.9890202,0.0020269137,0.000014883549,0.0055105095,0.00015180629],"about_ca_topic_score_codex":0.000002053271,"about_ca_topic_score_gemma":0.000007779096,"teacher_disagreement_score":0.8322417,"about_ca_system_score_codex":0.000013555915,"about_ca_system_score_gemma":0.00013717753,"threshold_uncertainty_score":0.277485},"labels":[],"label_agreement":null},{"id":"W2805939218","doi":"10.1007/978-3-319-93031-2_36","title":"A Local Search Framework for Compiling Relaxed Decision Diagrams","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; The Scarborough Hospital; University of Toronto","funders":"","keywords":"Knapsack problem; Computer science; Heuristic; Set (abstract data type); Scheme (mathematics); Local search (optimization); Theoretical computer science; Continuous knapsack problem; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.024566358540858018,"score_gpt":0.2707292797578114,"score_spread":0.2461629212169534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805939218","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.00007006052,0.00029505786,0.9961997,0.000058089157,0.0019932047,0.0003832661,0.000007955037,0.00021320439,0.0007794146],"genre_scores_gemma":[0.11294918,0.000068992325,0.88602024,0.00026930004,0.00050703407,0.000008295049,0.000014391794,0.00007284785,0.00008973825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982288,0.000008117045,0.00032096502,0.00056320964,0.0004419945,0.0004369552],"domain_scores_gemma":[0.9982261,0.0009502957,0.000046789057,0.00048629634,0.00017576649,0.0001147717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005196982,0.00030306858,0.00031451066,0.00035757656,0.00015857158,0.00021797958,0.00066521706,0.00041620678,0.00008604728],"category_scores_gemma":[0.00009404658,0.00028494865,0.00008816343,0.00029409386,0.00044178276,0.00010507488,0.00016996775,0.00064265257,0.000053942018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057441866,0.000003650552,0.000008717231,0.000044149587,0.000005079661,0.0000026438968,0.00036975968,0.7359271,0.0000059106183,0.0019218243,0.00003415029,0.26167127],"study_design_scores_gemma":[0.00014370179,0.000079380676,0.000007348651,0.00079423754,0.000004418808,0.000006665825,1.8732342e-7,0.86301774,0.00034142687,0.13336855,0.0019335388,0.0003028058],"about_ca_topic_score_codex":0.0000019680724,"about_ca_topic_score_gemma":0.000026471704,"teacher_disagreement_score":0.26136848,"about_ca_system_score_codex":0.0001801188,"about_ca_system_score_gemma":0.00008794433,"threshold_uncertainty_score":0.99996024},"labels":[],"label_agreement":null},{"id":"W2807196622","doi":"10.1016/j.apm.2018.04.018","title":"An algorithm to construct conformable tubular networks that occupy arbitrary regions in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si12.gif\" overflow=\"scroll\"><mml:msup><mml:mi mathvariant=\"double-struck\">R</mml:mi><mml:mn>3</mml:mn></mml:msup></mml:math>","year":2018,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Optimization and Packing Problems","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":"Acadia University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Algorithm; Construct (python library); Conformable matrix; Scroll; Computer science; Mathematics; Physics; Engineering; Programming language","score_opus":0.022575502279701273,"score_gpt":0.23234201509787658,"score_spread":0.20976651281817532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807196622","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.22896737,0.00014220049,0.7056965,0.00010934226,0.00062360556,0.00018232311,0.000073602685,0.00056319626,0.06364182],"genre_scores_gemma":[0.86353755,0.00019711786,0.13421635,0.00055225147,0.000484043,0.0003801631,0.00027366573,0.00030898114,0.00004987324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960977,0.000054175984,0.0010617397,0.0007690221,0.0007778396,0.0012395437],"domain_scores_gemma":[0.99741095,0.0004100483,0.0003269852,0.001168697,0.00006959344,0.0006137367],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008024096,0.0005633854,0.00040246392,0.00024288821,0.00054658734,0.0005960105,0.000754409,0.0009068293,0.0014413251],"category_scores_gemma":[0.000058182442,0.0007783222,0.0003255735,0.00053527066,0.0003910532,0.0006543521,0.00032407884,0.000887113,0.0008373445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012956095,0.0000731466,7.7432185e-7,0.00030549153,0.00016372572,0.000075529904,0.0010819387,0.30051664,0.00013805568,0.69604874,0.00090543425,0.0005609844],"study_design_scores_gemma":[0.0010986492,0.00018081459,6.791677e-7,0.00046286127,0.00018306692,0.00030456446,0.00048303488,0.9684177,0.021336624,0.0059028463,0.00090037135,0.0007287846],"about_ca_topic_score_codex":0.00009372743,"about_ca_topic_score_gemma":0.000025134746,"teacher_disagreement_score":0.6901459,"about_ca_system_score_codex":0.00002405734,"about_ca_system_score_gemma":0.0002225171,"threshold_uncertainty_score":0.99994063},"labels":[],"label_agreement":null},{"id":"W2827016266","doi":"10.1109/cibcb.2018.8404974","title":"Data driven point packing for fast clustering","year":2018,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cluster analysis; Computer science; Metric (unit); Data mining; Hierarchical clustering; Crossover; Euclidean distance; Data field; Theoretical computer science; Metric space; Representation (politics); Data point; Algorithm; Set (abstract data type); Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.05101162017104853,"score_gpt":0.2757525256169135,"score_spread":0.22474090544586495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2827016266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043145474,0.000012785791,0.9622556,0.00010473976,0.00047585406,0.00013275868,0.000036956204,0.00042553685,0.0361243],"genre_scores_gemma":[0.8435887,0.000016920505,0.15444939,0.00020309846,0.00042963194,0.000009929094,0.00015358288,0.0000519952,0.0010967174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956393,0.0000034801174,0.0001108956,0.00012518687,0.000045352284,0.00015114399],"domain_scores_gemma":[0.99957216,0.000021001819,0.0000111763975,0.00032719155,0.00003184532,0.00003663448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008819736,0.00007057356,0.00006827498,0.000034836234,0.000054925134,0.000055569202,0.00019317983,0.000032865435,0.0002587375],"category_scores_gemma":[0.000016145235,0.000067269386,0.000014614399,0.000063072184,0.000015311982,0.00017153623,0.0000842481,0.000034304987,0.000068377994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002334195,0.000036797315,0.00094240153,0.00042204035,0.00018043394,0.0000019658896,0.002445472,0.74659455,0.005547375,0.0039378204,0.16343147,0.076436356],"study_design_scores_gemma":[0.00017013944,0.000016369982,0.000033486136,0.00002049041,0.000004411989,0.0000018891831,0.000039349838,0.9436702,0.0005433204,0.000049053437,0.055351738,0.000099534365],"about_ca_topic_score_codex":0.0000034384227,"about_ca_topic_score_gemma":0.000118791766,"teacher_disagreement_score":0.8431573,"about_ca_system_score_codex":0.000012753976,"about_ca_system_score_gemma":0.000004417111,"threshold_uncertainty_score":0.28329942},"labels":[],"label_agreement":null},{"id":"W2898866180","doi":"10.1287/ijoc.2018.0806","title":"The Meet-in-the-Middle Principle for Cutting and Packing Problems","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Bin packing problem; Dimension (graph theory); Packing problems; Set (abstract data type); Bin; Mathematical optimization; Limit (mathematics); Computation; Mathematics; Integer programming; Integer (computer science); Combinatorial optimization; Branch and cut; Computer science; Linear programming; Branch and bound; Algorithm; Combinatorics","score_opus":0.03233966605804524,"score_gpt":0.26292647075294984,"score_spread":0.2305868046949046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898866180","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.7310985,0.0008578488,0.2167047,0.0013712024,0.00350364,0.0013938824,0.0000033504432,0.000404064,0.044662848],"genre_scores_gemma":[0.9952453,0.000048493945,0.0038860487,0.00026888802,0.0004909181,0.0000037987224,7.9694e-7,0.000021088581,0.00003469146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999013,0.00001748725,0.00039258876,0.00007434163,0.0001654008,0.0003372002],"domain_scores_gemma":[0.9992937,0.00034903723,0.00012224136,0.00011087442,0.000075607975,0.00004855326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014608285,0.00011914045,0.00010627861,0.00007532809,0.0007575316,0.0004768411,0.00020703027,0.000044123062,0.0000025373704],"category_scores_gemma":[0.00011515346,0.00006846209,0.000042100746,0.00016507502,0.000043147316,0.00014708562,0.000030643918,0.00026991227,0.000004896804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026008034,0.000020201582,0.0045291726,0.00016053105,0.00006652983,0.0000048532593,0.015729856,0.78074694,0.00006241006,0.016442273,0.0009833792,0.18122786],"study_design_scores_gemma":[0.0006359853,0.00016232455,0.00056620024,0.00040150867,0.0000059448334,0.00015425961,0.0005312279,0.89002484,0.00013989628,0.0013754952,0.10581854,0.00018377036],"about_ca_topic_score_codex":0.000001076442,"about_ca_topic_score_gemma":0.000009700359,"teacher_disagreement_score":0.2641468,"about_ca_system_score_codex":0.000040084895,"about_ca_system_score_gemma":0.000016054986,"threshold_uncertainty_score":0.58263975},"labels":[],"label_agreement":null},{"id":"W2910526083","doi":"10.1007/s12532-020-00180-9","title":"Split cuts from sparse disjunctions","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Optimization and Packing Problems","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 Waterloo","funders":"","keywords":"Exploit; Theory of computation; Simplex; Integer (computer science); Mathematics; Class (philosophy); Algorithm; Computer science; Mathematical optimization; Cutting-plane method; Integer programming; Combinatorics; Artificial intelligence","score_opus":0.03308505023616477,"score_gpt":0.23674546076711908,"score_spread":0.2036604105309543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910526083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009291808,0.000026159907,0.9849083,0.0005575264,0.00012929352,0.00023108025,0.000004427606,0.001111434,0.0037399952],"genre_scores_gemma":[0.770285,0.0000027893939,0.22924125,0.00015302261,0.00012226104,0.000023529612,0.000094529096,0.000036775447,0.000040825074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993007,0.00001686021,0.00023911695,0.00014442459,0.00014519072,0.00015369452],"domain_scores_gemma":[0.9996561,0.00008243022,0.000027580423,0.000077011486,0.000030170748,0.00012669788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050985225,0.000117154625,0.0001413752,0.000027774671,0.000056499,0.00011548238,0.000068607886,0.000053529762,0.00017706162],"category_scores_gemma":[0.00005231305,0.00011598283,0.000046590743,0.00021974981,0.00002370112,0.000097628945,0.000018417802,0.000117116164,0.0005538582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009334015,0.00012067845,0.00024150197,0.00039074378,0.00009451109,0.000007162207,0.0039964835,0.84176797,0.00018929118,0.012673341,0.0047583655,0.13575064],"study_design_scores_gemma":[0.00018869906,0.00002504104,0.000092696886,0.00003404372,0.000022679047,0.0000013235907,0.000054453372,0.98442465,0.00006480724,0.0086351745,0.00631284,0.00014360473],"about_ca_topic_score_codex":0.0000019953673,"about_ca_topic_score_gemma":8.8925225e-7,"teacher_disagreement_score":0.7609932,"about_ca_system_score_codex":0.000019586627,"about_ca_system_score_gemma":0.000005535278,"threshold_uncertainty_score":0.7118911},"labels":[],"label_agreement":null},{"id":"W2915063610","doi":"10.7287/peerj.preprints.27434v1","title":"A local search algorithm for the constrained max cut problem on hypergraphs.","year":2018,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maximum cut; Combinatorics; Disjoint sets; Mathematics; Cardinality (data modeling); Hypergraph; Partition (number theory); Approximation algorithm; Integer (computer science); Local search (optimization); Set (abstract data type); Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.017979600966041964,"score_gpt":0.24321997744315368,"score_spread":0.22524037647711173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915063610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000734567,0.00002306661,0.9419655,0.00037710165,0.00019472471,0.00037368792,0.000013343025,0.00028972854,0.05668935],"genre_scores_gemma":[0.84197485,0.000060509334,0.15099476,0.0008286491,0.0002808831,0.00012359522,0.000022326105,0.00007249498,0.00564191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946743,0.00000902966,0.000107926135,0.000106962514,0.000100677215,0.0002079518],"domain_scores_gemma":[0.99963856,0.000093874245,0.000006978975,0.00014193787,0.00007214701,0.000046499084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014280005,0.000093450784,0.00007471839,0.00004720267,0.00010635475,0.000042976022,0.00010687252,0.000051642244,0.00035558536],"category_scores_gemma":[0.000004004501,0.000061470986,0.00004314393,0.00014487558,0.00012860977,0.00003196596,0.000010394404,0.00008266239,0.00009632779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017338793,0.00004423451,0.000026183805,0.00006097645,0.00013921155,0.0000011905192,0.00062178186,0.19068465,0.00019482129,0.020074705,0.027516149,0.76061875],"study_design_scores_gemma":[0.0003706642,0.00011760352,0.000011144028,0.0000135901255,0.00000676598,0.0000046513023,0.00008958101,0.9601693,0.0024093396,0.0002222248,0.036482666,0.000102444945],"about_ca_topic_score_codex":0.00001076244,"about_ca_topic_score_gemma":0.00001851769,"teacher_disagreement_score":0.8419014,"about_ca_system_score_codex":0.0000145908925,"about_ca_system_score_gemma":0.000015492782,"threshold_uncertainty_score":0.38934103},"labels":[],"label_agreement":null},{"id":"W2943265657","doi":"10.1109/access.2019.2914248","title":"Efficient Free-Form Contour Packing Based on Code Matching Strategy","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Jiangsu Key Laboratory of Precision and Micro-Manufacturing Technology; National Natural Science Foundation of China; Natural Science Foundation of Hebei Province; Hebei Provincial Postdoctoral Science Foundation","keywords":"Computer science; Matching (statistics); Code (set theory); Algorithm; Artificial intelligence; Mathematics; Programming language; Statistics","score_opus":0.02192024885331195,"score_gpt":0.263776084000329,"score_spread":0.24185583514701703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943265657","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.8262504,0.00004226165,0.094830595,0.00009071591,0.0019773706,0.0004147652,0.00003890515,0.0007287949,0.075626194],"genre_scores_gemma":[0.9991027,0.0000036168412,0.0003287378,0.00024473568,0.000074997086,0.000009191798,0.000010061318,0.000044582743,0.00018135016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.000015333746,0.00018452517,0.00016909192,0.00019942195,0.00025062656],"domain_scores_gemma":[0.9994452,0.00006879904,0.000040662315,0.00034628596,0.000034561443,0.00006447063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001383011,0.00015245882,0.00015149526,0.00010122043,0.00005145165,0.00022330157,0.00034819494,0.000075143405,0.00035009137],"category_scores_gemma":[0.0000072922985,0.00014520805,0.00004598177,0.00016315712,0.000008768246,0.00011266557,0.000019927536,0.00017416135,0.00016764006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007012611,0.000016910157,0.00087434275,0.0000743621,0.0000094214265,0.0000025202714,0.00010455247,0.9965947,0.0006083745,0.00022999136,0.0006977567,0.0007800538],"study_design_scores_gemma":[0.0006734664,0.000026227148,0.0010350669,0.000119864126,0.0000057081634,9.106589e-7,0.000022817738,0.99381036,0.003301534,0.00017171119,0.0006118386,0.00022052437],"about_ca_topic_score_codex":0.00003645156,"about_ca_topic_score_gemma":0.000031003477,"teacher_disagreement_score":0.17285234,"about_ca_system_score_codex":0.000056040786,"about_ca_system_score_gemma":0.000018075702,"threshold_uncertainty_score":0.5921413},"labels":[],"label_agreement":null},{"id":"W2949672518","doi":"10.48550/arxiv.1209.1167","title":"Finite Polytopes have Finite Regular Covers","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Finite set; Mathematical analysis","score_opus":0.0572225850552379,"score_gpt":0.16794384574809862,"score_spread":0.11072126069286073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949672518","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.06547422,0.0009753913,0.8204076,0.00009214829,0.0037060287,0.00080678356,0.0003105015,0.0021725185,0.1060548],"genre_scores_gemma":[0.99130577,0.00083142484,0.00045722412,0.00007615563,0.00014004657,9.686474e-7,0.0001452864,0.00007154372,0.006971564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988287,0.0000567956,0.00019240499,0.00043515823,0.00007412543,0.00041281842],"domain_scores_gemma":[0.99879825,0.00014745891,0.000100604564,0.00067844655,0.00007264252,0.00020258875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013370668,0.00036555203,0.00031938808,0.0002527972,0.00009253126,0.000073295014,0.00043551013,0.00042968758,0.00045827578],"category_scores_gemma":[0.000041055926,0.00046171836,0.00019519079,0.00024871665,0.00007579728,0.00021161494,0.00030645414,0.0005915943,0.00030615457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012291038,0.000020408675,0.0034619523,0.000118681215,0.00012708221,0.000036125795,0.00023879176,0.9914071,0.000013020084,0.003627385,0.0008420979,0.00009508216],"study_design_scores_gemma":[0.00053543365,0.000014671514,0.00052215223,0.00016766333,0.0001673753,0.0000019095824,0.0000910969,0.97056776,0.00022419447,0.0021618577,0.024751654,0.00079425675],"about_ca_topic_score_codex":0.000048547234,"about_ca_topic_score_gemma":0.000024533325,"teacher_disagreement_score":0.92583156,"about_ca_system_score_codex":0.00012662937,"about_ca_system_score_gemma":0.000043988875,"threshold_uncertainty_score":0.99978346},"labels":[],"label_agreement":null},{"id":"W2950074039","doi":"10.48550/arxiv.1302.3889","title":"Power Strip Packing of Malleable Demands in Smart Grid","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rectangle; Moment (physics); Bar (unit); Power (physics); Mathematics; Combinatorics; Upper and lower bounds; Interval (graph theory); Energy (signal processing); Set (abstract data type); Grid; Mathematical optimization; Discrete mathematics; Computer science; Geometry; Mathematical analysis; Physics; Statistics","score_opus":0.04126364179013987,"score_gpt":0.15822887589891652,"score_spread":0.11696523410877666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950074039","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.8895449,0.00020548551,0.04686944,0.000020861002,0.0012585755,0.00044098293,0.00003870703,0.00034470356,0.061276365],"genre_scores_gemma":[0.99780226,0.00042303305,0.00037540545,0.000012827629,0.00002510209,9.144439e-7,0.000034074805,0.000037229296,0.0012891423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990822,0.00003759105,0.00023643591,0.0003301181,0.000053886422,0.00025978443],"domain_scores_gemma":[0.9992922,0.00003928521,0.00009856898,0.00041656313,0.00007468841,0.000078684825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013122245,0.00022944367,0.0003191873,0.00032238854,0.000025534746,0.000029883893,0.00032470634,0.0002996246,0.0005254805],"category_scores_gemma":[0.000013218,0.00028261702,0.000106398,0.00035357717,0.000040245483,0.00014371624,0.0002193275,0.00044124556,0.000060820355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068232634,0.000027005435,0.015684074,0.00018843221,0.0000510675,0.000021257134,0.0001541026,0.9798684,0.00003123064,0.0032465174,0.0006873103,0.000033760833],"study_design_scores_gemma":[0.00088956114,0.00003347255,0.0065966,0.00049739616,0.000045398298,0.000001737179,0.00015966223,0.98473954,0.0002889577,0.0035902662,0.0025135095,0.0006439003],"about_ca_topic_score_codex":0.00012660873,"about_ca_topic_score_gemma":0.000053622225,"teacher_disagreement_score":0.10825739,"about_ca_system_score_codex":0.00011752421,"about_ca_system_score_gemma":0.00003890524,"threshold_uncertainty_score":0.9999626},"labels":[],"label_agreement":null},{"id":"W2951530419","doi":"10.48550/arxiv.1408.4156","title":"Efficient Online Strategies for Renting Servers in the Cloud","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Server; Bin packing problem; Bin; Online algorithm; Cloud computing; Renting; Interval (graph theory); Upper and lower bounds; Computer science; Combinatorics; Mathematics; Computer network; Algorithm; Operating system; Engineering","score_opus":0.066373920146303,"score_gpt":0.19010440840263756,"score_spread":0.12373048825633456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951530419","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.71602374,0.000048719183,0.27863947,0.00006385483,0.00083571766,0.00046975556,0.000043796153,0.0002452019,0.0036297697],"genre_scores_gemma":[0.99902624,0.000048601756,0.0005048527,0.00004252185,0.00010177834,0.0000014701382,0.00009293231,0.00002551803,0.00015608047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992312,0.000056219695,0.0001552739,0.00028895997,0.000043944365,0.00022438771],"domain_scores_gemma":[0.99939495,0.00010271304,0.00006785034,0.00035292862,0.000047836995,0.00003373899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026863505,0.00018768582,0.00018021616,0.00013336865,0.00006422922,0.000080123886,0.00041751176,0.0001680991,0.000014893456],"category_scores_gemma":[0.000014796536,0.00018329377,0.00011256961,0.00023185527,0.00003213909,0.000033566204,0.00010248228,0.00035860293,0.000007888218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070090946,0.000025484323,0.0002052415,0.00022194859,0.000022388664,0.0000052986156,0.00044854078,0.9808757,0.00000430316,0.017934915,0.00020690243,0.000042326144],"study_design_scores_gemma":[0.00034988203,0.000011727078,0.00018182061,0.000109306005,0.000033642536,5.2263044e-7,0.0008374411,0.99332064,0.000004643255,0.0038008569,0.001141046,0.00020844574],"about_ca_topic_score_codex":0.000040749943,"about_ca_topic_score_gemma":0.00015334167,"teacher_disagreement_score":0.28300253,"about_ca_system_score_codex":0.00007557527,"about_ca_system_score_gemma":0.000037656075,"threshold_uncertainty_score":0.7474503},"labels":[],"label_agreement":null},{"id":"W2952394201","doi":"10.1061/9780784482438.026","title":"A 3D Irregular Packing Algorithm Using Point Cloud Data","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Packing problems; Container (type theory); Point cloud; Computer science; Heuristic; Point (geometry); Set packing; Algorithm; Set (abstract data type); Representation (politics); Polyhedron; Rotation (mathematics); Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Geometry","score_opus":0.030193078769717024,"score_gpt":0.24216660060284798,"score_spread":0.21197352183313095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952394201","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.0060962206,0.0002116312,0.9655964,0.000048357608,0.0014985511,0.00020952115,0.000025311198,0.0006739754,0.025640082],"genre_scores_gemma":[0.2610023,0.00008020305,0.73546755,0.00031933282,0.0004144265,0.0000024508158,0.00025729556,0.00013381311,0.002322621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993323,0.000012340084,0.00015452092,0.00018499105,0.00011714644,0.00019868392],"domain_scores_gemma":[0.99928474,0.000017434857,0.000018253204,0.00060684275,0.000022025522,0.00005069378],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016471892,0.00011166692,0.000121292695,0.000056525972,0.000030536557,0.00007027792,0.00022509061,0.00005811292,0.001078828],"category_scores_gemma":[0.000006460482,0.000107871536,0.000020888834,0.00015063462,0.000008808394,0.00026433758,0.00010570131,0.00009528992,0.0002689596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018675102,0.000020762007,0.00061123964,0.000114042334,0.000085158004,0.000008123618,0.00033555197,0.9507407,0.0019113536,0.0008866038,0.0051601515,0.040124476],"study_design_scores_gemma":[0.00019382033,0.000005366976,0.000021361555,0.000034109067,0.000008309016,0.0000145170025,0.000038141417,0.9781457,0.0002918658,0.000052316325,0.02103062,0.00016382533],"about_ca_topic_score_codex":0.000023773306,"about_ca_topic_score_gemma":0.0000032720054,"teacher_disagreement_score":0.2549061,"about_ca_system_score_codex":0.000029189168,"about_ca_system_score_gemma":0.000011576162,"threshold_uncertainty_score":0.9998343},"labels":[],"label_agreement":null},{"id":"W2954538345","doi":"10.1002/nme.6161","title":"Packaging optimization using the dynamic vector fields method","year":2019,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Maximization; Mathematical optimization; Computer science; Regular polygon; Object (grammar); Optimization problem; Scalability; Vector optimization; Field (mathematics); Packing problems; Mathematics; Multi-swarm optimization; Artificial intelligence","score_opus":0.02035573198106365,"score_gpt":0.3740398282384565,"score_spread":0.35368409625739283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954538345","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.0006584403,0.00016849268,0.99254715,0.00025735077,0.0059255976,0.00017961273,0.0000037925367,0.00009862228,0.0001609142],"genre_scores_gemma":[0.07127151,0.000056348337,0.928279,0.00008390004,0.0001793496,0.000012590559,0.00000499743,0.000053707565,0.000058632828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896264,0.00007712032,0.0003845502,0.00013542261,0.00019939842,0.00024088056],"domain_scores_gemma":[0.99911,0.0005392478,0.000068003654,0.00011813391,0.00010709483,0.000057524994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008429959,0.00015626298,0.00018956863,0.0002307302,0.000043610846,0.00014048765,0.0003421542,0.00008688017,0.00011707403],"category_scores_gemma":[0.0002302014,0.00013180723,0.00011735542,0.00025091393,0.000006517181,0.00021254431,0.000034549215,0.00042020265,0.0000026705516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008229409,0.000007102846,0.00015475096,0.000020865838,0.0000640217,0.0000021167605,0.00015444162,0.9878415,0.0019367244,0.00026434852,0.000017702574,0.0095281815],"study_design_scores_gemma":[0.00033606807,0.000014738193,0.00007419943,0.000079833284,0.000010345407,0.000093516544,0.00003688321,0.9959838,0.00057404453,0.00020602591,0.0024276953,0.0001628554],"about_ca_topic_score_codex":0.0000033393687,"about_ca_topic_score_gemma":3.796822e-7,"teacher_disagreement_score":0.070613064,"about_ca_system_score_codex":0.00023076215,"about_ca_system_score_gemma":0.000016923956,"threshold_uncertainty_score":0.5374943},"labels":[],"label_agreement":null},{"id":"W2955422897","doi":"10.1287/ijoo.2019.0013","title":"Three-Dimensional Bin Packing and Mixed-Case Palletization","year":2019,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Column generation; Benchmark (surveying); Computer science; Set (abstract data type); Range (aeronautics); Mathematical optimization; Column (typography); Bin; Key (lock); Algorithm; Mathematics; Engineering","score_opus":0.00938567653688308,"score_gpt":0.20446523834767633,"score_spread":0.19507956181079325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955422897","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.24973264,0.00022847787,0.74028003,0.00025408337,0.0020423662,0.00044565456,0.000008816185,0.00037768902,0.0066302284],"genre_scores_gemma":[0.96428835,0.0003319347,0.034582846,0.00035139278,0.00014815546,0.0000050192466,0.0000615635,0.000066097586,0.0001646206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990906,0.000011826529,0.0003611352,0.00010962084,0.00023192426,0.00019485278],"domain_scores_gemma":[0.9994703,0.000048154303,0.00011676241,0.00011985185,0.00012967894,0.00011528765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023975382,0.00016795378,0.00014599782,0.00025497362,0.00014922784,0.00022527682,0.000060008835,0.000117158845,0.00047315753],"category_scores_gemma":[0.00003184174,0.00014414024,0.000040939853,0.0002265113,0.000016477514,0.00060960517,0.000018191622,0.00025909496,0.00008041969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014573731,0.000009487069,0.0010072466,0.000023190672,0.000021853788,0.000024799543,0.00009477265,0.99091405,0.000024582978,0.0003783292,0.0004688151,0.0070182923],"study_design_scores_gemma":[0.00074668316,0.00008726414,0.0001777266,0.00010078202,0.000009497384,0.0011869707,0.000028279706,0.9957025,0.0001269251,0.0001292677,0.001495504,0.00020860297],"about_ca_topic_score_codex":0.0000019619254,"about_ca_topic_score_gemma":0.000004853689,"teacher_disagreement_score":0.71455574,"about_ca_system_score_codex":0.000062667474,"about_ca_system_score_gemma":0.000020849224,"threshold_uncertainty_score":0.58778685},"labels":[],"label_agreement":null},{"id":"W2962031742","doi":"10.1016/j.cor.2019.07.007","title":"Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Solver; Mathematical optimization; Algorithm; Mathematics; Decomposition; Branch and cut; Integer programming; Fixed charge; Linear programming; Integer (computer science); Flow network; Steiner tree problem; Computer science","score_opus":0.08187649673331249,"score_gpt":0.34436906544038215,"score_spread":0.26249256870706966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962031742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027199115,0.00003361796,0.99387413,0.0003120395,0.00069350697,0.0014746166,0.0000288933,0.00026191105,0.0006013982],"genre_scores_gemma":[0.6912547,0.000019865207,0.30747214,0.00017922261,0.00016915602,0.00018752945,0.0004669773,0.00005848347,0.0001919265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838525,0.0002777329,0.0002307321,0.00027940335,0.00031380478,0.0005130513],"domain_scores_gemma":[0.9985106,0.00071549276,0.0000108412505,0.00034587824,0.00029671777,0.000120493714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010528378,0.00016082228,0.00016787148,0.00026215235,0.00045446426,0.00027380406,0.00022427349,0.000105185194,0.00017104179],"category_scores_gemma":[0.00003676528,0.00016623766,0.00006383532,0.00047986078,0.000040404768,0.00018465034,0.00002772311,0.00033132237,0.0002356991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026505084,0.000058219644,0.000034083216,0.000037446363,0.000024816614,7.626964e-7,0.00014466982,0.98218894,0.0005217794,0.00051236956,0.014135587,0.002314811],"study_design_scores_gemma":[0.0008791774,0.00021746465,0.00007918864,0.00007892651,0.000004052873,8.235436e-7,0.00001591561,0.9958215,0.0010990839,0.000047194477,0.0015713614,0.00018530623],"about_ca_topic_score_codex":0.000013426925,"about_ca_topic_score_gemma":0.0000083582,"teacher_disagreement_score":0.6885348,"about_ca_system_score_codex":0.00016878883,"about_ca_system_score_gemma":0.000065736436,"threshold_uncertainty_score":0.6778975},"labels":[],"label_agreement":null},{"id":"W2964999431","doi":"10.48550/arxiv.1907.11338","title":"A note on the complexity of integer programming games","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Integer programming; Computer science; Integer (computer science); Mathematical economics; Mathematics; Programming language; Algorithm","score_opus":0.10607470663269325,"score_gpt":0.1931006523579464,"score_spread":0.08702594572525316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964999431","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.27927637,0.000114678485,0.6519239,0.0003401893,0.0019291333,0.0016206953,0.00009404178,0.00095148175,0.0637495],"genre_scores_gemma":[0.9985826,0.00007681653,0.0005074043,0.00003454958,0.00002452169,7.724311e-7,0.000019798652,0.000027332266,0.0007262034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999327,0.00004918516,0.00013735959,0.00026246347,0.000054545024,0.00016942328],"domain_scores_gemma":[0.9991679,0.00008615687,0.00009376587,0.00054089597,0.000070421964,0.000040832278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012923784,0.00019337318,0.00022766652,0.00011336839,0.000038334525,0.000029518327,0.0003940248,0.0001665408,0.00012410282],"category_scores_gemma":[0.00002011167,0.00017109064,0.00013863578,0.00021608129,0.00016287263,0.000041473377,0.00019775522,0.00049414043,0.00007684262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011507215,0.000021882106,0.0004389837,0.00017217726,0.000059314745,0.0000039140414,0.0002612561,0.94936633,0.000010914253,0.04913191,0.00026221736,0.00025961216],"study_design_scores_gemma":[0.00022518524,0.000031784177,0.00031539128,0.00030690889,0.000050671893,6.046071e-7,0.00010116407,0.9888731,0.00030781244,0.0056335772,0.0038654767,0.00028832664],"about_ca_topic_score_codex":0.000038336984,"about_ca_topic_score_gemma":0.000020677815,"teacher_disagreement_score":0.71930623,"about_ca_system_score_codex":0.0000771073,"about_ca_system_score_gemma":0.000031045733,"threshold_uncertainty_score":0.6976873},"labels":[],"label_agreement":null},{"id":"W2967891800","doi":"10.1109/cec.2019.8790058","title":"A Greedy, Generative, Lattice Representation for Point Packing","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Packing problems; Mathematics; Mathematical optimization; Population; Greedy algorithm; Representation (politics); Lattice (music); Algorithm; Combinatorics; Computer science","score_opus":0.022752675426866723,"score_gpt":0.2542193150449093,"score_spread":0.2314666396180426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967891800","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.037731446,0.000064995336,0.8397627,0.0003658931,0.0007568761,0.00065117166,0.000006369204,0.00058675115,0.120073795],"genre_scores_gemma":[0.89819944,0.000023595,0.093458906,0.00029625447,0.00009488837,0.000036416157,0.000046701352,0.000039067363,0.0078047356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963063,0.0000075209446,0.00010598174,0.00009688631,0.00005446212,0.00010450718],"domain_scores_gemma":[0.9997634,0.00004494337,0.00001414084,0.00011300471,0.000039835446,0.000024647852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006797924,0.00006246378,0.000071448056,0.000039125458,0.000023736435,0.0000404729,0.000039078925,0.00003257748,0.00041766182],"category_scores_gemma":[0.0000123046975,0.000058975205,0.000030708798,0.00008889515,0.0000039088186,0.00013609401,0.0000073914375,0.000034923047,0.000119191405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009327818,0.000012618307,0.00398943,0.00012078078,0.00005032664,3.9277614e-7,0.00090702815,0.95008385,0.0093021095,0.020821657,0.010713037,0.003989411],"study_design_scores_gemma":[0.0004941083,0.000024929657,0.00038260058,0.000014663262,0.0000070164947,0.0000018964794,0.000098187455,0.97894496,0.010384599,0.00079083926,0.008710781,0.00014541394],"about_ca_topic_score_codex":0.0000063538405,"about_ca_topic_score_gemma":0.000008692214,"teacher_disagreement_score":0.860468,"about_ca_system_score_codex":0.000015972864,"about_ca_system_score_gemma":0.0000039777137,"threshold_uncertainty_score":0.4573104},"labels":[],"label_agreement":null},{"id":"W2968494682","doi":"10.1139/cjfr-2019-0144","title":"A detailed mathematical programming model for the optimal daily planning of sawmills","year":2019,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fondo para la Investigación Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Production planning; Production (economics); Integer programming; Set (abstract data type); Linear programming; Task (project management); Computer science; Operations research; Mathematical optimization; Mathematics; Engineering; Algorithm; Economics","score_opus":0.06762502320226162,"score_gpt":0.3195811708624289,"score_spread":0.2519561476601673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968494682","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.6547784,0.0012350045,0.3398072,0.00036363894,0.00022299573,0.0008914826,0.000019538831,0.00001643673,0.0026652727],"genre_scores_gemma":[0.9760705,0.000010683571,0.023474347,0.0000065861727,0.00004749061,0.000010458305,0.0000016643932,0.00002629415,0.00035194412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989654,0.000020845728,0.00029660464,0.0000595375,0.0002616032,0.00039602804],"domain_scores_gemma":[0.99886554,0.00031749834,0.000049521015,0.00015034006,0.0003502652,0.00026680867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012321058,0.00007269655,0.00016436836,0.0002919536,0.00009647029,0.000084057625,0.0003188071,0.00006212412,0.00007310018],"category_scores_gemma":[0.00019260505,0.000052150688,0.000081665625,0.00021787632,0.000082982246,0.00009646586,0.000009771787,0.00034457838,0.000008897933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011077899,0.000005184626,0.008767276,0.00012882937,0.00004519225,0.0000053368058,0.0014941151,0.9860742,0.00006267232,0.0014221795,0.00084534293,0.0011385577],"study_design_scores_gemma":[0.00036691505,0.000102303435,0.00073482475,0.00019579446,0.000009653419,0.000026389293,0.00037730625,0.9955533,0.00008393469,0.00056626747,0.0019193628,0.00006394069],"about_ca_topic_score_codex":0.00005671517,"about_ca_topic_score_gemma":0.0015353658,"teacher_disagreement_score":0.3212921,"about_ca_system_score_codex":0.00007818206,"about_ca_system_score_gemma":0.0004973594,"threshold_uncertainty_score":0.21266434},"labels":[],"label_agreement":null},{"id":"W2971843904","doi":"10.48550/arxiv.1909.00510","title":"A Geometrical Branch-and-Price (GEOM-BP) Algorithm for Big Bin Packing Problems","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Bin; Bin packing problem; Algorithm; Computer science; Combinatorics; Mathematics","score_opus":0.06316971932415162,"score_gpt":0.1780288936672934,"score_spread":0.11485917434314179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971843904","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.023858303,0.00046968617,0.96903324,0.000033023778,0.0016846096,0.0009976679,0.00012359957,0.00060737634,0.0031925186],"genre_scores_gemma":[0.9916986,0.0013522346,0.0037705519,0.00006799558,0.00024270666,0.0000075967137,0.00013113569,0.000114746355,0.00261438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836755,0.000041069976,0.0002696536,0.00074462336,0.00009239614,0.00048469784],"domain_scores_gemma":[0.9988095,0.000196919,0.00013335112,0.0005270308,0.00014678149,0.00018640011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000250453,0.00041594665,0.00047904786,0.00066324376,0.000108250395,0.00013097588,0.000404699,0.0005087169,0.0000425462],"category_scores_gemma":[0.000037742757,0.00049641327,0.00020843664,0.0008706581,0.000059225793,0.00013961663,0.00035872567,0.0006069148,0.00006331659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008239895,0.00003263728,0.0011239075,0.00060899445,0.00016032853,0.000009268389,0.00014527609,0.9878921,0.000033801603,0.0010244129,0.0005354688,0.008425588],"study_design_scores_gemma":[0.0009988127,0.000047817626,0.00031893566,0.00020641864,0.00010937267,0.000004458254,0.00002526851,0.9838241,0.000068161564,0.002167641,0.011575598,0.00065345864],"about_ca_topic_score_codex":0.000045347027,"about_ca_topic_score_gemma":0.000010281029,"teacher_disagreement_score":0.9678404,"about_ca_system_score_codex":0.00018843164,"about_ca_system_score_gemma":0.000066153145,"threshold_uncertainty_score":0.99974877},"labels":[],"label_agreement":null},{"id":"W2973467733","doi":"10.5267/j.dsl.2019.7.002","title":"Bi-objective freight scheduling optimization in an integrated forward/reverse logistic network using non-dominated sorting genetic algorithm-II","year":2019,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sorting; Genetic algorithm; Sorting algorithm; Scheduling (production processes); Computer science; Mathematical optimization; Multi-objective optimization; Reverse logistics; Algorithm; Operations research; Mathematics; Business; Supply chain","score_opus":0.018964773747024228,"score_gpt":0.2672555993696925,"score_spread":0.24829082562266827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973467733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40102407,0.0000148014215,0.5979307,0.000019555346,0.00065671466,0.0002291608,0.0000016413701,0.000068550755,0.000054785607],"genre_scores_gemma":[0.53450644,0.000007971452,0.46512035,0.00027509767,0.00004426611,0.0000046831747,0.000009443041,0.000027058004,0.000004663683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978528,0.000048149486,0.0005392185,0.00052411767,0.00046223722,0.0005734911],"domain_scores_gemma":[0.99909925,0.0001194648,0.00012709998,0.00035516522,0.00016405662,0.00013494195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092985405,0.00023390533,0.0002679732,0.00063053315,0.0002759344,0.00023587051,0.00042552795,0.00010489307,0.00009299366],"category_scores_gemma":[0.00014270942,0.00022546393,0.00004733949,0.003011273,0.00013589447,0.0008515706,0.00009494613,0.00028215421,0.00003089953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008115951,0.000011536824,0.003024737,0.000005524816,0.0000039174993,0.0000082435145,0.0003782568,0.9807576,0.009043079,0.0000048070947,0.000024407378,0.0067297714],"study_design_scores_gemma":[0.000531862,0.000035199715,0.0014338655,0.00018859978,0.0000079393485,0.000007753702,0.00015587395,0.9966978,0.00056695344,0.000056883735,0.000025730871,0.00029155475],"about_ca_topic_score_codex":0.00004216381,"about_ca_topic_score_gemma":0.000009519728,"teacher_disagreement_score":0.13348238,"about_ca_system_score_codex":0.00030846393,"about_ca_system_score_gemma":0.00007369794,"threshold_uncertainty_score":0.9194152},"labels":[],"label_agreement":null},{"id":"W2976109600","doi":"10.18280/ria.330206","title":"Intelligent Loading of Scattered Cargoes Based on Improved Ant Colony Optimization","year":2019,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; ANT; Ant colony; Computer science; Artificial intelligence; Computer network","score_opus":0.01995646410089068,"score_gpt":0.23323614515028784,"score_spread":0.21327968104939715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976109600","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.031302698,0.00014862874,0.9552675,0.00013187077,0.0010566723,0.0006617854,0.000016533579,0.0002694972,0.011144801],"genre_scores_gemma":[0.99287033,0.00008227239,0.00618478,0.00008381051,0.00003287928,0.000016137608,0.00003129482,0.000043673095,0.00065482996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885863,0.000030076273,0.00047273634,0.00025292166,0.0001314637,0.00025415764],"domain_scores_gemma":[0.9991848,0.00012669511,0.00009600728,0.00041843962,0.00010424744,0.000069824135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021354904,0.000182822,0.00024253713,0.00019604144,0.00004470825,0.00003975412,0.00020491602,0.000098755954,0.0009828069],"category_scores_gemma":[0.000043245127,0.00018774062,0.00009297142,0.00041141323,0.000037726597,0.000088030334,0.000020822228,0.00014463841,0.00027638327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018756595,0.000054044594,0.00036837172,0.00017717255,0.000012727434,6.7551605e-7,0.0004012626,0.9851668,0.011056488,0.00023056286,0.00013109406,0.0023820675],"study_design_scores_gemma":[0.000049818915,0.00010873794,0.000010623859,0.00016997634,0.0000074614136,0.0000010971196,0.00014249748,0.79786015,0.2008802,0.000018138831,0.00058758614,0.00016374889],"about_ca_topic_score_codex":0.000012829418,"about_ca_topic_score_gemma":0.0000032863963,"teacher_disagreement_score":0.96156764,"about_ca_system_score_codex":0.00007372929,"about_ca_system_score_gemma":0.000022542197,"threshold_uncertainty_score":0.99993044},"labels":[],"label_agreement":null},{"id":"W3033378018","doi":"10.1016/j.ejor.2020.04.053","title":"The Pallet Loading Problem: Three-dimensional bin packing with practical constraints","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pallet; Computer science; Bin; Mathematical optimization; Bin packing problem; Generator (circuit theory); Load bearing; Representation (politics); Algorithm; Structural engineering; Mathematics; Power (physics); Engineering","score_opus":0.10714454501389158,"score_gpt":0.328749102098871,"score_spread":0.2216045570849794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033378018","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.12384158,0.00246599,0.47105476,0.18696126,0.0012211481,0.0021196478,0.000050578226,0.0004004718,0.21188457],"genre_scores_gemma":[0.97764105,0.00006346688,0.021552382,0.00023928496,0.00037544893,0.0000017060514,0.0000045199295,0.000043078067,0.000079055106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779356,0.00045765823,0.0004015798,0.00011335397,0.0009642669,0.0002695607],"domain_scores_gemma":[0.9983539,0.00051834004,0.00006587343,0.00008540154,0.0007488225,0.00022765079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030180651,0.0001044124,0.00011640559,0.00007865837,0.00038856236,0.00037571887,0.0002273413,0.000018789824,0.0002670678],"category_scores_gemma":[0.0005250129,0.00006505185,0.000040137587,0.00029837398,0.00022335057,0.00025156676,0.000052778618,0.0008678482,0.00012897336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003597569,0.00006623549,0.00129102,0.00006384009,0.00030715865,0.00095683,0.0012029504,0.90115404,0.009241813,0.016777676,0.058758568,0.009820108],"study_design_scores_gemma":[0.006306277,0.0032303664,0.004959599,0.0011497309,0.00005942401,0.0030084974,0.0010393779,0.67863464,0.0037640233,0.0006104699,0.29617184,0.0010657189],"about_ca_topic_score_codex":4.7417376e-7,"about_ca_topic_score_gemma":0.0000032040427,"teacher_disagreement_score":0.85379946,"about_ca_system_score_codex":0.000041909243,"about_ca_system_score_gemma":0.00025141836,"threshold_uncertainty_score":0.3770417},"labels":[],"label_agreement":null},{"id":"W3082452785","doi":"10.1145/3414685.3417796","title":"TAP-Net","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Container (type theory); Graph; Packing problems; Encoder; ENCODE; Artificial neural network; Mathematical optimization; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Engineering","score_opus":0.026926426981137768,"score_gpt":0.216370443988352,"score_spread":0.18944401700721425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082452785","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.0013263111,0.00009784144,0.98539907,0.0041514877,0.00045845195,0.00015008562,0.000026108835,0.001101413,0.00728924],"genre_scores_gemma":[0.9935329,0.00052443746,0.00405247,0.0017064336,0.00004505973,0.000021166406,0.000009175051,0.00003480469,0.000073553194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995759,0.000010253525,0.000111803485,0.000102229715,0.00008988983,0.00010989482],"domain_scores_gemma":[0.99965,0.00003683215,0.000008810874,0.00019690486,0.00001922452,0.00008822803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026595411,0.000093964234,0.00007948623,0.00007416382,0.000070783724,0.000017875886,0.00014232149,0.00006509449,0.0003987936],"category_scores_gemma":[0.000009332113,0.00009661889,0.000049746282,0.00044612377,0.000028278324,0.00006629856,9.1980695e-7,0.00020397211,0.00009785353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009831441,0.00003761365,0.00012072331,0.00007526483,0.00008240632,0.0000037408429,0.0011410505,0.9753941,0.00048273188,0.002804885,0.006582665,0.013264974],"study_design_scores_gemma":[0.0017260397,0.00043351375,0.0009359828,0.00007928724,0.00015874686,0.000014980245,0.00023490797,0.48042127,0.0050870753,0.0049209567,0.5048295,0.0011576922],"about_ca_topic_score_codex":0.0000026013709,"about_ca_topic_score_gemma":0.0000062622253,"teacher_disagreement_score":0.9922066,"about_ca_system_score_codex":0.000006185551,"about_ca_system_score_gemma":0.0000041322087,"threshold_uncertainty_score":0.43665105},"labels":[],"label_agreement":null},{"id":"W3085264249","doi":"10.5267/j.dsl.2020.6.001","title":"Harmony search algorithm with adaptive parameter setting for solving large bin packing problems","year":2020,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Harmony search; Initialization; Bin packing problem; Mathematical optimization; Benchmark (surveying); Algorithm; Bin; Rate of convergence; Computer science; Convergence (economics); Mathematics; Key (lock)","score_opus":0.03548456992513271,"score_gpt":0.26185777967262064,"score_spread":0.22637320974748792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085264249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037049882,0.000031332205,0.9595438,0.0023489448,0.00018725499,0.0004621208,0.000020266616,0.0002533955,0.00010299547],"genre_scores_gemma":[0.58758605,0.000006995847,0.40812355,0.004108866,0.00008387914,0.00003474149,0.0000060029874,0.000043486318,0.0000064188284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979043,0.000015985239,0.00027386338,0.0004819465,0.0006774601,0.00064646464],"domain_scores_gemma":[0.9990522,0.00034312534,0.00005029039,0.00020741802,0.00012714507,0.00021980505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092327734,0.00018891865,0.00018635647,0.00020915715,0.00035618574,0.0003958234,0.00041856695,0.0000448756,0.000029172164],"category_scores_gemma":[0.00017169378,0.00015649233,0.00005574403,0.001187119,0.00013405184,0.0006278176,0.00008635907,0.00022919563,0.000034476976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000256693,0.000013853031,0.00082293595,0.000045094766,0.00002101934,0.000011917038,0.004656247,0.8698889,0.03226497,0.00008348083,0.0043876395,0.0877783],"study_design_scores_gemma":[0.0005578167,0.00007578025,0.00017939552,0.00010925016,0.0000062513927,0.000005219115,0.00021224451,0.99018735,0.005650881,0.00003782711,0.0027236817,0.00025431317],"about_ca_topic_score_codex":0.000002389736,"about_ca_topic_score_gemma":0.000001404897,"teacher_disagreement_score":0.5514203,"about_ca_system_score_codex":0.00007010926,"about_ca_system_score_gemma":0.00003852168,"threshold_uncertainty_score":0.6381572},"labels":[],"label_agreement":null},{"id":"W3093212826","doi":"10.1287/ijoc.2020.0983","title":"The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Knapsack problem; Heuristics; Mathematical optimization; Integer programming; Generalization; Cutting stock problem; Continuous knapsack problem; Pairwise comparison; Quadratic programming; Set (abstract data type); Change-making problem; Mathematics; Constraint (computer-aided design); Constraint programming; Computer science; Optimization problem; Stochastic programming; Artificial intelligence","score_opus":0.013182966660332715,"score_gpt":0.20806319213028104,"score_spread":0.19488022546994832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093212826","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.3916474,0.00093457056,0.49803504,0.0069835447,0.0012015183,0.0012104166,0.000008958508,0.0011628589,0.0988157],"genre_scores_gemma":[0.99278307,0.000074465635,0.006254985,0.00075637293,0.000096758355,6.0978795e-7,8.483451e-7,0.000015555743,0.000017355149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993211,0.0000102279855,0.00025825467,0.00006325604,0.00014850641,0.00019865937],"domain_scores_gemma":[0.9995439,0.000116138675,0.00009135221,0.00005454511,0.0000504475,0.00014358365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018003263,0.00011510372,0.00011411318,0.000022484954,0.0002598534,0.00031105053,0.000103029604,0.000030820316,0.00001033255],"category_scores_gemma":[0.000033452514,0.00006715208,0.000018858389,0.000106693034,0.00006975389,0.00011089591,0.000015984062,0.00035815613,0.000016236852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002232782,0.0000042441807,0.0016781862,0.00007391139,0.00005045468,0.00001562123,0.0034492572,0.9374162,0.00005148631,0.0014274358,0.00046023153,0.055350676],"study_design_scores_gemma":[0.0009857158,0.0001797851,0.0005232801,0.00023613879,0.000006487863,0.00025102217,0.00024292024,0.97888213,0.00012365682,0.000045811557,0.018333398,0.00018962714],"about_ca_topic_score_codex":3.7630593e-7,"about_ca_topic_score_gemma":6.7707083e-7,"teacher_disagreement_score":0.6011357,"about_ca_system_score_codex":0.000015951258,"about_ca_system_score_gemma":0.000019699937,"threshold_uncertainty_score":0.29994673},"labels":[],"label_agreement":null},{"id":"W3099079581","doi":"10.55016/ojs/cdm.v16i3.71526","title":"Polytopal balls arising in optimization","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Dual polyhedron; Polytope; Mathematics; Combinatorics; Unit sphere; Ball (mathematics); Hypercube; Unit cube; Norm (philosophy); Geometry","score_opus":0.008618149046474167,"score_gpt":0.25580223212039116,"score_spread":0.24718408307391698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099079581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022687248,0.00016697531,0.98686296,0.000557297,0.00018027415,0.00019411568,0.0000906027,0.00021811992,0.00946092],"genre_scores_gemma":[0.78997445,0.00009589162,0.20875631,0.00018026543,0.00007945324,0.000046415113,0.00023651466,0.000054882665,0.0005757997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991814,0.000022111079,0.00031460857,0.00012501783,0.000115412746,0.00024148119],"domain_scores_gemma":[0.99945605,0.00006346819,0.000025083229,0.00022737535,0.00013554764,0.00009249177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001431084,0.00012090565,0.00018457625,0.00011431352,0.00006352854,0.00010530575,0.00008355221,0.00007664035,0.00020867024],"category_scores_gemma":[0.00030151202,0.00013288876,0.000043746113,0.00058386876,0.000012782429,0.00010215748,0.00003547247,0.00011402926,0.000070073074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.53775e-7,0.000026297044,0.000064925094,0.00003862307,0.000011470457,0.000006114958,0.00045702548,0.98680425,0.00051314256,0.01150087,0.00041870176,0.00015781264],"study_design_scores_gemma":[0.00036773403,0.0000077935665,0.00009125631,0.00015487283,0.00001647098,0.000013705089,0.00016823168,0.9930158,0.0027470964,0.0012748356,0.0019208983,0.00022129179],"about_ca_topic_score_codex":0.0000019997026,"about_ca_topic_score_gemma":0.000017172873,"teacher_disagreement_score":0.7877057,"about_ca_system_score_codex":0.00012281419,"about_ca_system_score_gemma":0.000038402337,"threshold_uncertainty_score":0.5419047},"labels":[],"label_agreement":null},{"id":"W3111992288","doi":"10.1007/978-3-030-64843-5_36","title":"Cutting Stock with Rotation: Packing Square Items into Square Bins","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"University of Manitoba","funders":"","keywords":"Square (algebra); Computer science; Rotation (mathematics); Algorithm; Artificial intelligence; Mathematics; Geometry","score_opus":0.015159298363094247,"score_gpt":0.2222894581413716,"score_spread":0.20713015977827737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111992288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001017,0.00032827075,0.9931002,0.00031054986,0.0007990477,0.00037619178,0.0000057027537,0.000451038,0.0045272703],"genre_scores_gemma":[0.71277165,0.000044532837,0.28529385,0.00076599605,0.0007620632,0.000017403065,0.000052362404,0.00015984631,0.0001323129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980533,0.000013155283,0.0003551414,0.00066471286,0.0005569767,0.00035672562],"domain_scores_gemma":[0.9990301,0.00015115326,0.000121627905,0.0003994126,0.00015939272,0.00013829756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018124258,0.00043248525,0.000360301,0.00039588782,0.00020000464,0.00036390006,0.00053784077,0.00021553095,0.00004961591],"category_scores_gemma":[0.00003420268,0.0003961187,0.00006226052,0.0005854271,0.00018447787,0.00027168682,0.00013619439,0.0007013173,0.00003317626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028141833,0.000003027718,0.00023870316,0.00018183562,0.000011136063,0.000023359597,0.0020794969,0.8902139,0.000035618657,0.0006465649,0.000018059969,0.10654549],"study_design_scores_gemma":[0.00024335195,0.00013375895,0.0000647265,0.0012506064,0.000011682335,0.000024507477,0.0000017702768,0.99169767,0.0003829085,0.003125139,0.0024144833,0.0006493695],"about_ca_topic_score_codex":0.000012841448,"about_ca_topic_score_gemma":0.00009628579,"teacher_disagreement_score":0.71266997,"about_ca_system_score_codex":0.00020520062,"about_ca_system_score_gemma":0.00013158393,"threshold_uncertainty_score":0.9998491},"labels":[],"label_agreement":null},{"id":"W3113052278","doi":"10.1109/cibcb48159.2020.9277719","title":"Odd Distance Anchors for Rapid Clustering","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cluster analysis; Hamming distance; Computer science; Set (abstract data type); Line (geometry); Constraint (computer-aided design); Similarity (geometry); Algorithm; Metric (unit); Space (punctuation); Metric space; Data mining; Correlation clustering; Mathematics; Discrete mathematics; Artificial intelligence; Engineering; Geometry","score_opus":0.02561957280193519,"score_gpt":0.21359755426544477,"score_spread":0.18797798146350958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113052278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019421404,0.00011842996,0.96886176,0.00046799672,0.00016628833,0.000110631205,0.000005572313,0.0004383213,0.029636802],"genre_scores_gemma":[0.95377284,0.0000814323,0.044295236,0.00084837223,0.00014746751,0.000021713866,0.000014977534,0.000036367168,0.00078157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997263,0.0000019453244,0.00007825118,0.000068471905,0.00003063395,0.000094397314],"domain_scores_gemma":[0.9998704,0.000012737606,0.000006011786,0.00004983753,0.000010319935,0.00005069034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000021036123,0.000053023785,0.00005838866,0.000009203252,0.000020745425,0.000022827444,0.00004746117,0.00002075474,0.00019154594],"category_scores_gemma":[0.0000096030835,0.000051997962,0.000023111941,0.00006876045,0.0000042290835,0.000051784093,0.000006841265,0.000030421646,0.00002242363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000869613,0.0000030643557,0.00011863547,0.0002296035,0.000015577423,4.1579648e-7,0.00058930775,0.9562601,0.00049886276,0.0013289581,0.03097555,0.00997127],"study_design_scores_gemma":[0.00015677026,0.000012115278,0.00001744628,0.000006144589,0.0000017825445,1.8125735e-7,0.00001817347,0.78373474,0.000619874,0.000018798204,0.21534054,0.00007342986],"about_ca_topic_score_codex":5.02356e-7,"about_ca_topic_score_gemma":0.000003992336,"teacher_disagreement_score":0.95357865,"about_ca_system_score_codex":0.00000703404,"about_ca_system_score_gemma":0.0000019669594,"threshold_uncertainty_score":0.21204154},"labels":[],"label_agreement":null},{"id":"W3118158855","doi":"10.1016/j.aei.2020.101234","title":"Optimizing 3D Irregular Object Packing from 3D Scans Using Metaheuristics","year":2020,"lang":"en","type":"article","venue":"Advanced Engineering Informatics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University Network of Excellence in Nuclear Engineering","keywords":"Container (type theory); Packing problems; Object (grammar); Metaheuristic; Volume (thermodynamics); Computer science; Mathematical optimization; Bin packing problem; Key (lock); Algorithm; Engineering; Artificial intelligence; Mathematics; Mechanical engineering","score_opus":0.014432848633734395,"score_gpt":0.2050927582970104,"score_spread":0.190659909663276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118158855","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.010009465,0.00046019888,0.9861107,0.000017250004,0.0006456747,0.00019611434,0.00005204582,0.0013515172,0.0011570764],"genre_scores_gemma":[0.22492225,0.00016796046,0.7743853,0.0001750692,0.00014325899,0.000008160756,0.000080857724,0.000111112946,0.0000060715324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984377,0.000008333203,0.0006807286,0.00013931548,0.00026830414,0.00046561056],"domain_scores_gemma":[0.9992225,0.00008256871,0.00010254687,0.0002949541,0.00006768484,0.00022970345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000085931526,0.00037265164,0.00039273125,0.0001233855,0.000088568355,0.00013184221,0.00024563336,0.00012912058,0.00004826837],"category_scores_gemma":[0.000094527044,0.00042704906,0.000084942985,0.00048165373,0.00002030384,0.00069666485,0.00006700583,0.00037457264,0.00004085628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030163392,0.0000034709494,0.000029426055,0.00024188681,0.00008251543,0.0000032894616,0.003204039,0.9917118,0.001769787,0.0000983255,0.00003761311,0.0028148084],"study_design_scores_gemma":[0.00041382996,0.000018568147,0.000016672657,0.00015141493,0.000060240804,0.0000049193973,0.00016145526,0.98340786,0.0017841328,0.00000880794,0.0134800775,0.0004920189],"about_ca_topic_score_codex":0.0000039187,"about_ca_topic_score_gemma":7.117397e-7,"teacher_disagreement_score":0.21491279,"about_ca_system_score_codex":0.000109499706,"about_ca_system_score_gemma":0.000023820357,"threshold_uncertainty_score":0.99981815},"labels":[],"label_agreement":null},{"id":"W3122681984","doi":"10.1287/ijoc.2020.1014","title":"Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Compute Canada; Università Degli Studi di Modena e Reggio Emila","keywords":"Bin packing problem; Set packing; Set (abstract data type); Packing problems; Generalization; Bin; Heuristics; Heuristic; Mathematics; Mathematical optimization; Benchmark (surveying); Bounding overwatch; Decomposition; Benders' decomposition; Algorithm; Container (type theory); Computer science; Preprocessor; Branch and cut; Combinatorial optimization; Integer programming; Artificial intelligence","score_opus":0.015485442451062556,"score_gpt":0.26493965401868874,"score_spread":0.24945421156762618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122681984","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.15459651,0.00079372077,0.80070835,0.0024116682,0.02046491,0.0009905453,0.000017278831,0.00079199416,0.019225],"genre_scores_gemma":[0.985348,0.000015631973,0.013429424,0.00046458511,0.0006672536,0.0000029406779,0.000020164653,0.00003105479,0.000020949861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896395,0.000019409534,0.00039640462,0.0000920897,0.00024938732,0.00027875314],"domain_scores_gemma":[0.9991523,0.00036058022,0.00011647161,0.00010467456,0.00018516192,0.00008079458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750058,0.00014315537,0.0001428153,0.00008158478,0.00053213304,0.0003161826,0.00012667739,0.000057024234,0.000034130593],"category_scores_gemma":[0.00004119159,0.00010520862,0.000120711775,0.00019161195,0.000016767008,0.00016314755,0.000032400334,0.00039519402,0.0000120379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013784566,0.000014339101,0.00007475279,0.00002173699,0.00006661598,0.0000061405685,0.00026337412,0.97382843,0.00026431034,0.0068431776,0.00097253855,0.01763082],"study_design_scores_gemma":[0.0018939442,0.00007646441,0.000097141376,0.00024686402,0.00002234624,0.00030523073,0.00009909748,0.9827331,0.0023686169,0.0038618518,0.008069886,0.0002254969],"about_ca_topic_score_codex":0.0000011109245,"about_ca_topic_score_gemma":0.0000014135815,"teacher_disagreement_score":0.8307515,"about_ca_system_score_codex":0.00010020521,"about_ca_system_score_gemma":0.00006237593,"threshold_uncertainty_score":0.4290283},"labels":[],"label_agreement":null},{"id":"W3124663948","doi":"10.5267/j.ijiec.2020.11.002","title":"Optimizing large scale bin packing problem with hybrid harmony search algorithm","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Harmony search; Bin packing problem; Mathematical optimization; Computer science; Initialization; Local search (optimization); Algorithm; Benchmark (surveying); Mathematics; Bin","score_opus":0.022741068882713565,"score_gpt":0.24794244359205095,"score_spread":0.22520137470933738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124663948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019178474,0.00019642968,0.97747463,0.00054237264,0.0018672388,0.00009777927,0.0000562767,0.00015233931,0.000434438],"genre_scores_gemma":[0.6519127,0.000081605416,0.3464967,0.00006877977,0.0011772437,0.0000058373466,0.00009790476,0.00008320253,0.00007603848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985124,0.000031862335,0.00052759016,0.00013373974,0.00054110587,0.0002533113],"domain_scores_gemma":[0.9986703,0.00012300462,0.00011160959,0.00009539391,0.00085987366,0.00013984558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028588178,0.00017746656,0.00023120752,0.00038589071,0.0000636164,0.0002542584,0.00026299368,0.000075879485,0.00008256973],"category_scores_gemma":[0.000050788592,0.00017823088,0.00010195681,0.00038724917,0.00001677075,0.00035467604,0.000047853086,0.0005810307,0.000008062001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086936225,0.000049543833,0.000120169665,0.000009634515,0.00027060267,0.00016496763,0.00044267735,0.98820174,0.00051928114,0.0001487452,0.0006822017,0.009381742],"study_design_scores_gemma":[0.0020583763,0.00005580395,0.00005657142,0.00047793053,0.00003586154,0.0007327671,0.00017271155,0.98274666,0.0061039417,0.000034633136,0.0072766053,0.0002481386],"about_ca_topic_score_codex":0.000003655787,"about_ca_topic_score_gemma":0.0000019699994,"teacher_disagreement_score":0.63273424,"about_ca_system_score_codex":0.00017273714,"about_ca_system_score_gemma":0.00018478329,"threshold_uncertainty_score":0.7268045},"labels":[],"label_agreement":null},{"id":"W3136517660","doi":"10.1007/s10287-021-00389-6","title":"Some new perspectives for solving 0–1 integer programming problems using Balas method","year":2021,"lang":"en","type":"article","venue":"Computational Management Science","topic":"Optimization and Packing Problems","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":"The Scarborough Hospital; University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Integer programming; Integer (computer science); Simple (philosophy); Point (geometry); Enumeration; Branch and bound; Computer science; Mathematical optimization; State (computer science); Search algorithm; Algorithm; Linear programming; Mathematics; Combinatorics","score_opus":0.03257221656774705,"score_gpt":0.3042496675554734,"score_spread":0.27167745098772633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136517660","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.00058557035,0.00055076927,0.9966154,0.00016718177,0.00043919735,0.00031912237,0.0000014118765,0.00018450627,0.0011368481],"genre_scores_gemma":[0.106131025,0.000024203915,0.8932328,0.0000788019,0.00011243004,0.000019909952,0.000009695504,0.000018268509,0.00037283963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989475,0.00001023195,0.00017060852,0.00028133907,0.00029134826,0.00029896217],"domain_scores_gemma":[0.9995504,0.00006675153,0.00003559027,0.00010558448,0.00014960651,0.000092045724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004249588,0.00010946911,0.00009670138,0.00018563519,0.0002303121,0.0002670387,0.0001700073,0.000019002635,0.00001928324],"category_scores_gemma":[0.00004880256,0.0001198107,0.000044688197,0.0007398344,0.00006186345,0.0006035124,0.00008993689,0.00005764444,0.000005968161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.354397e-7,0.000017881963,0.000059536775,0.00008780434,0.00002080927,8.0555657e-7,0.00074611866,0.9063566,0.00020952924,0.085821375,0.00022302508,0.006455917],"study_design_scores_gemma":[0.00020954818,0.000007844213,0.0002533027,0.000070899856,0.000014206811,0.000005803133,0.00067938113,0.98672915,0.00021071566,0.008829213,0.0028326588,0.0001572789],"about_ca_topic_score_codex":0.0000019839285,"about_ca_topic_score_gemma":4.6886439e-7,"teacher_disagreement_score":0.105545454,"about_ca_system_score_codex":0.00014180609,"about_ca_system_score_gemma":0.00006990793,"threshold_uncertainty_score":0.48857385},"labels":[],"label_agreement":null},{"id":"W3153775560","doi":"10.5267/j.ijiec.2021.1.003","title":"An approach for the pallet-building problem and subsequent loading in a heterogeneous fleet of vehicles with practical constraints","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pallet; Truck; Metaheuristic; GRASP; Computer science; Stability (learning theory); Work (physics); Mathematical optimization; Operations research; Algorithm; Engineering; Mathematics; Automotive engineering; Machine learning","score_opus":0.04002140191278727,"score_gpt":0.28316838333605665,"score_spread":0.24314698142326938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153775560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11152898,0.0001379608,0.88744104,0.00035543108,0.0003095542,0.00015183352,0.000015680449,0.000022149778,0.00003736851],"genre_scores_gemma":[0.87212896,0.000022867618,0.12767641,0.000010458664,0.00012963651,0.0000064662067,0.000009181126,0.000015021116,0.0000010038242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923027,0.000022326589,0.00037773972,0.0000775935,0.00019180968,0.000100293146],"domain_scores_gemma":[0.9991592,0.00033151964,0.00010855604,0.000050873336,0.00029825512,0.00005155064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025695647,0.00008979744,0.00014803826,0.0001549915,0.000023920085,0.000081839295,0.00011217047,0.000057812427,0.0000048349675],"category_scores_gemma":[0.000110845314,0.00007399454,0.00003864549,0.00014218007,0.00003537729,0.00014834433,0.00001275374,0.00022456973,4.8952494e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025304189,0.000043204276,0.00044406674,0.000016371776,0.00017658278,0.000019709578,0.00024302721,0.99258757,0.0019800868,0.0018360112,0.00001611022,0.0026119591],"study_design_scores_gemma":[0.001335317,0.00006417302,0.00012394201,0.00018152948,0.000028546367,0.00054863543,0.00014666689,0.9951301,0.0021359331,0.00007773353,0.00013558238,0.00009181878],"about_ca_topic_score_codex":0.000002954018,"about_ca_topic_score_gemma":0.0000019287404,"teacher_disagreement_score":0.7606,"about_ca_system_score_codex":0.000056692807,"about_ca_system_score_gemma":0.00009875625,"threshold_uncertainty_score":0.30174097},"labels":[],"label_agreement":null},{"id":"W3170503988","doi":"","title":"A Novel Method to Solve Neural Knapsack Problems","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Optimization and Packing Problems","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":"University of Alberta","funders":"","keywords":"Knapsack problem; Computer science; Artificial neural network; Continuous knapsack problem; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","score_opus":0.04815810532373953,"score_gpt":0.30894578768717124,"score_spread":0.2607876823634317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170503988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001430985,0.000038953574,0.91491985,0.0027225374,0.00065273105,0.00010660101,0.00002182661,0.00036342817,0.07974309],"genre_scores_gemma":[0.84511673,0.00004128435,0.1486107,0.0009194129,0.00016690981,0.00003199521,0.00020590787,0.0000600802,0.0048469882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990533,0.000033182863,0.00021464085,0.00024569407,0.00026083845,0.00019236606],"domain_scores_gemma":[0.99947065,0.000062337014,0.00003797293,0.00011872184,0.00021387082,0.00009645072],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016826262,0.00016156505,0.00014282615,0.00013141014,0.00006279618,0.00018356285,0.00020018026,0.000056533558,0.001802649],"category_scores_gemma":[0.00011099182,0.0001691406,0.000057284054,0.0001865579,0.000008616682,0.00010388494,0.00006293093,0.00043992334,0.00019857728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074638347,0.000025138817,0.00035975373,0.0000143867255,0.00004440019,0.0000071983154,0.00038538838,0.937879,0.02761858,0.02142317,0.00014446564,0.012091019],"study_design_scores_gemma":[0.000324734,0.000040378076,0.00025222724,0.000072894756,0.0000050642752,0.000038271734,0.000043398017,0.967316,0.0014004648,0.000262414,0.030043352,0.00020085278],"about_ca_topic_score_codex":0.000029537283,"about_ca_topic_score_gemma":0.000041632153,"teacher_disagreement_score":0.84368575,"about_ca_system_score_codex":0.00005111186,"about_ca_system_score_gemma":0.000027560605,"threshold_uncertainty_score":0.99910986},"labels":[],"label_agreement":null},{"id":"W3175250543","doi":"10.1016/j.dam.2023.02.003","title":"A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec à Montréal","keywords":"Knapsack problem; Mathematics; Mathematical optimization; Change-making problem; Continuous knapsack problem; Quadratic programming; Heuristic; Algorithm; Cutting stock problem; Dynamic programming; Binary number; Constraint (computer-aided design); Function (biology); Integer programming; Optimization problem","score_opus":0.0124201419681223,"score_gpt":0.24365277073564792,"score_spread":0.23123262876752562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175250543","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.00021915596,0.00009841338,0.9920965,0.0002583586,0.00014593508,0.0018566392,0.000030366895,0.0014285834,0.0038660907],"genre_scores_gemma":[0.033509467,0.00019691601,0.96202993,0.00005909833,0.00009249839,0.0021753302,0.00022072149,0.00024270528,0.0014733288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988853,0.000005217135,0.00032337604,0.0001781087,0.00019911322,0.00040888268],"domain_scores_gemma":[0.9991967,0.00028336435,0.000070698596,0.0003492411,0.00003547817,0.000064498745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030559197,0.00022837799,0.00022729317,0.00008218716,0.00018183468,0.00015436152,0.00024118634,0.000089937486,0.000020200732],"category_scores_gemma":[0.000018020732,0.00016899014,0.000086915476,0.0005446077,0.000046622652,0.00005354624,0.000044166245,0.00014670189,0.00016191883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008555828,0.000110884335,0.00000532903,0.0042188973,0.00058284553,0.000004713152,0.018000431,0.5459022,0.0017637394,0.103594154,0.011303778,0.31450447],"study_design_scores_gemma":[0.00029636614,0.000016394228,0.0000030335761,0.000064255146,0.000058758196,0.0000027989709,0.0011457806,0.9814823,0.00017946967,0.0068548825,0.00965368,0.00024228009],"about_ca_topic_score_codex":9.601517e-7,"about_ca_topic_score_gemma":0.0000060034617,"teacher_disagreement_score":0.4355801,"about_ca_system_score_codex":0.00003402369,"about_ca_system_score_gemma":0.000016140484,"threshold_uncertainty_score":0.6891218},"labels":[],"label_agreement":null},{"id":"W3193956226","doi":"10.2139/ssrn.3847516","title":"Exact Optimization and Decomposition Approaches for 2D Shelf Space Allocation","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","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":"Western University","funders":"","keywords":"Decomposition; Space (punctuation); Computer science; Mathematical optimization; Mathematics; Biology","score_opus":0.012741063271691912,"score_gpt":0.22459795448582018,"score_spread":0.21185689121412826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193956226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056231683,0.0026247487,0.9901637,0.00054513686,0.00014133457,0.00011175974,0.0000020929435,0.000076583485,0.00071146915],"genre_scores_gemma":[0.96235436,0.007565015,0.029308284,0.000035341433,0.00016787468,0.000014362506,0.000098105294,0.000042038686,0.00041461887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991004,0.000027037933,0.00014720182,0.000109300425,0.00007729594,0.0005387951],"domain_scores_gemma":[0.9997502,0.000026790134,0.00003991183,0.00006781458,0.00007080148,0.000044497545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035099607,0.00009525878,0.00009153448,0.00006077892,0.00012414188,0.00009940906,0.000042396292,0.00006358454,0.000015672384],"category_scores_gemma":[0.000019018024,0.00010176679,0.000038094648,0.000117487325,0.000009502371,0.00019877969,0.000006707791,0.00031437736,0.0000014513848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006971716,0.000014692346,0.00006134953,0.000025954381,0.000059934468,2.6786108e-7,0.00011036784,0.96320415,0.00041022123,0.02798058,0.000058976166,0.008066552],"study_design_scores_gemma":[0.00064359535,0.00006774971,0.000048516788,0.000026556918,0.000041442414,0.0002696819,0.00042002482,0.98381007,0.0014595534,0.012159148,0.00087650784,0.00017716213],"about_ca_topic_score_codex":0.0000011979283,"about_ca_topic_score_gemma":0.000034013116,"teacher_disagreement_score":0.9608554,"about_ca_system_score_codex":0.00023119128,"about_ca_system_score_gemma":0.00019317809,"threshold_uncertainty_score":0.4149929},"labels":[],"label_agreement":null},{"id":"W3194613367","doi":"10.1007/978-3-030-74970-5_16","title":"olgga: An On-Line Generation-Less Genetic Algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Optimization and Packing Problems","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":"University of Alberta","funders":"","keywords":"Knapsack problem; Computer science; Genetic algorithm; Population; Algorithm; Meta-optimization; Population-based incremental learning; Mathematical optimization; Cultural algorithm; Evolutionary algorithm; Adaptation (eye); Optimization problem; Artificial intelligence; Mathematics; Machine learning; Biology","score_opus":0.180480486225541,"score_gpt":0.3502649495217685,"score_spread":0.1697844632962275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194613367","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.000033788878,0.010386537,0.9343469,0.00009548517,0.0027725708,0.000313717,0.00009831763,0.00020969698,0.05174295],"genre_scores_gemma":[0.05234274,0.041505877,0.7358061,0.0019131481,0.004967189,0.00023766703,0.0034760372,0.0006714405,0.1590798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848306,0.000022688939,0.0005557695,0.00041378927,0.00033666883,0.00018800577],"domain_scores_gemma":[0.9990638,0.00020988454,0.000075542564,0.00022153308,0.00036956224,0.000059658163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011015736,0.00035401026,0.00038009058,0.00021376075,0.000092879454,0.000051907988,0.00018518826,0.00016077518,0.00020183255],"category_scores_gemma":[0.000026877986,0.00039175816,0.00007164349,0.000100958336,0.00013151413,0.00006224116,0.00006281565,0.00035998944,0.00009903553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011328359,0.000016835365,0.000001933347,0.000061119295,0.0001172581,0.000039889146,0.00034331292,0.90352833,3.5237804e-7,0.038753003,0.0006288836,0.056507956],"study_design_scores_gemma":[0.00006551707,0.00007248314,0.000006092129,0.00032308666,0.000017394388,0.00001562689,0.00009363921,0.97201395,0.00003826104,0.022895982,0.0040307967,0.00042717592],"about_ca_topic_score_codex":0.0000025625118,"about_ca_topic_score_gemma":0.00004187182,"teacher_disagreement_score":0.19854085,"about_ca_system_score_codex":0.00017417785,"about_ca_system_score_gemma":0.00005792647,"threshold_uncertainty_score":0.99985343},"labels":[],"label_agreement":null},{"id":"W3198051614","doi":"10.1007/s11081-021-09673-5","title":"A data-driven approach for mixed-case palletization with support","year":2021,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pallet; Bin packing problem; Packing problems; Computer science; Bin; Mathematical optimization; Layering; Layer (electronics); Algorithm; Computational science; Mathematics; Mechanical engineering; Materials science; Engineering","score_opus":0.020149346295971614,"score_gpt":0.21080464655756295,"score_spread":0.19065530026159133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198051614","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.00037663436,0.00009597878,0.9975623,0.000035572706,0.000116579504,0.00017215086,0.0000664456,0.00033504795,0.001239312],"genre_scores_gemma":[0.10431193,0.00028270952,0.89230055,0.000041012183,0.00006905591,0.000047800022,0.0026759342,0.000078260055,0.00019274003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937314,0.000007038088,0.00015913053,0.00022515036,0.0000728,0.00016273702],"domain_scores_gemma":[0.99955106,0.000027094053,0.000020325373,0.00024104066,0.00008210266,0.0000783857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000785089,0.00013921048,0.00013345317,0.000068193716,0.00006587847,0.00010202,0.00006311146,0.000067554276,0.000052894993],"category_scores_gemma":[0.000026709102,0.00014310831,0.000015041434,0.00022331717,0.000009367651,0.00023069016,0.000030637668,0.0000662257,9.854565e-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.0000024648127,0.000011643824,0.00003657087,0.00017198,0.000033930595,0.00001930436,0.000084769985,0.9983425,0.000042286225,0.00023963538,0.0005621598,0.00045274536],"study_design_scores_gemma":[0.0004721505,0.000014872431,0.000010735513,0.000017717102,0.000029376395,0.00037125178,0.00006209545,0.99277645,0.000089231115,7.286987e-7,0.005960068,0.00019529152],"about_ca_topic_score_codex":5.5975715e-7,"about_ca_topic_score_gemma":0.0000029020994,"teacher_disagreement_score":0.10526172,"about_ca_system_score_codex":0.000014812681,"about_ca_system_score_gemma":0.000017577398,"threshold_uncertainty_score":0.5835787},"labels":[],"label_agreement":null},{"id":"W3200189330","doi":"10.1007/s10479-021-04310-x","title":"The linearization problem of a binary quadratic problem and its applications","year":2021,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linearization; Mathematics; Bounding overwatch; Quadratic equation; Upper and lower bounds; Quadratic function; Quadratic programming; Mathematical optimization; Nonlinear system; Computer science; Mathematical analysis","score_opus":0.12424349566759454,"score_gpt":0.39427121713691393,"score_spread":0.2700277214693194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200189330","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.3926018,0.10008007,0.21485434,0.0768369,0.0004335843,0.018642668,0.0006527063,0.0011097076,0.19478823],"genre_scores_gemma":[0.9825804,0.0070620477,0.007925372,0.000022494936,0.000031515792,0.00030464918,0.000072962604,0.000023089047,0.001977445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990319,0.00012212644,0.000308894,0.00011771693,0.00025051885,0.00016887112],"domain_scores_gemma":[0.9982215,0.00018627191,0.000016933769,0.00020621154,0.0013192963,0.000049750164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006494521,0.00006359022,0.000101807374,0.00011608409,0.00029930184,0.000091044094,0.000116479,0.00005125157,0.000039219718],"category_scores_gemma":[0.00010479227,0.00005281261,0.000023715385,0.0008609913,0.00008247365,0.00014595623,0.000051957777,0.0001541023,0.000010842159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006223484,0.00012512943,0.00010194236,0.00050031015,0.000069797854,8.1144185e-7,0.0011649878,0.8367328,0.051635895,0.10135517,0.0019116206,0.006395283],"study_design_scores_gemma":[0.0002635527,0.00012338028,0.00027770485,0.0001595685,0.000009635222,0.0000070477367,0.00047447623,0.89401263,0.07891929,0.0018764847,0.023710685,0.00016554813],"about_ca_topic_score_codex":0.000011340323,"about_ca_topic_score_gemma":0.000066368164,"teacher_disagreement_score":0.58997864,"about_ca_system_score_codex":0.0000062522963,"about_ca_system_score_gemma":0.00012896518,"threshold_uncertainty_score":0.23020181},"labels":[],"label_agreement":null},{"id":"W3204830974","doi":"10.33423/jabe.v22i5.3051","title":"The Economic Value Added of Augmented Reality in the Packing Process","year":2020,"lang":"en","type":"article","venue":"Journal of Applied Business and Economics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Augmented reality; Process (computing); Value (mathematics); Investment (military); Throughput; Business; Industrial organization; Computer science; Artificial intelligence; Machine learning","score_opus":0.016811211110584794,"score_gpt":0.21022537666859373,"score_spread":0.19341416555800894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204830974","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.9925837,0.0001562959,0.0012996065,0.0018239531,0.0001846448,0.00014031674,0.0000064063497,0.000010225166,0.0037948862],"genre_scores_gemma":[0.99856186,0.0010553806,0.00013675512,0.00013386909,0.00009767045,0.0000021386177,0.0000015279627,0.0000100660445,7.3468414e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943036,0.0000075623325,0.00039408263,0.000053115873,0.000029299203,0.00008555775],"domain_scores_gemma":[0.99962646,0.000058777478,0.00019313133,0.00006639542,0.00002722856,0.000027996053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033562857,0.00007260924,0.00017070906,0.000028289684,0.00004244481,0.00006221577,0.00014996446,0.000033419652,0.000005560859],"category_scores_gemma":[0.000008715797,0.000047386075,0.00002425643,0.00007768821,0.000029817844,0.00008968301,0.000012165183,0.00011292256,8.552794e-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.00005494797,0.0000052892074,0.0002950269,0.000070966205,0.000025974248,4.2417724e-7,0.0010627997,0.99223024,0.00004371893,0.0030525099,0.00014532522,0.0030127906],"study_design_scores_gemma":[0.0029031576,0.00006552967,0.020618074,0.00011422436,0.00007491402,0.000043173455,0.0041146223,0.94561714,0.0012964581,0.0075354273,0.017208252,0.00040904482],"about_ca_topic_score_codex":0.000005114041,"about_ca_topic_score_gemma":0.000012551254,"teacher_disagreement_score":0.046613105,"about_ca_system_score_codex":0.000029882547,"about_ca_system_score_gemma":0.000040266274,"threshold_uncertainty_score":0.19323482},"labels":[],"label_agreement":null},{"id":"W3207167197","doi":"10.1007/s10696-022-09464-9","title":"Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups","year":2022,"lang":"en","type":"article","venue":"Flexible Services and Manufacturing Journal","topic":"Optimization and Packing Problems","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Sizing; Sequence (biology); Bin packing problem; Bin; Process (computing); Computer science; Mathematical optimization; Order (exchange); Integer (computer science); Algorithm; Production (economics); Polynomial; Mathematics","score_opus":0.03453605064484452,"score_gpt":0.2252584381226976,"score_spread":0.19072238747785308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207167197","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.90956837,0.0018106799,0.086821444,0.00034277726,0.00018444048,0.00062421674,0.00003739218,0.0002528072,0.00035787214],"genre_scores_gemma":[0.98883635,0.00038639831,0.010437997,0.000059250924,0.00007703157,0.0000438282,0.000029112385,0.00004019064,0.000089814515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991224,0.00002069215,0.00021705852,0.00019095799,0.00016914318,0.00027977116],"domain_scores_gemma":[0.99964106,0.000036947175,0.000102959646,0.00007800238,0.000023137844,0.000117870106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029784624,0.00017634705,0.00016834374,0.00016282588,0.0009283313,0.0003263444,0.000074575306,0.000041454277,0.000024646792],"category_scores_gemma":[9.820526e-7,0.00015694111,0.000024129171,0.00006491067,0.000020966194,0.0004283604,0.00007579968,0.00025620253,2.3336386e-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.00006580656,0.000017878581,0.001004641,0.00084118365,0.000112033194,0.00000473533,0.0027740053,0.9843546,0.0005756203,0.00029211267,0.000014559801,0.0099428035],"study_design_scores_gemma":[0.0016682909,0.00022359905,0.0014160913,0.00018441591,0.00008517353,0.0008020523,0.0016968143,0.9873707,0.0012081576,0.0016159528,0.0033286472,0.00040005846],"about_ca_topic_score_codex":0.000035326655,"about_ca_topic_score_gemma":0.00006489399,"teacher_disagreement_score":0.07926801,"about_ca_system_score_codex":0.00006154517,"about_ca_system_score_gemma":0.0000188592,"threshold_uncertainty_score":0.7140068},"labels":[],"label_agreement":null},{"id":"W4206840312","doi":"10.22541/au.162689776.68468798/v1","title":"On the P-formulation and the Split-Fraction-Formulation for the Generalized Pooling Problem","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pooling; Fraction (chemistry); Mathematics; Mathematical optimization; Node (physics); Applied mathematics; Computer science; Engineering; Chemistry; Chromatography; Artificial intelligence","score_opus":0.024144287538394933,"score_gpt":0.24492653816329124,"score_spread":0.22078225062489631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206840312","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.02340762,0.0010403747,0.9521998,0.007313586,0.0012810741,0.004196342,0.000019244331,0.00044655267,0.0100953765],"genre_scores_gemma":[0.9858526,0.000827534,0.010889976,0.000616124,0.00025134912,0.0005289509,0.00019364683,0.00005944851,0.0007803579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902564,0.000067967434,0.00033960797,0.00021093439,0.000186769,0.00016906096],"domain_scores_gemma":[0.9983178,0.0009796547,0.0001192474,0.00043620667,0.00012332549,0.000023811439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007647401,0.0002245063,0.00019983044,0.00004650835,0.00039587377,0.0004797587,0.00017347888,0.00017821393,0.00013720384],"category_scores_gemma":[0.000097715674,0.00010544417,0.00013513118,0.00011053428,0.000022334298,0.00009799303,0.000090682275,0.00040469624,0.0000040362224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027805674,0.000003994398,0.000013718564,0.00008486573,0.000092631155,4.1071363e-8,0.00053079374,0.86034006,0.000020746804,0.13620307,0.0005655597,0.0021167325],"study_design_scores_gemma":[0.00064290705,0.0000054462084,0.00022589676,0.000079511694,0.0000732242,0.000001762321,0.00009989678,0.9815755,0.0001634287,0.014089676,0.0028850287,0.00015772723],"about_ca_topic_score_codex":0.0000853229,"about_ca_topic_score_gemma":0.000051669544,"teacher_disagreement_score":0.962445,"about_ca_system_score_codex":0.000059764647,"about_ca_system_score_gemma":0.000027950737,"threshold_uncertainty_score":0.4626324},"labels":[],"label_agreement":null},{"id":"W4211002993","doi":"10.1145/3490422.3502328","title":"MAQO: A Scalable Many-Core Annealer for Quadratic Optimization on a Stratix 10 FPGA","year":2022,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Field-programmable gate array; Parallel computing; Benchmark (surveying); Stratix; Solver; Block (permutation group theory); Optimization problem; Quadratic programming; Embedded system; Mathematical optimization; Algorithm; Mathematics","score_opus":0.02676493419169152,"score_gpt":0.23591097375991668,"score_spread":0.20914603956822517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211002993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022746986,0.00007080617,0.8987432,0.00033818718,0.000552977,0.0009367339,0.000067341854,0.0008633412,0.09615269],"genre_scores_gemma":[0.77333504,0.000055647626,0.13413697,0.0013946585,0.0001912379,0.0011569202,0.0006455592,0.00022211208,0.08886184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926215,0.0000151238055,0.0001951658,0.0001599606,0.00016646042,0.00020116266],"domain_scores_gemma":[0.99966717,0.000042358726,0.00002605312,0.00017340538,0.000041219955,0.000049787555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012988687,0.00012566366,0.00011742424,0.00009482371,0.00017828727,0.000060998038,0.00010427955,0.00004375313,0.00931004],"category_scores_gemma":[0.000009363646,0.00012961461,0.00004650388,0.00023723429,0.000008204523,0.00009235359,0.000014307934,0.000107773434,0.000058419722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001612055,0.000033358825,0.000013031056,0.0000509247,0.000014720188,7.4670044e-7,0.00013592474,0.96285063,0.000041490897,0.003011708,0.033315208,0.00051611225],"study_design_scores_gemma":[0.00046118203,0.00015556382,0.000010349918,0.000008462001,0.000008620906,0.0000028574339,0.000101286845,0.9765464,0.00022328447,0.00015122397,0.02216322,0.0001675652],"about_ca_topic_score_codex":0.000004285128,"about_ca_topic_score_gemma":0.000005449821,"teacher_disagreement_score":0.77106035,"about_ca_system_score_codex":0.000053811575,"about_ca_system_score_gemma":0.000016945654,"threshold_uncertainty_score":0.99159557},"labels":[],"label_agreement":null},{"id":"W4212808426","doi":"10.1016/j.ejor.2022.02.023","title":"A cutting plane method and a parallel algorithm for packing rectangles in a circular container","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Container (type theory); Computer science; Plane (geometry); Packing problems; Cutting-plane method; Algorithm; Parallel computing; Mathematics; Geometry; Integer programming; Engineering; Mechanical engineering","score_opus":0.06984326805810465,"score_gpt":0.3457003689317104,"score_spread":0.27585710087360577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212808426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015826805,0.0019643633,0.97639203,0.0009330367,0.00019545697,0.00038852086,0.00003387445,0.000024896739,0.0042410293],"genre_scores_gemma":[0.6546892,0.00018006956,0.34433568,0.0001260359,0.0002720217,0.000024745334,0.000027709197,0.00006262186,0.0002819138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982564,0.00075892167,0.0003141292,0.00009264952,0.00039481474,0.00018307894],"domain_scores_gemma":[0.99929345,0.00035372897,0.000037775215,0.000052196345,0.0001987293,0.000064113854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006269362,0.00006460291,0.00012124873,0.00030194697,0.00020752505,0.00010089018,0.00012949991,0.000009742806,0.00008964441],"category_scores_gemma":[0.00022464625,0.000062567655,0.00003192813,0.00022221856,0.0000182083,0.00011163756,0.000054041622,0.00044988914,0.0000015446407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055380522,0.000039268663,0.00044935776,0.00004026442,0.000057394718,0.00023906413,0.002111887,0.93657655,0.0027679938,0.0012434635,0.0024387373,0.05398065],"study_design_scores_gemma":[0.0021458261,0.00040921546,0.0010130622,0.000082280465,0.000005769053,0.0005402322,0.0008196651,0.94170195,0.000119561504,0.00038055636,0.052618753,0.00016311526],"about_ca_topic_score_codex":0.0000023026782,"about_ca_topic_score_gemma":0.0000011467492,"teacher_disagreement_score":0.63886243,"about_ca_system_score_codex":0.000083000494,"about_ca_system_score_gemma":0.00006261958,"threshold_uncertainty_score":0.2551435},"labels":[],"label_agreement":null},{"id":"W4213130510","doi":"10.1287/ijoc.2021.1079","title":"Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Production planning; Computer science; Lagrangian relaxation; Set (abstract data type); Decomposition; Cutting stock problem; Decomposition method (queueing theory); Benders' decomposition; Process (computing); Production (economics); Optimization problem; Mathematics","score_opus":0.024886558111781133,"score_gpt":0.27810083034158867,"score_spread":0.2532142722298075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213130510","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.20083359,0.00011070223,0.7951526,0.00045292423,0.0012930041,0.0006398772,0.0000065479176,0.00036111407,0.0011496622],"genre_scores_gemma":[0.9954966,0.000005078301,0.0040677036,0.00020589776,0.00009981148,0.00001814655,0.000074784046,0.00002007618,0.0000119112865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921364,0.00001852794,0.00031890388,0.00010264958,0.00017074661,0.00017550927],"domain_scores_gemma":[0.999592,0.000047984304,0.00015323448,0.00004764928,0.00010742081,0.000051686216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043546088,0.00011969973,0.0001126462,0.00020291292,0.00060011866,0.00015737185,0.00006834779,0.00003385019,0.000017349557],"category_scores_gemma":[0.000034712622,0.00010885091,0.00003232152,0.00019347522,0.00001243695,0.00019393086,0.000008503144,0.00034999428,7.7338734e-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.00003536878,0.000013491177,0.00021388225,0.000080248006,0.000016522297,0.0000010134935,0.0008697738,0.9853502,0.0002960381,0.00016344416,0.00027497817,0.012685034],"study_design_scores_gemma":[0.0006290772,0.00026803452,0.00011576107,0.00014350665,0.000008356847,0.0001074324,0.0005548199,0.9941609,0.001127485,0.00045127812,0.0022674254,0.00016592795],"about_ca_topic_score_codex":6.504682e-7,"about_ca_topic_score_gemma":3.0591136e-7,"teacher_disagreement_score":0.794663,"about_ca_system_score_codex":0.00012179034,"about_ca_system_score_gemma":0.000038114016,"threshold_uncertainty_score":0.46156883},"labels":[],"label_agreement":null},{"id":"W4214769751","doi":"10.1142/s0218213022500233","title":"Responsive Mixed-initiative System for Reoptimization of Mixed-integer Programming","year":2022,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Integer programming; Mathematical optimization; Constraint (computer-aided design); Operations research; Linear programming; Kernel (algebra); Integer (computer science); Software; Decision support system; Order (exchange); Optimization problem; Industrial engineering; Artificial intelligence; Algorithm; Operating system","score_opus":0.06057148518930872,"score_gpt":0.29722372583596246,"score_spread":0.23665224064665374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214769751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009028829,0.00012739496,0.98458534,0.0003458667,0.004819437,0.00033127764,0.0001362413,0.0000711381,0.0005544785],"genre_scores_gemma":[0.9814908,0.00002927125,0.01804156,0.00003206132,0.0002616685,0.000041870946,0.0000371309,0.00003136817,0.0000342951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802727,0.00010774395,0.0010221718,0.00012086916,0.0005543071,0.00016761989],"domain_scores_gemma":[0.99756813,0.00042718134,0.0005224784,0.00010237459,0.0013208361,0.000058970047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008438969,0.0001364305,0.0002516178,0.00042538976,0.000095889474,0.00010058825,0.00045399106,0.000049223938,0.00013103642],"category_scores_gemma":[0.00041202735,0.00014221846,0.00019219283,0.0002806558,0.000047345744,0.00033856576,0.000055435037,0.00023690442,0.0000056109916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033358883,0.00006824809,0.000028853832,0.00003706978,0.000183406,0.000015151419,0.001038844,0.9189067,0.0010507004,0.013862883,0.0005220924,0.06395249],"study_design_scores_gemma":[0.00038731363,0.0010281194,0.000056205667,0.00044067483,0.00011395635,0.00030589075,0.01320958,0.7812316,0.18148395,0.003924498,0.017290477,0.0005277371],"about_ca_topic_score_codex":0.0000034457041,"about_ca_topic_score_gemma":0.0000045334687,"teacher_disagreement_score":0.97246194,"about_ca_system_score_codex":0.0002819168,"about_ca_system_score_gemma":0.00010459917,"threshold_uncertainty_score":0.57995003},"labels":[],"label_agreement":null},{"id":"W4220659795","doi":"10.1287/trsc.2022.1135","title":"A Branch-and-Price-and-Cut Algorithm for the Vehicle Routing Problem with Two-Dimensional Loading Constraints","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Branch and cut; Benchmark (surveying); Mathematical optimization; Relaxation (psychology); Constraint (computer-aided design); Algorithm; Routing (electronic design automation); Mathematics; Computer science; Integer programming","score_opus":0.012942038828167668,"score_gpt":0.2336807899293657,"score_spread":0.22073875110119803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220659795","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.3306176,0.00018394357,0.6666357,0.00046945963,0.00021718573,0.0008234405,0.00007898203,0.0002570018,0.00071672036],"genre_scores_gemma":[0.979418,0.000004638279,0.020340713,0.00010959362,0.000009650765,0.000061871346,0.000008547838,0.000010556629,0.000036457906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992592,0.0000073928923,0.00013611572,0.00017259695,0.00024970746,0.00017501025],"domain_scores_gemma":[0.9997015,0.00009686301,0.00003491729,0.000063401996,0.000052384006,0.000050951796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048564313,0.00007418099,0.00006850871,0.000056247627,0.00061437336,0.000058315916,0.00009396613,0.000009227875,0.000046410292],"category_scores_gemma":[0.00000402748,0.00005813987,0.000013007066,0.00037855664,0.0002253211,0.00018421074,0.000005190168,0.000093182614,6.0376277e-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.0000068199092,0.000007445117,0.0015419088,0.000019822439,0.000011391735,0.0000011090423,0.0032360042,0.95432377,0.003591883,0.0030114036,0.000012404611,0.03423602],"study_design_scores_gemma":[0.0007113235,0.0000398405,0.0053133857,0.000017874001,0.000016593429,0.000014292728,0.0003027909,0.992002,0.0010091305,0.00018904367,0.0002492236,0.00013447976],"about_ca_topic_score_codex":0.000012375204,"about_ca_topic_score_gemma":0.000013462476,"teacher_disagreement_score":0.6488004,"about_ca_system_score_codex":0.000021828993,"about_ca_system_score_gemma":0.00004924793,"threshold_uncertainty_score":0.47253254},"labels":[],"label_agreement":null},{"id":"W4225709049","doi":"10.1613/jair.1.14820","title":"Online Bin Packing with Predictions","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Fondation Mathématique Jacques Hadamard; Agence Nationale de la Recherche","keywords":"Bin; Bin packing problem; Computer science; Mathematics; Econometrics; Mathematical optimization; Operations research; Algorithm","score_opus":0.15218081344579817,"score_gpt":0.377014528607602,"score_spread":0.2248337151618038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225709049","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.30412358,0.0011891737,0.68244004,0.0029081136,0.0021418591,0.00053299044,0.00007352201,0.00023160818,0.00635914],"genre_scores_gemma":[0.9962563,0.00019078147,0.0031259214,0.000015112539,0.00024304166,0.000006366417,0.0000039760425,0.000024289375,0.00013423763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983382,0.0001349085,0.0003881273,0.00007918027,0.00079220126,0.00026736243],"domain_scores_gemma":[0.9991752,0.00015492296,0.00005998605,0.00012163959,0.00038208492,0.00010619014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014020725,0.00006932049,0.000120435165,0.0005184691,0.00032457273,0.000077657314,0.00026404439,0.000025770765,0.0008010016],"category_scores_gemma":[0.0000881457,0.000059783568,0.000046910853,0.0010701821,0.00007621853,0.00014181262,0.000053005995,0.0010014198,0.000015560146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044294768,0.00013093418,0.0001322723,0.000012829148,0.00003259322,0.000033400684,0.00081200537,0.9749563,0.0011372194,0.001245656,0.0010360897,0.02042646],"study_design_scores_gemma":[0.000099628516,0.0016462102,0.00014984206,0.00012416183,0.00002067624,0.00039391013,0.011986514,0.93537736,0.011493909,0.005413688,0.033029903,0.00026418094],"about_ca_topic_score_codex":0.000011020691,"about_ca_topic_score_gemma":0.000030099998,"teacher_disagreement_score":0.6921327,"about_ca_system_score_codex":0.00015839747,"about_ca_system_score_gemma":0.000120618126,"threshold_uncertainty_score":0.8770406},"labels":[],"label_agreement":null},{"id":"W4233354264","doi":"10.1007/0-387-28356-0_6","title":"Tabu Search","year":2006,"lang":"la","type":"book-chapter","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":60,"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; Computer Research Institute of Montréal","funders":"","keywords":"Tabu search; GRASP; Computer science; Guided Local Search; Heuristic; Focus (optics); Management science; Algorithm; Artificial intelligence; Engineering; Software engineering","score_opus":0.02204604703353505,"score_gpt":0.21452116375252758,"score_spread":0.19247511671899253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233354264","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005129276,0.00048152567,0.046662603,0.00013298965,0.0006381216,0.00024208329,0.00003970168,0.00043319105,0.95136464],"genre_scores_gemma":[0.01004711,0.00071784656,0.005828127,0.000111511115,0.00038739204,0.0000035388737,0.00023543734,0.00019541735,0.9824736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985809,0.000009559354,0.00039766193,0.00032426207,0.00031445632,0.0003731863],"domain_scores_gemma":[0.9992898,0.00004753025,0.000042664335,0.00039273812,0.00010118182,0.00012605973],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013587002,0.0004194097,0.00034445684,0.0002148405,0.000084081956,0.00012760735,0.0001959105,0.0005194076,0.027355548],"category_scores_gemma":[0.0000033404763,0.00043491952,0.00015997836,0.000053250413,0.000056268025,0.000067516514,0.0000605671,0.00055445044,0.005332084],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003043545,0.00001154057,0.000048610033,0.00025033898,0.00010038171,0.000018557263,0.000065400774,0.60097426,0.000033310145,0.36529207,0.029262718,0.0039397734],"study_design_scores_gemma":[0.00031695922,0.00003145942,0.00003647776,0.00022616978,0.000044821845,0.000011142257,0.000005071333,0.09124882,0.00012533371,0.00067211955,0.9065389,0.0007427065],"about_ca_topic_score_codex":0.00015805122,"about_ca_topic_score_gemma":0.00003357094,"teacher_disagreement_score":0.8772762,"about_ca_system_score_codex":0.0000728501,"about_ca_system_score_gemma":0.00003396159,"threshold_uncertainty_score":0.9998103},"labels":[],"label_agreement":null},{"id":"W4238973496","doi":"10.7287/peerj.preprints.27434","title":"A local search algorithm for the constrained max cut problem on hypergraphs.","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maximum cut; Combinatorics; Disjoint sets; Mathematics; Cardinality (data modeling); Hypergraph; Partition (number theory); Approximation algorithm; Integer (computer science); Local search (optimization); Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.02488506606751511,"score_gpt":0.2558612088613268,"score_spread":0.23097614279381168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238973496","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.00002924586,0.00010298168,0.9522383,0.00040915873,0.0007835119,0.0012637101,0.00012384646,0.00058515393,0.044464063],"genre_scores_gemma":[0.28046748,0.0011510986,0.697169,0.0013727765,0.0013715612,0.0017641807,0.0007272607,0.0005214608,0.015455164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988388,0.00002488178,0.00026475513,0.0003139251,0.00021516977,0.00034248258],"domain_scores_gemma":[0.99913156,0.00017107365,0.000030203553,0.00043498038,0.00014940082,0.00008279939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031161995,0.00028980008,0.0002401082,0.00011812511,0.0001122105,0.0001340457,0.00034024674,0.0002972372,0.00042254795],"category_scores_gemma":[0.000007699447,0.00020322444,0.00016185066,0.00012012201,0.00017627883,0.000023644685,0.00011606598,0.00048289026,0.000082765815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008293887,0.000026718051,0.0000051226734,0.0002621894,0.0002200999,0.000001160217,0.00023009803,0.82977,0.0000069199277,0.002082802,0.017590368,0.14979619],"study_design_scores_gemma":[0.00035611299,0.000068041416,0.000005738058,0.000116276795,0.000030146108,0.0000050692665,0.00005785859,0.9765364,0.00052061066,0.0010435715,0.020979516,0.00028063712],"about_ca_topic_score_codex":0.000030324702,"about_ca_topic_score_gemma":0.000019155961,"teacher_disagreement_score":0.2804382,"about_ca_system_score_codex":0.00005237708,"about_ca_system_score_gemma":0.00007406988,"threshold_uncertainty_score":0.8287252},"labels":[],"label_agreement":null},{"id":"W4256731050","doi":"10.1002/jgt.20161","title":"The <i>k</i>‐piece packing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Degree (music); Discrete mathematics; Matching (statistics); Time complexity","score_opus":0.0032558662240646835,"score_gpt":0.17592902342813926,"score_spread":0.17267315720407458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256731050","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.10963771,0.03379799,0.43693662,0.0019787524,0.006442237,0.0006049149,0.000010684621,0.0007155335,0.40987557],"genre_scores_gemma":[0.996023,0.0005300508,0.0025939497,0.00006233081,0.00024366209,0.0000014655988,6.965511e-7,0.000028734103,0.00051610096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928194,0.000057897214,0.00031892877,0.000037923855,0.00015096988,0.00015235755],"domain_scores_gemma":[0.9995003,0.00015970923,0.000120450604,0.00010082583,0.00008406216,0.00003469663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086055684,0.000083360945,0.00010380337,0.00008831951,0.00012017042,0.0000787409,0.00016841033,0.00003832669,0.00002562346],"category_scores_gemma":[0.000016419444,0.000053383203,0.00010567624,0.00018801063,0.000048625618,0.000116196075,0.0000082872675,0.0002038328,0.0000071177888],"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.00006396219,0.00004941298,0.0018456207,0.000064714775,0.00017797817,0.000023319566,0.0004923462,0.57402736,0.0032847056,0.36196938,0.034583658,0.023417557],"study_design_scores_gemma":[0.0010684375,0.000118494914,0.0019195462,0.00023499994,0.00007875309,0.00028614988,0.00027142177,0.003285674,0.0040081292,0.76838845,0.21994567,0.00039429136],"about_ca_topic_score_codex":9.2906305e-7,"about_ca_topic_score_gemma":0.0000036729386,"teacher_disagreement_score":0.8863853,"about_ca_system_score_codex":0.000016708926,"about_ca_system_score_gemma":0.000011813926,"threshold_uncertainty_score":0.21769038},"labels":[],"label_agreement":null},{"id":"W4285213635","doi":"10.1007/978-3-030-95380-5_8","title":"Workload Balancing at Cross-Docking Platforms","year":2022,"lang":"en","type":"book-chapter","venue":"AIRO Springer series/AIRO Springer Series","topic":"Optimization and Packing Problems","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":"HEC Montréal","funders":"","keywords":"Workload; Truck; Container (type theory); Computer science; Integer programming; Operations research; Engineering; Operating system; Automotive engineering; Algorithm","score_opus":0.012482123896407375,"score_gpt":0.2071204750982882,"score_spread":0.19463835120188083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285213635","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015836565,0.011104929,0.0008589148,0.00034224347,0.011735285,0.0017218919,0.00033375956,0.0069595575,0.95110685],"genre_scores_gemma":[0.07375114,0.012443809,0.005775051,0.0005236483,0.0019480983,0.0004001186,0.0005152949,0.002193858,0.902449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938967,0.000024448957,0.0016656726,0.0015181236,0.001242599,0.0016524273],"domain_scores_gemma":[0.9966989,0.00012033398,0.00056405866,0.001914845,0.00020011674,0.00050171354],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.00050738495,0.0019492069,0.0016050648,0.0006814137,0.001284365,0.0006532498,0.0011922345,0.0010199556,0.01456946],"category_scores_gemma":[0.00005479189,0.0022314454,0.00070859614,0.00032192536,0.00044556393,0.0020062074,0.0016041256,0.0021545044,0.00082941167],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014395362,0.00018751265,0.017390525,0.0066889715,0.004129757,0.0016808524,0.010202728,0.6415026,0.0027045708,0.2761227,0.019057453,0.018892758],"study_design_scores_gemma":[0.00079382065,0.00018713986,0.0011612508,0.0008931146,0.0001704329,0.00025859178,0.00007591131,0.0007825664,0.0024431488,0.0018438186,0.98829067,0.0030995654],"about_ca_topic_score_codex":0.000042214484,"about_ca_topic_score_gemma":0.00026729336,"teacher_disagreement_score":0.9692332,"about_ca_system_score_codex":0.0013203269,"about_ca_system_score_gemma":0.0001468774,"threshold_uncertainty_score":0.99994856},"labels":[],"label_agreement":null},{"id":"W4285286335","doi":"10.5267/j.ijiec.2022.1.002","title":"A hybrid matheuristic approach for the vehicle routing problem with three-dimensional loading constraints","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Column generation; Mathematical optimization; GRASP; Benchmark (surveying); Set (abstract data type); Bin packing problem; Heuristic; Computer science; Greedy algorithm; Packing problems; Greedy randomized adaptive search procedure; Heuristics; Set packing; Path (computing); Constructive; Container (type theory); Routing (electronic design automation); Mathematics; Algorithm; Process (computing); Bin; Engineering","score_opus":0.026621235433590133,"score_gpt":0.22915943037785697,"score_spread":0.20253819494426684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285286335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012881977,0.000067862704,0.9847818,0.0003356525,0.0013463675,0.00029027482,0.00007074078,0.00008786071,0.0001374907],"genre_scores_gemma":[0.96463567,0.0000012745652,0.034799237,0.000033546024,0.00040980443,0.000034288965,0.000039567763,0.000034971683,0.000011640929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890345,0.000017989682,0.00040811504,0.00009108967,0.00042204012,0.00015730059],"domain_scores_gemma":[0.999088,0.00037196046,0.0001647535,0.00006436335,0.00025626353,0.000054678243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004088439,0.00012607947,0.00014571016,0.00019354041,0.00018159476,0.00010325316,0.0003363293,0.000025607234,0.000051896764],"category_scores_gemma":[0.00006483386,0.00010365644,0.00008616971,0.0001627073,0.000031786225,0.00011426487,0.000044342745,0.00044845243,7.178421e-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.000033641103,0.00003191337,0.00009929146,0.0000051254447,0.0002811551,0.000009431123,0.00011343701,0.9939606,0.00009646316,0.001441249,0.0007989281,0.0031287454],"study_design_scores_gemma":[0.0013140712,0.00007689105,0.000035754216,0.000044806926,0.000040530875,0.00043424114,0.00005563969,0.9962547,0.00007040835,0.00011260774,0.0014382853,0.00012206158],"about_ca_topic_score_codex":0.000004085419,"about_ca_topic_score_gemma":3.410515e-7,"teacher_disagreement_score":0.9517537,"about_ca_system_score_codex":0.00016301747,"about_ca_system_score_gemma":0.00010390876,"threshold_uncertainty_score":0.4226987},"labels":[],"label_agreement":null},{"id":"W4292448915","doi":"10.3389/fmech.2022.966691","title":"Two-dimensional irregular packing problems: A review","year":2022,"lang":"en","type":"review","venue":"Frontiers in Mechanical Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Yanshan University; National Natural Science Foundation of China","keywords":"Packing problems; Automotive industry; Aerospace; Shipbuilding; Computer science; Variety (cybernetics); Domain (mathematical analysis); Clothing; Field (mathematics); Manufacturing engineering; Engineering; Industrial engineering; Mathematics; Algorithm; Aerospace engineering; Artificial intelligence; Geography","score_opus":0.024294282309447093,"score_gpt":0.25088379353047546,"score_spread":0.22658951122102838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292448915","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.0722266e-8,0.9606453,0.03386881,0.000010717547,0.0033297099,0.001092254,0.000027232776,0.0006786226,0.0003473016],"genre_scores_gemma":[6.19206e-7,0.9669608,0.031644557,0.000062592364,0.00012571762,0.00059970206,0.0002493642,0.00028488913,0.000071753566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970403,0.00011760021,0.0011500552,0.0005576354,0.00047082268,0.00066360016],"domain_scores_gemma":[0.9989986,0.00011985595,0.00013272227,0.0005497695,0.000018392613,0.00018070311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008151853,0.00072793383,0.0021995252,0.0005530138,0.000059468613,0.000045825003,0.0005740339,0.00029495746,0.0004921113],"category_scores_gemma":[0.0001419035,0.00075918704,0.00051731174,0.0012716021,0.000013174636,0.00012710817,0.00019074148,0.0015366249,0.000025506091],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.0274374e-7,0.000020586749,1.5544298e-7,0.07327042,0.00016694979,0.00004039448,0.000012965692,0.5523798,5.994069e-7,0.00030255018,0.0058175796,0.3679874],"study_design_scores_gemma":[0.00016914382,0.000012683562,1.5470462e-8,0.041035406,0.00020407022,0.00004451131,0.0000018429581,0.16195078,4.6780542e-7,0.000044358363,0.7958983,0.0006384152],"about_ca_topic_score_codex":0.0000022274585,"about_ca_topic_score_gemma":6.7425947e-7,"teacher_disagreement_score":0.7900807,"about_ca_system_score_codex":0.0006025907,"about_ca_system_score_gemma":0.00008007547,"threshold_uncertainty_score":0.9994859},"labels":[],"label_agreement":null},{"id":"W4292737938","doi":"10.1287/ijoc.2022.1223","title":"A Branch-and-Price Algorithm for the Multiple Knapsack Problem","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval; Université de Montréal","funders":"","keywords":"Knapsack problem; Lagrangian relaxation; Mathematical optimization; Cutting stock problem; Combinatorial optimization; Mathematics; Change-making problem; Relaxation (psychology); Branch and bound; Continuous knapsack problem; Algorithm; Decomposition; Integer programming; Computer science; Optimization problem","score_opus":0.013633431592749714,"score_gpt":0.2242847312225913,"score_spread":0.21065129962984158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292737938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055933944,0.00037426339,0.98904413,0.000348952,0.0011348984,0.00038623097,0.000011226648,0.00018831513,0.0029185896],"genre_scores_gemma":[0.9454662,0.00009130318,0.052719586,0.0009786714,0.00041839058,0.000023279861,0.000007301979,0.000049971026,0.00024526674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992304,0.000012057773,0.0002788517,0.000066942,0.00018171818,0.00023006253],"domain_scores_gemma":[0.9994079,0.0003162511,0.00009289326,0.000081741484,0.000040868923,0.000060331327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560972,0.00010591989,0.000107261636,0.000079161204,0.0007818107,0.0001609574,0.00017281415,0.00002256734,0.00004250157],"category_scores_gemma":[0.000024898307,0.000075317446,0.00006376677,0.00016031596,0.000012643946,0.0000947074,0.00006528643,0.0004453474,0.00000475824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040396444,0.000005445495,0.00008397119,0.000012379526,0.000028799135,8.9030686e-7,0.0006506743,0.73419994,0.000008074021,0.00014608384,0.0009907403,0.263869],"study_design_scores_gemma":[0.00060238806,0.00007563988,0.00012385927,0.000021346968,0.000005639659,0.00016514983,0.00011274909,0.87980205,0.00002659845,0.00016411461,0.11879502,0.00010541697],"about_ca_topic_score_codex":0.0000018632899,"about_ca_topic_score_gemma":4.754221e-7,"teacher_disagreement_score":0.93987286,"about_ca_system_score_codex":0.000064400054,"about_ca_system_score_gemma":0.000019088995,"threshold_uncertainty_score":0.60131353},"labels":[],"label_agreement":null},{"id":"W4293203540","doi":"10.1007/978-3-031-08011-1_17","title":"Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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 Toronto","funders":"","keywords":"Computer science; Integer programming; Cutting stock problem; Mathematical optimization; Scheduling (production processes); Constraint programming; Linear programming; Constraint (computer-aided design); Job shop scheduling; Algorithm; Optimization problem; Mathematics; Stochastic programming; Operating system","score_opus":0.035354685620466335,"score_gpt":0.2604574626300776,"score_spread":0.22510277700961123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293203540","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.00016925408,0.0002490057,0.99440557,0.00014868038,0.00077706215,0.0008766702,0.000020994314,0.00044834008,0.0029044296],"genre_scores_gemma":[0.076467454,0.000012376887,0.9225786,0.0005072482,0.00021120414,0.000023367205,0.000039675506,0.00012209723,0.00003802044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704236,0.00001712624,0.000585752,0.000879381,0.0006885554,0.0007868489],"domain_scores_gemma":[0.9988749,0.00016427609,0.0001695592,0.00044957735,0.00013033467,0.00021133981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006544575,0.0005361567,0.0004949004,0.00060761033,0.00043014812,0.0004994805,0.0007879992,0.00020263801,0.00017438155],"category_scores_gemma":[0.000044515527,0.0005947609,0.00010323119,0.00063112867,0.00027205434,0.0002177363,0.0004939256,0.0010077213,0.000008428876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016611805,0.000008287247,0.00002746542,0.00009213043,0.000014761518,0.000012196391,0.0009950054,0.81085324,0.0007587871,0.00074430066,0.000015513224,0.18647663],"study_design_scores_gemma":[0.0001960954,0.000079060475,0.0000019016068,0.00059720466,0.000014112187,0.000060830644,0.0000022403908,0.9829354,0.0003146219,0.0015156359,0.013521436,0.0007614203],"about_ca_topic_score_codex":0.000024029667,"about_ca_topic_score_gemma":0.000019648292,"teacher_disagreement_score":0.1857152,"about_ca_system_score_codex":0.00057681213,"about_ca_system_score_gemma":0.00020513014,"threshold_uncertainty_score":0.99965036},"labels":[],"label_agreement":null},{"id":"W4293252885","doi":"10.5267/j.ijiec.2022.8.001","title":"Optimization of two-dimensional irregular bin packing problem considering slit distance and free rotation of pieces","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Equidistant; Bin; Bin packing problem; Rotation (mathematics); GRASP; Algorithm; Benchmark (surveying); Mathematical optimization; Slit; Enhanced Data Rates for GSM Evolution; Mathematics; Packing problems; Minification; Computer science; Geometry; Artificial intelligence; Physics; Optics","score_opus":0.019053878419038266,"score_gpt":0.2338035660172336,"score_spread":0.21474968759819532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252885","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.15596083,0.0004883055,0.8402102,0.00040820485,0.0023419631,0.00023578036,0.0001549499,0.000076293785,0.00012349061],"genre_scores_gemma":[0.9322037,0.000014364995,0.06755301,0.000008493492,0.0001482464,0.000005993373,0.00003603609,0.000024545367,0.0000055871706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998497,0.00004030432,0.00075599534,0.00009372454,0.0005083322,0.000104613195],"domain_scores_gemma":[0.9988633,0.00019729965,0.00039402625,0.00008268719,0.00040909855,0.000053617357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485233,0.00012418232,0.0002306807,0.00047509858,0.00005497647,0.000034811084,0.00023185163,0.00004281486,0.000059172376],"category_scores_gemma":[0.00015048566,0.00014334141,0.00007098144,0.00030494496,0.000029901288,0.00019104058,0.00007950566,0.00027059345,1.6473618e-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.00002258107,0.000033234493,0.00051745557,0.000023510664,0.00016126751,0.000005045625,0.0003537407,0.99489826,0.0009514978,0.0015786331,0.00017110468,0.0012836971],"study_design_scores_gemma":[0.001591117,0.00007126523,0.00007623948,0.0001998989,0.000029844685,0.000080896185,0.00007669656,0.99629706,0.0008277621,0.00032063393,0.0003066217,0.00012196627],"about_ca_topic_score_codex":0.000011726235,"about_ca_topic_score_gemma":0.0000017141645,"teacher_disagreement_score":0.7762429,"about_ca_system_score_codex":0.000107489715,"about_ca_system_score_gemma":0.00007666285,"threshold_uncertainty_score":0.5845293},"labels":[],"label_agreement":null},{"id":"W4294877966","doi":"10.1016/j.cor.2022.106014","title":"Two dimensional guillotine cutting stock and scheduling problem in printing industry","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Cutting stock problem; Scheduling (production processes); Computer science; Stock (firearms); Operations management; Operations research; Industrial engineering; Manufacturing engineering; Engineering drawing; Business; Mathematics; Engineering; Algorithm; Mechanical engineering; Optimization problem","score_opus":0.05376228923211648,"score_gpt":0.33716514598768865,"score_spread":0.2834028567555722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294877966","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.98487484,0.00026795614,0.011385487,0.00071097794,0.00022181847,0.0005502319,0.0000050287936,0.00018348717,0.0018001733],"genre_scores_gemma":[0.9171675,0.0000062155555,0.08238374,0.000051267634,0.000060196173,0.00009145312,0.00002493462,0.000026537873,0.00018818655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986752,0.00018244375,0.00025288595,0.00022892287,0.00033391206,0.00032663604],"domain_scores_gemma":[0.9995493,0.00011144303,0.000008838921,0.00015328403,0.00010086794,0.000076226905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011174323,0.00009475601,0.000108817425,0.00040159273,0.00064376666,0.00017719848,0.00017355061,0.000047743146,0.00010825263],"category_scores_gemma":[0.000047669328,0.00010931118,0.000015319458,0.0007804681,0.000040827206,0.00014837168,0.0004502454,0.001244038,0.0000062485574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017942572,0.000023972374,0.003869688,0.000021467842,0.000007989747,0.0000051204765,0.00063710706,0.9897323,0.0008186093,0.0009554173,0.00017116588,0.0037553401],"study_design_scores_gemma":[0.0004064482,0.0000260716,0.00074230204,0.000051561707,9.786928e-7,0.000015730091,0.00017153019,0.99764025,0.00011242944,0.00003920084,0.0006797814,0.00011372972],"about_ca_topic_score_codex":0.00007312559,"about_ca_topic_score_gemma":0.000025584077,"teacher_disagreement_score":0.070998244,"about_ca_system_score_codex":0.00013260159,"about_ca_system_score_gemma":0.00007327152,"threshold_uncertainty_score":0.54047954},"labels":[],"label_agreement":null},{"id":"W4298867261","doi":"","title":"Upper bounds and algorithms for the maximum cardinality bin packing problem","year":2003,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Packing Problems","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":"Université Laval","funders":"","keywords":"Bin packing problem; Cardinality (data modeling); Bin; Computer science; Algorithm; Combinatorics; Upper and lower bounds; Mathematics; Mathematical optimization; Database","score_opus":0.015038535181621192,"score_gpt":0.21803737786131414,"score_spread":0.20299884267969295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298867261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076931436,0.002012843,0.9265072,0.0031167457,0.0002282777,0.00057349954,0.000026827543,0.0003364593,0.059505057],"genre_scores_gemma":[0.8687708,0.00075498957,0.12657133,0.00009577083,0.00001710178,0.00011214895,0.00005491635,0.000056360197,0.0035666232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985013,0.00068186497,0.00021903521,0.00022213126,0.0001384026,0.0002372473],"domain_scores_gemma":[0.99812853,0.00077489304,0.000061023857,0.0005390001,0.00041944516,0.000077090845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031248808,0.00014251981,0.00014028254,0.00005287957,0.00036949973,0.00027680708,0.00021668429,0.00007409022,0.000050864106],"category_scores_gemma":[0.00032917658,0.00012232784,0.00007196853,0.00024230343,0.00009825438,0.00011409736,0.00004682915,0.00014358023,0.0000062989666],"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.000015792246,0.00034683198,0.019867986,0.0007538895,0.00043834271,0.0000023554765,0.028400851,0.019742794,0.004065049,0.6146421,0.008168976,0.303555],"study_design_scores_gemma":[0.0015125574,0.000001052372,0.003405475,0.0005352751,0.00008910446,0.00003470012,0.00047655214,0.3420611,0.030829443,0.013952972,0.6063636,0.00073815807],"about_ca_topic_score_codex":0.00008220933,"about_ca_topic_score_gemma":0.00013661198,"teacher_disagreement_score":0.8610776,"about_ca_system_score_codex":0.00003677966,"about_ca_system_score_gemma":0.000031071788,"threshold_uncertainty_score":0.49883842},"labels":[],"label_agreement":null},{"id":"W4300866431","doi":"","title":"Arbitrary Overlap Constraints in Graph Packing Problems","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Function (biology); Discrete mathematics; Vertex (graph theory)","score_opus":0.04924595412843806,"score_gpt":0.16604535847409163,"score_spread":0.11679940434565357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300866431","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.41349158,0.00054566975,0.3649512,0.000111686844,0.0029806267,0.0015096739,0.00024176079,0.002234538,0.21393329],"genre_scores_gemma":[0.99835545,0.0006922448,0.00026438024,0.000040015802,0.00005658087,0.0000020207901,0.000038636008,0.00006101628,0.0004896387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860585,0.00006217755,0.00027024897,0.0005708943,0.00007054067,0.0004202649],"domain_scores_gemma":[0.9991504,0.00006572215,0.00010094875,0.0004930174,0.000053134616,0.0001367927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017142796,0.00036266082,0.00035166935,0.0004666467,0.000049671835,0.000056299938,0.00040605548,0.00041717492,0.00024497404],"category_scores_gemma":[0.000013667791,0.00040273418,0.00016130692,0.00042122835,0.00015699623,0.00019929394,0.00021056895,0.00066973676,0.00008865007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008701401,0.00003194444,0.01603579,0.00030815927,0.00008669552,0.00013167539,0.0002024163,0.96044344,0.00008769824,0.02202564,0.00021946219,0.00041835915],"study_design_scores_gemma":[0.004271951,0.0000709818,0.0068100477,0.0046334206,0.0001754852,0.000025382218,0.00030918026,0.71848,0.000557745,0.2580697,0.0031349387,0.003461163],"about_ca_topic_score_codex":0.000023248931,"about_ca_topic_score_gemma":0.000049698585,"teacher_disagreement_score":0.5848639,"about_ca_system_score_codex":0.00019162374,"about_ca_system_score_gemma":0.00007486961,"threshold_uncertainty_score":0.99984246},"labels":[],"label_agreement":null},{"id":"W4307269149","doi":"10.31590/ejosat.1121006","title":"Meta-Heuristic Algorithms based on Integer Programming for Shelf Space Allocation Problems","year":2022,"lang":"en","type":"article","venue":"European Journal of Science and Technology","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Heuristics; Integer programming; Computer science; Profit (economics); Mathematical optimization; Space (punctuation); Integer (computer science); Algorithm; Operations research; Mathematics; Economics","score_opus":0.02790502786270469,"score_gpt":0.22808528514965976,"score_spread":0.20018025728695507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307269149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012072188,0.0013551177,0.9695305,0.009551021,0.0013583578,0.0007779586,0.000010081053,0.0004833745,0.004861357],"genre_scores_gemma":[0.96902484,0.000021562044,0.030749515,0.00008447868,0.000022659915,0.000013642274,9.012522e-7,0.000018191351,0.000064199354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923,0.000033507655,0.00021827425,0.0001189927,0.00023162375,0.0001675481],"domain_scores_gemma":[0.9995066,0.000030802606,0.00010751039,0.000104872786,0.00020391762,0.0000463298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018352938,0.00008009746,0.00013067838,0.00059116876,0.0002468293,0.00005101608,0.0002942405,0.000012182826,0.000018912617],"category_scores_gemma":[0.00012874273,0.000066038505,0.000034049768,0.00085100136,0.0002417093,0.00010270044,0.000043153745,0.00023209497,0.0000016578845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018080282,0.00010353498,0.000096761774,0.00007428473,0.0001307184,0.00003400747,0.00061471894,0.8383378,0.0066362373,0.0055877063,0.001123363,0.14724278],"study_design_scores_gemma":[0.0011229458,0.0022781286,0.000058825543,0.000058048598,0.00022510301,0.0002465995,0.0006423445,0.7604945,0.0037817713,0.00081264443,0.22995959,0.00031954344],"about_ca_topic_score_codex":2.3089646e-7,"about_ca_topic_score_gemma":1.457265e-7,"teacher_disagreement_score":0.9569527,"about_ca_system_score_codex":0.000046243305,"about_ca_system_score_gemma":0.000047209825,"threshold_uncertainty_score":0.2692972},"labels":[],"label_agreement":null},{"id":"W4308349555","doi":"10.1016/j.isatra.2022.10.035","title":"An autonomous, multi-agent, IoT-empowered space logistics system for mission-critical inventory packing","year":2022,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Optimization and Packing Problems","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 Saskatchewan","funders":"Hong Kong Polytechnic University; Research Grants Council, University Grants Committee; Hang Seng University of Hong Kong","keywords":"Payload (computing); Computer science; Crew; Spacecraft; Quality (philosophy); Operations research; Space (punctuation); Supply chain; Packing problems; Systems engineering; Engineering; Aerospace engineering; Business","score_opus":0.044341393831226934,"score_gpt":0.2903984889418924,"score_spread":0.24605709511066548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308349555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040614363,0.0001560746,0.9951624,0.00019934741,0.0019916224,0.00032377616,0.00028318982,0.00089750544,0.00057990884],"genre_scores_gemma":[0.9772142,0.000009688264,0.021939922,0.000043329706,0.000063642176,0.000109969966,0.00005975334,0.00006660966,0.0004928647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906224,0.0000631656,0.0002452799,0.00021013153,0.00014192388,0.0002772875],"domain_scores_gemma":[0.99943125,0.00009194756,0.000024159932,0.00024023357,0.000047416634,0.00016497333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016597066,0.00015215203,0.00015709086,0.000117088806,0.00053534895,0.000059066784,0.00014696817,0.00007229829,0.00039400178],"category_scores_gemma":[0.000015736105,0.00018202601,0.00010039755,0.00017763171,0.000036554055,0.00008324638,0.000004533047,0.0002499719,0.000012805752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007745097,0.00010636005,0.00003704202,0.00019584579,0.000032953456,0.0000041648586,0.00090783,0.9950418,0.0015733216,0.0010524447,0.00051017775,0.0005303368],"study_design_scores_gemma":[0.0004761365,0.000060174523,0.000018228116,0.00002868809,0.000055275174,0.000021140495,0.0011392994,0.9441777,0.0006347893,0.000025541518,0.053122915,0.00024014569],"about_ca_topic_score_codex":0.00002141042,"about_ca_topic_score_gemma":0.000019491114,"teacher_disagreement_score":0.9768081,"about_ca_system_score_codex":0.0002584257,"about_ca_system_score_gemma":0.000047857695,"threshold_uncertainty_score":0.74228054},"labels":[],"label_agreement":null},{"id":"W4310342042","doi":"10.5281/zenodo.7352874","title":"To Pack or Not to Pack: A Generalized Packing Analysis and Transformation","year":2023,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transformation (genetics); Computer science","score_opus":0.04772065284425003,"score_gpt":0.27470929241914943,"score_spread":0.2269886395748994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310342042","genre_codex":"methods","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.010787085,0.00023050388,0.5522614,0.003459712,0.0020244063,0.004662634,0.00636137,0.0075900555,0.41262284],"genre_scores_gemma":[0.46283913,0.011811284,0.016642515,0.00457567,0.0026887492,0.000005527409,0.10258941,0.03182143,0.36702627],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978661,0.00020082892,0.00048824027,0.0005017915,0.00043891958,0.00050412084],"domain_scores_gemma":[0.9986506,0.000034319408,0.00007836667,0.0004642912,0.00038012755,0.00039227743],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00054658484,0.00033449885,0.00045624573,0.0014067292,0.0009176737,0.0013456309,0.0005849105,0.00019789889,0.0213048],"category_scores_gemma":[0.00021079302,0.00034061406,0.00010767936,0.003155217,0.000041174568,0.00020429208,0.0003686754,0.00034497146,0.04720053],"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.00012265875,0.000020107518,3.473722e-7,0.00038107877,0.00049204717,0.0000062008166,0.0052621798,0.1654129,0.0010247735,0.00015824768,0.7908747,0.03624476],"study_design_scores_gemma":[0.00045878638,0.00012338076,0.00008743181,0.00010614047,0.00014023876,0.000012643751,0.00016685325,0.014890276,0.00040571802,0.0000054354873,0.9831425,0.0004606134],"about_ca_topic_score_codex":0.000027349959,"about_ca_topic_score_gemma":0.000007999196,"teacher_disagreement_score":0.5356189,"about_ca_system_score_codex":0.00018933066,"about_ca_system_score_gemma":0.000005439967,"threshold_uncertainty_score":0.9999046},"labels":[],"label_agreement":null},{"id":"W4313350206","doi":"10.1016/j.orl.2022.12.001","title":"A knapsack intersection hierarchy","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Packing Problems","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Hierarchy; Intersection (aeronautics); Mathematics; Integer programming; Combinatorics; Integer (computer science); Flow (mathematics); Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.043404422865347736,"score_gpt":0.3032691263942398,"score_spread":0.25986470352889207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313350206","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.81061256,0.00024298947,0.109985255,0.023265207,0.0023239967,0.0014461984,0.00008594723,0.001234142,0.050803732],"genre_scores_gemma":[0.99630225,0.00002003057,0.0014266289,0.000507036,0.000078983605,0.00030076437,0.00007449368,0.000027913915,0.0012619109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989764,0.00018642705,0.000118187185,0.00012882063,0.00034630572,0.0002438292],"domain_scores_gemma":[0.99967927,0.00003299754,0.0000026578214,0.00017966749,0.000049831702,0.000055591398],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004889454,0.00006122319,0.000053944346,0.00035070936,0.00068554987,0.00013750845,0.00016121601,0.0000152330695,0.002013774],"category_scores_gemma":[0.000026121284,0.00006939671,0.000027461045,0.0006673238,0.00004511343,0.0001533825,0.0000764718,0.00050547614,0.00013967679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027837261,0.000013153117,0.000029777566,0.0000062965096,0.000011597811,0.0000035495364,0.00079008803,0.9324265,0.016795801,0.0007424899,0.048387833,0.00079014624],"study_design_scores_gemma":[0.00024530166,0.000055965742,0.000071137954,0.000005492259,0.0000018058957,0.00001563116,0.0004279681,0.8189637,0.0009564823,0.000026315978,0.17908902,0.00014118786],"about_ca_topic_score_codex":0.000057725894,"about_ca_topic_score_gemma":0.000050095663,"teacher_disagreement_score":0.1856897,"about_ca_system_score_codex":0.00024773725,"about_ca_system_score_gemma":0.000025029216,"threshold_uncertainty_score":0.9988985},"labels":[],"label_agreement":null},{"id":"W4318712991","doi":"10.2139/ssrn.4326724","title":"Algorithms for Loot Box Design","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","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":"University of British Columbia; University of British Columbia Hospital","funders":"","keywords":"Computer science; Geography","score_opus":0.025395235862027816,"score_gpt":0.25123328458973226,"score_spread":0.22583804872770444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318712991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059195724,0.00078486337,0.9967975,0.00024307558,0.00046333845,0.00014599839,0.0000024573565,0.0003839743,0.00058685447],"genre_scores_gemma":[0.903065,0.027977293,0.042239994,0.00024125347,0.002036212,0.00012906888,0.000073835894,0.00039551305,0.023841826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983354,0.000017890323,0.00015121743,0.000078888246,0.000099604535,0.0013169552],"domain_scores_gemma":[0.9997604,0.00005072694,0.00002460408,0.000073168885,0.000038964376,0.000052125702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297096,0.00009534884,0.00009454449,0.00012122695,0.000112385766,0.000051286712,0.00012266816,0.00005400786,0.000022487198],"category_scores_gemma":[0.000024041297,0.00009179501,0.00006391328,0.00025269084,0.0000081772305,0.000087537,0.0000065549916,0.00050573604,0.00010047177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014529984,0.00001118407,0.00004442929,0.000021294547,0.00016985435,0.000002241034,0.00019735983,0.9130771,0.00046804317,0.021216081,0.008746762,0.056031104],"study_design_scores_gemma":[0.0013460544,0.00030477426,0.00004159476,0.000030278135,0.000038050755,0.00020779396,0.000363495,0.77271956,0.0011263847,0.19014555,0.033280414,0.00039605433],"about_ca_topic_score_codex":0.0000012720708,"about_ca_topic_score_gemma":0.000011581511,"teacher_disagreement_score":0.9545575,"about_ca_system_score_codex":0.0002192832,"about_ca_system_score_gemma":0.00024264399,"threshold_uncertainty_score":0.3743292},"labels":[],"label_agreement":null},{"id":"W4319923645","doi":"10.21203/rs.3.rs-2561563/v1","title":"Approximation algorithms for covering vertices by long paths","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Packing Problems","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":"University of Alberta","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada; Shanghai Polytechnic University","keywords":"Approximation algorithm; Mathematics; Disjoint sets; Vertex cover; Combinatorics; Vertex (graph theory); Maximum cut; Algorithm; Discrete mathematics; Graph","score_opus":0.11271298795993279,"score_gpt":0.3832666093484806,"score_spread":0.2705536213885478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319923645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058532967,0.0027873507,0.9775431,0.00040963665,0.002116388,0.0040447027,0.0011414253,0.0025204588,0.0035836236],"genre_scores_gemma":[0.9167555,0.0073952363,0.0405045,0.000050590865,0.0018218891,0.006828933,0.011843069,0.001167316,0.0136329625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981618,0.000079562815,0.00027700188,0.00036654234,0.00058418803,0.0005309052],"domain_scores_gemma":[0.99885535,0.00032501784,0.00003622764,0.00038013913,0.0002854145,0.0001178599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010463311,0.00020054946,0.00022487032,0.00028951306,0.00015509225,0.00034735928,0.0003106896,0.00030303063,0.000048591377],"category_scores_gemma":[0.0002397585,0.00021845945,0.000098388366,0.000316344,0.000035651716,0.00011861634,0.000262925,0.0007190741,0.00011254651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001438199,0.000036360318,0.00045197527,0.008555402,0.00010882296,0.000005202775,0.00079906004,0.94930923,0.00031913334,0.00022734904,0.023347642,0.016825426],"study_design_scores_gemma":[0.00028616659,0.000044698794,0.00026052838,0.00077296497,0.000009393908,5.188733e-7,0.000114495495,0.9825366,0.0015065755,0.0011952559,0.012972518,0.0003002522],"about_ca_topic_score_codex":0.00006323361,"about_ca_topic_score_gemma":0.000021327956,"teacher_disagreement_score":0.9370386,"about_ca_system_score_codex":0.00020707512,"about_ca_system_score_gemma":0.00006191159,"threshold_uncertainty_score":0.89085174},"labels":[],"label_agreement":null},{"id":"W4321123803","doi":"10.3934/mbe.2023323","title":"A method for demand-accurate one-dimensional cutting problems with pattern reduction","year":2023,"lang":"en","type":"article","venue":"Mathematical Biosciences & Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Benchmark (surveying); Reduction (mathematics); Computer science; Mathematical optimization; Focus (optics); Variable (mathematics); Software; Integer (computer science); Constant (computer programming); Mathematics","score_opus":0.026678454616831854,"score_gpt":0.2563763116623132,"score_spread":0.22969785704548137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321123803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016031811,0.000025384144,0.98181826,0.00018676142,0.00021123076,0.0003761797,0.000007072912,0.0010945054,0.0002488128],"genre_scores_gemma":[0.59337175,0.000012891508,0.40602437,0.000024098006,0.00010840645,0.00021059888,0.000018729756,0.000069250345,0.00015990838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882096,0.000010332677,0.0002710048,0.00024155268,0.00025336625,0.00040275452],"domain_scores_gemma":[0.9995305,0.00016019474,0.000035497633,0.00013094232,0.000043851338,0.00009901809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005733201,0.00017642854,0.00020193425,0.0001809407,0.00010582137,0.000107419146,0.00014176317,0.00006176446,0.000031853622],"category_scores_gemma":[0.00005327371,0.0001444563,0.000047186568,0.00072680553,0.000030196483,0.00019110995,0.00002790412,0.00010480656,0.00004448562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013019437,0.00001170136,0.000008959352,0.00034288887,0.000018007664,8.017044e-7,0.00036372902,0.97864425,0.017602792,0.0014040316,0.00007978495,0.0015217238],"study_design_scores_gemma":[0.00016901986,0.00004590667,0.000032416887,0.00024368205,0.000015082318,0.000021176715,0.000046679594,0.99167967,0.0064364728,0.0006426387,0.00044819392,0.00021906591],"about_ca_topic_score_codex":0.0000014430093,"about_ca_topic_score_gemma":5.2156304e-7,"teacher_disagreement_score":0.57733995,"about_ca_system_score_codex":0.000028580309,"about_ca_system_score_gemma":0.000012636723,"threshold_uncertainty_score":0.5890757},"labels":[],"label_agreement":null},{"id":"W4322771373","doi":"10.1007/s43069-022-00190-4","title":"Model Development and Solver Demonstrations Using Randomized Test Problems","year":2023,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Optimization and Packing Problems","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Solver; Python (programming language); Visualization; MATLAB; Scalability; Software engineering; Analytics; Development (topology); Programming language; Data science; Artificial intelligence; Database","score_opus":0.12980991366936692,"score_gpt":0.34702767892351927,"score_spread":0.21721776525415235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322771373","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.15182096,0.00048147442,0.8107154,0.0031679717,0.0002689074,0.0038536026,0.000070212736,0.0015887662,0.028032724],"genre_scores_gemma":[0.9284442,0.00031832518,0.06655895,0.000026689328,0.000023387882,0.00037508208,0.00010671061,0.000044830194,0.004101814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.000058637055,0.00026108974,0.00015739244,0.00026540307,0.0003880079],"domain_scores_gemma":[0.99940157,0.00017778917,0.000005864347,0.00014177954,0.00017107058,0.000101899815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010038939,0.0001012613,0.00015016254,0.00035683243,0.000734506,0.00027094368,0.0000865809,0.000065066284,0.00004239336],"category_scores_gemma":[0.00021950806,0.00009370107,0.000026415499,0.00068886153,0.00011515427,0.00026210252,0.00006159127,0.00019969237,0.000093002294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012570489,0.00001274995,0.00005895982,0.000022933418,0.000018560035,6.461009e-7,0.0007204403,0.9915266,0.0022386506,0.0034954716,0.0012483059,0.0006441008],"study_design_scores_gemma":[0.003693727,0.0000055939963,0.000008486954,0.000031936626,0.000003797081,0.0000025672684,0.00015636487,0.9936251,0.0007604942,0.00030925134,0.0012898134,0.00011285854],"about_ca_topic_score_codex":0.000018649054,"about_ca_topic_score_gemma":0.0003069763,"teacher_disagreement_score":0.77662325,"about_ca_system_score_codex":0.000056950794,"about_ca_system_score_gemma":0.00016523674,"threshold_uncertainty_score":0.5649301},"labels":[],"label_agreement":null},{"id":"W4361758612","doi":"10.2139/ssrn.4403293","title":"On the G-Extra Connectivity of Augmented Cubes","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","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":"Brock University","funders":"","keywords":"Computer science; Business","score_opus":0.011433548570269493,"score_gpt":0.21740314592355514,"score_spread":0.20596959735328565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361758612","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.9654739,0.0005024829,0.024349263,0.001084082,0.00043273537,0.00013935706,0.0000040167865,0.00028897868,0.007725197],"genre_scores_gemma":[0.9978697,0.0015081312,0.000010123924,0.000026168525,0.00003904264,0.0000024569013,0.0000018509159,0.000016817225,0.00052574114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990346,0.000036574183,0.00012334315,0.000050744722,0.00012276176,0.00063199346],"domain_scores_gemma":[0.99971634,0.000113908194,0.000031331023,0.000090800415,0.00002589689,0.00002173538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007660019,0.00007002913,0.00007992875,0.000078430945,0.00007792162,0.00001719321,0.000112873204,0.000030417445,0.00006803149],"category_scores_gemma":[0.000047360267,0.00004922412,0.000050167106,0.00027466737,0.000016871747,0.000042650558,0.0000075497514,0.0006405419,0.00005298806],"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.000018886225,0.000029361152,0.0005785827,0.000016692853,0.00023431386,0.0000016307234,0.00031997892,0.50961655,0.0020279007,0.47652215,0.0023654941,0.00826847],"study_design_scores_gemma":[0.0017645373,0.0006588245,0.0037504463,0.0001710555,0.000062953965,0.00021652466,0.0020669585,0.45355025,0.007348866,0.5242431,0.005615597,0.000550893],"about_ca_topic_score_codex":0.000004266052,"about_ca_topic_score_gemma":0.00003964672,"teacher_disagreement_score":0.056066282,"about_ca_system_score_codex":0.00012409233,"about_ca_system_score_gemma":0.00011356374,"threshold_uncertainty_score":0.27828714},"labels":[],"label_agreement":null},{"id":"W4362504448","doi":"10.1007/978-3-030-54621-2_738-1","title":"Inverse Integer Optimization","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Optimization and Packing Problems","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":"Inverse; Integer (computer science); Mathematical optimization; Mathematics; Computer science; Geometry","score_opus":0.01010261178090125,"score_gpt":0.19466409610286387,"score_spread":0.18456148432196262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362504448","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.8596453e-7,0.00029429633,0.29269356,0.000027379097,0.0010475757,0.00032289012,0.00005723751,0.00034368742,0.70521283],"genre_scores_gemma":[0.00017361286,0.050237294,0.24278212,0.00015550999,0.0004831511,0.00010009652,0.0053493977,0.00072508433,0.6999937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998336,0.00002396455,0.0006945045,0.00032421973,0.0004062807,0.00021501991],"domain_scores_gemma":[0.99898064,0.000054424603,0.00029024406,0.00041425473,0.00016516348,0.00009527678],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015112331,0.00042348693,0.0004430082,0.0004749774,0.00008909051,0.000029231305,0.00025701916,0.00036132883,0.022712091],"category_scores_gemma":[0.00003728059,0.00051021576,0.00015052443,0.000165345,0.000062675594,0.00030224805,0.00008450625,0.00044743114,0.00004487109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008344667,0.000012662151,0.000006012254,0.00012759268,0.00006836654,0.0000032548062,0.00022155319,0.98068386,6.521883e-7,0.007044042,0.011057191,0.00076649414],"study_design_scores_gemma":[0.00024822017,0.000038364702,4.1235572e-7,0.000073293784,0.00007421272,0.0000038453886,0.0000100720035,0.71510977,0.000004276688,0.00016201682,0.28387326,0.00040226532],"about_ca_topic_score_codex":0.0000044481194,"about_ca_topic_score_gemma":0.00000346353,"teacher_disagreement_score":0.27281606,"about_ca_system_score_codex":0.00017846285,"about_ca_system_score_gemma":0.00007338945,"threshold_uncertainty_score":0.99973494},"labels":[],"label_agreement":null},{"id":"W4376863206","doi":"10.1016/j.cor.2023.106267","title":"Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Bin packing problem; Mathematical optimization; Algorithm; Packing problems; Branch and bound; Branch and cut; Integer programming; Heuristic; Clique; Mathematics; Computer science; Hybrid algorithm (constraint satisfaction); Bin; Constraint programming; Combinatorics","score_opus":0.03246779402847673,"score_gpt":0.29794606897378645,"score_spread":0.26547827494530973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376863206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03293707,0.0006401859,0.95725083,0.0043562884,0.00036869413,0.0028208727,0.000085032334,0.0008108566,0.0007301815],"genre_scores_gemma":[0.7802218,0.00036282866,0.21180415,0.0003621195,0.0007672956,0.0010818413,0.00043001518,0.00022698201,0.0047429325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988826,0.00006829652,0.00015840941,0.00023927941,0.0002895879,0.00036180997],"domain_scores_gemma":[0.9989409,0.00054086186,0.000007734284,0.00019672998,0.00021810405,0.00009571268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006566656,0.0001274276,0.00012985994,0.00020382606,0.0006989782,0.00036735288,0.00015512476,0.000031343985,0.000032694603],"category_scores_gemma":[0.000021463891,0.000092697024,0.000025010275,0.0004697822,0.00011504781,0.00015889734,0.000109631124,0.00024729548,0.000070686205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050191265,0.000009040941,0.000019015197,0.000028811004,0.000059987437,0.0000028356521,0.00042115542,0.9581833,0.00047248122,0.00046199042,0.006206934,0.034129463],"study_design_scores_gemma":[0.0005675575,0.00006616695,0.00017737893,0.000056191464,0.000006994237,0.000023207072,0.000015278889,0.9949041,0.0003559034,0.00008052317,0.003619118,0.0001276021],"about_ca_topic_score_codex":0.00002194422,"about_ca_topic_score_gemma":0.000017400362,"teacher_disagreement_score":0.74728477,"about_ca_system_score_codex":0.00003690061,"about_ca_system_score_gemma":0.00005983195,"threshold_uncertainty_score":0.53760463},"labels":[],"label_agreement":null},{"id":"W4378839621","doi":"10.1016/j.eswa.2023.120548","title":"Efficient 2D irregular layout by vector superposition NFP and mixed-integer programming","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Optimization and Packing Problems","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":"University of Manitoba","funders":"Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Polygon (computer graphics); Mathematical optimization; Integer programming; Superposition principle; Computer science; Process (computing); Integer (computer science); Algorithm; Scale (ratio); Mathematics","score_opus":0.0071729571088853545,"score_gpt":0.21363831685667295,"score_spread":0.2064653597477876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378839621","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.043823883,0.005661593,0.93778473,0.00059682166,0.00059493905,0.0039416687,0.00010925352,0.0046743657,0.0028127246],"genre_scores_gemma":[0.9951872,0.000043875134,0.0012487669,0.00001896205,0.00010039786,0.0026403381,0.00021261717,0.00005778995,0.0004900011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920315,0.000019375397,0.00018716222,0.0002185468,0.00015199147,0.00021977059],"domain_scores_gemma":[0.9995519,0.00003142261,0.000028119552,0.00023718468,0.000051350256,0.00010001247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009986439,0.000144894,0.00013755981,0.00009146863,0.00015765344,0.00010925806,0.00007854288,0.000069488335,0.0000075903786],"category_scores_gemma":[0.0000027784752,0.00012753489,0.000020875537,0.00044961274,0.000035546786,0.00003947358,0.000014361246,0.00007456466,0.00010551193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009702082,0.000110222245,0.0005047163,0.00042898537,0.00013379556,0.0000032381893,0.0044843517,0.9294414,0.011833329,0.005373398,0.04135463,0.0063222353],"study_design_scores_gemma":[0.00038963315,0.00003688407,0.0001314118,0.00014816503,0.000016156473,0.000028506154,0.0010861314,0.6704526,0.0012409545,0.0000050474473,0.32608443,0.00038005968],"about_ca_topic_score_codex":0.000037657734,"about_ca_topic_score_gemma":0.000004414116,"teacher_disagreement_score":0.9513634,"about_ca_system_score_codex":0.000045822857,"about_ca_system_score_gemma":0.000009161136,"threshold_uncertainty_score":0.5200722},"labels":[],"label_agreement":null},{"id":"W4379118138","doi":"10.1007/978-3-031-34347-6_8","title":"A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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 Regina; Western University","funders":"","keywords":"Knapsack problem; Orienteering; Polynomial-time approximation scheme; Combinatorics; Vertex (graph theory); Approximation algorithm; Mathematics; Directed graph; Discrete mathematics; Time complexity; Mathematical optimization; Computer science; Graph","score_opus":0.015675612767173698,"score_gpt":0.22347397035999694,"score_spread":0.20779835759282325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379118138","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.00016074286,0.00005577624,0.9917074,0.000104373066,0.0018605853,0.00061165856,0.000020016796,0.0012044618,0.004274999],"genre_scores_gemma":[0.077079855,0.00021777568,0.9130453,0.0009767283,0.001463537,0.0002058903,0.00036513738,0.0006278801,0.006017909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998445,0.000006863739,0.00030632317,0.0005370426,0.00032985723,0.0003749188],"domain_scores_gemma":[0.9991094,0.0002686999,0.00007983175,0.00038095718,0.000085847445,0.00007527579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029872468,0.0003342315,0.0003052196,0.00071789575,0.00012867917,0.00017847276,0.00043808174,0.00024164858,0.000018486226],"category_scores_gemma":[0.00007842828,0.00033410912,0.00009332854,0.00049114524,0.00011457626,0.00013898585,0.000088429064,0.00036008138,0.00006322735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000882708,0.000008378198,0.000007773054,0.0001304621,0.00001990271,0.0000028465593,0.0004021769,0.9356293,0.0010745191,0.0009114972,0.00033574156,0.06146858],"study_design_scores_gemma":[0.00023515492,0.00005738971,0.0000135914415,0.0004033292,0.0000060686357,0.0000028502784,6.3769924e-8,0.9906532,0.0017631546,0.0044627674,0.0020205798,0.0003818492],"about_ca_topic_score_codex":0.000002601974,"about_ca_topic_score_gemma":0.000007759485,"teacher_disagreement_score":0.0786621,"about_ca_system_score_codex":0.00014124955,"about_ca_system_score_gemma":0.000050496925,"threshold_uncertainty_score":0.99991107},"labels":[],"label_agreement":null},{"id":"W4382279311","doi":"10.1007/978-3-031-30347-0_8","title":"Supply Chain Finance","year":2023,"lang":"en","type":"book-chapter","venue":"Springer texts in business and economics","topic":"Optimization and Packing Problems","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":"York University","funders":"","keywords":"Factoring; Supply chain; Cash flow; Business; Payment; Finance; Production (economics); Revenue; Industrial organization; Economics; Microeconomics; Marketing","score_opus":0.014251652310778812,"score_gpt":0.18201087769964944,"score_spread":0.16775922538887061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382279311","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008836501,0.0028648651,0.0007783229,0.00052815495,0.0046898983,0.00060481095,0.0001703892,0.0007982867,0.98072875],"genre_scores_gemma":[0.06646985,0.1738095,0.0026975377,0.00023071453,0.0008251333,0.00006104205,0.00021321354,0.0007466322,0.7549464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992528,0.000001398833,0.00028034495,0.00024471674,0.00002727526,0.000193497],"domain_scores_gemma":[0.9996687,0.000022040753,0.000052824988,0.00020523116,0.000020173122,0.000031000905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008912031,0.00024357784,0.0003050381,0.00021253855,0.000030245623,0.00006783389,0.00010447496,0.00024466653,0.000098143006],"category_scores_gemma":[0.0000045425504,0.0002941129,0.00003205518,0.000042402786,0.00003669401,0.00008594101,0.000060439026,0.00019208368,0.00015292817],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064612086,0.000005899489,0.00051933376,0.0004792825,0.000044618842,0.00001684758,0.00015663423,0.72231907,0.0000018109658,0.22923222,0.0009733592,0.04624448],"study_design_scores_gemma":[0.0006591367,0.00001023153,0.0102364225,0.0009062713,0.000022044114,0.000010220501,0.000005385115,0.08964307,0.000010753823,0.022678627,0.8744978,0.0013200892],"about_ca_topic_score_codex":0.000011500114,"about_ca_topic_score_gemma":0.00020956824,"teacher_disagreement_score":0.87352437,"about_ca_system_score_codex":0.00005765428,"about_ca_system_score_gemma":0.000018995368,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W4382563635","doi":"10.2139/ssrn.4494890","title":"Tilted Inequalities and Facets of the Set Covering Polytope: A Theoretical Analysis","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","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; Université du Québec à Montréal","funders":"","keywords":"Polytope; Set (abstract data type); Inequality; Combinatorics; Mathematics; Computer science; Mathematical economics; Mathematical analysis","score_opus":0.016152957016259666,"score_gpt":0.24382041589769504,"score_spread":0.22766745888143539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382563635","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.76857144,0.0075597297,0.21756178,0.0014256205,0.0015210912,0.00053236965,0.00021193786,0.00048691747,0.00212911],"genre_scores_gemma":[0.99278766,0.0065139816,0.00008789262,0.000015830763,0.00006541092,0.000004695754,0.000017187665,0.000042084965,0.00046526993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983079,0.00010463186,0.00038009987,0.00015088977,0.00024112043,0.0008153649],"domain_scores_gemma":[0.9994328,0.00007100597,0.0001340111,0.00025605285,0.000057196165,0.00004894801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010067129,0.00019675732,0.00035970504,0.00023921765,0.00007859283,0.000088155284,0.00029361548,0.00017233776,0.000041991476],"category_scores_gemma":[0.00006607625,0.00014886532,0.00021284909,0.00040092802,0.00009631232,0.00003829913,0.00021204805,0.0021461127,0.0000026298953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011277216,0.000007938234,0.0037872272,0.00013940349,0.0027324578,8.239568e-7,0.0012741736,0.82320684,0.000096715165,0.16807085,0.000058571193,0.0006136979],"study_design_scores_gemma":[0.00079364085,0.000091265974,0.0039474727,0.00041662986,0.0018002581,0.00011172813,0.0024372307,0.4518412,0.0006644718,0.53677493,0.000302193,0.000818994],"about_ca_topic_score_codex":0.000041400064,"about_ca_topic_score_gemma":0.0002423247,"teacher_disagreement_score":0.37136567,"about_ca_system_score_codex":0.00022497644,"about_ca_system_score_gemma":0.00036541,"threshold_uncertainty_score":0.93239105},"labels":[],"label_agreement":null},{"id":"W4382934680","doi":"10.1016/j.orl.2023.06.004","title":"Continuous cutting plane algorithms in integer programming","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Packing Problems","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":"Polytechnique Montréal","funders":"","keywords":"Subadditivity; Cutting-plane method; Integer programming; Mathematical optimization; Mathematics; Integer (computer science); Linear programming; Algorithm; Optimization problem; Theory of computation; Branch and cut; Computer science; Combinatorics","score_opus":0.05034676274351741,"score_gpt":0.33285877107178313,"score_spread":0.28251200832826573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382934680","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.9068831,0.00020139824,0.05822726,0.017291088,0.0011065167,0.0022245243,0.000036359346,0.0026524365,0.011377313],"genre_scores_gemma":[0.98444897,0.00010705482,0.013094001,0.0002239334,0.00017216038,0.00032801024,0.000223368,0.00006708438,0.0013353996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998865,0.00008652182,0.00018834077,0.00015477552,0.00026062987,0.0004447258],"domain_scores_gemma":[0.9996336,0.00009113941,0.0000035757082,0.00015061014,0.00006076273,0.00006028593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008158858,0.00008151514,0.00009431649,0.00053607544,0.00015961828,0.0002430783,0.00013714725,0.00004559444,0.00008036196],"category_scores_gemma":[0.00011865609,0.00008362594,0.000019625859,0.001275986,0.000048546524,0.00016953194,0.00003868918,0.00040326623,0.00039393755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011683039,0.00001000812,0.0006038907,0.000024297004,0.00000953883,0.000035562363,0.0011863136,0.9712855,0.005486032,0.00016618162,0.0088363495,0.012355132],"study_design_scores_gemma":[0.0002674193,0.00001668493,0.00034620852,0.0000690311,0.000001015072,0.000004604554,0.00048191796,0.9685299,0.0009225723,0.000005975194,0.02920946,0.00014520455],"about_ca_topic_score_codex":0.00012619785,"about_ca_topic_score_gemma":0.00015872202,"teacher_disagreement_score":0.077565886,"about_ca_system_score_codex":0.00007734278,"about_ca_system_score_gemma":0.000019735311,"threshold_uncertainty_score":0.50634015},"labels":[],"label_agreement":null},{"id":"W4386139117","doi":"10.1287/ijoc.2022.0257","title":"A Numerically Exact Algorithm for the Bin-Packing Problem","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Bin packing problem; Algorithm; Computation; Enumeration; Set (abstract data type); Branch and cut; Bin; Exact solutions in general relativity; Integer (computer science); Mathematical optimization; Branch and bound; Set packing; Mathematics; Integer programming; Point (geometry); Key (lock); Computer science; Discrete mathematics","score_opus":0.019442804090740434,"score_gpt":0.25731050925298976,"score_spread":0.23786770516224934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386139117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019898626,0.00006515279,0.9905321,0.0003930018,0.0013598123,0.00029137242,0.0000039926713,0.00064769335,0.004717028],"genre_scores_gemma":[0.77000153,0.00055623613,0.22379564,0.0017743694,0.0026213436,0.00003290367,0.00003200705,0.00023908338,0.00094689184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889195,0.000009571434,0.00039706347,0.00008243424,0.0002285661,0.00039038985],"domain_scores_gemma":[0.99921334,0.0003839533,0.00011417578,0.00011697661,0.00008363283,0.00008795241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007025593,0.00015011829,0.00014880444,0.00017036933,0.00044052815,0.00033309832,0.0002396484,0.000053520373,0.000022193917],"category_scores_gemma":[0.00004907167,0.00009735932,0.00011949384,0.0005030558,0.00001617611,0.00014597496,0.000035428362,0.0003877477,0.00009384331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018811662,0.0000028499287,0.000031757263,0.0000137841225,0.00003602251,0.0000030419446,0.0003569045,0.6181685,0.0000134345155,0.00014712413,0.002335588,0.37888914],"study_design_scores_gemma":[0.00036283245,0.00006403648,0.00016864693,0.00011985857,0.0000075195308,0.0000691801,0.00009858937,0.9387215,0.00007034939,0.00027106694,0.059901778,0.00014464081],"about_ca_topic_score_codex":0.0000012959528,"about_ca_topic_score_gemma":3.197719e-7,"teacher_disagreement_score":0.7680117,"about_ca_system_score_codex":0.000060522296,"about_ca_system_score_gemma":0.000028785083,"threshold_uncertainty_score":0.3970198},"labels":[],"label_agreement":null},{"id":"W4386238288","doi":"10.1007/978-3-031-37450-0_15","title":"Continuous and Convex Extensions Approaches in Combinatorial Optimization","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Optimization and Packing Problems","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Convex hull; Conic optimization; Proper convex function; Convex analysis; Mathematics; Mathematical optimization; Convex optimization; Relaxation (psychology); Combinatorial optimization; Optimization problem; Regular polygon","score_opus":0.15511391545291278,"score_gpt":0.30626913100157693,"score_spread":0.15115521554866415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386238288","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.00014850084,0.020063987,0.57212406,0.0007234904,0.013753437,0.0028491465,0.00017895298,0.0015002411,0.3886582],"genre_scores_gemma":[0.7118237,0.06460942,0.12719536,0.00043820677,0.0011408653,0.0004512751,0.0014742671,0.0009364643,0.091930404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988385,0.000017569488,0.0004927733,0.00029207452,0.00019404654,0.0001650341],"domain_scores_gemma":[0.9991232,0.0005423447,0.00007073267,0.00009785815,0.00013144656,0.00003442342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020439047,0.00025510718,0.00041533058,0.000331687,0.00005219247,0.000028382734,0.00009790874,0.00017533216,0.000026555803],"category_scores_gemma":[0.00009341211,0.0002848935,0.000035369496,0.0001367688,0.00021618733,0.00006232885,0.000094141826,0.0003272503,0.000029963072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000410047,0.0000065888707,0.000029855171,0.000104171384,0.00004723448,0.000013927536,0.00068519806,0.82178205,3.6320614e-8,0.17567818,0.00023606475,0.0014125736],"study_design_scores_gemma":[0.0001508054,0.000025446163,0.000028289312,0.000500769,0.000011502829,0.000005833379,0.0002600712,0.8526233,0.0000014244647,0.1455841,0.00050983106,0.0002986542],"about_ca_topic_score_codex":0.0000036885478,"about_ca_topic_score_gemma":0.000020795847,"teacher_disagreement_score":0.7116752,"about_ca_system_score_codex":0.000099892306,"about_ca_system_score_gemma":0.00002519729,"threshold_uncertainty_score":0.9999603},"labels":[],"label_agreement":null},{"id":"W4386266569","doi":"10.1007/978-3-031-24907-5_16","title":"A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in operations research","topic":"Optimization and Packing Problems","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":"Université Laval","funders":"","keywords":"Bin packing problem; Mathematical optimization; Column generation; Heuristic; Bin; Column (typography); Computer science; Mathematics; Point (geometry); Consolidation (business); Algorithm","score_opus":0.12170099315895302,"score_gpt":0.33155531335022986,"score_spread":0.20985432019127684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386266569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043330856,0.0008370458,0.9782937,0.0004452316,0.00031183832,0.0028497777,0.00012039607,0.00024134676,0.016896311],"genre_scores_gemma":[0.48098722,0.0034733817,0.18109372,0.0004959749,0.0064468053,0.010866885,0.01067719,0.0023809553,0.30357787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815375,0.00006864453,0.0004125935,0.00041260856,0.00049683376,0.00045559547],"domain_scores_gemma":[0.9981214,0.00095893093,0.000021163392,0.00045936933,0.0003775903,0.0000615372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010192314,0.00028737553,0.0002707119,0.00056893966,0.0006194813,0.0004886552,0.00033844286,0.00042518933,0.00012899663],"category_scores_gemma":[0.0005218639,0.0002403343,0.00008582114,0.00038447606,0.00012215713,0.000072828305,0.00007515376,0.0012260298,0.00006859254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005075983,0.00000946515,7.010544e-7,0.00015139565,0.00005243551,0.0000012623476,0.0005022371,0.9802862,0.00013292387,0.012488482,0.0013404465,0.0050293966],"study_design_scores_gemma":[0.00023342707,0.000046224468,0.0000011616536,0.0001228809,0.000020732572,0.0000044532003,0.000007910198,0.99234325,0.000042865584,0.003045014,0.0038721878,0.00025991697],"about_ca_topic_score_codex":0.000053583906,"about_ca_topic_score_gemma":0.0015123837,"teacher_disagreement_score":0.79719996,"about_ca_system_score_codex":0.00024706637,"about_ca_system_score_gemma":0.00014946972,"threshold_uncertainty_score":0.9800548},"labels":[],"label_agreement":null},{"id":"W4386464655","doi":"","title":"The two-echelon vehicle routing problem with backhauls and capacitated satellites","year":2023,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Computer network","score_opus":0.011380685665573896,"score_gpt":0.20597633512609329,"score_spread":0.19459564946051938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386464655","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.4406832,0.021437429,0.15498787,0.12918362,0.0010855334,0.002146597,0.0001334873,0.0031792664,0.24716301],"genre_scores_gemma":[0.8445768,0.007194649,0.0836046,0.00008316422,0.0000383582,0.000060400038,0.00020808686,0.00013987241,0.06409409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965898,0.0018697843,0.0003809814,0.00037417942,0.00025855994,0.0005267431],"domain_scores_gemma":[0.9961445,0.0020201858,0.00015938151,0.0007128822,0.00079655816,0.00016653303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434382,0.00025392664,0.000198981,0.000102115846,0.00076674955,0.0006800635,0.00037146037,0.00012463602,0.00006930419],"category_scores_gemma":[0.00041489993,0.00022103716,0.000053953674,0.0011372238,0.00033458933,0.0002376711,0.00017071709,0.00037455632,0.00016065984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032434124,0.0002376864,0.017982753,0.0006998931,0.00035037476,0.000021079666,0.06470375,0.049849983,0.014303663,0.46177557,0.0034017256,0.3866411],"study_design_scores_gemma":[0.001619899,0.000002041363,0.006162731,0.0034379123,0.00008152128,0.000040085662,0.0012326448,0.84942406,0.048256233,0.00419792,0.08476339,0.00078155205],"about_ca_topic_score_codex":0.0008591716,"about_ca_topic_score_gemma":0.0018172192,"teacher_disagreement_score":0.7995741,"about_ca_system_score_codex":0.00007594954,"about_ca_system_score_gemma":0.00007505476,"threshold_uncertainty_score":0.9013634},"labels":[],"label_agreement":null},{"id":"W4387956512","doi":"10.18280/mmep.100511","title":"Optimal Solution for Fully Spherical Fuzzy Linear Programming Problem","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear programming; Mathematical optimization; Fuzzy logic; Mathematics; Computer science; Artificial intelligence","score_opus":0.030188153682387284,"score_gpt":0.22804645718097025,"score_spread":0.19785830349858297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387956512","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.0064019966,0.00015361902,0.98965997,0.00010230735,0.00014699363,0.00064383843,0.000007258316,0.0024354307,0.00044858688],"genre_scores_gemma":[0.15737921,0.00015315381,0.8413058,0.000010092837,0.00015373295,0.00044934306,0.00005434077,0.00016211774,0.0003321846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847126,0.000007902776,0.0004329592,0.00028913366,0.00018373172,0.00061499845],"domain_scores_gemma":[0.99942374,0.00014098594,0.000031367075,0.00017109748,0.000055549855,0.00017724872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004037073,0.00028703202,0.00031453345,0.00013351098,0.00011972697,0.00011593181,0.000115605384,0.00017353731,0.000010799838],"category_scores_gemma":[0.000032183987,0.00028129714,0.00009586873,0.0003944778,0.00003124627,0.00013466661,0.000039119568,0.00022450891,0.0000528839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004457887,0.000021233538,0.0000036181568,0.0016003157,0.000038815273,0.0000011385025,0.0005482133,0.99168175,0.0003971896,0.0033447393,0.00015551689,0.0022030126],"study_design_scores_gemma":[0.00038170934,0.000061507344,0.0000013702322,0.00024981482,0.000027262891,0.000011490257,0.000018471037,0.9909792,0.00011888872,0.0027529136,0.0050508287,0.00034656445],"about_ca_topic_score_codex":0.0000023255009,"about_ca_topic_score_gemma":2.8984655e-7,"teacher_disagreement_score":0.15097721,"about_ca_system_score_codex":0.000033797092,"about_ca_system_score_gemma":0.000009891702,"threshold_uncertainty_score":0.99996394},"labels":[],"label_agreement":null},{"id":"W4389335084","doi":"10.1145/3618354","title":"Neural Packing: from Visual Sensing to Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Guelph","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Container (type theory); Pipeline (software); Artificial intelligence; Packing problems; Benchmark (surveying); Scalability; Encoding (memory); Artificial neural network; Motion planning; Robot; Computer vision; Algorithm","score_opus":0.024690323842993047,"score_gpt":0.2584305126388453,"score_spread":0.23374018879585226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389335084","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.11321362,0.000014380929,0.8821485,0.0007224254,0.0009702183,0.00019398179,0.000008758834,0.0020965869,0.0006315372],"genre_scores_gemma":[0.9973216,0.00012209952,0.001884149,0.00029860233,0.000042647825,0.0000071957097,0.00004886438,0.000050346684,0.0002244792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.000024435494,0.00018774856,0.00016915814,0.00019274394,0.00025268344],"domain_scores_gemma":[0.999483,0.00012524954,0.000016637627,0.00023392098,0.00003546095,0.000105721614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009298361,0.0001469838,0.00011559629,0.00036601644,0.00021550582,0.00006790978,0.00010653067,0.00008269929,0.000089331545],"category_scores_gemma":[0.000024021792,0.00016559043,0.00007692963,0.0010412039,0.000015211644,0.00008910146,0.000004777537,0.0003383298,0.00018833396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063365464,0.0000054721863,0.00009030338,0.000009349699,0.000036547404,0.000003655565,0.0006515312,0.9836805,0.0005854503,0.000029356412,0.000192305,0.014709235],"study_design_scores_gemma":[0.00024576834,0.00007815189,0.0005866669,0.000049011192,0.000022971873,0.0000017288509,0.00017975114,0.9893703,0.001988927,0.00019937026,0.007023448,0.0002539368],"about_ca_topic_score_codex":0.00003380965,"about_ca_topic_score_gemma":0.000038544684,"teacher_disagreement_score":0.884108,"about_ca_system_score_codex":0.000026640368,"about_ca_system_score_gemma":0.000006876567,"threshold_uncertainty_score":0.6752582},"labels":[],"label_agreement":null},{"id":"W4389505450","doi":"10.1016/j.omega.2023.103003","title":"The price-elastic knapsack problem","year":2023,"lang":"en","type":"article","venue":"Omega","topic":"Optimization and Packing Problems","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":"Western University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Mathematics; Mathematical optimization; Continuous knapsack problem; Quadratic equation; Change-making problem; Quadratic programming; Cutting stock problem; Affine transformation; Piecewise linear function; Computational complexity theory; Linear programming; Integer programming; Optimization problem; Applied mathematics; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.0110845670712485,"score_gpt":0.20985340174162453,"score_spread":0.19876883467037604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389505450","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028512532,0.00106108,0.031653304,0.0031200086,0.0042061475,0.000991918,0.000020025678,0.008338441,0.92209655],"genre_scores_gemma":[0.97141397,0.0006143899,0.0012401814,0.000066509056,0.00014321935,0.00006192427,0.00002141331,0.00006455128,0.026373837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956113,0.000008066304,0.0000933769,0.00006491762,0.00008410651,0.00018837658],"domain_scores_gemma":[0.99973494,0.00007542196,0.0000101684045,0.0001285885,0.000015581412,0.000035292538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011072724,0.000062221174,0.000047813424,0.000038838145,0.000100711535,0.000064938446,0.00009976121,0.00003016947,0.00004710506],"category_scores_gemma":[0.000017882554,0.000045160632,0.000021129523,0.00040234067,0.000015171981,0.000041494637,0.000017726587,0.00007740214,0.0013401057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024240126,0.000006193417,0.00033954624,0.00007975459,0.00003739556,0.0000040802656,0.0005575472,0.8671462,0.00036100758,0.007408891,0.114717625,0.009339338],"study_design_scores_gemma":[0.00016935405,0.000013376493,0.0009997436,0.000022661654,0.0000047806334,0.0000026379707,0.000035586447,0.20358756,0.00014929801,0.0010692603,0.79380876,0.00013699678],"about_ca_topic_score_codex":8.34547e-7,"about_ca_topic_score_gemma":0.0000036797012,"teacher_disagreement_score":0.94290143,"about_ca_system_score_codex":0.00001476895,"about_ca_system_score_gemma":0.0000069050757,"threshold_uncertainty_score":0.99943745},"labels":[],"label_agreement":null},{"id":"W4389917704","doi":"10.5540/03.2023.010.01.0017","title":"Algoritmo Genético Adaptativo com Chaves Aleatórias Viciadas para um Problema de Corte de Estoque Multi-Período com Custos de Setup","year":2023,"lang":"pt","type":"article","venue":"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Physics; Humanities; Philosophy","score_opus":0.031237439436402246,"score_gpt":0.2585626194161793,"score_spread":0.22732517997977705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389917704","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.17570266,0.00062012806,0.81467265,0.0045355717,0.00025830665,0.0023091037,0.00046441608,0.0006243185,0.00081283774],"genre_scores_gemma":[0.44320688,0.00031472518,0.55420387,0.00015566111,0.00008167762,0.00008068056,0.000073282106,0.00012351591,0.0017597107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979381,0.000024579631,0.0007884475,0.00028346345,0.00043619671,0.0005292237],"domain_scores_gemma":[0.9985916,0.0003566017,0.00050531083,0.00017059677,0.00022179942,0.00015409285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006853842,0.00041006407,0.00061359763,0.00007098589,0.00039204574,0.000104456485,0.00039205627,0.00023685089,0.000022674523],"category_scores_gemma":[0.00004835536,0.00039139946,0.00023824158,0.0005567912,0.00043149845,0.00015439036,0.000200583,0.00035463276,0.0000070153524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030674946,0.00025895287,0.0011145303,0.008823938,0.00054061814,6.134097e-7,0.0792507,0.8642604,0.008784283,0.032287717,0.0038743697,0.00077324244],"study_design_scores_gemma":[0.0008860025,0.000052184347,0.0010163775,0.0008102829,0.00016204487,0.00003242544,0.014197117,0.943535,0.004495865,0.034172595,0.00024264901,0.00039751723],"about_ca_topic_score_codex":0.0000092142855,"about_ca_topic_score_gemma":0.0000025016877,"teacher_disagreement_score":0.26750422,"about_ca_system_score_codex":0.000098887904,"about_ca_system_score_gemma":0.00023650857,"threshold_uncertainty_score":0.9998538},"labels":[],"label_agreement":null},{"id":"W4390122166","doi":"10.5267/j.ijiec.2023.10.006","title":"Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Computer science; Heuristic; Mathematical optimization; Reuse; USable; Exploit; Stock (firearms); Set (abstract data type); Engineering; Mathematics; Algorithm","score_opus":0.031786723530490245,"score_gpt":0.24662577589434723,"score_spread":0.21483905236385697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122166","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.066271074,0.00013185953,0.9243956,0.0024682637,0.0037016752,0.0008467097,0.0013510943,0.00043532753,0.00039837297],"genre_scores_gemma":[0.95553154,0.000019552423,0.043153808,0.000057366175,0.0008696092,0.000032416632,0.00023581361,0.0000463606,0.00005356004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901146,0.000012458644,0.00038923902,0.000093515344,0.00033343403,0.00015990078],"domain_scores_gemma":[0.9982482,0.0011117007,0.00011907182,0.000045921992,0.00040438477,0.00007072078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027918242,0.00012592792,0.00014345295,0.00023529389,0.00012670434,0.00015921259,0.00016465694,0.000042764295,0.000109100365],"category_scores_gemma":[0.0002779193,0.00010470917,0.000052547908,0.0001695117,0.000048291426,0.00019981716,0.000025780575,0.0002770796,0.0000036956724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011963195,0.000010131562,0.00005814227,0.000010092591,0.00026375457,0.000008535318,0.00009598731,0.98764074,0.000082191655,0.0007555326,0.006617506,0.00444545],"study_design_scores_gemma":[0.0012644174,0.00006507709,0.00018316385,0.00034366388,0.000035927278,0.00022559933,0.00005671211,0.99367964,0.00011176085,0.0001323368,0.0037653977,0.00013630482],"about_ca_topic_score_codex":0.000002483174,"about_ca_topic_score_gemma":6.497307e-7,"teacher_disagreement_score":0.8892604,"about_ca_system_score_codex":0.00006945984,"about_ca_system_score_gemma":0.00010708158,"threshold_uncertainty_score":0.42699158},"labels":[],"label_agreement":null},{"id":"W4390825212","doi":"10.1115/1.4064489","title":"Thermally Driven Multi-Objective Packing Optimization Using Acceleration Fields","year":2024,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Acceleration; Computer science; Structural engineering; Mathematical optimization; Mechanical engineering; Engineering; Materials science; Physics; Mathematics; Classical mechanics","score_opus":0.06041497718554498,"score_gpt":0.2788482014512427,"score_spread":0.21843322426569775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390825212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008574398,0.0003012779,0.9974697,0.00006688474,0.00096000754,0.00010946983,9.854728e-7,0.00010487704,0.00012931462],"genre_scores_gemma":[0.6736215,0.00017183088,0.32590705,0.00004878705,0.0001900596,0.0000013183325,0.0000012107982,0.00003255277,0.000025726615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.00008745455,0.0003564743,0.00008610071,0.00017871124,0.00012794776],"domain_scores_gemma":[0.9995629,0.00011339044,0.00006814658,0.0000661363,0.00012545429,0.00006392923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040866502,0.00011007987,0.00015470972,0.00014759143,0.00004725564,0.00016422053,0.00010144106,0.000112758236,0.00013980138],"category_scores_gemma":[0.00006205772,0.00009496392,0.00008754127,0.00020956002,0.0000065670397,0.00038917654,0.000011144621,0.00029254096,0.0000059728877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001098771,0.000013667335,0.000002546731,0.000026782742,0.00006280078,0.000019486202,0.00026430716,0.98855555,0.008480233,0.0002227588,0.00015473751,0.0021861647],"study_design_scores_gemma":[0.00022846652,0.00007843742,0.000005854702,0.00019365989,0.000041343792,0.000058569858,0.000026834563,0.9942539,0.0047512944,0.00017369911,0.00008157918,0.00010639839],"about_ca_topic_score_codex":0.0000010923943,"about_ca_topic_score_gemma":8.17866e-7,"teacher_disagreement_score":0.672764,"about_ca_system_score_codex":0.000096077216,"about_ca_system_score_gemma":0.000054443208,"threshold_uncertainty_score":0.38725162},"labels":[],"label_agreement":null},{"id":"W4392250624","doi":"10.1007/978-981-97-0566-5_16","title":"Reconfiguration of Multisets with Applications to Bin Packing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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 Manitoba; York University; University of Waterloo","funders":"","keywords":"Control reconfiguration; Multiset; Computer science; Bin packing problem; Focus (optics); Bin; Theoretical computer science; Term (time); Algorithm; Mathematics; Discrete mathematics","score_opus":0.01452839291504815,"score_gpt":0.2341289741037177,"score_spread":0.21960058118866954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392250624","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.000022733997,0.00016665083,0.9883511,0.00010702299,0.0003274338,0.00036121192,0.000010752629,0.00013766185,0.010515437],"genre_scores_gemma":[0.4842935,0.00007416511,0.51393986,0.00027048253,0.00030698246,0.00005643911,0.000035981197,0.0001054821,0.00091708556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999103,0.0000024085325,0.00021178085,0.0003241386,0.00020997204,0.0001486998],"domain_scores_gemma":[0.9994739,0.00006238345,0.00004177692,0.00028208178,0.000086246226,0.000053601827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012070769,0.00017260133,0.00017100881,0.00043266322,0.000036612095,0.000091158276,0.0002518503,0.000101014026,0.000025459756],"category_scores_gemma":[0.000005596102,0.00015264745,0.000024808232,0.00037059336,0.00008708344,0.000075596414,0.00004337872,0.00022195658,0.000035562392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.15996e-7,0.000001983137,0.0000070367273,0.000082355466,0.0000054584775,0.0000014930005,0.00035285047,0.8592153,0.00025939578,0.0023835425,0.000008761582,0.13768092],"study_design_scores_gemma":[0.000111899455,0.000076924705,0.000029774417,0.0011428692,0.0000137374345,0.000014871291,2.5783834e-7,0.9721785,0.0050209966,0.012322678,0.008645921,0.00044154597],"about_ca_topic_score_codex":0.0000039579118,"about_ca_topic_score_gemma":0.0000666434,"teacher_disagreement_score":0.48427075,"about_ca_system_score_codex":0.00007794378,"about_ca_system_score_gemma":0.000051290932,"threshold_uncertainty_score":0.62247825},"labels":[],"label_agreement":null},{"id":"W4394578143","doi":"10.21203/rs.3.rs-4208548/v1","title":"The Thief Orienteering Problem on Series-Parallel Graphs","year":2024,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Packing Problems","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":"Western University","funders":"","keywords":"Orienteering; Series (stratigraphy); Computer science; Series and parallel circuits; Mathematics; Mathematical optimization; Engineering; Geology; Paleontology","score_opus":0.0385503991206871,"score_gpt":0.3303493797204896,"score_spread":0.2917989805998025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394578143","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013231088,0.032927766,0.0045734183,0.01221187,0.01240261,0.01036675,0.00056465314,0.009177903,0.90454394],"genre_scores_gemma":[0.9312051,0.020279042,0.005448868,0.000062890686,0.001091934,0.002741409,0.00039307826,0.00076223887,0.038015433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724925,0.00017180941,0.00033853206,0.00047859552,0.0009857018,0.00077613804],"domain_scores_gemma":[0.9984632,0.0002445354,0.000026849671,0.00084607885,0.00025734378,0.0001619834],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013807009,0.00032774865,0.00023427197,0.00039439864,0.0004067978,0.0008654231,0.0006360708,0.00031730504,0.00009180519],"category_scores_gemma":[0.000093080926,0.0002413175,0.0001739595,0.00069694704,0.00013214252,0.000055584016,0.00088188465,0.0033794732,0.00056657754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003854131,0.000026580967,0.00005573884,0.0033780555,0.00017334489,0.00003758798,0.0012355371,0.8635086,0.00003522694,0.09314667,0.0330758,0.005288357],"study_design_scores_gemma":[0.00039090705,0.00033461803,0.00018550006,0.005397981,0.000026963373,0.000016125528,0.00061581284,0.14207633,0.0004363679,0.15739283,0.6921107,0.0010158324],"about_ca_topic_score_codex":0.000037305243,"about_ca_topic_score_gemma":0.000069402726,"teacher_disagreement_score":0.917974,"about_ca_system_score_codex":0.00023034414,"about_ca_system_score_gemma":0.00013632565,"threshold_uncertainty_score":0.9989198},"labels":[],"label_agreement":null},{"id":"W4394846394","doi":"10.1186/s44147-024-00426-6","title":"Packing optimization of practical systems using a dynamic acceleration methodology","year":2024,"lang":"en","type":"article","venue":"Journal of Engineering and Applied Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Acceleration; Computer science; Process (computing); Component (thermodynamics); Scope (computer science); Inertia; Position (finance); Multidisciplinary design optimization; Task (project management); Systems engineering; Engineering; Multidisciplinary approach","score_opus":0.054906499083790104,"score_gpt":0.31583903267048563,"score_spread":0.26093253358669555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394846394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04451497,0.0005975555,0.95395875,0.000016896318,0.00067794404,0.000046938145,6.5726505e-7,0.00004673739,0.0001395225],"genre_scores_gemma":[0.78361106,0.000095631585,0.21624006,0.000001747186,0.000038299953,6.2486924e-7,2.5911373e-7,0.000010200307,0.0000021105368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993369,0.000009598408,0.00028621714,0.00008006004,0.0001712739,0.0001159817],"domain_scores_gemma":[0.999644,0.000116450705,0.000060285012,0.000051301082,0.000073963674,0.000054014006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009278396,0.000073085175,0.00014907669,0.00031709298,0.0000343686,0.00013041495,0.00006366322,0.000042238386,0.0000031134805],"category_scores_gemma":[0.000078376455,0.000064839034,0.000019961835,0.00046795863,0.000042669064,0.0003004874,0.00001277489,0.00015247408,2.2355626e-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.0000015965594,0.0000022844113,0.0000029372277,0.0001209157,0.000009778644,0.0000015967051,0.00017593963,0.8591693,0.13782622,0.0022926035,0.0000034133948,0.0003934243],"study_design_scores_gemma":[0.00006371036,0.000016183381,0.000016439979,0.00014246034,0.000017287097,0.00015578704,0.00006223569,0.9966551,0.0027285456,0.000017009055,0.000061529645,0.00006372089],"about_ca_topic_score_codex":6.4884904e-7,"about_ca_topic_score_gemma":5.534795e-8,"teacher_disagreement_score":0.7390961,"about_ca_system_score_codex":0.00005156007,"about_ca_system_score_gemma":0.00005778681,"threshold_uncertainty_score":0.2644059},"labels":[],"label_agreement":null},{"id":"W4398138850","doi":"10.3390/a17050219","title":"The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Bipartite graph; Multipartite; Mathematics; Combinatorics; Integer programming; Discrete mathematics; Mathematical optimization; Computer science; Graph","score_opus":0.013115610279355849,"score_gpt":0.2225104173048545,"score_spread":0.20939480702549865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398138850","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13433596,0.069277406,0.25556645,0.027815137,0.012753777,0.009413163,0.00070544257,0.027143398,0.46298927],"genre_scores_gemma":[0.98377955,0.002181983,0.011029938,0.00032309417,0.000085359876,0.000087084874,0.000025916219,0.00010513758,0.0023819637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994191,0.000015130217,0.000116351985,0.00015235842,0.0001074389,0.00018962186],"domain_scores_gemma":[0.9996242,0.00012652925,0.00000963933,0.0001395891,0.00002796646,0.00007206642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012443686,0.00012332859,0.00008720992,0.000054295408,0.00012964476,0.00017005792,0.000054595577,0.00004352797,0.000047321417],"category_scores_gemma":[0.000005582794,0.000075691394,0.000023775325,0.00020780711,0.00015297954,0.00006163187,0.00001059109,0.00016175535,0.00005937254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027875072,0.000059976403,0.00054102764,0.00036841104,0.0006924368,0.0002342778,0.003709422,0.14148699,0.0005867811,0.09380694,0.049787402,0.70869845],"study_design_scores_gemma":[0.0005321958,0.0002332802,0.00058954715,0.00051188556,0.000053585183,0.00019045609,0.00018137603,0.6212844,0.00059158634,0.0015641022,0.37380627,0.0004612665],"about_ca_topic_score_codex":0.0000037735576,"about_ca_topic_score_gemma":0.000006676643,"teacher_disagreement_score":0.84944355,"about_ca_system_score_codex":0.0000092161235,"about_ca_system_score_gemma":0.000014277393,"threshold_uncertainty_score":0.30866054},"labels":[],"label_agreement":null},{"id":"W4398219966","doi":"10.1007/978-3-031-60924-4_19","title":"The Thief Orienteering Problem on Series-Parallel Graphs","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Western University","funders":"","keywords":"Computer science; Orienteering; Series (stratigraphy); Computer graphics (images); Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.009687467281718402,"score_gpt":0.20899019347120282,"score_spread":0.1993027261894844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398219966","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.00000978657,0.0012097886,0.91937804,0.0005601391,0.0039549116,0.00037850626,0.0000062358836,0.00054869696,0.073953874],"genre_scores_gemma":[0.24499096,0.0073743807,0.6783587,0.0035799013,0.0035779006,0.00022694729,0.0000882351,0.0012151356,0.060587883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984055,0.0000059044946,0.0002815221,0.000491527,0.00042368384,0.00039184952],"domain_scores_gemma":[0.9991997,0.00014395564,0.000042891894,0.00048381946,0.0000587105,0.00007093134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032467555,0.00034765282,0.0002096719,0.00030634843,0.00021549329,0.00047695372,0.00068545673,0.00017550075,0.0000192928],"category_scores_gemma":[0.000012242652,0.0002497969,0.0000808936,0.00036974682,0.000282726,0.00013123272,0.00016618421,0.00078792195,0.00008260319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028743502,0.000002084435,0.000002396777,0.000062413346,0.000012259753,0.000012317732,0.00032529997,0.88583523,0.000010401268,0.07223136,0.00009567538,0.041407697],"study_design_scores_gemma":[0.00011817551,0.00011744004,0.0000051911347,0.00090295565,0.000010066166,0.000037180416,2.86942e-7,0.6533978,0.00021851354,0.26303333,0.08158176,0.0005773149],"about_ca_topic_score_codex":0.0000023873379,"about_ca_topic_score_gemma":0.000044453067,"teacher_disagreement_score":0.24498117,"about_ca_system_score_codex":0.00012864749,"about_ca_system_score_gemma":0.000059156464,"threshold_uncertainty_score":0.9999954},"labels":[],"label_agreement":null},{"id":"W4398256838","doi":"10.7910/dvn/ii5jzg/dg6bv4","title":"MSP_F_50_NFL_4_35.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398256838","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6103246e-7,0.0000029220391,0.000611245,0.000005554886,0.0013704022,0.00017709307,0.9958791,0.00046197133,0.0014915345],"genre_scores_gemma":[0.0000019839679,0.001617797,0.00084753067,0.00038008066,0.0003387182,0.00001488916,0.99654794,0.000057234396,0.00019381705],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886227,0.000026441567,0.0002879671,0.0003071993,0.00023507045,0.0002810802],"domain_scores_gemma":[0.9988763,0.000030172632,0.00005722489,0.00081534573,0.00002833763,0.00019266726],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000074167336,0.00033703717,0.00031808807,0.00012057395,0.0000531299,0.00012685718,0.00053327216,0.00028625186,0.028054427],"category_scores_gemma":[0.00006023423,0.0003687004,0.000087866174,0.00021339397,0.000034191806,0.00016193898,0.00015687509,0.0004975334,0.41216502],"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.0000044842686,0.000011349476,6.1620455e-7,0.00038803057,0.00009011639,0.000048870977,0.00001542649,0.007178533,0.0000043751093,0.000009355997,0.99211806,0.00013080817],"study_design_scores_gemma":[0.0002638265,0.000015130091,8.280531e-7,0.00006156015,0.00008579025,0.000007696679,0.000007722719,0.0027923419,0.000014132081,0.000005937577,0.9963434,0.00040163752],"about_ca_topic_score_codex":0.000021959837,"about_ca_topic_score_gemma":0.000024327452,"teacher_disagreement_score":0.38411057,"about_ca_system_score_codex":0.000050796534,"about_ca_system_score_gemma":0.00003817756,"threshold_uncertainty_score":0.9998765},"labels":[],"label_agreement":null},{"id":"W4398259303","doi":"10.7910/dvn/ii5jzg/7p5aau","title":"MSP_F_70_NFL_4_21.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Mathematics; Geology; Artificial intelligence; Paleontology","score_opus":0.01453234708606665,"score_gpt":0.20858189834611252,"score_spread":0.19404955126004586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398259303","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8025575e-7,0.0000021352967,0.00069360196,0.0000059061454,0.0013603551,0.00017472678,0.99580306,0.0004628115,0.0014972156],"genre_scores_gemma":[0.0000029832042,0.0010172247,0.00085032434,0.00036628582,0.0003451154,0.000015097944,0.9971589,0.000056892713,0.00018721452],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887705,0.000026563206,0.0002815507,0.00030460017,0.00023305306,0.00027716355],"domain_scores_gemma":[0.9988896,0.000031472315,0.000056768,0.00080379855,0.000028008615,0.00019034909],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007304993,0.0003333345,0.00032041958,0.00012070589,0.000052477204,0.00012385949,0.00052767945,0.0002832173,0.027117597],"category_scores_gemma":[0.00006140475,0.00036491477,0.0000886098,0.00021126046,0.00003360905,0.00016346545,0.00015091016,0.00049019174,0.40022525],"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.000004529521,0.000010105773,6.0299794e-7,0.00028161344,0.00007061484,0.000050496194,0.000015055054,0.008344677,0.0000058681,0.000013099309,0.9910561,0.00014725662],"study_design_scores_gemma":[0.00024518796,0.000014990436,0.0000012010813,0.000061242965,0.000070905975,0.0000078112,0.000008015194,0.0032792343,0.000013730504,0.0000061526707,0.9958943,0.00039721414],"about_ca_topic_score_codex":0.00002204911,"about_ca_topic_score_gemma":0.000024416058,"teacher_disagreement_score":0.37310767,"about_ca_system_score_codex":0.000051362542,"about_ca_system_score_gemma":0.000038168993,"threshold_uncertainty_score":0.99988025},"labels":[],"label_agreement":null},{"id":"W4398264131","doi":"10.7910/dvn/ii5jzg/scs0sc","title":"MSP_F_20_NFL_4_37.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Mathematics; Artificial intelligence; Biology; Paleontology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398264131","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.3912136e-7,0.0000018905735,0.00052122347,0.000004495146,0.0013797903,0.00017229182,0.99612206,0.00044807827,0.0013499492],"genre_scores_gemma":[0.000002534452,0.00158689,0.00067147706,0.00026615016,0.00040562593,0.000016595639,0.9967617,0.00005561923,0.00023340814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989623,0.000025473913,0.00026428344,0.00029275837,0.00018710604,0.0002680721],"domain_scores_gemma":[0.99891883,0.000030271724,0.000051822743,0.00079094485,0.000024890242,0.00018326867],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000054821016,0.00033926548,0.00032483315,0.00011369629,0.000050089682,0.0001207317,0.0004496237,0.00027488143,0.024347786],"category_scores_gemma":[0.000046842622,0.00035487942,0.00009155493,0.00019107472,0.0000309969,0.00014480727,0.000102401296,0.00034446275,0.40913135],"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.0000043755076,0.000010753121,7.0692636e-7,0.0001908825,0.00006809742,0.000040288538,0.000019800296,0.008114369,0.000007238886,0.000008309521,0.9913173,0.00021788912],"study_design_scores_gemma":[0.00025400613,0.000026273565,8.892961e-7,0.000043975884,0.00006488305,0.000006966958,0.000007673692,0.0036217673,0.000019794745,0.000004099822,0.9955634,0.00038629086],"about_ca_topic_score_codex":0.000033486056,"about_ca_topic_score_gemma":0.00004044176,"teacher_disagreement_score":0.38478354,"about_ca_system_score_codex":0.00007057972,"about_ca_system_score_gemma":0.00004649468,"threshold_uncertainty_score":0.9998903},"labels":[],"label_agreement":null},{"id":"W4398265987","doi":"10.7910/dvn/ii5jzg/ujisom","title":"MSP_F_70_NFL_4_33.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398265987","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9102973e-7,0.0000021635212,0.0006964444,0.0000057651873,0.0013365677,0.00017498505,0.9958574,0.00046218745,0.0014642793],"genre_scores_gemma":[0.0000032198955,0.0010271075,0.0008195948,0.00036591667,0.0003424742,0.000015252151,0.9971802,0.000056887213,0.00018931959],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888015,0.000026542797,0.00028085022,0.00030402743,0.00023281407,0.0002755888],"domain_scores_gemma":[0.9988924,0.0000307284,0.00005667434,0.0008024028,0.000027873974,0.00018990063],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007287777,0.00033290792,0.0003198424,0.00012064447,0.000052369698,0.00012396577,0.00052658113,0.00028291097,0.02541965],"category_scores_gemma":[0.000059296133,0.00036453287,0.00008850919,0.00021090325,0.000033044806,0.00016282703,0.00015080643,0.00048733165,0.3966891],"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.000004424177,0.000010080407,6.01296e-7,0.0002850397,0.000070572365,0.000050439292,0.000015604011,0.008250621,0.000006373309,0.000012639088,0.99114823,0.00014536186],"study_design_scores_gemma":[0.00024085751,0.000014909371,0.0000011637944,0.00006170582,0.000070806316,0.000007800791,0.0000084082485,0.0032816953,0.000014609671,0.0000060098178,0.99589527,0.0003967726],"about_ca_topic_score_codex":0.000023436263,"about_ca_topic_score_gemma":0.000025630008,"teacher_disagreement_score":0.37126943,"about_ca_system_score_codex":0.000050996634,"about_ca_system_score_gemma":0.000037485628,"threshold_uncertainty_score":0.9998807},"labels":[],"label_agreement":null},{"id":"W4398266434","doi":"10.7910/dvn/ii5jzg/d4mzlg","title":"MSP_F_50_NFL_4_10.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Operations research; Mathematics; Artificial intelligence; Geography; Archaeology","score_opus":0.014389301389219112,"score_gpt":0.20816035075972894,"score_spread":0.19377104937050982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398266434","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.856369e-7,0.0000022139936,0.00062083843,0.0000055547084,0.0013451821,0.00017544607,0.99579763,0.00046231243,0.0015906421],"genre_scores_gemma":[0.0000028726836,0.0010263385,0.0008459367,0.00037230455,0.00033761573,0.00001625704,0.9971375,0.00005721699,0.00020398076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988591,0.000026630967,0.00028833884,0.0003073877,0.00023714542,0.00028138608],"domain_scores_gemma":[0.99887764,0.000030414963,0.00005715459,0.0008137112,0.000028443186,0.00019265975],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007473222,0.0003373426,0.00032135885,0.00012072958,0.000053276148,0.00012718966,0.0005333749,0.00028613897,0.029865827],"category_scores_gemma":[0.000060622693,0.0003689528,0.00008851576,0.00021324125,0.000034243425,0.00016246225,0.00015696908,0.00049867545,0.42421353],"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.0000044851886,0.000010191982,6.957532e-7,0.00029012276,0.00007061721,0.0000487732,0.000015842614,0.007576322,0.0000055210867,0.000011950479,0.99182856,0.00013691759],"study_design_scores_gemma":[0.00023914284,0.000015157083,0.0000012357615,0.0000616132,0.00006998153,0.000007703793,0.0000079990905,0.0028318241,0.000015848751,0.0000059354,0.9963417,0.00040187064],"about_ca_topic_score_codex":0.000022806405,"about_ca_topic_score_gemma":0.000024677276,"teacher_disagreement_score":0.3943477,"about_ca_system_score_codex":0.0000518136,"about_ca_system_score_gemma":0.000038571394,"threshold_uncertainty_score":0.99987626},"labels":[],"label_agreement":null},{"id":"W4398270065","doi":"10.7910/dvn/ii5jzg","title":"Randomly generated problems for the complexity resolution problem in a multi sector planning context","year":2020,"lang":"en","type":"dataset","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; Geography; Archaeology","score_opus":0.05106732303624932,"score_gpt":0.25459013544050724,"score_spread":0.2035228124042579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398270065","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011808036,0.0028778007,0.51200116,0.001016598,0.00027848044,0.0038657647,0.47911105,0.00081395014,0.000023358662],"genre_scores_gemma":[0.0025079048,0.0013515992,0.07451728,0.0018848991,0.00036988524,0.0064231334,0.9124411,0.00027723893,0.00022696548],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971434,0.0001830165,0.00094683835,0.0005677789,0.00031237173,0.0008466229],"domain_scores_gemma":[0.9983402,0.00028588218,0.00029708457,0.0007171145,0.00013910964,0.00022059798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007943991,0.00068056525,0.0007968697,0.00044598503,0.00029528124,0.00032176936,0.00075131713,0.00070916035,0.00004200668],"category_scores_gemma":[0.00020098082,0.00059975934,0.00023156358,0.0007568353,0.00013261657,0.00017991525,0.00013463893,0.0012142061,0.000026035019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111965535,0.00005090801,0.000047082685,0.00037618828,0.00008328626,0.000008419386,0.00018301734,0.44034982,0.00010826744,0.00013327747,0.55829084,0.0002569666],"study_design_scores_gemma":[0.0018023627,0.000057896967,0.000091125126,0.00025030083,0.000052154854,0.000013801428,0.000026410928,0.5687955,0.00008708847,0.0000916412,0.428304,0.00042771714],"about_ca_topic_score_codex":0.0056165457,"about_ca_topic_score_gemma":0.014523314,"teacher_disagreement_score":0.4374839,"about_ca_system_score_codex":0.0005372537,"about_ca_system_score_gemma":0.00018932518,"threshold_uncertainty_score":0.99964535},"labels":[],"label_agreement":null},{"id":"W4398271114","doi":"10.7910/dvn/ii5jzg/rqcvci","title":"MSP_F_70_NFL_4_6.xlsx","year":2020,"lang":"pt","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Operations research; Computer science; History; Mathematics; Artificial intelligence; Archaeology","score_opus":0.019775236604175357,"score_gpt":0.2253684998009558,"score_spread":0.20559326319678045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398271114","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.583467e-7,0.0000058083665,0.005206038,0.00003717272,0.0032743493,0.00054102286,0.9866272,0.0005154507,0.0037920016],"genre_scores_gemma":[0.00003336604,0.002296041,0.0023279034,0.0014694179,0.0007940295,0.00003002044,0.99141806,0.00017860522,0.0014525423],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99672294,0.00013164592,0.00082871184,0.0009434065,0.00059719954,0.00077609456],"domain_scores_gemma":[0.99700737,0.00011481717,0.0002539753,0.0019097308,0.000099005134,0.00061509653],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025304037,0.0009120489,0.00085441844,0.0002878602,0.00020699963,0.00043181778,0.0012891121,0.0007308155,0.07747097],"category_scores_gemma":[0.00023628898,0.0010617215,0.00027107963,0.00061675743,0.0001046477,0.00046485316,0.0006193224,0.0012871339,0.8025675],"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.000039646206,0.0000678565,0.0000058934775,0.00097574474,0.00030634413,0.0002224486,0.00014205297,0.022317825,0.000028829041,0.0001354897,0.97534484,0.00041304363],"study_design_scores_gemma":[0.0009246883,0.00007927127,0.000005577427,0.00031017838,0.00032566945,0.000021939974,0.00008728792,0.02100461,0.000032447348,0.0000096495,0.9761193,0.0010793738],"about_ca_topic_score_codex":0.00006062277,"about_ca_topic_score_gemma":0.000030862822,"teacher_disagreement_score":0.7250965,"about_ca_system_score_codex":0.00016637584,"about_ca_system_score_gemma":0.00015840403,"threshold_uncertainty_score":0.9991833},"labels":[],"label_agreement":null},{"id":"W4398271453","doi":"10.7910/dvn/ii5jzg/c39hgb","title":"MSP_F_20_NFL_4_1.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; Geology; Paleontology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398271453","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6660535e-7,0.0000021058734,0.0006913882,0.000005504897,0.0013195632,0.00016894592,0.99589086,0.00044557554,0.0014758755],"genre_scores_gemma":[0.0000025853794,0.0010153534,0.000885499,0.00037492035,0.00032295138,0.000015468157,0.99713546,0.000055232118,0.00019255116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989115,0.000025838897,0.00027325354,0.00029395425,0.0002271242,0.00026832742],"domain_scores_gemma":[0.99892575,0.000029156958,0.000054234,0.0007813099,0.000026969408,0.00018258304],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007202656,0.00032198516,0.0003061317,0.00011482314,0.00005007116,0.00012077935,0.00050963403,0.00027465072,0.025336534],"category_scores_gemma":[0.00005377206,0.0003512029,0.00008416388,0.00020289715,0.000031388325,0.00015344148,0.00014724144,0.0004752528,0.41457477],"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.000004182291,0.000009845369,6.5478235e-7,0.0002765269,0.00006713606,0.000046047553,0.000015180666,0.007220869,0.0000068155255,0.0000123009795,0.9922036,0.00013687283],"study_design_scores_gemma":[0.00022445119,0.000014613245,0.0000011036577,0.000058709735,0.00006662503,0.0000062882814,0.000007692554,0.0029316526,0.000018282366,0.000006173379,0.99628127,0.00038312245],"about_ca_topic_score_codex":0.000021099522,"about_ca_topic_score_gemma":0.000023522447,"teacher_disagreement_score":0.38923824,"about_ca_system_score_codex":0.000048695892,"about_ca_system_score_gemma":0.0000368665,"threshold_uncertainty_score":0.999894},"labels":[],"label_agreement":null},{"id":"W4398273116","doi":"10.7910/dvn/ii5jzg/ao9usm","title":"MSP_F_50_NFL_4_25.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398273116","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1807345e-7,0.000002167907,0.0005860219,0.000005708015,0.0013621744,0.0001748243,0.99578744,0.00046508084,0.0016163614],"genre_scores_gemma":[0.0000028070588,0.001039475,0.00084715156,0.00038808663,0.00033642378,0.000014828946,0.99711734,0.000058027064,0.00019586906],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886286,0.000026453652,0.0002872297,0.0003069991,0.00023592044,0.00028055077],"domain_scores_gemma":[0.9988797,0.000029570983,0.000057027686,0.00081325124,0.000028079514,0.0001923925],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000074072566,0.0003365795,0.0003205609,0.0001196868,0.000053294985,0.000127369,0.00053394586,0.00028593923,0.028968966],"category_scores_gemma":[0.00005889773,0.0003682712,0.000088397115,0.00020917538,0.00003418214,0.00016196673,0.00015811506,0.00049617636,0.4208505],"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.0000044870085,0.000010180831,6.477438e-7,0.0002882289,0.00007036345,0.000048698203,0.000015868734,0.0075836503,0.0000063092216,0.000012263802,0.99182343,0.00013587724],"study_design_scores_gemma":[0.00023825273,0.000015132348,0.0000011675679,0.00006107216,0.000069545,0.000007700207,0.00000791076,0.003005341,0.000017851902,0.0000058346063,0.9961691,0.00040109368],"about_ca_topic_score_codex":0.000022607866,"about_ca_topic_score_gemma":0.000025122574,"teacher_disagreement_score":0.39188153,"about_ca_system_score_codex":0.0000512505,"about_ca_system_score_gemma":0.000037529262,"threshold_uncertainty_score":0.9998769},"labels":[],"label_agreement":null},{"id":"W4398279881","doi":"10.7910/dvn/ii5jzg/yw9lzh","title":"MSP_F_70_NFL_4_5.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398279881","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6497576e-7,0.0000017705722,0.0006421191,0.0000048869288,0.0013908447,0.00017198274,0.9949792,0.00045470695,0.002354341],"genre_scores_gemma":[0.0000030146218,0.0009316235,0.00081390026,0.00039744462,0.00037845186,0.000014101331,0.9972136,0.00005586311,0.00019197787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988971,0.000028042969,0.00027605332,0.0002990267,0.0002289078,0.00027087473],"domain_scores_gemma":[0.9989064,0.000032925032,0.000055624467,0.0007913009,0.00002737914,0.00018642005],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007507679,0.00032732336,0.00031445365,0.0001182684,0.00005058554,0.00012299854,0.0005253891,0.00027638837,0.02575307],"category_scores_gemma":[0.00006255666,0.0003583288,0.00008683093,0.0002066419,0.000032276075,0.0001607554,0.00015048584,0.00047914177,0.3962063],"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.000004427373,0.000009880796,6.1366745e-7,0.0002796388,0.000069182155,0.000047916703,0.000015201443,0.008037571,0.0000057274124,0.00001650694,0.9914018,0.00011153664],"study_design_scores_gemma":[0.00024066173,0.0000146922675,0.0000013470225,0.000058652917,0.00006932627,0.0000074976624,0.0000073674755,0.0025142655,0.000012645918,0.0000057700067,0.9966774,0.00039038016],"about_ca_topic_score_codex":0.00002417324,"about_ca_topic_score_gemma":0.000023301982,"teacher_disagreement_score":0.37045324,"about_ca_system_score_codex":0.00005843421,"about_ca_system_score_gemma":0.00004878902,"threshold_uncertainty_score":0.9998869},"labels":[],"label_agreement":null},{"id":"W4398281032","doi":"10.7910/dvn/ii5jzg/kf0in5","title":"MSP_F_20_NFL_4_42.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Computer science; Geology; Paleontology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398281032","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.1318794e-7,0.0000016546213,0.0005409534,0.0000054565976,0.0013074938,0.00016986419,0.9949584,0.00045001414,0.0025660482],"genre_scores_gemma":[0.0000021892918,0.001382933,0.0009156196,0.0003894683,0.00032269617,0.00001574454,0.9967357,0.000056123892,0.00017953318],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889976,0.000026351376,0.000276019,0.00029707552,0.00022952218,0.00027126423],"domain_scores_gemma":[0.9989113,0.000029805127,0.000055830627,0.0007907809,0.000027324799,0.00018491666],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000071614486,0.0003259434,0.0003129434,0.000116680654,0.000049501312,0.00012362895,0.0005143655,0.00027740007,0.021625794],"category_scores_gemma":[0.000060098908,0.000355781,0.000085164924,0.0002053219,0.00003348719,0.000154262,0.00014634781,0.00048803294,0.41536808],"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.0000042505244,0.000009805797,5.000575e-7,0.00027055125,0.000068187,0.00004620483,0.000015870572,0.009810409,0.0000045353727,0.000011158389,0.98960257,0.00015595499],"study_design_scores_gemma":[0.00022651388,0.00001497614,9.853541e-7,0.00005991689,0.000067425266,0.0000073635915,0.000008105354,0.004094741,0.000012063849,0.000005812355,0.99511474,0.00038737254],"about_ca_topic_score_codex":0.000022201295,"about_ca_topic_score_gemma":0.000023163824,"teacher_disagreement_score":0.3937423,"about_ca_system_score_codex":0.000049797003,"about_ca_system_score_gemma":0.000037446698,"threshold_uncertainty_score":0.99988943},"labels":[],"label_agreement":null},{"id":"W4398281610","doi":"10.7910/dvn/ii5jzg/q7mp1i","title":"MSP_F_150_NFL_4_12.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014444087784095496,"score_gpt":0.20862708665981544,"score_spread":0.19418299887571994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398281610","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9733918e-7,0.0000023291905,0.0006340776,0.000005907324,0.0013908435,0.0001776555,0.9958705,0.00047367677,0.0014448646],"genre_scores_gemma":[0.000003145946,0.0010651592,0.0008708773,0.0003871301,0.00034144413,0.00001672098,0.99706465,0.00005852409,0.00019233629],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988416,0.000027596816,0.00029167574,0.0003122138,0.00024108218,0.00028586242],"domain_scores_gemma":[0.998861,0.000030897674,0.00005801505,0.0008252294,0.000028987368,0.00019587742],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007668303,0.00034262147,0.00032638232,0.00012238316,0.000053826716,0.00012837209,0.00054145075,0.0002925511,0.02673173],"category_scores_gemma":[0.000062482584,0.0003747322,0.00009017171,0.00021274602,0.00003535086,0.0001646544,0.0001593993,0.00050827407,0.40930152],"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.0000045258657,0.000010356193,7.286178e-7,0.00029497806,0.00007154657,0.00004951763,0.000016626087,0.007822781,0.0000056498075,0.000012629282,0.99156797,0.00014268816],"study_design_scores_gemma":[0.00024235238,0.00001544849,0.0000013005421,0.0000640093,0.000071196046,0.000007909485,0.0000084067115,0.002850444,0.000015979107,0.000006174738,0.9963086,0.00040814624],"about_ca_topic_score_codex":0.00002346405,"about_ca_topic_score_gemma":0.000025570129,"teacher_disagreement_score":0.3825698,"about_ca_system_score_codex":0.00005217925,"about_ca_system_score_gemma":0.000038774575,"threshold_uncertainty_score":0.9998705},"labels":[],"label_agreement":null},{"id":"W4398287218","doi":"10.7910/dvn/ii5jzg/moimys","title":"MSP_F_50_NFL_4_9.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Computer science; History; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398287218","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7296848e-7,0.0000021587325,0.0006374547,0.000005478601,0.0013500443,0.00017268423,0.99574816,0.00045415954,0.0016297037],"genre_scores_gemma":[0.0000037081663,0.00078185654,0.0008461821,0.00037764493,0.0003289336,0.000015924785,0.99741364,0.00005638449,0.0001757154],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889266,0.000026240492,0.00028393732,0.0003033704,0.00023386593,0.00025991484],"domain_scores_gemma":[0.9988908,0.00002996068,0.000056168097,0.00080533326,0.000027943472,0.00018974827],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007405312,0.00033241737,0.00031684624,0.00011857522,0.000052294985,0.0001255683,0.00052608637,0.0002856223,0.024175825],"category_scores_gemma":[0.000060899663,0.00036357882,0.0000870544,0.00020957596,0.00003355628,0.00016012379,0.0001549323,0.00049641955,0.41167748],"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.0000043936984,0.000009994469,6.8757413e-7,0.0002874018,0.000069560374,0.000048170874,0.000012635524,0.0075598266,0.000005327731,0.000016038422,0.9918664,0.00011957395],"study_design_scores_gemma":[0.00023643809,0.000014904664,0.0000012092378,0.000060918133,0.000068940906,0.000007612092,0.000007800596,0.0029491964,0.000015271822,0.000006878971,0.996235,0.00039584283],"about_ca_topic_score_codex":0.000022143226,"about_ca_topic_score_gemma":0.000025150726,"teacher_disagreement_score":0.38750166,"about_ca_system_score_codex":0.00005066691,"about_ca_system_score_gemma":0.000037546306,"threshold_uncertainty_score":0.9998816},"labels":[],"label_agreement":null},{"id":"W4398291364","doi":"10.7910/dvn/ii5jzg/mbxxgh","title":"MSP_F_50_NFL_4_49.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Operations research; Mathematics; Artificial intelligence; Geography; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398291364","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.4202857e-7,0.0000021541357,0.000849335,0.0000055206965,0.0013601407,0.00017418005,0.9956239,0.0004599251,0.0015247158],"genre_scores_gemma":[0.0000021311666,0.001042388,0.0010826893,0.00037296908,0.00033955163,0.000016203128,0.9968971,0.000057206875,0.0001897654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988643,0.00002661696,0.00028675795,0.00030619785,0.0002359758,0.00028013356],"domain_scores_gemma":[0.99888295,0.00003027733,0.000057055953,0.00080919015,0.000028283084,0.00019223594],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007426749,0.00033640902,0.00031989074,0.0001197246,0.00005317068,0.0001268167,0.000531924,0.00028494836,0.027933314],"category_scores_gemma":[0.000060076574,0.0003681899,0.00008825921,0.00021140868,0.000034167355,0.00016138222,0.00015670403,0.0004946523,0.41127145],"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.0000044537705,0.0000101235955,5.7086027e-7,0.0002887847,0.00007053327,0.00004826545,0.00001579081,0.00752652,0.000008961496,0.000010133315,0.9918464,0.00016950663],"study_design_scores_gemma":[0.00023564429,0.000014970886,0.0000013132648,0.00006130891,0.000069829504,0.000010182738,0.000007968088,0.0025476774,0.000017296754,0.0000057352413,0.99662673,0.00040134825],"about_ca_topic_score_codex":0.000029290588,"about_ca_topic_score_gemma":0.000031658885,"teacher_disagreement_score":0.38333815,"about_ca_system_score_codex":0.0000513216,"about_ca_system_score_gemma":0.00003814705,"threshold_uncertainty_score":0.999877},"labels":[],"label_agreement":null},{"id":"W4398291406","doi":"10.7910/dvn/ii5jzg/hcc2q5","title":"MSP_F_100_NFL_4_22.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.01407897303491542,"score_gpt":0.2087701466747898,"score_spread":0.19469117363987437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398291406","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0335818e-7,0.0000021496523,0.00064241927,0.0000053677936,0.0013936786,0.0001757861,0.9957357,0.00046572188,0.0015789589],"genre_scores_gemma":[0.0000041314315,0.0008293906,0.0008026234,0.0003630105,0.00033002844,0.000016126325,0.9974217,0.000058650137,0.00017437224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988599,0.000028414419,0.0002919547,0.00031111427,0.00024190334,0.00026670375],"domain_scores_gemma":[0.9988612,0.00003199564,0.00005818541,0.0008239549,0.000029805802,0.00019488505],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007884229,0.0003417257,0.0003293958,0.0001227718,0.000053217955,0.00012764438,0.0005392875,0.00028948183,0.022605326],"category_scores_gemma":[0.000060444392,0.00037396292,0.000089976485,0.00021836869,0.00003514813,0.00016300836,0.0001591034,0.0005006836,0.4070913],"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.000004428962,0.000010153586,7.023836e-7,0.0002945769,0.00007127228,0.000049941173,0.000012440017,0.0076731225,0.0000055786213,0.000016568869,0.99173003,0.00013118314],"study_design_scores_gemma":[0.00024077496,0.000014863081,0.0000012101164,0.00006187956,0.000069629976,0.00000785119,0.000008493158,0.0029051127,0.000015428877,0.0000069791904,0.9962605,0.00040723014],"about_ca_topic_score_codex":0.000026060427,"about_ca_topic_score_gemma":0.000027636173,"teacher_disagreement_score":0.38448596,"about_ca_system_score_codex":0.000053069612,"about_ca_system_score_gemma":0.00004025832,"threshold_uncertainty_score":0.99987125},"labels":[],"label_agreement":null},{"id":"W4398296177","doi":"10.7910/dvn/ii5jzg/9r26jd","title":"MSP_F_70_NFL_4_26.xlsx","year":2020,"lang":"pt","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Operations research; Computer science; History; Mathematics; Artificial intelligence; Archaeology","score_opus":0.019775236604175357,"score_gpt":0.2253684998009558,"score_spread":0.20559326319678045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398296177","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012500333,0.0000061930205,0.0052794092,0.00003873747,0.0032535694,0.0005490227,0.98774046,0.00053496304,0.0025963823],"genre_scores_gemma":[0.000056993074,0.002389148,0.0022677137,0.000927796,0.0007959735,0.00003031211,0.9918056,0.00018453143,0.0015418945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99667615,0.00013362571,0.0008416693,0.00095592026,0.00060573325,0.00078688725],"domain_scores_gemma":[0.9969693,0.000115463234,0.00025838616,0.0019322608,0.000100564685,0.00062402256],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025700592,0.00092479534,0.00086792087,0.00029297473,0.0002095639,0.00043592433,0.0013045134,0.0007406274,0.10743727],"category_scores_gemma":[0.00027348517,0.0010766407,0.00027597538,0.0006270717,0.00010595172,0.000469652,0.000626374,0.0013035361,0.8055872],"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.000039767918,0.00006908793,0.000008148569,0.0009796218,0.00031091523,0.00022469032,0.00018184625,0.0222836,0.00003072156,0.00014166,0.9753075,0.00042242333],"study_design_scores_gemma":[0.0009349733,0.00008052286,0.000006890372,0.00031401395,0.0003291045,0.000028158296,0.000091213595,0.021090493,0.000033781478,0.0000100315465,0.9759868,0.0010940449],"about_ca_topic_score_codex":0.00008317027,"about_ca_topic_score_gemma":0.000045877423,"teacher_disagreement_score":0.6981499,"about_ca_system_score_codex":0.00016900185,"about_ca_system_score_gemma":0.00016182658,"threshold_uncertainty_score":0.9991684},"labels":[],"label_agreement":null},{"id":"W4398299432","doi":"10.7910/dvn/ii5jzg/xlv9os","title":"MSP_F_70_NFL_4_38.xlsx","year":2020,"lang":"tl","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; Geography; Archaeology","score_opus":0.01787398217247222,"score_gpt":0.21874876145742975,"score_spread":0.20087477928495753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398299432","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015844695,0.0000062264153,0.0036683592,0.000039435978,0.0032613082,0.00054606795,0.9880491,0.0005391607,0.0038887782],"genre_scores_gemma":[0.000050172555,0.0030191117,0.004132625,0.00091826654,0.0009958143,0.00002977796,0.9896566,0.00017823887,0.0010193461],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665505,0.00013695296,0.0008444793,0.00096731726,0.0006055131,0.000790709],"domain_scores_gemma":[0.99689287,0.00012520509,0.00026072722,0.0020010208,0.0001011689,0.0006189832],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027097057,0.00091895234,0.00086795416,0.0002825694,0.00021010442,0.0004554034,0.0013493665,0.0007388006,0.11008277],"category_scores_gemma":[0.00030656683,0.001066846,0.00027267655,0.0006111699,0.00011876239,0.00048283505,0.00065169873,0.0013034211,0.8105924],"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.000040661016,0.00006820804,0.000008082659,0.00094965793,0.00030889764,0.00023225634,0.00014367724,0.020418959,0.000033530185,0.00019978652,0.9771524,0.0004438532],"study_design_scores_gemma":[0.0009413662,0.00007940444,0.00000785282,0.00031494125,0.0003298614,0.000028182712,0.000069754504,0.017047072,0.000035214158,0.000017369875,0.9800351,0.0010938391],"about_ca_topic_score_codex":0.000098410186,"about_ca_topic_score_gemma":0.000048231297,"teacher_disagreement_score":0.70050967,"about_ca_system_score_codex":0.00017237983,"about_ca_system_score_gemma":0.00016665783,"threshold_uncertainty_score":0.9991782},"labels":[],"label_agreement":null},{"id":"W4398310234","doi":"10.7910/dvn/ii5jzg/7knz3g","title":"MSP_F_50_NFL_4_21.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; Geography; Archaeology","score_opus":0.01453234708606665,"score_gpt":0.20858189834611252,"score_spread":0.19404955126004586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398310234","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.970646e-7,0.0000021886217,0.00061583077,0.0000055335104,0.0013858137,0.00017506722,0.99579346,0.0004628449,0.0015590735],"genre_scores_gemma":[0.0000028690943,0.0010497763,0.00085694634,0.0003729388,0.0003385418,0.000016088115,0.9971129,0.000057306883,0.00019267657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988586,0.000026621985,0.00028851934,0.00030758337,0.00023709371,0.00028158893],"domain_scores_gemma":[0.9988758,0.00003133386,0.000057165224,0.00081449165,0.000028386527,0.00019280531],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007467917,0.00033752838,0.00032159968,0.00012077657,0.000053270145,0.00012722566,0.00053356227,0.00028622485,0.02829655],"category_scores_gemma":[0.0000626214,0.00036912435,0.00008855521,0.00021345259,0.000034242326,0.00016253658,0.00015703577,0.0004976933,0.4121314],"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.0000044982094,0.000010195628,6.7547427e-7,0.00028566923,0.00007063455,0.000048916674,0.000015731552,0.007914894,0.0000056024696,0.000012380295,0.9914948,0.00013600352],"study_design_scores_gemma":[0.00023940684,0.000015178059,0.0000012358638,0.000063009655,0.00007001043,0.000007778264,0.000007900376,0.0029920246,0.00001580475,0.000005933369,0.9961797,0.00040202975],"about_ca_topic_score_codex":0.000022825467,"about_ca_topic_score_gemma":0.00002539948,"teacher_disagreement_score":0.38383484,"about_ca_system_score_codex":0.000051470368,"about_ca_system_score_gemma":0.000038284117,"threshold_uncertainty_score":0.9998761},"labels":[],"label_agreement":null},{"id":"W4398311724","doi":"10.7910/dvn/ii5jzg/zybfll","title":"MSP_F_70_NFL_4_50.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Computer science; Geology; Paleontology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398311724","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0504383e-7,0.0000021050193,0.0007000259,0.000005117026,0.0013402478,0.00017542348,0.99583864,0.00045718125,0.0014810578],"genre_scores_gemma":[0.0000034241796,0.0010176596,0.00084286794,0.00036744302,0.00034267877,0.000015283982,0.99716747,0.00005684754,0.00018635426],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988799,0.000026481453,0.00028071442,0.00030379018,0.00023282386,0.00027628985],"domain_scores_gemma":[0.99889356,0.000030407306,0.000056644076,0.0008016711,0.00002796445,0.00018974322],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007278411,0.00033289503,0.0003196935,0.00012042644,0.00005239676,0.00012040624,0.00052566524,0.00028280017,0.02676703],"category_scores_gemma":[0.000058658003,0.00036424928,0.000088537505,0.00021058784,0.00003351397,0.00015865054,0.00015076407,0.0004887932,0.4034828],"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.000004536436,0.000009877325,6.786553e-7,0.000286083,0.00007057317,0.000050524188,0.000015269943,0.008355541,0.0000057953794,0.000010778828,0.9910473,0.0001430052],"study_design_scores_gemma":[0.00024476025,0.0000149725,0.0000014517419,0.000059961523,0.00007086489,0.000007821226,0.000008239923,0.0032550779,0.00001350307,0.0000058162905,0.9959209,0.00039660503],"about_ca_topic_score_codex":0.000022761116,"about_ca_topic_score_gemma":0.000024371271,"teacher_disagreement_score":0.37671578,"about_ca_system_score_codex":0.000051573646,"about_ca_system_score_gemma":0.000037605183,"threshold_uncertainty_score":0.99988097},"labels":[],"label_agreement":null},{"id":"W4398312027","doi":"10.7910/dvn/ii5jzg/yqzdcm","title":"MSP_F_70_NFL_4_40.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398312027","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8174882e-7,0.0000021131464,0.000709498,0.00000585313,0.0013438102,0.00017547655,0.99578995,0.00046274165,0.0015103931],"genre_scores_gemma":[0.000003066538,0.001014926,0.00084291375,0.00037010986,0.00034406708,0.000015267835,0.99716496,0.00005690027,0.00018777317],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887663,0.000026564934,0.00028158564,0.00030486143,0.00023313823,0.00027719722],"domain_scores_gemma":[0.99889046,0.000030509693,0.00005677877,0.0008038694,0.000028019076,0.00019038981],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000073112664,0.00033334835,0.00032046178,0.00012069602,0.00005251968,0.00012389665,0.0005277525,0.000283281,0.027070835],"category_scores_gemma":[0.00005933075,0.000364935,0.00008861439,0.0002112419,0.000033624714,0.00016345989,0.00015092912,0.0004902669,0.4004241],"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.000004540478,0.000010102554,6.0858605e-7,0.00028624194,0.00007061112,0.000050492425,0.000015235307,0.008461671,0.0000059627614,0.000013005836,0.9909365,0.00014502878],"study_design_scores_gemma":[0.0002454353,0.000015019665,0.0000011768411,0.000059943224,0.00007091567,0.000007811631,0.000008243399,0.0032399355,0.000013839042,0.000006380819,0.99593407,0.000397245],"about_ca_topic_score_codex":0.000022106817,"about_ca_topic_score_gemma":0.000024527708,"teacher_disagreement_score":0.37335324,"about_ca_system_score_codex":0.000051744402,"about_ca_system_score_gemma":0.0000387256,"threshold_uncertainty_score":0.99988025},"labels":[],"label_agreement":null},{"id":"W4398318671","doi":"10.7910/dvn/ii5jzg/a3voh8","title":"MSP_F_70_NFL_4_47.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398318671","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.784379e-7,0.0000020688947,0.0007153674,0.0000059781446,0.0013434815,0.00017543208,0.9957589,0.00046257544,0.0015360109],"genre_scores_gemma":[0.0000030938913,0.001020717,0.00083679025,0.00037359245,0.00034402744,0.000015269668,0.997164,0.00005689189,0.00018559337],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887735,0.000026509702,0.0002814802,0.00030452356,0.00023303233,0.00027710127],"domain_scores_gemma":[0.998891,0.000030455716,0.000056751152,0.00080347696,0.000027999593,0.00019034678],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007295536,0.0003332631,0.00032035907,0.00012067956,0.000052789997,0.00012372722,0.0005273188,0.00028322602,0.027027745],"category_scores_gemma":[0.00005917193,0.0003648483,0.00008858829,0.00021118853,0.00003374836,0.0001630332,0.00015080575,0.00049009005,0.39966276],"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.0000045369457,0.00001009808,6.1749245e-7,0.00028604906,0.00007059698,0.00005046539,0.00001526114,0.00852473,0.000005816016,0.0000130567505,0.99087423,0.0001445477],"study_design_scores_gemma":[0.00024528848,0.000015010379,0.0000011953164,0.000059844577,0.00007102136,0.000007807344,0.000008359573,0.0033269767,0.00001361668,0.0000060943867,0.9958477,0.0003970942],"about_ca_topic_score_codex":0.00002169234,"about_ca_topic_score_gemma":0.00002503865,"teacher_disagreement_score":0.372635,"about_ca_system_score_codex":0.000051423795,"about_ca_system_score_gemma":0.000038209113,"threshold_uncertainty_score":0.9998804},"labels":[],"label_agreement":null},{"id":"W4398320139","doi":"10.7910/dvn/ii5jzg/ma3iqr","title":"MSP_F_70_NFL_4_25.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398320139","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.720487e-7,0.0000021145215,0.00070756505,0.000006068819,0.0013404045,0.00017450712,0.99574876,0.0004652914,0.0015551111],"genre_scores_gemma":[0.000002908477,0.0010101172,0.00084802957,0.00038120413,0.0003430646,0.00001391686,0.99715275,0.000057614954,0.00019041027],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988808,0.000026383357,0.00028050996,0.00030407787,0.00023205006,0.0002761933],"domain_scores_gemma":[0.998893,0.000029681074,0.000056667188,0.00080282945,0.000027833354,0.00018995491],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007246976,0.00033247095,0.00031948282,0.000120219665,0.000052500654,0.00012402408,0.0005284881,0.0002830163,0.027773837],"category_scores_gemma":[0.000057740417,0.00036410362,0.00008847109,0.00020755743,0.000033557415,0.00016298227,0.00015199598,0.0004888731,0.40887412],"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.0000045188713,0.000010089163,5.7367004e-7,0.00028407923,0.00007039052,0.00005030594,0.000015059998,0.008417364,0.0000057983193,0.000013052034,0.99097955,0.00014918872],"study_design_scores_gemma":[0.00024421804,0.000014951295,0.000001139806,0.000059437272,0.0000704401,0.00000779896,0.0000080693935,0.0034647926,0.000013649509,0.0000061096302,0.9957131,0.0003962629],"about_ca_topic_score_codex":0.000021836722,"about_ca_topic_score_gemma":0.000024123712,"teacher_disagreement_score":0.3811003,"about_ca_system_score_codex":0.000051169398,"about_ca_system_score_gemma":0.0000374221,"threshold_uncertainty_score":0.9998811},"labels":[],"label_agreement":null},{"id":"W4398322454","doi":"10.7910/dvn/ii5jzg/zpv1rq","title":"MSP_F_50_NFL_4_3.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398322454","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.5476311e-7,0.000002439266,0.0006141891,0.0000058182873,0.0012636713,0.00017275488,0.996171,0.00044298012,0.0013270177],"genre_scores_gemma":[0.0000029761452,0.0011097469,0.00083672814,0.00036191253,0.00032349423,0.000016064472,0.9971122,0.000055863507,0.00018101059],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988781,0.000026759308,0.00027932526,0.00030106443,0.00023585708,0.0002788793],"domain_scores_gemma":[0.9988968,0.00003077159,0.00005417181,0.0007996458,0.00002749467,0.00019116471],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000074141615,0.0003277483,0.00031128273,0.00012026742,0.00005236841,0.00012278077,0.0005302767,0.00027152462,0.022820896],"category_scores_gemma":[0.00005958002,0.00035836064,0.000085954176,0.00020773502,0.000034502627,0.00015774602,0.00016007802,0.0004926021,0.39022577],"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.0000043284454,0.000009944176,7.200876e-7,0.00028954825,0.00006831934,0.0000485316,0.000016223761,0.007008225,0.000007697415,0.000011850204,0.9923654,0.000169198],"study_design_scores_gemma":[0.00022953088,0.000015009309,0.0000012604564,0.00005172923,0.000065519685,0.000007594223,0.000007746283,0.002883809,0.000021607653,0.000006276283,0.9963204,0.00038946443],"about_ca_topic_score_codex":0.000023220344,"about_ca_topic_score_gemma":0.000019864481,"teacher_disagreement_score":0.36740488,"about_ca_system_score_codex":0.000049679842,"about_ca_system_score_gemma":0.00003728275,"threshold_uncertainty_score":0.9998868},"labels":[],"label_agreement":null},{"id":"W4398325670","doi":"10.7910/dvn/ii5jzg/pydfyv","title":"MSP_F_100_NFL_4_9.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Computer science; History; Archaeology","score_opus":0.01407897303491542,"score_gpt":0.2087701466747898,"score_spread":0.19469117363987437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398325670","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9097565e-7,0.000002200011,0.0006444741,0.000005573569,0.0013837595,0.00017326178,0.9957893,0.000462526,0.001538713],"genre_scores_gemma":[0.0000031289749,0.0010409665,0.00082160777,0.00037473367,0.00033341433,0.000015786605,0.99716085,0.000057706,0.00019182074],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885815,0.000027887441,0.00028768578,0.0003073138,0.00023871264,0.00028027483],"domain_scores_gemma":[0.998873,0.00003251691,0.00005725348,0.0008159185,0.00002936692,0.00019196008],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007784969,0.00033658007,0.0003235639,0.000120971,0.00005259599,0.00012614547,0.0005320602,0.00028915642,0.02774033],"category_scores_gemma":[0.00006273386,0.0003682189,0.00008845906,0.00021518454,0.000034110293,0.00016200899,0.00015699674,0.00050028187,0.40869752],"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.0000043257874,0.000009960866,7.255141e-7,0.00029077203,0.00007032228,0.000049102993,0.000015438654,0.007824992,0.0000052796368,0.000011966936,0.9915722,0.00014492476],"study_design_scores_gemma":[0.00023754586,0.000014783038,0.0000012872513,0.000061152765,0.000068565154,0.000007674876,0.000007815309,0.0030209157,0.000014780911,0.0000056599056,0.99615866,0.00040113644],"about_ca_topic_score_codex":0.000024327634,"about_ca_topic_score_gemma":0.0000259394,"teacher_disagreement_score":0.3809572,"about_ca_system_score_codex":0.000052311905,"about_ca_system_score_gemma":0.000039370796,"threshold_uncertainty_score":0.999877},"labels":[],"label_agreement":null},{"id":"W4398327611","doi":"10.7910/dvn/ii5jzg/b2wygf","title":"MSP_F_70_NFL_4_49.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Operations research; Computer science; Mathematics; Artificial intelligence; Geography; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398327611","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.5184863e-7,0.0000019865756,0.0006159569,0.0000056356007,0.001336123,0.00017502258,0.99606216,0.0004622957,0.0013405876],"genre_scores_gemma":[0.0000037481593,0.00096289214,0.0009269616,0.00036832454,0.000344301,0.000015250136,0.9971733,0.000056805304,0.0001484038],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888617,0.000026402393,0.00028174397,0.00030347126,0.00022628027,0.0002759258],"domain_scores_gemma":[0.9988929,0.00003021258,0.000056827386,0.0008018386,0.000027940629,0.0001902841],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007193783,0.00033245364,0.00031939705,0.00012281108,0.00005173621,0.0001236678,0.00052629,0.00028258443,0.025942063],"category_scores_gemma":[0.00005908767,0.00036386473,0.00008840555,0.00021433788,0.000033278906,0.00016389208,0.00015061609,0.0004886263,0.39823127],"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.000004519303,0.000010065204,8.9865915e-7,0.00028040467,0.000070275535,0.00004948121,0.0000160272,0.007866835,0.000006143953,0.000009819609,0.99153185,0.00015366351],"study_design_scores_gemma":[0.0002429545,0.000014981096,0.0000014588966,0.00005898374,0.00007056642,0.000007753582,0.000011337951,0.0029741542,0.000016705295,0.0000058088553,0.99619925,0.00039605788],"about_ca_topic_score_codex":0.000023266139,"about_ca_topic_score_gemma":0.000028381313,"teacher_disagreement_score":0.3722892,"about_ca_system_score_codex":0.000054220687,"about_ca_system_score_gemma":0.00004095723,"threshold_uncertainty_score":0.9998813},"labels":[],"label_agreement":null},{"id":"W4398336719","doi":"10.7910/dvn/ii5jzg/zlt83u","title":"MSP_F_20_NFL_4_2.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Operations research; Mathematics; Geography; Artificial intelligence; Archaeology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398336719","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7383258e-7,0.0000020540335,0.00068080577,0.000005169588,0.0013170285,0.00016736361,0.99584395,0.00044408246,0.0015393769],"genre_scores_gemma":[0.0000026810399,0.0009957001,0.00088958256,0.00036478293,0.00032015992,0.00001543151,0.9971646,0.00005524697,0.00019179571],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891376,0.000025793503,0.00027326023,0.00029382066,0.00022532362,0.0002680263],"domain_scores_gemma":[0.9989265,0.000028399289,0.000054269072,0.0007811049,0.000026847454,0.0001828525],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007172262,0.0003219077,0.0003060677,0.00011489104,0.00004980379,0.00011871106,0.00051014154,0.00027436312,0.02722045],"category_scores_gemma":[0.000056770295,0.00035122596,0.00008412326,0.00020231523,0.000031842806,0.00015348136,0.0001474944,0.0004740664,0.4151651],"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.0000041220396,0.000009736479,6.8800836e-7,0.00027297423,0.00006744882,0.00004628398,0.00001557847,0.0069095534,0.000005536568,0.000012069785,0.992519,0.00013701529],"study_design_scores_gemma":[0.00022583017,0.000014556024,0.000001232075,0.00005807048,0.0000669552,0.0000072369853,0.0000074566146,0.0029480085,0.000015331678,0.0000059443696,0.99626625,0.000383128],"about_ca_topic_score_codex":0.000022318512,"about_ca_topic_score_gemma":0.000023812847,"teacher_disagreement_score":0.38794464,"about_ca_system_score_codex":0.00004820679,"about_ca_system_score_gemma":0.000036798723,"threshold_uncertainty_score":0.99989396},"labels":[],"label_agreement":null},{"id":"W4398339543","doi":"10.7910/dvn/ii5jzg/9vk2ee","title":"MSP_F_150_NFL_4_14.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence","score_opus":0.014449540089568514,"score_gpt":0.20857309818440467,"score_spread":0.19412355809483617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398339543","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9847596e-7,0.0000023520815,0.0006273978,0.00000612345,0.0013701445,0.00017767564,0.9958873,0.0004734916,0.0014553284],"genre_scores_gemma":[0.0000030108652,0.0010669336,0.0009017694,0.00038632556,0.00034462402,0.000016699294,0.9970336,0.000058519494,0.00018850745],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884635,0.00002721611,0.0002864561,0.00031316685,0.00024106068,0.00028572525],"domain_scores_gemma":[0.99885803,0.000030887335,0.00005812989,0.00082748034,0.000029648794,0.00019581919],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000758624,0.0003425148,0.00032619905,0.00012256879,0.00005368272,0.00012846707,0.00054232794,0.00029130717,0.026806774],"category_scores_gemma":[0.00006264083,0.00037465672,0.00009013631,0.00021702278,0.000035419016,0.00016473846,0.0001595238,0.0005048608,0.4093742],"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.000004462722,0.000010302976,6.976712e-7,0.0002933622,0.00007157862,0.000049483257,0.00001683143,0.0075475187,0.0000057492325,0.000012968091,0.9918495,0.00013756948],"study_design_scores_gemma":[0.00024155185,0.00001540144,0.000001268507,0.000062375555,0.000071232294,0.0000078863395,0.000008926201,0.002822443,0.000015558038,0.000006261546,0.9963391,0.00040802863],"about_ca_topic_score_codex":0.000022991546,"about_ca_topic_score_gemma":0.000024527842,"teacher_disagreement_score":0.38256744,"about_ca_system_score_codex":0.000053067917,"about_ca_system_score_gemma":0.00003924452,"threshold_uncertainty_score":0.99987054},"labels":[],"label_agreement":null},{"id":"W4398353362","doi":"10.7910/dvn/ii5jzg/ry4y3c","title":"MSP_F_70_NFL_4_22.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Mathematics; Geology; Artificial intelligence; Paleontology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398353362","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.791654e-7,0.0000020886048,0.0007429429,0.0000057640377,0.0013429871,0.00017543852,0.99572575,0.00045772071,0.0015471565],"genre_scores_gemma":[0.0000032703792,0.0010214478,0.0008000324,0.0003684686,0.00034015352,0.000015266667,0.9972068,0.00005688848,0.00018765332],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988631,0.000026539925,0.00029572123,0.00030450607,0.00023303698,0.00027710662],"domain_scores_gemma":[0.9988896,0.000032009535,0.000056750312,0.00080329773,0.000027985488,0.0001903562],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000076398894,0.0003332981,0.00032144235,0.00012064298,0.000052399526,0.00012387395,0.00052774063,0.00028327573,0.026612287],"category_scores_gemma":[0.000059660353,0.00036488974,0.00008859079,0.00021111727,0.00003359362,0.00016109267,0.00015093728,0.00049002335,0.39834008],"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.0000045319844,0.0000100983125,6.1940756e-7,0.00028724092,0.00007043816,0.00005056216,0.000015020026,0.008168626,0.000005844628,0.00001379059,0.9912209,0.00015234537],"study_design_scores_gemma":[0.0002455676,0.000014814123,0.0000011806717,0.0000600651,0.000070880815,0.000007820112,0.00000858396,0.0032569543,0.000013543156,0.0000063755383,0.995917,0.00039716932],"about_ca_topic_score_codex":0.000022042776,"about_ca_topic_score_gemma":0.000024418983,"teacher_disagreement_score":0.3717278,"about_ca_system_score_codex":0.000051362786,"about_ca_system_score_gemma":0.000040275314,"threshold_uncertainty_score":0.9998803},"labels":[],"label_agreement":null},{"id":"W4398355138","doi":"10.7910/dvn/ii5jzg/cdwts7","title":"MSP_F_70_NFL_4_20.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398355138","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7372359e-7,0.000002072833,0.00066966837,0.0000057174057,0.0013137889,0.00016996486,0.9958077,0.00044780428,0.0015831033],"genre_scores_gemma":[0.0000028783056,0.0009852718,0.0008245862,0.00036114606,0.0003371596,0.000014558184,0.9972198,0.00005554876,0.00019902429],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989107,0.000025598598,0.00027238086,0.00029562722,0.0002268907,0.0002687743],"domain_scores_gemma":[0.9989227,0.000029111718,0.000054862896,0.00078215305,0.000027091772,0.0001840755],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007073913,0.00032315665,0.000310923,0.00011505066,0.00005046824,0.0001194309,0.00051148754,0.00027587742,0.02734977],"category_scores_gemma":[0.000056945588,0.00035298007,0.00008603108,0.00020413627,0.00003240974,0.00015678667,0.00014613039,0.00047565828,0.40742782],"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.0000043001173,0.000009751859,5.9063336e-7,0.00027610603,0.00006818994,0.000048572652,0.000014657913,0.007997503,0.000005687433,0.000012866369,0.9914175,0.0001442543],"study_design_scores_gemma":[0.00023683009,0.000014429755,0.0000011544095,0.000058030262,0.00006857608,0.0000074793406,0.000007970756,0.003278874,0.000013257364,0.0000060179455,0.99592257,0.00038479347],"about_ca_topic_score_codex":0.000021309588,"about_ca_topic_score_gemma":0.000023938843,"teacher_disagreement_score":0.38007805,"about_ca_system_score_codex":0.00005036446,"about_ca_system_score_gemma":0.000037511796,"threshold_uncertainty_score":0.99989223},"labels":[],"label_agreement":null},{"id":"W4398389429","doi":"10.7910/dvn/ii5jzg/mxmugs","title":"MSP_F_50_NFL_4_14.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Mathematics; Artificial intelligence; Geography; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398389429","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9408206e-7,0.0000022780266,0.0006066895,0.0000059664835,0.0013519163,0.0001751501,0.9958835,0.00046227325,0.0015119979],"genre_scores_gemma":[0.0000029559326,0.0010635803,0.0008747929,0.00037473664,0.00033889257,0.000016202095,0.99707574,0.00005724347,0.00019585964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988642,0.000026628253,0.00028281927,0.00030815968,0.00023707612,0.0002811504],"domain_scores_gemma":[0.998875,0.000030393108,0.00005711408,0.0008158874,0.000029023635,0.0001925582],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007481008,0.00033711866,0.00032071807,0.00012048395,0.000053049724,0.0001272624,0.0005343271,0.00028638323,0.027625345],"category_scores_gemma":[0.000061614315,0.00036882085,0.00008839634,0.00021282282,0.000034268844,0.00016230805,0.00015712147,0.00035899013,0.41067225],"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.000004456936,0.000010215074,6.8481546e-7,0.00028683632,0.00007051807,0.000048671547,0.000016188946,0.007505615,0.0000060059147,0.00001278944,0.99190784,0.00013015575],"study_design_scores_gemma":[0.00023466663,0.000015054621,0.0000012245163,0.00006148788,0.0000698401,0.000007715344,0.000008444435,0.002777263,0.000016252217,0.0000060243215,0.9964003,0.0004017194],"about_ca_topic_score_codex":0.00002234928,"about_ca_topic_score_gemma":0.00002424055,"teacher_disagreement_score":0.3830469,"about_ca_system_score_codex":0.00005239341,"about_ca_system_score_gemma":0.000038520717,"threshold_uncertainty_score":0.9998764},"labels":[],"label_agreement":null},{"id":"W4398390692","doi":"10.7910/dvn/ii5jzg/eqduzo","title":"MSP_F_20_NFL_4_5.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398390692","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6791506e-7,0.0000020505101,0.0006872388,0.000005434209,0.001325052,0.00016959454,0.9957909,0.00044469303,0.0015748526],"genre_scores_gemma":[0.0000026391508,0.0009857407,0.00088674243,0.00037270988,0.00032648107,0.000014628908,0.99715996,0.000055269953,0.00019584212],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989106,0.000025864605,0.00027339516,0.00029425227,0.00022723546,0.00026863365],"domain_scores_gemma":[0.9989243,0.000028828956,0.000054278356,0.0007824408,0.000026948657,0.0001831592],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007201597,0.0003222188,0.00030668202,0.00011490687,0.000050048628,0.00012087441,0.0005098075,0.00027429403,0.026117079],"category_scores_gemma":[0.00005727766,0.00035148507,0.000084202846,0.00020283663,0.00003184915,0.0001533782,0.00014759123,0.0004755962,0.4148873],"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.0000041857197,0.000009662286,6.062735e-7,0.00027408608,0.00006709099,0.000046195044,0.000015605807,0.007387451,0.000005552094,0.000011810346,0.99203545,0.00014230842],"study_design_scores_gemma":[0.00022717456,0.0000145108415,0.0000011411313,0.000058648006,0.00006638545,0.0000071962245,0.000007694896,0.0031769462,0.000014815658,0.000005848434,0.9960363,0.00038334157],"about_ca_topic_score_codex":0.00002197775,"about_ca_topic_score_gemma":0.000024052959,"teacher_disagreement_score":0.38877022,"about_ca_system_score_codex":0.000048886024,"about_ca_system_score_gemma":0.000037036025,"threshold_uncertainty_score":0.9998937},"labels":[],"label_agreement":null},{"id":"W4398393452","doi":"10.7910/dvn/ii5jzg/75fshk","title":"MSP_F_70_NFL_4_10.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014389301389219112,"score_gpt":0.20816035075972894,"score_spread":0.19377104937050982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398393452","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7491922e-7,0.000002157508,0.0006980957,0.0000058775527,0.0013201438,0.00017501907,0.9958315,0.00046231286,0.0015047328],"genre_scores_gemma":[0.0000029982425,0.0009962292,0.0008377545,0.00036523593,0.00034409604,0.000015254878,0.99718606,0.000056801236,0.00019557012],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998878,0.000026524849,0.00028124003,0.00030432496,0.00023301285,0.00027690644],"domain_scores_gemma":[0.9988919,0.000030294374,0.000056742672,0.0008028142,0.000028058183,0.00019017168],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000726677,0.000333113,0.00031978957,0.00012054655,0.000052469342,0.00012382134,0.0005274475,0.00028307395,0.028599903],"category_scores_gemma":[0.000059279344,0.00036472097,0.00009239317,0.00021083382,0.000033599397,0.00016337533,0.00015083265,0.000491045,0.412194],"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.000004488181,0.000010097548,7.666751e-7,0.0002856946,0.00007222751,0.000049945465,0.000015015589,0.00823049,0.0000057567804,0.000012626089,0.9911678,0.00014510985],"study_design_scores_gemma":[0.00024360082,0.0000149610205,0.0000014852169,0.000059812,0.00007179743,0.0000077347395,0.000008080551,0.0032400114,0.000013600483,0.000006117918,0.9959358,0.00039698364],"about_ca_topic_score_codex":0.000022915716,"about_ca_topic_score_gemma":0.000024719377,"teacher_disagreement_score":0.3835941,"about_ca_system_score_codex":0.000051652132,"about_ca_system_score_gemma":0.000038310045,"threshold_uncertainty_score":0.9998805},"labels":[],"label_agreement":null},{"id":"W4398396582","doi":"10.7910/dvn/ii5jzg/ott3sb","title":"MSP_F_70_NFL_4_39.xlsx","year":2020,"lang":"tl","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.01787398217247222,"score_gpt":0.21874876145742975,"score_spread":0.20087477928495753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398396582","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015627385,0.0000064337146,0.0036126056,0.000039708575,0.0032619343,0.00054589903,0.98812383,0.00053942687,0.0038685717],"genre_scores_gemma":[0.000051139697,0.0030413533,0.0039632386,0.000923005,0.0010127809,0.00002977342,0.98978776,0.00017828704,0.0010126587],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966651,0.00013701817,0.0008450804,0.00095576595,0.00060597755,0.0007910522],"domain_scores_gemma":[0.9969182,0.00012339732,0.00026087827,0.0019770213,0.00010125367,0.00061926676],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026812442,0.00091916154,0.00086805195,0.0002828024,0.00021022091,0.00045585973,0.0013501967,0.0007390014,0.11029524],"category_scores_gemma":[0.00029859884,0.0010669772,0.0002727339,0.0006118567,0.00011886291,0.00048332228,0.0006519477,0.0013038402,0.81137],"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.00004075264,0.000068430745,0.000008296568,0.0009574931,0.00030883355,0.00023239185,0.00014094937,0.01993541,0.000032805194,0.00020558642,0.9776219,0.0004471305],"study_design_scores_gemma":[0.0009430605,0.000079336365,0.000008056886,0.00031670398,0.00033326214,0.000028215274,0.000068866735,0.016355375,0.000034740748,0.000017099695,0.9807205,0.0010947902],"about_ca_topic_score_codex":0.00009953123,"about_ca_topic_score_gemma":0.000049128153,"teacher_disagreement_score":0.7010748,"about_ca_system_score_codex":0.00017256304,"about_ca_system_score_gemma":0.0001668278,"threshold_uncertainty_score":0.99917805},"labels":[],"label_agreement":null},{"id":"W4398396872","doi":"10.7910/dvn/ii5jzg/mpopd6","title":"MSP_F_150_NFL_4_11.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; Geography; Archaeology","score_opus":0.01443881440100183,"score_gpt":0.20860103665812416,"score_spread":0.19416222225712232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398396872","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9684694e-7,0.0000022563495,0.00065451243,0.0000057976426,0.001373595,0.00017792456,0.99582124,0.00047382404,0.0014906604],"genre_scores_gemma":[0.0000031402737,0.0010418843,0.00086499006,0.00038859996,0.00034851,0.000016748161,0.9970941,0.000058538106,0.00018350928],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884164,0.000027204054,0.00029185208,0.00031234257,0.0002409718,0.00028598952],"domain_scores_gemma":[0.9988611,0.00003082034,0.000058142487,0.0008250347,0.000028982904,0.00019596334],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000075727316,0.0003427158,0.00032654768,0.00012246486,0.000053920274,0.00012836019,0.000541222,0.00029057593,0.027644064],"category_scores_gemma":[0.000060835366,0.00037481575,0.00009019198,0.00021413829,0.00003538597,0.0001648227,0.00015937284,0.0005045906,0.4141062],"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.000004487408,0.000010264551,7.128186e-7,0.00029662027,0.00007157959,0.000049574184,0.000016562895,0.007654477,0.000005931514,0.000012196346,0.9917407,0.00013689176],"study_design_scores_gemma":[0.00024208403,0.000015470381,0.0000013125934,0.00006212488,0.000071238544,0.0000079128895,0.000008482018,0.002854917,0.00001600552,0.0000061986466,0.996306,0.00040823524],"about_ca_topic_score_codex":0.000023207738,"about_ca_topic_score_gemma":0.000025083993,"teacher_disagreement_score":0.38646212,"about_ca_system_score_codex":0.000052049938,"about_ca_system_score_gemma":0.00003924161,"threshold_uncertainty_score":0.99987036},"labels":[],"label_agreement":null},{"id":"W4398470449","doi":"10.7910/dvn/ii5jzg/zkj6cj","title":"MSP_F_150_NFL_4_45.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014449540089568514,"score_gpt":0.20857309818440467,"score_spread":0.19412355809483617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398470449","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9662112e-7,0.0000022495785,0.00065632665,0.0000058032592,0.0013779765,0.00017727228,0.99576247,0.00047299755,0.0015446972],"genre_scores_gemma":[0.0000031970435,0.0010602942,0.00088053156,0.0003904356,0.00034108871,0.000015594931,0.9970699,0.00005850707,0.00018044353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988463,0.000026711292,0.00029103507,0.00031140362,0.0002401848,0.0002843583],"domain_scores_gemma":[0.9988641,0.000030620973,0.00005801868,0.0008228582,0.000028919643,0.00019548342],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0000752146,0.0003420285,0.00032546354,0.00012200413,0.00005399509,0.00012753498,0.00053897966,0.00028944056,0.027085507],"category_scores_gemma":[0.00006084715,0.0003742161,0.00008997707,0.00021298241,0.00003548505,0.00016383892,0.00015873149,0.000503095,0.41025537],"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.0000044758913,0.000010142415,6.951381e-7,0.00029088682,0.000071359274,0.000049486367,0.000016496519,0.007542204,0.000005716918,0.000013205526,0.9918497,0.00014563344],"study_design_scores_gemma":[0.0002406531,0.00001548266,0.0000012351475,0.000062186744,0.000070749666,0.000007801406,0.000008447842,0.0029955893,0.000015526251,0.0000064428305,0.9961685,0.00040741684],"about_ca_topic_score_codex":0.00002381668,"about_ca_topic_score_gemma":0.000026002559,"teacher_disagreement_score":0.3831699,"about_ca_system_score_codex":0.000051395495,"about_ca_system_score_gemma":0.00003825275,"threshold_uncertainty_score":0.99987096},"labels":[],"label_agreement":null},{"id":"W4398470488","doi":"10.7910/dvn/ii5jzg/vmki6u","title":"MSP_F_50_NFL_4_8.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398470488","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.831751e-7,0.0000022443905,0.00062956533,0.0000050900053,0.0013505297,0.0001726684,0.99581814,0.00045488466,0.0015666848],"genre_scores_gemma":[0.0000028292573,0.001036368,0.0008574923,0.00035752953,0.00032634177,0.000015622047,0.9971564,0.000056300698,0.00019114946],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988772,0.00002616991,0.00028356898,0.00030273374,0.00023363394,0.0002766736],"domain_scores_gemma":[0.9988926,0.000030113535,0.000056074117,0.00080366526,0.000027913793,0.00018961349],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007346644,0.00033207904,0.0003161337,0.00011886033,0.00005200404,0.00012644082,0.00052576186,0.0002854679,0.028887227],"category_scores_gemma":[0.000059966227,0.00036318388,0.000086889864,0.00020972581,0.00003362983,0.00016213766,0.000154764,0.00049619045,0.41835988],"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.000004396145,0.00000998288,6.444817e-7,0.00029286198,0.00007126411,0.00004911608,0.000016050004,0.007662175,0.000005877985,0.00001144401,0.99174964,0.00012654605],"study_design_scores_gemma":[0.0002350476,0.00001491189,0.000001198789,0.00006128982,0.00007057846,0.000007699282,0.000008064539,0.0028469162,0.00001597673,0.0000055959017,0.996337,0.000395712],"about_ca_topic_score_codex":0.000021512993,"about_ca_topic_score_gemma":0.00002150704,"teacher_disagreement_score":0.38947266,"about_ca_system_score_codex":0.00005012113,"about_ca_system_score_gemma":0.000037407717,"threshold_uncertainty_score":0.999882},"labels":[],"label_agreement":null},{"id":"W4398477031","doi":"10.7910/dvn/ii5jzg/gteeyl","title":"MSP_F_70_NFL_4_23.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Mathematics; Geology; Artificial intelligence; Paleontology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398477031","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8843389e-7,0.000002153946,0.0006847914,0.0000059474282,0.0013380641,0.00017503065,0.99584186,0.00046218498,0.0014897735],"genre_scores_gemma":[0.00000316141,0.0010399397,0.0008148464,0.00036624933,0.00034395984,0.000015252628,0.99716717,0.000056886296,0.00019251936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887913,0.000026529193,0.00028086267,0.00030405316,0.00023280969,0.0002765894],"domain_scores_gemma":[0.9988925,0.00003072968,0.000056674246,0.0008023488,0.000027868062,0.00018989267],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000072904455,0.00033291287,0.00031989263,0.00012061636,0.000052372103,0.00012393406,0.00052652234,0.0002829463,0.026230957],"category_scores_gemma":[0.00005940487,0.0003645334,0.00008850729,0.00021098867,0.000033052725,0.00016283435,0.00015079515,0.00048724882,0.40074867],"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.000004422543,0.000009923052,6.18171e-7,0.00028500243,0.00007051932,0.00005093633,0.0000151427075,0.008133,0.0000063852626,0.00001270143,0.9912658,0.00014558731],"study_design_scores_gemma":[0.0002414514,0.000014903967,0.0000011853645,0.00006153747,0.00007079468,0.000007946318,0.00000816196,0.0032708258,0.000014843318,0.0000060780294,0.9959055,0.00039677348],"about_ca_topic_score_codex":0.000021859,"about_ca_topic_score_gemma":0.000024280507,"teacher_disagreement_score":0.3745177,"about_ca_system_score_codex":0.000051027528,"about_ca_system_score_gemma":0.000037501446,"threshold_uncertainty_score":0.9998807},"labels":[],"label_agreement":null},{"id":"W4398540206","doi":"10.7910/dvn/ii5jzg/ulqzqs","title":"MSP_F_150_NFL_4_28.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014449540089568514,"score_gpt":0.20857309818440467,"score_spread":0.19412355809483617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398540206","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.126811e-7,0.0000021955962,0.00064915296,0.0000056707086,0.0013781905,0.00017764306,0.9958271,0.00047390437,0.001485962],"genre_scores_gemma":[0.0000030630583,0.001043908,0.0008787194,0.00039379956,0.0003435068,0.000016750379,0.9970742,0.0000585347,0.00018750931],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988415,0.000027920807,0.00029164832,0.00031233588,0.0002407061,0.00028585907],"domain_scores_gemma":[0.9988607,0.000031376738,0.000058090613,0.0008249476,0.000028942419,0.0001959397],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000076944736,0.00034263777,0.00032707053,0.00012243172,0.00005489009,0.00012826391,0.0005410105,0.00029049537,0.027321868],"category_scores_gemma":[0.000061614905,0.00037473903,0.00009000947,0.00021652479,0.000035362278,0.0001646844,0.00015914843,0.00051478535,0.41286984],"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.0000044920607,0.0000103214525,7.363904e-7,0.00029948453,0.00007164994,0.000049469043,0.000017419714,0.0075508133,0.000005790431,0.000012282588,0.9918414,0.00013617793],"study_design_scores_gemma":[0.00024224787,0.0000155106,0.0000012917782,0.00006232896,0.00007126898,0.000007828441,0.000008248655,0.0028254406,0.000015708092,0.000006980243,0.99633497,0.00040815826],"about_ca_topic_score_codex":0.000024307774,"about_ca_topic_score_gemma":0.000024876701,"teacher_disagreement_score":0.38554797,"about_ca_system_score_codex":0.000058779227,"about_ca_system_score_gemma":0.00004374454,"threshold_uncertainty_score":0.9998705},"labels":[],"label_agreement":null},{"id":"W4398540590","doi":"10.7910/dvn/ii5jzg/n7iofo","title":"MSP_F_20_NFL_4_45.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Operations research; Mathematics; Artificial intelligence; Geography; Archaeology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398540590","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7405803e-7,0.000002111994,0.00070073444,0.0000055068112,0.0013301863,0.00017097413,0.9958322,0.0004505301,0.0015075854],"genre_scores_gemma":[0.0000028789252,0.0010162035,0.0008904797,0.0003737465,0.0003277588,0.000014709444,0.9971273,0.000056155415,0.00019075538],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988981,0.000025829959,0.00027754015,0.0002975422,0.0002298839,0.00027112916],"domain_scores_gemma":[0.9989126,0.00002963536,0.000055219596,0.0007891965,0.000027733948,0.00018562599],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007273365,0.00032645688,0.00031023409,0.00011638228,0.000051002335,0.000121858466,0.00051447697,0.00027832118,0.026024742],"category_scores_gemma":[0.000059157977,0.0003562647,0.00008545866,0.00020258852,0.000032560965,0.00015490444,0.00014895231,0.0004817087,0.41504595],"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.0000042602614,0.000009734246,6.737803e-7,0.00027221945,0.000068044945,0.000046845802,0.000015602353,0.0071183364,0.000005613499,0.000012561036,0.99230516,0.00014095147],"study_design_scores_gemma":[0.00022891944,0.000014775169,0.0000012385859,0.00005849856,0.00006731049,0.000007317273,0.000007648837,0.003155189,0.000015120483,0.0000061089986,0.99604946,0.0003883834],"about_ca_topic_score_codex":0.000021909484,"about_ca_topic_score_gemma":0.000023890134,"teacher_disagreement_score":0.38902122,"about_ca_system_score_codex":0.000049198672,"about_ca_system_score_gemma":0.000037036505,"threshold_uncertainty_score":0.99988896},"labels":[],"label_agreement":null},{"id":"W4398543715","doi":"10.7910/dvn/ii5jzg/873ajq","title":"MSP_F_50_NFL_4_15.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398543715","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9244223e-7,0.0000021910444,0.00062284525,0.000005666538,0.0013699391,0.00017568078,0.9958109,0.00046292442,0.001549639],"genre_scores_gemma":[0.0000030359804,0.0010412253,0.00085243565,0.00038106885,0.00033847115,0.000015372481,0.9971198,0.00005729631,0.00019132228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988593,0.000026564103,0.0002882683,0.00030744696,0.00023695853,0.00028150354],"domain_scores_gemma":[0.9988774,0.000030332218,0.00005713153,0.0008140109,0.00002838051,0.00019271573],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000073822135,0.00033740944,0.0003213338,0.000120412406,0.000053209704,0.00012706408,0.00053339574,0.0002862217,0.028308677],"category_scores_gemma":[0.000060322476,0.0003690359,0.00008850716,0.0002128155,0.000034231325,0.00016206317,0.000156979,0.0004976172,0.41271484],"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.0000044935496,0.000010193827,6.8523383e-7,0.00028860688,0.0000705318,0.000048901384,0.000016352567,0.007503336,0.000005531021,0.000011879655,0.9919008,0.00013867162],"study_design_scores_gemma":[0.00023913365,0.000015164369,0.0000012182335,0.00006171607,0.00006963374,0.000007699446,0.000008359634,0.0028534601,0.000016424741,0.0000059618283,0.9963193,0.0004019617],"about_ca_topic_score_codex":0.000023011602,"about_ca_topic_score_gemma":0.000025259445,"teacher_disagreement_score":0.38440618,"about_ca_system_score_codex":0.000051397456,"about_ca_system_score_gemma":0.000038293318,"threshold_uncertainty_score":0.99987614},"labels":[],"label_agreement":null},{"id":"W4398552858","doi":"10.7910/dvn/ii5jzg/pym1q6","title":"MSP_F_70_NFL_4_2.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398552858","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7456736e-7,0.0000020683995,0.000693255,0.000005644548,0.0013233895,0.00017231365,0.99582213,0.0004554219,0.001525589],"genre_scores_gemma":[0.0000029976495,0.0010055621,0.000844462,0.00036299892,0.00033412332,0.000014937187,0.9971933,0.000055909553,0.00018570924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988971,0.000026023043,0.0002770276,0.00029982065,0.0002276508,0.00027241034],"domain_scores_gemma":[0.9989072,0.000029514415,0.000055793415,0.00079297804,0.000027423586,0.00018705544],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007167094,0.0003279276,0.00031497504,0.00011872523,0.000051336618,0.00011979205,0.0005206657,0.000278823,0.02735131],"category_scores_gemma":[0.000057819983,0.0003590832,0.00008698899,0.00020771014,0.000032954544,0.00016091297,0.0001487563,0.00048191065,0.39928415],"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.0000044846447,0.000009988008,6.103385e-7,0.0002823659,0.00006975237,0.000049796206,0.000015294347,0.007928684,0.000005654176,0.000013228683,0.99147683,0.00014329646],"study_design_scores_gemma":[0.00024044319,0.000014779412,0.0000012052178,0.000058984173,0.00007003164,0.000007615472,0.000008086,0.003155079,0.000013652724,0.000006174413,0.996033,0.00039094413],"about_ca_topic_score_codex":0.000022381815,"about_ca_topic_score_gemma":0.000024156365,"teacher_disagreement_score":0.37193283,"about_ca_system_score_codex":0.00004979853,"about_ca_system_score_gemma":0.000037361275,"threshold_uncertainty_score":0.9998861},"labels":[],"label_agreement":null},{"id":"W4398615600","doi":"10.7910/dvn/ii5jzg/idourh","title":"MSP_F_70_NFL_4_9.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398615600","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3255921e-7,0.000002108118,0.0007155964,0.000007847433,0.0013270974,0.00017207395,0.9958416,0.00045409473,0.0014794336],"genre_scores_gemma":[0.0000033219762,0.0009803171,0.0008375777,0.0003712333,0.000338418,0.000014933907,0.9972094,0.00005596972,0.0001888242],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988918,0.00002615428,0.00027710167,0.00030043832,0.00023168138,0.00027284698],"domain_scores_gemma":[0.9989037,0.00003050785,0.000055795175,0.00079505047,0.000027774655,0.00018719173],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007284788,0.00032814263,0.00031552505,0.00011851982,0.00005160176,0.000122009216,0.0005204377,0.0002827271,0.0276626],"category_scores_gemma":[0.00006003874,0.00035926662,0.000087052606,0.00020764767,0.000032982192,0.00016103227,0.00014886587,0.0004891392,0.40003335],"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.0000044150615,0.000009900178,5.947764e-7,0.00028297855,0.0000694673,0.000049709182,0.000014354351,0.0083324155,0.0000055207684,0.000012607244,0.99102694,0.00019109917],"study_design_scores_gemma":[0.00023904642,0.00001469293,0.0000014244969,0.000059122798,0.00006977743,0.000007616872,0.0000068390655,0.0033640843,0.000013205941,0.0000059919794,0.9958271,0.00039111],"about_ca_topic_score_codex":0.000021632575,"about_ca_topic_score_gemma":0.000024535346,"teacher_disagreement_score":0.37237075,"about_ca_system_score_codex":0.000050536983,"about_ca_system_score_gemma":0.00003752833,"threshold_uncertainty_score":0.9998859},"labels":[],"label_agreement":null},{"id":"W4398615672","doi":"10.7910/dvn/ii5jzg/bvd8p9","title":"MSP_F_20_NFL_4_33.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Operations research; History; Mathematics; Artificial intelligence; Archaeology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398615672","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.042172e-7,0.0000021342018,0.00067207473,0.00000544908,0.0013371132,0.00017108594,0.99600744,0.00045077945,0.0013536917],"genre_scores_gemma":[0.0000029952873,0.0010075517,0.0008650562,0.00036732,0.00032917524,0.000015783167,0.99717057,0.00005621101,0.00018533932],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988973,0.000026330694,0.00027699533,0.00029784598,0.0002303567,0.00027115218],"domain_scores_gemma":[0.9989123,0.000029572671,0.000055061577,0.0007902939,0.000027105096,0.00018566499],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007291057,0.0003267562,0.00031084925,0.000118832715,0.000050763436,0.000121710866,0.0005156865,0.0002800999,0.025843777],"category_scores_gemma":[0.000058158155,0.00035650205,0.00008558649,0.00020867644,0.00003194708,0.00015504938,0.00014943536,0.00048092942,0.41247025],"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.0000041627695,0.000009826309,8.007665e-7,0.00027579747,0.00006822165,0.000046889953,0.000015278745,0.0071343346,0.000005985763,0.000011292453,0.9922875,0.00013990683],"study_design_scores_gemma":[0.00022640015,0.000014701714,0.0000014718412,0.000060521914,0.000067696696,0.0000074131885,0.0000069789585,0.003049572,0.000015747175,0.0000059369245,0.9961548,0.0003887827],"about_ca_topic_score_codex":0.000020069543,"about_ca_topic_score_gemma":0.000022284674,"teacher_disagreement_score":0.38662648,"about_ca_system_score_codex":0.000049334492,"about_ca_system_score_gemma":0.000036959475,"threshold_uncertainty_score":0.9998887},"labels":[],"label_agreement":null},{"id":"W4398616409","doi":"10.7910/dvn/ii5jzg/3lsh9f","title":"MSP_F_70_NFL_4_4.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398616409","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8729044e-7,0.0000020478665,0.0006975349,0.000005775805,0.0013258529,0.00017276371,0.995847,0.00045611442,0.001492744],"genre_scores_gemma":[0.0000029945365,0.0009990721,0.0008497806,0.0003664789,0.00033967686,0.000014946173,0.997184,0.000055942517,0.0001871116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988936,0.000026092535,0.00027725103,0.0003003574,0.00022967448,0.00027302728],"domain_scores_gemma":[0.9989053,0.000029924953,0.000055821052,0.0007940319,0.000027515802,0.00018740655],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007200179,0.000328319,0.00031576023,0.00011875368,0.00005167451,0.00012210423,0.00052043964,0.0002792092,0.026999563],"category_scores_gemma":[0.000058363323,0.00035940894,0.00008710324,0.00020790791,0.000032978143,0.00016118308,0.00014888917,0.00048345793,0.39990044],"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.0000044408894,0.000009905791,5.8839015e-7,0.00028310777,0.00006950416,0.000058383914,0.000014906033,0.008150648,0.000005751816,0.000012804705,0.9912453,0.00014460983],"study_design_scores_gemma":[0.00024160583,0.000014741402,0.0000010969834,0.00005916248,0.00006979151,0.000009234897,0.000008053237,0.0033044599,0.0000134763695,0.0000060415296,0.9958811,0.00039127012],"about_ca_topic_score_codex":0.000020851574,"about_ca_topic_score_gemma":0.00002357507,"teacher_disagreement_score":0.37290087,"about_ca_system_score_codex":0.00005045787,"about_ca_system_score_gemma":0.00003733665,"threshold_uncertainty_score":0.9998858},"labels":[],"label_agreement":null},{"id":"W4398618492","doi":"10.7910/dvn/ii5jzg/yizxgy","title":"MSP_F_50_NFL_4_39.xlsx","year":2020,"lang":"tl","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Mathematics; Artificial intelligence; Geography; Archaeology","score_opus":0.01787398217247222,"score_gpt":0.21874876145742975,"score_spread":0.20087477928495753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398618492","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015180854,0.0000063598304,0.0031961876,0.000042195803,0.004643411,0.00054575916,0.987781,0.000538565,0.0032450168],"genre_scores_gemma":[0.000036700578,0.003109726,0.003954997,0.0009101899,0.0009879372,0.000031680072,0.989242,0.00017915064,0.0015476062],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99661887,0.00013701276,0.00086554204,0.00096316537,0.00061376084,0.00080166495],"domain_scores_gemma":[0.99685264,0.00012240744,0.00026239228,0.0020348972,0.00010156176,0.0006260973],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027288284,0.0009293904,0.0008685755,0.00028803846,0.00021302568,0.0004668589,0.001358494,0.0007461203,0.11247902],"category_scores_gemma":[0.0003079581,0.0010775912,0.00027227934,0.00063016807,0.000120847355,0.00047960415,0.00067769043,0.0013221828,0.81761163],"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.00004047718,0.00006906107,0.000010670851,0.00095573685,0.00030885445,0.00022392866,0.00014722392,0.018092494,0.00003057893,0.00015437481,0.97958815,0.00037843626],"study_design_scores_gemma":[0.00091997714,0.00008005946,0.000012295855,0.0003257067,0.000329262,0.000028050685,0.00006676856,0.014198678,0.000039299204,0.000015553183,0.98287547,0.0011088832],"about_ca_topic_score_codex":0.00012208664,"about_ca_topic_score_gemma":0.000052865955,"teacher_disagreement_score":0.7051326,"about_ca_system_score_codex":0.00017177961,"about_ca_system_score_gemma":0.00016367162,"threshold_uncertainty_score":0.99916744},"labels":[],"label_agreement":null},{"id":"W4398621463","doi":"10.7910/dvn/ii5jzg/qfyzao","title":"MSP_F_150_NFL_4_49.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence; Archaeology","score_opus":0.014449540089568514,"score_gpt":0.20857309818440467,"score_spread":0.19412355809483617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398621463","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0211844e-7,0.0000022257211,0.000644345,0.0000057529705,0.0013860741,0.00017800201,0.99578446,0.00047388993,0.0015250319],"genre_scores_gemma":[0.000003132018,0.0010481301,0.000870802,0.00038895354,0.00034609996,0.000016750584,0.99708307,0.00005857683,0.00018448244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988411,0.000027218912,0.0002919869,0.0003124719,0.00024108028,0.0002861181],"domain_scores_gemma":[0.99886036,0.00003085247,0.000058161924,0.00082558027,0.00002899197,0.00019603322],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007577709,0.00034282793,0.00032670877,0.00012252692,0.000053912154,0.00012840508,0.00054153125,0.00029066214,0.027364394],"category_scores_gemma":[0.00006149881,0.00037493533,0.00009022236,0.00021619338,0.000035405938,0.00016490242,0.00015939084,0.0005050021,0.41075698],"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.0000044908284,0.000010267688,7.0525823e-7,0.00029668034,0.000071615555,0.000049599017,0.000016548012,0.007612468,0.000005807097,0.000012555169,0.9917773,0.00014194478],"study_design_scores_gemma":[0.00024215752,0.000015512613,0.0000012890376,0.00006247274,0.00007126972,0.000007914586,0.000008510446,0.0029016554,0.000015801252,0.0000062312124,0.99625885,0.00040835288],"about_ca_topic_score_codex":0.000023220446,"about_ca_topic_score_gemma":0.000025577741,"teacher_disagreement_score":0.3833926,"about_ca_system_score_codex":0.000052114137,"about_ca_system_score_gemma":0.00003902585,"threshold_uncertainty_score":0.99987024},"labels":[],"label_agreement":null},{"id":"W4398621494","doi":"10.7910/dvn/ii5jzg/i7uji7","title":"MSP_F_20_NFL_4_47.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398621494","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.764606e-7,0.000002054888,0.0007026784,0.0000054801894,0.0013371776,0.00017164972,0.99578136,0.00045112145,0.0015483284],"genre_scores_gemma":[0.0000027666028,0.0010126341,0.0008815085,0.0003753219,0.0003296634,0.000015802974,0.99713445,0.000056217734,0.00019163957],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988941,0.000026297494,0.00027770497,0.00029846717,0.00023068379,0.00027274402],"domain_scores_gemma":[0.9989103,0.00002933608,0.000055212557,0.00079158717,0.000027429376,0.00018612409],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007307793,0.00032716175,0.000311363,0.00011718376,0.000051233714,0.00012260531,0.0005166899,0.00027873358,0.02690102],"category_scores_gemma":[0.000058128167,0.00035688275,0.000085676555,0.00020662739,0.000032613934,0.00015552448,0.0001495302,0.000482235,0.41552448],"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.00000428142,0.000009849911,6.491021e-7,0.0002775027,0.000068278234,0.000046917325,0.000015818427,0.0074290703,0.0000056962294,0.000011919824,0.9919915,0.00013849551],"study_design_scores_gemma":[0.00023057095,0.0000148038735,0.0000011821978,0.000058943362,0.00006791243,0.00000741984,0.000007849588,0.0031137238,0.000015290163,0.0000058697533,0.99608725,0.00038916673],"about_ca_topic_score_codex":0.000021638527,"about_ca_topic_score_gemma":0.000024692717,"teacher_disagreement_score":0.38862348,"about_ca_system_score_codex":0.00004980125,"about_ca_system_score_gemma":0.00003768281,"threshold_uncertainty_score":0.9998883},"labels":[],"label_agreement":null},{"id":"W4398627137","doi":"10.7910/dvn/ii5jzg/7rkvqe","title":"MSP_F_20_NFL_4_8.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; History; Artificial intelligence","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398627137","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.652955e-7,0.000002042069,0.00069643394,0.000005222313,0.0013208974,0.00016863686,0.99580264,0.0004436201,0.0015603346],"genre_scores_gemma":[0.0000026749444,0.0009548037,0.00089761295,0.00035859464,0.0003192518,0.000015174181,0.99719775,0.000055235254,0.00019890186],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891156,0.000025936324,0.00027309195,0.00029384557,0.00022741152,0.0002681471],"domain_scores_gemma":[0.99892515,0.000029072235,0.000054252556,0.00078140345,0.00002699484,0.0001831021],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007229611,0.00032195667,0.00030617448,0.0001147392,0.000049732113,0.00012107303,0.0005095759,0.00027802933,0.02757242],"category_scores_gemma":[0.000057855974,0.0003512106,0.000084120584,0.0002021905,0.000031803058,0.00015366472,0.00014748055,0.00048095625,0.42234674],"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.00000417568,0.000009649188,5.9537865e-7,0.00028019174,0.00006889354,0.000046775338,0.000015708092,0.0073633925,0.000006022023,0.000011348789,0.9920594,0.00013384792],"study_design_scores_gemma":[0.00022632911,0.000014524476,0.0000011424451,0.000058741174,0.000068347326,0.000007347714,0.00000761197,0.0030664727,0.000015560974,0.00000557846,0.99614525,0.00038311543],"about_ca_topic_score_codex":0.000021441416,"about_ca_topic_score_gemma":0.000021687663,"teacher_disagreement_score":0.39477432,"about_ca_system_score_codex":0.00004948647,"about_ca_system_score_gemma":0.000037234022,"threshold_uncertainty_score":0.99989396},"labels":[],"label_agreement":null},{"id":"W4398630576","doi":"10.7910/dvn/ii5jzg/sy3pze","title":"MSP_F_70_NFL_4_18.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; Geography; Archaeology","score_opus":0.014524969107870093,"score_gpt":0.20855535381713075,"score_spread":0.19403038470926065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398630576","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1016693e-7,0.0000021530454,0.0005441608,0.0000057600664,0.0013418542,0.00017464974,0.9961747,0.00046112915,0.0012953917],"genre_scores_gemma":[0.0000033576416,0.00101397,0.00085614185,0.00036736246,0.00034359493,0.000015197215,0.99719036,0.000056831526,0.00015316706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998879,0.000026526468,0.00028100386,0.00030407656,0.00023264007,0.00027675537],"domain_scores_gemma":[0.9988929,0.000030416846,0.0000567132,0.00080208,0.00002765409,0.00019022825],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007285409,0.000332926,0.00032003215,0.00012019906,0.00005243749,0.00012343083,0.0005266941,0.00028287002,0.03586499],"category_scores_gemma":[0.000059010876,0.00036462123,0.000088556306,0.00021023577,0.000033572276,0.00016275141,0.0001506674,0.00048987,0.3979818],"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.000004523356,0.000010093836,6.100028e-7,0.00028594636,0.000070502116,0.00005047637,0.000015245067,0.0083833365,0.0000073348497,0.000012168471,0.99101806,0.00014171074],"study_design_scores_gemma":[0.00024472413,0.000015012349,0.0000012032805,0.00005996053,0.00007087822,0.000007808243,0.00000827591,0.0025567838,0.000016301086,0.0000059474337,0.996616,0.0003971082],"about_ca_topic_score_codex":0.000021612499,"about_ca_topic_score_gemma":0.000024097515,"teacher_disagreement_score":0.3621168,"about_ca_system_score_codex":0.000051217066,"about_ca_system_score_gemma":0.00003803542,"threshold_uncertainty_score":0.99988055},"labels":[],"label_agreement":null},{"id":"W4398679566","doi":"10.7910/dvn/ii5jzg/z8wgb0","title":"MSP_F_20_NFL_4_34.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.014542506107908743,"score_gpt":0.20853708129122225,"score_spread":0.1939945751833135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398679566","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8068702e-7,0.0000021073004,0.00068839535,0.000005434362,0.00133848,0.00017162588,0.9958182,0.0004514293,0.0015241378],"genre_scores_gemma":[0.0000027136086,0.001010679,0.0008882826,0.00037269227,0.0003299412,0.000015798576,0.99713004,0.000056227018,0.00019361102],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889374,0.000026072432,0.00027779597,0.00029875306,0.00023077846,0.00027286023],"domain_scores_gemma":[0.9989093,0.000029358227,0.000055230645,0.00079246145,0.00002744821,0.00018617886],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007325476,0.0003272431,0.0003110104,0.00011675829,0.000050953004,0.00012278261,0.00051731686,0.00027881013,0.026984943],"category_scores_gemma":[0.000058274567,0.0003569776,0.00008568468,0.0002059472,0.000032457192,0.00015601827,0.0001497186,0.0004824403,0.41723713],"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.000004261764,0.000009858521,6.321332e-7,0.00027796792,0.00006974077,0.000046941932,0.000015666552,0.007267716,0.0000058809956,0.000012123028,0.99215037,0.00013886778],"study_design_scores_gemma":[0.00023023227,0.000014784817,0.000001172654,0.000059092257,0.00006857514,0.0000074238706,0.000007704302,0.003050019,0.00001576642,0.000006000826,0.9961499,0.0003893084],"about_ca_topic_score_codex":0.00002178308,"about_ca_topic_score_gemma":0.000023825052,"teacher_disagreement_score":0.39025217,"about_ca_system_score_codex":0.000049767514,"about_ca_system_score_gemma":0.000037701444,"threshold_uncertainty_score":0.99988824},"labels":[],"label_agreement":null},{"id":"W4398687894","doi":"10.7910/dvn/ii5jzg/q2yd63","title":"MSP_F_150_NFL_4_26.xlsx","year":2020,"lang":"pt","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Mathematics; Geology; Artificial intelligence; Paleontology","score_opus":0.019654769106569263,"score_gpt":0.2254114305834785,"score_spread":0.20575666147690924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398687894","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001361736,0.000007028663,0.0048329015,0.0000371188,0.0033481158,0.0005563423,0.9881096,0.00054736587,0.0025601897],"genre_scores_gemma":[0.000054253327,0.0025887524,0.002340695,0.0009701761,0.00079192576,0.000033203763,0.99151766,0.00018968429,0.0015136263],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99657583,0.00013662876,0.00087158324,0.0009792821,0.00062567863,0.0008109936],"domain_scores_gemma":[0.9968912,0.00011662371,0.0002643726,0.0019822845,0.00010392689,0.00064160133],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002658878,0.0009500218,0.00088392454,0.00029705913,0.00021486422,0.00045131205,0.001337415,0.0007588878,0.10836626],"category_scores_gemma":[0.0002829487,0.0011047716,0.00028062618,0.0006422291,0.00011115886,0.00047333527,0.00066103984,0.0013409754,0.81210506],"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.000039418446,0.000070188595,0.000009104045,0.0010150778,0.00031526663,0.00022067728,0.00019592582,0.020354971,0.00003064591,0.0001304061,0.9772157,0.0004026157],"study_design_scores_gemma":[0.00092469994,0.00008322117,0.000007095226,0.0003275301,0.00033102525,0.000028546141,0.00009425447,0.018701332,0.00003894238,0.000009984414,0.97832775,0.0011256383],"about_ca_topic_score_codex":0.00008545853,"about_ca_topic_score_gemma":0.000046886995,"teacher_disagreement_score":0.7037388,"about_ca_system_score_codex":0.00017117392,"about_ca_system_score_gemma":0.00016489414,"threshold_uncertainty_score":0.99914026},"labels":[],"label_agreement":null},{"id":"W4398688805","doi":"10.7910/dvn/ii5jzg/go7ey8","title":"MSP_F_50_NFL_4_40.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; Geography; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398688805","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9598393e-7,0.0000021683818,0.00063078594,0.0000055185565,0.001369029,0.00017581301,0.99578106,0.00046273353,0.00157269],"genre_scores_gemma":[0.0000029449125,0.001046155,0.0008495111,0.00037684702,0.00033755053,0.000016269001,0.9971201,0.00005731448,0.00019333154],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885815,0.000026639067,0.0002885564,0.00030784376,0.00023718095,0.00028162717],"domain_scores_gemma":[0.9988766,0.000030408233,0.000057177567,0.0008145666,0.00002839749,0.00019284879],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007476721,0.00033754343,0.0003216462,0.00012050871,0.000053325246,0.00012726644,0.0005336429,0.00028629813,0.028245816],"category_scores_gemma":[0.000060545914,0.000369145,0.00008856074,0.00021293793,0.00003426062,0.00016253292,0.00015705747,0.0004977859,0.41233417],"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.000004499577,0.000010195383,6.8967887e-7,0.00029048105,0.000070655995,0.000048928843,0.000016064865,0.00767704,0.0000057003995,0.000012305576,0.9917292,0.00013424024],"study_design_scores_gemma":[0.0002393439,0.000015209574,0.0000012211126,0.00006168991,0.000070028815,0.00000777968,0.000008103846,0.0028196785,0.000015954487,0.00000618503,0.9963527,0.00040211514],"about_ca_topic_score_codex":0.000022893897,"about_ca_topic_score_gemma":0.000025595637,"teacher_disagreement_score":0.38408837,"about_ca_system_score_codex":0.00005185466,"about_ca_system_score_gemma":0.0000388442,"threshold_uncertainty_score":0.999876},"labels":[],"label_agreement":null},{"id":"W4398690134","doi":"10.7910/dvn/ii5jzg/u5m8fi","title":"MSP_F_150_NFL_4_4.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Artificial intelligence; History; Archaeology","score_opus":0.014449540089568514,"score_gpt":0.20857309818440467,"score_spread":0.19412355809483617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398690134","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0136139e-7,0.0000021785627,0.00064178364,0.0000056287527,0.0013710057,0.00017522683,0.9958415,0.00046703842,0.0014954424],"genre_scores_gemma":[0.0000030322294,0.0010354703,0.00088232313,0.0003845714,0.00033865747,0.000016401164,0.9970976,0.000057601712,0.00018433678],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988574,0.000026917789,0.00028830062,0.00030808363,0.00023751793,0.00028181772],"domain_scores_gemma":[0.9988753,0.000030420268,0.00005733004,0.0008154611,0.000028475572,0.00019299619],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007516366,0.00033769786,0.00032184564,0.00012076465,0.000053084448,0.0001265849,0.0005341159,0.0002865306,0.027302027],"category_scores_gemma":[0.00006082165,0.00036930476,0.00008869064,0.000212869,0.00003473108,0.00016261078,0.00015731425,0.0004993098,0.41038355],"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.000004403163,0.000010067545,7.056313e-7,0.00029315657,0.00007049289,0.000048851787,0.000016052789,0.007435913,0.0000057407806,0.000012314314,0.9919608,0.00014145183],"study_design_scores_gemma":[0.00023881177,0.000015232012,0.0000012812818,0.000061488325,0.000070157344,0.000007752443,0.000008333991,0.002917545,0.000015529744,0.0000060718403,0.9962555,0.00040228394],"about_ca_topic_score_codex":0.000022937758,"about_ca_topic_score_gemma":0.000025233572,"teacher_disagreement_score":0.3830815,"about_ca_system_score_codex":0.00005122214,"about_ca_system_score_gemma":0.000038317154,"threshold_uncertainty_score":0.9998759},"labels":[],"label_agreement":null},{"id":"W4398690832","doi":"10.7910/dvn/ii5jzg/c8u27h","title":"MSP_F_70_NFL_4_37.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Operations research; Mathematics; Geography; Artificial intelligence; Archaeology","score_opus":0.014537850219659887,"score_gpt":0.2085162319873152,"score_spread":0.1939783817676553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398690832","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.149923e-7,0.0000020679945,0.00068831316,0.0000056252325,0.0013402022,0.0001751269,0.99579084,0.00046281802,0.001534769],"genre_scores_gemma":[0.0000032812654,0.0009705289,0.0008375018,0.00036435662,0.00034328015,0.000015254034,0.99722326,0.00005689508,0.00018562248],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988778,0.000026554491,0.00028113672,0.0003044048,0.00023303847,0.00027706122],"domain_scores_gemma":[0.9988914,0.000030453835,0.000056739333,0.00080355094,0.000027842098,0.00019001581],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007305617,0.0003332144,0.00032008116,0.00011878688,0.000052525644,0.00012390804,0.00052806025,0.0002831504,0.027007176],"category_scores_gemma":[0.000058720576,0.00036484937,0.000088583685,0.00021116482,0.000032397336,0.00016208108,0.00015099446,0.00048995815,0.40045094],"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.000004113695,0.000010082454,7.6600435e-7,0.00028603632,0.00007054959,0.00005049059,0.000016438193,0.0082724,0.0000057325155,0.000013125245,0.9911339,0.00013631216],"study_design_scores_gemma":[0.0002417153,0.000014879455,0.0000013119788,0.00005984487,0.00007073364,0.00000781085,0.000009064936,0.0032194036,0.000013643808,0.0000062034487,0.9959582,0.0003971771],"about_ca_topic_score_codex":0.000021610675,"about_ca_topic_score_gemma":0.000023367536,"teacher_disagreement_score":0.37344375,"about_ca_system_score_codex":0.00005134472,"about_ca_system_score_gemma":0.000039866653,"threshold_uncertainty_score":0.9998804},"labels":[],"label_agreement":null},{"id":"W4398752478","doi":"10.7910/dvn/ii5jzg/73gpfn","title":"MSP_F_100_NFL_4_43.xlsx","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Context (archaeology); Resolution (logic); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.01407897303491542,"score_gpt":0.2087701466747898,"score_spread":0.19469117363987437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398752478","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1885836e-7,0.0000022335669,0.0006384527,0.0000056487174,0.0013940089,0.00017558118,0.995866,0.00047048982,0.001447391],"genre_scores_gemma":[0.0000030634271,0.0011144961,0.0008170768,0.00036781115,0.00033712044,0.000016106771,0.99708945,0.000058643633,0.00019622332],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988429,0.000028294848,0.00029149323,0.00031137347,0.00024188992,0.00028406875],"domain_scores_gemma":[0.99886006,0.00003272018,0.000058144076,0.000824853,0.000029699477,0.00019452127],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007853237,0.00034143988,0.00032788428,0.00012279655,0.00005335757,0.0001277188,0.0005384179,0.0002893376,0.026340377],"category_scores_gemma":[0.000062535946,0.00037368838,0.000089903624,0.00021820063,0.000034667813,0.00016371002,0.00015899207,0.0004987527,0.4054144],"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.000004333827,0.000010142265,7.5127923e-7,0.00029589783,0.00007134529,0.00004973985,0.00001579241,0.0077415574,0.000006075748,0.000011447011,0.9916566,0.00013632764],"study_design_scores_gemma":[0.0002370476,0.000014977583,0.0000013414887,0.00006399104,0.00006952253,0.0000078101375,0.000007884278,0.0029472448,0.00001676694,0.000005765338,0.9962207,0.00040694565],"about_ca_topic_score_codex":0.000025253838,"about_ca_topic_score_gemma":0.000027906914,"teacher_disagreement_score":0.379074,"about_ca_system_score_codex":0.00005279494,"about_ca_system_score_gemma":0.00003943421,"threshold_uncertainty_score":0.9998715},"labels":[],"label_agreement":null},{"id":"W4399531696","doi":"10.1371/journal.pone.0303646","title":"PAAD: Panelization algorithm for architectural designs","year":2024,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Lakehead University; University of Calgary; Saint Mary's University","funders":"Mitacs","keywords":"Computer science; Inefficiency; Genetic algorithm; Interface (matter); Industrial engineering; Algorithm; Engineering; Machine learning","score_opus":0.0730181794380001,"score_gpt":0.23143297084905975,"score_spread":0.15841479141105966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399531696","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.0026715843,0.00045123178,0.9943651,0.00010339107,0.0001625439,0.00025127988,0.000027416618,0.0008957997,0.0010716311],"genre_scores_gemma":[0.46206436,0.00020378488,0.53372955,0.00011233138,0.0005377457,0.00018264705,0.00026875475,0.0001328627,0.0027679887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996327,0.0000059987715,0.00008671998,0.000084403066,0.00007763058,0.00011251908],"domain_scores_gemma":[0.99983406,0.000045680532,0.0000046403225,0.00006313555,0.000022721826,0.000029737606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046176367,0.00006579375,0.00006965776,0.000060575032,0.000025553116,0.00006173243,0.0000386174,0.000035013425,0.000074393734],"category_scores_gemma":[0.000010657161,0.00006458317,0.000023922177,0.000117907315,0.0000062748736,0.000051820643,0.00000448079,0.0000558236,0.00005001612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008638981,0.00027277268,0.00010605546,0.0027750265,0.0009058072,0.000007893206,0.0031126756,0.4353871,0.04657379,0.0026962287,0.0043366286,0.5038174],"study_design_scores_gemma":[0.00008363783,0.000023313954,0.000012630433,0.00012399834,0.00003467855,0.0000011998826,0.0000043136756,0.9856444,0.012469151,0.0004369499,0.001071627,0.000094118404],"about_ca_topic_score_codex":9.792748e-7,"about_ca_topic_score_gemma":0.00000108451,"teacher_disagreement_score":0.55025727,"about_ca_system_score_codex":0.000018522498,"about_ca_system_score_gemma":0.000006471851,"threshold_uncertainty_score":0.26336253},"labels":[],"label_agreement":null},{"id":"W4399620918","doi":"10.1109/radarconf2458775.2024.10548896","title":"Radar Task Scheduling with Gaussian Random Shifted Start Time","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computation; Scheduling (production processes); Gaussian; Monte Carlo method; Computer science; Algorithm; Task (project management); Radar; Variance (accounting); Mathematical optimization; Statistics; Mathematics; Engineering; Physics; Telecommunications","score_opus":0.005930852745016579,"score_gpt":0.1913005070927171,"score_spread":0.1853696543477005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399620918","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.0111440215,0.0014047512,0.7454067,0.0010874636,0.0005879296,0.00038873454,0.000016584047,0.0049991845,0.23496462],"genre_scores_gemma":[0.91283923,0.00006428497,0.07705389,0.00015870889,0.00010577495,0.000013153662,0.000059579186,0.00009873633,0.009606612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994993,0.00000954609,0.00011372626,0.00012165567,0.000099732824,0.00015602642],"domain_scores_gemma":[0.9997814,0.000030831005,0.000004992483,0.00011016278,0.000012076933,0.00006052311],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000086925174,0.000109767694,0.00010680222,0.00008016259,0.000031699627,0.0001317263,0.00005256398,0.000043501077,0.0014145363],"category_scores_gemma":[0.0000036979754,0.00008172423,0.00002751265,0.0002453393,0.000013440822,0.00012574477,0.0000069101748,0.000116032796,0.00065503665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060153936,0.000018668878,0.00007270357,0.00029906837,0.00029209538,0.0000593027,0.0010994299,0.96935344,0.0042830897,0.0060762335,0.013818115,0.0045676855],"study_design_scores_gemma":[0.0007378855,0.000024213177,0.000015639258,0.00014180235,0.000020557367,0.000010245124,0.000022082133,0.9552569,0.001271732,0.00011328186,0.042169493,0.00021618431],"about_ca_topic_score_codex":0.0000049019345,"about_ca_topic_score_gemma":0.000005358574,"teacher_disagreement_score":0.90169525,"about_ca_system_score_codex":0.0000195131,"about_ca_system_score_gemma":0.00001830018,"threshold_uncertainty_score":0.9994983},"labels":[],"label_agreement":null},{"id":"W4399841361","doi":"10.1515/9781772127492","title":"The Riel Problem","year":2024,"lang":"en","type":"book","venue":"University of Alberta Press eBooks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.009659236046547354,"score_gpt":0.16532407437142646,"score_spread":0.1556648383248791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399841361","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015645703,0.00048550332,0.00032615292,0.000025177744,0.00028274706,0.00020773083,0.000019195435,0.0001387078,0.9985132],"genre_scores_gemma":[0.000086287044,0.0003249126,0.00029801083,0.0000059319095,0.000036959653,3.1528188e-7,0.000024216924,0.000043123113,0.99918026],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994479,0.000012005976,0.00011806143,0.00014709326,0.00012668014,0.00014826251],"domain_scores_gemma":[0.99944454,0.00013513742,0.00004896071,0.00027859834,0.00004383719,0.0000489122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005023224,0.00017037636,0.00017202627,0.00005409806,0.00009814458,0.000040192892,0.00034947414,0.00020688171,0.00004613707],"category_scores_gemma":[0.0000024504395,0.00015982574,0.00011048533,0.000009904764,0.00012010795,0.00002625654,0.00010008013,0.00030088934,0.000057106357],"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.000017687076,0.0000050472154,6.4910137e-7,0.0009958668,0.00055256276,0.000012163296,0.0053402404,0.016815133,0.000007215979,0.16908588,0.8023045,0.004863028],"study_design_scores_gemma":[0.000104377716,0.000011053117,1.9684266e-7,0.00023923111,0.000092651346,0.0000017446898,0.000017043723,0.0042298585,0.000028135944,0.0010536931,0.9940548,0.0001672332],"about_ca_topic_score_codex":0.0005088703,"about_ca_topic_score_gemma":0.0010817457,"teacher_disagreement_score":0.19175026,"about_ca_system_score_codex":0.000056003533,"about_ca_system_score_gemma":0.00007103833,"threshold_uncertainty_score":0.65175045},"labels":[],"label_agreement":null},{"id":"W4400084023","doi":"10.1007/978-3-031-57603-4_6","title":"Bin Packing Methodologies for Capacity Planning in Freight Transportation and Logistics","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Optimization and Packing Problems","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":"Université du Québec à Montréal","funders":"","keywords":"Bin; Bin packing problem; Business; Environmental science; Computer science; Algorithm","score_opus":0.19357397369542703,"score_gpt":0.43548698273154374,"score_spread":0.2419130090361167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400084023","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.0060317656,0.00070315483,0.043286823,0.010312344,0.006147299,0.0077213794,0.0007455425,0.00045150242,0.9246002],"genre_scores_gemma":[0.5226393,0.018431887,0.15595624,0.00015186366,0.00045912823,0.0037383668,0.0010433362,0.00023731778,0.29734257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991932,0.00013329553,0.001265662,0.0016160755,0.003843152,0.0012098333],"domain_scores_gemma":[0.99750787,0.00033168137,0.000048669383,0.00064493186,0.0012813751,0.00018550054],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011773659,0.00049333397,0.00040704387,0.010609829,0.0011948199,0.0032216355,0.0028055774,0.0002068844,0.00035313462],"category_scores_gemma":[0.00074940326,0.0005229266,0.00008096578,0.003036734,0.0042979633,0.0039946623,0.0009781127,0.0013771402,0.00005297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004082704,0.00003361095,0.00013304234,0.00016298456,0.000045550296,0.00006681203,0.00095568085,0.46982044,0.00017840732,0.52724373,0.00025758307,0.0010613126],"study_design_scores_gemma":[0.0013442576,0.00021057478,0.0041641593,0.0026176241,0.000028503513,0.000022159846,0.006309669,0.7162571,0.0005430496,0.14823017,0.11897236,0.0013003647],"about_ca_topic_score_codex":0.00029591136,"about_ca_topic_score_gemma":0.0065326253,"teacher_disagreement_score":0.62725765,"about_ca_system_score_codex":0.0027400698,"about_ca_system_score_gemma":0.00023580124,"threshold_uncertainty_score":0.99972224},"labels":[],"label_agreement":null},{"id":"W4400485340","doi":"10.61091/jcmcc120-16","title":"Approximation Algorithms for the Submodular Hitting Set Problem","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Submodular set function; Set (abstract data type); Algorithm; Approximation algorithm; Computer science; Set function; Mathematical optimization; Set cover problem; Mathematics","score_opus":0.018931364308404343,"score_gpt":0.25242808147559037,"score_spread":0.23349671716718604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485340","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.033934146,0.0049278988,0.909318,0.00052738935,0.04815963,0.001234502,0.00001078725,0.00042780803,0.0014598892],"genre_scores_gemma":[0.9685505,0.00013156657,0.02913658,0.00001137488,0.0020792359,0.000008685191,0.0000035651067,0.00006842277,0.000010045012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984215,0.000033998796,0.00080854184,0.00013031691,0.00035527942,0.00025034815],"domain_scores_gemma":[0.99831176,0.0009796016,0.00023139776,0.00013818608,0.00025444565,0.00008461074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017898296,0.00021520707,0.00037201948,0.0001403096,0.00023589809,0.00052822713,0.00024301102,0.00012038706,0.0000041471158],"category_scores_gemma":[0.00014561256,0.00015891879,0.00015942338,0.0002921022,0.000039632712,0.00018787848,0.00005279988,0.00037662374,0.0000016418629],"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.000019949659,0.00008405304,0.000011931681,0.0017968421,0.00034152382,0.000007547179,0.0038613444,0.029813955,0.00041132476,0.9439267,0.0017863995,0.017938437],"study_design_scores_gemma":[0.000994019,0.00015279982,0.0000028332477,0.00045328928,0.00010671325,0.000060550312,0.00020831876,0.74695426,0.00041152313,0.2438685,0.0066091525,0.00017804616],"about_ca_topic_score_codex":0.000001372155,"about_ca_topic_score_gemma":7.824904e-8,"teacher_disagreement_score":0.9346164,"about_ca_system_score_codex":0.000066475826,"about_ca_system_score_gemma":0.00005538537,"threshold_uncertainty_score":0.648052},"labels":[],"label_agreement":null},{"id":"W4400497258","doi":"10.26493/1855-3974.3130.d46","title":"On optimal λ-separable packings in the plane","year":2024,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Mathematics; Separable space; Combinatorics; Plane (geometry); Geometry; Mathematical analysis","score_opus":0.017820622021383604,"score_gpt":0.23765007792806922,"score_spread":0.21982945590668562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400497258","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22252898,0.0023834624,0.032635342,0.0036774268,0.001252077,0.0016424318,0.000046327074,0.002401686,0.7334323],"genre_scores_gemma":[0.9980388,0.00003641455,0.00092449225,0.0001954258,0.000021198686,0.00004366633,0.000013984876,0.000037272726,0.0006887392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920726,0.000030780677,0.00024810052,0.00013950944,0.0001795282,0.00019480838],"domain_scores_gemma":[0.99934435,0.00036863907,0.000015080514,0.00023113129,0.0000093896315,0.000031392297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004288392,0.0001465017,0.00016129111,0.000106151565,0.00003312431,0.0001617206,0.00017657118,0.00005744037,0.00021925855],"category_scores_gemma":[0.00003345146,0.000101536454,0.00004982725,0.0002509589,0.000025831716,0.0000996318,0.000008218949,0.00021194544,0.00053620007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040574872,0.0002329574,0.000092163544,0.0024737183,0.00019690921,0.0006331694,0.032500494,0.20650516,0.0006091193,0.62119585,0.13275197,0.0027679112],"study_design_scores_gemma":[0.00084685313,0.0001494826,0.000041679214,0.0016736474,0.000037841295,0.0001604301,0.00079361274,0.88259286,0.00085322256,0.044794872,0.06737263,0.0006828607],"about_ca_topic_score_codex":0.000005995648,"about_ca_topic_score_gemma":0.0000050369854,"teacher_disagreement_score":0.77550983,"about_ca_system_score_codex":0.000022195385,"about_ca_system_score_gemma":0.000011651106,"threshold_uncertainty_score":0.6891946},"labels":[],"label_agreement":null},{"id":"W4400596775","doi":"10.55016/ojs/cdm.v15i1.62808","title":"Partitioning the $5\\times 5$ array into restrictions of circles","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Lattice (music); Algorithm; Physics","score_opus":0.014238984320288294,"score_gpt":0.25174485062424046,"score_spread":0.23750586630395215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025036419,0.0001651162,0.9842056,0.0061340965,0.000098185476,0.00031141244,0.0001314525,0.0002840598,0.0061664437],"genre_scores_gemma":[0.9834254,0.000036658534,0.016196692,0.00013519566,0.000066470704,0.0000464739,0.000028380797,0.000019286104,0.000045468154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933434,0.000019960375,0.000298618,0.00008385854,0.000118039105,0.00014520905],"domain_scores_gemma":[0.9994047,0.00012696914,0.000047565223,0.0001998846,0.0001208334,0.000100030666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108808825,0.000095537405,0.00015297969,0.000041365172,0.00017369688,0.00005002961,0.00015174177,0.000041222942,0.000103024635],"category_scores_gemma":[0.00039667287,0.00007729603,0.000063286214,0.00046729008,0.00004651921,0.00006795325,0.000024541234,0.00010382804,0.00008758453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051181596,0.000051936724,0.00019329217,0.0003170695,0.00017555509,9.613884e-7,0.013976923,0.7346564,0.014067334,0.21530996,0.020632768,0.00061271107],"study_design_scores_gemma":[0.0011538719,0.00021987101,0.00075703784,0.0005670803,0.00037815733,0.00001298083,0.0044415616,0.79632914,0.061427806,0.04864398,0.08504504,0.0010234871],"about_ca_topic_score_codex":0.0000040851723,"about_ca_topic_score_gemma":0.000004602676,"teacher_disagreement_score":0.98092175,"about_ca_system_score_codex":0.000029207298,"about_ca_system_score_gemma":0.0000199177,"threshold_uncertainty_score":0.31520405},"labels":[],"label_agreement":null},{"id":"W4401045590","doi":"10.2139/ssrn.4907785","title":"A Biased Random-Key Genetic Algorithm with Reinforcement Learning for the Capacited Multi-Period Cutting Stock Problem with Setup Cost","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","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":"HEC Montréal","funders":"","keywords":"Reinforcement learning; Key (lock); Stock (firearms); Computer science; Genetic algorithm; Period (music); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning; Engineering; Computer security; Mechanical engineering","score_opus":0.012523584186874395,"score_gpt":0.2289748638891002,"score_spread":0.21645127970222583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401045590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011287562,0.0054187006,0.9897372,0.00029481636,0.00032959864,0.0024603484,0.000012746067,0.00036941704,0.00024840364],"genre_scores_gemma":[0.83058566,0.009219828,0.14932573,0.00010888503,0.0010636253,0.0020148763,0.00029843126,0.0008365302,0.0065464475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644166,0.00009113496,0.00059481175,0.0004060381,0.00042611395,0.0020402481],"domain_scores_gemma":[0.9989239,0.00011888562,0.00029544355,0.0003021658,0.00023532576,0.00012430918],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001299664,0.0005781896,0.00048276407,0.00025867258,0.00049280917,0.00056409754,0.00038288123,0.00022240895,0.0000260921],"category_scores_gemma":[0.000030527684,0.00037298235,0.00019164057,0.00031774837,0.00006535436,0.00007433003,0.00009876424,0.005947548,0.000008855338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013615403,0.000014416207,0.000043278167,0.00027724975,0.0013428838,0.00000772103,0.0015768424,0.97029394,0.000022509588,0.00018913852,0.0000502837,0.026045578],"study_design_scores_gemma":[0.0044240463,0.00044984513,0.000006616541,0.0009267484,0.00046033296,0.00062257895,0.00093690556,0.98831743,0.00005034125,0.0006944273,0.0025418687,0.0005688394],"about_ca_topic_score_codex":0.000053006235,"about_ca_topic_score_gemma":0.00027633688,"teacher_disagreement_score":0.8404115,"about_ca_system_score_codex":0.0010773782,"about_ca_system_score_gemma":0.001796162,"threshold_uncertainty_score":0.9998722},"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":"W4402603214","doi":"10.2139/ssrn.4958665","title":"Computing Local Optima in Quadratic Unconstrained Binary Optimization Problems in Randomized Polynomial Time","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","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":"Wilfrid Laurier University","funders":"","keywords":"Quadratic unconstrained binary optimization; Binary number; Quadratic equation; Mathematics; Time complexity; Mathematical optimization; Polynomial; Local optimum; Binary quadratic form; Applied mathematics; Quadratic function; Algorithm; Mathematical analysis; Arithmetic; Physics","score_opus":0.005255960677448376,"score_gpt":0.21276171563183155,"score_spread":0.20750575495438317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402603214","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.02491586,0.015418589,0.948607,0.0007339103,0.0022584612,0.0022642,0.00001485859,0.000690645,0.0050964714],"genre_scores_gemma":[0.9901803,0.0034667624,0.0053074574,0.000026312797,0.0002981281,0.000044434688,0.00012268272,0.00016626724,0.00038766454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542147,0.00040325444,0.0014417064,0.00044308306,0.00030646133,0.0019840307],"domain_scores_gemma":[0.99917513,0.00018939853,0.0002429821,0.00022406674,0.00006543877,0.00010297476],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0043179416,0.0005488691,0.0011846542,0.0011107671,0.00006546938,0.00027957905,0.0003759542,0.00051071023,0.000092095],"category_scores_gemma":[0.00008231728,0.0005456801,0.00031613992,0.00058660406,0.00011729398,0.00012664495,0.00021307287,0.00687366,0.00005066604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044795327,0.000046070178,0.000025042787,0.0002609082,0.00021918117,0.000019469491,0.00066186325,0.9946222,0.000025068337,0.00082599587,0.00006413329,0.002782143],"study_design_scores_gemma":[0.020116704,0.000052064028,0.0000023786595,0.001223169,0.000070357986,0.00016144851,0.00018529831,0.9624944,0.0000065727686,0.015172674,0.000011096812,0.00050385745],"about_ca_topic_score_codex":0.00010871374,"about_ca_topic_score_gemma":0.0003755597,"teacher_disagreement_score":0.96526444,"about_ca_system_score_codex":0.0025763998,"about_ca_system_score_gemma":0.0023948874,"threshold_uncertainty_score":0.9996995},"labels":[],"label_agreement":null},{"id":"W4402712080","doi":"10.4230/lipics.approx/random.2024.29","title":"Approximation Algorithms for Correlated Knapsack Orienteering","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Orienteering; Computer science; Algorithm; Mathematics; Mathematical optimization","score_opus":0.06272491869529763,"score_gpt":0.18251103723402018,"score_spread":0.11978611853872255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402712080","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.021708127,0.00025319026,0.9649578,0.000021339687,0.0032186408,0.00068741705,0.00011074719,0.0015401507,0.007502639],"genre_scores_gemma":[0.992443,0.00025011707,0.0034110514,0.000012584509,0.00011949221,0.00000618264,0.00031777148,0.00009368638,0.0033461177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990376,0.000015639516,0.0001896698,0.00046333642,0.00004647231,0.00024728067],"domain_scores_gemma":[0.99939346,0.000039995546,0.000056326262,0.00032768137,0.00009592372,0.00008660435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011607327,0.00027067828,0.00022887155,0.00023519894,0.00006304163,0.00009244862,0.0002348715,0.0003407459,0.000057285673],"category_scores_gemma":[0.000013907521,0.00033701723,0.00016032372,0.00036699485,0.000028097917,0.00008484219,0.00021982405,0.0004993048,0.00012722795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008472369,0.000011936481,0.000029685321,0.0006513756,0.0001265864,0.000013469083,0.00020633351,0.9830869,0.000022007851,0.0141730625,0.0011510965,0.00051911036],"study_design_scores_gemma":[0.000302452,0.000015132927,0.000007832687,0.00021752095,0.00012107588,0.0000018122853,0.00004343521,0.98333794,0.00014141912,0.012527665,0.0029317723,0.00035196423],"about_ca_topic_score_codex":0.00001091852,"about_ca_topic_score_gemma":0.0000052902374,"teacher_disagreement_score":0.9707349,"about_ca_system_score_codex":0.00019950437,"about_ca_system_score_gemma":0.000038635964,"threshold_uncertainty_score":0.9999082},"labels":[],"label_agreement":null},{"id":"W4402816864","doi":"10.2139/ssrn.4957990","title":"Tight Upper and Lower Bounds for the Quadratic Knapsack Problem Through Binary Decision Diagrams","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","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":"Université du Québec à Montréal","funders":"","keywords":"Knapsack problem; Binary number; Quadratic equation; Mathematics; Binary decision diagram; Combinatorics; Upper and lower bounds; Mathematical optimization; Algorithm; Arithmetic; Mathematical analysis; Geometry","score_opus":0.009506888782251517,"score_gpt":0.2455014864579759,"score_spread":0.2359945976757244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402816864","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.019983679,0.19625217,0.7648765,0.0041101943,0.0074835606,0.0022232938,0.000045530993,0.0006110199,0.004414085],"genre_scores_gemma":[0.87242997,0.11190349,0.0091441935,0.00018004628,0.0012982194,0.00022630877,0.000056645946,0.00032268587,0.0044384617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745214,0.00003930031,0.00047826988,0.00033233143,0.00026760428,0.001430363],"domain_scores_gemma":[0.9991889,0.00022641297,0.00010203886,0.00032338453,0.000087797416,0.00007146211],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011145497,0.00039116884,0.00032529212,0.00011724237,0.00029004135,0.00061069574,0.00037054066,0.0003153575,0.000051365267],"category_scores_gemma":[0.000031915664,0.0002647618,0.0002472585,0.00017220445,0.00006127631,0.000121606805,0.00027912811,0.003831076,0.000034589855],"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.0001530042,0.000119463075,0.00013219823,0.001283723,0.0024298814,0.00001419734,0.0030040715,0.6903448,0.00010507043,0.15440658,0.019400883,0.12860614],"study_design_scores_gemma":[0.0004551599,0.0002144383,0.00001614316,0.00056032365,0.00024177074,0.00022787596,0.00019141435,0.12219644,0.00001692874,0.84586287,0.029576661,0.00043995344],"about_ca_topic_score_codex":0.000011722315,"about_ca_topic_score_gemma":0.00019322356,"teacher_disagreement_score":0.85244626,"about_ca_system_score_codex":0.00055276963,"about_ca_system_score_gemma":0.0007830678,"threshold_uncertainty_score":0.99998045},"labels":[],"label_agreement":null},{"id":"W4403377234","doi":"10.1002/jgt.23194","title":"Improved bounds on the cop number when forbidding a minor","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Minor (academic); Combinatorics; Mathematics; Law; Political science","score_opus":0.011344092198821881,"score_gpt":0.22676961264497078,"score_spread":0.2154255204461489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403377234","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.38725287,0.01263797,0.26579827,0.005970757,0.01773884,0.0007474873,0.000039502116,0.0010418578,0.30877241],"genre_scores_gemma":[0.99755514,0.00015336831,0.00075478037,0.00023145271,0.00020346242,0.0000022889128,5.5055045e-7,0.00003232573,0.001066626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994579,0.000045882873,0.00021069133,0.0000497786,0.00011547171,0.00012025121],"domain_scores_gemma":[0.9995419,0.00024345693,0.000041388328,0.00009721585,0.00003289112,0.00004315988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070817623,0.00008904844,0.00010323553,0.00011068045,0.00005492384,0.00013992882,0.00013354355,0.000044426866,0.0005257558],"category_scores_gemma":[0.000035351553,0.000054577944,0.00014025661,0.00014878923,0.00003054656,0.00011271653,0.000008266979,0.00029119098,0.00002984602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022248352,0.000079815094,0.00037526648,0.00041074044,0.0013344059,0.00010606939,0.010135749,0.034787554,0.009589608,0.7604494,0.14868943,0.033819485],"study_design_scores_gemma":[0.0012543491,0.00039329118,0.0002264792,0.0018060362,0.0002910255,0.00065417285,0.0012259402,0.10249498,0.007074789,0.6085212,0.27529946,0.00075826305],"about_ca_topic_score_codex":6.3016716e-7,"about_ca_topic_score_gemma":7.961471e-7,"teacher_disagreement_score":0.61030227,"about_ca_system_score_codex":0.00002664714,"about_ca_system_score_gemma":0.00001727781,"threshold_uncertainty_score":0.5756657},"labels":[],"label_agreement":null},{"id":"W4403764673","doi":"10.3390/a17110480","title":"Nonlinear Optimization and Adaptive Heuristics for Solving Irregular Object Packing Problems","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Heuristics; Mathematical optimization; Nonlinear system; Computer science; Object (grammar); Packing problems; Algorithm; Mathematics; Artificial intelligence; Physics","score_opus":0.016850108700707564,"score_gpt":0.23207164758118895,"score_spread":0.2152215388804814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403764673","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.00020756217,0.0028923014,0.99422485,0.000060568636,0.00078511384,0.00038730467,0.00005270081,0.00069873413,0.0006908452],"genre_scores_gemma":[0.110289656,0.0013164053,0.8865732,0.00006243695,0.0006375842,0.0001154263,0.0002049411,0.0002020717,0.0005982695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921876,0.000008954331,0.00020376858,0.00022671472,0.000107229855,0.00023458051],"domain_scores_gemma":[0.9996333,0.00010589184,0.000019403926,0.00010969113,0.000067706234,0.00006397508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016638651,0.00016799611,0.00015199177,0.000113291404,0.000096298696,0.0002033888,0.000060936887,0.00009471437,0.000021963904],"category_scores_gemma":[0.000025674533,0.00017004798,0.000045788358,0.00021783309,0.000029272733,0.0001889094,0.000021524169,0.0001253608,0.0000073377128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017191156,0.000007655853,0.000014073813,0.00027572416,0.000060695547,0.0000041755184,0.0006136932,0.9845294,0.00013429952,0.00040864522,0.00048569115,0.01346427],"study_design_scores_gemma":[0.000193955,0.00004916345,0.0000051776165,0.00019268395,0.00003015025,0.000017335136,0.00004970259,0.9921833,0.00036399002,0.00031427958,0.0063840696,0.00021617312],"about_ca_topic_score_codex":0.0000047759095,"about_ca_topic_score_gemma":0.000002668636,"teacher_disagreement_score":0.1100821,"about_ca_system_score_codex":0.000040408926,"about_ca_system_score_gemma":0.000020930363,"threshold_uncertainty_score":0.69343555},"labels":[],"label_agreement":null},{"id":"W4404328149","doi":"10.1139/tcsme-2024-0084","title":"Improved adaptive genetic algorithm for dynamic multi-specification one-dimensional cutting problem","year":2024,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science; Genetic algorithm; Mathematical optimization; Mathematics","score_opus":0.015984367782625672,"score_gpt":0.2139769895269972,"score_spread":0.19799262174437154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404328149","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.00008837455,0.0003565412,0.9972792,0.00019673821,0.0006481521,0.00082440174,0.00036024844,0.00023829078,0.000008030018],"genre_scores_gemma":[0.22173396,0.000027436647,0.7776484,0.000024307057,0.00004341429,0.00025425045,0.000024612562,0.00008266493,0.00016094212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916303,0.000004326447,0.00026237004,0.00018761445,0.00009093113,0.00029173947],"domain_scores_gemma":[0.9995242,0.000093011055,0.00002101572,0.00015590565,0.00007757784,0.00012828721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014682616,0.00015068971,0.0001442882,0.00006636059,0.00017037851,0.000041366915,0.00015005919,0.00015426065,0.000015802578],"category_scores_gemma":[0.000007290539,0.00015084023,0.00042159547,0.00026243844,0.000018189066,0.00008129723,0.0000030898625,0.00021115922,0.0000010336611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001292137,0.000009477977,4.0790244e-8,0.0002529798,0.00020984453,5.9038445e-8,0.00018961588,0.9645531,0.009279972,0.00079596764,0.00006438819,0.024643222],"study_design_scores_gemma":[0.00025321243,0.000028077016,0.0000036675392,0.00012287025,0.000088900924,0.0000029692874,0.000029158218,0.99375635,0.0038781643,0.0001285703,0.0015430793,0.00016497674],"about_ca_topic_score_codex":0.00042941634,"about_ca_topic_score_gemma":0.0018729576,"teacher_disagreement_score":0.22164558,"about_ca_system_score_codex":0.00039834873,"about_ca_system_score_gemma":0.00012422685,"threshold_uncertainty_score":0.6151086},"labels":[],"label_agreement":null},{"id":"W4404342410","doi":"10.48550/arxiv.2410.22607","title":"Packing Designs with large block size","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block (permutation group theory); Block size; Computer science; Mathematics; Combinatorics; Computer security","score_opus":0.0535588474645046,"score_gpt":0.16894140717081163,"score_spread":0.11538255970630704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404342410","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.432738,0.0009269286,0.43036827,0.00013587221,0.002966656,0.0012114836,0.00024021845,0.006057,0.12535554],"genre_scores_gemma":[0.9948247,0.00022652745,0.0008278062,0.000035638008,0.00008148122,0.0000010817914,0.000021823927,0.000090595975,0.0038903458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989316,0.000033289532,0.00013283978,0.0004984537,0.000063172796,0.0003406404],"domain_scores_gemma":[0.9992403,0.00007035674,0.000046904817,0.0004569516,0.00006405641,0.000121430545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011392263,0.00032191066,0.00025418904,0.000162143,0.00007422915,0.000111108,0.00029621526,0.00026986637,0.00018510097],"category_scores_gemma":[0.000010920041,0.00034335128,0.00011249258,0.00043886763,0.000036395322,0.0000667533,0.00032453216,0.00074370555,0.00021770556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001037348,0.000017659258,0.000659324,0.00035756567,0.00018143424,0.00022586023,0.00023946437,0.98806304,0.000023579008,0.009285963,0.00090376986,0.00003194637],"study_design_scores_gemma":[0.0005658584,0.000037816153,0.0001428259,0.0006244024,0.00027835666,0.000011051372,0.00012714443,0.9848526,0.00021434338,0.007386358,0.0049270694,0.00083214603],"about_ca_topic_score_codex":0.000014102698,"about_ca_topic_score_gemma":0.00005414614,"teacher_disagreement_score":0.5620867,"about_ca_system_score_codex":0.00014590696,"about_ca_system_score_gemma":0.00006848701,"threshold_uncertainty_score":0.99990183},"labels":[],"label_agreement":null},{"id":"W4404575037","doi":"10.1016/j.dam.2024.11.015","title":"Renting servers in the cloud: The case of equal duration jobs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Server; Cloud computing; Mathematics; Duration (music); Renting; Operating system; Computer science; Engineering","score_opus":0.017041590930676552,"score_gpt":0.2450997963983055,"score_spread":0.22805820546762895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404575037","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.386792,0.0007700436,0.47621232,0.0010436504,0.0009484687,0.0017590503,0.000048447837,0.0007398444,0.13168617],"genre_scores_gemma":[0.9955254,0.000022904876,0.00430272,0.000021480348,0.00004191402,0.000027526225,0.000011197913,0.00002146604,0.000025343443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994428,0.0000121767125,0.0002736929,0.00006917175,0.00009430537,0.000107830594],"domain_scores_gemma":[0.99957526,0.0001808421,0.000032695258,0.00019138806,0.000008821699,0.000010974133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042973054,0.000086401385,0.00009030484,0.000040452265,0.000043755852,0.00008148043,0.00011555483,0.000038302627,0.000025318423],"category_scores_gemma":[0.000015033415,0.00005099301,0.000034626588,0.0002674472,0.000024207926,0.000045071483,0.000017591072,0.0001350509,0.000015646663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021664998,0.000019925768,0.000006326407,0.0015093184,0.000050785235,0.000050324863,0.040377617,0.1198008,0.0013968219,0.8334876,0.000997432,0.0023009349],"study_design_scores_gemma":[0.0001447073,0.0000076274096,0.0000073971355,0.00015171431,0.00004437845,0.00009374957,0.008147142,0.968235,0.0012113824,0.020961093,0.00085071975,0.00014509476],"about_ca_topic_score_codex":0.000006927285,"about_ca_topic_score_gemma":0.00003339106,"teacher_disagreement_score":0.8484342,"about_ca_system_score_codex":0.000013087265,"about_ca_system_score_gemma":0.000006470953,"threshold_uncertainty_score":0.20794347},"labels":[],"label_agreement":null},{"id":"W4404872695","doi":"","title":"Hnm4lcp - Un solveur de problèmes de complémentarité linéaire fondé sur l'algorithme de Newton-min hybride","year":2024,"lang":"en","type":"other","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Complementarity (molecular biology); Solver; Algorithm; Computer science; Linear complementarity problem; Mathematics; Applied mathematics; Mathematical optimization; Physics; Nonlinear system","score_opus":0.007612688933860756,"score_gpt":0.1970754556452505,"score_spread":0.18946276671138976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404872695","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005895695,0.008073548,0.3962069,0.0042358823,0.0005785932,0.000744076,0.00024664635,0.0031989296,0.58612585],"genre_scores_gemma":[0.009707964,0.0024276215,0.18704383,0.00028530727,0.00014112041,0.00013471684,0.00075626705,0.0010644295,0.7984387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724084,0.000977737,0.0004112976,0.0004916889,0.00027405558,0.00060435827],"domain_scores_gemma":[0.9979925,0.0003085555,0.00016372462,0.001018623,0.000256194,0.00026037154],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018706521,0.0004328227,0.00037873184,0.00031105996,0.00013400619,0.0003934962,0.0007527182,0.00034516145,0.001037326],"category_scores_gemma":[0.00021754956,0.00049759727,0.00018325819,0.00042081004,0.00011689076,0.00008515443,0.00020911034,0.0006048437,0.00023840688],"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.0000078439425,0.0004999588,0.0017844161,0.0018531752,0.00062238507,0.000059405706,0.010240646,0.007122869,0.0017297083,0.022974793,0.8873513,0.0657535],"study_design_scores_gemma":[0.00054540706,6.741345e-7,0.00018124525,0.0034574815,0.000107947286,0.00006086953,0.00006836217,0.19987352,0.009892184,0.0015815338,0.7834781,0.0007527138],"about_ca_topic_score_codex":0.0023539725,"about_ca_topic_score_gemma":0.0039607543,"teacher_disagreement_score":0.21231288,"about_ca_system_score_codex":0.00029984364,"about_ca_system_score_gemma":0.00021543812,"threshold_uncertainty_score":0.99987584},"labels":[],"label_agreement":null},{"id":"W4404875870","doi":"10.1016/j.tre.2024.103866","title":"Contextual bandits learning-based branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with conflicts and time windows","year":2024,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Optimization and Packing Problems","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":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Algorithm; Mathematical optimization; Artificial intelligence; Operations research; Mathematics","score_opus":0.046822503941421414,"score_gpt":0.31429689196256394,"score_spread":0.26747438802114254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404875870","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.010183442,0.20420942,0.7709552,0.004383827,0.00026568153,0.0074623227,0.0014092497,0.0007566205,0.0003742578],"genre_scores_gemma":[0.9394097,0.05270833,0.0047868895,0.0003363691,0.00009327915,0.00059271883,0.001601885,0.00010175406,0.00036911108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985263,0.00006801311,0.00041570267,0.00034804354,0.00034945886,0.00029248494],"domain_scores_gemma":[0.99858576,0.0008634273,0.00005091202,0.00009368153,0.00025058215,0.00015565044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008534126,0.0002241565,0.0003117761,0.000101777856,0.00029236558,0.00014601908,0.00005308609,0.00007430237,0.00008966617],"category_scores_gemma":[0.000021499573,0.00016208159,0.00004186091,0.0002570403,0.00026273314,0.00012770432,0.0000013732044,0.0003588326,0.0000045833735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029387546,0.00014334777,0.0052415184,0.050537065,0.0010070695,0.00013947666,0.005257489,0.63852406,0.0003878594,0.049426846,0.0028631932,0.2461782],"study_design_scores_gemma":[0.003033236,0.00057641114,0.014448094,0.0065964023,0.00067526905,0.000012910597,0.000065011904,0.82476753,0.000116340074,0.0005711797,0.1483925,0.000745123],"about_ca_topic_score_codex":0.000036581587,"about_ca_topic_score_gemma":0.00018499378,"teacher_disagreement_score":0.9292262,"about_ca_system_score_codex":0.000011567779,"about_ca_system_score_gemma":0.00006133883,"threshold_uncertainty_score":0.6609495},"labels":[],"label_agreement":null},{"id":"W4405544325","doi":"10.1139/cjce-2024-0241","title":"Optimizing floor tile design in residential spaces using nesting algorithm and multi-objective optimization with BIM data","year":2024,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nesting (process); Tile; Computer science; Algorithm; Mathematical optimization; Engineering; Mathematics; Mechanical engineering; Geography","score_opus":0.028935525453170262,"score_gpt":0.22734000283710173,"score_spread":0.19840447738393147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405544325","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.001427322,0.004004652,0.993791,0.000024996494,0.0005144835,0.00010650174,0.000014171067,0.000064556596,0.000052313782],"genre_scores_gemma":[0.42778698,0.00010864164,0.5718571,0.000005116527,0.00015000183,0.000001420283,0.000007738,0.00007487995,0.0000080914715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991288,0.000022978329,0.00029163988,0.00015928119,0.00011178069,0.00028550831],"domain_scores_gemma":[0.999456,0.00006467182,0.00004281792,0.00012857183,0.00006614664,0.00024177445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039787163,0.00017030154,0.00019890029,0.0007799054,0.000056230427,0.00034325305,0.00016172396,0.000072453695,0.00003187971],"category_scores_gemma":[0.000080713326,0.00017346513,0.00001885659,0.00051533664,0.000021805105,0.00078037946,0.000016406771,0.00030905314,6.1894355e-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.0000019244487,0.0000015075732,0.000057656398,0.00008910142,0.00004459831,0.00021370765,0.000763989,0.99763185,0.000096737276,0.00000786518,0.000034059456,0.0010569845],"study_design_scores_gemma":[0.0002968849,0.000022965982,0.00006331353,0.0010446901,0.00003641358,0.00031804535,0.00012850264,0.9976632,0.000095506126,0.000003469803,0.00013017394,0.00019683162],"about_ca_topic_score_codex":0.0006319509,"about_ca_topic_score_gemma":0.0088911485,"teacher_disagreement_score":0.42635968,"about_ca_system_score_codex":0.00017254776,"about_ca_system_score_gemma":0.0003295877,"threshold_uncertainty_score":0.7073703},"labels":[],"label_agreement":null},{"id":"W4405992972","doi":"10.1145/3700838.3700850","title":"Renting Servers for Multi-Parameter Jobs in the Cloud","year":2025,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","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":"Concordia University","funders":"","keywords":"Server; Cloud computing; Computer science; Renting; Cloud server; Multitenancy; Distributed computing; Computer network; Operating system; Engineering; Software as a service; Software","score_opus":0.036247131076640605,"score_gpt":0.2804273565732786,"score_spread":0.244180225496638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405992972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035197187,0.0001494589,0.9090839,0.0011651777,0.001309071,0.0006775866,0.0000039482366,0.00038375065,0.052029926],"genre_scores_gemma":[0.9274958,0.000016673775,0.068001404,0.00075105735,0.00002726622,0.00004673475,0.000008866489,0.000012498592,0.0036397118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999735,0.000009174163,0.000089433874,0.00005149024,0.00002448231,0.00009042854],"domain_scores_gemma":[0.9998213,0.0000774862,0.000005273123,0.000080749836,0.000009201207,0.0000060119314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000134628,0.00004233815,0.00004439788,0.000040385446,0.000023251152,0.00003322475,0.000073617135,0.000027394553,0.000025363883],"category_scores_gemma":[0.000032079635,0.000030995405,0.000024921514,0.00013711887,0.0000042594875,0.000031224452,0.0000067045817,0.00004925653,0.0000053544545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009167215,0.00005500323,0.014534921,0.00038171926,0.00006307771,9.465491e-7,0.0028915713,0.9059383,0.00023720725,0.03133591,0.03336918,0.011182961],"study_design_scores_gemma":[0.00041976772,0.0000035401963,0.0012554873,0.000027712023,0.000004641456,1.8227792e-7,0.00018468151,0.9745245,0.00038210212,0.00025147945,0.022883113,0.00006281309],"about_ca_topic_score_codex":0.000012228954,"about_ca_topic_score_gemma":0.00008681757,"teacher_disagreement_score":0.8922986,"about_ca_system_score_codex":0.000009799595,"about_ca_system_score_gemma":0.0000030367676,"threshold_uncertainty_score":0.12639558},"labels":[],"label_agreement":null},{"id":"W4406614545","doi":"10.1016/j.eswa.2025.126534","title":"Deep reinforcement learning-based column generation for the two-dimensional vector variable-sized packing problem","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Optimization and Packing Problems","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 Toronto","funders":"National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Column (typography); Variable (mathematics); Artificial intelligence; Reinforcement; Mathematical optimization; Mathematics; Materials science; Composite material; Mathematical analysis","score_opus":0.012331397136158447,"score_gpt":0.24001417987003454,"score_spread":0.2276827827338761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406614545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019102681,0.00092648796,0.9930432,0.00036243148,0.00024650057,0.0028785726,0.0000035231353,0.00037559477,0.00214461],"genre_scores_gemma":[0.93575925,0.000019533696,0.039309546,0.00037331044,0.0003677693,0.021107148,0.0004000124,0.00007052059,0.0025929327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902457,0.00003467853,0.00032967507,0.00022616754,0.0001678055,0.00021713109],"domain_scores_gemma":[0.9991138,0.00022494742,0.00008321496,0.00032504927,0.00020428009,0.00004871564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023977496,0.00016825485,0.00016653862,0.000079418256,0.00053960126,0.00015105847,0.00014487887,0.000067228604,0.000032213084],"category_scores_gemma":[0.00001449909,0.00012863129,0.00003952088,0.00040877846,0.00002897193,0.000065159795,0.000012850999,0.00011629563,0.0000116163565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011535639,0.000015490567,0.000023827235,0.0000846567,0.00007474543,5.9618095e-8,0.00013291686,0.9823667,0.0020865195,0.011209058,0.003746196,0.00024830087],"study_design_scores_gemma":[0.0008470343,0.000022748107,0.0000039177035,0.000074983815,0.000025041376,0.0000015013563,0.000049165294,0.88223916,0.000439205,0.000016590426,0.116138816,0.0001418531],"about_ca_topic_score_codex":0.00007230828,"about_ca_topic_score_gemma":0.0000349124,"teacher_disagreement_score":0.9537336,"about_ca_system_score_codex":0.00012601068,"about_ca_system_score_gemma":0.00010542067,"threshold_uncertainty_score":0.52454317},"labels":[],"label_agreement":null},{"id":"W4407635183","doi":"10.1007/s10107-025-02193-5","title":"A $$\\frac{4}{3}$$-approximation algorithm for half-integral cycle cut instances of the TSP","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Computing and Communication Foundations; Division of Graduate Education; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Numerical analysis; Combinatorics; Algorithm; Approximation algorithm; Applied mathematics; Mathematical analysis","score_opus":0.010556382605061157,"score_gpt":0.24978544149833937,"score_spread":0.23922905889327822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407635183","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.0013112951,0.000113112095,0.9893858,0.00018098911,0.000202555,0.000697705,0.0000055690116,0.00021556581,0.007887455],"genre_scores_gemma":[0.43149164,0.000006258266,0.56748515,0.000047957412,0.00003714429,0.00026199283,0.0000095698115,0.00003197625,0.000628296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992348,0.000016114884,0.0003236676,0.000107735264,0.0001273093,0.00019036437],"domain_scores_gemma":[0.999559,0.00011837023,0.000049480666,0.00018453723,0.00006235322,0.000026265061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022215417,0.00011512379,0.00018592746,0.000055548695,0.00008084352,0.00005695155,0.000170256,0.00007131238,0.0000204944],"category_scores_gemma":[0.00010285713,0.00008191571,0.00010631717,0.00030274934,0.00006250502,0.000079523066,0.000028271077,0.00010611017,0.0000046281893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055149176,0.00015585107,0.000062433304,0.0018844146,0.000099170575,2.5676724e-7,0.0012315948,0.00929154,0.00016396883,0.15833858,0.0004168846,0.82834977],"study_design_scores_gemma":[0.00029959853,0.000017695596,0.000010831063,0.0003493838,0.00003375548,0.0000013494175,0.00020767226,0.95138454,0.0042347102,0.035798255,0.007551675,0.00011051439],"about_ca_topic_score_codex":0.0000019986694,"about_ca_topic_score_gemma":0.0000073447213,"teacher_disagreement_score":0.942093,"about_ca_system_score_codex":0.000030394329,"about_ca_system_score_gemma":0.000015894335,"threshold_uncertainty_score":0.33404255},"labels":[],"label_agreement":null},{"id":"W4407768365","doi":"10.1007/978-981-96-2845-2_15","title":"Approximation Algorithms for Non-sequential Star Packing Problems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"University of Alberta","funders":"","keywords":"Computer science; Star (game theory); Algorithm; Mathematics","score_opus":0.020326695338843383,"score_gpt":0.242552735534028,"score_spread":0.22222604019518463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407768365","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.000006306751,0.00016417707,0.990776,0.00008284982,0.0017973582,0.0008050864,0.000022396842,0.00022533216,0.0061204825],"genre_scores_gemma":[0.02575883,0.00011631072,0.97175187,0.00035180457,0.00062253117,0.00007211396,0.00013540965,0.00009789877,0.001093235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840087,0.0000059766326,0.00036690492,0.00053215586,0.0003197275,0.00037434007],"domain_scores_gemma":[0.99921125,0.0001334237,0.000089444904,0.00035217445,0.00015359126,0.000060130886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037730817,0.00032973412,0.00030944296,0.00051637297,0.000135789,0.00025780027,0.00048321186,0.00026820725,0.000020413072],"category_scores_gemma":[0.000025119722,0.00033395688,0.000087179316,0.00027708744,0.00013916583,0.00020072958,0.000111648995,0.00036836494,0.0000066819202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016115484,0.0000045645697,0.0000031871737,0.00031127463,0.000012141381,0.0000012959609,0.0002964224,0.81254023,0.000112513524,0.0013447356,0.000047408237,0.1853246],"study_design_scores_gemma":[0.00023995725,0.000037771617,0.0000028369282,0.0006158672,0.000010945548,0.0000032216142,9.447435e-8,0.9741795,0.0010970449,0.01999385,0.003466708,0.00035219718],"about_ca_topic_score_codex":0.000004725556,"about_ca_topic_score_gemma":0.0000230479,"teacher_disagreement_score":0.18497239,"about_ca_system_score_codex":0.00020803517,"about_ca_system_score_gemma":0.00014277104,"threshold_uncertainty_score":0.99991125},"labels":[],"label_agreement":null},{"id":"W4408156600","doi":"10.1007/s10898-025-01472-x","title":"Stochastic red-blue set covering: a decomposition approach","year":2025,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Packing Problems","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":"University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decomposition; Set (abstract data type); Mathematical optimization; Computer science; Ecology","score_opus":0.008097414824323117,"score_gpt":0.25256140725978055,"score_spread":0.24446399243545744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408156600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020303812,0.00023434794,0.9878797,0.0001291072,0.0006648738,0.000102672995,0.0000086018335,0.000079463025,0.008870854],"genre_scores_gemma":[0.885892,0.00009627445,0.11372294,0.00010606706,0.00007929295,0.0000026539735,0.00003114901,0.00001447892,0.00005516906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992108,0.000028660568,0.00039388696,0.000078067846,0.00016054534,0.00012804037],"domain_scores_gemma":[0.99951386,0.00001775374,0.00012832343,0.000092109105,0.00018810286,0.00005982299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015182383,0.00011629405,0.00018004981,0.00010666079,0.000051588482,0.00008035679,0.000119111675,0.00008955989,0.000026231612],"category_scores_gemma":[0.00003929134,0.00011680662,0.00007122094,0.00050292,0.000014626212,0.00025598082,0.000015121324,0.00012030279,0.0000023177042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029730407,0.000027802227,0.0001422217,0.000039355935,0.000057589732,0.0000014943049,0.000044299384,0.9951451,0.000030866853,0.00078780204,0.0032965809,0.00039720174],"study_design_scores_gemma":[0.00060835516,0.000038107355,0.00019294504,0.00010467178,0.00005007435,0.000054844608,0.000035694753,0.998089,0.000037670783,0.00015517748,0.00053176464,0.000101701684],"about_ca_topic_score_codex":0.0000012106487,"about_ca_topic_score_gemma":5.6635247e-7,"teacher_disagreement_score":0.8838616,"about_ca_system_score_codex":0.00025076495,"about_ca_system_score_gemma":0.000050403873,"threshold_uncertainty_score":0.47632357},"labels":[],"label_agreement":null},{"id":"W4408508780","doi":"10.1080/23302674.2025.2478426","title":"Optimisation of assortment breadth and allocation of the selected product groups to the two-dimensional shelves","year":2025,"lang":"en","type":"article","venue":"International Journal of Systems Science Operations & Logistics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Product (mathematics); Business; Advertising; Marketing; Commerce; Mathematics; Geometry","score_opus":0.013361910608529115,"score_gpt":0.26631020217597445,"score_spread":0.25294829156744536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408508780","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.64877653,0.0006816997,0.33164525,0.007823725,0.008500178,0.0010759508,0.00009641749,0.000032924283,0.0013672884],"genre_scores_gemma":[0.99535197,0.000025576415,0.0043455814,0.000046251393,0.00007260775,0.0000055836495,0.000003451122,0.000003882773,0.00014511737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876904,0.000045995563,0.0005041376,0.000085458065,0.0005205108,0.000074872805],"domain_scores_gemma":[0.99756145,0.00006886163,0.00014656382,0.00013421904,0.0020601912,0.000028721617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007930956,0.00006926451,0.00011002014,0.00021763927,0.00011568642,0.000110048844,0.00040868926,0.00001873415,0.0000037565253],"category_scores_gemma":[0.00047041208,0.00004295678,0.000024555013,0.0006110313,0.00016620987,0.00018745747,0.000050739276,0.000086850014,5.9030026e-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.000004651292,0.000023446464,0.0008051251,0.000011839054,0.0000386762,1.540856e-7,0.00032206913,0.9620615,0.025497096,0.0104595255,0.00034464907,0.00043122555],"study_design_scores_gemma":[0.00048658965,0.000065307635,0.025489388,0.0004520292,0.00005862324,0.0000772589,0.00031567333,0.95252824,0.019638686,0.00017781091,0.0005896977,0.00012070444],"about_ca_topic_score_codex":0.000052863183,"about_ca_topic_score_gemma":0.000050859002,"teacher_disagreement_score":0.34657538,"about_ca_system_score_codex":0.00011710788,"about_ca_system_score_gemma":0.0002758564,"threshold_uncertainty_score":0.17517267},"labels":[],"label_agreement":null},{"id":"W4408577964","doi":"10.23952/jano.7.2025.1.06","title":"Solving a large-scale least squares problem with a simplex constraint by a two-stage algorithm","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Stage (stratigraphy); Simplex algorithm; Constraint (computer-aided design); Scale (ratio); Least-squares function approximation; Simplex; Algorithm; Mathematical optimization; Mathematics; Computer science; Linear programming; Combinatorics; Geography; Statistics","score_opus":0.003708786062473193,"score_gpt":0.20901014485763778,"score_spread":0.2053013587951646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408577964","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.0003565121,0.00017618698,0.9903155,0.00014625162,0.00005681758,0.00016773533,0.000016387408,0.00007066739,0.008693966],"genre_scores_gemma":[0.42533597,0.00023379004,0.57384926,0.0002788114,0.000059761824,0.00001299614,0.00003179783,0.00004048259,0.000157116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911684,0.000015010763,0.00037990953,0.0001236016,0.0001615344,0.00020310734],"domain_scores_gemma":[0.99954647,0.0000422037,0.00013945899,0.00007055412,0.000099294666,0.00010204046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016076902,0.00015749974,0.0002734753,0.00013028322,0.00009336428,0.00010660198,0.00007429523,0.000066704444,0.0000765337],"category_scores_gemma":[0.0000053873396,0.0001284291,0.000038152593,0.00030519164,0.000043948796,0.00013777775,0.000018005592,0.0002142181,8.603085e-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.00004927699,0.00005347532,0.00004770432,0.000057805682,0.00006108135,0.0000024835276,0.00033874591,0.9834644,0.00022467539,0.00065734907,0.00078428123,0.01425869],"study_design_scores_gemma":[0.0015948288,0.00008141086,0.0000105209265,0.00008789885,0.000040486502,0.000016175105,0.0003629315,0.98937577,0.00030945725,0.000121026686,0.007839382,0.00016011781],"about_ca_topic_score_codex":0.0000020480984,"about_ca_topic_score_gemma":7.526742e-7,"teacher_disagreement_score":0.42497945,"about_ca_system_score_codex":0.00004028722,"about_ca_system_score_gemma":0.000040532108,"threshold_uncertainty_score":0.5237187},"labels":[],"label_agreement":null},{"id":"W4408874684","doi":"10.1137/24m1647692","title":"Dyadic Packing of Dijoins","year":2025,"lang":"es","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Packing Problems","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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Packing problems; Discrete mathematics","score_opus":0.011752683129922774,"score_gpt":0.2671095122186709,"score_spread":0.2553568290887481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408874684","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041015774,0.004284775,0.4615051,0.0023583237,0.0038404309,0.00074832473,0.000103228456,0.0002919922,0.48585206],"genre_scores_gemma":[0.9768397,0.0020252208,0.018744951,0.00012268976,0.00014318844,0.0000031571128,0.0000057404245,0.00007995442,0.002035399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980993,0.00006265402,0.00096894323,0.00014463831,0.00037880402,0.0003456419],"domain_scores_gemma":[0.99872154,0.00024350673,0.0004000423,0.0003712706,0.00013440604,0.00012922545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005081755,0.00031121573,0.000549528,0.00043450238,0.00015072832,0.00025921318,0.00032553522,0.00017302633,0.00030951377],"category_scores_gemma":[0.00022222719,0.00027070474,0.0002686026,0.00049563346,0.000072702496,0.00013260485,0.000057976416,0.0006236155,0.00006182138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043500302,0.0004701584,0.0015716765,0.007811352,0.001223193,0.000052836982,0.004249502,0.2916909,0.0018008588,0.6774255,0.0063511846,0.007309344],"study_design_scores_gemma":[0.0054391176,0.0010432185,0.002416407,0.05580914,0.0014603338,0.00032616442,0.0027578082,0.73166466,0.01641401,0.11309917,0.067195676,0.002374291],"about_ca_topic_score_codex":0.0000011264204,"about_ca_topic_score_gemma":5.684457e-7,"teacher_disagreement_score":0.9358239,"about_ca_system_score_codex":0.00010572765,"about_ca_system_score_gemma":0.000089273366,"threshold_uncertainty_score":0.9999745},"labels":[],"label_agreement":null},{"id":"W4408882635","doi":"10.1007/s00236-025-00486-y","title":"The thief orienteering problem on 2-terminal series–parallel graphs","year":2025,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Optimization and Packing Problems","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":"Mount Royal University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Terminal (telecommunication); Theory of computation; Computer science; Series (stratigraphy); GRASP; Mathematics; Combinatorics; Theoretical computer science; Mathematical optimization; Algorithm; Computer network; Programming language","score_opus":0.0049465465877099315,"score_gpt":0.20476321264141212,"score_spread":0.19981666605370219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408882635","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006875002,0.000083371815,0.012593312,0.0015692652,0.0011021273,0.00060801074,0.0000070455717,0.00088762946,0.97627425],"genre_scores_gemma":[0.98362726,0.00045455323,0.00919801,0.0007741087,0.000032171836,0.00012789272,0.000023280321,0.00003099612,0.005731726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992762,0.000008241188,0.00029434694,0.00005697987,0.00012572843,0.00023847989],"domain_scores_gemma":[0.99957067,0.0000672014,0.000032128097,0.00025697093,0.000032468375,0.000040537405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013880015,0.00012966493,0.00010064053,0.000085430416,0.00022517388,0.00017040629,0.00021956112,0.000055582415,0.000035844354],"category_scores_gemma":[0.000027140808,0.00009327379,0.0000425799,0.00026078182,0.000040717747,0.0003336033,0.000038613383,0.00018886897,0.00008249615],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010302314,0.000047299465,0.00030858244,0.0010015861,0.00026305186,0.0000050299013,0.005764617,0.3040604,0.00009486004,0.5601162,0.094568565,0.03366682],"study_design_scores_gemma":[0.00056592823,0.00008686281,0.00032274268,0.00028760414,0.000021356995,0.000016500451,0.0003914193,0.15080236,0.00041163064,0.0040173773,0.8427519,0.00032428122],"about_ca_topic_score_codex":0.0000013494932,"about_ca_topic_score_gemma":0.0000038445955,"teacher_disagreement_score":0.9767523,"about_ca_system_score_codex":0.000029939954,"about_ca_system_score_gemma":0.000020708356,"threshold_uncertainty_score":0.38035947},"labels":[],"label_agreement":null},{"id":"W4409146310","doi":"10.1007/s00224-025-10217-y","title":"High Multiplicity Strip Packing with Three Rectangle Types","year":2025,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Packing Problems","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":"Mount Royal University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Multiplicity (mathematics); Computer science; Combinatorics; Geometry; Mathematics","score_opus":0.008371699592135235,"score_gpt":0.20127421025370054,"score_spread":0.1929025106615653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409146310","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.30269244,0.00055752276,0.6764093,0.000012829064,0.0009341417,0.0002590391,0.0000049317873,0.0005757891,0.018553965],"genre_scores_gemma":[0.99748707,0.0000033305594,0.00218247,0.000008269969,0.00005459998,0.0000023548885,0.0000037296106,0.000020709575,0.00023746732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931055,0.00006835598,0.00024775573,0.000117008334,0.00010139589,0.00015491033],"domain_scores_gemma":[0.9993967,0.00022962994,0.000070081645,0.00020920493,0.00007047761,0.000023936018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045701745,0.00012149723,0.00024255016,0.000099779325,0.00006574211,0.000034099496,0.0001366357,0.000058526428,0.000006493547],"category_scores_gemma":[0.000023400486,0.0001048325,0.000028195418,0.0002700176,0.000037106965,0.000035461693,0.000023684988,0.00010401471,0.0000054787106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017681883,0.000011734603,0.0017870793,0.00034187984,0.000096341384,9.028879e-7,0.00035075142,0.9370929,0.00036687354,0.05705074,0.00014882768,0.0027342965],"study_design_scores_gemma":[0.0010643088,0.00007807958,0.003785466,0.0023031288,0.00006068004,0.000009468366,0.000296629,0.9847026,0.003253145,0.00325169,0.00081224,0.0003825844],"about_ca_topic_score_codex":0.00003927452,"about_ca_topic_score_gemma":0.00000921307,"teacher_disagreement_score":0.6947946,"about_ca_system_score_codex":0.000034092605,"about_ca_system_score_gemma":0.00001563604,"threshold_uncertainty_score":0.42749453},"labels":[],"label_agreement":null},{"id":"W4409606383","doi":"10.3390/min15040427","title":"Optimization in Mineral Processing: A Novel Matheuristic for a Variant of the Knapsack Problem","year":2025,"lang":"en","type":"article","venue":"Minerals","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Knapsack problem; Mineral; Computer science; Mathematical optimization; Mathematics; Biology; Ecology","score_opus":0.012873425542117149,"score_gpt":0.23402922694427097,"score_spread":0.22115580140215382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409606383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055697,0.00028206923,0.97282004,0.0007468082,0.00029972097,0.0010860837,0.00003579707,0.00012675818,0.019033018],"genre_scores_gemma":[0.85961294,0.000014354634,0.13326466,0.00015588169,0.000033237593,0.00018017294,0.000025685586,0.000033484503,0.006679567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994012,0.000010475937,0.00028177488,0.00010610186,0.0000623504,0.00013805546],"domain_scores_gemma":[0.9997143,0.000033509164,0.00004633981,0.00012771117,0.00006409665,0.000014030929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012931874,0.00009750243,0.00014559466,0.00010168962,0.000027070115,0.000026981654,0.00012247691,0.00005803844,0.000016603173],"category_scores_gemma":[0.00005161465,0.00007519632,0.000040582898,0.0004333209,0.000019031248,0.000056065433,0.000017404342,0.0000566698,4.638771e-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.0000066749935,0.00004382314,0.00009454999,0.0003909736,0.000009275342,1.3735774e-7,0.00024936642,0.98610234,0.008482883,0.0023583653,0.0020030364,0.0002585472],"study_design_scores_gemma":[0.00070138153,0.000009950217,0.000078116784,0.00025709206,0.000014742054,0.0000015541249,0.000010846164,0.9946569,0.0008259769,0.00040112186,0.002953408,0.00008888928],"about_ca_topic_score_codex":0.00001064452,"about_ca_topic_score_gemma":0.000019533985,"teacher_disagreement_score":0.85404325,"about_ca_system_score_codex":0.000026947337,"about_ca_system_score_gemma":0.000038710783,"threshold_uncertainty_score":0.3066417},"labels":[],"label_agreement":null},{"id":"W4409889535","doi":"10.1007/s10878-025-01294-3","title":"A 3-space dynamic programming heuristic for the cubic knapsack problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Packing Problems","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":"Université Laval; Group for Research in Decision Analysis; Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Theory of computation; Heuristic; Continuous knapsack problem; Dynamic programming; Change-making problem; Mathematical optimization; Mathematics; Space (punctuation); Cubic graph; Combinatorics; Cutting stock problem; Computer science; Discrete mathematics; Algorithm; Optimization problem; Graph","score_opus":0.005512764533784442,"score_gpt":0.23783736993849006,"score_spread":0.23232460540470562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409889535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013947609,0.00085712265,0.9915471,0.00070766127,0.005247565,0.0005625236,0.0000021214375,0.000085875225,0.00085057097],"genre_scores_gemma":[0.63541454,0.0011546056,0.36181077,0.00010265031,0.00049434503,0.000089086614,0.000024906441,0.000099751625,0.00080932985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904096,0.00003641528,0.0004809869,0.000082453385,0.00017892726,0.00018026016],"domain_scores_gemma":[0.99894863,0.00024861464,0.0002049719,0.00013215747,0.00042042154,0.000045180892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044116558,0.00013786467,0.00021594384,0.00017351651,0.00014376502,0.00015448786,0.00021408942,0.00009587664,0.000014286506],"category_scores_gemma":[0.00016585765,0.00010710763,0.00011570853,0.00047585226,0.000028566372,0.00019180558,0.00001613778,0.00020114522,0.0000011731066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046176236,0.000038786406,0.000021743186,0.0001110626,0.00009734828,6.27947e-7,0.00015236663,0.9865311,0.000029457928,0.00792816,0.0020340977,0.0030090879],"study_design_scores_gemma":[0.0016705756,0.00012132226,0.0000136713015,0.00016185688,0.00013107492,0.000007732474,0.000056974583,0.9702745,0.00012928943,0.0033422299,0.02396582,0.00012493886],"about_ca_topic_score_codex":0.000001061482,"about_ca_topic_score_gemma":5.0877844e-7,"teacher_disagreement_score":0.63527507,"about_ca_system_score_codex":0.00012031887,"about_ca_system_score_gemma":0.000089649424,"threshold_uncertainty_score":0.43677223},"labels":[],"label_agreement":null},{"id":"W4409893300","doi":"10.71352/ac.44.153","title":"On the n-th element of a set of positive integers","year":2015,"lang":"en","type":"article","venue":"Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio computatorica","topic":"Optimization and Packing Problems","field":"Engineering","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":"NanoQuébec (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Element (criminal law); Set (abstract data type); Mathematics; Combinatorics; Computer science; Political science; Programming language; Law","score_opus":0.019899625742737972,"score_gpt":0.21177977224982772,"score_spread":0.19188014650708973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409893300","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.76413614,0.0004310306,0.20836017,0.0014504417,0.0013574661,0.00067601004,0.000277771,0.0002946576,0.023016343],"genre_scores_gemma":[0.99587995,0.000023894565,0.0038701948,0.00006178069,0.000026876984,0.0000015935793,0.000031046653,0.000020632975,0.00008403705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987731,0.00012440197,0.00027756396,0.00021129184,0.00033858497,0.00027504368],"domain_scores_gemma":[0.9986255,0.00042102308,0.00015709587,0.00023420506,0.00041171382,0.00015047358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045693325,0.00019274348,0.00026728582,0.0003385233,0.00010707786,0.000033701588,0.000283021,0.000058659738,0.000040819523],"category_scores_gemma":[0.000119012235,0.00016250013,0.00010041416,0.0009257964,0.00014368015,0.00013254557,0.00007343796,0.00016715241,0.00001501999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014652405,0.00008182191,0.0018107913,0.00007672184,0.00022248067,0.000022077451,0.006365564,0.9401565,0.0005426456,0.0052713417,0.043773897,0.001529626],"study_design_scores_gemma":[0.0033132357,0.0012187448,0.003968859,0.00039128895,0.0002522843,0.0000921666,0.0046026013,0.9593852,0.012533761,0.002156413,0.01130873,0.00077667827],"about_ca_topic_score_codex":0.00006390166,"about_ca_topic_score_gemma":0.00002005875,"teacher_disagreement_score":0.23174383,"about_ca_system_score_codex":0.00016298422,"about_ca_system_score_gemma":0.00009921665,"threshold_uncertainty_score":0.6626563},"labels":[],"label_agreement":null},{"id":"W4410574230","doi":"10.1007/s10878-025-01302-6","title":"The independent quadratic assignment problem: complexity and polynomially solvable special cases","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Packing Problems","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":"Simon Fraser University","funders":"Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Theory of computation; Mathematics; Quadratic equation; Quadratic assignment problem; Combinatorics; Computational complexity theory; Discrete mathematics; Mathematical optimization; Computer science; Optimization problem; Algorithm","score_opus":0.011701139617068293,"score_gpt":0.23002364731210137,"score_spread":0.21832250769503309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410574230","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.008857261,0.002176957,0.9047599,0.0029552358,0.034133613,0.0013077455,0.000010768144,0.00020232706,0.045596223],"genre_scores_gemma":[0.9619526,0.0015089145,0.034183037,0.000100206664,0.0016759189,0.000011685791,0.000009604757,0.000043147284,0.0005148746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889576,0.000077936995,0.0005371276,0.000077853365,0.0002547237,0.0001565691],"domain_scores_gemma":[0.99926203,0.00016361568,0.00019752888,0.00010330975,0.00020819072,0.00006529694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048334696,0.00012799156,0.00021080782,0.00011779709,0.00023912873,0.00026113185,0.00014590967,0.000083308325,0.000041819527],"category_scores_gemma":[0.00009451081,0.00009978904,0.000051702376,0.0002102774,0.000060920902,0.00022758223,0.00003214568,0.00020782625,0.0000012195057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007802567,0.000046769324,0.00018323601,0.00003494868,0.00007801043,0.0000044783546,0.0001485596,0.9662116,0.00004219294,0.02628486,0.006016388,0.0008709175],"study_design_scores_gemma":[0.008937747,0.00080233644,0.00074896996,0.00049649057,0.00030826277,0.00014808743,0.00044748606,0.8867061,0.0015060077,0.050126433,0.04906883,0.0007032401],"about_ca_topic_score_codex":0.000005561874,"about_ca_topic_score_gemma":0.0000053271506,"teacher_disagreement_score":0.9530954,"about_ca_system_score_codex":0.00014161239,"about_ca_system_score_gemma":0.0001148906,"threshold_uncertainty_score":0.40692788},"labels":[],"label_agreement":null},{"id":"W4411163025","doi":"10.1016/j.cor.2025.107159","title":"Random-Key Optimizer with reinforcement learning for the Capacitated Multi-period Cutting Stock Problem with setup cost","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"Mitacs; Conselho Nacional de Desenvolvimento Científico e Tecnológico; HEC Montréal; Fundação de Amparo à Pesquisa do Estado de São Paulo; Healthcare Excellence Canada","keywords":"Reinforcement learning; Computer science; Key (lock); Mathematical optimization; Stock (firearms); Period (music); Reinforcement; Artificial intelligence; Operations research; Mathematics; Mechanical engineering; Engineering; Structural engineering","score_opus":0.04743423773720279,"score_gpt":0.3228343211424024,"score_spread":0.2754000834051996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411163025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008568044,0.0001304017,0.993119,0.00094767776,0.00010518622,0.0028463823,0.0000035420742,0.00022098358,0.001769994],"genre_scores_gemma":[0.6474387,0.00010572918,0.34255084,0.00012527606,0.00006296658,0.002078041,0.00017459819,0.00007964702,0.007384174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986021,0.00013080137,0.0002672579,0.000253944,0.00029598852,0.0004499172],"domain_scores_gemma":[0.99865925,0.0003680472,0.00001649857,0.000284158,0.0005987042,0.00007334944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007760312,0.00018060282,0.00018813841,0.00025732297,0.0012709053,0.0005953112,0.00027409103,0.0000592332,0.000034674464],"category_scores_gemma":[0.000059939823,0.00011974762,0.000036761638,0.0008198611,0.0001372083,0.00019543114,0.00006303366,0.0005222335,0.000009777376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009948502,0.000019974812,0.00008488811,0.00008048517,0.00016152993,0.0000014970067,0.0023535877,0.99223375,0.000111391324,0.0005009873,0.0018549049,0.0024975024],"study_design_scores_gemma":[0.0035925913,0.00014147093,0.000022782455,0.0002311604,0.000019040523,0.00000499988,0.00053234806,0.9847613,0.00029894005,0.0000015840228,0.010236159,0.00015764488],"about_ca_topic_score_codex":0.000056059762,"about_ca_topic_score_gemma":0.00011772848,"teacher_disagreement_score":0.6505682,"about_ca_system_score_codex":0.00013493818,"about_ca_system_score_gemma":0.0001644096,"threshold_uncertainty_score":0.9774904},"labels":[],"label_agreement":null},{"id":"W4412170827","doi":"10.1109/access.2025.3588095","title":"Efficient Region-Wise Packing of Stereoscopic ERP Videos Based on Information Loss Minimization","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Optimization and Packing Problems","field":"Engineering","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":"Business Development Bank of Canada; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Minification; Stereoscopy; Computer vision; Artificial intelligence; World Wide Web","score_opus":0.01420896969617369,"score_gpt":0.2571637231463216,"score_spread":0.2429547534501479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412170827","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.10686374,0.000029031453,0.87876505,0.00018538452,0.0013160519,0.00037903502,0.000010407852,0.00027195795,0.012179328],"genre_scores_gemma":[0.99897975,0.000012248141,0.0005690362,0.00031739176,0.00001896336,0.000017168377,0.0000273449,0.000010800299,0.000047303998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932116,0.00002172657,0.00030308802,0.00008586684,0.0001440514,0.00012412563],"domain_scores_gemma":[0.9995034,0.000069405716,0.000079340316,0.00022097345,0.00009910746,0.000027792974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007320668,0.00010907975,0.0001277923,0.0003177892,0.000044901055,0.000092528884,0.00017492105,0.000072639166,0.000026370677],"category_scores_gemma":[0.000036764013,0.000110558634,0.00003465328,0.0004963216,0.000018760842,0.0002254945,0.00001394945,0.00007668721,0.0000110419305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013838456,0.000018610426,0.0026271672,0.00027301186,0.000009518351,4.6195177e-7,0.00015774103,0.99228275,0.00002508222,0.00018315688,0.0011674633,0.0032411907],"study_design_scores_gemma":[0.00056556164,0.000015644682,0.0020416726,0.00037559195,0.000012683095,2.675252e-7,0.000012846724,0.9888066,0.006705452,0.000037282767,0.0013156957,0.00011069918],"about_ca_topic_score_codex":0.000009111615,"about_ca_topic_score_gemma":0.000003084326,"teacher_disagreement_score":0.892116,"about_ca_system_score_codex":0.00005155386,"about_ca_system_score_gemma":0.00003078928,"threshold_uncertainty_score":0.45084503},"labels":[],"label_agreement":null},{"id":"W4412453266","doi":"10.1016/j.cor.2025.107197","title":"Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université Laval; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Knapsack problem; Mathematics; Binary number; Continuous knapsack problem; Quadratic equation; Mathematical optimization; Upper and lower bounds; Combinatorics; Binary decision diagram; Cutting stock problem; Change-making problem; Combinatorial optimization; Computer science; Optimization problem; Algorithm; Arithmetic","score_opus":0.03809884161290548,"score_gpt":0.35120122906223544,"score_spread":0.31310238744932994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412453266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006646861,0.0018365842,0.98333484,0.003172411,0.0007026128,0.0012394453,0.0000080730915,0.00013484202,0.0029243163],"genre_scores_gemma":[0.8236482,0.0017935631,0.16805136,0.0004973244,0.0001937872,0.0006907273,0.00007921049,0.00006223371,0.0049835606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989895,0.00007066184,0.00022045466,0.00022198619,0.00020637378,0.00029097247],"domain_scores_gemma":[0.99863684,0.00074856303,0.0000052981327,0.0003277992,0.00023453831,0.00004696377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005079041,0.00011924842,0.000121749996,0.00015907931,0.00081787346,0.000633391,0.00026045644,0.000076308424,0.000046495683],"category_scores_gemma":[0.000060852217,0.00008693644,0.000043178905,0.00062912377,0.00013311589,0.00023173857,0.00015280196,0.00025101186,0.000027022976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015448459,0.00005344058,0.000092136346,0.00009452878,0.00006457161,0.0000011612036,0.0010903123,0.87251556,0.00018883677,0.020051692,0.07597438,0.029857937],"study_design_scores_gemma":[0.00037576116,0.00007248216,0.00020342594,0.00012050011,0.000008123943,0.0000017979968,0.00007062647,0.9215059,0.00010688677,0.0016992355,0.07573053,0.00010469498],"about_ca_topic_score_codex":0.0000217532,"about_ca_topic_score_gemma":0.000079486825,"teacher_disagreement_score":0.81700134,"about_ca_system_score_codex":0.0000616611,"about_ca_system_score_gemma":0.000077034674,"threshold_uncertainty_score":0.6290504},"labels":[],"label_agreement":null},{"id":"W4412582233","doi":"10.55016/ojs/cdm.v12i2.62785","title":"Internal and external duality in abstract polytopes","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Duality (order theory)","score_opus":0.016404281631802912,"score_gpt":0.302181869160699,"score_spread":0.2857775875288961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582233","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.45393986,0.0003337518,0.50934017,0.0015151364,0.00047294263,0.0005837347,0.00040444263,0.00027413917,0.03313586],"genre_scores_gemma":[0.99389786,0.000034880934,0.0057589407,0.000023589864,0.000037683672,0.000013794117,0.0000047869444,0.000012308462,0.00021613484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994372,0.000006249739,0.00022583186,0.0000914652,0.00006890134,0.00017032387],"domain_scores_gemma":[0.99950004,0.00004039579,0.00004696428,0.00028280978,0.000038630897,0.000091137714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021287562,0.00009880258,0.0001493666,0.000057261866,0.00013268972,0.00024703942,0.00016806003,0.000047415495,0.000063875006],"category_scores_gemma":[0.0002593212,0.0000932203,0.00002649358,0.00003258775,0.00004070172,0.00014757457,0.000064933745,0.000110928086,0.000038296523],"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.00011008928,0.0008054387,0.08955087,0.0026971868,0.0005411034,0.00016625373,0.023196377,0.13733287,0.030145029,0.6500524,0.009828266,0.0555741],"study_design_scores_gemma":[0.0037735526,0.000101326594,0.42403343,0.0024701841,0.000088733475,0.000100139354,0.000488851,0.48994645,0.008819373,0.057130028,0.011419744,0.0016281662],"about_ca_topic_score_codex":0.000029950577,"about_ca_topic_score_gemma":0.000057152676,"teacher_disagreement_score":0.5929224,"about_ca_system_score_codex":0.000041326402,"about_ca_system_score_gemma":0.000008004905,"threshold_uncertainty_score":0.38014135},"labels":[],"label_agreement":null},{"id":"W4412582271","doi":"10.55016/ojs/cdm.v12i2.62342","title":"The Outercoarseness of the n-cube","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cube (algebra); Combinatorics; Mathematics","score_opus":0.01214290612318316,"score_gpt":0.2730259981374543,"score_spread":0.2608830920142712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582271","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.041573703,0.00043235152,0.87073225,0.014026551,0.00342967,0.0020127783,0.0008813206,0.0004461465,0.06646526],"genre_scores_gemma":[0.99763644,0.000029769124,0.0013426235,0.000023440722,0.000037230908,0.000028161125,0.0000028466054,0.000015454534,0.00088404317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994433,0.0000136489,0.0002113697,0.000056340014,0.00011821105,0.00015716467],"domain_scores_gemma":[0.9987985,0.00009188071,0.00008067422,0.0008647619,0.00012185176,0.00004236916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021755962,0.00008382467,0.00011609011,0.000014604312,0.00070184766,0.00016678199,0.00055577734,0.000039400024,0.000011645737],"category_scores_gemma":[0.0005183427,0.00004694036,0.000071521,0.0000657061,0.000102483944,0.000058889884,0.00010995287,0.0000778335,0.00003129313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008166145,0.000075597694,0.000943253,0.00032152707,0.00026571748,0.0000013210134,0.003850596,0.1574184,0.0032583703,0.8104262,0.018053124,0.005377762],"study_design_scores_gemma":[0.0014833043,0.000053503412,0.00723773,0.00084269873,0.00023589628,0.000019404351,0.0007407088,0.7257467,0.03910525,0.055090033,0.16856043,0.000884339],"about_ca_topic_score_codex":0.0000030466947,"about_ca_topic_score_gemma":0.00002155608,"teacher_disagreement_score":0.95606273,"about_ca_system_score_codex":0.000027872724,"about_ca_system_score_gemma":0.000016179574,"threshold_uncertainty_score":0.53981155},"labels":[],"label_agreement":null},{"id":"W4412989479","doi":"10.1016/j.cie.2025.111439","title":"Irregular multi-plate packing based on the dotted board model","year":2025,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Optimization and Packing Problems","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 Manitoba","funders":"Hebei Provincial Department of Bureau of Science and Technology; National Natural Science Foundation of China","keywords":"Composite material; Engineering drawing; Materials science; Engineering; Structural engineering; Computer science","score_opus":0.03337169928182329,"score_gpt":0.2136529321594447,"score_spread":0.1802812328776214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412989479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052193906,0.00005000809,0.9899052,0.00047348056,0.0023078579,0.00032450093,0.0000068118366,0.00095835555,0.00075443706],"genre_scores_gemma":[0.9808278,0.000008364293,0.018207356,0.00045147398,0.00021811831,0.000034203833,0.000020412604,0.000072957955,0.00015932726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899834,0.000023554,0.0002797464,0.0002130708,0.00015363921,0.00033162755],"domain_scores_gemma":[0.99932605,0.00019019608,0.000028647362,0.00035294087,0.000031206106,0.00007095167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021144966,0.00026528147,0.00021861623,0.00024386264,0.000100390695,0.00013623277,0.0002981636,0.00019562493,0.00001465211],"category_scores_gemma":[0.0000597058,0.00023624851,0.000097160155,0.0005061964,0.000018698118,0.000076159864,0.000043900847,0.00052465015,0.000011364225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064024134,0.0000111837235,0.000030921157,0.000024381703,0.000046988665,0.0000025578465,0.000054562657,0.99251586,0.00042913464,0.0010214249,0.0032452622,0.0026113256],"study_design_scores_gemma":[0.00095926155,0.000010462884,0.000036041707,0.00031786185,0.000017121733,4.3439826e-7,0.0000047078784,0.99261355,0.001158507,0.0000122722095,0.0046390174,0.00023075793],"about_ca_topic_score_codex":0.000003928425,"about_ca_topic_score_gemma":5.6156233e-7,"teacher_disagreement_score":0.9756084,"about_ca_system_score_codex":0.00011449613,"about_ca_system_score_gemma":0.00003771925,"threshold_uncertainty_score":0.96339345},"labels":[],"label_agreement":null},{"id":"W4413186458","doi":"10.55016/ojs/cdm.v7i1.62112","title":"Packing of points into the unit 6-dimensional cube","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unit cube; Combinatorics; Mathematics; Cube (algebra); Unit (ring theory)","score_opus":0.015321443876219634,"score_gpt":0.2733699689505132,"score_spread":0.25804852507429354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186458","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.15092291,0.0012401576,0.829314,0.0028499765,0.0010310347,0.0011244992,0.00040085867,0.0005684176,0.012548127],"genre_scores_gemma":[0.98219156,0.000011404308,0.017419826,0.00008498004,0.00006805261,0.00002351873,0.00003835549,0.000024227942,0.00013808582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992123,0.000026106514,0.0002871454,0.000059402384,0.00016473641,0.000250313],"domain_scores_gemma":[0.9992394,0.00017500341,0.000048713424,0.0002812867,0.0001455286,0.00011008507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840145,0.00011711535,0.00016294644,0.000066615874,0.00012606685,0.000025136784,0.0001454559,0.000053769152,0.00014248095],"category_scores_gemma":[0.0002639196,0.00008521484,0.00005973215,0.0003020065,0.000045313544,0.00010052449,0.000056881712,0.00010657576,0.0001372124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011594879,0.00026186477,0.0013474103,0.0004893382,0.00037213092,0.0000011107084,0.029293252,0.24329928,0.010253645,0.6996862,0.013280648,0.0017035087],"study_design_scores_gemma":[0.0020263754,0.0001341126,0.0024226718,0.0011765724,0.0004652556,0.00005759368,0.0029338156,0.7712105,0.067262806,0.048493892,0.10215315,0.001663241],"about_ca_topic_score_codex":0.000003486616,"about_ca_topic_score_gemma":0.000003228022,"teacher_disagreement_score":0.8312686,"about_ca_system_score_codex":0.000040839222,"about_ca_system_score_gemma":0.000014436856,"threshold_uncertainty_score":0.34749603},"labels":[],"label_agreement":null},{"id":"W4413370306","doi":"10.1007/s00453-025-01324-w","title":"Reconfiguration of Multisets with Applications to Bin Packing","year":2025,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","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":"University of Manitoba; York University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bin packing problem; Control reconfiguration; Computer science; Bin; Theory of computation; Combinatorics; Parallel computing; Theoretical computer science; Mathematics; Algorithm","score_opus":0.0065835363296105,"score_gpt":0.23120015557865323,"score_spread":0.22461661924904272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413370306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017812041,0.00005327957,0.9775762,0.00022873061,0.0000909459,0.00034960426,0.000013491163,0.00018504015,0.01972151],"genre_scores_gemma":[0.89958215,0.000020474452,0.09949507,0.00010762266,0.000029212299,0.00013245162,0.000035493333,0.000019235282,0.000578302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963737,0.00000615666,0.000131201,0.000089912384,0.000051478644,0.00008386102],"domain_scores_gemma":[0.9997311,0.000024764535,0.000017238495,0.00014254294,0.000055955228,0.000028376939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039227176,0.000063177795,0.000082335064,0.00011218013,0.000029586789,0.000014795545,0.00006497953,0.000033120847,0.000029722924],"category_scores_gemma":[0.0000056019067,0.00006105935,0.000013664975,0.0003738654,0.00001066372,0.000042463707,0.0000068690942,0.000046097077,0.00002095832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001331101,0.00005657906,0.00057911343,0.00021000803,0.00012204875,8.6050693e-7,0.0007217018,0.4918168,0.011714882,0.009239093,0.00402957,0.48149604],"study_design_scores_gemma":[0.001463238,0.0001264206,0.0046504014,0.0005040069,0.00008160157,0.0000064105657,0.00021876898,0.59495074,0.18747869,0.0011303675,0.20870109,0.0006882747],"about_ca_topic_score_codex":0.000008153775,"about_ca_topic_score_gemma":0.000011554693,"teacher_disagreement_score":0.8978009,"about_ca_system_score_codex":0.000019275532,"about_ca_system_score_gemma":0.000013492567,"threshold_uncertainty_score":0.24899282},"labels":[],"label_agreement":null},{"id":"W4413575831","doi":"10.1080/03155986.2025.2540205","title":"Literature review on Benders cut selection and a multiple cut generation scheme","year":2025,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheme (mathematics); Selection (genetic algorithm); Mathematics; Computer science; Algorithm; Artificial intelligence; Mathematical analysis","score_opus":0.04764337725217211,"score_gpt":0.3239025582634752,"score_spread":0.2762591810113031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413575831","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1618485,0.15416159,0.18314724,0.015568784,0.007143844,0.02551498,0.00090881553,0.0026134364,0.4490928],"genre_scores_gemma":[0.96703815,0.02743722,0.00091303396,0.0013213322,0.00018426497,0.00028166265,0.00093036285,0.000015607733,0.0018783851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890804,0.00005482433,0.0003934603,0.0000987296,0.0003801205,0.00016481218],"domain_scores_gemma":[0.99914193,0.000088529116,0.000030537427,0.00009627061,0.0005780973,0.000064618056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079126074,0.00011533585,0.00013009536,0.00041803016,0.00033240026,0.00070736936,0.000055298533,0.00011283571,0.000016212174],"category_scores_gemma":[0.00021153614,0.000101443984,0.000018652556,0.00056407094,0.000025289548,0.0012797426,0.00002314568,0.0002671375,0.00003166564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007065714,0.000035908808,0.0027483148,0.013164306,0.00018445397,0.0000011940322,0.0031620816,0.4953728,0.00088986655,0.25589395,0.20604962,0.022426846],"study_design_scores_gemma":[0.00036627424,0.00003376949,0.00018338136,0.001470024,0.000002870485,0.000011033509,0.00009590223,0.7955501,0.00018081693,0.000012438596,0.20198672,0.00010664522],"about_ca_topic_score_codex":0.00001949007,"about_ca_topic_score_gemma":0.00002076351,"teacher_disagreement_score":0.8051896,"about_ca_system_score_codex":0.000079922,"about_ca_system_score_gemma":0.00007245912,"threshold_uncertainty_score":0.6821179},"labels":[],"label_agreement":null},{"id":"W4413739571","doi":"10.1039/9781837673940-00237","title":"Packing Problems in Foams","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Packing problems; Materials science; Business; Computer science; Algorithm","score_opus":0.012757407423180182,"score_gpt":0.19458378309939955,"score_spread":0.18182637567621937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413739571","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.374806e-7,0.0006468489,0.009361924,0.000040675433,0.00041638562,0.00023373812,0.0000070813253,0.00047906223,0.98881376],"genre_scores_gemma":[0.0017877654,0.0008229946,0.0014322749,0.00010618472,0.00005254896,0.000012756417,0.00006009036,0.00007361901,0.9956518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992529,0.0000029559064,0.0002870732,0.00017993315,0.00010330481,0.00017381553],"domain_scores_gemma":[0.9996787,0.00002740395,0.000026342052,0.00020818069,0.0000246865,0.000034732417],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000074169104,0.00023701762,0.00024856548,0.0002775155,0.000015925558,0.000041623036,0.000116587806,0.00029645755,0.0012901151],"category_scores_gemma":[0.0000043978516,0.00024504206,0.00006369066,0.000051011382,0.00001307692,0.00004710085,0.000030597355,0.00033470063,0.00014587765],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015013402,0.000009217423,0.0001202115,0.001071294,0.000109337816,0.0000122146275,0.0002705401,0.525904,0.000014074849,0.40145347,0.03944461,0.03158953],"study_design_scores_gemma":[0.00029454025,0.000011210902,0.000009213647,0.0013492407,0.000017555229,0.0000022839001,0.000003789056,0.045588274,0.0000261263,0.01359561,0.938534,0.0005681658],"about_ca_topic_score_codex":0.000008270897,"about_ca_topic_score_gemma":0.00013564537,"teacher_disagreement_score":0.8990894,"about_ca_system_score_codex":0.00007591074,"about_ca_system_score_gemma":0.00002214267,"threshold_uncertainty_score":0.9996228},"labels":[],"label_agreement":null},{"id":"W4414107824","doi":"10.1016/j.cor.2025.107279","title":"Q-learning-based hyper-heuristic algorithm for open dimension irregular packing problems","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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 Manitoba","funders":"Hebei Provincial Department of Bureau of Science and Technology; National Natural Science Foundation of China","keywords":"Heuristic; Dimension (graph theory); Packing problems; Selection (genetic algorithm); Adaptability; Population; Computational complexity theory; Encoding (memory)","score_opus":0.047784255853116964,"score_gpt":0.34817794217181824,"score_spread":0.3003936863187013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414107824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008140867,0.0002857033,0.9943475,0.00070328335,0.0005009329,0.0016045365,0.000011128626,0.000273619,0.0014591945],"genre_scores_gemma":[0.5745643,0.00012008439,0.4161685,0.0003431807,0.00018824078,0.0011442,0.0006371772,0.00013196125,0.0067023304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985172,0.00018508524,0.0002859612,0.0003360841,0.00025459682,0.00042106147],"domain_scores_gemma":[0.99872965,0.00031578267,0.0000105679255,0.0003385493,0.0005120755,0.00009337717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009068138,0.0001577381,0.00020205411,0.00043550986,0.000829926,0.0008538121,0.00052727765,0.00009827513,0.000044215576],"category_scores_gemma":[0.00011023514,0.00016247985,0.000053418393,0.00086457,0.00007384575,0.00020106709,0.00020752817,0.00038795266,0.000037367958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035541727,0.00004320801,0.000042776668,0.000086877495,0.000027835948,0.0000010190565,0.00017752567,0.9428287,0.00036069908,0.00084682147,0.0074118935,0.048169084],"study_design_scores_gemma":[0.00075703254,0.00010089861,0.00005119875,0.00022179,0.000007877827,0.0000010593095,0.000039499326,0.95848614,0.00082954834,0.00014095979,0.039201643,0.00016234146],"about_ca_topic_score_codex":0.00004413761,"about_ca_topic_score_gemma":0.000032828477,"teacher_disagreement_score":0.578179,"about_ca_system_score_codex":0.00014137938,"about_ca_system_score_gemma":0.0001718757,"threshold_uncertainty_score":0.82333297},"labels":[],"label_agreement":null},{"id":"W4415119840","doi":"10.18280/jesa.580818","title":"Enhanced Particle Swarm Optimization for Dual-Constraint Multi-Knapsack Problems: A Real-World Retail Packaging Application","year":2025,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Measure (data warehouse); Work (physics); Feature (linguistics); Particle (ecology)","score_opus":0.02244124522034855,"score_gpt":0.2658433094787861,"score_spread":0.24340206425843755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415119840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012627318,0.00035442674,0.98016715,0.00023055731,0.00044828808,0.00090049824,0.000015508394,0.000912866,0.0043433956],"genre_scores_gemma":[0.85905796,0.00056440354,0.1380167,0.00009664275,0.000111435984,0.00019308651,0.000033604214,0.000092993025,0.0018331573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805945,0.000107844135,0.00087965245,0.00027827112,0.00021325631,0.00046151658],"domain_scores_gemma":[0.99885327,0.0001236557,0.0002623878,0.00029297807,0.0003178191,0.0001499042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005892301,0.0002868922,0.00035556368,0.0002918341,0.0003754948,0.00037603456,0.00019247181,0.000097440476,0.00008553205],"category_scores_gemma":[0.00012299295,0.00028426235,0.00014030181,0.00077730924,0.00007872721,0.0004061409,0.000034461464,0.00025896108,0.000027730126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099131585,0.000051133535,0.00031532277,0.00052380696,0.00011555415,0.0000025008958,0.000649029,0.8963837,0.0041095526,0.0017223529,0.000504806,0.0956123],"study_design_scores_gemma":[0.0011577025,0.000038394275,0.0029133798,0.0005773467,0.00007434708,0.000031702857,0.0000990871,0.98784834,0.005109681,0.0007624102,0.0010946782,0.00029290203],"about_ca_topic_score_codex":0.0000120376335,"about_ca_topic_score_gemma":0.00006554011,"teacher_disagreement_score":0.84643066,"about_ca_system_score_codex":0.00032723724,"about_ca_system_score_gemma":0.0000867029,"threshold_uncertainty_score":0.99996096},"labels":[],"label_agreement":null},{"id":"W4415778628","doi":"10.59254/sbpo-2025-212612","title":"Um algoritmo simheuristic baseado em Simulated Annealing para a otimização da produção de um circuito de britagem","year":2025,"lang":"","type":"article","venue":"Anais do Simpósio Brasileiro de Pesquisa Operacional","topic":"Optimization and Packing Problems","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":"Toronto Arts Foundation","funders":"","keywords":"Simulated annealing; Work (physics); Noise (video); Computer simulation","score_opus":0.022633729879561578,"score_gpt":0.2945096944388346,"score_spread":0.27187596455927304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415778628","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.5676988,0.012071915,0.39859918,0.002989697,0.00419296,0.0030251276,0.0014204005,0.0023843476,0.00761759],"genre_scores_gemma":[0.9749169,0.0011814738,0.01614084,0.00293414,0.00087908434,0.0001244024,0.00061248516,0.00038703217,0.0028236567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909102,0.00081576017,0.002105722,0.0019840694,0.0010387442,0.0031455536],"domain_scores_gemma":[0.9949024,0.001167745,0.00036233355,0.0015436538,0.0007565769,0.0012673477],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002068866,0.001615499,0.0014839766,0.0010690051,0.001287156,0.001816629,0.0014790392,0.0012841697,0.0033209426],"category_scores_gemma":[0.00159823,0.0019907893,0.00069250923,0.0025902765,0.00031194862,0.0008247475,0.000466384,0.0021941043,0.0002863033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019192707,0.0005758412,0.036476236,0.0012289059,0.0007272213,0.0004178451,0.0037692017,0.9270101,0.0014090064,0.0011206095,0.006677363,0.020395733],"study_design_scores_gemma":[0.0029708436,0.00020205497,0.022100301,0.0016171857,0.00052077195,0.00016466087,0.0006687202,0.95544803,0.0007850592,0.0005768346,0.012994884,0.0019506715],"about_ca_topic_score_codex":0.00048776667,"about_ca_topic_score_gemma":0.00009079818,"teacher_disagreement_score":0.4072181,"about_ca_system_score_codex":0.0016487397,"about_ca_system_score_gemma":0.0019512961,"threshold_uncertainty_score":0.99965924},"labels":[],"label_agreement":null},{"id":"W4416809770","doi":"10.1016/j.eswa.2025.130549","title":"Hybrid non-dominated sorting cuckoo search for parallel machine scheduling in additive manufacturing with two-dimensional packing constraints","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Optimization and Packing Problems","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 Manitoba","funders":"Hebei Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Tardiness; Cuckoo search; Job shop scheduling; Sorting; Benchmark (surveying); Scheduling (production processes); Integer programming; Heuristics","score_opus":0.009752299265783958,"score_gpt":0.25820076220773125,"score_spread":0.24844846294194728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416809770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019862186,0.00037997216,0.9726478,0.000099981495,0.00012161273,0.002570349,0.000072385876,0.00029078423,0.00395492],"genre_scores_gemma":[0.9645471,0.000011219304,0.032144673,0.000050819162,0.000062409876,0.0027126411,0.00022482596,0.000054183798,0.00019210677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865794,0.000028867358,0.00040689416,0.00035574185,0.00017143562,0.0003791388],"domain_scores_gemma":[0.99925154,0.00019969756,0.000079481695,0.00026058877,0.00012484641,0.00008385979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023430746,0.0002421706,0.00029842023,0.00025794975,0.00023244033,0.00008971119,0.00014654435,0.000058005127,0.0000166643],"category_scores_gemma":[0.00000618235,0.00021117569,0.000034963996,0.00027944645,0.00007947507,0.00012201779,0.000025263365,0.00022645053,0.000009209773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041613872,0.00003541331,0.00040871982,0.0001607046,0.00009223638,0.0000038616977,0.00036715818,0.99386746,0.00087295723,0.0015625278,0.000110540524,0.0024768014],"study_design_scores_gemma":[0.0026000408,0.000030462405,0.00013879615,0.0009257778,0.000017080101,0.000034557957,0.00060662307,0.9796972,0.014282354,0.000057426503,0.0012250005,0.00038464222],"about_ca_topic_score_codex":0.00011377439,"about_ca_topic_score_gemma":0.000042116604,"teacher_disagreement_score":0.9446849,"about_ca_system_score_codex":0.00014136678,"about_ca_system_score_gemma":0.00008408096,"threshold_uncertainty_score":0.8611495},"labels":[],"label_agreement":null},{"id":"W4417057052","doi":"10.1016/j.ejor.2025.11.037","title":"A Tetris Beam Search algorithm for the distributor’s pallet loading problem","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","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":"Western University; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Politecnico di Milano","keywords":"Pallet; Beam search; Heuristic; Constructive; Set (abstract data type); Homogeneous; Search algorithm; Heuristics","score_opus":0.05447559080304888,"score_gpt":0.33480267635893635,"score_spread":0.2803270855558875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417057052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010924094,0.0017536737,0.9722786,0.0041277967,0.00047368175,0.00055495143,0.000055614666,0.00003834375,0.019624919],"genre_scores_gemma":[0.91213363,0.0013252819,0.07450824,0.00026197583,0.0012366306,0.000034710527,0.00006127054,0.00010066225,0.010337569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983671,0.0002806713,0.00039741403,0.000101694815,0.00057374605,0.00027939212],"domain_scores_gemma":[0.997891,0.00078111904,0.000028369794,0.00013274113,0.0010828244,0.00008390698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005141392,0.000090930334,0.00011827251,0.0002695647,0.00041980945,0.00035826195,0.0004355745,0.00002225288,0.00011225028],"category_scores_gemma":[0.00032654076,0.0000638286,0.00008109935,0.0005259962,0.00007554932,0.00014668902,0.00006605541,0.00057561457,0.00003159437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055386507,0.00008679934,0.00019733694,0.00011852137,0.000340322,0.000039385977,0.0007282037,0.6554008,0.0026699689,0.0060234834,0.17983016,0.1545096],"study_design_scores_gemma":[0.0017102681,0.00030672646,0.0012709099,0.0002997345,0.0000219936,0.00004595269,0.00040039996,0.45470968,0.0034637982,0.00022676226,0.5373499,0.00019390567],"about_ca_topic_score_codex":0.0000018008288,"about_ca_topic_score_gemma":7.198159e-7,"teacher_disagreement_score":0.91104126,"about_ca_system_score_codex":0.00011496435,"about_ca_system_score_gemma":0.0001960108,"threshold_uncertainty_score":0.34547284},"labels":[],"label_agreement":null},{"id":"W4417122901","doi":"10.1016/j.ic.2025.105397","title":"Approximation algorithms for non-sequential star packing problems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Packing Problems","field":"Engineering","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":"China Scholarship Council; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Star (game theory); Approximation theory; Generalization; Matching (statistics); Greedy algorithm","score_opus":0.014712424126904844,"score_gpt":0.24836205613343604,"score_spread":0.2336496320065312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417122901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052712928,0.00002908674,0.98795944,0.000103995284,0.0003268293,0.00049506215,0.000009806662,0.00024053642,0.005563932],"genre_scores_gemma":[0.9585481,0.000048951373,0.04042206,0.00023705188,0.000029239685,0.00010011585,0.0005456299,0.00000953354,0.00005928954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994811,0.00000678823,0.0002787293,0.000057179423,0.00007542859,0.00010079888],"domain_scores_gemma":[0.99974436,0.000025719179,0.000052854688,0.00004437085,0.000109080145,0.000023615841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000135712,0.00008498899,0.000080792204,0.00018109518,0.00010300832,0.0001728139,0.00003374981,0.000058523405,0.0000045091997],"category_scores_gemma":[0.000009965564,0.00009095003,0.000022433098,0.00017854321,0.000011793234,0.00074488966,0.0000092011305,0.00004928166,0.000008058262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067156843,0.000006611194,0.000051543087,0.00050784426,0.000024016475,2.33204e-8,0.0013411167,0.81067723,0.000096621014,0.005182772,0.0010864187,0.18101907],"study_design_scores_gemma":[0.0006153094,0.000016176098,0.00032882162,0.000053929034,0.000008680326,8.180062e-7,0.00011057425,0.986899,0.00034653788,0.0019785322,0.0095457705,0.00009582038],"about_ca_topic_score_codex":0.000003911531,"about_ca_topic_score_gemma":0.0000017387418,"teacher_disagreement_score":0.9532768,"about_ca_system_score_codex":0.000033724908,"about_ca_system_score_gemma":0.00001696262,"threshold_uncertainty_score":0.37088346},"labels":[],"label_agreement":null},{"id":"W4467802","doi":"","title":"Note: On Directed Odd or Even Minimum (s, t)-Cut Problem and Generalizations.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Maximum cut; Mathematical economics; Graph","score_opus":0.016029789989740358,"score_gpt":0.22022030128027206,"score_spread":0.2041905112905317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4467802","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.6427252,0.0038378802,0.0038574403,0.0036346281,0.014490245,0.0035070227,0.000115003444,0.011155699,0.31667686],"genre_scores_gemma":[0.99315834,0.0005044315,0.002447371,0.00015813099,0.000016629665,0.000031292173,0.00002632694,0.00006028126,0.0035971922],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929756,0.000029213657,0.00018390191,0.00016791269,0.00012583591,0.00019559261],"domain_scores_gemma":[0.99959743,0.00005637874,0.00002796749,0.00018585104,0.000045835153,0.000086550324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056164834,0.00015280119,0.0001423355,0.000087744316,0.000090692265,0.000060922805,0.00008868345,0.0000965541,0.0003259687],"category_scores_gemma":[0.000033655186,0.0001412982,0.00002209267,0.00031815405,0.000021709617,0.000095258685,0.000018660583,0.000110186025,0.00009004821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006300456,0.00063909945,0.0045417757,0.00054917805,0.0002599217,0.00005235975,0.005941541,0.19142213,0.0022656051,0.33436882,0.44080982,0.019086758],"study_design_scores_gemma":[0.0032071332,0.00029189844,0.0010385017,0.00020497902,0.000053177377,0.00002286334,0.000022697222,0.8681905,0.0021532776,0.021911912,0.10192125,0.000981802],"about_ca_topic_score_codex":0.0000048848415,"about_ca_topic_score_gemma":0.0000076066613,"teacher_disagreement_score":0.67676836,"about_ca_system_score_codex":0.000037223726,"about_ca_system_score_gemma":0.0000064487704,"threshold_uncertainty_score":0.57619727},"labels":[],"label_agreement":null},{"id":"W45240301","doi":"10.1007/978-3-642-40164-0_26","title":"Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Combinatorics; Boolean function; Mathematics; Function (biology); Value (mathematics); Discrete mathematics; Quadratic equation; Algorithm; Time complexity; Statistics","score_opus":0.021298087085973545,"score_gpt":0.24681642194658063,"score_spread":0.22551833486060707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45240301","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.00008859826,0.00014535738,0.99773425,0.000039895032,0.00044077664,0.00045352196,0.0000080521295,0.00008703139,0.00100251],"genre_scores_gemma":[0.262814,0.000063827116,0.73586655,0.00012710382,0.00020401776,0.000059581722,0.00014579459,0.000067205154,0.0006519384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988431,0.0000058544297,0.00034593086,0.00032102547,0.00026648544,0.00021764541],"domain_scores_gemma":[0.9992273,0.00012354816,0.00011528459,0.00030267914,0.00017945019,0.000051776507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027028774,0.0002043714,0.00036483514,0.0008252823,0.000051677387,0.00011936399,0.00031967,0.00015092886,0.000044810615],"category_scores_gemma":[0.000020675205,0.00018887152,0.00012273435,0.0006470492,0.00015608565,0.0001354523,0.00004091073,0.0001469517,0.000006531956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6707673e-7,0.000005351553,0.000019529154,0.000058484162,0.00005399732,2.6567477e-7,0.00029586733,0.6971363,0.00003159936,0.00057175674,0.000006357209,0.30181986],"study_design_scores_gemma":[0.00010577132,0.000052725907,0.00003730244,0.000120152705,0.000094013354,6.2587895e-7,1.2891503e-7,0.99439096,0.00043356186,0.00401621,0.00054311584,0.00020544237],"about_ca_topic_score_codex":0.000008362488,"about_ca_topic_score_gemma":0.000062256055,"teacher_disagreement_score":0.3016144,"about_ca_system_score_codex":0.00007316088,"about_ca_system_score_gemma":0.00003707218,"threshold_uncertainty_score":0.77019566},"labels":[],"label_agreement":null},{"id":"W6894053757","doi":"10.5281/zenodo.7352873","title":"Artifact of \"To Pack or Not to Pack: A Generalized Packing Analysis and Transformation\"","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artifact (error); Source code; Code (set theory); Scripting language; Container (type theory); Image processing","score_opus":0.047023647606078904,"score_gpt":0.2675918104721034,"score_spread":0.2205681628660245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894053757","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.6739408,0.000030516965,0.28196877,0.0026989223,0.00021208913,0.0016268002,0.0008043546,0.0047420254,0.03397575],"genre_scores_gemma":[0.9966313,0.00011238165,0.001396001,0.00014292823,0.000030428804,1.1673131e-7,0.0006367346,0.00055083924,0.0004992443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988957,0.00009261754,0.00029137635,0.00020336451,0.0002507406,0.00026617365],"domain_scores_gemma":[0.9992769,0.00002387211,0.000035921723,0.00024785206,0.00021625061,0.00019921266],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044597927,0.00011925413,0.00019701067,0.0007516716,0.00041616225,0.0003011103,0.0002633751,0.00004424691,0.0035071042],"category_scores_gemma":[0.00019804215,0.000116828225,0.00005074616,0.0028738414,0.000031447882,0.0001614348,0.00016070773,0.00009382308,0.0019440596],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035760488,0.00007386022,0.00006534691,0.00051612273,0.0007961854,0.00001334789,0.031258736,0.65927,0.044829704,0.002710068,0.08267604,0.17743301],"study_design_scores_gemma":[0.0012760954,0.00030647748,0.0070475177,0.00008715106,0.00016557141,0.00002093319,0.00089955097,0.14328523,0.012257119,0.000064670756,0.8340145,0.00057520776],"about_ca_topic_score_codex":0.000009700873,"about_ca_topic_score_gemma":0.0000028710786,"teacher_disagreement_score":0.7513384,"about_ca_system_score_codex":0.000044546337,"about_ca_system_score_gemma":0.0000019133988,"threshold_uncertainty_score":0.99883306},"labels":[],"label_agreement":null},{"id":"W6910453624","doi":"10.4230/lipics.cp.2025.7","title":"Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize Their Reusability","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Bin packing problem; Reusability; Scrap; Leverage (statistics); Process (computing); Benchmark (surveying); Linear programming; Bin","score_opus":0.014183435343222302,"score_gpt":0.23016746625178017,"score_spread":0.21598403090855786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910453624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04240231,0.00026246277,0.8809321,0.0005103628,0.0012059328,0.002504693,0.00041377466,0.0010774411,0.0706909],"genre_scores_gemma":[0.57324165,0.0001495427,0.42352107,0.0014479845,0.00010957936,0.0003506581,0.00041561574,0.00012852342,0.00063538103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975209,0.00004002992,0.0011109919,0.00033308673,0.00024038862,0.00075455435],"domain_scores_gemma":[0.99854517,0.00019478453,0.00014949187,0.0006826704,0.00018462559,0.00024325783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007467206,0.00050853717,0.0006006398,0.0004371527,0.00033437295,0.00048785258,0.00047893685,0.00027938146,0.00002226458],"category_scores_gemma":[0.00018700561,0.00047459544,0.00018562815,0.000620743,0.000099289035,0.0006367577,0.00028315987,0.0004451581,0.000020014559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073152623,0.0011574778,0.021618018,0.015274523,0.0019075172,0.0000045642323,0.113087974,0.692836,0.0009395946,0.01354169,0.043260943,0.09564019],"study_design_scores_gemma":[0.004327076,0.00008992778,0.0007288713,0.00073159335,0.00009770734,0.000026657633,0.0062201684,0.89462644,0.0016812407,0.00066122966,0.08966743,0.001141666],"about_ca_topic_score_codex":0.000007827964,"about_ca_topic_score_gemma":0.0000033717495,"teacher_disagreement_score":0.5308393,"about_ca_system_score_codex":0.0001290691,"about_ca_system_score_gemma":0.00004421292,"threshold_uncertainty_score":0.9997706},"labels":[],"label_agreement":null},{"id":"W6925268164","doi":"10.15468/dl.xzjpar","title":"Occurrence Download","year":2023,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Data set; Set (abstract data type)","score_opus":0.015268255659723801,"score_gpt":0.20452914654146592,"score_spread":0.1892608908817421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925268164","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021458833,0.000013062203,0.000038154067,0.00003494757,0.0013405924,0.0001928934,0.9973791,0.0007385589,0.00024121492],"genre_scores_gemma":[0.0000027289364,0.0002257401,0.000002396844,0.00011644922,0.0000013945058,0.0000033160666,0.99964774,2.9014892e-8,2.2990014e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990358,0.000019118146,0.0002970401,0.00011967429,0.00028943815,0.00023897087],"domain_scores_gemma":[0.99935675,0.000013329158,0.000079983525,0.00032319443,0.000113586415,0.000113179216],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013918498,0.00023078674,0.00019581369,0.00010368975,0.00012840895,0.00013770991,0.0003151581,0.00030892598,0.0005723142],"category_scores_gemma":[0.00005072307,0.0002586357,0.000091392685,0.00042488222,0.000056277942,0.0005414054,0.00011193566,0.0002377503,0.56664574],"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.000004325701,0.0000051012576,0.000090259644,0.00027057444,0.00002707741,9.4058913e-7,0.000026373795,0.009546823,1.0184405e-8,4.1400607e-8,0.98950404,0.0005244197],"study_design_scores_gemma":[0.0001710611,0.000008489771,0.000022603097,0.0000037539025,0.000022215409,0.0000014442977,0.00003164172,0.000019471596,9.122505e-7,4.5698195e-7,0.9994599,0.00025804294],"about_ca_topic_score_codex":0.00014129338,"about_ca_topic_score_gemma":0.000014489397,"teacher_disagreement_score":0.5660734,"about_ca_system_score_codex":0.00019874783,"about_ca_system_score_gemma":0.000038517686,"threshold_uncertainty_score":0.9999866},"labels":[],"label_agreement":null},{"id":"W6995491552","doi":"","title":"Online square packing with prediction","year":2023,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Robustness (evolution); Bin packing problem; Upper and lower bounds; Competitive analysis; Consistency (knowledge bases); Mean squared error; Unit square","score_opus":0.013304502861609611,"score_gpt":0.18914346742631752,"score_spread":0.1758389645647079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995491552","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.96097064,0.00021583495,0.009973027,0.00019560286,0.0020581665,0.00063369377,0.00045144797,0.0025252895,0.022976298],"genre_scores_gemma":[0.953057,0.002075585,0.007870008,0.000016081021,0.00031195866,0.000001754903,0.013898136,0.0003732136,0.022396257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99936694,0.000014934672,0.000077870696,0.00017276635,0.00021611304,0.0001513753],"domain_scores_gemma":[0.9995528,0.000020039502,0.00008749297,0.0001735162,0.00011704442,0.000049140817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046982645,0.00017074906,0.0002099185,0.00025013287,0.00009823261,0.00001646833,0.00014266465,0.00020865485,0.000018293622],"category_scores_gemma":[0.0000050225967,0.00021780035,0.000062372426,0.00033771922,0.000020015397,0.00011946878,0.000012594288,0.0002336977,0.0000472888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031283073,0.00023557142,0.05074547,0.0062784194,0.0011029209,0.00017177004,0.008932338,0.8748283,0.000622358,0.00037472564,0.04337745,0.013017894],"study_design_scores_gemma":[0.0022673933,0.00034420984,0.70518595,0.0037848977,0.0006541483,0.0000099814,0.12971716,0.13210294,0.00044593724,0.000078012265,0.024023693,0.001385649],"about_ca_topic_score_codex":0.00032198167,"about_ca_topic_score_gemma":0.295364,"teacher_disagreement_score":0.7427253,"about_ca_system_score_codex":0.00007608496,"about_ca_system_score_gemma":0.000027325234,"threshold_uncertainty_score":0.8881641},"labels":[],"label_agreement":null},{"id":"W7025482095","doi":"","title":"Willingness-to-pay for Mandibular two-implant overdentures: a societal perspective","year":2013,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Willingness to pay; Socioeconomic status; Payment; Valuation (finance); Contingent valuation; Dental insurance; Sample (material); Preference; Regression analysis","score_opus":0.011829807008112784,"score_gpt":0.2507130360407255,"score_spread":0.2388832290326127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025482095","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.75729275,0.0022027448,0.00034927984,0.00011014483,0.020558974,0.010657193,0.011518286,0.00475924,0.19255137],"genre_scores_gemma":[0.9549622,0.0006047983,0.008303458,0.00054812146,0.00037926665,0.0014280134,0.004476848,0.0009604395,0.028336879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966392,0.00008193715,0.0007533889,0.0009805894,0.00061966846,0.0009252244],"domain_scores_gemma":[0.9978968,0.00017555652,0.00024762578,0.0005941528,0.00065042323,0.00043543073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038842298,0.0009564443,0.0008245092,0.00034398108,0.0007896414,0.0002514823,0.00059650495,0.00081110216,0.00039382413],"category_scores_gemma":[0.00024300811,0.0009276841,0.0005217373,0.0004715726,0.000025481822,0.00051931175,0.000058552785,0.0012183363,0.00049655995],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009815437,0.000793621,0.000063815394,0.007093799,0.0052659772,0.00016891326,0.0016054402,0.32407188,0.1024345,0.48912895,0.0038081612,0.064583376],"study_design_scores_gemma":[0.0109635005,0.0012114027,0.00087273336,0.0038556093,0.0019461811,0.000214868,0.006135467,0.025729584,0.11234075,0.11534464,0.70969486,0.0116903875],"about_ca_topic_score_codex":0.0001906893,"about_ca_topic_score_gemma":0.00040586782,"teacher_disagreement_score":0.7058867,"about_ca_system_score_codex":0.00094016665,"about_ca_system_score_gemma":0.00004477766,"threshold_uncertainty_score":0.99931735},"labels":[],"label_agreement":null},{"id":"W7027714465","doi":"","title":"A data-driven optimization approach for mixed-case palletization and three-dimensional bin packing","year":2018,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Pallet; Bin packing problem; Integer (computer science); Integer programming; Bin; Packing problems; Optimization problem","score_opus":0.02116642861147946,"score_gpt":0.2093755618746573,"score_spread":0.18820913326317784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027714465","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.35815105,0.00045553746,0.6353584,0.00015175912,0.0011420838,0.0019611132,0.0013242142,0.00060649024,0.0008493726],"genre_scores_gemma":[0.02811584,0.00032463428,0.9044409,0.000016700378,0.00016677637,0.0000048496413,0.045645762,0.00017629836,0.021108272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.000025415593,0.00015956472,0.0004004487,0.0001664834,0.00019971379],"domain_scores_gemma":[0.99915177,0.000033718035,0.00016137816,0.00035105148,0.00022427212,0.00007781251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014971964,0.00024351833,0.0003046466,0.00025641161,0.00023340476,0.000045829747,0.00022925742,0.00032328744,0.000090440946],"category_scores_gemma":[0.000015955546,0.00029797398,0.000057115707,0.00017772673,0.000057023004,0.00031657447,0.000066543034,0.00013027436,0.0000034875645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008590688,0.00003987266,0.000067511035,0.0009955115,0.00017648702,0.000015400037,0.0091662295,0.98357266,0.000152511,0.00006399652,0.003726925,0.0019369931],"study_design_scores_gemma":[0.0006695687,0.00004950601,0.000032230426,0.00014010796,0.0001795302,0.000019683359,0.005331921,0.9928277,0.00007751121,0.000016098798,0.0003394596,0.00031668873],"about_ca_topic_score_codex":0.00070574455,"about_ca_topic_score_gemma":0.010078318,"teacher_disagreement_score":0.3300352,"about_ca_system_score_codex":0.00003700683,"about_ca_system_score_gemma":0.00003258513,"threshold_uncertainty_score":0.99994725},"labels":[],"label_agreement":null},{"id":"W7028589783","doi":"","title":"Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem","year":2008,"lang":"en","type":"article","venue":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell'Università e della Ricerca; Université de Montréal","keywords":"Nucleofection; Hyporeflexia; TSG101; Diafiltration; Dysgeusia; Gestational period; Liquation; Fusible alloy","score_opus":0.057619282392208995,"score_gpt":0.2612735511595893,"score_spread":0.2036542687673803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028589783","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.026501387,0.007492711,0.62444544,0.009543096,0.019233491,0.021678621,0.000922826,0.008570477,0.28161195],"genre_scores_gemma":[0.9395973,0.00008490429,0.037983388,0.0003022753,0.0012900173,0.0030482456,0.0004472388,0.00025935433,0.01698725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99725485,0.000058144113,0.00092867465,0.00059012853,0.00048581767,0.00068239775],"domain_scores_gemma":[0.9967724,0.00046704776,0.00027751838,0.0014813051,0.0006950023,0.00030673953],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005051517,0.0004213362,0.0003739428,0.00022794509,0.0013444842,0.00061329606,0.0013358581,0.00019833585,0.00011961884],"category_scores_gemma":[0.000112123256,0.00036439672,0.00020353612,0.00072384725,0.00015828987,0.0006851814,0.0002148221,0.00034155132,0.000035501787],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013056492,0.0011166492,0.15836452,0.00043961126,0.00073385355,0.000033675984,0.0009212867,0.5173158,0.002609114,0.10588895,0.20624104,0.006204919],"study_design_scores_gemma":[0.0022356014,0.00017018021,0.03625604,0.00016025365,0.00020596801,0.0002727157,0.00007168872,0.2230952,0.005789594,0.00083622016,0.7293143,0.0015922337],"about_ca_topic_score_codex":0.00032850698,"about_ca_topic_score_gemma":0.00006574674,"teacher_disagreement_score":0.91309595,"about_ca_system_score_codex":0.00031794602,"about_ca_system_score_gemma":0.00040007295,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W7097147884","doi":"","title":"Hyperplane Separation Problem","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hyperplane; Separation (statistics); Intersection (aeronautics); Calculus (dental); Sequence (biology); Context (archaeology)","score_opus":0.007817052360373385,"score_gpt":0.2248155943387952,"score_spread":0.2169985419784218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097147884","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005621998,0.000095994175,0.092356555,0.00040122887,0.000116142815,0.00011376923,0.0000015200046,0.0010695596,0.90022326],"genre_scores_gemma":[0.9435218,0.000035916437,0.04889137,0.00015877759,0.00008829196,0.0000061903015,0.000019595718,0.0000128704,0.0072652143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997854,0.0000024532333,0.0000667421,0.000039631817,0.000038195056,0.00006758286],"domain_scores_gemma":[0.9999104,0.0000041984076,0.000003989815,0.000050750587,0.000008797557,0.000021865353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026788653,0.00003985995,0.00003284743,0.000022547343,0.000014958875,0.000018532608,0.000024967207,0.000024096238,0.00071244466],"category_scores_gemma":[8.1871593e-7,0.000036639405,0.000008703849,0.000052114392,0.0000028291956,0.00008513254,0.0000023774328,0.000029630453,0.00058032555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.84051e-7,0.00000496526,0.00011739824,0.000008022396,0.0000042920146,1.2102653e-7,0.00010757858,0.9658407,0.0007142933,0.0022775526,0.020369824,0.01055479],"study_design_scores_gemma":[0.00013219874,0.000007004199,0.00008622971,0.000004000708,0.0000021874248,0.0000048032302,0.000005340078,0.5795587,0.003166391,0.000064316075,0.4168724,0.00009646024],"about_ca_topic_score_codex":0.0000013094083,"about_ca_topic_score_gemma":0.000014521342,"teacher_disagreement_score":0.93789977,"about_ca_system_score_codex":0.000011135162,"about_ca_system_score_gemma":0.0000022262116,"threshold_uncertainty_score":0.7800769},"labels":[],"label_agreement":null},{"id":"W7099267569","doi":"","title":"HEC Montreal DEVIANCE FROM IDEAL: WHEN HOMOGENEOUS BOARDS MAKE MISTAKES","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Deviance (statistics); Harm; Homogeneous; Association (psychology); On board","score_opus":0.010219212053218048,"score_gpt":0.18729160853423246,"score_spread":0.17707239648101442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099267569","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.043899868,0.0028373708,0.60075015,0.0015633614,0.0012800056,0.00034045352,0.00024935714,0.0031057263,0.3459737],"genre_scores_gemma":[0.9652762,0.00023510856,0.019218542,0.0002291587,0.00014860861,0.000013158581,0.000017281189,0.00005594907,0.014806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993893,0.000010765955,0.00015570983,0.00014718997,0.000102996244,0.00019406914],"domain_scores_gemma":[0.99960405,0.000048255733,0.000016661117,0.0002217376,0.000028479997,0.00008080029],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003495376,0.00012356043,0.00012088207,0.000029506517,0.00002930633,0.000039213268,0.00011503713,0.00006676457,0.0012422195],"category_scores_gemma":[0.000012647725,0.000087869026,0.000040256156,0.000046433986,0.0000180544,0.000055602086,0.000008667508,0.00003928772,0.0002835505],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045515473,0.00006603339,0.007828223,0.00009535271,0.0003010283,0.000074119605,0.0023298278,0.06450636,0.015352907,0.0017194481,0.13194682,0.77573436],"study_design_scores_gemma":[0.0030889504,0.00008216555,0.011225579,0.00031870345,0.000065919114,0.000026623386,0.00013026736,0.085286304,0.023844518,0.0053715804,0.8689369,0.0016224737],"about_ca_topic_score_codex":0.00040351663,"about_ca_topic_score_gemma":0.0012930196,"teacher_disagreement_score":0.92137635,"about_ca_system_score_codex":0.00003380079,"about_ca_system_score_gemma":0.000009026502,"threshold_uncertainty_score":0.9996708},"labels":[],"label_agreement":null},{"id":"W7133070840","doi":"","title":"A Scheduling-based Constraint Programming Approach to Solving a Complex Two-dimensional Two-stage Cutting Stock Problem","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tardiness; Constraint programming; Scheduling (production processes); Constraint (computer-aided design); Job shop scheduling; Cutting stock problem; Constraint logic programming; Variation (astronomy)","score_opus":0.040333749074238014,"score_gpt":0.32776939359748797,"score_spread":0.28743564452324993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133070840","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.087508075,0.0022666457,0.7093795,0.0019502225,0.004551953,0.023895323,0.00040014702,0.004921,0.16512714],"genre_scores_gemma":[0.42677712,0.000004101373,0.5616799,0.00028257514,0.00023239164,0.0011492699,0.0041692294,0.00048261156,0.0052228034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929793,0.00037823216,0.0016027411,0.0017840263,0.0014330923,0.0018226297],"domain_scores_gemma":[0.9966201,0.00041568122,0.0008407593,0.00086900586,0.00049795053,0.0007564729],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0014323628,0.0015194821,0.0013583249,0.0010058016,0.0014860415,0.00078212196,0.00077898253,0.0004140783,0.0041129794],"category_scores_gemma":[0.00024975705,0.0019157819,0.00051518733,0.0018955137,0.00012697863,0.00021442828,0.00026349633,0.0022793254,0.00010429165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015314062,0.00042428664,0.00015367407,0.0026763123,0.00029933016,0.00002134564,0.018345615,0.9655486,0.004690739,0.0025628454,0.00014688238,0.0049772793],"study_design_scores_gemma":[0.003020634,0.0002443164,0.000028955157,0.0012485437,0.00021851876,0.00002909642,0.008438928,0.9785252,0.0004070573,0.000023795887,0.0058027892,0.0020121704],"about_ca_topic_score_codex":0.00074060797,"about_ca_topic_score_gemma":0.00014926912,"teacher_disagreement_score":0.33926904,"about_ca_system_score_codex":0.00082752475,"about_ca_system_score_gemma":0.000934143,"threshold_uncertainty_score":0.9998139},"labels":[],"label_agreement":null},{"id":"W7161951664","doi":"10.82308/35082","title":"Cost optimization of scrap when making steel with an electric arc furnace","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Electric arc furnace; Cost analysis; Sugar industry; Pyrometallurgy; Economic analysis","score_opus":0.021005916904808623,"score_gpt":0.25223200924118916,"score_spread":0.23122609233638053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7161951664","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.00842512,0.0015976698,0.7271112,0.000015601987,0.0010105845,0.0011561783,0.000012158472,0.00083269406,0.25983876],"genre_scores_gemma":[0.85314536,0.00043490814,0.12993842,0.000056920104,0.00014514521,0.00009011765,0.0025938365,0.00035059403,0.013244694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901813,0.000025613368,0.0003206351,0.00017572849,0.00020867075,0.000251247],"domain_scores_gemma":[0.9993591,0.000019203811,0.00014777134,0.00024113781,0.00017285711,0.00005996578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011216655,0.00026138712,0.0002805388,0.00038334244,0.000047845497,0.000057487014,0.00015282317,0.0002520839,0.00060998084],"category_scores_gemma":[0.0000070087603,0.0002425448,0.00003982416,0.0003967389,0.000008767174,0.00027069438,0.0000044898447,0.00022832534,0.000009453919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043261112,0.00003469925,0.0003143783,0.00037904922,0.00008660704,3.8468397e-7,0.0008245499,0.99193966,0.00040582774,0.0006422225,0.0003407696,0.0049886075],"study_design_scores_gemma":[0.00076143886,0.00012406008,0.0026568302,0.00065077975,0.00023022,0.0000056743497,0.0006624683,0.9877009,0.004408866,0.00007120144,0.0019919348,0.00073561724],"about_ca_topic_score_codex":0.000015015302,"about_ca_topic_score_gemma":0.00016845629,"teacher_disagreement_score":0.84472024,"about_ca_system_score_codex":0.00006233701,"about_ca_system_score_gemma":0.00004768501,"threshold_uncertainty_score":0.989069},"labels":[],"label_agreement":null},{"id":"W76685238","doi":"","title":"A multiple container loading problem based algorithm for efficient allocation of goods to vehicles","year":2007,"lang":"en","type":"article","venue":"international conference on Modelling and simulation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Knapsack problem; Computer science; Bin packing problem; Vehicle routing problem; Product (mathematics); Bin; Mathematical optimization; Operations research; Algorithm; Mathematics","score_opus":0.0491801623780964,"score_gpt":0.2931099956801975,"score_spread":0.2439298333021011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76685238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041904084,0.000011145544,0.95665884,0.00007070213,0.00016287483,0.00026951215,0.000018449095,0.000066812245,0.0008375664],"genre_scores_gemma":[0.8895348,0.000004892362,0.11027666,0.00003302044,0.00003729546,0.000011782886,0.000054942226,0.000013025933,0.000033585027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.0000073342558,0.00024016654,0.00013207582,0.00015021415,0.00010484436],"domain_scores_gemma":[0.9994275,0.00017255898,0.000047329067,0.000057134803,0.00024911642,0.000046362344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026524093,0.00008928862,0.00009009415,0.000166391,0.000038728736,0.00003479746,0.00005588252,0.00005250773,0.000007560423],"category_scores_gemma":[0.000017052093,0.00009270152,0.000026118574,0.000070509835,0.000010250775,0.000046480756,0.0000052883884,0.000048476715,0.0000015788945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003756281,0.00002155529,0.00007551214,0.00001860299,0.000011122954,9.1689344e-8,0.00021933563,0.9569804,0.0011080076,0.003055479,0.0000033344438,0.038468968],"study_design_scores_gemma":[0.0005041662,0.000062136554,0.000039007507,0.000095323,0.0000050792146,1.3414997e-7,0.000029961397,0.995049,0.0035509013,0.00034903424,0.00021435929,0.00010089217],"about_ca_topic_score_codex":0.000012877261,"about_ca_topic_score_gemma":0.0000047781505,"teacher_disagreement_score":0.84763074,"about_ca_system_score_codex":0.00004048594,"about_ca_system_score_gemma":0.000011554999,"threshold_uncertainty_score":0.37802583},"labels":[],"label_agreement":null},{"id":"W793576242","doi":"10.1007/978-3-319-18008-3_16","title":"Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"University of Toronto","funders":"","keywords":"Knapsack problem; Solver; Ellipsoid; Mathematical optimization; Computer science; Quadratic programming; Extension (predicate logic); Quadratic growth; Optimization problem; Second-order cone programming; Constraint (computer-aided design); Regular polygon; Convex optimization; Mathematics; Algorithm","score_opus":0.027240050841982565,"score_gpt":0.251362261037277,"score_spread":0.22412221019529444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W793576242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000103796265,0.00016406558,0.99402356,0.000787469,0.00033656246,0.00076439255,0.000006364103,0.00013392806,0.0036798448],"genre_scores_gemma":[0.7786283,0.000023673101,0.22021528,0.0006513842,0.00018804215,0.000026622103,0.000026681511,0.00007904819,0.00016097551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838907,0.000022261363,0.00029672976,0.00044936218,0.00049960817,0.0003429526],"domain_scores_gemma":[0.99904186,0.00023173468,0.000058328413,0.00036262508,0.00015802284,0.00014745364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008639441,0.0002950421,0.00025591283,0.00027263802,0.00015705485,0.00035892372,0.0004219927,0.0001440388,0.000020668824],"category_scores_gemma":[0.000036486792,0.00021891843,0.000033607514,0.0002738227,0.00043879077,0.000121495854,0.00012284049,0.0005325741,0.00001861376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002907166,0.0000030328226,0.000011430483,0.000079211015,0.000005813172,0.0000033449255,0.0012395843,0.942834,0.000082608225,0.0019542468,0.000025791305,0.05375802],"study_design_scores_gemma":[0.00019737174,0.000115064955,0.00000993463,0.00047527128,0.0000072022817,0.000011711955,0.0000012429964,0.9914337,0.0004922964,0.0063896687,0.00055149326,0.00031509],"about_ca_topic_score_codex":0.000009484358,"about_ca_topic_score_gemma":0.000051252253,"teacher_disagreement_score":0.7785245,"about_ca_system_score_codex":0.0001502745,"about_ca_system_score_gemma":0.0002498681,"threshold_uncertainty_score":0.89272344},"labels":[],"label_agreement":null},{"id":"W822479191","doi":"10.1007/978-3-319-16468-7_13","title":"On the Complexity of Searching the Linear Ordering Problem Neighborhoods","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","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":"Polytechnique Montréal","funders":"","keywords":"Initialization; Computer science; Time complexity; Process (computing); Data structure; Insert (composites); Algorithm; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.0601283905995073,"score_gpt":0.26519927920275993,"score_spread":0.20507088860325262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W822479191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007213849,0.00018179594,0.97613186,0.0007666111,0.0004755489,0.0003306797,0.00000627371,0.00009722428,0.02193786],"genre_scores_gemma":[0.8756199,0.000057841942,0.122889265,0.00069035316,0.00038633833,0.000009617749,0.00000854648,0.00008989943,0.000248229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986291,0.000028287237,0.00026531942,0.00028401904,0.00052260736,0.0002706522],"domain_scores_gemma":[0.9988104,0.00039221926,0.00008133048,0.00053729484,0.00012599121,0.0000527496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009028257,0.0002380729,0.00022639862,0.0001642776,0.00015329936,0.0001045936,0.0009342036,0.00010684303,0.00004781926],"category_scores_gemma":[0.00006400189,0.00014002579,0.000053139996,0.0002841179,0.00076549867,0.00006816859,0.00022997084,0.0007798217,0.000012220154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017843481,0.0000036448598,0.000006057337,0.00003780566,0.0000076003103,0.0000010742034,0.0007261406,0.9391982,0.000021893477,0.0352346,0.00003831583,0.024722911],"study_design_scores_gemma":[0.000073011885,0.000042914402,0.000009838258,0.00028714162,0.000003439263,0.00000482497,3.1997982e-7,0.8707517,0.0002269531,0.12733622,0.0010983805,0.0001652644],"about_ca_topic_score_codex":0.000012979864,"about_ca_topic_score_gemma":0.000037406866,"teacher_disagreement_score":0.87554777,"about_ca_system_score_codex":0.000085638065,"about_ca_system_score_gemma":0.000108741544,"threshold_uncertainty_score":0.5710086},"labels":[],"label_agreement":null},{"id":"W961680596","doi":"10.1007/978-3-319-07046-9_10","title":"The PrePack Optimization Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","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":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Clothing; Metaheuristic; Operations research; Warehouse; Artificial intelligence; Business; Marketing; Engineering","score_opus":0.009076665143270924,"score_gpt":0.2052352669110514,"score_spread":0.19615860176778047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W961680596","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":[7.4680014e-7,0.00026733257,0.9633331,0.00017707139,0.0012335891,0.0002626775,0.0000012031072,0.00022859726,0.034495734],"genre_scores_gemma":[0.029961865,0.00082670874,0.9614338,0.0007813607,0.0009148986,0.000028588944,0.00003253165,0.00018941185,0.0058308314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987373,0.000011221775,0.0002700606,0.00035757796,0.0003261524,0.00029768434],"domain_scores_gemma":[0.9991108,0.00018828223,0.0000736237,0.00046645405,0.00010040013,0.00006041895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041540375,0.00024830105,0.00017998894,0.0001693135,0.00019743628,0.0003161979,0.0006077526,0.0001788477,0.000028348497],"category_scores_gemma":[0.000026869551,0.00018728065,0.000046258072,0.00019511559,0.00025471186,0.000088356166,0.00011008963,0.0003604541,0.00002822125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6586355e-7,9.853436e-7,0.0000033602735,0.000023144165,0.00000398271,6.9914233e-7,0.00011480213,0.8911064,0.0000024432788,0.0019848912,0.000121147736,0.10663736],"study_design_scores_gemma":[0.000073757394,0.00002296987,0.0000018887162,0.00014524272,0.0000038318594,0.000006826782,2.4946283e-8,0.97345376,0.000048645168,0.0125102755,0.013499142,0.00023366295],"about_ca_topic_score_codex":0.0000016436708,"about_ca_topic_score_gemma":0.000024526022,"teacher_disagreement_score":0.1064037,"about_ca_system_score_codex":0.00010825542,"about_ca_system_score_gemma":0.00006390232,"threshold_uncertainty_score":0.76370835},"labels":[],"label_agreement":null},{"id":"W96748368","doi":"10.1007/978-3-642-29700-7_32","title":"An Improved Approximation Algorithm for the Bandpass Problem","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Band-pass filter; Approximation algorithm; Matching (statistics); Computer science; Algorithm; Travelling salesman problem; Reduction (mathematics); Mathematical optimization; Mathematics; Physics; Geometry; Optics","score_opus":0.01338201916636893,"score_gpt":0.225876189957608,"score_spread":0.21249417079123906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96748368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.160541e-7,0.00049314206,0.99656993,0.00010725503,0.0010743303,0.00072798517,0.000012461347,0.00018088918,0.0008330821],"genre_scores_gemma":[0.010906093,0.00007597945,0.98762065,0.0002605678,0.0007801949,0.00006165175,0.000040055475,0.00006882709,0.00018594951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998909,0.0000066624825,0.00022843175,0.0003212483,0.00021017666,0.00032446676],"domain_scores_gemma":[0.99921006,0.00014011991,0.00007013471,0.00040829607,0.00010255331,0.000068844405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004825173,0.00024532026,0.0001817956,0.00016565225,0.00015266016,0.00021936581,0.0005498668,0.00018929974,0.00002115196],"category_scores_gemma":[0.000007600585,0.00018147498,0.00005180019,0.0001421864,0.0001408867,0.00026494006,0.00005082864,0.00029888173,0.0000057976613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.757515e-7,0.0000036312476,0.0000010934768,0.000029584768,0.0000047988337,1.0647741e-7,0.00025979578,0.37227717,0.00005634451,0.00037178368,0.000011124602,0.626984],"study_design_scores_gemma":[0.00013706915,0.00004086121,0.0000057296493,0.000058591602,0.000010431593,0.0000049443015,1.1196088e-7,0.98700947,0.0004830073,0.007816519,0.004187355,0.0002459296],"about_ca_topic_score_codex":0.0000035157516,"about_ca_topic_score_gemma":0.000013392598,"teacher_disagreement_score":0.6267381,"about_ca_system_score_codex":0.00009197678,"about_ca_system_score_gemma":0.00005588861,"threshold_uncertainty_score":0.7400335},"labels":[],"label_agreement":null}]}