{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078958265,0.0025954298,0.841749,0.0014697037,0.00032453283,0.00011781363,0.0005102342,0.00031662828,0.07395844],"genre_scores_gemma":[0.84894276,0.0017422743,0.135224,0.0004082926,0.00042358568,0.00021731791,0.0006166863,0.00017785447,0.01224726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970408,0.00090045785,0.00012592433,0.00039575563,0.0011073392,0.0004297452],"domain_scores_gemma":[0.9948225,0.0025233293,0.00084400654,0.0007936954,0.0007085871,0.0003079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016108664,0.0011870351,0.0011627787,0.00092036754,0.00085685216,0.0022345462,0.0026630026,0.0013101016,0.010425981],"category_scores_gemma":[0.007828545,0.0005637723,0.000857229,0.0017625374,0.0021204492,0.0039721755,0.0019118949,0.0023010382,0.0011662913],"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.00027222332,0.000089356574,0.00086530286,0.00033274433,0.00003665085,0.00017182504,0.0001598142,0.24471833,0.0051669898,0.6680594,0.00842876,0.071698554],"study_design_scores_gemma":[0.00002772643,0.000104725106,0.00035483838,0.00005426786,0.000012101557,0.000115369796,0.00006587605,0.61833984,0.0034197336,0.36966112,0.0078115244,0.000032921114],"about_ca_topic_score_codex":0.002123623,"about_ca_topic_score_gemma":0.0012501933,"teacher_disagreement_score":0.010425981,"about_ca_system_score_codex":0.002001138,"about_ca_system_score_gemma":0.00093762507,"threshold_uncertainty_score":0.034878373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120481014,0.0031579782,0.8314982,0.0005071861,0.00036157298,0.000100630656,0.0002640621,0.0006227552,0.04300661],"genre_scores_gemma":[0.43046013,0.005010206,0.5328014,0.00024578563,0.00022665065,0.0002143895,0.00091486675,0.00076585036,0.029360734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997389,0.000057331155,0.000014093244,0.0000455519,0.00011460913,0.000029491179],"domain_scores_gemma":[0.99947757,0.00029553415,0.000036467307,0.000073419884,0.00007280213,0.00004419768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044011994,0.000663599,0.0010122104,0.0008071678,0.00053814566,0.0013343857,0.0013758445,0.0013882244,0.0058737523],"category_scores_gemma":[0.0026162958,0.0007316613,0.0007269574,0.0015232002,0.00086329604,0.0023129333,0.0020037403,0.00163891,0.0010456777],"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.00011871154,0.0000730056,0.00048847456,0.00019366064,0.00004167564,0.00014273112,0.0003595637,0.5720012,0.0073554413,0.19690016,0.007782788,0.21454263],"study_design_scores_gemma":[0.000017981802,0.00005264495,0.00020449002,0.00004657346,0.000009549707,0.00013051403,0.000063988206,0.8639831,0.001497405,0.124296844,0.009680258,0.000016679416],"about_ca_topic_score_codex":0.0011123763,"about_ca_topic_score_gemma":0.00074717624,"teacher_disagreement_score":0.0058737523,"about_ca_system_score_codex":0.0006676275,"about_ca_system_score_gemma":0.00021725298,"threshold_uncertainty_score":0.019649625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006214993,0.00036648216,0.9753916,0.00036053295,0.00017062096,0.00015597075,0.00019642511,0.0015433619,0.015600035],"genre_scores_gemma":[0.03864518,0.0002908627,0.95462537,0.000109417415,0.000072044735,0.00029311015,0.00042039817,0.00028102956,0.00526254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.00013895587,0.000048910857,0.00017864897,0.00024116613,0.00011555365],"domain_scores_gemma":[0.99933213,0.00032178513,0.000038217353,0.00015796632,0.00010883935,0.0000409652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077187817,0.0012566677,0.0009208925,0.0013041805,0.001017965,0.0014497559,0.0020580501,0.0019583595,0.019499738],"category_scores_gemma":[0.0037839208,0.0008179605,0.001213381,0.00210499,0.00073384837,0.002552993,0.0019284998,0.0021636062,0.0041614454],"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.00042748547,0.00039425152,0.00054302654,0.00043470986,0.00008523597,0.00015823988,0.00014386047,0.17122924,0.006521326,0.10373403,0.041332614,0.67499596],"study_design_scores_gemma":[0.0003655169,0.000120907585,0.00029625848,0.000068484536,0.00006012689,0.00028435013,0.00007146643,0.7954521,0.00275981,0.17802788,0.022467025,0.000026042382],"about_ca_topic_score_codex":0.0029861762,"about_ca_topic_score_gemma":0.0047580306,"teacher_disagreement_score":0.019499738,"about_ca_system_score_codex":0.0011447186,"about_ca_system_score_gemma":0.0018916792,"threshold_uncertainty_score":0.06523317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053047568,0.0048946445,0.9157422,0.0018487283,0.00040091874,0.0002479072,0.0006652258,0.00079462584,0.022358175],"genre_scores_gemma":[0.56273943,0.004469527,0.4156764,0.0010902127,0.00209836,0.00072141073,0.002264938,0.001244186,0.009695485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9820957,0.0058905478,0.0010573012,0.0026909828,0.005937495,0.0023279698],"domain_scores_gemma":[0.95157105,0.035043757,0.0040718233,0.0049578925,0.0027729648,0.0015825294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010644799,0.0035475232,0.0022878826,0.0033776446,0.0014127553,0.0060282173,0.008556612,0.0027213723,0.007309982],"category_scores_gemma":[0.042827062,0.0012024324,0.0023877986,0.0046245353,0.0027675207,0.011873104,0.004098473,0.0060252347,0.001193368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001408368,0.0010261022,0.00399294,0.001316335,0.0004525791,0.0005885858,0.00038816314,0.6691216,0.006863487,0.20657401,0.012767276,0.09550047],"study_design_scores_gemma":[0.00005868248,0.00016046579,0.0005888461,0.00006460961,0.00009630082,0.0003598864,0.00009299118,0.91628724,0.0022650894,0.07493325,0.005058575,0.000034040993],"about_ca_topic_score_codex":0.0015782973,"about_ca_topic_score_gemma":0.0017387301,"teacher_disagreement_score":0.010644799,"about_ca_system_score_codex":0.004044019,"about_ca_system_score_gemma":0.0013836807,"threshold_uncertainty_score":0.056295693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030679846,0.012116,0.86136746,0.0023899765,0.0016666994,0.00017708374,0.0007140499,0.0014824616,0.08940644],"genre_scores_gemma":[0.29627714,0.013361241,0.59421355,0.0024335661,0.004945743,0.0013239773,0.003557384,0.0032825004,0.08060485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971576,0.00050119165,0.0001793701,0.0005128285,0.0012738442,0.00037517512],"domain_scores_gemma":[0.9884722,0.008547875,0.00046283356,0.0013436816,0.0007694206,0.00040392223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036561897,0.004991931,0.0034966215,0.00500534,0.0018155521,0.0053841462,0.0068573547,0.0032282744,0.017566545],"category_scores_gemma":[0.01737122,0.002011791,0.004979219,0.0069418787,0.0034233774,0.01434195,0.005837907,0.014797262,0.0037610573],"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.0006938631,0.00061240676,0.001401662,0.0015076321,0.00025031806,0.0003527392,0.0008533319,0.16126224,0.0060055032,0.58098835,0.03753625,0.20853572],"study_design_scores_gemma":[0.00006471588,0.00008879801,0.00080294226,0.00018177977,0.00014609314,0.000337698,0.00010534602,0.37186944,0.0021755642,0.603847,0.020316456,0.000064169166],"about_ca_topic_score_codex":0.0027255516,"about_ca_topic_score_gemma":0.0027586466,"teacher_disagreement_score":0.017566545,"about_ca_system_score_codex":0.0038738342,"about_ca_system_score_gemma":0.001163475,"threshold_uncertainty_score":0.05876589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75358963,0.0044701956,0.09391052,0.005728107,0.00050588517,0.00032463405,0.021928832,0.0015589612,0.11798321],"genre_scores_gemma":[0.89945376,0.0018260209,0.06024553,0.0003451577,0.00034267813,0.00030305592,0.008072617,0.0005640079,0.0288471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822754,0.0005227589,0.00014376352,0.0003678981,0.00033188294,0.00040614474],"domain_scores_gemma":[0.9928438,0.003955242,0.0009239082,0.0009191778,0.00065077475,0.00070719194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008242457,0.0009625729,0.0009729406,0.0017447053,0.0018630933,0.0049788193,0.0020871458,0.0019673326,0.017843172],"category_scores_gemma":[0.009701516,0.0006213505,0.0005457071,0.0017253746,0.001345308,0.005566532,0.0014766447,0.001331308,0.004494075],"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.008931912,0.0008918556,0.022009686,0.0039886953,0.00047686265,0.0024218378,0.002571835,0.060385466,0.10363824,0.41531846,0.10284846,0.27651665],"study_design_scores_gemma":[0.00041848616,0.0007998912,0.021812811,0.0008390722,0.00033410187,0.0065400847,0.002583997,0.09829128,0.10368046,0.62965125,0.13486427,0.00018425238],"about_ca_topic_score_codex":0.00048165247,"about_ca_topic_score_gemma":0.0006564595,"teacher_disagreement_score":0.017843172,"about_ca_system_score_codex":0.0008855057,"about_ca_system_score_gemma":0.000604791,"threshold_uncertainty_score":0.05969131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09771865,0.0014434272,0.88711965,0.000800392,0.00010516184,0.0001521631,0.00017143125,0.00051646744,0.01197263],"genre_scores_gemma":[0.7057883,0.0015392627,0.28463754,0.00020852288,0.00013538158,0.00023218125,0.0002499694,0.00020234528,0.0070064743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991542,0.00032756,0.000030232999,0.0001502952,0.00016361865,0.00017406404],"domain_scores_gemma":[0.9987004,0.0008532524,0.00011341583,0.00016536786,0.000088146575,0.000079400386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010477004,0.0013849951,0.0015179275,0.00050429173,0.0005585843,0.0012767689,0.0011280709,0.0011042014,0.0027295842],"category_scores_gemma":[0.0038634038,0.00056138914,0.0005548973,0.0014630877,0.0016051992,0.002972191,0.0017130058,0.0007386281,0.00068436045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037790605,0.00009385444,0.0005142189,0.000180186,0.00003374133,0.0002089451,0.000091322014,0.9101442,0.0057408637,0.030864678,0.0026525403,0.04909755],"study_design_scores_gemma":[0.0000266732,0.000101287325,0.00014111912,0.000014346813,0.00001291316,0.00009976627,0.00003670823,0.9630284,0.002217113,0.032873735,0.0014350761,0.00001287504],"about_ca_topic_score_codex":0.0016922429,"about_ca_topic_score_gemma":0.001078153,"teacher_disagreement_score":0.0027295842,"about_ca_system_score_codex":0.0009360754,"about_ca_system_score_gemma":0.0008398444,"threshold_uncertainty_score":0.009131432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009485162,0.00011884465,0.9945596,0.00013984478,0.000054837066,0.000053706313,0.00003017309,0.00015335395,0.0039412244],"genre_scores_gemma":[0.06707594,0.00042302578,0.9244886,0.00013029733,0.000105013125,0.0004832779,0.00014141765,0.00022308672,0.0069294265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991923,0.00028831355,0.000030058665,0.00011409043,0.0003041857,0.000071063856],"domain_scores_gemma":[0.9993067,0.00044341988,0.00004748261,0.00009285168,0.000084282234,0.00002516511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013653303,0.0016487899,0.0010332833,0.0007388273,0.0008853931,0.0014744336,0.0011707341,0.0018361834,0.0114977015],"category_scores_gemma":[0.0038748716,0.0010455393,0.0011413025,0.0013322885,0.0010655817,0.0013942948,0.0014522881,0.002168149,0.001850513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004056368,0.00007864757,0.00016642975,0.00019591581,0.000043500797,0.000060852424,0.000074643394,0.7351975,0.002063214,0.117661096,0.00843581,0.13598177],"study_design_scores_gemma":[0.00003218364,0.00004767765,0.000044052456,0.000018588506,0.000010823569,0.00005215026,0.00001755447,0.939372,0.0006661134,0.050699852,0.009028227,0.000010714983],"about_ca_topic_score_codex":0.002452636,"about_ca_topic_score_gemma":0.0030142383,"teacher_disagreement_score":0.0114977015,"about_ca_system_score_codex":0.00090643537,"about_ca_system_score_gemma":0.0016915158,"threshold_uncertainty_score":0.038463652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45824566,0.0013818124,0.4629872,0.0011532346,0.00021990901,0.00031172202,0.0022367276,0.00062415225,0.07283954],"genre_scores_gemma":[0.7974553,0.0013020507,0.16940176,0.00047230333,0.0001152953,0.000355289,0.0028331417,0.00037212844,0.02769266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914134,0.00029466965,0.000051566636,0.00014772124,0.00015876947,0.00020594047],"domain_scores_gemma":[0.9986719,0.00057009084,0.00018634349,0.0002920792,0.000106063795,0.0001735442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053976587,0.0011797791,0.0016923492,0.0011592894,0.0010466793,0.0030087654,0.001186501,0.0016790455,0.014244806],"category_scores_gemma":[0.0027184892,0.0011939717,0.0006510005,0.0032894881,0.000731662,0.0034905658,0.0025563159,0.0011712093,0.0019115346],"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.0013523035,0.0005537999,0.0019854226,0.000616907,0.00017460108,0.00057784707,0.00029565304,0.5959149,0.015732035,0.22468576,0.019990098,0.13812064],"study_design_scores_gemma":[0.00015161585,0.00029464214,0.0011814631,0.00011673084,0.000052813786,0.00033786302,0.00043759766,0.64902323,0.01096041,0.32503173,0.012373348,0.000038519487],"about_ca_topic_score_codex":0.0012345386,"about_ca_topic_score_gemma":0.0014218681,"teacher_disagreement_score":0.014244806,"about_ca_system_score_codex":0.00082149624,"about_ca_system_score_gemma":0.00043540867,"threshold_uncertainty_score":0.047653615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05097846,0.0019341363,0.8616037,0.0011421759,0.00039923438,0.00020980989,0.00078614394,0.007069725,0.07587659],"genre_scores_gemma":[0.44328895,0.0006714297,0.5078623,0.00041042187,0.00018945978,0.00017754217,0.0019451916,0.002289976,0.04316468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953393,0.0009224095,0.00021555927,0.0005085379,0.0020490866,0.00096512475],"domain_scores_gemma":[0.99684614,0.0013718696,0.00010203404,0.000823068,0.00077013724,0.00008668382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024012122,0.001291927,0.0018826876,0.0012147808,0.0015232132,0.0041768835,0.0032005464,0.0015544825,0.027235383],"category_scores_gemma":[0.007386532,0.0008104078,0.0013067332,0.0028219041,0.0016214078,0.0065516736,0.0030395498,0.001774898,0.005013606],"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.0022719314,0.00040022618,0.0013988303,0.00060853723,0.0001242864,0.00028747346,0.00027815785,0.10104712,0.01678445,0.17440127,0.04827827,0.6541195],"study_design_scores_gemma":[0.00013784671,0.00020786085,0.00065766816,0.00011364196,0.0001476478,0.00046866632,0.00026451756,0.6791972,0.039494656,0.2606055,0.01863409,0.00007083253],"about_ca_topic_score_codex":0.00264,"about_ca_topic_score_gemma":0.0054904567,"teacher_disagreement_score":0.027235383,"about_ca_system_score_codex":0.0023796717,"about_ca_system_score_gemma":0.0026947036,"threshold_uncertainty_score":0.09111148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022820257,0.0009797757,0.94717425,0.000670338,0.00034171232,0.00029550918,0.0006798656,0.0036590544,0.023379197],"genre_scores_gemma":[0.1455252,0.0009567265,0.8317383,0.0003406838,0.00026670197,0.00042503394,0.0018849062,0.0006299046,0.018232604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984744,0.00020521502,0.00008287127,0.00030116882,0.0006526199,0.00028368898],"domain_scores_gemma":[0.99827516,0.00070077775,0.00008678425,0.0006617872,0.00017294666,0.00010259756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095945527,0.001575047,0.0019471461,0.0011116422,0.0012956385,0.0029768534,0.003713461,0.0016372871,0.014834708],"category_scores_gemma":[0.0044364645,0.0009325058,0.0017800615,0.0043575694,0.0011274762,0.005713005,0.0035205332,0.0038850487,0.004802673],"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.001232567,0.00051493524,0.0004389385,0.00055481703,0.00008310942,0.00015411782,0.0003284929,0.13112453,0.016267031,0.17675593,0.05140289,0.6211427],"study_design_scores_gemma":[0.00041414754,0.00020242677,0.00032942573,0.00005993598,0.00008341715,0.00029280878,0.000112617185,0.73896754,0.0065985853,0.22740091,0.02548641,0.00005173338],"about_ca_topic_score_codex":0.004422678,"about_ca_topic_score_gemma":0.0047914614,"teacher_disagreement_score":0.014834708,"about_ca_system_score_codex":0.0026637956,"about_ca_system_score_gemma":0.0021872167,"threshold_uncertainty_score":0.049627006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10232758,0.001772972,0.8811592,0.0009848163,0.0001241584,0.00016254716,0.00020695462,0.0005519885,0.012709861],"genre_scores_gemma":[0.6565776,0.0018252018,0.33486012,0.00022224334,0.00017761401,0.00028416916,0.00030007088,0.00021128627,0.005541672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887794,0.00047630983,0.000044383894,0.00019674144,0.00017857684,0.00022594948],"domain_scores_gemma":[0.9984666,0.0009999105,0.00015012089,0.00018377432,0.00010209742,0.000097554155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014415435,0.001454166,0.0016982073,0.00060696044,0.0006466364,0.0015769476,0.0013162695,0.0012228069,0.0030367232],"category_scores_gemma":[0.0046592057,0.0005965473,0.0006334124,0.0017366341,0.0015453065,0.0033954068,0.0018064943,0.0007855035,0.0007375277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004929939,0.0001236944,0.0006914447,0.00022109326,0.000043583237,0.0002545498,0.00012810045,0.8744488,0.005669803,0.048058137,0.0036245321,0.06624334],"study_design_scores_gemma":[0.00003640077,0.00011969755,0.00017928623,0.000020705,0.000017995884,0.0001191662,0.000051482595,0.9578134,0.002242551,0.037681744,0.0017008111,0.000016781529],"about_ca_topic_score_codex":0.0016971559,"about_ca_topic_score_gemma":0.0009504786,"teacher_disagreement_score":0.0030367232,"about_ca_system_score_codex":0.0012134197,"about_ca_system_score_gemma":0.0009653598,"threshold_uncertainty_score":0.010158896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06635082,0.0007496161,0.92297196,0.0001494703,0.00017115836,0.0003558821,0.00015434758,0.0010494919,0.008047133],"genre_scores_gemma":[0.16927616,0.00033850977,0.8257905,0.00009825957,0.000057720314,0.00030844248,0.00039626978,0.00013351669,0.0036007091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958843,0.00009818824,0.000022041668,0.000051709998,0.00016922505,0.000070440095],"domain_scores_gemma":[0.9993942,0.00032979422,0.000057001726,0.000076972916,0.0000984478,0.000043638393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065731903,0.0007043879,0.0010587611,0.001007812,0.0004602763,0.0006993012,0.0015092059,0.0009926652,0.0042260876],"category_scores_gemma":[0.0015124846,0.00049332256,0.00074112375,0.0009999869,0.00045313017,0.00093353307,0.0006811744,0.0008458626,0.000586141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033031462,0.00034574114,0.0007549795,0.00032438885,0.000066832734,0.0002828964,0.00014820124,0.71758735,0.01176893,0.008265701,0.0037683437,0.25635633],"study_design_scores_gemma":[0.00019820704,0.00031318903,0.0004891661,0.00003099105,0.000041508036,0.00016946692,0.00004512716,0.98570746,0.00409764,0.002993872,0.0058828546,0.000030577048],"about_ca_topic_score_codex":0.0027543695,"about_ca_topic_score_gemma":0.0036289352,"teacher_disagreement_score":0.0042260876,"about_ca_system_score_codex":0.0005958328,"about_ca_system_score_gemma":0.0012694346,"threshold_uncertainty_score":0.014137685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013166688,0.00042130044,0.9754778,0.00026347165,0.00006116912,0.00023018374,0.00078144856,0.004115067,0.0054827835],"genre_scores_gemma":[0.06634971,0.0003212588,0.92726505,0.00017894784,0.00001870662,0.000316862,0.0017927247,0.00084386725,0.0029128487],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613744,0.0007138969,0.00054755947,0.0012444184,0.0011056449,0.000251058],"domain_scores_gemma":[0.9947766,0.0023522633,0.00043147104,0.0015729939,0.00070532644,0.0001614075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027398863,0.0017246249,0.001604594,0.0040744017,0.0013091131,0.0045714052,0.0034215625,0.0016686408,0.00953429],"category_scores_gemma":[0.011788948,0.0014283002,0.002448957,0.0036172573,0.0017982149,0.00913004,0.0044706143,0.0019265566,0.0035943063],"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.00032514546,0.00023361265,0.005468732,0.0011727546,0.00017271261,0.0009599671,0.0015002091,0.05752346,0.010372114,0.3090749,0.012110342,0.6010861],"study_design_scores_gemma":[0.00017941267,0.00028429975,0.0008742384,0.00034870527,0.00014735709,0.0007661196,0.0010346064,0.35929576,0.033428013,0.5052375,0.09825013,0.00015382246],"about_ca_topic_score_codex":0.004658575,"about_ca_topic_score_gemma":0.00455011,"teacher_disagreement_score":0.00953429,"about_ca_system_score_codex":0.001887341,"about_ca_system_score_gemma":0.0025676065,"threshold_uncertainty_score":0.0318954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049220033,0.0033206036,0.65937406,0.0040155286,0.0018071999,0.00019917256,0.0008560551,0.000762423,0.28044492],"genre_scores_gemma":[0.38400665,0.0056132474,0.44260937,0.0016805524,0.0020711266,0.00061564567,0.0019367101,0.0017212178,0.15974553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992343,0.00014427431,0.000045949757,0.00017652196,0.00025547968,0.0001434518],"domain_scores_gemma":[0.9993445,0.00026834535,0.000058882928,0.00018560709,0.000075676864,0.00006703051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456949,0.0011963852,0.0016340697,0.0009245168,0.0016544667,0.002686259,0.0021772915,0.002277777,0.02256114],"category_scores_gemma":[0.002688695,0.0007590045,0.0015259578,0.0035307156,0.0016776202,0.0049494207,0.003112803,0.0037598908,0.004734778],"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.00012246739,0.0000971669,0.0001600446,0.00039925406,0.00003547957,0.00018457053,0.0001289695,0.027175711,0.0014848901,0.7926011,0.05055135,0.12705898],"study_design_scores_gemma":[0.0000279432,0.000040990726,0.00018059913,0.00008139892,0.000020119687,0.00036843383,0.00007639271,0.06754469,0.0017415195,0.892488,0.037406642,0.000023233892],"about_ca_topic_score_codex":0.0011622144,"about_ca_topic_score_gemma":0.00093853934,"teacher_disagreement_score":0.02256114,"about_ca_system_score_codex":0.0011308371,"about_ca_system_score_gemma":0.00093641,"threshold_uncertainty_score":0.0754745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05349524,0.00017007522,0.94005036,0.0003335718,0.000024527913,0.000067493165,0.00018173763,0.00009026899,0.005586687],"genre_scores_gemma":[0.79420924,0.0004918152,0.1953418,0.000103500846,0.00006836534,0.00025187398,0.00054286764,0.00012544882,0.008865089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907386,0.00039860862,0.00003315758,0.0002122981,0.00014663293,0.00013546464],"domain_scores_gemma":[0.99869305,0.0008898341,0.00013701338,0.00009793278,0.000110165085,0.00007204128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014466109,0.00084250944,0.001009874,0.00094564975,0.00055673457,0.0014757301,0.0013496573,0.0013984172,0.003094688],"category_scores_gemma":[0.0039691376,0.0006731696,0.0009083369,0.0013814337,0.001294346,0.0031832114,0.0010436872,0.0012409632,0.00021565477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038493516,0.000031206317,0.00020151722,0.00003656985,0.000010462121,0.00007383636,0.000030949173,0.9018918,0.00041792987,0.09059252,0.0005825402,0.006092166],"study_design_scores_gemma":[0.000007811542,0.000011728839,0.00006744314,0.0000042425195,0.0000041661947,0.000019663814,0.000013812441,0.96062416,0.00022790516,0.03852693,0.000488155,0.0000039514243],"about_ca_topic_score_codex":0.0035500186,"about_ca_topic_score_gemma":0.0023654194,"teacher_disagreement_score":0.0035500186,"about_ca_system_score_codex":0.0023711359,"about_ca_system_score_gemma":0.0012236503,"threshold_uncertainty_score":0.017203867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009759596,0.0053746933,0.93451464,0.0016110862,0.000807935,0.00043136036,0.0014463895,0.0005463882,0.045507967],"genre_scores_gemma":[0.24094227,0.013489222,0.70392656,0.0011827755,0.0019257625,0.0010393596,0.0049286354,0.00065214,0.031913217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512285,0.0018129842,0.00041546903,0.0011759918,0.0010336182,0.00043915914],"domain_scores_gemma":[0.9954301,0.0025860516,0.0003885768,0.0008683238,0.0005181447,0.00020881718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029599285,0.0025669693,0.0016340339,0.0016876262,0.0012751817,0.004444555,0.003269792,0.0020243756,0.0141837355],"category_scores_gemma":[0.010156845,0.0009059104,0.0022958652,0.004957211,0.0020420116,0.008125116,0.0031253728,0.0044859564,0.0037243897],"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.00013919445,0.00011032494,0.0005020694,0.0006651231,0.00009939605,0.0001547308,0.0002350055,0.07500544,0.00095434993,0.80667526,0.02481483,0.09064433],"study_design_scores_gemma":[0.0000612653,0.00009415579,0.00023696014,0.00010176863,0.000052826384,0.00042337572,0.0001396824,0.110987805,0.0008663092,0.7946079,0.0923931,0.00003481456],"about_ca_topic_score_codex":0.0017680016,"about_ca_topic_score_gemma":0.0017467611,"teacher_disagreement_score":0.0141837355,"about_ca_system_score_codex":0.0019152398,"about_ca_system_score_gemma":0.0018443168,"threshold_uncertainty_score":0.04744929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17288269,0.003642654,0.72369915,0.0013124876,0.0003846967,0.00019078024,0.0007933901,0.0018646677,0.095229596],"genre_scores_gemma":[0.6839581,0.003363496,0.27689844,0.00042217656,0.0004483015,0.0003683796,0.0022785014,0.0010891311,0.031173421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985359,0.00027388218,0.00008491913,0.00034315354,0.0005619233,0.00020022766],"domain_scores_gemma":[0.9950872,0.003282801,0.00020278488,0.001005635,0.00026743519,0.00015429387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481656,0.0014345482,0.0016818807,0.0013965219,0.0008556087,0.0032300104,0.0031202324,0.0014115389,0.010777621],"category_scores_gemma":[0.010053223,0.001106604,0.0022577376,0.0027268804,0.0017764566,0.006095337,0.0029231913,0.004166351,0.0011495563],"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.00054408883,0.00019643354,0.0010329256,0.0008001845,0.000121170364,0.00018770545,0.0005921764,0.19440332,0.005116321,0.5944208,0.0120328395,0.19055216],"study_design_scores_gemma":[0.00005213787,0.000049371996,0.00033216976,0.000086838256,0.000064107066,0.00020347825,0.00007958245,0.22619674,0.0024743944,0.7621113,0.008331803,0.000018109635],"about_ca_topic_score_codex":0.0024336793,"about_ca_topic_score_gemma":0.0020009808,"teacher_disagreement_score":0.010777621,"about_ca_system_score_codex":0.0025219868,"about_ca_system_score_gemma":0.0008846957,"threshold_uncertainty_score":0.03605473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39554894,0.0019751186,0.5069921,0.009272472,0.00070975407,0.0006102924,0.0028675115,0.0010999147,0.080923855],"genre_scores_gemma":[0.8771357,0.0015276879,0.10938993,0.00079435646,0.0009932349,0.0005081896,0.0029417705,0.00016016177,0.0065490054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969297,0.00058969675,0.00032001841,0.00075122336,0.0007847413,0.0006246442],"domain_scores_gemma":[0.9692003,0.021444343,0.002936211,0.002491196,0.0024695587,0.0014585294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037876826,0.0010004124,0.0015440197,0.0015553286,0.0020758219,0.0026768083,0.002851364,0.0030571192,0.0112363575],"category_scores_gemma":[0.031130245,0.00088434,0.0028114377,0.0019745314,0.0060435794,0.009456958,0.0030972667,0.00691436,0.0013250975],"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.00047067073,0.0002574615,0.0043528373,0.00049677526,0.0000672041,0.000685594,0.00054829475,0.029265326,0.006943241,0.9270728,0.008435089,0.021404732],"study_design_scores_gemma":[0.00015296874,0.00028857784,0.0021808026,0.00010573033,0.00007513729,0.0005182718,0.00033699567,0.089496225,0.008100123,0.8919816,0.0066572214,0.00010626497],"about_ca_topic_score_codex":0.0018870941,"about_ca_topic_score_gemma":0.0013362628,"teacher_disagreement_score":0.0112363575,"about_ca_system_score_codex":0.0026083803,"about_ca_system_score_gemma":0.0021499782,"threshold_uncertainty_score":0.03758943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024121836,0.0032190064,0.95202994,0.0003994511,0.000584163,0.0002452531,0.0006192457,0.0022557743,0.016525317],"genre_scores_gemma":[0.075992145,0.001309604,0.91172,0.00023086305,0.00021584326,0.0003985606,0.0013129867,0.00056315534,0.00825688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993579,0.00014601015,0.000029569142,0.000099009136,0.0002153651,0.00015211754],"domain_scores_gemma":[0.9983954,0.0009959089,0.0001173721,0.00019225109,0.00020791442,0.000091158414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000753811,0.002015301,0.0018599196,0.0016833456,0.0009129768,0.0019823196,0.0030396278,0.0016952374,0.010403443],"category_scores_gemma":[0.0023609293,0.0014745278,0.0012814068,0.0042564115,0.00058024627,0.0024908728,0.0017601254,0.0022637998,0.0020913698],"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.000766413,0.0003328627,0.0005108455,0.00093622325,0.00012630683,0.0003323217,0.0002477906,0.4244621,0.008766397,0.040826153,0.053242162,0.46945044],"study_design_scores_gemma":[0.00025491093,0.0001623536,0.00036297346,0.00007269188,0.000041624735,0.00018007774,0.000078998906,0.9460381,0.002413971,0.031843964,0.01849613,0.00005423714],"about_ca_topic_score_codex":0.0050591268,"about_ca_topic_score_gemma":0.008888625,"teacher_disagreement_score":0.010403443,"about_ca_system_score_codex":0.0013990379,"about_ca_system_score_gemma":0.0014673978,"threshold_uncertainty_score":0.034803033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9101926,0.0010813839,0.059525914,0.0005120001,0.00013300228,0.00008919188,0.00072352856,0.00040033995,0.02734197],"genre_scores_gemma":[0.86552244,0.00085545174,0.12355281,0.00012722329,0.000050134022,0.00010838806,0.0013326575,0.00022765037,0.008223253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917233,0.00016822138,0.00008446337,0.00011685963,0.00016185285,0.00029631465],"domain_scores_gemma":[0.9991874,0.0002781628,0.0001269845,0.00017561269,0.00007863704,0.0001532779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004232569,0.00074599235,0.0013077814,0.00046522415,0.0007573734,0.0011108593,0.0006123433,0.00077245914,0.008390703],"category_scores_gemma":[0.0021887284,0.00071051595,0.00057674065,0.0014137843,0.00073172053,0.0016851014,0.001530922,0.0005414266,0.001701776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055672824,0.0011691502,0.007317385,0.0014142969,0.00022168744,0.0024251016,0.0010990878,0.413856,0.09825082,0.12463806,0.03293036,0.3111108],"study_design_scores_gemma":[0.0007189017,0.0021296039,0.007964255,0.00015798246,0.00013440136,0.0015441503,0.0015806557,0.6909825,0.080155365,0.18735369,0.02709907,0.00017939784],"about_ca_topic_score_codex":0.0008992656,"about_ca_topic_score_gemma":0.0016188533,"teacher_disagreement_score":0.008390703,"about_ca_system_score_codex":0.0005572031,"about_ca_system_score_gemma":0.00070829573,"threshold_uncertainty_score":0.028069675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069882296,0.00088305713,0.89604735,0.0027704309,0.00016126127,0.00007023061,0.00028758377,0.00013813072,0.02975969],"genre_scores_gemma":[0.6121121,0.0017751085,0.36600378,0.00092673197,0.0005806372,0.00040015715,0.00074255664,0.00023561543,0.017223297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976453,0.001023415,0.000085277956,0.0004503436,0.00048234593,0.0003132879],"domain_scores_gemma":[0.9950565,0.0033634373,0.00044456983,0.00047543176,0.00028963824,0.0003703221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026987905,0.000842109,0.0013958226,0.0013548976,0.0019562328,0.0024510964,0.0020974292,0.0019269722,0.007440692],"category_scores_gemma":[0.010442977,0.00072800874,0.0017860178,0.0017460802,0.0040849647,0.0066034114,0.0029677546,0.0050503355,0.0007230345],"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.000062988285,0.000038964903,0.000275707,0.000052923322,0.000017345948,0.00003777836,0.00008278747,0.019984383,0.00052560825,0.96349263,0.0038997377,0.011529186],"study_design_scores_gemma":[0.000018701281,0.00003544415,0.00020932932,0.000017350492,0.000006545245,0.00006404448,0.000055040087,0.06411764,0.00026693064,0.931864,0.0033238959,0.00002098409],"about_ca_topic_score_codex":0.0012613186,"about_ca_topic_score_gemma":0.0010968805,"teacher_disagreement_score":0.007440692,"about_ca_system_score_codex":0.0014098872,"about_ca_system_score_gemma":0.0011441556,"threshold_uncertainty_score":0.024891555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73319024,0.008642058,0.12871242,0.0013179128,0.0014999766,0.0010139636,0.0037918102,0.0138770295,0.10795448],"genre_scores_gemma":[0.7148678,0.0011348589,0.2647822,0.00036312352,0.0001670412,0.00031347806,0.0055067167,0.0017280703,0.01113676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963665,0.0012429182,0.00016340258,0.00060100557,0.0009466865,0.00067943457],"domain_scores_gemma":[0.9871257,0.009313375,0.00039762552,0.00117837,0.0015192918,0.0004656738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032226543,0.00281862,0.0023666755,0.0026535264,0.0016670092,0.0027032734,0.0037076438,0.0023614876,0.018144494],"category_scores_gemma":[0.010956957,0.00090637396,0.0010620579,0.0041032326,0.0009915167,0.0026311984,0.0017012602,0.0014258499,0.0019616392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005623592,0.002352781,0.0025848204,0.00097138603,0.00026441837,0.00015099577,0.0001612442,0.58063257,0.0044354843,0.010825414,0.027140621,0.3648566],"study_design_scores_gemma":[0.00061194866,0.00056966336,0.00075081026,0.0000624488,0.000114166905,0.00005704261,0.00016317183,0.9857519,0.0043063196,0.0043825647,0.003204644,0.000025358047],"about_ca_topic_score_codex":0.014809085,"about_ca_topic_score_gemma":0.015231876,"teacher_disagreement_score":0.018144494,"about_ca_system_score_codex":0.0044373553,"about_ca_system_score_gemma":0.003998481,"threshold_uncertainty_score":0.060699344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03150383,0.0005349111,0.9505049,0.00008378421,0.00011072178,0.000056574565,0.0001364119,0.0010905943,0.015978187],"genre_scores_gemma":[0.7573846,0.00048284477,0.23673743,0.000071052986,0.00005762646,0.00006480359,0.00021820297,0.00016013779,0.0048233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997608,0.00006230102,0.000014384166,0.00004171543,0.00007568456,0.000045121487],"domain_scores_gemma":[0.9997768,0.000073821335,0.000021968879,0.00007543191,0.000034561042,0.000017529323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035463457,0.00070915965,0.0011190242,0.00035673642,0.00032796522,0.0009242873,0.0007666375,0.0003648237,0.0050817146],"category_scores_gemma":[0.00056312734,0.0004230322,0.0005236539,0.0013042464,0.000376488,0.0011086272,0.0008450513,0.0005919306,0.00066917285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031871343,0.000071834445,0.00044482638,0.00014648358,0.0000666554,0.00014634199,0.000073828865,0.77714473,0.011537325,0.023160439,0.0052121207,0.18167675],"study_design_scores_gemma":[0.000018199062,0.00006351926,0.00015944698,0.000011007257,0.00001767023,0.000055069835,0.000021115064,0.97631925,0.0033482374,0.017822279,0.0021554811,0.00000877898],"about_ca_topic_score_codex":0.0012139445,"about_ca_topic_score_gemma":0.0018980841,"teacher_disagreement_score":0.0050817146,"about_ca_system_score_codex":0.00046667634,"about_ca_system_score_gemma":0.00045340133,"threshold_uncertainty_score":0.01700002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010852519,0.000044581062,0.9972415,0.000063176376,0.000014340354,0.000023422635,0.000011251323,0.00003507306,0.0014814325],"genre_scores_gemma":[0.09213296,0.000224032,0.9023495,0.00011098567,0.00006736123,0.00038654238,0.00008623861,0.000090830494,0.00455153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995209,0.00017534173,0.000019350296,0.00007146209,0.000164696,0.00004838199],"domain_scores_gemma":[0.99961555,0.00021753214,0.000036703583,0.000028513115,0.000072800176,0.000028899116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012117143,0.0009864212,0.0008081983,0.0005881643,0.00051864324,0.0008693707,0.0012221006,0.001261449,0.0053268108],"category_scores_gemma":[0.0017903656,0.0005580742,0.0009962446,0.00069688255,0.0007021149,0.00093246676,0.0019016376,0.0017698397,0.0006072292],"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.00003614898,0.00006163198,0.00017117872,0.00010898364,0.00003576206,0.00007558571,0.00008188054,0.8210506,0.002455222,0.12706769,0.0014191744,0.047436204],"study_design_scores_gemma":[0.0000133736485,0.000028927854,0.000022306884,0.00000824413,0.0000046028595,0.000013472473,0.000007846233,0.9754191,0.00036048226,0.02223057,0.0018866705,0.0000044696],"about_ca_topic_score_codex":0.0014461667,"about_ca_topic_score_gemma":0.001908939,"teacher_disagreement_score":0.0053268108,"about_ca_system_score_codex":0.00072024716,"about_ca_system_score_gemma":0.0015062196,"threshold_uncertainty_score":0.017819941},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2706587,0.00056257035,0.72156876,0.0002734278,0.00010446865,0.00010722138,0.00010047227,0.0006516669,0.0059726653],"genre_scores_gemma":[0.8071987,0.00022111389,0.18668064,0.00008376376,0.000022289687,0.000077041055,0.00020529042,0.00011430122,0.0053967857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931836,0.00017215713,0.000039986815,0.00017186662,0.00019586516,0.0001017709],"domain_scores_gemma":[0.99902284,0.00039378606,0.00014896612,0.00019430106,0.00013271376,0.0001074052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045766437,0.0005800981,0.0010126194,0.0005768253,0.00070044235,0.00080355245,0.0012647063,0.0012466344,0.0026197184],"category_scores_gemma":[0.0018360959,0.00055873574,0.0005846652,0.0010063383,0.0008736586,0.0014129262,0.0014689281,0.00062098517,0.00051297835],"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.00042975313,0.000058634978,0.0010910631,0.00012103076,0.000056021272,0.00071543286,0.000160623,0.92458755,0.012370753,0.008696902,0.0013525968,0.05035967],"study_design_scores_gemma":[0.000021632004,0.000109876295,0.00028565293,0.0000060054044,0.00001173659,0.0001747179,0.00005961276,0.98712254,0.0055122855,0.004221182,0.002461719,0.000013054772],"about_ca_topic_score_codex":0.0041570766,"about_ca_topic_score_gemma":0.0023752747,"teacher_disagreement_score":0.0041570766,"about_ca_system_score_codex":0.000621932,"about_ca_system_score_gemma":0.00050697627,"threshold_uncertainty_score":0.00876379},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02159742,0.0007470105,0.9468119,0.0004893729,0.0004279285,0.00010953606,0.00022151806,0.0008337487,0.028761411],"genre_scores_gemma":[0.26371858,0.0010391612,0.7071252,0.0004227862,0.0005255173,0.00031562793,0.0003740342,0.0008696779,0.025609408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999127,0.00029688643,0.000058549173,0.00016788712,0.00023885546,0.00011082743],"domain_scores_gemma":[0.9984022,0.00085654855,0.00013019308,0.00031315384,0.00016426491,0.0001336653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395513,0.00064964255,0.0007019095,0.0012180993,0.0013586844,0.0022194067,0.001156772,0.00089257007,0.007987326],"category_scores_gemma":[0.00542105,0.00034962554,0.00085798494,0.0022211887,0.002020121,0.0033180066,0.002573934,0.002155655,0.001794142],"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.000282021,0.000103325234,0.0003599212,0.00019646318,0.000026959679,0.00018843438,0.00037660377,0.032715593,0.0098677445,0.7611537,0.009782604,0.18494657],"study_design_scores_gemma":[0.000047268994,0.00016905526,0.0003459641,0.00009418536,0.000035400273,0.00026802346,0.00016356516,0.18531089,0.006701613,0.7723827,0.034431253,0.000050131166],"about_ca_topic_score_codex":0.0014955157,"about_ca_topic_score_gemma":0.0019037839,"teacher_disagreement_score":0.007987326,"about_ca_system_score_codex":0.0011034264,"about_ca_system_score_gemma":0.00093560596,"threshold_uncertainty_score":0.026720226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02729922,0.0006799954,0.9627259,0.0003904133,0.00011369414,0.00009511702,0.000050388284,0.00008885748,0.008556412],"genre_scores_gemma":[0.3115478,0.0017297282,0.672707,0.00029943453,0.0001645328,0.0003641396,0.00024286915,0.00009135282,0.012853182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997054,0.000101331614,0.000011127672,0.000045352976,0.000096136304,0.000040630035],"domain_scores_gemma":[0.999754,0.00014011541,0.000024408624,0.000012682061,0.000046677327,0.000022065742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041785298,0.00074682815,0.0007546699,0.0009276854,0.00059134385,0.00077139464,0.0010231502,0.0013945597,0.0030265283],"category_scores_gemma":[0.0011184344,0.00035976648,0.0007881082,0.0011500404,0.0004957616,0.00066858856,0.00070003164,0.001121169,0.00031487743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034664467,0.00012854037,0.00065140997,0.00013252409,0.00006121307,0.00017115253,0.00010352314,0.8708135,0.003209895,0.04735956,0.0015584684,0.07577551],"study_design_scores_gemma":[0.000018646795,0.000047890462,0.0002129394,0.000017123832,0.000015200243,0.0000866104,0.00003176025,0.98143023,0.00047452337,0.0140972985,0.0035601968,0.0000075952203],"about_ca_topic_score_codex":0.0026007202,"about_ca_topic_score_gemma":0.0022388573,"teacher_disagreement_score":0.0030265283,"about_ca_system_score_codex":0.0007105877,"about_ca_system_score_gemma":0.0006644533,"threshold_uncertainty_score":0.010124683},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58377355,0.0002320046,0.39922187,0.00044686423,0.000040559386,0.00018086778,0.00054148806,0.000519439,0.015043355],"genre_scores_gemma":[0.92828304,0.00007431767,0.066449694,0.000021234413,0.000009125199,0.000057423207,0.000300583,0.000056417583,0.004748164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966276,0.0000773122,0.000009648209,0.00007651008,0.00009738679,0.00007644575],"domain_scores_gemma":[0.999534,0.00022469573,0.00007584541,0.000033615393,0.00008550647,0.000046280053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004934563,0.0004753185,0.0005594472,0.00090684695,0.00062748964,0.0008849651,0.00087415444,0.0006594461,0.0045207576],"category_scores_gemma":[0.0010534795,0.0003111529,0.0005814933,0.0008029026,0.000283352,0.00061395444,0.00041948294,0.0005211306,0.00025932657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080366815,0.000037370475,0.0009336243,0.000040316587,0.000013014,0.000112898044,0.000018316887,0.97932386,0.004359598,0.0021823158,0.00069770217,0.01220072],"study_design_scores_gemma":[0.000008019856,0.000032317927,0.0009159213,0.000003400325,0.0000066213465,0.000035689573,0.000035002377,0.99425745,0.0028951608,0.0013030679,0.0005004365,0.0000069351686],"about_ca_topic_score_codex":0.014220767,"about_ca_topic_score_gemma":0.010254607,"teacher_disagreement_score":0.014220767,"about_ca_system_score_codex":0.0019458372,"about_ca_system_score_gemma":0.0011098519,"threshold_uncertainty_score":0.028276026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029625574,0.00097160524,0.98588574,0.0032527028,0.00025097845,0.000060884675,0.000021810369,0.0002284481,0.0063652648],"genre_scores_gemma":[0.058923203,0.0024445509,0.9272813,0.0008713576,0.00033530148,0.00016254808,0.000107960106,0.00041113587,0.009462526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99512166,0.0018262643,0.00025667762,0.00067628804,0.0018209252,0.0002981209],"domain_scores_gemma":[0.9840973,0.01093919,0.00067526347,0.0017169155,0.0023460246,0.00022531106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073098745,0.001254855,0.0009844633,0.0013365141,0.0013135988,0.0037646964,0.0026832714,0.0029702813,0.014736144],"category_scores_gemma":[0.021847054,0.0009573386,0.0022497922,0.0019117612,0.0036145689,0.011548729,0.0027308746,0.011177109,0.002713371],"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.000066616165,0.00013583814,0.001134506,0.00086931145,0.00008105752,0.00019872369,0.00080158346,0.06798804,0.007043616,0.63638633,0.012586441,0.2727079],"study_design_scores_gemma":[0.000075650525,0.00025063506,0.00054622616,0.00048108536,0.00005108198,0.00063396344,0.0009282523,0.4335049,0.014242134,0.41547528,0.13370347,0.000107295615],"about_ca_topic_score_codex":0.003629494,"about_ca_topic_score_gemma":0.0022689807,"teacher_disagreement_score":0.014736144,"about_ca_system_score_codex":0.0020553616,"about_ca_system_score_gemma":0.0029160217,"threshold_uncertainty_score":0.049297333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005988236,0.00019888484,0.9908862,0.00011728399,0.000059840506,0.00009107253,0.00004733435,0.00020521278,0.002405879],"genre_scores_gemma":[0.1384824,0.00041492685,0.8550465,0.000111365705,0.00007343498,0.00067863194,0.00031941364,0.000070168375,0.0048031546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967504,0.0000917334,0.000022485123,0.00006458758,0.00011027698,0.00003593092],"domain_scores_gemma":[0.9995384,0.0002547109,0.000043614735,0.000028467663,0.00011109948,0.000023770835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075650885,0.0011531909,0.0011684496,0.0007045033,0.0005915133,0.0008719039,0.0011065671,0.0016729303,0.0024982411],"category_scores_gemma":[0.0015535968,0.00050838763,0.00074386346,0.000972828,0.00041568733,0.00069232425,0.00094802404,0.0010916382,0.00058871927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044157572,0.00004629598,0.00032809193,0.0000765229,0.0000278214,0.000059271886,0.000051213763,0.9419897,0.0012251887,0.004335568,0.0018190584,0.049997166],"study_design_scores_gemma":[0.000011646006,0.000020248679,0.00004087581,0.0000048450183,0.0000038983794,0.0000099299705,0.000005955009,0.99828374,0.00016762357,0.0007205245,0.0007281663,0.000002610291],"about_ca_topic_score_codex":0.005862439,"about_ca_topic_score_gemma":0.003795786,"teacher_disagreement_score":0.005862439,"about_ca_system_score_codex":0.00049331994,"about_ca_system_score_gemma":0.0012510498,"threshold_uncertainty_score":0.011656642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020796515,0.0002744581,0.97665375,0.000048654427,0.000015018861,0.00010096586,0.000052726515,0.00028162016,0.0017762808],"genre_scores_gemma":[0.20908889,0.00039671146,0.7868793,0.00001939762,0.000010264302,0.00021600159,0.00012894378,0.00007745335,0.003183006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974805,0.0000772146,0.000007667916,0.000042223204,0.00008740396,0.000037522343],"domain_scores_gemma":[0.9997383,0.00015762655,0.000039468807,0.000014033873,0.000036485202,0.000014145103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004921957,0.00081705366,0.0005691851,0.00081894547,0.0004632039,0.00046157988,0.00067110575,0.0007999082,0.002423731],"category_scores_gemma":[0.001143449,0.00075790624,0.00058974506,0.0007148805,0.00059903896,0.0006166997,0.00050358585,0.0005368272,0.00027984628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004577812,0.000022390703,0.00017994431,0.00008306844,0.000012170179,0.000047159978,0.00006711669,0.9568993,0.0025767563,0.0040593836,0.0003883472,0.035618633],"study_design_scores_gemma":[0.000024412642,0.00008366351,0.00018232988,0.000011516813,0.000007449768,0.000043377742,0.000033342167,0.9916841,0.0018092082,0.004541065,0.0015666496,0.000012905035],"about_ca_topic_score_codex":0.008594533,"about_ca_topic_score_gemma":0.008171798,"teacher_disagreement_score":0.008594533,"about_ca_system_score_codex":0.0008124711,"about_ca_system_score_gemma":0.001535815,"threshold_uncertainty_score":0.01708901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045090364,0.0007008208,0.91673684,0.0006003314,0.00036791438,0.00020374374,0.0023229995,0.024334487,0.050223842],"genre_scores_gemma":[0.085454516,0.0013870358,0.8279425,0.0012249149,0.00017983279,0.00064978655,0.009121778,0.008724351,0.065315224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988715,0.00016840505,0.000069265916,0.0002820402,0.00045072855,0.00015801431],"domain_scores_gemma":[0.99912745,0.00023319057,0.0000565692,0.00034810088,0.00015854817,0.00007617316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095474307,0.0015867068,0.0010737149,0.00081896305,0.00090081996,0.002976522,0.003488589,0.0019895402,0.06096582],"category_scores_gemma":[0.0028916358,0.00077375316,0.001563173,0.0011106102,0.0008271064,0.0029869415,0.0044237683,0.0022151268,0.031439893],"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.00044312683,0.00025745522,0.0016205475,0.001022123,0.00013431036,0.000511664,0.00021326006,0.10157268,0.014838545,0.15064035,0.25518838,0.47355756],"study_design_scores_gemma":[0.00010759427,0.00017701443,0.0004510468,0.000097964206,0.00004645608,0.0009402756,0.00011702684,0.37551534,0.01748551,0.1177259,0.48726398,0.00007182767],"about_ca_topic_score_codex":0.0009638729,"about_ca_topic_score_gemma":0.0019637893,"teacher_disagreement_score":0.06096582,"about_ca_system_score_codex":0.00075675984,"about_ca_system_score_gemma":0.0012708658,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0211184,0.0013389394,0.9578114,0.00073009555,0.00026104407,0.00029050087,0.0007497905,0.0005278437,0.017171916],"genre_scores_gemma":[0.20168608,0.0026543287,0.7758955,0.00053860375,0.00067552185,0.0007555528,0.0036246825,0.000506233,0.013663536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987583,0.0003869453,0.00006636889,0.00026777698,0.0003565855,0.00016400756],"domain_scores_gemma":[0.99843687,0.0010488238,0.00016291796,0.00013089366,0.00013502252,0.00008552845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014064354,0.002259715,0.0014040192,0.0012230346,0.0006925275,0.0019781468,0.0015943295,0.0015201675,0.008370208],"category_scores_gemma":[0.004393619,0.00095173233,0.0015016348,0.002223644,0.0011555051,0.0024217626,0.0011238358,0.0036551426,0.001361046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032783792,0.00025434312,0.0007323216,0.00063166354,0.00013649595,0.0002578811,0.00023437924,0.70143867,0.0040702405,0.15209474,0.01922137,0.120600045],"study_design_scores_gemma":[0.00010649021,0.00020869843,0.0005270154,0.00007610504,0.0000611221,0.00019825422,0.000094369665,0.80694497,0.002100391,0.16944946,0.020201711,0.000031370768],"about_ca_topic_score_codex":0.0021614826,"about_ca_topic_score_gemma":0.0017863163,"teacher_disagreement_score":0.008370208,"about_ca_system_score_codex":0.0012883561,"about_ca_system_score_gemma":0.0010218424,"threshold_uncertainty_score":0.02800119},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32050717,0.0032356752,0.5852225,0.00194232,0.0006694029,0.0002137258,0.0013026732,0.0002860829,0.086620465],"genre_scores_gemma":[0.8242069,0.0017482594,0.14598918,0.0004017198,0.00031398566,0.00020870444,0.00086401,0.00018128702,0.026085982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995653,0.00017952407,0.000016437403,0.00009937671,0.00008089037,0.000058458118],"domain_scores_gemma":[0.9989479,0.00051444257,0.00017074187,0.00009977899,0.00009449516,0.00017261486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345861,0.0008090957,0.0010555042,0.0009440032,0.0006643257,0.0015632608,0.0009586009,0.0012524059,0.005716863],"category_scores_gemma":[0.0033826258,0.0006459391,0.0005978916,0.0018614171,0.001421472,0.0019930843,0.0011777978,0.0011313229,0.00064181903],"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.0015486783,0.00012783165,0.0010664979,0.0005752065,0.000084084815,0.00061568216,0.00016247563,0.18585873,0.0063040922,0.71845275,0.016922591,0.06828134],"study_design_scores_gemma":[0.00013391288,0.0002142836,0.00110797,0.00006431114,0.00003158014,0.0006427205,0.00024401995,0.27809447,0.0036609434,0.70506,0.010685308,0.00006052943],"about_ca_topic_score_codex":0.0008155738,"about_ca_topic_score_gemma":0.0007716274,"teacher_disagreement_score":0.005716863,"about_ca_system_score_codex":0.00044403362,"about_ca_system_score_gemma":0.0005266382,"threshold_uncertainty_score":0.019124806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018504996,0.00094413734,0.9680949,0.0003080045,0.00016539458,0.00018307302,0.00022282865,0.0017973464,0.009779322],"genre_scores_gemma":[0.090557426,0.00037560888,0.9043323,0.00016558808,0.00006257151,0.0003196162,0.00039262432,0.00029387503,0.0035003538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.00026013318,0.000023025555,0.000065715925,0.00016863659,0.00007022281],"domain_scores_gemma":[0.9989563,0.0006650622,0.000055205386,0.00011144798,0.00017420776,0.00003764752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595522,0.00088342157,0.0012221279,0.0014899897,0.0009352432,0.0010839212,0.0013890556,0.0019166187,0.0100404415],"category_scores_gemma":[0.0037861916,0.00082845165,0.00093818794,0.0028070002,0.0006403261,0.0012078437,0.0009868075,0.0012932707,0.001962089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025455368,0.00017566993,0.00037503173,0.0001834627,0.00006524965,0.0000760546,0.00010657806,0.50386333,0.0033028184,0.016509984,0.011482627,0.46360463],"study_design_scores_gemma":[0.00009482011,0.000099157995,0.00013467262,0.000028134848,0.000023643435,0.00005616534,0.000022099077,0.98397344,0.000722438,0.01005506,0.0047754813,0.000014806539],"about_ca_topic_score_codex":0.0046193884,"about_ca_topic_score_gemma":0.0041772383,"teacher_disagreement_score":0.0100404415,"about_ca_system_score_codex":0.00089344435,"about_ca_system_score_gemma":0.0013858944,"threshold_uncertainty_score":0.03358859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43420357,0.00058788306,0.5614614,0.00007022143,0.000037043425,0.00006317551,0.000023622659,0.00020296294,0.003350093],"genre_scores_gemma":[0.94902545,0.00012210585,0.049949206,0.000012793319,0.000005842268,0.00002217514,0.000023502658,0.000022237617,0.00081654807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965966,0.000096784206,0.00001678414,0.000057247773,0.000106052124,0.00006349297],"domain_scores_gemma":[0.9994765,0.00026642712,0.00010861242,0.000046528305,0.00007225404,0.000029683837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085319934,0.00039824325,0.0006591213,0.00043838477,0.00028637997,0.00047959475,0.00047681076,0.00031582388,0.00072609505],"category_scores_gemma":[0.0012140996,0.00031373906,0.00021506975,0.0004965977,0.00064740784,0.00049317535,0.00034028414,0.00022692088,0.0000897916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002901022,0.00006107025,0.0005109557,0.000050462568,0.000011580982,0.000043961332,0.000038208218,0.96125764,0.011112517,0.0020008406,0.00015815736,0.024464557],"study_design_scores_gemma":[0.000034484863,0.00026518886,0.0005099987,0.0000063291623,0.000010822094,0.000025094492,0.00001952567,0.98734736,0.009654203,0.0015651904,0.00055132515,0.000010513258],"about_ca_topic_score_codex":0.0020993792,"about_ca_topic_score_gemma":0.0014704305,"teacher_disagreement_score":0.0020993792,"about_ca_system_score_codex":0.000515138,"about_ca_system_score_gemma":0.0003951269,"threshold_uncertainty_score":0.004512191},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03861296,0.0009258963,0.9137922,0.002473542,0.00030031402,0.0008888613,0.0011993375,0.009262518,0.032544408],"genre_scores_gemma":[0.10469173,0.00031491253,0.88295335,0.0005816348,0.00013119116,0.0005543914,0.0015297767,0.00094462367,0.008298407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978211,0.0003220219,0.00014789822,0.0007393116,0.00048493865,0.00048478742],"domain_scores_gemma":[0.9980135,0.0010095865,0.00026171163,0.00041860662,0.00016512054,0.00013137415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017664109,0.0022154662,0.0017938253,0.0011253796,0.0015057864,0.0034300897,0.0043990538,0.003233837,0.015737073],"category_scores_gemma":[0.0044365698,0.0011651175,0.0018095676,0.0028454007,0.0013059668,0.0054807765,0.0021762922,0.003459499,0.0056284796],"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.0014228137,0.0012044717,0.0015374765,0.0012517221,0.00016834142,0.00022833161,0.0003693711,0.14839722,0.023521641,0.05210627,0.06312743,0.7066649],"study_design_scores_gemma":[0.0018379306,0.0008075308,0.0018089815,0.0001649739,0.00022072223,0.0010464547,0.00028872024,0.8026857,0.018606056,0.14141591,0.030970583,0.00014653477],"about_ca_topic_score_codex":0.005962049,"about_ca_topic_score_gemma":0.00787857,"teacher_disagreement_score":0.015737073,"about_ca_system_score_codex":0.0044607352,"about_ca_system_score_gemma":0.0056785815,"threshold_uncertainty_score":0.052645802},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027823048,0.00023947618,0.9900568,0.000112880436,0.000067669665,0.000113325375,0.00012495262,0.000980805,0.0055217263],"genre_scores_gemma":[0.03285536,0.00028080845,0.9631874,0.00007668893,0.00004275128,0.00024708037,0.00043768983,0.00023885102,0.0026332904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886703,0.0001701984,0.000063368076,0.0002444988,0.00045574564,0.00019930342],"domain_scores_gemma":[0.99886286,0.00054176163,0.000098956414,0.00024262979,0.0002028762,0.000050934654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008693463,0.0016137571,0.0016338362,0.0013297562,0.0010985667,0.001943482,0.002289491,0.0019315521,0.0158427],"category_scores_gemma":[0.003620997,0.0008431576,0.0012136098,0.0024977396,0.00071779714,0.002710652,0.0021250348,0.0021760913,0.004105035],"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.00015033365,0.00029283267,0.0004421981,0.0004313394,0.000056491852,0.0001693711,0.00016491613,0.40069962,0.0037302393,0.04997978,0.0151272565,0.5287556],"study_design_scores_gemma":[0.00009701132,0.00007266803,0.0001605619,0.00003852453,0.000018734592,0.00017181349,0.000059285827,0.952698,0.0012655323,0.03561534,0.009780212,0.000022203687],"about_ca_topic_score_codex":0.0052551934,"about_ca_topic_score_gemma":0.006629647,"teacher_disagreement_score":0.0158427,"about_ca_system_score_codex":0.0014167238,"about_ca_system_score_gemma":0.003009665,"threshold_uncertainty_score":0.05299914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29458106,0.003084448,0.69137937,0.0009199819,0.0001273917,0.00018611297,0.00026266847,0.00030823264,0.009150792],"genre_scores_gemma":[0.77033067,0.0007751132,0.22200674,0.000103785125,0.000089993526,0.0002570684,0.00035109953,0.00007736663,0.0060081547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950004,0.00028804966,0.00001694498,0.00007375854,0.000073700954,0.00004749474],"domain_scores_gemma":[0.9984981,0.0012447116,0.00010373471,0.00002701801,0.00006304171,0.00006340305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011971468,0.00064981374,0.0015600518,0.0007917639,0.00061287347,0.00074144127,0.0010286097,0.0010033533,0.0023848335],"category_scores_gemma":[0.0030225224,0.0005580473,0.0006177265,0.0008468554,0.0004590928,0.0012364732,0.0006758554,0.00066580763,0.00023676525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008419151,0.00007951753,0.00035226767,0.000054289063,0.000037739806,0.00006328141,0.000025863492,0.9792987,0.00025594875,0.006528934,0.0009214941,0.012297836],"study_design_scores_gemma":[0.000015000715,0.000030221527,0.000058004556,0.0000035123326,0.0000052873543,0.00000912629,0.000010266356,0.99728453,0.00006514908,0.002310686,0.0002058139,0.0000024838187],"about_ca_topic_score_codex":0.005856001,"about_ca_topic_score_gemma":0.0047717947,"teacher_disagreement_score":0.005856001,"about_ca_system_score_codex":0.0009148699,"about_ca_system_score_gemma":0.00072515913,"threshold_uncertainty_score":0.011643827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08719852,0.0009763129,0.903773,0.00035481114,0.000038040078,0.000039073937,0.0001483233,0.00026082987,0.0072110146],"genre_scores_gemma":[0.9727366,0.0005327556,0.023094203,0.000033108317,0.000032784443,0.000092515766,0.00010609787,0.000048514314,0.0033233478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994017,0.00022185424,0.000022967453,0.00009236063,0.00016179337,0.000099349636],"domain_scores_gemma":[0.9992957,0.0004131916,0.00016903647,0.00003121078,0.000059649094,0.000031171985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007695789,0.0008082538,0.00080032536,0.00067587185,0.00029665572,0.0008881476,0.0006753445,0.0009089035,0.0011931288],"category_scores_gemma":[0.0018471393,0.000570785,0.00080237444,0.000565228,0.00079897774,0.0007094486,0.0005755002,0.0005591646,0.0002005711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072797684,0.000003392294,0.00006885169,0.0000075069433,0.0000042048496,0.000011839863,0.000004100357,0.9966169,0.00021738942,0.0023521446,0.00003155072,0.0006749394],"study_design_scores_gemma":[0.0000023961798,0.0000063870407,0.00007855329,0.0000015097103,0.0000016988851,0.000004278592,0.0000021454691,0.9979121,0.0000913993,0.0018079873,0.00008992533,0.0000016204398],"about_ca_topic_score_codex":0.005563297,"about_ca_topic_score_gemma":0.002266235,"teacher_disagreement_score":0.005563297,"about_ca_system_score_codex":0.0010475741,"about_ca_system_score_gemma":0.0006260701,"threshold_uncertainty_score":0.011061788},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005236993,0.00019346573,0.9852716,0.00040201272,0.00004665647,0.000067536836,0.000026219472,0.00006672264,0.008688851],"genre_scores_gemma":[0.2534559,0.0011293173,0.7349699,0.00039878886,0.00036242057,0.0006482477,0.00023277992,0.000104382285,0.00869818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770963,0.00077395845,0.00012054545,0.0004660852,0.000674064,0.00025568457],"domain_scores_gemma":[0.9986259,0.0005915911,0.00017406195,0.0002811591,0.00022711053,0.00010023841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019930038,0.001017375,0.00093747675,0.0015449264,0.002268387,0.0025232488,0.0022412615,0.0019383924,0.0038679044],"category_scores_gemma":[0.004170395,0.00047551785,0.0015822644,0.001839687,0.0042129224,0.0049218056,0.002284099,0.0021692934,0.0006083104],"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.0000113622145,0.000032772663,0.00020562005,0.0000785751,0.000015045973,0.000045467714,0.00013750006,0.055449024,0.00044447996,0.92810607,0.0014065308,0.014067609],"study_design_scores_gemma":[0.000016316024,0.000043424003,0.00016991928,0.000028764975,0.000016744541,0.00010617196,0.00009291046,0.26868337,0.0005205352,0.71862924,0.011668597,0.000023988583],"about_ca_topic_score_codex":0.002019427,"about_ca_topic_score_gemma":0.0019673908,"teacher_disagreement_score":0.0038679044,"about_ca_system_score_codex":0.00216084,"about_ca_system_score_gemma":0.00203224,"threshold_uncertainty_score":0.015678108},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3387148,0.0008036046,0.6520357,0.00023090513,0.000021839895,0.000053657648,0.00020991758,0.00048678162,0.0074427705],"genre_scores_gemma":[0.87118715,0.00033398942,0.12547731,0.00002419335,0.000011260302,0.000056477253,0.00012935764,0.00009680478,0.0026834602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998105,0.000054443102,0.000007116382,0.00004645773,0.0000402362,0.000041137806],"domain_scores_gemma":[0.9991472,0.00055999006,0.00014173168,0.000042080042,0.00007313018,0.000035885376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062557735,0.0004967852,0.00066416716,0.00058404787,0.0002788547,0.0006364444,0.00036108439,0.00065822364,0.0016309625],"category_scores_gemma":[0.0020009,0.00058616226,0.00032360273,0.0005860947,0.00051561696,0.0007147282,0.00027517418,0.00041607328,0.00019021897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039719336,0.0000238913,0.00040812124,0.000029362063,0.0000064339984,0.000025432448,0.000012448662,0.98466575,0.0025591957,0.0029095407,0.00023289112,0.009087127],"study_design_scores_gemma":[0.000006415043,0.00003425269,0.00027192733,0.00000409373,0.000004674576,0.000014462342,0.000011471245,0.99570304,0.0019487406,0.0018285995,0.00016785852,0.000004488513],"about_ca_topic_score_codex":0.0018329576,"about_ca_topic_score_gemma":0.003320813,"teacher_disagreement_score":0.0018329576,"about_ca_system_score_codex":0.0007689657,"about_ca_system_score_gemma":0.00085183984,"threshold_uncertainty_score":0.005579233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1014343,0.008002448,0.68761647,0.0031098407,0.0012733132,0.00025516146,0.0006332402,0.0007307888,0.19694452],"genre_scores_gemma":[0.48028684,0.006943099,0.42927793,0.0010165436,0.0012946841,0.00064037106,0.0013761837,0.00080206775,0.07836225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979048,0.0005151758,0.00011706944,0.00027679311,0.0008773529,0.00030889522],"domain_scores_gemma":[0.99715,0.0017036607,0.00022418355,0.0003373742,0.00038860543,0.00019621052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018567566,0.0016076441,0.0023434388,0.005062032,0.0025083811,0.004723242,0.0042643775,0.002672692,0.013803645],"category_scores_gemma":[0.010260668,0.0013240529,0.0015248292,0.009234198,0.0037948252,0.008510594,0.003776827,0.005799416,0.0020562988],"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.000039916602,0.000026731606,0.00021178846,0.00008679298,0.000012176894,0.000030126324,0.000095622265,0.007000046,0.00035763544,0.95289284,0.0049227406,0.034323614],"study_design_scores_gemma":[0.000010298482,0.0000113403285,0.00013314046,0.00003787677,0.000008832084,0.000048443737,0.00004747813,0.018299488,0.0003087047,0.9770184,0.0040630572,0.000012854823],"about_ca_topic_score_codex":0.0034034683,"about_ca_topic_score_gemma":0.0038353025,"teacher_disagreement_score":0.013803645,"about_ca_system_score_codex":0.00323489,"about_ca_system_score_gemma":0.0012535773,"threshold_uncertainty_score":0.046177745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23631217,0.0015602242,0.75285625,0.0005641286,0.000046176054,0.00013482638,0.000064816195,0.00027252562,0.008188993],"genre_scores_gemma":[0.6932626,0.0014543778,0.3025371,0.00013621087,0.000020447818,0.00019860094,0.00013562382,0.000033656663,0.0022214747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.00017420737,0.000012886787,0.000034761553,0.00005711612,0.000030225912],"domain_scores_gemma":[0.99946624,0.0004287428,0.000042274147,0.000013655616,0.000038879276,0.000010268827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000680095,0.00062585593,0.00046334942,0.0006608684,0.00036733504,0.00079027296,0.00057428266,0.0010950002,0.0007272928],"category_scores_gemma":[0.0015969024,0.0003307513,0.00044475394,0.0009019155,0.00077532855,0.0004809959,0.00031709435,0.0004988891,0.00009788803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001207136,0.00001886035,0.00040890177,0.000024204031,0.000018210982,0.00004079979,0.000024305022,0.9847921,0.00034904797,0.0023059326,0.000114069444,0.011891576],"study_design_scores_gemma":[0.000018347282,0.00004594042,0.0002032813,0.000012848803,0.000016108112,0.000033003853,0.000041866224,0.9943177,0.00051638606,0.004258595,0.0005292202,0.0000066583743],"about_ca_topic_score_codex":0.014473567,"about_ca_topic_score_gemma":0.012064919,"teacher_disagreement_score":0.014473567,"about_ca_system_score_codex":0.0007659011,"about_ca_system_score_gemma":0.0012891466,"threshold_uncertainty_score":0.028778613},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01873168,0.0006096512,0.9680191,0.00028329168,0.00011146676,0.00012783406,0.00037468292,0.0042418996,0.0075003076],"genre_scores_gemma":[0.14364463,0.00041672352,0.8487215,0.000249357,0.000079821584,0.00036631926,0.0020307358,0.00037924328,0.004111729],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998448,0.00022670787,0.000102374855,0.00024136012,0.0006861541,0.00029537868],"domain_scores_gemma":[0.998684,0.00040536787,0.000099284734,0.00047725486,0.00025549097,0.000078630466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072019844,0.0012966988,0.0013901899,0.0012211686,0.00081576506,0.0016124278,0.0027134237,0.0016150299,0.008476607],"category_scores_gemma":[0.0038466419,0.0006442665,0.0010206719,0.0031507292,0.00060018647,0.0028976805,0.0028488054,0.0017648855,0.004876445],"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.0006928329,0.00043267693,0.001537479,0.0003194934,0.000081572434,0.00023136636,0.0002457216,0.27477887,0.01342481,0.031373743,0.02486122,0.65202034],"study_design_scores_gemma":[0.00007955053,0.00007708339,0.00029632362,0.000018327235,0.000015464608,0.00018594244,0.00003980522,0.9679911,0.002814027,0.022779642,0.0056829383,0.000019801768],"about_ca_topic_score_codex":0.003172841,"about_ca_topic_score_gemma":0.0027719606,"teacher_disagreement_score":0.008476607,"about_ca_system_score_codex":0.0014104942,"about_ca_system_score_gemma":0.001484572,"threshold_uncertainty_score":0.028357089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15519081,0.0012015606,0.8356767,0.0005133841,0.000057156703,0.000062703875,0.00016325078,0.00022275656,0.006911673],"genre_scores_gemma":[0.95582134,0.00064671045,0.040368285,0.000055708282,0.00003473786,0.00008112985,0.00013665545,0.00005972894,0.00279566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922276,0.0003438395,0.0000369497,0.000099006524,0.00017863508,0.000118794334],"domain_scores_gemma":[0.99886215,0.00070431223,0.00018121583,0.00006406998,0.00012022612,0.00006797384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088771654,0.0006009165,0.0009474448,0.0005879752,0.0003751835,0.0009941207,0.00056416524,0.0007148733,0.0018582668],"category_scores_gemma":[0.0026460208,0.00036921917,0.0004265271,0.00080724544,0.000627854,0.0011636029,0.00067375886,0.00061687134,0.00024555763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067167835,0.000034912744,0.00030957817,0.00006637201,0.000022234255,0.00006141271,0.000033790155,0.96989757,0.0017782979,0.016497567,0.0004234738,0.010807706],"study_design_scores_gemma":[0.000009096367,0.000044036962,0.00019992363,0.000006049637,0.0000062010895,0.000025440668,0.000016731003,0.9811786,0.00078006857,0.017191077,0.0005378619,0.000004938205],"about_ca_topic_score_codex":0.0017980987,"about_ca_topic_score_gemma":0.0008813844,"teacher_disagreement_score":0.0018582668,"about_ca_system_score_codex":0.0010051515,"about_ca_system_score_gemma":0.0004689966,"threshold_uncertainty_score":0.007292986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010407752,0.00006606267,0.99743587,0.000028218474,0.00003730288,0.00001851543,0.000004953056,0.000106902226,0.0012614042],"genre_scores_gemma":[0.036637764,0.00019855362,0.96068496,0.000038345806,0.000061082894,0.00014160029,0.000033205,0.0001681983,0.002036248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990916,0.00025315623,0.000037998845,0.000085280146,0.0004781997,0.000053731073],"domain_scores_gemma":[0.9988418,0.0006753478,0.00006193756,0.00009543738,0.00027402068,0.00005151653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018821985,0.0010576592,0.0024855435,0.0013127389,0.00066434726,0.001304224,0.0020916427,0.0018664746,0.005321627],"category_scores_gemma":[0.0037419614,0.0008432893,0.0010733206,0.0017641153,0.000902435,0.0017044896,0.0012519826,0.0025085744,0.0019909695],"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.00015807334,0.00032416772,0.00047410128,0.0002512508,0.00007777944,0.00011204118,0.00013009715,0.5493877,0.008833712,0.08633695,0.0035051527,0.35040894],"study_design_scores_gemma":[0.000014140374,0.0000319025,0.000049614595,0.000011460281,0.0000127745925,0.000027989186,0.0000043654863,0.9912144,0.00070596393,0.006167457,0.0017528195,0.0000071419504],"about_ca_topic_score_codex":0.0028713648,"about_ca_topic_score_gemma":0.0025861817,"teacher_disagreement_score":0.005321627,"about_ca_system_score_codex":0.00056675874,"about_ca_system_score_gemma":0.0014581305,"threshold_uncertainty_score":0.017802596},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11348974,0.0016649666,0.87218976,0.00047170545,0.0006493355,0.00023812945,0.00014643512,0.0010750889,0.010074832],"genre_scores_gemma":[0.55853397,0.00038924866,0.437054,0.00021487744,0.00010566088,0.0002446339,0.00022788082,0.00014504822,0.0030845995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994454,0.00017353788,0.000032672044,0.000090297086,0.00012920036,0.00012892969],"domain_scores_gemma":[0.9988223,0.0005880366,0.0001068879,0.00010750578,0.00026220086,0.00011300858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084856903,0.00087526586,0.0016078639,0.0014100027,0.0011179785,0.0012984464,0.0019816707,0.0014595836,0.004253177],"category_scores_gemma":[0.0022501296,0.00075348926,0.0007709093,0.0016311636,0.00050283567,0.0012333363,0.0011766119,0.00090425636,0.0004693063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003778272,0.00020357849,0.00056399853,0.00011082238,0.000059767714,0.00012068738,0.00003597193,0.91489327,0.0032593205,0.0030312587,0.002061062,0.07528233],"study_design_scores_gemma":[0.00004758315,0.000077299344,0.00013596454,0.0000062671043,0.000019165014,0.000024552879,0.000013564884,0.9976585,0.0004985426,0.0010847097,0.0004248197,0.000009038773],"about_ca_topic_score_codex":0.004852273,"about_ca_topic_score_gemma":0.007839649,"teacher_disagreement_score":0.004852273,"about_ca_system_score_codex":0.0009341393,"about_ca_system_score_gemma":0.0017541543,"threshold_uncertainty_score":0.014228284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007163083,0.00020640886,0.9868422,0.00018124371,0.0000298302,0.00018070471,0.00011821905,0.00033341514,0.004944866],"genre_scores_gemma":[0.37617883,0.00069016695,0.6192606,0.00012370106,0.00006551619,0.0010203712,0.00040062924,0.00018845042,0.0020716672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983144,0.0010128625,0.000085612126,0.000103425235,0.00035957978,0.00012423651],"domain_scores_gemma":[0.9989114,0.0006631248,0.00012607362,0.00009251802,0.00014903944,0.0000577353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030601986,0.0013663579,0.0013677186,0.0013920558,0.00066080823,0.0015537211,0.0014232824,0.0010611351,0.0029292584],"category_scores_gemma":[0.0031295428,0.0006514917,0.0013469318,0.00077965576,0.0013985124,0.0008372543,0.0011815007,0.0013930133,0.00031401555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011432481,0.000023184017,0.00008044649,0.000017231363,0.0000141372775,0.000012140312,0.000009181353,0.984109,0.00034003,0.013198868,0.0000945277,0.0020898716],"study_design_scores_gemma":[0.000008615512,0.000009237711,0.000026753056,0.0000072293724,0.0000040533732,0.0000029141693,0.0000038967714,0.9951578,0.00019175946,0.003939411,0.00064466597,0.000003659198],"about_ca_topic_score_codex":0.015057685,"about_ca_topic_score_gemma":0.007888103,"teacher_disagreement_score":0.015057685,"about_ca_system_score_codex":0.0023322739,"about_ca_system_score_gemma":0.0033798218,"threshold_uncertainty_score":0.029940069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048683785,0.0006344042,0.94137293,0.00023064765,0.0001375845,0.0002122853,0.00005338733,0.0010032417,0.00767174],"genre_scores_gemma":[0.47179332,0.0003004557,0.52049905,0.0002078399,0.000093426235,0.00052068837,0.00016949169,0.000312912,0.006102719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991986,0.0002933149,0.0000353388,0.00009765222,0.00024672307,0.00012837867],"domain_scores_gemma":[0.9981521,0.0011649957,0.0001505564,0.00010787265,0.00030688586,0.00011765815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017629536,0.0009493311,0.0021603166,0.0013158858,0.0007437507,0.0010386657,0.002960289,0.0020388812,0.004360852],"category_scores_gemma":[0.0038576312,0.0009281916,0.0012351783,0.0011585652,0.0009554497,0.0014243285,0.0013875245,0.0012678528,0.00062214094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001758391,0.00017631683,0.00029008166,0.0001102479,0.000052251984,0.00011918503,0.00011340559,0.9292717,0.0015485821,0.0053570466,0.0016313882,0.061154],"study_design_scores_gemma":[0.000028616481,0.00005005627,0.000043303775,0.000007801436,0.0000136988965,0.000013641299,0.000012492009,0.99839455,0.0002475597,0.00087529776,0.0003063565,0.0000065602644],"about_ca_topic_score_codex":0.006750838,"about_ca_topic_score_gemma":0.0067053433,"teacher_disagreement_score":0.006750838,"about_ca_system_score_codex":0.0012866197,"about_ca_system_score_gemma":0.00171868,"threshold_uncertainty_score":0.014588535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113594525,0.000375179,0.88021994,0.00009686001,0.000027592096,0.000052216685,0.00010781448,0.00053257897,0.00499333],"genre_scores_gemma":[0.5413955,0.00020388562,0.45297426,0.000038475606,0.00002439278,0.00010724915,0.00029138164,0.00016244334,0.0048024342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997485,0.000065034896,0.000010937337,0.00007198774,0.000068351124,0.000035130328],"domain_scores_gemma":[0.9995945,0.0002573609,0.00004753013,0.00003519738,0.000043153283,0.000022271359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057373854,0.0007086401,0.00088360434,0.0005210581,0.0003727045,0.0005742687,0.00052451936,0.0008186236,0.003362927],"category_scores_gemma":[0.0011412253,0.0005960708,0.00042497495,0.00064669526,0.00051397487,0.00087986863,0.00069266086,0.0006430301,0.00044428426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010985084,0.00005192075,0.00061318156,0.00006172142,0.000021961598,0.000059217935,0.000034345412,0.9213726,0.007431487,0.008689548,0.00082519406,0.060729023],"study_design_scores_gemma":[0.000010321886,0.000053026746,0.000133874,0.000002334962,0.0000046439895,0.000016260085,0.000008104756,0.99256355,0.003230899,0.0034023612,0.00057088886,0.0000038388794],"about_ca_topic_score_codex":0.0007142928,"about_ca_topic_score_gemma":0.00080934045,"teacher_disagreement_score":0.003362927,"about_ca_system_score_codex":0.00045813536,"about_ca_system_score_gemma":0.00051300746,"threshold_uncertainty_score":0.011250079},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016438187,0.00017151443,0.99441767,0.00008005265,0.000048796464,0.000030236759,0.000071640025,0.00012107641,0.0034152213],"genre_scores_gemma":[0.11979194,0.0008744735,0.8598048,0.00014735533,0.00017342181,0.00031500144,0.00054070295,0.0002946629,0.018057618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.00014786003,0.000035532736,0.000076225355,0.0003537782,0.00007677281],"domain_scores_gemma":[0.9992506,0.0003044072,0.000037882084,0.00011987071,0.0002633091,0.000023941013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008616725,0.00092932524,0.0008974877,0.0007367981,0.00041813927,0.0017837231,0.0016858235,0.00091747864,0.012250538],"category_scores_gemma":[0.0025143344,0.00041439652,0.00072028494,0.0012815673,0.0006888204,0.0016244495,0.0011826616,0.001251209,0.0030142358],"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.00011139338,0.000059797465,0.00038481088,0.00032451397,0.000037873782,0.00029599987,0.00011611581,0.67264116,0.0042895875,0.2241246,0.010612544,0.087001696],"study_design_scores_gemma":[0.0000054288685,0.00001659019,0.000034336645,0.000009377113,0.0000034171921,0.000051107567,0.00001578655,0.9775354,0.0011019529,0.017573237,0.0036481312,0.000005174525],"about_ca_topic_score_codex":0.00268925,"about_ca_topic_score_gemma":0.0030947279,"teacher_disagreement_score":0.012250538,"about_ca_system_score_codex":0.0007098666,"about_ca_system_score_gemma":0.00097407395,"threshold_uncertainty_score":0.040982127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044532385,0.00092670793,0.9336464,0.000800242,0.00019590427,0.00024793073,0.0008302216,0.0046050902,0.014215139],"genre_scores_gemma":[0.38004234,0.0006543436,0.6052738,0.00051139103,0.00024545632,0.00046563792,0.001825466,0.0007809321,0.010200623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964709,0.00066356314,0.00017834372,0.00061184895,0.0013141372,0.00076123833],"domain_scores_gemma":[0.99419594,0.0020357235,0.00026126957,0.0027432109,0.00047960717,0.00028424227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020600243,0.0014084412,0.00211787,0.0013717049,0.0013890754,0.0034444178,0.0040979884,0.00183038,0.010839032],"category_scores_gemma":[0.010540796,0.0008319225,0.0012893951,0.0041304477,0.0013047433,0.0069235633,0.0053626653,0.0031079445,0.00275473],"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.0029932181,0.0006760439,0.0014989951,0.00052790774,0.00013517254,0.00013254012,0.00049836753,0.26855156,0.018193275,0.13534965,0.035305105,0.5361381],"study_design_scores_gemma":[0.00013957688,0.00010341605,0.00031458272,0.000027217531,0.000056654626,0.000115254144,0.000055454544,0.908615,0.0031156554,0.08278948,0.0046441928,0.00002353613],"about_ca_topic_score_codex":0.0057180393,"about_ca_topic_score_gemma":0.0081649525,"teacher_disagreement_score":0.010839032,"about_ca_system_score_codex":0.004384103,"about_ca_system_score_gemma":0.0038840023,"threshold_uncertainty_score":0.036260247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10352047,0.0015198394,0.8697523,0.00044472463,0.00036230273,0.00034916957,0.00054649735,0.0027273633,0.02077738],"genre_scores_gemma":[0.49776012,0.00065763725,0.48929772,0.00037720223,0.00009760531,0.00039792727,0.0010798834,0.0004356091,0.009896234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997644,0.000060819344,0.000007860088,0.000026703774,0.00006831004,0.00007198415],"domain_scores_gemma":[0.9996019,0.00020355229,0.00003492856,0.00003928888,0.00007771939,0.00004270498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026044753,0.0009967478,0.0011845755,0.00096771034,0.00072466925,0.00083001546,0.0013588986,0.0010460025,0.008436639],"category_scores_gemma":[0.00065132376,0.0005855363,0.00073704426,0.001582852,0.0004956479,0.0006292114,0.00083862006,0.00096965954,0.0009256472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002613753,0.00025547767,0.00038556795,0.00019821736,0.000042730408,0.00022540428,0.00006275808,0.8126924,0.0067158397,0.0046429825,0.011145273,0.16337186],"study_design_scores_gemma":[0.00003621476,0.00006630947,0.00015339947,0.000010127638,0.00001351204,0.00004387836,0.000020210657,0.9951898,0.001384244,0.0018664034,0.0012030867,0.000012750104],"about_ca_topic_score_codex":0.008038118,"about_ca_topic_score_gemma":0.010490323,"teacher_disagreement_score":0.008436639,"about_ca_system_score_codex":0.0007058239,"about_ca_system_score_gemma":0.0010717823,"threshold_uncertainty_score":0.028223395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010042633,0.0000640836,0.98820645,0.00004560984,0.00001144199,0.000036840534,0.000028446879,0.00020044898,0.0013641401],"genre_scores_gemma":[0.22255006,0.00018291744,0.7741972,0.000036164212,0.000012912516,0.0002494348,0.00013802989,0.000113536946,0.0025196588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998678,0.000023234441,0.000007941631,0.000037476017,0.000042302552,0.00002111698],"domain_scores_gemma":[0.9997857,0.00011278204,0.000024471748,0.000020895854,0.000039434257,0.000016739737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025798057,0.0007169084,0.00056544464,0.00048100488,0.00038338624,0.00052088924,0.000750093,0.00063868874,0.0031297156],"category_scores_gemma":[0.0007044422,0.0005076235,0.00058138947,0.000468162,0.0005121649,0.0006006334,0.0007323777,0.0007850216,0.0002664883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008312893,0.000040409737,0.00042632798,0.00012766721,0.00001476179,0.00008492548,0.00010831887,0.9186323,0.008506174,0.012409017,0.0012644698,0.058302492],"study_design_scores_gemma":[0.000009624407,0.00003034214,0.000047777154,0.000003524585,0.0000030132685,0.000021461963,0.000011736724,0.99654347,0.0009271343,0.0014102665,0.0009870263,0.000004630652],"about_ca_topic_score_codex":0.004108265,"about_ca_topic_score_gemma":0.0039750854,"teacher_disagreement_score":0.004108265,"about_ca_system_score_codex":0.00046550427,"about_ca_system_score_gemma":0.001176854,"threshold_uncertainty_score":0.010469973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056647654,0.0019648438,0.9802018,0.00068465364,0.00017005877,0.00008492473,0.00014584835,0.00036533948,0.010717744],"genre_scores_gemma":[0.18433067,0.00363727,0.78646606,0.0005059,0.00069817266,0.0007694121,0.00083037926,0.00060897216,0.022153195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983772,0.00077682117,0.00006408323,0.00025900573,0.000369768,0.00015319115],"domain_scores_gemma":[0.99416006,0.0045294724,0.0003067767,0.00049519277,0.00033436943,0.00017420216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002948772,0.0025352922,0.002958011,0.0021859903,0.0015505139,0.0035377198,0.0032987923,0.0035903412,0.012237585],"category_scores_gemma":[0.012869344,0.0014731074,0.0019353633,0.0043373257,0.0020279228,0.006600272,0.00304707,0.005000092,0.0022826912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014349511,0.0002767484,0.00069850584,0.00034445513,0.00013274926,0.000041149968,0.00011862539,0.50065935,0.00050160126,0.32469627,0.017374419,0.15501273],"study_design_scores_gemma":[0.000040658935,0.000020714928,0.000097867895,0.000024468512,0.000019106667,0.000020880523,0.000017786018,0.7134418,0.00014837798,0.2830796,0.0030788293,0.000009867551],"about_ca_topic_score_codex":0.0027077186,"about_ca_topic_score_gemma":0.0031970902,"teacher_disagreement_score":0.012237585,"about_ca_system_score_codex":0.0024499996,"about_ca_system_score_gemma":0.0018735541,"threshold_uncertainty_score":0.040938795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16292106,0.00416053,0.8096317,0.00060256023,0.0001910787,0.000091942624,0.00013706415,0.00049987505,0.021764262],"genre_scores_gemma":[0.6680851,0.0015607924,0.3245576,0.000111094036,0.000114584036,0.00021861793,0.00020605016,0.00032300488,0.0048230966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991973,0.0004043184,0.000030123269,0.00008670658,0.00020726149,0.000074267475],"domain_scores_gemma":[0.99321544,0.005539591,0.00027131368,0.00035189695,0.00051453995,0.00010732122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022886884,0.0014966212,0.0021599045,0.0015517842,0.0010092922,0.0015306883,0.0010099192,0.0029735535,0.0040430822],"category_scores_gemma":[0.008170557,0.0008286542,0.0011387717,0.003175569,0.0016606174,0.0021359723,0.0011860755,0.0013944043,0.000452593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001074314,0.0000622254,0.00024362997,0.00011549517,0.000021593034,0.000026137315,0.00006429801,0.96747535,0.00069093326,0.009277369,0.0008670857,0.0210484],"study_design_scores_gemma":[0.000011828113,0.000028740247,0.000079147736,0.0000055574988,0.000007055618,0.000009645873,0.000014179908,0.9957048,0.00049989525,0.003373653,0.00026018205,0.000005212161],"about_ca_topic_score_codex":0.0049283137,"about_ca_topic_score_gemma":0.0030956783,"teacher_disagreement_score":0.0049283137,"about_ca_system_score_codex":0.0008151306,"about_ca_system_score_gemma":0.00075088156,"threshold_uncertainty_score":0.013525426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16805014,0.005808266,0.75085175,0.005760178,0.0005690313,0.00019059177,0.001046431,0.0003147807,0.06740885],"genre_scores_gemma":[0.8382918,0.0045447787,0.14170502,0.0009393593,0.00092398847,0.00039874332,0.0011728625,0.000583769,0.011439669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964766,0.0013679703,0.00017434784,0.0004679738,0.00092767924,0.00058542826],"domain_scores_gemma":[0.9789464,0.017059851,0.0012972085,0.00089600426,0.0010942039,0.00070643343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005183872,0.0015532544,0.0028089243,0.0028574618,0.0013896166,0.004984097,0.0023951102,0.002996428,0.010018743],"category_scores_gemma":[0.036168814,0.0014056333,0.0010727078,0.003496233,0.003508423,0.010594514,0.0039272234,0.004866849,0.00092809694],"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.0004289437,0.00022079897,0.0008255948,0.00037913542,0.000045229004,0.000099555305,0.00025660073,0.16427955,0.0015406098,0.79043233,0.009249244,0.032242343],"study_design_scores_gemma":[0.000025030487,0.000074051575,0.00040479883,0.000081628285,0.000015379917,0.00009021358,0.0001461401,0.3219482,0.0005311844,0.67434,0.0023221513,0.000021248043],"about_ca_topic_score_codex":0.0014170024,"about_ca_topic_score_gemma":0.0008102167,"teacher_disagreement_score":0.010018743,"about_ca_system_score_codex":0.0023435715,"about_ca_system_score_gemma":0.0019639127,"threshold_uncertainty_score":0.03351599},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3335925,0.00093763374,0.6552357,0.0005744483,0.000087903754,0.00014031876,0.00037974693,0.0005122207,0.0085395975],"genre_scores_gemma":[0.8600927,0.0005606652,0.13365391,0.00011117864,0.00006860396,0.000116993986,0.00046048197,0.0001455793,0.0047898535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921656,0.00037943522,0.000039826293,0.00011924387,0.000096342555,0.00014863821],"domain_scores_gemma":[0.9980003,0.0013294541,0.00021078897,0.00018451423,0.000118860335,0.00015605327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011724221,0.00078848604,0.0015000255,0.00057559536,0.00058200926,0.0011619837,0.00077873503,0.0008363999,0.0027553313],"category_scores_gemma":[0.0033017225,0.0007525198,0.00048109703,0.0017482061,0.0008326827,0.0017950133,0.0010767684,0.00078629615,0.0004448131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049054273,0.00009335336,0.0010397291,0.00013347267,0.000031280913,0.0002937907,0.00017563668,0.94710964,0.0025089898,0.025326429,0.0021844138,0.020612648],"study_design_scores_gemma":[0.000024687648,0.00007416193,0.00021013078,0.0000074972863,0.000005848667,0.000067443085,0.00007310211,0.975177,0.00077545684,0.02273325,0.00084511336,0.0000063813377],"about_ca_topic_score_codex":0.002042617,"about_ca_topic_score_gemma":0.0012676512,"teacher_disagreement_score":0.0027553313,"about_ca_system_score_codex":0.0008968898,"about_ca_system_score_gemma":0.0003956732,"threshold_uncertainty_score":0.00921756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05469687,0.005286457,0.8567971,0.0020713548,0.0009909144,0.0004174992,0.0014747513,0.0013596978,0.0769053],"genre_scores_gemma":[0.49407572,0.00442687,0.42674685,0.0006942779,0.0008728858,0.00053691707,0.004927144,0.00093655195,0.0667828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979533,0.0006140227,0.00011485767,0.00033290903,0.0005499148,0.0004350939],"domain_scores_gemma":[0.9944931,0.0033937749,0.0002694463,0.00048142,0.0010317327,0.00033051244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027097412,0.0013830608,0.0020632874,0.001754252,0.0015581627,0.003137376,0.0034392069,0.0019461366,0.024918944],"category_scores_gemma":[0.011366188,0.0012379374,0.0008500055,0.0031605077,0.00097204564,0.0051661623,0.002309172,0.003046443,0.003706441],"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.0014652851,0.0014035869,0.0014713204,0.0019925043,0.00016767453,0.00032205868,0.00023156845,0.4624974,0.004384006,0.20215143,0.07786141,0.24605174],"study_design_scores_gemma":[0.00017115573,0.00022115109,0.00051174324,0.0001107716,0.0000595896,0.00016544618,0.0001277689,0.8404853,0.003044037,0.13517863,0.019889219,0.000035260142],"about_ca_topic_score_codex":0.0036670817,"about_ca_topic_score_gemma":0.0044309474,"teacher_disagreement_score":0.024918944,"about_ca_system_score_codex":0.0014765678,"about_ca_system_score_gemma":0.0018335608,"threshold_uncertainty_score":0.08336216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84246904,0.0006339019,0.095420726,0.0008229724,0.000045431534,0.00025463078,0.0013907208,0.00015940222,0.0588032],"genre_scores_gemma":[0.9806403,0.00036322756,0.012488081,0.000027650201,0.000005697068,0.000059058242,0.00028916387,0.00002625116,0.0061005694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.00008025338,0.000009737242,0.0000428726,0.00015956623,0.00020318915],"domain_scores_gemma":[0.99967754,0.00013398648,0.00004472019,0.000014783638,0.000100648365,0.00002837377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066133874,0.00088974554,0.00053221075,0.00087392126,0.0011472267,0.0013470446,0.0011844288,0.0010474634,0.0024500776],"category_scores_gemma":[0.0011717477,0.00052602764,0.00070793513,0.0009817474,0.00086908706,0.0006224034,0.00047350643,0.0008113895,0.00015388077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013462696,0.000006416653,0.0005369466,0.000009365639,0.0000032073401,0.000034622524,0.000017216324,0.995368,0.00027782295,0.0022688704,0.00014103572,0.0013229939],"study_design_scores_gemma":[0.000007357573,0.000032908756,0.0018734053,0.0000073755014,0.000009777737,0.000016183765,0.00009571631,0.99528474,0.0005205435,0.0009859991,0.0011520799,0.00001400054],"about_ca_topic_score_codex":0.7930561,"about_ca_topic_score_gemma":0.7147457,"teacher_disagreement_score":0.9908277,"about_ca_system_score_codex":0.009172339,"about_ca_system_score_gemma":0.009752723,"threshold_uncertainty_score":0.41632527},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03447305,0.00007362868,0.95956135,0.00007338038,0.000017951283,0.000060762002,0.000106508705,0.001374959,0.0042584375],"genre_scores_gemma":[0.5440373,0.0001396431,0.44866064,0.00005087934,0.000027444725,0.00018736561,0.0004128886,0.00040269198,0.0060811033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996731,0.000075614436,0.000011415986,0.00006995167,0.00011317671,0.00005665107],"domain_scores_gemma":[0.9997212,0.00014975878,0.000034847086,0.000039894316,0.000035363657,0.000018857145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034102768,0.0006694704,0.00064254954,0.00032060378,0.00040697577,0.00080444076,0.0008821763,0.00058331486,0.0038414889],"category_scores_gemma":[0.0005959782,0.00049503695,0.0004855597,0.00037231334,0.0004690344,0.0006869318,0.0007727189,0.0006308835,0.00064103625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011234432,0.00005514538,0.00031950368,0.00008170301,0.000012212569,0.00006338943,0.00006164656,0.92099607,0.008303414,0.004536434,0.0016036173,0.06385464],"study_design_scores_gemma":[0.000009106305,0.000020441252,0.00007914935,0.0000029406795,0.0000029923658,0.000014051693,0.000010781721,0.99571866,0.0019968017,0.0011487042,0.0009927356,0.0000036548415],"about_ca_topic_score_codex":0.0039157737,"about_ca_topic_score_gemma":0.0043824427,"teacher_disagreement_score":0.0039157737,"about_ca_system_score_codex":0.00056598353,"about_ca_system_score_gemma":0.000993387,"threshold_uncertainty_score":0.012851059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037155826,0.0017243391,0.9491694,0.00023653009,0.00011760322,0.00017248662,0.00018237357,0.0005496417,0.010691804],"genre_scores_gemma":[0.44000307,0.0015235463,0.5497978,0.0002405853,0.00013075907,0.0004896565,0.00043596374,0.0005655532,0.006813139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994167,0.00028501777,0.000019049003,0.00006195738,0.00012692645,0.00009042677],"domain_scores_gemma":[0.9986658,0.0009814079,0.000081131184,0.00006272956,0.00016837937,0.00004068855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447901,0.0014551011,0.0026264475,0.0020937219,0.00089952064,0.0013578474,0.0022165077,0.0024304052,0.008702725],"category_scores_gemma":[0.003874677,0.0012597044,0.0015886372,0.0030817299,0.0011696139,0.0016995571,0.00090482295,0.0013839917,0.0009832414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006712581,0.000056865858,0.00012600898,0.00009179125,0.000033859724,0.00002327369,0.000025179454,0.9625634,0.0005127872,0.0037783901,0.00095645204,0.031764854],"study_design_scores_gemma":[0.000016744923,0.000040067287,0.000054071574,0.000009441962,0.00001203286,0.000007700398,0.000012120944,0.9963827,0.00017031284,0.0030184009,0.00027166205,0.000004719592],"about_ca_topic_score_codex":0.0073797978,"about_ca_topic_score_gemma":0.0061486806,"teacher_disagreement_score":0.008702725,"about_ca_system_score_codex":0.0008998124,"about_ca_system_score_gemma":0.0016044627,"threshold_uncertainty_score":0.029113531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.398469,0.0028705173,0.55350894,0.0025988792,0.00023241613,0.00018893964,0.00092126895,0.0011058619,0.040104147],"genre_scores_gemma":[0.83803385,0.001634519,0.14340858,0.00039365844,0.0002916126,0.00026722695,0.0019460542,0.0005875509,0.013437022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779093,0.00064565055,0.00012600777,0.0004996682,0.0005724955,0.0003653082],"domain_scores_gemma":[0.9883929,0.008762493,0.0005790044,0.0014258627,0.00040165428,0.00043805488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019558484,0.0015942545,0.0022748066,0.0017191316,0.0014435236,0.005054094,0.00395829,0.0023115308,0.01194237],"category_scores_gemma":[0.0218774,0.00135523,0.0025329804,0.0034835765,0.0026460008,0.009107812,0.0036384733,0.004384355,0.0008073232],"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.0010386104,0.00044222007,0.0037392222,0.0007373143,0.00023790845,0.0003038124,0.0009657362,0.37713253,0.0028339112,0.4941235,0.011921053,0.10652418],"study_design_scores_gemma":[0.00009205819,0.00005835102,0.00044906588,0.000058203623,0.000085127074,0.00016476477,0.00013516986,0.3776829,0.00123889,0.61683184,0.0031854475,0.000018105544],"about_ca_topic_score_codex":0.004137458,"about_ca_topic_score_gemma":0.0038995484,"teacher_disagreement_score":0.01194237,"about_ca_system_score_codex":0.0028262497,"about_ca_system_score_gemma":0.0014047506,"threshold_uncertainty_score":0.039951146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04031474,0.032973934,0.7611156,0.034046214,0.0011665619,0.00008192526,0.0002702981,0.00028303664,0.1297477],"genre_scores_gemma":[0.6578542,0.06420278,0.24337338,0.008544009,0.008399711,0.00044988465,0.0004795139,0.0005163967,0.016180107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971329,0.0016220732,0.00012657531,0.00034423592,0.0005728468,0.00020139868],"domain_scores_gemma":[0.98568195,0.012103189,0.0005644896,0.00076857454,0.00065222476,0.00022954273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040824474,0.0012399247,0.0015178582,0.003530878,0.002094905,0.0039281594,0.0023340264,0.00355912,0.00606954],"category_scores_gemma":[0.013229363,0.0007902093,0.0016263817,0.0052105566,0.007831735,0.011908466,0.0025339094,0.005200099,0.00057691825],"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.000012440257,0.000022747805,0.00015410683,0.00007434168,0.00001009574,0.000078635945,0.000073057105,0.0061689606,0.00008885679,0.9854565,0.001774494,0.006085785],"study_design_scores_gemma":[0.0000029203284,0.00000910977,0.000112349175,0.000035757123,0.0000035866224,0.000034863282,0.000029810652,0.010381944,0.00004605053,0.9870366,0.0023007852,0.0000063104358],"about_ca_topic_score_codex":0.0010281272,"about_ca_topic_score_gemma":0.00093391066,"teacher_disagreement_score":0.00606954,"about_ca_system_score_codex":0.0020368244,"about_ca_system_score_gemma":0.000623736,"threshold_uncertainty_score":0.021590292},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026502578,0.0011425456,0.94943494,0.0012449909,0.000491847,0.00029249056,0.0009138208,0.0059169666,0.014059766],"genre_scores_gemma":[0.1967231,0.0006795211,0.78462577,0.00065647764,0.00032858082,0.00056601065,0.0020123506,0.00081462396,0.013593708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643326,0.00061616325,0.00023491927,0.00066283037,0.0013854323,0.00066738744],"domain_scores_gemma":[0.99491996,0.0017038132,0.00023710166,0.0023438046,0.00047466913,0.00032071225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019147568,0.0018774834,0.0024751013,0.0017078765,0.0018226296,0.0042732204,0.0051796637,0.002339084,0.015862027],"category_scores_gemma":[0.008548597,0.0010307576,0.0017419445,0.0055373223,0.0014072373,0.007759016,0.0050911233,0.0046218033,0.005076493],"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.0031138684,0.0009014157,0.00095132325,0.00055582565,0.00014343463,0.00015842676,0.00041415382,0.158517,0.016672812,0.104562365,0.05376275,0.6602467],"study_design_scores_gemma":[0.00034722252,0.00015004534,0.0003012165,0.000035782778,0.000075509226,0.00015193265,0.000087449334,0.87611634,0.004663044,0.10750682,0.010521759,0.000042848606],"about_ca_topic_score_codex":0.007251105,"about_ca_topic_score_gemma":0.009699298,"teacher_disagreement_score":0.015862027,"about_ca_system_score_codex":0.0045591835,"about_ca_system_score_gemma":0.0041650753,"threshold_uncertainty_score":0.05306375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54882634,0.00079324556,0.43592176,0.00028137298,0.000049855953,0.000098615994,0.0001903026,0.00018701519,0.0136515815],"genre_scores_gemma":[0.8939929,0.0003635729,0.10180968,0.000043298907,0.000020790265,0.00008619807,0.00017829223,0.000046947705,0.003458382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911565,0.00032175344,0.000051322168,0.00019753208,0.00015207517,0.0001616863],"domain_scores_gemma":[0.9975914,0.0013453579,0.00043431853,0.0002968013,0.00013942046,0.00019280562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073070603,0.00062032416,0.0009987763,0.000726644,0.0007034285,0.0015280821,0.0011504118,0.0011314184,0.002794196],"category_scores_gemma":[0.0033710343,0.0004735398,0.00061933696,0.0013484611,0.0011678532,0.002257322,0.0016300372,0.00058792275,0.000296686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052228145,0.00012820473,0.0014397157,0.00025302992,0.00006154058,0.00048151592,0.00013577843,0.88754296,0.0058475602,0.07558052,0.001110664,0.026896223],"study_design_scores_gemma":[0.000044660654,0.00018167034,0.00036568943,0.000023794719,0.000021811804,0.0002576792,0.00010913851,0.96775895,0.0053651617,0.023508685,0.0023433797,0.000019508634],"about_ca_topic_score_codex":0.0020348975,"about_ca_topic_score_gemma":0.0015186187,"teacher_disagreement_score":0.002794196,"about_ca_system_score_codex":0.0006933533,"about_ca_system_score_gemma":0.00051872805,"threshold_uncertainty_score":0.009347558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24034071,0.00016844457,0.7557314,0.0003156704,0.00003752282,0.000110634595,0.00035389315,0.00091012486,0.0020316637],"genre_scores_gemma":[0.89166987,0.000071960065,0.10632459,0.00006797324,0.000022518789,0.00013217067,0.0007567412,0.00010132388,0.0008527669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991622,0.00043313336,0.00003667742,0.000119213735,0.0001431471,0.00010559173],"domain_scores_gemma":[0.99494547,0.0038050106,0.00044852606,0.00027246648,0.0003950652,0.0001334371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430839,0.00082433055,0.0009863179,0.0008167132,0.00039549803,0.0007367729,0.0010887872,0.0010032688,0.0011920325],"category_scores_gemma":[0.008848606,0.00062666164,0.0008240478,0.00074439944,0.00071526243,0.0014183592,0.00082535786,0.00084719714,0.00015462235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020268104,0.000009152992,0.00035661308,0.00000594023,0.000009539742,0.00000600356,0.000004730141,0.99672025,0.00009058326,0.0003979321,0.00008589003,0.002293098],"study_design_scores_gemma":[0.0000031239483,0.000007342333,0.000066960376,7.594931e-7,0.0000010331489,0.0000016561792,0.0000013087007,0.999443,0.000045179557,0.0004092862,0.000019332963,9.798417e-7],"about_ca_topic_score_codex":0.013153264,"about_ca_topic_score_gemma":0.0071968776,"teacher_disagreement_score":0.013153264,"about_ca_system_score_codex":0.0011248603,"about_ca_system_score_gemma":0.001669022,"threshold_uncertainty_score":0.026153386},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021812886,0.0026212502,0.94342345,0.0020371773,0.0004944394,0.00039255657,0.0008931168,0.0049096467,0.023415495],"genre_scores_gemma":[0.15293396,0.0012550562,0.82658696,0.00079128303,0.00053125067,0.0009856658,0.0029615415,0.002248863,0.011705419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948795,0.0015208694,0.0002490019,0.001220965,0.0013810272,0.0007485742],"domain_scores_gemma":[0.98545164,0.008762059,0.0007048466,0.003967794,0.000733223,0.00038034082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043165605,0.0039944914,0.0038231628,0.0030241653,0.001907723,0.006894243,0.006671759,0.004437863,0.035063565],"category_scores_gemma":[0.028365534,0.0018620357,0.0038644667,0.0072228108,0.0019794626,0.015243179,0.0043040263,0.008355937,0.0076687955],"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.001818924,0.0013066592,0.00137331,0.0011366621,0.00029839398,0.00018502805,0.00046906818,0.26613954,0.0044174735,0.18105698,0.06779418,0.4740038],"study_design_scores_gemma":[0.00058142573,0.000121071,0.0004205346,0.00009680232,0.00013408829,0.0001522207,0.00013378238,0.6659329,0.002152475,0.31685805,0.013370163,0.000046512214],"about_ca_topic_score_codex":0.0068924897,"about_ca_topic_score_gemma":0.010072023,"teacher_disagreement_score":0.035063565,"about_ca_system_score_codex":0.0048319497,"about_ca_system_score_gemma":0.0047706515,"threshold_uncertainty_score":0.11729932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007416723,0.0004912413,0.98167634,0.0001581467,0.00008243821,0.000040361556,0.00005069913,0.00007724371,0.010006782],"genre_scores_gemma":[0.34342307,0.0018470816,0.6376642,0.00026162333,0.0002549377,0.00033767475,0.00030907273,0.00016195278,0.015740389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962723,0.000080953425,0.000017660894,0.000044419987,0.00018204657,0.000047698795],"domain_scores_gemma":[0.99943143,0.00031715518,0.00003743045,0.000053471264,0.00013555655,0.000024921623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415313,0.0007354887,0.0011496498,0.0007308512,0.00048056516,0.0011764696,0.0012332588,0.0012458189,0.0047913296],"category_scores_gemma":[0.0028431057,0.00055513164,0.0006902066,0.0010969297,0.0006101775,0.0011200368,0.0011422585,0.0014927477,0.0005834945],"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.000032494914,0.00006742858,0.00021436176,0.000159221,0.00002670016,0.00007438182,0.00005456123,0.88718957,0.00096678524,0.056949563,0.0018015032,0.052463487],"study_design_scores_gemma":[0.0000059547438,0.000011142509,0.000034542663,0.000008346476,0.0000035475903,0.00001740798,0.000010661559,0.9831849,0.000112368914,0.01574713,0.0008608917,0.0000031639522],"about_ca_topic_score_codex":0.004210469,"about_ca_topic_score_gemma":0.004510546,"teacher_disagreement_score":0.0047913296,"about_ca_system_score_codex":0.00055076013,"about_ca_system_score_gemma":0.0012562549,"threshold_uncertainty_score":0.016028583},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014055882,0.5252756,0.31137368,0.0068370993,0.0018344822,0.00018490605,0.0015340805,0.0010297353,0.13787457],"genre_scores_gemma":[0.1227895,0.7118399,0.124814965,0.0011935082,0.0019231711,0.00029227542,0.0022922996,0.0004560628,0.034398288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969438,0.0005873506,0.00034063568,0.00065424974,0.0012390072,0.00023507459],"domain_scores_gemma":[0.99455464,0.0033347222,0.00044077542,0.0004999892,0.0010809989,0.00008874217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027640145,0.0017649183,0.0032197132,0.0079791695,0.0019529047,0.011625918,0.0035872413,0.0038915551,0.013859177],"category_scores_gemma":[0.007946132,0.0014798329,0.0026057765,0.02714974,0.0026985456,0.010433269,0.002122349,0.0025420117,0.0038640662],"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.0001452151,0.00022565908,0.0031298113,0.01203762,0.00024554893,0.0004116612,0.0005161508,0.07268682,0.0012284765,0.27807367,0.029140703,0.60215867],"study_design_scores_gemma":[0.000047149846,0.00018740045,0.0052474095,0.0075416733,0.0004417148,0.0019018938,0.0019492595,0.09862035,0.0036567762,0.20214811,0.6780235,0.0002347504],"about_ca_topic_score_codex":0.018863134,"about_ca_topic_score_gemma":0.01339232,"teacher_disagreement_score":0.018863134,"about_ca_system_score_codex":0.0051927515,"about_ca_system_score_gemma":0.0056767273,"threshold_uncertainty_score":0.046363592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1798373,0.000356876,0.8093465,0.0002524413,0.000067079185,0.0002009504,0.00014026163,0.00058771804,0.0092107495],"genre_scores_gemma":[0.8987494,0.00013769031,0.09626635,0.0000557377,0.000016936254,0.00009951967,0.00011566347,0.000057759615,0.0045009824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995927,0.00010813884,0.00001952952,0.00006994978,0.0001313366,0.00007830762],"domain_scores_gemma":[0.998919,0.0006732939,0.00013909079,0.000057145655,0.00015378557,0.00005778399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212701,0.00086267147,0.0010347659,0.00042894486,0.00032887512,0.00095260557,0.00085414085,0.00079378963,0.0035018027],"category_scores_gemma":[0.0021020542,0.00057962775,0.00046026445,0.00046781788,0.00042733928,0.0009428118,0.00046430845,0.0008015285,0.00031533677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009676782,0.000065840184,0.00022668023,0.00004367903,0.000010201617,0.00004530147,0.000014560336,0.97898054,0.0010717914,0.0021026875,0.00023902897,0.017102877],"study_design_scores_gemma":[0.000015189191,0.000046453264,0.00006743819,0.0000023256687,0.000003719617,0.0000060457905,0.000004405585,0.99832624,0.00049105764,0.00091606786,0.00011897514,0.0000020553139],"about_ca_topic_score_codex":0.0057388376,"about_ca_topic_score_gemma":0.0045505203,"teacher_disagreement_score":0.0057388376,"about_ca_system_score_codex":0.000853826,"about_ca_system_score_gemma":0.0012857273,"threshold_uncertainty_score":0.011714697},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019082421,0.0003519443,0.9750045,0.00016069156,0.000042981213,0.0000370705,0.000092415044,0.000079956066,0.005148153],"genre_scores_gemma":[0.43864685,0.0011233218,0.5414681,0.00019065663,0.00014168918,0.0003402183,0.000570708,0.0002568764,0.017261615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992132,0.00033001386,0.000034486133,0.000112419344,0.00021871242,0.00009110389],"domain_scores_gemma":[0.99913895,0.0005177804,0.000075974516,0.00009927949,0.00011473287,0.000053227668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540449,0.0014907271,0.0017544617,0.00048708805,0.00029878967,0.0012493958,0.00055546645,0.0009467405,0.005746009],"category_scores_gemma":[0.0028974034,0.0005579356,0.00068945286,0.00085092365,0.00097414217,0.0015178127,0.00141362,0.0011639999,0.0009350405],"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.00035329378,0.00011539077,0.00044795207,0.0005968637,0.00013009687,0.00039333993,0.0001259673,0.63861734,0.017713187,0.25176403,0.0059248437,0.08381759],"study_design_scores_gemma":[0.00002646055,0.000071297625,0.00017146283,0.00004186362,0.000018534221,0.000078575926,0.000023903245,0.9415715,0.0044580977,0.049828943,0.0036969325,0.000012487581],"about_ca_topic_score_codex":0.0009823055,"about_ca_topic_score_gemma":0.000761127,"teacher_disagreement_score":0.005746009,"about_ca_system_score_codex":0.00059765996,"about_ca_system_score_gemma":0.0006665168,"threshold_uncertainty_score":0.01922232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087331235,0.011775311,0.7400949,0.010340216,0.0015565038,0.000053043223,0.00036052056,0.00015204234,0.14833626],"genre_scores_gemma":[0.8314984,0.010705733,0.101452775,0.002768031,0.00505929,0.00016247558,0.0006326154,0.00036226853,0.04735837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836093,0.0008386272,0.000067809546,0.0002224622,0.00036391828,0.00014620178],"domain_scores_gemma":[0.99576926,0.002941518,0.00035426093,0.00038673397,0.00033003546,0.00021833721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002779673,0.0013503232,0.0020457443,0.0026038082,0.0017588197,0.003971904,0.0016907807,0.002439849,0.0072385594],"category_scores_gemma":[0.010477082,0.0009057334,0.0016145603,0.0026336184,0.0064705177,0.011004735,0.0041459543,0.0050032074,0.0006030196],"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.000007325934,0.0000071368727,0.000044308887,0.000018626906,0.0000047078192,0.000015920195,0.000034727505,0.0025655588,0.00007598216,0.99436367,0.0006682634,0.0021937732],"study_design_scores_gemma":[0.0000014394907,0.0000025549125,0.00004430793,0.0000071803897,0.0000017749607,0.00001571033,0.0000123075515,0.005935285,0.00003217978,0.9931764,0.0007674199,0.0000033728707],"about_ca_topic_score_codex":0.0011040648,"about_ca_topic_score_gemma":0.00082515174,"teacher_disagreement_score":0.0072385594,"about_ca_system_score_codex":0.0018305288,"about_ca_system_score_gemma":0.0006306977,"threshold_uncertainty_score":0.0242154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06340972,0.0009903806,0.91887516,0.0017214988,0.000121056095,0.00018834573,0.00032344306,0.00038760604,0.013982765],"genre_scores_gemma":[0.47103685,0.0012907295,0.5187557,0.0005027165,0.00019277197,0.0004629301,0.00071048475,0.00028588757,0.0067619397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983772,0.0008366063,0.000050499548,0.00028568282,0.0002555338,0.0001944963],"domain_scores_gemma":[0.9905398,0.0079663545,0.00045058824,0.00048719443,0.00035177878,0.00020430368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029280123,0.0016949574,0.0019327677,0.0011747847,0.0009382626,0.0017219352,0.0022832127,0.0022888333,0.006772333],"category_scores_gemma":[0.015646534,0.00089552475,0.0011994684,0.0018081323,0.0016281201,0.00438606,0.0018291692,0.002593191,0.0008563668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015706861,0.00012138028,0.00096885924,0.00026478007,0.00004239076,0.00008941754,0.000104422616,0.91670734,0.0006581881,0.05000369,0.0038343437,0.027048137],"study_design_scores_gemma":[0.00003574099,0.000071888026,0.00016892601,0.000031249838,0.000016602853,0.000049449685,0.000045661356,0.93277544,0.00036538334,0.064839795,0.0015913983,0.000008460601],"about_ca_topic_score_codex":0.002874374,"about_ca_topic_score_gemma":0.004074696,"teacher_disagreement_score":0.006772333,"about_ca_system_score_codex":0.002079834,"about_ca_system_score_gemma":0.0015720917,"threshold_uncertainty_score":0.022655725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027177824,0.0020848047,0.9486464,0.0015245304,0.00045432954,0.00030390715,0.0006472778,0.0034978946,0.015662907],"genre_scores_gemma":[0.26291284,0.0011113024,0.7196401,0.0007128374,0.00040377208,0.00082701904,0.0016125329,0.0010581114,0.011721452],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963427,0.0010584453,0.00021886334,0.0006538444,0.0010091052,0.00071695144],"domain_scores_gemma":[0.9900845,0.00621371,0.0005767705,0.0020501362,0.0006209143,0.000453925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025740576,0.002385174,0.003263867,0.0017095277,0.001585541,0.004327648,0.0065651913,0.003497042,0.018995324],"category_scores_gemma":[0.017234448,0.001487409,0.001909566,0.0052698506,0.0017710245,0.010301195,0.0064830147,0.0050541754,0.003919529],"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.0019912312,0.0011543453,0.0012717582,0.0009857779,0.00016699586,0.00016776213,0.00040102119,0.39695653,0.0039278083,0.12888493,0.038366254,0.4257256],"study_design_scores_gemma":[0.00015974748,0.0000977345,0.00024132193,0.000043946227,0.000038704966,0.000087265085,0.00007656183,0.8744722,0.001304757,0.11964379,0.0038097166,0.00002429229],"about_ca_topic_score_codex":0.00434686,"about_ca_topic_score_gemma":0.007073696,"teacher_disagreement_score":0.018995324,"about_ca_system_score_codex":0.0032473877,"about_ca_system_score_gemma":0.003514927,"threshold_uncertainty_score":0.063545644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007059705,0.00019314577,0.97778714,0.0001771871,0.00007043594,0.00006516795,0.000107404354,0.00021030798,0.014329495],"genre_scores_gemma":[0.1224993,0.00034523633,0.8671155,0.00010502738,0.00006232293,0.00023457193,0.00035692044,0.00023989269,0.009041195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958307,0.00014073275,0.000013281421,0.000056446548,0.00015865664,0.00004789926],"domain_scores_gemma":[0.9995468,0.000284269,0.000032863365,0.0000393992,0.00007612429,0.000020420493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088653143,0.0009000131,0.0013521409,0.0006254361,0.0004584007,0.0011943147,0.0015284554,0.0013965846,0.007133671],"category_scores_gemma":[0.001730092,0.0008884963,0.0009776391,0.0013918921,0.0006288299,0.001200516,0.0008846438,0.002120966,0.0011108266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007690126,0.00011555085,0.00010530601,0.00013286219,0.00002242783,0.00005711308,0.000061703744,0.89206535,0.0016276644,0.034808487,0.0060206535,0.06490595],"study_design_scores_gemma":[0.000017966493,0.000020479807,0.0000432823,0.000009833707,0.000004327526,0.000014563231,0.000007947334,0.99317414,0.000262493,0.0052963165,0.0011442264,0.0000043253026],"about_ca_topic_score_codex":0.003747163,"about_ca_topic_score_gemma":0.0035405937,"teacher_disagreement_score":0.007133671,"about_ca_system_score_codex":0.00083551527,"about_ca_system_score_gemma":0.0016812963,"threshold_uncertainty_score":0.023864508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00388297,0.00041935337,0.99081355,0.0001653818,0.00007854126,0.0000750523,0.000096691736,0.00019403255,0.0042743688],"genre_scores_gemma":[0.27544641,0.0013033106,0.71465725,0.0005024251,0.00025273638,0.0006732384,0.00074393523,0.00027356108,0.006147207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985232,0.00055725017,0.000070228336,0.00018327958,0.00050761295,0.00015857686],"domain_scores_gemma":[0.9973573,0.001668117,0.0002988787,0.00023249147,0.00036424585,0.000078908044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022044845,0.0015554886,0.00092545897,0.0014072835,0.00065948104,0.0017204062,0.001236717,0.0012820789,0.0074485424],"category_scores_gemma":[0.007457399,0.0005962896,0.0010516834,0.0017975201,0.0012919386,0.0015238798,0.001639073,0.0035909058,0.0013616807],"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.00025600925,0.0001634272,0.0003651936,0.00036303897,0.000044502758,0.0001948855,0.00013327185,0.6420811,0.009603149,0.2358144,0.008233805,0.10274719],"study_design_scores_gemma":[0.000034213856,0.000037057453,0.00006009354,0.000034722234,0.000010193608,0.000037405844,0.000009991033,0.95514816,0.0031614506,0.038481344,0.0029741991,0.000011198522],"about_ca_topic_score_codex":0.0012622115,"about_ca_topic_score_gemma":0.0011967248,"teacher_disagreement_score":0.0074485424,"about_ca_system_score_codex":0.0011890499,"about_ca_system_score_gemma":0.0011253121,"threshold_uncertainty_score":0.0249179},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22029604,0.005675351,0.7068884,0.0056326133,0.00081099063,0.00014506729,0.0016410546,0.0030523161,0.05585825],"genre_scores_gemma":[0.7756687,0.001487329,0.20890759,0.000897313,0.00098137,0.0002733378,0.0022888433,0.0013464696,0.008148986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905518,0.003117816,0.00033834486,0.0013670127,0.0029182578,0.0017066872],"domain_scores_gemma":[0.94891554,0.040067732,0.0016868609,0.0046802917,0.003510743,0.0011388054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00934755,0.0022344869,0.0025866788,0.0039283256,0.0016294018,0.006539268,0.003987073,0.0029493158,0.01222232],"category_scores_gemma":[0.09698435,0.0015398982,0.001299794,0.004755396,0.0028827854,0.008466248,0.003927124,0.004957905,0.002769572],"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.001791443,0.0005195307,0.005289837,0.0005838966,0.00021717916,0.00021935081,0.00028544845,0.7785326,0.0042093494,0.094298236,0.019775884,0.09427724],"study_design_scores_gemma":[0.000030862633,0.00005249495,0.0005084856,0.00004754007,0.00002747732,0.00008157193,0.000063282605,0.9268726,0.001155615,0.07020383,0.00094258157,0.000013645109],"about_ca_topic_score_codex":0.0032343457,"about_ca_topic_score_gemma":0.0051030978,"teacher_disagreement_score":0.01222232,"about_ca_system_score_codex":0.0038688693,"about_ca_system_score_gemma":0.003079681,"threshold_uncertainty_score":0.04943514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014474487,0.0018082586,0.9683044,0.0008409821,0.00013246867,0.00023429688,0.00013438778,0.00053631555,0.013534354],"genre_scores_gemma":[0.2525546,0.004480949,0.7195741,0.0012066512,0.0010192638,0.0010292603,0.0011047756,0.0020164647,0.017013896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991525,0.003129173,0.00026204443,0.0005089035,0.003546374,0.0010285781],"domain_scores_gemma":[0.95940536,0.034037586,0.0012313245,0.0019232127,0.0028776063,0.0005249472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008504847,0.0023300725,0.0026118213,0.004291544,0.0023537166,0.0060929144,0.0041211317,0.0035801919,0.011498779],"category_scores_gemma":[0.046931792,0.0019559006,0.0036846623,0.005585326,0.0025489137,0.007024443,0.0032234062,0.0065492475,0.002331504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007090587,0.0007488949,0.0010936233,0.0007048456,0.00019501634,0.00010668963,0.0004759877,0.44902107,0.005930928,0.31149694,0.0163462,0.21317075],"study_design_scores_gemma":[0.000039086008,0.000096146214,0.0003703733,0.00008083947,0.00006584298,0.000063990585,0.000036485188,0.9104331,0.0013434356,0.08453558,0.0029086187,0.000026450298],"about_ca_topic_score_codex":0.0054386044,"about_ca_topic_score_gemma":0.0038641947,"teacher_disagreement_score":0.011498779,"about_ca_system_score_codex":0.0042253393,"about_ca_system_score_gemma":0.005079885,"threshold_uncertainty_score":0.0449785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18217953,0.002735652,0.74454,0.0028397993,0.0003418484,0.00016397357,0.0008863542,0.00025500124,0.066057965],"genre_scores_gemma":[0.74249727,0.003385291,0.2036783,0.00034763504,0.00033868634,0.00025846474,0.0012092114,0.00028731124,0.04799789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.0002587115,0.000031288524,0.0001364906,0.00013764377,0.0001403148],"domain_scores_gemma":[0.9984012,0.0010799866,0.00016701217,0.00008844752,0.00015214407,0.00011130535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737241,0.0010065113,0.0012604713,0.0011621077,0.00091138715,0.0028830227,0.0018657553,0.0020234066,0.00803481],"category_scores_gemma":[0.0055189645,0.0009047208,0.0007817243,0.0026441214,0.0010214346,0.004021004,0.0014142239,0.0020852953,0.0009044183],"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.0002596287,0.00013210527,0.0003947291,0.00045886158,0.00007480016,0.00029898557,0.0002889262,0.34744814,0.0041969176,0.57421285,0.012762898,0.05947121],"study_design_scores_gemma":[0.00002681228,0.000059316437,0.00023260072,0.00004439758,0.000015972371,0.0001421579,0.00016656835,0.5740803,0.0014473214,0.4178252,0.0059351013,0.000024332254],"about_ca_topic_score_codex":0.0041466374,"about_ca_topic_score_gemma":0.0035994125,"teacher_disagreement_score":0.00803481,"about_ca_system_score_codex":0.0010955454,"about_ca_system_score_gemma":0.00084748375,"threshold_uncertainty_score":0.026879072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2188899,0.0029259177,0.7407129,0.0017817944,0.0004052495,0.000080546124,0.0003521779,0.0007860652,0.034065567],"genre_scores_gemma":[0.8253574,0.0014903749,0.16206947,0.00051306444,0.00016091828,0.000095107716,0.000589998,0.00077899604,0.008944698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941635,0.00017451716,0.000026606236,0.000115731484,0.00017975188,0.0000870378],"domain_scores_gemma":[0.9933518,0.0044341986,0.0005479513,0.0008925806,0.0005230047,0.00025043215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094782125,0.00063712837,0.0013995084,0.0012602234,0.0009225251,0.0025009841,0.0011819905,0.0017626012,0.0055456553],"category_scores_gemma":[0.02016943,0.0011685648,0.00079202914,0.0013614992,0.0024834848,0.00405239,0.0026973588,0.002744086,0.00069831253],"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.0005271289,0.00012388878,0.0030040417,0.0003191892,0.00006790514,0.0003314735,0.00061458553,0.36119273,0.0017892966,0.527825,0.010741813,0.093462914],"study_design_scores_gemma":[0.000027532958,0.000035926154,0.00038596123,0.00005110233,0.000015137748,0.00008006639,0.00016443605,0.22460994,0.0005923216,0.771732,0.0022911825,0.000014403081],"about_ca_topic_score_codex":0.0030994185,"about_ca_topic_score_gemma":0.0026844584,"teacher_disagreement_score":0.0055456553,"about_ca_system_score_codex":0.0007769735,"about_ca_system_score_gemma":0.00058680674,"threshold_uncertainty_score":0.018552005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65999025,0.000981436,0.3135132,0.00061636674,0.00021677319,0.00013564066,0.00014027064,0.00030175355,0.024104312],"genre_scores_gemma":[0.94113064,0.0002057126,0.056070864,0.000033345594,0.000025615864,0.00009289266,0.0000587362,0.000048418962,0.0023338085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940825,0.0002897747,0.000027580503,0.00007359621,0.00011081413,0.00009008807],"domain_scores_gemma":[0.99921525,0.00035364946,0.00012404316,0.00008661252,0.00008794929,0.00013259142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778525,0.0006887672,0.0009874254,0.0011069593,0.00136732,0.0019013735,0.001289241,0.001767474,0.0058791847],"category_scores_gemma":[0.0020210634,0.00092896394,0.00079404307,0.00090332935,0.0016350081,0.0015219295,0.0014255118,0.00084997347,0.000777532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023671146,0.00021340103,0.0019869804,0.0002175513,0.000048082802,0.0010992674,0.00029783667,0.78548485,0.014734928,0.14113776,0.001990682,0.050421495],"study_design_scores_gemma":[0.00015169417,0.000513516,0.0011168573,0.00007301538,0.00004517732,0.00037109843,0.0002888544,0.88624156,0.0034170877,0.105014384,0.0026779252,0.00008869178],"about_ca_topic_score_codex":0.0003550957,"about_ca_topic_score_gemma":0.0006581352,"teacher_disagreement_score":0.0058791847,"about_ca_system_score_codex":0.00074754906,"about_ca_system_score_gemma":0.0003648063,"threshold_uncertainty_score":0.019667864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31253445,0.0005674284,0.6697515,0.0007073556,0.000055149856,0.00011291417,0.0001917795,0.00056136877,0.015517991],"genre_scores_gemma":[0.8971141,0.00031387154,0.09639832,0.00008458218,0.000041829866,0.00007370216,0.0001885018,0.00013597126,0.0056492276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910754,0.00034239356,0.000038328068,0.00018714281,0.00013589957,0.00018863345],"domain_scores_gemma":[0.9981762,0.0008828847,0.00028052425,0.00028849594,0.00015196233,0.00021989139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017967664,0.00071114494,0.0011144854,0.0008148895,0.00051774626,0.0010997357,0.0012820996,0.0009390724,0.0039034826],"category_scores_gemma":[0.0035132724,0.0004354672,0.0005374946,0.0009868828,0.0017612015,0.0027531476,0.0015262018,0.0009999727,0.00038380479],"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.00047171343,0.00014301266,0.00082374585,0.00019632893,0.00005149246,0.00017190643,0.00014632609,0.87053514,0.0095611755,0.07330229,0.0026808546,0.041915983],"study_design_scores_gemma":[0.00006149302,0.00020269341,0.00039209143,0.00002071179,0.00002974113,0.00014799062,0.00008031851,0.9249985,0.007792317,0.06377143,0.0024862443,0.000016475251],"about_ca_topic_score_codex":0.0011632595,"about_ca_topic_score_gemma":0.00074623665,"teacher_disagreement_score":0.0039034826,"about_ca_system_score_codex":0.00095011323,"about_ca_system_score_gemma":0.0006918886,"threshold_uncertainty_score":0.013058424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035250407,0.0008838175,0.9472937,0.00038307623,0.00018658483,0.00010008162,0.00020214266,0.00043658068,0.015263624],"genre_scores_gemma":[0.50668323,0.0013541401,0.47306085,0.00023223132,0.00022012564,0.0003375596,0.00038835168,0.0002552638,0.01746816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983986,0.0007476714,0.00008286222,0.00025341456,0.00029114395,0.0002263387],"domain_scores_gemma":[0.9979808,0.0011814722,0.00017533255,0.00039552324,0.00013508137,0.00013184402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001485467,0.0012992567,0.0025904705,0.0007491362,0.0005789389,0.0022551634,0.0021167004,0.0014122422,0.005778567],"category_scores_gemma":[0.005131416,0.0010253878,0.0011619417,0.0024871966,0.0012062972,0.0036292092,0.0022290875,0.0018384956,0.0009164338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036492004,0.0001843034,0.00023666244,0.0002683006,0.00004653396,0.00019796209,0.00006172125,0.82402414,0.003456286,0.1204975,0.0046120253,0.04604962],"study_design_scores_gemma":[0.00002771033,0.00007801658,0.00009097018,0.000013323945,0.000014215616,0.00009234813,0.000020362288,0.9557646,0.0011605027,0.040873323,0.0018466543,0.000017873244],"about_ca_topic_score_codex":0.0014629742,"about_ca_topic_score_gemma":0.0011922965,"teacher_disagreement_score":0.005778567,"about_ca_system_score_codex":0.0009716862,"about_ca_system_score_gemma":0.0008040097,"threshold_uncertainty_score":0.019331276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007255167,0.0007992729,0.98730797,0.00009753103,0.00017871066,0.0001145604,0.00004498387,0.00027258464,0.0039292695],"genre_scores_gemma":[0.08146801,0.00075321837,0.91388154,0.00013187506,0.00008933296,0.0002763267,0.00018415965,0.000095543495,0.0031200391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991048,0.0002091081,0.000048056205,0.000105995474,0.00039932237,0.00013267732],"domain_scores_gemma":[0.9993413,0.00024831304,0.00009869715,0.00010783762,0.00015046318,0.000053420725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007160304,0.0009808331,0.0012585081,0.0013740113,0.0007601369,0.0010842951,0.0015488568,0.0011581728,0.0028236317],"category_scores_gemma":[0.0016422027,0.00051010767,0.0009484599,0.0013817239,0.0005728187,0.0015275148,0.0010490197,0.0013526079,0.00064832444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001485887,0.0002665435,0.0005684992,0.00047636114,0.00011657756,0.0003333081,0.00015674306,0.64462954,0.0068413536,0.037577476,0.008133138,0.30075192],"study_design_scores_gemma":[0.00007256122,0.00015701797,0.00019035104,0.00005173096,0.000034902587,0.00030758843,0.00006574956,0.97061735,0.0040821754,0.009838227,0.014538994,0.000043418535],"about_ca_topic_score_codex":0.0020630625,"about_ca_topic_score_gemma":0.003077913,"teacher_disagreement_score":0.0028236317,"about_ca_system_score_codex":0.000627563,"about_ca_system_score_gemma":0.0012914182,"threshold_uncertainty_score":0.009445965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.591458,0.0004245703,0.37853894,0.0031840194,0.000047073674,0.0005827807,0.0016931806,0.0012988544,0.022772484],"genre_scores_gemma":[0.7025187,0.00027982137,0.28929386,0.00028982444,0.000028591636,0.00013764342,0.0027276073,0.0001255515,0.00459838],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9948258,0.0023287837,0.00042702022,0.0009520457,0.0012431685,0.00022310349],"domain_scores_gemma":[0.968268,0.026101356,0.0013752256,0.0022518567,0.0016664919,0.00033708697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043978323,0.00070546375,0.00042767834,0.0014799979,0.0012920524,0.0021391546,0.002519524,0.0028070803,0.0056421096],"category_scores_gemma":[0.031014957,0.00061238155,0.00051369716,0.00086128135,0.001812476,0.004909462,0.00169632,0.0016022293,0.0007834806],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018025247,0.002696016,0.028479716,0.0013892845,0.0001697783,0.0039444324,0.032752864,0.22881906,0.038966447,0.07253355,0.026713505,0.5617328],"study_design_scores_gemma":[0.00030986135,0.00048234788,0.012753935,0.00031276612,0.000096213094,0.0012954002,0.02322949,0.7937412,0.032334108,0.08528727,0.049980327,0.0001771237],"about_ca_topic_score_codex":0.011705018,"about_ca_topic_score_gemma":0.017819263,"teacher_disagreement_score":0.011705018,"about_ca_system_score_codex":0.0017220974,"about_ca_system_score_gemma":0.0021236725,"threshold_uncertainty_score":0.023273766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023333708,0.0026827916,0.95809036,0.0016961116,0.00012356702,0.00020668043,0.000176913,0.00012098858,0.013568829],"genre_scores_gemma":[0.3602272,0.0054806275,0.61775696,0.00076371705,0.00027631957,0.0010501435,0.0005639745,0.00015733206,0.013723657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979236,0.0011994836,0.00006127295,0.00026988063,0.00035749623,0.00018819261],"domain_scores_gemma":[0.9971366,0.0022742343,0.00019217338,0.00012975649,0.00017224667,0.00009492238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312294,0.0015888665,0.0013555385,0.0009839695,0.0008648558,0.0020660334,0.0012277786,0.0024286164,0.0050517013],"category_scores_gemma":[0.005532168,0.00088706805,0.0013158715,0.0020060674,0.0020180496,0.002340059,0.0013164049,0.0016712171,0.0007136665],"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.00003919905,0.000052793483,0.00022880889,0.00021615869,0.000033074233,0.00008582772,0.00006275321,0.8944594,0.00039321542,0.08808255,0.0013201222,0.015026081],"study_design_scores_gemma":[0.000060667906,0.00009667199,0.00011226774,0.00007460258,0.0000198752,0.00009425077,0.0000760618,0.85392445,0.00050119613,0.13452423,0.0105001535,0.000015558117],"about_ca_topic_score_codex":0.0029379968,"about_ca_topic_score_gemma":0.0027315526,"teacher_disagreement_score":0.0050517013,"about_ca_system_score_codex":0.0020252918,"about_ca_system_score_gemma":0.0018408158,"threshold_uncertainty_score":0.016899645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011409058,0.00009013781,0.98469746,0.00005459069,0.000027167356,0.00008650877,0.000025063233,0.000608177,0.0030017628],"genre_scores_gemma":[0.11573039,0.00014904143,0.8815159,0.0000635505,0.000025622176,0.00018205347,0.00017777074,0.000206492,0.0019491218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993364,0.00021080785,0.00002661898,0.00009199225,0.00022976087,0.00010434193],"domain_scores_gemma":[0.9991685,0.00048344533,0.00008275019,0.00013757929,0.00009668131,0.00003099293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012046512,0.0010222163,0.00080267614,0.0011111272,0.000465615,0.0007970713,0.0010759952,0.0009658695,0.007437614],"category_scores_gemma":[0.0030962639,0.00064548344,0.0007812604,0.00094413635,0.0005685106,0.0010066556,0.0010845873,0.001487691,0.001344681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016781432,0.00015964557,0.0004901015,0.00019523526,0.000053512926,0.00006587628,0.00011970683,0.75460017,0.00900526,0.025626553,0.0023748055,0.20714132],"study_design_scores_gemma":[0.00004704732,0.000078212746,0.00012222245,0.000018862416,0.000012808737,0.000033233,0.00003425237,0.9797167,0.0029320135,0.013835661,0.003161567,0.0000073858323],"about_ca_topic_score_codex":0.0020831511,"about_ca_topic_score_gemma":0.0030834766,"teacher_disagreement_score":0.007437614,"about_ca_system_score_codex":0.00057894725,"about_ca_system_score_gemma":0.0010103529,"threshold_uncertainty_score":0.024881303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023990626,0.001463641,0.96163857,0.0006930277,0.00027273936,0.00022630714,0.0006199686,0.0016157448,0.009479407],"genre_scores_gemma":[0.24345596,0.0011809049,0.7453016,0.00034285535,0.00029995816,0.0006931729,0.0017975783,0.0005624482,0.0063655525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981,0.00045615376,0.00010400036,0.00017804596,0.0009134253,0.0002483985],"domain_scores_gemma":[0.995644,0.0022208,0.00024248323,0.0009841131,0.0006918791,0.00021683055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018495586,0.0014371831,0.0026606596,0.0017021933,0.0011382484,0.002918016,0.0022431945,0.0019578973,0.012561251],"category_scores_gemma":[0.0123042455,0.0011282563,0.0013846562,0.0051604947,0.000879887,0.0042729895,0.0029671676,0.0027782102,0.002394724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000851569,0.00028276898,0.00082771404,0.0006042233,0.000095141775,0.00014055519,0.00016412348,0.56496555,0.002758859,0.08124566,0.028027361,0.32003653],"study_design_scores_gemma":[0.000061538165,0.000038919046,0.000104532,0.000018443765,0.000011025979,0.00004250345,0.000026522799,0.9539722,0.00060555455,0.04268269,0.002427831,0.000008224039],"about_ca_topic_score_codex":0.0070873764,"about_ca_topic_score_gemma":0.011856081,"teacher_disagreement_score":0.012561251,"about_ca_system_score_codex":0.0017659125,"about_ca_system_score_gemma":0.0030137429,"threshold_uncertainty_score":0.042021632},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38886902,0.019402891,0.39686432,0.004443137,0.00033701432,0.00035830215,0.0015854862,0.001004374,0.18713547],"genre_scores_gemma":[0.7655518,0.024192842,0.1633424,0.000705493,0.00034887454,0.00030363572,0.0026903523,0.00031498866,0.042549606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973077,0.000039794835,0.0000121578,0.00008005491,0.00007691774,0.000060321116],"domain_scores_gemma":[0.99948573,0.00027879994,0.00008354862,0.00005428152,0.000053451684,0.00004409918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013848314,0.000549612,0.00047913415,0.0011855983,0.0008185916,0.0015847989,0.00058706047,0.00066092197,0.0055537424],"category_scores_gemma":[0.0017037094,0.00059871585,0.00058611255,0.0021913627,0.00085137045,0.0018270784,0.001065267,0.0012337721,0.00082488643],"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.00014330458,0.00006790567,0.0014153208,0.0006647756,0.000031118252,0.00037217702,0.0005851875,0.080991045,0.008626212,0.7004908,0.014981275,0.19163094],"study_design_scores_gemma":[0.000039695162,0.000051276555,0.0012270652,0.00014226031,0.000033156175,0.00059316214,0.0003028348,0.059258644,0.004038974,0.8582837,0.07600265,0.000026612355],"about_ca_topic_score_codex":0.0032198569,"about_ca_topic_score_gemma":0.002871217,"teacher_disagreement_score":0.0055537424,"about_ca_system_score_codex":0.0011492552,"about_ca_system_score_gemma":0.0005230752,"threshold_uncertainty_score":0.018579125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011917014,0.0003949759,0.98125273,0.00047621157,0.00014220786,0.00010220903,0.00008696036,0.0005490291,0.0050786985],"genre_scores_gemma":[0.22455095,0.00047284956,0.76269174,0.00046264066,0.000400724,0.00037534445,0.00047582155,0.00088730006,0.00968255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530727,0.0023045142,0.0001627065,0.00039067125,0.0015020155,0.00033288935],"domain_scores_gemma":[0.9841728,0.012269727,0.00034702924,0.001158303,0.0016112777,0.00044076523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007143022,0.0016599629,0.002363025,0.0015515382,0.0011274273,0.0027945747,0.0026672182,0.0027509427,0.013315578],"category_scores_gemma":[0.029261822,0.0010999643,0.0013104035,0.0017597291,0.0022520262,0.004111235,0.0038629798,0.0031018266,0.0016783336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013987473,0.00025514205,0.0015302065,0.00045234393,0.00017185525,0.00014636568,0.00019823042,0.53632104,0.0059941323,0.15711863,0.014945519,0.28146774],"study_design_scores_gemma":[0.00004053775,0.000051315525,0.00016720491,0.000026535732,0.00001737702,0.00004349601,0.000014135044,0.9705574,0.0008141797,0.02739308,0.0008601687,0.000014699858],"about_ca_topic_score_codex":0.005488798,"about_ca_topic_score_gemma":0.007758,"teacher_disagreement_score":0.013315578,"about_ca_system_score_codex":0.0021228509,"about_ca_system_score_gemma":0.0031291815,"threshold_uncertainty_score":0.044545054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031814028,0.00018929385,0.99340856,0.00018255011,0.00005079924,0.00014871327,0.00005161969,0.00034758679,0.0024394707],"genre_scores_gemma":[0.03090531,0.00022348097,0.9662881,0.000073369265,0.00004317515,0.00030223044,0.0001923057,0.00015393658,0.0018181198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989367,0.00024341466,0.00006986788,0.00014915799,0.00044817736,0.00015261902],"domain_scores_gemma":[0.999019,0.0005505595,0.00007091121,0.00009746479,0.00019096954,0.00007110162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011518181,0.0012067086,0.0015399694,0.0011777427,0.0011555512,0.0015758248,0.0022297238,0.0018475772,0.011466521],"category_scores_gemma":[0.0042714374,0.0008438058,0.0010305105,0.0026267061,0.00077547674,0.00241947,0.00266595,0.0030295642,0.0020003773],"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.000185434,0.00032510445,0.0005921123,0.00031417172,0.00008810638,0.00024998173,0.00021163297,0.40410617,0.0052379537,0.072088666,0.013998253,0.50260246],"study_design_scores_gemma":[0.00011344301,0.00008609007,0.00012449254,0.000022537062,0.00002672277,0.00015191866,0.000036730744,0.95261234,0.0015315771,0.038195472,0.007075271,0.000023472503],"about_ca_topic_score_codex":0.0030195813,"about_ca_topic_score_gemma":0.0035222333,"teacher_disagreement_score":0.011466521,"about_ca_system_score_codex":0.0010880324,"about_ca_system_score_gemma":0.002409001,"threshold_uncertainty_score":0.038359404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02012994,0.0008638652,0.96150047,0.0003124666,0.00011502934,0.0002755292,0.00034693987,0.0032776904,0.013178027],"genre_scores_gemma":[0.09944912,0.00037988552,0.89443004,0.00017426354,0.000041637715,0.0004989229,0.00066029065,0.00048337298,0.0038824095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.0003022372,0.00002367413,0.000084635074,0.00016145904,0.00008066622],"domain_scores_gemma":[0.9991793,0.00049435976,0.000063741725,0.0000725594,0.00016242114,0.00002760068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982203,0.0010928118,0.0011268095,0.001349825,0.0012861823,0.0014184909,0.0013648974,0.0017560591,0.0076359054],"category_scores_gemma":[0.0033371544,0.0006538049,0.00076150795,0.002842076,0.00070960587,0.0011424626,0.0008388798,0.0012647416,0.002276864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016850325,0.00019100732,0.000646781,0.00019854763,0.000086340166,0.00010741263,0.00016533444,0.6205952,0.0026043449,0.02608142,0.014543296,0.33461177],"study_design_scores_gemma":[0.0000661987,0.00007690865,0.00018734264,0.000027814944,0.000026116493,0.00007823207,0.000044778055,0.9830898,0.0011139939,0.008182419,0.007089355,0.000016985578],"about_ca_topic_score_codex":0.007160286,"about_ca_topic_score_gemma":0.006328925,"teacher_disagreement_score":0.0076359054,"about_ca_system_score_codex":0.001077711,"about_ca_system_score_gemma":0.001967238,"threshold_uncertainty_score":0.025544584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05011604,0.001136883,0.8604538,0.0027162766,0.0008280771,0.00023218736,0.0017100751,0.017645797,0.06516082],"genre_scores_gemma":[0.31406033,0.00055431656,0.63680947,0.0007307028,0.0004289092,0.00024058136,0.0026261988,0.002286387,0.04226298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839526,0.00031444593,0.0000818844,0.00029544422,0.00065968896,0.00025325568],"domain_scores_gemma":[0.9962923,0.0014947782,0.00012321117,0.0015005097,0.00042984972,0.00015937717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095629256,0.0011986415,0.0013026543,0.0009378855,0.0009963134,0.0018548232,0.0019078371,0.0017440071,0.032681603],"category_scores_gemma":[0.010617811,0.0007354887,0.0009548086,0.0019217792,0.00070021144,0.0034351465,0.0026002664,0.0030806302,0.010020385],"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.0013977247,0.0006771549,0.0021095092,0.0005044198,0.000079173886,0.0002783574,0.0002141958,0.08560727,0.0074373228,0.072084576,0.10832428,0.7212861],"study_design_scores_gemma":[0.00017100232,0.000092237395,0.0004993852,0.00006902381,0.000051602714,0.000215496,0.000054828797,0.7184554,0.0068028006,0.24487685,0.028686294,0.000025098596],"about_ca_topic_score_codex":0.00244242,"about_ca_topic_score_gemma":0.006074061,"teacher_disagreement_score":0.032681603,"about_ca_system_score_codex":0.0009921975,"about_ca_system_score_gemma":0.0017423035,"threshold_uncertainty_score":0.10933089},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52348036,0.012079714,0.3334017,0.007863392,0.0010095519,0.00024575775,0.0009182972,0.0006186771,0.12038261],"genre_scores_gemma":[0.94715756,0.0024687117,0.044440206,0.0005595143,0.00024301652,0.00012825137,0.00038145605,0.00041187828,0.004209376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972218,0.0013638882,0.00008809695,0.00018772556,0.00058706803,0.00055141305],"domain_scores_gemma":[0.9496109,0.045199025,0.0014264545,0.0013910248,0.001429105,0.0009435449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060331393,0.00130436,0.0023588233,0.0017969444,0.0016179465,0.0028999187,0.0025136815,0.0021313122,0.00949984],"category_scores_gemma":[0.05306771,0.000944926,0.00076249003,0.0032236436,0.0024791912,0.00516854,0.0023361903,0.0029248525,0.0007036441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007566102,0.00015508509,0.0010655748,0.00027437357,0.000052501975,0.00009190504,0.000121223864,0.8815097,0.0012282665,0.08276378,0.0073789447,0.024601985],"study_design_scores_gemma":[0.00003136436,0.000068723704,0.00027902678,0.00003124274,0.000018904155,0.000020265017,0.00006254202,0.95719934,0.00044224193,0.041402265,0.00042876886,0.00001531003],"about_ca_topic_score_codex":0.008109698,"about_ca_topic_score_gemma":0.00700226,"teacher_disagreement_score":0.00949984,"about_ca_system_score_codex":0.0020718272,"about_ca_system_score_gemma":0.0025606942,"threshold_uncertainty_score":0.031906664},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079611406,0.0030654538,0.8921291,0.0007880414,0.0003963526,0.0003426278,0.00035301718,0.0011267778,0.022187186],"genre_scores_gemma":[0.32039732,0.0010482125,0.66807437,0.00034065952,0.00019005418,0.0003330037,0.0005238444,0.00034121424,0.008751297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990213,0.00047305788,0.00004148588,0.00011923193,0.00016614322,0.00017884075],"domain_scores_gemma":[0.9979152,0.0014849186,0.000110733985,0.0002112159,0.00013934528,0.00013858655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014901019,0.0012738184,0.0016597465,0.0014841309,0.00104204,0.0018465522,0.0021048628,0.0016254452,0.007876311],"category_scores_gemma":[0.004174633,0.0011484923,0.0012938189,0.0022535697,0.00092864403,0.0026204188,0.0015565397,0.0020977736,0.0009424309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076234323,0.0004829433,0.0007441695,0.0004896303,0.000162874,0.00022751377,0.0001925075,0.62609905,0.0033387518,0.10510566,0.018263733,0.24413079],"study_design_scores_gemma":[0.0001630261,0.00014479057,0.0002066978,0.00004339196,0.000055840377,0.00010305477,0.00006259906,0.9231739,0.0011329282,0.0691894,0.005698878,0.000025492109],"about_ca_topic_score_codex":0.0028498527,"about_ca_topic_score_gemma":0.0047547575,"teacher_disagreement_score":0.007876311,"about_ca_system_score_codex":0.0012062633,"about_ca_system_score_gemma":0.0015618115,"threshold_uncertainty_score":0.026348889},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080597505,0.23480794,0.36494395,0.013782549,0.0021631955,0.00050022214,0.0006865704,0.00054776756,0.30197024],"genre_scores_gemma":[0.48373985,0.30987033,0.14968485,0.0038792817,0.006912553,0.0006471391,0.0018001511,0.00032526144,0.04314057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984805,0.0003310717,0.00011889178,0.00041469617,0.00044550523,0.00020928317],"domain_scores_gemma":[0.99875486,0.0007125981,0.00013678685,0.00020698625,0.00011621356,0.0000725831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014276074,0.0012681953,0.001663066,0.0025729844,0.0011676002,0.0026939642,0.0025452492,0.0024349599,0.0058440263],"category_scores_gemma":[0.0043947143,0.0008808698,0.0020560317,0.0063687856,0.0035521209,0.006847963,0.0023749005,0.004451261,0.001233318],"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.00003768523,0.00012264152,0.0009507985,0.00103165,0.000053026328,0.00026206175,0.00038650574,0.018825823,0.00049143797,0.8992307,0.008131653,0.07047592],"study_design_scores_gemma":[0.000025697085,0.00007989529,0.0013412253,0.00029599865,0.0000331742,0.0011049149,0.0002602685,0.03475029,0.00039300683,0.8412985,0.12036597,0.000050959923],"about_ca_topic_score_codex":0.0046832757,"about_ca_topic_score_gemma":0.003282994,"teacher_disagreement_score":0.0058440263,"about_ca_system_score_codex":0.0032072787,"about_ca_system_score_gemma":0.0015840448,"threshold_uncertainty_score":0.023270547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13963175,0.000981565,0.79034024,0.0004922379,0.00016785951,0.0003022382,0.00071920705,0.0006820679,0.06668279],"genre_scores_gemma":[0.88159055,0.0005077486,0.10126182,0.00009806698,0.000073805684,0.00016950499,0.0004733247,0.00015277149,0.015672373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962044,0.0000752736,0.000011671245,0.00006887497,0.00011183648,0.000111777415],"domain_scores_gemma":[0.99981266,0.00006752268,0.00003940682,0.000014608793,0.000044819917,0.000020979025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039884998,0.001018448,0.0009392872,0.0008514203,0.0005262616,0.001435509,0.00089355337,0.000846926,0.009594538],"category_scores_gemma":[0.0009410384,0.00045337906,0.00041369474,0.0009470395,0.00041180567,0.00095482805,0.00076124637,0.00041530942,0.0009110242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008865569,0.00005668296,0.00024922314,0.00009274163,0.0000114352615,0.000058283666,0.00003080224,0.95858216,0.0038583323,0.0079528075,0.00235413,0.026664665],"study_design_scores_gemma":[0.00001671102,0.000059870603,0.0002580368,0.000012666771,0.000008339187,0.000018852656,0.00003614675,0.9926997,0.0010974813,0.00397667,0.0018092043,0.0000063538787],"about_ca_topic_score_codex":0.011323509,"about_ca_topic_score_gemma":0.009481252,"teacher_disagreement_score":0.011323509,"about_ca_system_score_codex":0.0013378463,"about_ca_system_score_gemma":0.0011237422,"threshold_uncertainty_score":0.032096922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0189705,0.00023751598,0.97384393,0.00021697905,0.00003653628,0.00009890804,0.00029066534,0.00051567034,0.0057892734],"genre_scores_gemma":[0.18833236,0.00031676033,0.8053219,0.00012285124,0.00004937488,0.0002066042,0.001317522,0.00022473732,0.004107909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.00008899924,0.00002257682,0.00009791616,0.00012967207,0.00009125084],"domain_scores_gemma":[0.99925977,0.0003601117,0.00006304343,0.00013893987,0.00011867485,0.00005952188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004951457,0.00068376784,0.000991873,0.0012899167,0.00064877997,0.0009839451,0.0010817343,0.0007940147,0.008726893],"category_scores_gemma":[0.0020058632,0.00038837644,0.00063969544,0.0017232479,0.00042848487,0.0021456347,0.0010468598,0.0012673851,0.0015180822],"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.0004023171,0.00025983993,0.0018773039,0.00045893854,0.00010833171,0.00014006656,0.00022112632,0.46298784,0.013874168,0.1752123,0.016787367,0.32767043],"study_design_scores_gemma":[0.000039545004,0.00006960535,0.00033384227,0.000018219218,0.00001995098,0.000077979494,0.000057264755,0.9246592,0.002912738,0.06633518,0.005466047,0.00001039003],"about_ca_topic_score_codex":0.0034842587,"about_ca_topic_score_gemma":0.006349809,"teacher_disagreement_score":0.008726893,"about_ca_system_score_codex":0.001151218,"about_ca_system_score_gemma":0.0012798663,"threshold_uncertainty_score":0.029194355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022275904,0.00010582463,0.9766053,0.000038831105,0.000018643384,0.000042859407,0.0000172869,0.00014154136,0.0007538861],"genre_scores_gemma":[0.40412217,0.00014116321,0.59294116,0.000065695844,0.00002441892,0.00019228701,0.00011602359,0.00004500309,0.0023520058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965775,0.00006340783,0.000024122692,0.00008775845,0.00011213895,0.000054887154],"domain_scores_gemma":[0.9995995,0.0002062484,0.000041294308,0.000019328838,0.00010475351,0.00002878058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008359748,0.0006950711,0.0008221721,0.00060127175,0.0005190604,0.0005763774,0.0011395941,0.0010040064,0.0014607684],"category_scores_gemma":[0.0013269521,0.00035839615,0.0005955935,0.0006410907,0.0005442387,0.00062039774,0.00048107866,0.00078573596,0.00020128302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012183541,0.000066513334,0.00053994346,0.000060178452,0.000033172524,0.000047051046,0.000079736885,0.8683718,0.0051573897,0.0049900785,0.0005689478,0.11996338],"study_design_scores_gemma":[0.000012239346,0.00003617259,0.00006739626,0.000003020614,0.000004788857,0.000009240849,0.0000042166625,0.99783593,0.0007338718,0.001062754,0.00022696053,0.000003444587],"about_ca_topic_score_codex":0.007355516,"about_ca_topic_score_gemma":0.0060469145,"teacher_disagreement_score":0.007355516,"about_ca_system_score_codex":0.00080055755,"about_ca_system_score_gemma":0.0011510876,"threshold_uncertainty_score":0.0146253705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04996324,0.00096442323,0.9289176,0.0008790893,0.00021384332,0.00020308663,0.0003769636,0.0002322173,0.018249499],"genre_scores_gemma":[0.6000309,0.0019054478,0.36424997,0.00036482737,0.00031382238,0.00063540525,0.0005162873,0.0004431537,0.03154028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990381,0.00038967334,0.000047885474,0.00018087789,0.00015823312,0.00018525278],"domain_scores_gemma":[0.9982085,0.0013207273,0.00017521976,0.00005870733,0.00013078499,0.00010607607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024669617,0.002079658,0.0041825976,0.001985592,0.0015023234,0.0055882554,0.0025889259,0.0043499055,0.009954373],"category_scores_gemma":[0.004190641,0.0032308055,0.0026303164,0.0037536283,0.0016401323,0.004115556,0.0015448212,0.0027419913,0.0007011246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047215734,0.000052708885,0.00013925214,0.000055900713,0.000020625315,0.000071385206,0.000017861916,0.9882108,0.0003905613,0.0068291635,0.00046504984,0.0036994428],"study_design_scores_gemma":[0.0000075528505,0.00002340408,0.0000478929,0.000006091094,0.0000126469085,0.000008433885,0.00002032988,0.9967109,0.00017202346,0.0027515485,0.00023245245,0.000006690593],"about_ca_topic_score_codex":0.008449122,"about_ca_topic_score_gemma":0.00676306,"teacher_disagreement_score":0.009954373,"about_ca_system_score_codex":0.0024041873,"about_ca_system_score_gemma":0.0021947704,"threshold_uncertainty_score":0.03330064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0681204,0.0010924562,0.91854346,0.00066836027,0.0001371296,0.00039796732,0.0004156766,0.00091942365,0.009705156],"genre_scores_gemma":[0.15721086,0.00051996595,0.83677155,0.00012390762,0.000074414624,0.00040487436,0.00094054267,0.00019220311,0.003761708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994443,0.00018597096,0.000027415394,0.00011468577,0.00011433173,0.000113213195],"domain_scores_gemma":[0.99888915,0.0007888373,0.000076307806,0.00004724775,0.00011327458,0.00008521913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011284256,0.0012745649,0.0016651794,0.0012718108,0.0011311215,0.0013859015,0.0016089473,0.0020470999,0.007487654],"category_scores_gemma":[0.0026536463,0.00083743106,0.000853244,0.0020315507,0.0005477559,0.0018427058,0.0010837358,0.0017582027,0.0009489363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033639293,0.00040021015,0.0006706331,0.00020900978,0.00009425807,0.00018692737,0.00012284322,0.7546445,0.0014532624,0.020040723,0.009705349,0.21213584],"study_design_scores_gemma":[0.00008119854,0.00007475126,0.000102942686,0.00001276611,0.000016270697,0.000036124533,0.00002671354,0.9882754,0.00040971796,0.0095845815,0.0013722152,0.0000073647843],"about_ca_topic_score_codex":0.00690271,"about_ca_topic_score_gemma":0.005449513,"teacher_disagreement_score":0.007487654,"about_ca_system_score_codex":0.0014106655,"about_ca_system_score_gemma":0.0019787098,"threshold_uncertainty_score":0.025048673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043504983,0.0014449974,0.9237782,0.0011354485,0.000500724,0.00008222052,0.0006978048,0.0002161282,0.028639486],"genre_scores_gemma":[0.6343414,0.0026219138,0.33863342,0.0005916645,0.00041214481,0.00032670845,0.0011900287,0.00028723446,0.021595469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992455,0.00020719657,0.00004552195,0.00014943849,0.00023929193,0.00011301529],"domain_scores_gemma":[0.9989478,0.0005281646,0.00015787093,0.00012647719,0.00012091648,0.00011880911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008272728,0.0009552404,0.0011521243,0.00087791437,0.0010453122,0.0032275196,0.0015590718,0.0025880102,0.006640062],"category_scores_gemma":[0.003277084,0.0006112916,0.0008584175,0.0024231097,0.0011846675,0.0026292184,0.002078999,0.0017684192,0.0010563924],"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.00028898506,0.00013045355,0.0006777456,0.0004117189,0.00007153728,0.00041668175,0.00010174161,0.77647,0.0040651555,0.13434272,0.008317383,0.07470582],"study_design_scores_gemma":[0.000041159554,0.000051956627,0.0005433034,0.00005602303,0.000020648124,0.00021022174,0.00011591835,0.8380911,0.0021075823,0.15032193,0.008388174,0.00005201135],"about_ca_topic_score_codex":0.003551125,"about_ca_topic_score_gemma":0.0021507302,"teacher_disagreement_score":0.006640062,"about_ca_system_score_codex":0.0006372168,"about_ca_system_score_gemma":0.0009031795,"threshold_uncertainty_score":0.02221328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0718637,0.00068994437,0.90565825,0.0017120796,0.00036548666,0.00032416533,0.0006268923,0.00045627574,0.018303225],"genre_scores_gemma":[0.643538,0.0019116348,0.2604951,0.0009745838,0.0005033776,0.0007138681,0.0015396547,0.0005275307,0.08979621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973074,0.0008562412,0.00015796501,0.0006047521,0.0004578904,0.0006157838],"domain_scores_gemma":[0.9903092,0.0055643404,0.0006739163,0.0012859128,0.0010626045,0.0011039991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348792,0.0017047192,0.0039854185,0.0018033689,0.0026560829,0.005099206,0.006211674,0.0051549138,0.02585294],"category_scores_gemma":[0.016231377,0.0020296585,0.0026453426,0.0044938675,0.0034510137,0.00943797,0.0053440086,0.0064944196,0.0030417917],"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.0006621724,0.0003383796,0.0010412956,0.00016589981,0.00008942321,0.00026396217,0.00021007351,0.326319,0.001322767,0.6397119,0.0062777344,0.02359743],"study_design_scores_gemma":[0.000105010564,0.000059922128,0.00014779842,0.000025293019,0.000033328473,0.0000505258,0.000072065755,0.66925097,0.0006232389,0.32786557,0.0017404606,0.000025767002],"about_ca_topic_score_codex":0.0048694923,"about_ca_topic_score_gemma":0.00490724,"teacher_disagreement_score":0.02585294,"about_ca_system_score_codex":0.0023554706,"about_ca_system_score_gemma":0.0017756772,"threshold_uncertainty_score":0.08648676},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03550453,0.0005357944,0.9601074,0.00012360417,0.00004620213,0.000042252632,0.000019309386,0.00024978377,0.0033710327],"genre_scores_gemma":[0.59550935,0.0006992354,0.39777872,0.00011223428,0.000045465615,0.00017116392,0.00011968808,0.00008014446,0.0054840297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997203,0.000073942996,0.0000131448505,0.00006802625,0.000086954315,0.00003757168],"domain_scores_gemma":[0.9998066,0.000082096856,0.000022537335,0.000014351007,0.00006396686,0.0000104196815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043544394,0.00048322824,0.0006166785,0.0006273997,0.00036750967,0.0005038322,0.00080968684,0.00065277016,0.0010809592],"category_scores_gemma":[0.0011241324,0.00027501574,0.00054955855,0.00077308354,0.00041054745,0.00055608887,0.00041728135,0.0004750005,0.00021617027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044171888,0.000031790947,0.00096980546,0.000045959405,0.00003645886,0.00008439309,0.000100329926,0.9159764,0.0046766517,0.007733295,0.0008900254,0.06941077],"study_design_scores_gemma":[0.000011590265,0.00002124176,0.00016773443,0.00000460531,0.000008432966,0.00002580699,0.000009573662,0.9968988,0.00057895563,0.0015880194,0.00068004266,0.0000051844418],"about_ca_topic_score_codex":0.006675426,"about_ca_topic_score_gemma":0.003895017,"teacher_disagreement_score":0.006675426,"about_ca_system_score_codex":0.0005617563,"about_ca_system_score_gemma":0.0007652525,"threshold_uncertainty_score":0.01327312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11839365,0.0053143804,0.82342625,0.0019134799,0.00020859648,0.0001599226,0.00032881368,0.00023245689,0.05002238],"genre_scores_gemma":[0.6396641,0.005065214,0.3455045,0.0005286083,0.00031925694,0.0005482532,0.0007530485,0.00045736722,0.0071596014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677867,0.0013946082,0.00019339369,0.0004921175,0.0007596543,0.00038155037],"domain_scores_gemma":[0.956439,0.037767585,0.0030101223,0.00077676284,0.0015325467,0.00047396106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067493585,0.0020563575,0.0018884122,0.0032571182,0.0017693182,0.004578876,0.0015303355,0.0021004274,0.00980289],"category_scores_gemma":[0.05249974,0.0014631944,0.0017351172,0.0036298383,0.0037156828,0.00676612,0.00320143,0.0042497637,0.00075381534],"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.00035288878,0.00013698362,0.0017758767,0.0008126413,0.0001441438,0.0001799833,0.00042157728,0.31484318,0.0022494898,0.6093233,0.004715531,0.06504433],"study_design_scores_gemma":[0.000038502076,0.00020599511,0.0011794226,0.00021773632,0.00006592255,0.00022715935,0.00019696563,0.4194031,0.0015740821,0.5746382,0.0021896823,0.00006325735],"about_ca_topic_score_codex":0.0010531815,"about_ca_topic_score_gemma":0.0009571461,"teacher_disagreement_score":0.00980289,"about_ca_system_score_codex":0.0015314624,"about_ca_system_score_gemma":0.001137248,"threshold_uncertainty_score":0.03569448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07021386,0.003603685,0.8700484,0.0021470138,0.00046352262,0.00020711122,0.0014658308,0.00049358007,0.051357053],"genre_scores_gemma":[0.6253962,0.005376387,0.31679434,0.0010361572,0.0007736923,0.00083612575,0.0034648534,0.0015076962,0.04481461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760324,0.0006854931,0.00012748578,0.00037054668,0.00081630785,0.00039696557],"domain_scores_gemma":[0.99129945,0.006684124,0.00036084387,0.00057370606,0.00069891004,0.0003829048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612081,0.0023064206,0.0028424596,0.0019544165,0.0010554333,0.0039671906,0.003610897,0.0027977577,0.014669608],"category_scores_gemma":[0.015625596,0.0017317135,0.0014017106,0.0048131887,0.0016755188,0.0058824685,0.0042118267,0.00439427,0.002131284],"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.00045464895,0.0001448542,0.0006145302,0.00070704514,0.000078134195,0.00032850733,0.0002967474,0.7369109,0.0042969296,0.18228583,0.01743627,0.056445573],"study_design_scores_gemma":[0.000040866806,0.00007322415,0.00034835647,0.000075656106,0.000020392532,0.00009455562,0.00007585088,0.8141774,0.0010383264,0.1787327,0.005293531,0.000029204266],"about_ca_topic_score_codex":0.00598689,"about_ca_topic_score_gemma":0.004072539,"teacher_disagreement_score":0.014669608,"about_ca_system_score_codex":0.0016890471,"about_ca_system_score_gemma":0.00089223165,"threshold_uncertainty_score":0.04907471},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2818844,0.0013308226,0.6812604,0.0010512178,0.0002943175,0.00022281453,0.0006598881,0.0017116799,0.031584445],"genre_scores_gemma":[0.7024815,0.00065225555,0.28569508,0.00028860738,0.00015864456,0.00016056115,0.0011304438,0.00029375567,0.009139256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821585,0.00045177407,0.000096006705,0.00038752964,0.0004926175,0.00035612626],"domain_scores_gemma":[0.9952337,0.0026038801,0.00048107925,0.0010423071,0.0002821621,0.0003568323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132847,0.0007436416,0.0016752277,0.0006048071,0.0008100368,0.0015631819,0.0024361196,0.0017754466,0.009904262],"category_scores_gemma":[0.0068862233,0.00072408805,0.0007125299,0.0021274267,0.0008816377,0.0038756211,0.002157501,0.0014715475,0.0014767044],"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.0013868102,0.0007499795,0.002472319,0.000429496,0.00008673831,0.00089906016,0.00029178304,0.70249206,0.016530473,0.055173,0.010949312,0.20853898],"study_design_scores_gemma":[0.00007217453,0.00013475108,0.00029746557,0.000014256004,0.000010785592,0.0002129551,0.000070685266,0.95651406,0.003723806,0.035461858,0.0034752083,0.000012055572],"about_ca_topic_score_codex":0.0018411664,"about_ca_topic_score_gemma":0.0018893534,"teacher_disagreement_score":0.009904262,"about_ca_system_score_codex":0.0008976335,"about_ca_system_score_gemma":0.00053980167,"threshold_uncertainty_score":0.03313309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11674672,0.00016868283,0.87647825,0.00013745058,0.000026925058,0.00008637195,0.00012828711,0.0007916519,0.005435672],"genre_scores_gemma":[0.6024906,0.00022565592,0.39168942,0.00008549204,0.000020339628,0.00012176609,0.0005479137,0.0005719048,0.004246961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993687,0.000094158335,0.000036142505,0.00016952136,0.00021761682,0.000113802904],"domain_scores_gemma":[0.9993358,0.00023165686,0.00009220053,0.00020899932,0.00008914659,0.000042152617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052254077,0.0011487309,0.00086701475,0.00074962823,0.0006066242,0.0012195336,0.0012919632,0.0009560228,0.005283619],"category_scores_gemma":[0.0020660767,0.00070752227,0.0012358685,0.00059501105,0.0009152915,0.0019582766,0.0016488557,0.0008854251,0.0007882892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017300816,0.00010556852,0.0019711892,0.00022347875,0.00005476546,0.00025511076,0.00026464733,0.7704653,0.0628507,0.030529335,0.0015270248,0.13157997],"study_design_scores_gemma":[0.000017884337,0.0002363234,0.00094176276,0.000025011232,0.000033239477,0.00023333283,0.00013344827,0.91429037,0.03760872,0.040471334,0.0059772776,0.000031304706],"about_ca_topic_score_codex":0.00160326,"about_ca_topic_score_gemma":0.0016606166,"teacher_disagreement_score":0.005283619,"about_ca_system_score_codex":0.00081422273,"about_ca_system_score_gemma":0.00054673565,"threshold_uncertainty_score":0.01767546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08594821,0.00032105588,0.9075615,0.00007556825,0.000021204465,0.00015092858,0.000074826305,0.00081896497,0.0050276937],"genre_scores_gemma":[0.7092931,0.00020179091,0.28795332,0.000041851123,0.000020254562,0.00031284837,0.00013025256,0.00014060418,0.0019059329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989641,0.00045841027,0.0000463608,0.00013048715,0.0003089696,0.000091633534],"domain_scores_gemma":[0.99826366,0.0011455226,0.00025335446,0.00013499087,0.00016063343,0.000041881438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014871606,0.00091194356,0.0010354946,0.0008256312,0.00043770936,0.00094164925,0.00071474933,0.0006467557,0.002387893],"category_scores_gemma":[0.003641576,0.000701016,0.00062306755,0.0004709811,0.00093667005,0.00059956044,0.00081541535,0.00060154573,0.0002868765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006475905,0.000034941582,0.00028629525,0.000051982734,0.000011311032,0.00002291748,0.00003215466,0.9642238,0.003040583,0.0026447747,0.00020569004,0.029380804],"study_design_scores_gemma":[0.000016124017,0.00006566943,0.0001550242,0.0000058687865,0.0000061223627,0.0000071588115,0.0000075171165,0.9964316,0.0010280224,0.0018386788,0.00043400974,0.000004215787],"about_ca_topic_score_codex":0.0035401008,"about_ca_topic_score_gemma":0.0034199124,"teacher_disagreement_score":0.0035401008,"about_ca_system_score_codex":0.0009823162,"about_ca_system_score_gemma":0.0015236179,"threshold_uncertainty_score":0.007988274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02727176,0.0005377046,0.95964026,0.00023603327,0.00017788712,0.00009135074,0.00010375807,0.0002615722,0.011679633],"genre_scores_gemma":[0.5948772,0.0009776073,0.37895805,0.00016741628,0.0001681023,0.00020051881,0.00048610434,0.00020997063,0.02395511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894124,0.00038939595,0.00007611524,0.00022116532,0.00018426083,0.00018786712],"domain_scores_gemma":[0.9995894,0.00016973061,0.00005138814,0.000059845966,0.00008538979,0.000044254077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008757472,0.0011701143,0.0012478384,0.00082650175,0.00080840715,0.0018451429,0.0010569245,0.0018166768,0.00639788],"category_scores_gemma":[0.0018320419,0.0006772449,0.0014782506,0.0017306093,0.00079677283,0.0017492699,0.0025215694,0.0012351661,0.0010821939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009912349,0.00009365797,0.00031506113,0.00014349805,0.00004592023,0.00023253859,0.00006978201,0.9141567,0.0018242584,0.040674333,0.001939935,0.040405203],"study_design_scores_gemma":[0.000018800702,0.00010003588,0.00021719187,0.00001614257,0.000014501037,0.00020029006,0.000044373042,0.9579161,0.0011489028,0.035564065,0.004744803,0.000014760894],"about_ca_topic_score_codex":0.0039199293,"about_ca_topic_score_gemma":0.002291556,"teacher_disagreement_score":0.00639788,"about_ca_system_score_codex":0.00080549886,"about_ca_system_score_gemma":0.00081249897,"threshold_uncertainty_score":0.021403015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0681951,0.0005906684,0.92563623,0.00010347509,0.000051577317,0.0002507913,0.00014733546,0.0011650579,0.0038597442],"genre_scores_gemma":[0.2773078,0.00038285812,0.7197069,0.00006896341,0.000015306732,0.0002127444,0.00033718452,0.00016650333,0.001801652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996618,0.000104315994,0.000026156586,0.000050411218,0.000070000395,0.000087400746],"domain_scores_gemma":[0.9992772,0.0003585134,0.00010853744,0.000117092895,0.000079882026,0.000058789243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435377,0.0009370043,0.0010785769,0.0008779191,0.00054968556,0.0009152636,0.0011341468,0.0006846804,0.0033746343],"category_scores_gemma":[0.0015115436,0.0007846342,0.00067618204,0.0012194965,0.00046821468,0.0015480799,0.0010993085,0.00046835843,0.0007105038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029867358,0.00011026099,0.0011324522,0.00022902129,0.00006737061,0.0001468938,0.00012665089,0.8668579,0.009199565,0.008587971,0.003386044,0.109857194],"study_design_scores_gemma":[0.000039391784,0.00008367793,0.0002599476,0.000013189651,0.000020641264,0.000043485874,0.000038828442,0.99223435,0.0027309193,0.0030755443,0.001441726,0.000018242314],"about_ca_topic_score_codex":0.0041347025,"about_ca_topic_score_gemma":0.0053831176,"teacher_disagreement_score":0.0041347025,"about_ca_system_score_codex":0.00087833573,"about_ca_system_score_gemma":0.0013418512,"threshold_uncertainty_score":0.011289299},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038342122,0.0017377492,0.9166921,0.0005482127,0.0004976751,0.0002718525,0.00032063504,0.00039215886,0.041197494],"genre_scores_gemma":[0.4781242,0.0037205622,0.47441435,0.00047707857,0.00040544308,0.00039925057,0.0010960205,0.00013548006,0.041227628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904567,0.00022486263,0.00006918905,0.00021998849,0.00029168348,0.00014861336],"domain_scores_gemma":[0.9995962,0.0001934726,0.00005502176,0.00003378335,0.00010019677,0.000021268483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786278,0.0009365924,0.0007177824,0.00073999737,0.0010037648,0.0015199265,0.0010381107,0.0009971757,0.004108308],"category_scores_gemma":[0.0015987372,0.0003036472,0.0005268611,0.0012825027,0.000584047,0.0013111881,0.0008800418,0.0008890176,0.0009975847],"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.00025664316,0.0001712974,0.0019056121,0.0009587481,0.00008068692,0.0006498558,0.00028373828,0.39119667,0.0077776886,0.27226406,0.01677041,0.3076846],"study_design_scores_gemma":[0.00005111844,0.00023568611,0.0010826238,0.00013331883,0.00004831671,0.0007399517,0.00025904863,0.7399084,0.010143711,0.21171328,0.03560635,0.000078153615],"about_ca_topic_score_codex":0.0034334522,"about_ca_topic_score_gemma":0.0023711438,"teacher_disagreement_score":0.004108308,"about_ca_system_score_codex":0.000619805,"about_ca_system_score_gemma":0.0009168678,"threshold_uncertainty_score":0.013743639},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013692253,0.027277285,0.74321496,0.0148529615,0.0055066263,0.00010723564,0.00021994156,0.00036319785,0.19476555],"genre_scores_gemma":[0.3826665,0.052404877,0.450465,0.015384288,0.011157555,0.0004148071,0.0003668796,0.0005826628,0.086557426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986461,0.00059580995,0.0000633212,0.00019905575,0.0003862817,0.00010944678],"domain_scores_gemma":[0.9987814,0.00084139826,0.00006613463,0.000079766665,0.00018708673,0.000044353626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019482733,0.00092557137,0.0006236171,0.00095259194,0.0012509288,0.0015855324,0.001400655,0.0018167937,0.009157124],"category_scores_gemma":[0.0036226425,0.00038185774,0.0012658848,0.0016370626,0.0023539013,0.003488672,0.0010999538,0.0030636438,0.0016387453],"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.000019520108,0.000013119787,0.00007934883,0.000193138,0.000009429897,0.000076152864,0.000080056794,0.021508716,0.0005527054,0.9591419,0.0038865437,0.014439346],"study_design_scores_gemma":[0.000014667109,0.00006777167,0.000244753,0.00022133427,0.000016927073,0.00025709576,0.00007820657,0.04910107,0.0018388547,0.80085486,0.14726035,0.000044107055],"about_ca_topic_score_codex":0.0023218554,"about_ca_topic_score_gemma":0.0009694365,"teacher_disagreement_score":0.009157124,"about_ca_system_score_codex":0.0013568037,"about_ca_system_score_gemma":0.0007264367,"threshold_uncertainty_score":0.030633628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12979507,0.0021912754,0.6385971,0.004093671,0.0006644719,0.00018697676,0.0014603089,0.00057468575,0.22243646],"genre_scores_gemma":[0.76346546,0.0020594995,0.14351337,0.0019066841,0.00089012086,0.00039787454,0.0018216624,0.00057979027,0.08536553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771464,0.00060187903,0.00012540328,0.00042831275,0.0007685364,0.00036123832],"domain_scores_gemma":[0.99154574,0.0058990195,0.00045263354,0.00087399717,0.0006424271,0.0005861866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002606167,0.0008448103,0.0011397684,0.0025975509,0.003222063,0.0056714406,0.0024255395,0.0018421488,0.019267779],"category_scores_gemma":[0.011185133,0.0011743578,0.0018266845,0.0025719674,0.003663914,0.014728088,0.006080925,0.006138834,0.0020575046],"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.000057040852,0.00002995634,0.00021539438,0.00006592472,0.000016180049,0.00005084842,0.00015617386,0.0013855417,0.00030479883,0.99050015,0.0027864254,0.0044315164],"study_design_scores_gemma":[0.000020618407,0.000015372325,0.00017514902,0.000028062246,0.000025747533,0.000118866155,0.000119841396,0.0061352155,0.0008523323,0.98761797,0.0048790416,0.000011741831],"about_ca_topic_score_codex":0.0012215595,"about_ca_topic_score_gemma":0.0015272734,"teacher_disagreement_score":0.019267779,"about_ca_system_score_codex":0.0029953383,"about_ca_system_score_gemma":0.0010637972,"threshold_uncertainty_score":0.06445712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3117458,0.0018596401,0.34072623,0.004158984,0.0015872711,0.00026717456,0.0017867584,0.00090802833,0.3369602],"genre_scores_gemma":[0.8481207,0.0011557445,0.08539227,0.0016479666,0.00052937266,0.00037696923,0.0019068051,0.0003594031,0.06051084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901724,0.00018411851,0.000069633104,0.00018432231,0.00031885874,0.00022578129],"domain_scores_gemma":[0.9981358,0.00059547595,0.00027063806,0.00042861432,0.00023764085,0.00033172683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054374273,0.0005841756,0.00060127716,0.0014993707,0.0013827262,0.0037643781,0.0012068966,0.0021997239,0.014760262],"category_scores_gemma":[0.0048315646,0.00051040703,0.0006612716,0.0015116171,0.002268278,0.0039804773,0.0021988405,0.0021913878,0.0019411729],"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.00009487367,0.00006228059,0.0005971275,0.00006873377,0.0000075603,0.00021631001,0.00011416437,0.0011724859,0.0019628254,0.964895,0.008479551,0.02232913],"study_design_scores_gemma":[0.000073141775,0.00004828391,0.0007562082,0.000054862794,0.000012551005,0.0013178416,0.0002178271,0.017680228,0.002330214,0.94635093,0.031124938,0.0000329756],"about_ca_topic_score_codex":0.00034109972,"about_ca_topic_score_gemma":0.00061758404,"teacher_disagreement_score":0.014760262,"about_ca_system_score_codex":0.00068659696,"about_ca_system_score_gemma":0.00056494767,"threshold_uncertainty_score":0.049377978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012196018,0.000035307763,0.99689215,0.00006655029,0.000024274797,0.00001887727,0.000009889601,0.000104460225,0.0016289636],"genre_scores_gemma":[0.06218228,0.00015414575,0.93374914,0.0001848384,0.00007594345,0.00018058556,0.00007357723,0.000160411,0.0032390952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994029,0.00017294465,0.000028102611,0.00008979612,0.00024470952,0.00006155526],"domain_scores_gemma":[0.9994367,0.00025081108,0.000041490468,0.00012227369,0.00011050901,0.000038155795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007436483,0.0006985802,0.0006888099,0.0008210595,0.000616052,0.0008210764,0.0010789961,0.0006912272,0.0054938835],"category_scores_gemma":[0.0018932933,0.00042398032,0.0011288744,0.00093662326,0.0008355878,0.0016632803,0.0015195719,0.0028282634,0.0011085311],"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.00011735199,0.00024667205,0.000530662,0.00028715568,0.00009495654,0.00021177558,0.00019200362,0.20585105,0.024965372,0.5502387,0.01079605,0.20646824],"study_design_scores_gemma":[0.000029993489,0.00005585978,0.00011414428,0.000016038395,0.00001815261,0.00013951812,0.000019977035,0.90092665,0.0030160786,0.085152484,0.010494892,0.000016145606],"about_ca_topic_score_codex":0.0011623717,"about_ca_topic_score_gemma":0.0012106329,"teacher_disagreement_score":0.0054938835,"about_ca_system_score_codex":0.000442686,"about_ca_system_score_gemma":0.0010811008,"threshold_uncertainty_score":0.018378854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120446915,0.00027590944,0.982547,0.000158938,0.00005959618,0.00003384069,0.000020724252,0.00026948715,0.0045898133],"genre_scores_gemma":[0.436605,0.00044010306,0.55660915,0.00022850868,0.00007471537,0.00033998996,0.000079789665,0.00027798172,0.005344642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959475,0.00018674404,0.000015813936,0.00004265217,0.00012932137,0.000030701583],"domain_scores_gemma":[0.99895287,0.00074876024,0.00005287224,0.000095915646,0.0001099219,0.00003969173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011488413,0.0005208448,0.00078997813,0.00049784733,0.00041604033,0.000752938,0.00083206204,0.00084706437,0.0034882077],"category_scores_gemma":[0.0041663074,0.00039926506,0.00046434955,0.00051405816,0.0008909357,0.0010260117,0.0012997115,0.0010642639,0.0005545082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009329955,0.000052400133,0.0005807915,0.00009281651,0.000028491684,0.00007674319,0.000081701895,0.8774469,0.0034981964,0.049543805,0.0015878025,0.06691709],"study_design_scores_gemma":[0.000008182598,0.000010347898,0.000025411815,0.000003962159,0.0000015886883,0.0000069798566,0.0000033141087,0.99409544,0.00027985635,0.0049803294,0.00058236887,0.00000214735],"about_ca_topic_score_codex":0.00174388,"about_ca_topic_score_gemma":0.0016243289,"teacher_disagreement_score":0.0034882077,"about_ca_system_score_codex":0.00053317985,"about_ca_system_score_gemma":0.0006784623,"threshold_uncertainty_score":0.011669219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004968254,0.00014099982,0.9878001,0.0001471095,0.000062308914,0.00009345605,0.00005771872,0.00025992992,0.006470099],"genre_scores_gemma":[0.12774909,0.00024467477,0.8657421,0.00021452733,0.000073933275,0.0005486366,0.00025016337,0.00024005424,0.004936856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984433,0.0005931994,0.000052099465,0.00014372452,0.00056065223,0.0002070016],"domain_scores_gemma":[0.9972573,0.0018344901,0.00010945667,0.00023793263,0.00044277776,0.00011797878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015588803,0.001319034,0.0017009338,0.0014483236,0.00097277237,0.0016684581,0.0027203076,0.0020205758,0.008937135],"category_scores_gemma":[0.006851013,0.0008138942,0.0014715819,0.0019887753,0.0009436026,0.0023427054,0.0031335708,0.0024038488,0.0016168769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021883941,0.0002673183,0.00055468606,0.000347372,0.00005672666,0.00017563575,0.00021087789,0.72242165,0.0029186702,0.088302575,0.006606135,0.17791954],"study_design_scores_gemma":[0.00001704981,0.000034051314,0.0000541219,0.000018295106,0.000007023033,0.000037377762,0.000024192901,0.9798997,0.00041122836,0.018304665,0.0011836855,0.0000085722995],"about_ca_topic_score_codex":0.0031687357,"about_ca_topic_score_gemma":0.0046883416,"teacher_disagreement_score":0.008937135,"about_ca_system_score_codex":0.0007906443,"about_ca_system_score_gemma":0.0023730465,"threshold_uncertainty_score":0.02989775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026018957,0.0018315479,0.8728542,0.00095893384,0.0005341909,0.00019782982,0.00046057868,0.00043686552,0.096706934],"genre_scores_gemma":[0.49671963,0.006456111,0.2504048,0.00071131496,0.0006228468,0.0005518848,0.0014887665,0.00062255166,0.24242201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990908,0.00020730364,0.00006150255,0.00022756714,0.0002476256,0.00016523132],"domain_scores_gemma":[0.9985794,0.00065058743,0.00009477775,0.00026873077,0.00025513937,0.0001514739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010354532,0.0011798127,0.0014435971,0.00092592376,0.0014182039,0.0032107686,0.0026051407,0.002222713,0.023290887],"category_scores_gemma":[0.004444787,0.0009927673,0.0016106962,0.0030518132,0.002012448,0.0047027846,0.0022917076,0.0040431106,0.0041812654],"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.00008382747,0.00005387456,0.00011865766,0.00009229917,0.000014244209,0.00007347203,0.00009539322,0.041821398,0.00086089666,0.9320781,0.0035953661,0.021112477],"study_design_scores_gemma":[0.000024953208,0.000020165351,0.00005642578,0.000021888152,0.000010652257,0.000041936673,0.00003217697,0.097448245,0.0008175002,0.8952304,0.006284074,0.00001158909],"about_ca_topic_score_codex":0.002142358,"about_ca_topic_score_gemma":0.0019252948,"teacher_disagreement_score":0.023290887,"about_ca_system_score_codex":0.0015092554,"about_ca_system_score_gemma":0.0010793185,"threshold_uncertainty_score":0.07791585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012166305,0.00067782303,0.9744186,0.0005927442,0.00016009648,0.00017967133,0.00041418627,0.0018974642,0.0094930045],"genre_scores_gemma":[0.12430852,0.00058735156,0.8675343,0.00029792223,0.00010417798,0.00038644555,0.0012338263,0.00033712183,0.0052104075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984768,0.00030482805,0.00007705466,0.0003415518,0.000494266,0.00030547148],"domain_scores_gemma":[0.998425,0.00084959314,0.00012667214,0.00031471273,0.00019324776,0.00009081005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355369,0.0016851962,0.0015225122,0.0011744513,0.0009819228,0.0017807405,0.0025297562,0.0019301,0.010273018],"category_scores_gemma":[0.004425442,0.00069120945,0.0014016558,0.0022385216,0.0007591054,0.0028521505,0.0019018857,0.0025527487,0.0023512219],"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.00043945538,0.0003018651,0.0007764512,0.00029084148,0.00008228226,0.00016640252,0.00019631856,0.56840295,0.0031450896,0.065102644,0.027432915,0.3336628],"study_design_scores_gemma":[0.00009708538,0.000062987565,0.00012693416,0.000020966192,0.000021375003,0.00011199723,0.000038173952,0.95965487,0.0007433855,0.03235126,0.006756014,0.000014900997],"about_ca_topic_score_codex":0.0072289472,"about_ca_topic_score_gemma":0.008702375,"teacher_disagreement_score":0.010273018,"about_ca_system_score_codex":0.0022408874,"about_ca_system_score_gemma":0.0031730854,"threshold_uncertainty_score":0.034366667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016164955,0.00026510813,0.97976905,0.00013266831,0.000029731458,0.00013212198,0.00002935701,0.0001489948,0.0033280815],"genre_scores_gemma":[0.35193485,0.0005329143,0.6404723,0.00018615683,0.00009995074,0.0004910621,0.00018956068,0.00013416316,0.005959104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.00017762426,0.0000139818785,0.000054116055,0.00015345674,0.000049610644],"domain_scores_gemma":[0.99885,0.00085847016,0.00007639714,0.000046675967,0.00011308104,0.000055330744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016841993,0.0007611999,0.0008236035,0.000856724,0.00044747794,0.00058649114,0.001255964,0.00072252273,0.003795061],"category_scores_gemma":[0.0025890048,0.0004204247,0.0007343831,0.00087788014,0.0006994531,0.0007954483,0.00085723144,0.000877945,0.00045381943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014132,0.000080831305,0.00051799347,0.00017836023,0.00004896247,0.000170429,0.00010634614,0.86682475,0.004121658,0.030452436,0.002269039,0.095087804],"study_design_scores_gemma":[0.000025538046,0.00006204115,0.000086019856,0.000009095881,0.000008513034,0.0000292944,0.000010479033,0.9928001,0.0005512699,0.0054536737,0.000959405,0.0000046791542],"about_ca_topic_score_codex":0.0019562496,"about_ca_topic_score_gemma":0.0026012855,"teacher_disagreement_score":0.003795061,"about_ca_system_score_codex":0.0006730215,"about_ca_system_score_gemma":0.0013719224,"threshold_uncertainty_score":0.01269573},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09815353,0.0010779422,0.86929727,0.0017427643,0.00012520098,0.0001364151,0.000107691354,0.00019902451,0.029160269],"genre_scores_gemma":[0.63630885,0.001605271,0.35621038,0.00050100486,0.0001573555,0.00024247896,0.00014540394,0.0004029999,0.0044262405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975504,0.0014598422,0.000066533285,0.00017833442,0.00047552667,0.00026933855],"domain_scores_gemma":[0.98492163,0.013090567,0.0006257124,0.00061101734,0.0005456684,0.00020548032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004156228,0.0010180314,0.0012070782,0.00093399873,0.0011330843,0.0023561665,0.0012543023,0.0012426926,0.0071747927],"category_scores_gemma":[0.026555128,0.0006607711,0.0007417384,0.0022657542,0.0022719456,0.0041153175,0.0017962817,0.0020604753,0.0006699347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002159012,0.000080021535,0.0005629324,0.00014942435,0.0000263168,0.00010536724,0.00012743735,0.83787596,0.0016043695,0.11441925,0.0026927001,0.042140305],"study_design_scores_gemma":[0.000030548927,0.00006370648,0.00013580066,0.000020475847,0.000009844931,0.000028468838,0.000057483303,0.9503082,0.0010512919,0.04730352,0.000978986,0.0000115517],"about_ca_topic_score_codex":0.0050190464,"about_ca_topic_score_gemma":0.0042909677,"teacher_disagreement_score":0.0071747927,"about_ca_system_score_codex":0.0015540288,"about_ca_system_score_gemma":0.0015002112,"threshold_uncertainty_score":0.024002075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048759673,0.04553844,0.77535295,0.0038184316,0.0014923041,0.000066415014,0.00032366224,0.0003923154,0.16813953],"genre_scores_gemma":[0.23926921,0.10531374,0.51389974,0.0020011836,0.0047755237,0.00060818886,0.0016961561,0.00084588374,0.13159037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937123,0.00023161492,0.000025163114,0.00011036875,0.00020742255,0.000054237527],"domain_scores_gemma":[0.99950445,0.0003071411,0.000036228485,0.000085778534,0.000044745717,0.000021613672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081806496,0.0017760542,0.0012725415,0.0012173338,0.0007222648,0.003454878,0.0017306851,0.0021247792,0.010509358],"category_scores_gemma":[0.0025876507,0.0005698106,0.001012167,0.005044974,0.0027355552,0.0045659295,0.0016090852,0.0036736296,0.0023790502],"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.000014385834,0.00003283286,0.00007949452,0.00018740143,0.000024711277,0.00002659018,0.000035706,0.051910963,0.00024422462,0.82216567,0.02022965,0.10504832],"study_design_scores_gemma":[0.000005205756,0.000011147941,0.000058957816,0.00006420847,0.000006832808,0.000043595413,0.000026843374,0.040497437,0.00013511922,0.9311556,0.027985536,0.000009471165],"about_ca_topic_score_codex":0.0020096353,"about_ca_topic_score_gemma":0.0019306716,"teacher_disagreement_score":0.010509358,"about_ca_system_score_codex":0.0014353065,"about_ca_system_score_gemma":0.0010912071,"threshold_uncertainty_score":0.035157323},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036079094,0.00014009376,0.99261063,0.00004106422,0.00003682363,0.00004742134,0.00004105114,0.00017242118,0.00330257],"genre_scores_gemma":[0.061050978,0.00031585354,0.93615973,0.000057015357,0.000041738,0.00021945132,0.00021126358,0.00019748765,0.0017465352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838054,0.00063959346,0.00008147735,0.00018356404,0.00055589894,0.00015878859],"domain_scores_gemma":[0.9985532,0.00079470535,0.000099688026,0.00027986473,0.00020705165,0.00006556263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019109253,0.0015007443,0.0014808191,0.00174619,0.0005969617,0.002075405,0.0013854918,0.00082453084,0.00529466],"category_scores_gemma":[0.004058873,0.00090039393,0.0018259882,0.0023303905,0.0011274865,0.001623593,0.0029135454,0.0036729767,0.00135547],"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.0002062785,0.00014790017,0.00070342474,0.00042486982,0.000091872105,0.00011923641,0.0001672376,0.5368511,0.0054458566,0.20097385,0.0039982144,0.25087017],"study_design_scores_gemma":[0.000034689576,0.00007067985,0.00008810725,0.000045450754,0.00002269182,0.00008066345,0.000026132451,0.93057686,0.0028969953,0.057656523,0.008486187,0.000015013705],"about_ca_topic_score_codex":0.0015110278,"about_ca_topic_score_gemma":0.0012704881,"teacher_disagreement_score":0.00529466,"about_ca_system_score_codex":0.0009219271,"about_ca_system_score_gemma":0.0012909134,"threshold_uncertainty_score":0.017712355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17755075,0.0017897701,0.7582666,0.0005671722,0.00029557044,0.0001775544,0.0009509967,0.00038395738,0.060017668],"genre_scores_gemma":[0.6823585,0.0011249512,0.29652002,0.00015135895,0.00012883195,0.00017118956,0.0009721191,0.00021013527,0.018362902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993749,0.0001562159,0.000029147548,0.00021822647,0.00014565256,0.000075786775],"domain_scores_gemma":[0.9989838,0.00041276633,0.00022929438,0.00012494932,0.00010003221,0.00014918137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003651579,0.0008587955,0.000888236,0.0007774182,0.0006671352,0.0014739183,0.00068332686,0.0007152024,0.0044035963],"category_scores_gemma":[0.0024674018,0.00057412504,0.0004158379,0.0014665946,0.0011494735,0.00120486,0.001098829,0.00074807816,0.0009249436],"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.0019274743,0.00018785897,0.003769761,0.0010527968,0.00009298819,0.0011580943,0.00019796744,0.36609843,0.030485017,0.40060765,0.015993295,0.17842858],"study_design_scores_gemma":[0.00010592038,0.0003532788,0.0032838979,0.00015423028,0.000040280476,0.001887656,0.00036544638,0.5193474,0.039459202,0.4106377,0.024251822,0.00011318529],"about_ca_topic_score_codex":0.0007366226,"about_ca_topic_score_gemma":0.0011143718,"teacher_disagreement_score":0.0044035963,"about_ca_system_score_codex":0.00058577576,"about_ca_system_score_gemma":0.0006323559,"threshold_uncertainty_score":0.014731467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042542308,0.0002457146,0.99120367,0.00017849269,0.000047537374,0.00007237291,0.000053622418,0.00009530965,0.0038491015],"genre_scores_gemma":[0.17879558,0.0010068803,0.8118355,0.00022459487,0.00014760016,0.00055865204,0.0002985549,0.00019630376,0.006936292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992067,0.00029081135,0.000027885382,0.00013326584,0.00020225416,0.00013905774],"domain_scores_gemma":[0.99933654,0.0004507589,0.00005799722,0.00004012671,0.000075363394,0.00003915884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634181,0.0017131103,0.0016439133,0.0012133925,0.0006643865,0.0019860761,0.0018736968,0.001637716,0.0058463262],"category_scores_gemma":[0.0024100922,0.0010185223,0.0014156933,0.0021802224,0.0007426388,0.0015676364,0.0013010962,0.002255362,0.0006606596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042288742,0.0000939533,0.00014469639,0.00014712327,0.000028322627,0.00007770986,0.000056509525,0.91064066,0.0012250928,0.055236854,0.0023121152,0.029994668],"study_design_scores_gemma":[0.000009960296,0.00002235862,0.000025003383,0.000009301457,0.000007292628,0.000021730963,0.000018656649,0.98401505,0.00021442374,0.01448921,0.0011631503,0.000003874427],"about_ca_topic_score_codex":0.0040341807,"about_ca_topic_score_gemma":0.0031449012,"teacher_disagreement_score":0.0058463262,"about_ca_system_score_codex":0.0017813008,"about_ca_system_score_gemma":0.0019283098,"threshold_uncertainty_score":0.019557893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34768388,0.0022579075,0.6255891,0.0023684104,0.0004540256,0.00037046065,0.0005002237,0.00070096226,0.020074964],"genre_scores_gemma":[0.7909537,0.0008153412,0.1545045,0.00018905965,0.00030215073,0.00030595565,0.0007057512,0.0005194462,0.05170417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717253,0.0010567599,0.00015053063,0.0006119826,0.00051354757,0.0004946967],"domain_scores_gemma":[0.99320614,0.004450538,0.00048480966,0.00050739147,0.0006414042,0.0007097381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037350047,0.0017153005,0.0034329663,0.0016805561,0.002658766,0.004791739,0.002927858,0.006397483,0.013805912],"category_scores_gemma":[0.013367444,0.001544227,0.0021473148,0.0027446148,0.0024298667,0.004535505,0.003722485,0.0027195055,0.0013553087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006837944,0.0002740607,0.0020977694,0.00041759628,0.00017998468,0.001269435,0.00034293171,0.8959472,0.003718637,0.033770323,0.0046483735,0.056649875],"study_design_scores_gemma":[0.000075974516,0.0004282169,0.001030331,0.000062487066,0.00007201099,0.0006295054,0.00045673095,0.96133554,0.0023560042,0.028484562,0.0050296546,0.00003896125],"about_ca_topic_score_codex":0.007871406,"about_ca_topic_score_gemma":0.0050407005,"teacher_disagreement_score":0.013805912,"about_ca_system_score_codex":0.0016184287,"about_ca_system_score_gemma":0.0012128287,"threshold_uncertainty_score":0.046185434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004092523,0.00043084822,0.990728,0.00017834529,0.00007736235,0.000077401615,0.00009334743,0.00019252028,0.0041296156],"genre_scores_gemma":[0.26410708,0.0013191638,0.7259511,0.0005146278,0.00026148258,0.00070316327,0.00074688374,0.00027768363,0.0061189113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847645,0.0005967581,0.00007046697,0.0001820735,0.0005147772,0.00015946598],"domain_scores_gemma":[0.9971903,0.0018228415,0.00030765866,0.00024249763,0.00035378753,0.00008301315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023788805,0.0015703277,0.00096917787,0.0014281212,0.0006781359,0.0017112341,0.0012116313,0.0013102476,0.0072412463],"category_scores_gemma":[0.007931448,0.0006230462,0.0010918379,0.0018176975,0.0013637481,0.0015725543,0.0016955255,0.0037873841,0.0013421316],"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.00025144318,0.00016409255,0.0003774224,0.0003707378,0.000045841804,0.00019418,0.00014204087,0.63142896,0.008879194,0.24682276,0.008186663,0.103136666],"study_design_scores_gemma":[0.000038973027,0.000042267155,0.000067471134,0.000041149,0.000011470588,0.000042114898,0.000011650257,0.9445287,0.003281091,0.04864128,0.0032814262,0.0000124176],"about_ca_topic_score_codex":0.0012051562,"about_ca_topic_score_gemma":0.0011743244,"teacher_disagreement_score":0.0072412463,"about_ca_system_score_codex":0.0011603743,"about_ca_system_score_gemma":0.0010995833,"threshold_uncertainty_score":0.0242244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33245054,0.003335231,0.545724,0.005919011,0.0010457702,0.00032699213,0.0013908043,0.001896481,0.10791121],"genre_scores_gemma":[0.71319574,0.0020843127,0.2157001,0.00062965706,0.0002446711,0.00017627973,0.0014778911,0.0004541774,0.066037245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992524,0.00017452482,0.00004326104,0.00022953961,0.0001362788,0.00016403628],"domain_scores_gemma":[0.99909055,0.00035784655,0.00011731433,0.00019730987,0.00010668204,0.00013031614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005853639,0.0011425589,0.001343968,0.0005776296,0.0015711586,0.0019252104,0.0013312781,0.0022267862,0.02611737],"category_scores_gemma":[0.0042850613,0.0008395403,0.0007736971,0.0015648631,0.0011373227,0.0041196723,0.0019289191,0.0010279454,0.0054112095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017505715,0.00033209348,0.004029132,0.0007739342,0.00020818994,0.0022542807,0.0005607486,0.48424807,0.015213276,0.14350282,0.047677305,0.29944962],"study_design_scores_gemma":[0.00012948259,0.0006493125,0.0021779384,0.00022197021,0.0001252241,0.001357153,0.0009926739,0.69231284,0.015592576,0.19530563,0.09102113,0.000114079514],"about_ca_topic_score_codex":0.0040196786,"about_ca_topic_score_gemma":0.0037303714,"teacher_disagreement_score":0.02611737,"about_ca_system_score_codex":0.00085507287,"about_ca_system_score_gemma":0.00073344813,"threshold_uncertainty_score":0.08737123},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13520901,0.0016888011,0.8395484,0.0006334932,0.00016274974,0.0005401283,0.0005744358,0.0021519477,0.01949097],"genre_scores_gemma":[0.42623618,0.00056415104,0.5664696,0.00025980908,0.000050440434,0.0007702634,0.00072343706,0.00029436097,0.004631804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930894,0.00043459708,0.000017078344,0.00005407384,0.00007883214,0.00010646741],"domain_scores_gemma":[0.99834394,0.0012256865,0.00012543933,0.00008275653,0.00014955674,0.000072527706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013157385,0.00090784155,0.0012376945,0.0016025673,0.0009766765,0.0014844949,0.0015034067,0.0014831729,0.0077281888],"category_scores_gemma":[0.0034340709,0.0007042241,0.0005880769,0.0022249583,0.0009781725,0.001080537,0.0007515802,0.0007635786,0.0010942364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008880216,0.000093098664,0.00030828675,0.00006181855,0.00002616831,0.000053825286,0.0000526425,0.95110875,0.00042193275,0.0066194055,0.0025985404,0.038566794],"study_design_scores_gemma":[0.000042262796,0.000035440058,0.0000692939,0.00001295742,0.000008015867,0.000014243203,0.000024930581,0.9961826,0.00018636465,0.002649646,0.00076826685,0.0000059250233],"about_ca_topic_score_codex":0.009768316,"about_ca_topic_score_gemma":0.007756586,"teacher_disagreement_score":0.009768316,"about_ca_system_score_codex":0.0015544416,"about_ca_system_score_gemma":0.0021172473,"threshold_uncertainty_score":0.025853395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14466721,0.00049269316,0.8258463,0.0007875858,0.000044903645,0.00022133334,0.00036452984,0.0004097558,0.027165651],"genre_scores_gemma":[0.83826095,0.0006030144,0.1515629,0.000053726915,0.000019640866,0.00026844972,0.000346115,0.0001405812,0.008744612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994081,0.00023822076,0.000019342504,0.00009789445,0.00013096677,0.00010550095],"domain_scores_gemma":[0.9993604,0.00043660105,0.000067807036,0.000045451743,0.0000562042,0.000033545508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061565486,0.0011436119,0.0005883121,0.00047364796,0.00047809194,0.0014692547,0.00084116147,0.0016282364,0.004885313],"category_scores_gemma":[0.0018867214,0.00059930247,0.00079939427,0.0008296288,0.0011277405,0.0014048438,0.0006538775,0.0010684564,0.00037763594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001553133,0.000015622363,0.00016524196,0.000025985833,0.0000049213063,0.000050124225,0.000015442625,0.98913574,0.0008418704,0.006949927,0.00015291989,0.002626686],"study_design_scores_gemma":[0.000012295873,0.000046878165,0.00016792552,0.0000068365343,0.000009906222,0.000027029195,0.000036794427,0.990672,0.0008966988,0.0070966925,0.0010210241,0.000005876826],"about_ca_topic_score_codex":0.011867309,"about_ca_topic_score_gemma":0.009915101,"teacher_disagreement_score":0.011867309,"about_ca_system_score_codex":0.0015101,"about_ca_system_score_gemma":0.0015446321,"threshold_uncertainty_score":0.023596466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06261807,0.0005249871,0.932144,0.00028147688,0.00008731514,0.00015237254,0.000038353664,0.00037135108,0.003782051],"genre_scores_gemma":[0.5562799,0.00043009364,0.4393889,0.00022862053,0.000052774605,0.0004849879,0.00011691742,0.00007332977,0.0029444846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994766,0.00019653502,0.000019586076,0.000081795195,0.00015190757,0.00007368834],"domain_scores_gemma":[0.9993363,0.00035740976,0.0000754255,0.00004731915,0.000142614,0.000040983152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010887448,0.0008667826,0.0010542982,0.0008145669,0.00055749924,0.00063626247,0.0014669738,0.001347911,0.0010959823],"category_scores_gemma":[0.002249272,0.000420108,0.0006839053,0.00087808265,0.00065310963,0.0005860483,0.0010018154,0.00073825725,0.00023991869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038573122,0.000030706313,0.000452981,0.000031332762,0.000032880795,0.00006129347,0.00004069625,0.96806425,0.0013795135,0.0031079252,0.00030899563,0.026450796],"study_design_scores_gemma":[0.000021999203,0.000032880158,0.00007435098,0.0000034554018,0.000008167054,0.000015869116,0.000005567705,0.99849653,0.00026293853,0.0007877685,0.00028685655,0.0000035595945],"about_ca_topic_score_codex":0.0060104113,"about_ca_topic_score_gemma":0.0043611415,"teacher_disagreement_score":0.0060104113,"about_ca_system_score_codex":0.00072778953,"about_ca_system_score_gemma":0.0015857801,"threshold_uncertainty_score":0.0119508505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049300357,0.00016567357,0.9903858,0.0001275589,0.000054122072,0.000085874366,0.000053636297,0.00026237642,0.0039350153],"genre_scores_gemma":[0.09010372,0.00030046556,0.90531754,0.00011287203,0.000058837915,0.0002847731,0.0002884659,0.00013791955,0.0033953323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942744,0.00020083443,0.000023977242,0.00011188412,0.00017086261,0.000065122964],"domain_scores_gemma":[0.9993438,0.00037360037,0.000058574282,0.00005403356,0.00012794923,0.000041993502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075772643,0.00096245046,0.0009959433,0.0011795615,0.0008408168,0.0011160929,0.0011327033,0.0011048854,0.005447691],"category_scores_gemma":[0.0024180147,0.00060453877,0.00068600435,0.0013566919,0.00059929676,0.0015526504,0.0016448074,0.0017394611,0.0011076755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091112684,0.00016285447,0.00039412387,0.00019227085,0.000037388756,0.000106053936,0.00016636307,0.71149397,0.0035189888,0.0739923,0.0071831164,0.20266141],"study_design_scores_gemma":[0.000020766063,0.00003806765,0.000043749667,0.000012663244,0.000006755475,0.00005212797,0.000022275057,0.98302436,0.00055859186,0.013145351,0.0030676003,0.000007760947],"about_ca_topic_score_codex":0.0026974448,"about_ca_topic_score_gemma":0.0026054506,"teacher_disagreement_score":0.005447691,"about_ca_system_score_codex":0.0007641671,"about_ca_system_score_gemma":0.0019624925,"threshold_uncertainty_score":0.018224299},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018339808,0.0000580358,0.9948742,0.000040597282,0.000020684263,0.0000555731,0.000095210155,0.0012562881,0.001765399],"genre_scores_gemma":[0.04089875,0.000114698734,0.95492375,0.000055493892,0.000024059249,0.00019691391,0.00047615083,0.0007722311,0.0025378212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982969,0.00058862247,0.00014254775,0.00027784388,0.0005361621,0.0001579308],"domain_scores_gemma":[0.99678683,0.0021168326,0.00013949735,0.0005478752,0.00032154363,0.00008740516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022482066,0.0010190842,0.001317109,0.0015247384,0.0007907358,0.0020322276,0.0021897503,0.0011858405,0.015128958],"category_scores_gemma":[0.009510836,0.0013565484,0.0024691643,0.001918443,0.0010894823,0.0024702745,0.00309495,0.0031799842,0.0030573022],"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.00017544515,0.00014279311,0.0004134009,0.000566907,0.0000708226,0.00020502134,0.00041925482,0.3853039,0.0064760107,0.19118349,0.008904827,0.40613806],"study_design_scores_gemma":[0.00004982738,0.00007588021,0.00008715687,0.000116440075,0.00004669137,0.00010165891,0.00007262435,0.7879828,0.0036871862,0.192298,0.015447291,0.000034431207],"about_ca_topic_score_codex":0.0022951236,"about_ca_topic_score_gemma":0.0041439706,"teacher_disagreement_score":0.015128958,"about_ca_system_score_codex":0.0009875416,"about_ca_system_score_gemma":0.0013474431,"threshold_uncertainty_score":0.050611436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026150523,0.000030093053,0.9931728,0.000060981947,0.000022267235,0.00011192768,0.00015871563,0.0017296247,0.0020985063],"genre_scores_gemma":[0.0229272,0.000047664955,0.9731548,0.000029221377,0.000007181332,0.00024033629,0.00061064697,0.00037558153,0.0026073002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996055,0.000050388284,0.000029429511,0.00012627858,0.00014663457,0.000041763476],"domain_scores_gemma":[0.99901116,0.0004308952,0.00007718205,0.00018895029,0.0002321127,0.00005964286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007878494,0.0012839974,0.0009605469,0.0015664219,0.001054982,0.0015375899,0.0020711706,0.0016126443,0.017164147],"category_scores_gemma":[0.002800184,0.0009302142,0.0014991816,0.0012012944,0.0008965365,0.0013260981,0.0028364516,0.001531989,0.0044513643],"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.00016617942,0.00021268346,0.001375076,0.0005515303,0.00012532138,0.0003243063,0.00048508195,0.2512831,0.01688648,0.110522114,0.024830265,0.5932378],"study_design_scores_gemma":[0.000085672415,0.00008703791,0.00025741576,0.00006003087,0.000037191992,0.0002653905,0.00014993033,0.8893456,0.008763795,0.078783095,0.022126243,0.00003869982],"about_ca_topic_score_codex":0.0035850278,"about_ca_topic_score_gemma":0.0069914865,"teacher_disagreement_score":0.017164147,"about_ca_system_score_codex":0.00096020417,"about_ca_system_score_gemma":0.0013084387,"threshold_uncertainty_score":0.057419777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004638541,0.00022183608,0.9928451,0.000080105456,0.00005254782,0.000071543865,0.00016727953,0.00079230516,0.0011307708],"genre_scores_gemma":[0.07646381,0.00038951277,0.91716576,0.00009694972,0.00008398865,0.00051885203,0.0016405943,0.00052765093,0.0031129061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982109,0.00043026064,0.0001214999,0.00032090157,0.0007915259,0.00012493327],"domain_scores_gemma":[0.9960925,0.0017777997,0.00021058838,0.00097487966,0.0008213021,0.00012289193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102936,0.0014580236,0.0018319103,0.0024602788,0.0013560711,0.0017771265,0.0020384407,0.0016589336,0.005204831],"category_scores_gemma":[0.009000765,0.0010777741,0.0015127704,0.004013414,0.0011538716,0.0024886134,0.0029110294,0.002633006,0.003729367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004060799,0.00013443043,0.0011550634,0.00047776682,0.000102656144,0.00015432396,0.00047750946,0.5332262,0.011918068,0.10907849,0.012604045,0.33026528],"study_design_scores_gemma":[0.00001876566,0.000044654407,0.0001847405,0.000019321415,0.0000063873927,0.00006631429,0.000041039173,0.93416995,0.0043194415,0.054389056,0.006720066,0.000020356494],"about_ca_topic_score_codex":0.0024541449,"about_ca_topic_score_gemma":0.0019165566,"teacher_disagreement_score":0.005204831,"about_ca_system_score_codex":0.0012960606,"about_ca_system_score_gemma":0.0009873427,"threshold_uncertainty_score":0.017411888},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021538553,0.0005509977,0.9867575,0.0003791776,0.00010502534,0.00012029094,0.00013895326,0.00016143656,0.009632789],"genre_scores_gemma":[0.0481864,0.001408239,0.9440781,0.0004050232,0.0002701484,0.00057877245,0.0004583089,0.0002682294,0.004346817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957343,0.0012546157,0.00028366418,0.00079773937,0.0016398245,0.00028987395],"domain_scores_gemma":[0.9978871,0.0011752414,0.00021779875,0.00040944817,0.00020402565,0.00010640092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031514526,0.0022169857,0.0019940548,0.0015408252,0.0017646066,0.0039066416,0.0031332567,0.0029032489,0.010117691],"category_scores_gemma":[0.009247986,0.0014167102,0.0028124216,0.004485128,0.0030181576,0.0068766493,0.0035057417,0.007074368,0.0041767047],"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.00020773648,0.00015478025,0.0005440778,0.0005546818,0.00007001915,0.0002369439,0.0002708427,0.081839025,0.0036637066,0.70471084,0.0157844,0.191963],"study_design_scores_gemma":[0.00006898839,0.00021931848,0.0002435017,0.0001423415,0.00003689859,0.0005859666,0.000105035935,0.24886917,0.002571947,0.6973548,0.049748953,0.000053102205],"about_ca_topic_score_codex":0.0013508861,"about_ca_topic_score_gemma":0.0012192153,"teacher_disagreement_score":0.010117691,"about_ca_system_score_codex":0.0013364925,"about_ca_system_score_gemma":0.00236403,"threshold_uncertainty_score":0.033847034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020481113,0.00045155777,0.96907544,0.00044580392,0.00011028562,0.00008990217,0.00041860418,0.00035367103,0.008573442],"genre_scores_gemma":[0.24424319,0.0006245607,0.74060327,0.0003697904,0.00024007489,0.0002755277,0.002434179,0.0006177876,0.010591657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847764,0.0004378062,0.00007800706,0.00030501094,0.0005854492,0.00011604034],"domain_scores_gemma":[0.99403584,0.0044720517,0.00029000224,0.00055651146,0.0005110854,0.00013457346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016875457,0.0009562343,0.0015095903,0.001957861,0.0007151489,0.0023630476,0.0014102517,0.0014179818,0.012188879],"category_scores_gemma":[0.012783734,0.0013364104,0.0013593795,0.0026078855,0.0013634572,0.004389462,0.0022328014,0.0042776945,0.0012413734],"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.00034229536,0.00018463671,0.00079286285,0.00050399976,0.00012851914,0.0002819459,0.000306934,0.2590182,0.0032175872,0.4560371,0.021270478,0.25791547],"study_design_scores_gemma":[0.000024938512,0.00003290832,0.00020553927,0.000060811115,0.000025887743,0.000114846756,0.00006227809,0.47809327,0.0016418352,0.51488847,0.0048395284,0.000009699667],"about_ca_topic_score_codex":0.0011096157,"about_ca_topic_score_gemma":0.0021465998,"teacher_disagreement_score":0.012188879,"about_ca_system_score_codex":0.00094042975,"about_ca_system_score_gemma":0.0006084539,"threshold_uncertainty_score":0.040775895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008591975,0.00047824212,0.9865689,0.00019922432,0.00003077581,0.00012776234,0.00012670185,0.0011810897,0.002695424],"genre_scores_gemma":[0.13487571,0.00033440773,0.8582465,0.00025541065,0.00004218114,0.0005983003,0.00077936315,0.0003556184,0.004512417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922574,0.000275764,0.000037175174,0.00019281785,0.00017629014,0.00009222889],"domain_scores_gemma":[0.99864167,0.0008458524,0.0001236443,0.00014743798,0.00016368029,0.000077664874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698192,0.0009344554,0.0012427825,0.0010972009,0.00073280494,0.0010553538,0.0020106484,0.0015663429,0.008929148],"category_scores_gemma":[0.004209347,0.0006426717,0.0009541847,0.0020124307,0.0008274627,0.0028545924,0.0018843665,0.002028165,0.0021279643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058611005,0.00041753365,0.0011364748,0.0005285144,0.00014350249,0.00019628312,0.000312753,0.5986801,0.006564931,0.039593037,0.01962086,0.33221984],"study_design_scores_gemma":[0.00012326273,0.00010420904,0.00013904793,0.00003432457,0.000024790656,0.00011242728,0.00006886287,0.9795195,0.0013721279,0.015553393,0.002932715,0.000015318476],"about_ca_topic_score_codex":0.0036433307,"about_ca_topic_score_gemma":0.005124993,"teacher_disagreement_score":0.008929148,"about_ca_system_score_codex":0.0012749296,"about_ca_system_score_gemma":0.0017569236,"threshold_uncertainty_score":0.029871047},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022505099,0.00013790336,0.97448075,0.000032809035,0.000027884316,0.000037937898,0.000034395613,0.0007118666,0.002031421],"genre_scores_gemma":[0.3108534,0.000298991,0.6836273,0.000063705986,0.000038526894,0.000103219405,0.000366699,0.00020970944,0.004438503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949133,0.000055831868,0.000032682896,0.00009172475,0.00027649046,0.000051880714],"domain_scores_gemma":[0.999519,0.00013850897,0.000057250534,0.00012301351,0.00013180859,0.000030521507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025380915,0.0007596069,0.0009855002,0.0013082668,0.0005040596,0.0007874175,0.00090217544,0.0006774182,0.0028048425],"category_scores_gemma":[0.0012689523,0.00040937934,0.0005749503,0.0020052514,0.00042610205,0.001564806,0.0009740415,0.000468861,0.0008935363],"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.00025558402,0.00013723718,0.0008972104,0.00014718446,0.000031571355,0.00024277356,0.00020454425,0.14927362,0.05298422,0.020810446,0.0055140383,0.76950145],"study_design_scores_gemma":[0.00002071527,0.000076112105,0.00028143346,0.0000075099547,0.000012100546,0.00020935353,0.000028680271,0.9725165,0.019440446,0.004673234,0.0027134807,0.00002038808],"about_ca_topic_score_codex":0.0021568113,"about_ca_topic_score_gemma":0.0013382675,"teacher_disagreement_score":0.0028048425,"about_ca_system_score_codex":0.00032418975,"about_ca_system_score_gemma":0.0006819886,"threshold_uncertainty_score":0.009383142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6561384,0.00093174184,0.26656273,0.0006118457,0.00011539551,0.00005821379,0.0007809868,0.00032061464,0.07448002],"genre_scores_gemma":[0.953348,0.000593361,0.03527769,0.00011151049,0.000084660955,0.00008761786,0.0009035542,0.0000950606,0.00949844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989605,0.00011943168,0.000057909856,0.00031815088,0.00032627038,0.00021774108],"domain_scores_gemma":[0.9977303,0.0012328861,0.00027644378,0.000326351,0.00016207954,0.00027192465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049245125,0.00078295515,0.0009135394,0.00086684333,0.0010963368,0.0028305545,0.00086452294,0.00081637624,0.005553265],"category_scores_gemma":[0.0031200545,0.0007799032,0.0014226184,0.00096699107,0.0018879395,0.0038652522,0.0028807442,0.0021353278,0.0006916338],"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.0003437854,0.00015564269,0.005018059,0.0003692277,0.00011879023,0.00087057496,0.0005975593,0.06479241,0.0085938275,0.8845415,0.0031355121,0.03146311],"study_design_scores_gemma":[0.000039585393,0.00015652864,0.0037708944,0.000106528474,0.000060279006,0.0010169576,0.0005178198,0.10792479,0.0074836197,0.8657518,0.0131275235,0.000043627526],"about_ca_topic_score_codex":0.00096741266,"about_ca_topic_score_gemma":0.0008463355,"teacher_disagreement_score":0.005553265,"about_ca_system_score_codex":0.00085796526,"about_ca_system_score_gemma":0.00031239237,"threshold_uncertainty_score":0.018577576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41448927,0.0011208614,0.5638613,0.00092257775,0.00013465769,0.00019790682,0.00083917665,0.0005889878,0.017845344],"genre_scores_gemma":[0.90052557,0.00056341325,0.08979135,0.00015541205,0.00006783366,0.00013123939,0.00062297645,0.00019421654,0.007947935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929583,0.00030015357,0.00003156772,0.00012420292,0.00009551618,0.00015268625],"domain_scores_gemma":[0.99841607,0.00096514996,0.00019459089,0.00013384818,0.000114754665,0.00017555174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009523791,0.0009569351,0.0014746217,0.0006518485,0.0005896622,0.001501619,0.0009402412,0.0011260938,0.0046899933],"category_scores_gemma":[0.0027448433,0.00077723264,0.0005451355,0.0016286124,0.0009616411,0.0018045367,0.0012952128,0.00090535294,0.00061502773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038968437,0.00008068686,0.0009455636,0.00012990662,0.000028153605,0.00030804618,0.00014165252,0.95449936,0.001922687,0.025960535,0.0024093355,0.013184462],"study_design_scores_gemma":[0.000025051586,0.00006958223,0.00022468255,0.000010093677,0.0000058656815,0.0000664059,0.000085412954,0.97201735,0.0005340889,0.025870629,0.0010833655,0.0000074456916],"about_ca_topic_score_codex":0.002612562,"about_ca_topic_score_gemma":0.0017397882,"teacher_disagreement_score":0.0046899933,"about_ca_system_score_codex":0.0010583331,"about_ca_system_score_gemma":0.00044230578,"threshold_uncertainty_score":0.015689611},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17539403,0.0015472769,0.80513304,0.00069933047,0.00015532372,0.00050247053,0.00028194833,0.001208034,0.015078503],"genre_scores_gemma":[0.8296451,0.00046997724,0.16457254,0.00021452736,0.00006634697,0.00018337218,0.0001616195,0.00016682873,0.004519654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987814,0.000285593,0.00006606824,0.0002133761,0.00027779638,0.00037582655],"domain_scores_gemma":[0.9979007,0.0011395866,0.0002177608,0.00028700763,0.00018123836,0.00027362313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009735683,0.0015103811,0.0023664683,0.0006699303,0.0010028238,0.001981964,0.0036068046,0.0016783846,0.006984964],"category_scores_gemma":[0.0043915627,0.000818729,0.00072903075,0.0010112686,0.00083778455,0.003889347,0.0019270272,0.0010579106,0.0010799123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015389781,0.0010834571,0.0019470238,0.00051261124,0.00014650439,0.00046520738,0.00037426964,0.6704468,0.023349794,0.120706774,0.011100242,0.16832833],"study_design_scores_gemma":[0.00004164564,0.000106405525,0.00014463726,0.000011597247,0.000016592227,0.00010042263,0.0000701507,0.98141277,0.0014325237,0.015238545,0.0014100805,0.0000146615375],"about_ca_topic_score_codex":0.0028405979,"about_ca_topic_score_gemma":0.0031608832,"teacher_disagreement_score":0.006984964,"about_ca_system_score_codex":0.0014087732,"about_ca_system_score_gemma":0.0014859247,"threshold_uncertainty_score":0.023367107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057581617,0.000106689535,0.9910382,0.000046202316,0.00003671274,0.000120576595,0.0001673255,0.0016477826,0.0010784246],"genre_scores_gemma":[0.05855758,0.00022496194,0.93846107,0.000043888653,0.000020844773,0.00022112264,0.0010106368,0.00024893656,0.0012109318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994629,0.00004187828,0.000035775258,0.000118313714,0.00027774452,0.000063432184],"domain_scores_gemma":[0.99954295,0.0001236871,0.000051835224,0.00009269349,0.00015129855,0.00003751021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047613744,0.0013009934,0.001601915,0.00256043,0.0010380642,0.0016126159,0.0021127297,0.0014658713,0.004231479],"category_scores_gemma":[0.00145676,0.0011842512,0.0016375678,0.0035803213,0.00052641035,0.0014446789,0.0018609228,0.0011071707,0.0018964497],"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.00018396799,0.0001473205,0.001399105,0.00017967845,0.00008680892,0.00023732104,0.00015357365,0.45662218,0.011012292,0.007976899,0.008786178,0.5132147],"study_design_scores_gemma":[0.000011681531,0.000018585748,0.0001344197,0.00000786061,0.0000056308286,0.000046729914,0.000016957445,0.9945358,0.0015988034,0.0015632078,0.0020501746,0.00001013035],"about_ca_topic_score_codex":0.0121620735,"about_ca_topic_score_gemma":0.008024134,"teacher_disagreement_score":0.0121620735,"about_ca_system_score_codex":0.0008442855,"about_ca_system_score_gemma":0.0015100116,"threshold_uncertainty_score":0.024182558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028597408,0.00015202923,0.9923499,0.0000629769,0.000034853096,0.00002733434,0.00002774862,0.000109702814,0.004375654],"genre_scores_gemma":[0.2526615,0.0008121727,0.7303953,0.00015129738,0.00010068673,0.00037168697,0.00021845805,0.00037135728,0.014917517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965537,0.000103374805,0.000014537511,0.0000443472,0.00015139062,0.00003104123],"domain_scores_gemma":[0.9996327,0.00018671853,0.00003551277,0.00003140825,0.00009870296,0.000014901605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066353666,0.000670755,0.0006762961,0.0007345435,0.00038988475,0.00079914404,0.0007283186,0.0007433323,0.0038656562],"category_scores_gemma":[0.00089308736,0.00045590306,0.000660909,0.0005433855,0.0006166947,0.00077927136,0.00064264325,0.0006873901,0.0006282949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002055059,0.000020544143,0.00019724532,0.000060983642,0.000014658229,0.00003331967,0.0000258123,0.9223471,0.0023541974,0.034391813,0.0013007617,0.03923307],"study_design_scores_gemma":[0.000004778009,0.0000109406965,0.000042792337,0.000006326285,0.0000023720015,0.000011428012,0.00000400607,0.99323213,0.0005949522,0.0038302948,0.0022550547,0.0000049586724],"about_ca_topic_score_codex":0.0032846546,"about_ca_topic_score_gemma":0.0021600896,"teacher_disagreement_score":0.0038656562,"about_ca_system_score_codex":0.00076335954,"about_ca_system_score_gemma":0.00096703897,"threshold_uncertainty_score":0.012931943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039819025,0.0018064731,0.94313323,0.00051801826,0.00016804748,0.00020619672,0.0007687735,0.00072470965,0.012855492],"genre_scores_gemma":[0.40108427,0.0016206396,0.5879822,0.00025309782,0.00013030827,0.0003339944,0.0016299917,0.0003361366,0.0066294093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829656,0.0006941472,0.0001067748,0.00028823534,0.0003814669,0.00023291445],"domain_scores_gemma":[0.9980751,0.0011208529,0.00022490163,0.0002497638,0.00019791836,0.00013155254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016551731,0.0015155663,0.0015657716,0.0014208223,0.0007131243,0.0025298994,0.0023146558,0.0016237452,0.0070267813],"category_scores_gemma":[0.0047818096,0.0010584197,0.001684201,0.003525934,0.0009171396,0.0024197865,0.001545562,0.0017969598,0.0010283388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013352915,0.00019956805,0.0007765105,0.0002681822,0.00008041438,0.00013663586,0.000041899373,0.92070967,0.000712206,0.023587242,0.0049150093,0.04843916],"study_design_scores_gemma":[0.000014644956,0.000034907127,0.00017211935,0.000016242986,0.000009637334,0.00006258196,0.00001640902,0.9867165,0.00053026585,0.010585801,0.0018298612,0.000011088295],"about_ca_topic_score_codex":0.0055236123,"about_ca_topic_score_gemma":0.004610016,"teacher_disagreement_score":0.0070267813,"about_ca_system_score_codex":0.0012745702,"about_ca_system_score_gemma":0.0012955428,"threshold_uncertainty_score":0.02350694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009812233,0.00036340853,0.98193294,0.0002120281,0.00008009609,0.00010119574,0.00012550155,0.0005692589,0.0068032783],"genre_scores_gemma":[0.25861043,0.0006035953,0.73335963,0.00017692354,0.000097996206,0.0003924756,0.00045393608,0.0003096975,0.005995378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937016,0.00023132924,0.000024013763,0.000091943955,0.00017390287,0.00010858036],"domain_scores_gemma":[0.9987281,0.0007816191,0.00010181308,0.0001403435,0.00018987895,0.00005827562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011513563,0.0017924443,0.0015038212,0.0012957118,0.0007497,0.0015125514,0.0015226796,0.0013308486,0.010226604],"category_scores_gemma":[0.0036625823,0.0013010913,0.0011345666,0.0016759663,0.0006487191,0.0018414679,0.00096179283,0.0018701588,0.0011193692],"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.000079853686,0.000079859696,0.00014890758,0.00008373695,0.000026809052,0.000017220018,0.000031167365,0.9268679,0.000470198,0.014568589,0.0024354474,0.055190332],"study_design_scores_gemma":[0.000017783294,0.000018920762,0.00003414316,0.000009614681,0.0000057155344,0.0000054729067,0.000008650767,0.9892881,0.000183399,0.009973247,0.00045119828,0.0000038319804],"about_ca_topic_score_codex":0.0078736255,"about_ca_topic_score_gemma":0.009721307,"teacher_disagreement_score":0.010226604,"about_ca_system_score_codex":0.001677669,"about_ca_system_score_gemma":0.0026612545,"threshold_uncertainty_score":0.034211397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061892066,0.012903818,0.6383051,0.0605585,0.0032567123,0.00024145833,0.0017756992,0.00046055013,0.22060609],"genre_scores_gemma":[0.7108182,0.017974356,0.20394185,0.008103429,0.0117486045,0.00066731917,0.0019588291,0.00064081216,0.044146664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99304974,0.0021789642,0.00033829338,0.0010847952,0.0026618468,0.00068635785],"domain_scores_gemma":[0.96417856,0.03173043,0.00074405066,0.0017075026,0.001104741,0.0005346745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003949942,0.0014795759,0.001996083,0.0019706038,0.0023114493,0.007820319,0.0027910727,0.002287296,0.011284637],"category_scores_gemma":[0.020310728,0.0010720488,0.002399205,0.0028035599,0.005214065,0.01754924,0.0051028533,0.013221801,0.0013769147],"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.00010076536,0.00008181329,0.00035519438,0.00024706442,0.000046644178,0.0001670163,0.00022093486,0.018420378,0.0008035137,0.9549742,0.011591531,0.012990966],"study_design_scores_gemma":[0.000016487751,0.000018924276,0.00015925863,0.000033648706,0.000011756302,0.000051022802,0.000047403886,0.028085293,0.00038981903,0.963488,0.007677442,0.00002099314],"about_ca_topic_score_codex":0.0026798858,"about_ca_topic_score_gemma":0.0019145329,"teacher_disagreement_score":0.011284637,"about_ca_system_score_codex":0.003551532,"about_ca_system_score_gemma":0.0019976536,"threshold_uncertainty_score":0.0377509},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015954107,0.00011980818,0.9787025,0.00012288772,0.000027299982,0.000066702756,0.0000829209,0.00028159557,0.00464221],"genre_scores_gemma":[0.3589358,0.00034695264,0.63370836,0.00017388802,0.000034454577,0.00043889196,0.00044772957,0.00020274757,0.005711131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993673,0.00019774378,0.000027707629,0.00008512928,0.00026350893,0.00005855918],"domain_scores_gemma":[0.99935263,0.00030275405,0.000070479175,0.00012403207,0.00010952307,0.00004053776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007062114,0.00060850556,0.0006102805,0.000852925,0.00045335316,0.0014106124,0.0012747402,0.0011665868,0.003146808],"category_scores_gemma":[0.0025611243,0.00041083465,0.00081962155,0.0012709354,0.0012028127,0.0011773569,0.0010347768,0.0009621722,0.00086421124],"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.0000733882,0.0000577687,0.00047634236,0.00007639226,0.0000135221,0.00011179686,0.000115058814,0.83475107,0.0058924244,0.101058304,0.0017536805,0.05562031],"study_design_scores_gemma":[0.000015510022,0.000053931137,0.000081727674,0.000011172015,0.0000047636404,0.00009006117,0.000025307696,0.97787446,0.0013150062,0.018732293,0.0017830242,0.000012685644],"about_ca_topic_score_codex":0.0014921878,"about_ca_topic_score_gemma":0.0016414,"teacher_disagreement_score":0.003146808,"about_ca_system_score_codex":0.0008245737,"about_ca_system_score_gemma":0.00088979385,"threshold_uncertainty_score":0.010527074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013028036,0.000499228,0.96872675,0.00032342385,0.000052352756,0.00010370919,0.00048242914,0.0002145239,0.016569482],"genre_scores_gemma":[0.6443689,0.002080017,0.3207095,0.00020519734,0.00010874247,0.000907247,0.0011152519,0.00016524259,0.030339908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995372,0.00011981651,0.00002208144,0.00009627941,0.00013854241,0.00008610995],"domain_scores_gemma":[0.9995974,0.00021683061,0.00006324759,0.000019055788,0.000075424854,0.000028082333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008933142,0.0010921062,0.0012725651,0.0006961438,0.0006324433,0.0024032693,0.0018388762,0.0017295411,0.0069889473],"category_scores_gemma":[0.0013491226,0.0009812616,0.0013093094,0.0014101483,0.0007839488,0.0015120612,0.00080162013,0.0016663681,0.001025272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129749415,0.0000147962155,0.00007342096,0.000035589586,0.000005133796,0.000049720533,0.000018830633,0.9829564,0.00034555985,0.013314944,0.00035147142,0.00282114],"study_design_scores_gemma":[0.000005093463,0.000014089868,0.000039605162,0.0000066687917,0.000003751342,0.00001036677,0.000007702283,0.9951727,0.00009835662,0.0038434227,0.000793879,0.000004353293],"about_ca_topic_score_codex":0.012685722,"about_ca_topic_score_gemma":0.011619241,"teacher_disagreement_score":0.012685722,"about_ca_system_score_codex":0.0016495569,"about_ca_system_score_gemma":0.0028374675,"threshold_uncertainty_score":0.025223732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011967891,0.00044625122,0.9828395,0.00022830961,0.0000674891,0.00008354002,0.00008252896,0.0008655006,0.003418961],"genre_scores_gemma":[0.122041605,0.0003156731,0.87464,0.00013572678,0.00007157642,0.0001881392,0.00040603895,0.00021785391,0.001983484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994661,0.00016894056,0.000024914383,0.00008963444,0.00018459588,0.00006580243],"domain_scores_gemma":[0.9994368,0.00030782024,0.000059231203,0.00007906752,0.00007339967,0.00004372474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390847,0.0008959967,0.001181759,0.001002831,0.0005946205,0.0010797988,0.0016002388,0.001415903,0.004071087],"category_scores_gemma":[0.0021687702,0.00054434506,0.0005991337,0.0023039016,0.0006670246,0.001428775,0.0016504484,0.0017775826,0.001052591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020250678,0.00018254643,0.0005968555,0.00023990848,0.000045658067,0.00013143073,0.000089501475,0.5289247,0.004268698,0.040724948,0.008153929,0.41643932],"study_design_scores_gemma":[0.00003335294,0.000051266845,0.00012837,0.000013359007,0.000008352537,0.00006499124,0.000012017197,0.97836626,0.0010055843,0.01810754,0.0022004906,0.000008420633],"about_ca_topic_score_codex":0.0014320429,"about_ca_topic_score_gemma":0.0015146572,"teacher_disagreement_score":0.004071087,"about_ca_system_score_codex":0.00066064764,"about_ca_system_score_gemma":0.0012077534,"threshold_uncertainty_score":0.013619125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15299343,0.00048512028,0.8378256,0.0003201609,0.00007943909,0.00019128241,0.00014730624,0.0002668397,0.007690856],"genre_scores_gemma":[0.74894273,0.00034113645,0.24160935,0.00013582411,0.000038769347,0.0003310917,0.00024282177,0.00007119631,0.00828715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996747,0.000095971765,0.0000131719335,0.000059944414,0.00006857171,0.00008761544],"domain_scores_gemma":[0.9997136,0.00014919315,0.000038287842,0.000012850678,0.0000533479,0.000032723103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095307623,0.0009836752,0.0015379398,0.0009459579,0.0005978819,0.0013061888,0.0010345215,0.0012370546,0.0018969851],"category_scores_gemma":[0.0008048732,0.00066433806,0.0009240298,0.0012654014,0.0005170765,0.0007040107,0.00074348075,0.0008257913,0.00018773745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038313738,0.00003858501,0.00016965476,0.000017830922,0.000022413242,0.000020532445,0.000010362666,0.9915895,0.00042042686,0.001065826,0.00021939364,0.0063872193],"study_design_scores_gemma":[0.000009868698,0.000017805496,0.000049196886,0.0000024116296,0.000005656247,0.0000030296765,0.000004844661,0.9993055,0.000097253986,0.0004191893,0.000083347346,0.0000019214942],"about_ca_topic_score_codex":0.019116802,"about_ca_topic_score_gemma":0.011162394,"teacher_disagreement_score":0.019116802,"about_ca_system_score_codex":0.0014059016,"about_ca_system_score_gemma":0.0023411524,"threshold_uncertainty_score":0.038011014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06479517,0.00030744233,0.93018,0.00014719302,0.000063634034,0.00005333317,0.000051760555,0.0007487857,0.0036525803],"genre_scores_gemma":[0.6574994,0.000351186,0.33825886,0.00013379856,0.000047158195,0.00012816738,0.00032855847,0.00019470249,0.0030581572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954236,0.00006963251,0.000032115786,0.00009308675,0.00021010358,0.000052653686],"domain_scores_gemma":[0.99959654,0.00013468957,0.000068552225,0.00005160366,0.00011887493,0.000029721794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599513,0.000760709,0.001220833,0.0008381982,0.00035462985,0.0008143014,0.00091970304,0.0004686648,0.00067470537],"category_scores_gemma":[0.0011646942,0.00038574115,0.000696149,0.0011380553,0.00041545057,0.00087603385,0.00072637363,0.00053396326,0.00020958955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006404314,0.000049825314,0.0011686163,0.00006460628,0.000050058115,0.000099455094,0.000054174892,0.9253295,0.007278678,0.0024409902,0.0010815937,0.062318426],"study_design_scores_gemma":[0.000004324033,0.000009028109,0.00009780458,0.0000013208096,0.000004254486,0.0000072897283,0.0000053461426,0.99886215,0.0004606864,0.00031039282,0.00023480612,0.0000025652125],"about_ca_topic_score_codex":0.0067959675,"about_ca_topic_score_gemma":0.0046198666,"teacher_disagreement_score":0.0067959675,"about_ca_system_score_codex":0.0003601692,"about_ca_system_score_gemma":0.00083850574,"threshold_uncertainty_score":0.01351285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06510431,0.0018132105,0.9090353,0.0018723237,0.00031281944,0.00026651277,0.0015985399,0.00068741164,0.0193096],"genre_scores_gemma":[0.69084275,0.0027567255,0.28420585,0.00058312673,0.000437364,0.0004241043,0.0020498107,0.0006059639,0.018094309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987043,0.000404048,0.00006284899,0.00024914954,0.0003589173,0.00022067469],"domain_scores_gemma":[0.9984981,0.0009353307,0.00016650799,0.00011915199,0.00012287029,0.00015802591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012859318,0.0016866736,0.002453601,0.0010008666,0.0010499005,0.004219056,0.002731663,0.0039571268,0.009899769],"category_scores_gemma":[0.0048492514,0.0014547042,0.0013220261,0.0033011655,0.0017115574,0.0035717003,0.0028550418,0.0023887586,0.0014307534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042525132,0.00019760602,0.0006347163,0.0008081011,0.000064623084,0.00047404662,0.00012223993,0.89144,0.002966688,0.032122806,0.00886286,0.061881036],"study_design_scores_gemma":[0.000050329123,0.0000959773,0.00043995035,0.00004636001,0.000024421392,0.00026520813,0.000103947365,0.96124804,0.0016721962,0.03220088,0.003808021,0.000044621465],"about_ca_topic_score_codex":0.0053823437,"about_ca_topic_score_gemma":0.0036901592,"teacher_disagreement_score":0.009899769,"about_ca_system_score_codex":0.0013323862,"about_ca_system_score_gemma":0.0016165875,"threshold_uncertainty_score":0.03311801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03217619,0.0022303555,0.70781535,0.0032851615,0.0017181024,0.0008444881,0.016746858,0.09684473,0.13833877],"genre_scores_gemma":[0.3440008,0.002265496,0.49256167,0.0035721168,0.00031647788,0.0016551376,0.04433854,0.0060052145,0.10528464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996588,0.000039055234,0.000023312454,0.00012347879,0.00008769079,0.00006759096],"domain_scores_gemma":[0.99955195,0.00015656621,0.000033294713,0.00009146494,0.00011296244,0.00005380624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004673345,0.0013212734,0.00065541704,0.0006589203,0.0005508308,0.0014742785,0.0033042214,0.0015740906,0.046779018],"category_scores_gemma":[0.002374346,0.0005951486,0.00090830226,0.0005875584,0.000505197,0.002557234,0.0019877884,0.0020395438,0.012374649],"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.0006810309,0.00048935885,0.0024637636,0.001053812,0.0001449865,0.00053853815,0.00011684909,0.32750103,0.006888235,0.053062852,0.22025388,0.38680574],"study_design_scores_gemma":[0.000074894655,0.0001432906,0.0002893835,0.000076704375,0.000030202602,0.00013198775,0.0000322136,0.8927606,0.00527909,0.036820076,0.06432977,0.000031889387],"about_ca_topic_score_codex":0.006355721,"about_ca_topic_score_gemma":0.012036472,"teacher_disagreement_score":0.046779018,"about_ca_system_score_codex":0.001234334,"about_ca_system_score_gemma":0.0017979017,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051374897,0.000970069,0.9416892,0.00019164306,0.000056250232,0.00011176692,0.000064389315,0.00057972834,0.0049620927],"genre_scores_gemma":[0.62646407,0.00063274056,0.36756447,0.00023685697,0.000055836997,0.00047123007,0.00030474007,0.00019783687,0.0040722666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.00013918652,0.000027976148,0.00008328933,0.00011335788,0.00006115607],"domain_scores_gemma":[0.99964786,0.00016744924,0.000041424504,0.000043715707,0.00008133684,0.000018109005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008316776,0.00069922453,0.0011746573,0.0007767325,0.00053867756,0.0007949485,0.0012794951,0.0007812514,0.0020881123],"category_scores_gemma":[0.0017581868,0.00041622974,0.00061351893,0.0010952287,0.0005656289,0.0010321632,0.00095495686,0.00082184543,0.0004105563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010604805,0.00008501038,0.0010386745,0.00010474021,0.00008079999,0.000086365406,0.00016118726,0.87487036,0.0031585158,0.008955889,0.002739359,0.10861296],"study_design_scores_gemma":[0.00003712876,0.00008985671,0.0002498282,0.000010608868,0.000015151106,0.000050684866,0.000044177697,0.99243367,0.0011511062,0.0044111223,0.001494322,0.000012321392],"about_ca_topic_score_codex":0.0026656382,"about_ca_topic_score_gemma":0.0018179795,"teacher_disagreement_score":0.0026656382,"about_ca_system_score_codex":0.00042682406,"about_ca_system_score_gemma":0.0009061525,"threshold_uncertainty_score":0.0069853663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04347951,0.0012353944,0.93183845,0.0010546969,0.00019315154,0.0002559655,0.0003948134,0.00017674585,0.021371376],"genre_scores_gemma":[0.5024332,0.0020412067,0.473775,0.000434999,0.00033540564,0.00036692072,0.0011480491,0.00016077611,0.019304419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979565,0.0007308408,0.00013300065,0.00037178036,0.00052730495,0.00028058127],"domain_scores_gemma":[0.9975696,0.0013256678,0.00031652363,0.00029578267,0.0003394237,0.00015295357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019511275,0.0010350508,0.00096634164,0.00059160515,0.0011745235,0.0024916516,0.0016344688,0.0015179508,0.0066124573],"category_scores_gemma":[0.0044889324,0.00052727637,0.0010088446,0.002070534,0.0013697135,0.00354094,0.0020670542,0.002011237,0.0009323584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003272606,0.0003662203,0.0026979158,0.00083993236,0.0001384389,0.0005744008,0.00033866288,0.6200697,0.0047859848,0.22851792,0.010836433,0.13050717],"study_design_scores_gemma":[0.00009055289,0.00025912048,0.0020087908,0.00011629505,0.00006313211,0.0007954717,0.0003967187,0.7523024,0.005498096,0.21093932,0.02745523,0.00007493164],"about_ca_topic_score_codex":0.005075007,"about_ca_topic_score_gemma":0.0033544463,"teacher_disagreement_score":0.0066124573,"about_ca_system_score_codex":0.0017216352,"about_ca_system_score_gemma":0.0021509882,"threshold_uncertainty_score":0.022120833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07078162,0.010713431,0.8313642,0.0022291527,0.0005511857,0.0000891216,0.0005940514,0.00021977305,0.083457425],"genre_scores_gemma":[0.7544392,0.011266169,0.19445752,0.00070623244,0.0014063163,0.0004549676,0.001278901,0.0004047476,0.035585895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.00041734226,0.000036314777,0.00017703789,0.00037677388,0.00011241338],"domain_scores_gemma":[0.99838674,0.00095943327,0.00015372885,0.00010254993,0.00023393215,0.00016358859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904904,0.0012894075,0.0009773537,0.0016831252,0.0010669642,0.0025539438,0.00096071395,0.0012220256,0.005592889],"category_scores_gemma":[0.005460489,0.00055291015,0.0006909431,0.0016758611,0.0026668035,0.002887573,0.0019207451,0.0026958506,0.0008969897],"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.000033181506,0.000025003541,0.0002638216,0.00013034024,0.000016420994,0.000064280124,0.00010240878,0.026525917,0.000652748,0.9561112,0.0035824259,0.012492345],"study_design_scores_gemma":[0.000016166588,0.000046336412,0.00044216562,0.000072849594,0.000012065037,0.00017533218,0.00014463147,0.16860825,0.000553584,0.8124365,0.01747437,0.000017755761],"about_ca_topic_score_codex":0.0017451637,"about_ca_topic_score_gemma":0.001023275,"teacher_disagreement_score":0.005592889,"about_ca_system_score_codex":0.0011018489,"about_ca_system_score_gemma":0.0004093483,"threshold_uncertainty_score":0.018710077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036063775,0.005409105,0.8787733,0.00032128245,0.0007801065,0.00024064827,0.0003700957,0.0023989086,0.075642824],"genre_scores_gemma":[0.17724855,0.0052714273,0.75217205,0.00019888674,0.00021099327,0.00017219126,0.00081674237,0.0009917394,0.06291737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973375,0.000029130551,0.000013139337,0.000057633242,0.00012133623,0.000045003155],"domain_scores_gemma":[0.9998884,0.00003335121,0.00001072052,0.000035333498,0.00002026377,0.0000119495035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023221473,0.001294201,0.0010601293,0.0006565048,0.00040999093,0.0012159437,0.0017082773,0.0007323219,0.017776301],"category_scores_gemma":[0.00056417927,0.0010603762,0.0009551798,0.0030775606,0.0007378155,0.0019020005,0.0012161382,0.0011445753,0.0049141813],"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.00048319466,0.00011596335,0.00036261935,0.0007376117,0.000052879503,0.00024116847,0.0001668624,0.095752515,0.033544928,0.051599797,0.024907686,0.79203475],"study_design_scores_gemma":[0.00017054165,0.00074907736,0.0021559289,0.00015682471,0.00016057341,0.0017536514,0.00026896255,0.65852845,0.04672749,0.14442907,0.14476633,0.0001331566],"about_ca_topic_score_codex":0.002668133,"about_ca_topic_score_gemma":0.0029962684,"teacher_disagreement_score":0.017776301,"about_ca_system_score_codex":0.0005610973,"about_ca_system_score_gemma":0.0007138899,"threshold_uncertainty_score":0.059467673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035454605,0.0002285642,0.9938273,0.00009140087,0.00005403344,0.0000524766,0.00008607635,0.00064580503,0.0014687518],"genre_scores_gemma":[0.048077628,0.0003188211,0.947407,0.00011400465,0.00007854637,0.0002252488,0.00051042176,0.0004974255,0.0027709184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739045,0.0007439441,0.00017293863,0.00055434037,0.0009564693,0.00018187964],"domain_scores_gemma":[0.99494714,0.002034369,0.00045929974,0.0015078577,0.0008402531,0.00021120977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029541138,0.0015412192,0.0016516487,0.002388218,0.0015603356,0.0019707528,0.002542384,0.0016892062,0.0075149327],"category_scores_gemma":[0.013312346,0.00086527044,0.0011663046,0.0032577873,0.0016757152,0.0032266928,0.0035119455,0.0028665194,0.0041964054],"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.0005164068,0.00015187559,0.001441878,0.0003854467,0.00011415993,0.00014541025,0.00045134383,0.29099634,0.01523052,0.1790995,0.011668848,0.49979827],"study_design_scores_gemma":[0.000060593957,0.00013726819,0.0005253716,0.000062711006,0.000026523416,0.00022020111,0.00010620299,0.8166619,0.011135553,0.13623458,0.034752447,0.00007663183],"about_ca_topic_score_codex":0.002449324,"about_ca_topic_score_gemma":0.002371024,"teacher_disagreement_score":0.0075149327,"about_ca_system_score_codex":0.0012705735,"about_ca_system_score_gemma":0.0013218549,"threshold_uncertainty_score":0.025139928},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059369303,0.00044456293,0.93323773,0.00020685614,0.00006940962,0.00014282762,0.00016995917,0.0007851824,0.0055740806],"genre_scores_gemma":[0.4258725,0.00030840992,0.5690804,0.00015464396,0.00006870496,0.00042190735,0.0005702954,0.00051998656,0.0030031684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947566,0.00017165352,0.000026687205,0.000078195175,0.00017596531,0.000071809794],"domain_scores_gemma":[0.9979214,0.0015454338,0.00016775045,0.00014176463,0.00016260278,0.00006104675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009990438,0.0011611654,0.001842905,0.0016834082,0.0006341789,0.0016234407,0.0014703703,0.0027378688,0.0028087103],"category_scores_gemma":[0.00366519,0.0016143941,0.0020057915,0.002562099,0.0010861643,0.0015915836,0.0015247812,0.0015491807,0.0004886143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061134015,0.00003349926,0.00019813052,0.000038909173,0.000023022822,0.00004744922,0.000028248478,0.98103356,0.0006940952,0.0024841244,0.00043644104,0.014921436],"study_design_scores_gemma":[0.000004679316,0.000008262222,0.0000288197,0.0000031540683,0.0000024523135,0.000007275305,0.0000067793253,0.9981719,0.00019517493,0.0014612061,0.0001079317,0.0000022714219],"about_ca_topic_score_codex":0.005483839,"about_ca_topic_score_gemma":0.004820611,"teacher_disagreement_score":0.005483839,"about_ca_system_score_codex":0.001201604,"about_ca_system_score_gemma":0.0013228209,"threshold_uncertainty_score":0.010903835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071071107,0.0011321903,0.9723173,0.0006615956,0.00027332522,0.00027954555,0.0006573066,0.0007023808,0.016869264],"genre_scores_gemma":[0.12459424,0.002601152,0.8541479,0.00081558357,0.0004832694,0.0008159414,0.0038142882,0.0005312177,0.012196412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867475,0.0003722144,0.00007368316,0.00028658943,0.0004457364,0.00014703047],"domain_scores_gemma":[0.99882036,0.00054608803,0.0001421246,0.0001950391,0.00020786471,0.00008843437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452896,0.0024159004,0.0012173778,0.0015906247,0.00065844576,0.002098203,0.0017683905,0.0016559069,0.013793912],"category_scores_gemma":[0.00383666,0.0008116574,0.0021671557,0.0028487663,0.000899863,0.0027814645,0.001858036,0.0049388264,0.0036870872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002767177,0.0005380775,0.0010237013,0.0010282089,0.00016337099,0.00030811853,0.00022731794,0.49171656,0.006749075,0.2150641,0.041990507,0.24091423],"study_design_scores_gemma":[0.000080448306,0.00013994431,0.0004609853,0.00018482412,0.00006807806,0.00033302786,0.00008588196,0.7848467,0.0025278323,0.17897415,0.032243267,0.000054902895],"about_ca_topic_score_codex":0.0021551545,"about_ca_topic_score_gemma":0.0021782315,"teacher_disagreement_score":0.013793912,"about_ca_system_score_codex":0.0015031806,"about_ca_system_score_gemma":0.0017126781,"threshold_uncertainty_score":0.04614526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11284035,0.0014869712,0.8768042,0.00031587936,0.000064404274,0.00013892166,0.00010464748,0.000533155,0.007711628],"genre_scores_gemma":[0.7643168,0.0007427957,0.23003022,0.00021072931,0.00005491365,0.00035618016,0.00028573014,0.00011263961,0.0038899565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995875,0.00013397555,0.000021294683,0.0000740345,0.00011287201,0.00007040303],"domain_scores_gemma":[0.99968827,0.000167157,0.00004102586,0.00002498074,0.000059066428,0.000019517496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343003,0.00070099265,0.0015147575,0.0006761521,0.00049035373,0.000969194,0.0011446773,0.0009893936,0.0017256342],"category_scores_gemma":[0.0010988944,0.0004040042,0.000737137,0.001325639,0.00043596086,0.0010370174,0.0010014294,0.00060512533,0.00024941604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007175354,0.00007591755,0.0005372146,0.00008152597,0.000046047986,0.00005951544,0.000059833394,0.9522132,0.0014207152,0.0031554084,0.0014077226,0.04087106],"study_design_scores_gemma":[0.00001706926,0.000056688037,0.0001295027,0.000004909458,0.000008073843,0.00002468728,0.000020792108,0.99739814,0.0003510432,0.0016407788,0.00034381344,0.0000044525877],"about_ca_topic_score_codex":0.0034549155,"about_ca_topic_score_gemma":0.0019271098,"teacher_disagreement_score":0.0034549155,"about_ca_system_score_codex":0.00045100358,"about_ca_system_score_gemma":0.0009055897,"threshold_uncertainty_score":0.006869614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00713906,0.003890482,0.96262455,0.0018867943,0.00083413016,0.000056382207,0.000048463837,0.00013649993,0.023383588],"genre_scores_gemma":[0.13940777,0.004914981,0.82320035,0.0012485738,0.0016137911,0.0004163308,0.00019629273,0.00027753587,0.0287244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989967,0.0006234901,0.00003730877,0.00008325527,0.00019468028,0.00006455027],"domain_scores_gemma":[0.9992398,0.00044138433,0.00004839593,0.0000663171,0.0001413063,0.00006286458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024130577,0.0013451345,0.0012563547,0.0015945443,0.0010920938,0.0018174328,0.0021899566,0.0015696208,0.007913814],"category_scores_gemma":[0.0036201698,0.00059891416,0.0019528181,0.0015952863,0.0019029197,0.0029293993,0.001777981,0.0032394934,0.0011628075],"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.00006708996,0.00009058678,0.00022686632,0.00026924655,0.0000529624,0.00007703816,0.00014488486,0.044095803,0.0019088379,0.9024861,0.0054821447,0.0450984],"study_design_scores_gemma":[0.000032193067,0.00006259702,0.000109745786,0.00007008722,0.000024805398,0.000049036065,0.000060491835,0.36393526,0.00049157336,0.61911255,0.016021654,0.000030051999],"about_ca_topic_score_codex":0.0021625522,"about_ca_topic_score_gemma":0.0023816288,"teacher_disagreement_score":0.007913814,"about_ca_system_score_codex":0.0009594063,"about_ca_system_score_gemma":0.0009768705,"threshold_uncertainty_score":0.026474416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019096997,0.00031899422,0.9758707,0.0001649459,0.000035085235,0.00013191848,0.000068890105,0.00013026177,0.0041821334],"genre_scores_gemma":[0.20888425,0.0004993966,0.78655076,0.0000832099,0.00004969425,0.00035362033,0.00024854994,0.00010880878,0.003221717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958056,0.00013129064,0.000024316225,0.00009172822,0.00011250734,0.00005961866],"domain_scores_gemma":[0.9996841,0.00017352802,0.000041473835,0.00003442406,0.000043654298,0.000022936092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078794226,0.0010812335,0.0008126929,0.0010741195,0.0006365494,0.0011382684,0.0013751194,0.001338428,0.0033196975],"category_scores_gemma":[0.0011949189,0.0006306941,0.0014781941,0.0013942663,0.0005782471,0.0010274628,0.0008542764,0.0012027381,0.0003355476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038908092,0.00010608033,0.00044123386,0.00016938597,0.00006128525,0.00010988811,0.00006384514,0.93521893,0.0023259209,0.021889832,0.00093730143,0.03863737],"study_design_scores_gemma":[0.00001471236,0.00004976847,0.00010484696,0.000013429627,0.000015444733,0.00005971687,0.000032543572,0.991795,0.0007266326,0.005150877,0.0020315144,0.000005500303],"about_ca_topic_score_codex":0.0042423285,"about_ca_topic_score_gemma":0.0045924704,"teacher_disagreement_score":0.0042423285,"about_ca_system_score_codex":0.0009779633,"about_ca_system_score_gemma":0.0018685191,"threshold_uncertainty_score":0.011105537},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023812945,0.0001942407,0.99319696,0.000074772215,0.0002143119,0.000043014177,0.000029850255,0.00028227942,0.0035832638],"genre_scores_gemma":[0.056242563,0.00035414647,0.9300868,0.00014114905,0.00020682353,0.00024828647,0.00014251137,0.00022586808,0.012351835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961925,0.00006529394,0.00002030245,0.000055380853,0.00020785426,0.000031948646],"domain_scores_gemma":[0.9995172,0.0001860789,0.00003907325,0.00005009445,0.00017212408,0.0000353194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056643225,0.00088412646,0.0008825744,0.0009976602,0.00066284963,0.0007129319,0.0015277199,0.0012756215,0.00614977],"category_scores_gemma":[0.0013406115,0.0005387946,0.00083615043,0.0010817441,0.00047390492,0.001057002,0.0012435368,0.0014122981,0.0014184228],"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.00017874756,0.00028520596,0.0005226336,0.0004609283,0.00013425208,0.00019500786,0.00009700692,0.39713016,0.022144277,0.052923467,0.012096257,0.513832],"study_design_scores_gemma":[0.000019974057,0.000033391767,0.00006811355,0.000011536937,0.0000099974395,0.000059850812,0.0000068715917,0.98800683,0.0014635244,0.00592507,0.0043838057,0.000010955762],"about_ca_topic_score_codex":0.0025540483,"about_ca_topic_score_gemma":0.004217612,"teacher_disagreement_score":0.00614977,"about_ca_system_score_codex":0.00040408372,"about_ca_system_score_gemma":0.0008472472,"threshold_uncertainty_score":0.02057302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071773743,0.00014232699,0.98763484,0.0001528063,0.00016286416,0.0000716965,0.00007968462,0.00061622,0.003962131],"genre_scores_gemma":[0.12703829,0.00024607204,0.86486167,0.00016928904,0.00011405921,0.00029342275,0.00042740398,0.00028775842,0.006561958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947244,0.000078073455,0.00002298889,0.00009282954,0.00024581095,0.00008794173],"domain_scores_gemma":[0.99947804,0.00018949616,0.000030081974,0.00008908822,0.00014494173,0.0000684751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050486624,0.00082650763,0.0013135299,0.00079954363,0.0006796968,0.0010433,0.0015443205,0.0011741621,0.010448764],"category_scores_gemma":[0.0024132356,0.0005397044,0.00092099037,0.0012181475,0.00063085614,0.0013262565,0.0028004462,0.0027363773,0.0021697485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025241342,0.00027696817,0.00033293143,0.00017348483,0.000040863873,0.000119352924,0.000097544,0.5286037,0.004914958,0.04663586,0.009398651,0.40915334],"study_design_scores_gemma":[0.000040562925,0.000048616635,0.000057440087,0.00001402558,0.0000060717066,0.000033727698,0.000012531032,0.9838935,0.00062748505,0.012387635,0.0028693425,0.000009136024],"about_ca_topic_score_codex":0.0038649386,"about_ca_topic_score_gemma":0.003625816,"teacher_disagreement_score":0.010448764,"about_ca_system_score_codex":0.0006690172,"about_ca_system_score_gemma":0.0017417704,"threshold_uncertainty_score":0.034954548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008509383,0.0008919334,0.9831435,0.00023873268,0.00010181819,0.000040603965,0.00014503558,0.00010723747,0.006821628],"genre_scores_gemma":[0.3804543,0.0018953456,0.6029995,0.0003328125,0.00027046626,0.00040712225,0.00041320905,0.00040024202,0.012827076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946576,0.00021538978,0.000019308565,0.000054899385,0.00016446107,0.00008025725],"domain_scores_gemma":[0.9990094,0.0006981458,0.00006991455,0.00007681402,0.000096749194,0.00004903413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011320146,0.0012276728,0.0018656105,0.0010547679,0.0004919007,0.0018641825,0.0012708718,0.0018787903,0.0069155656],"category_scores_gemma":[0.0033480518,0.0013930625,0.0014645339,0.0020346409,0.00093059853,0.001878016,0.0015083029,0.0016959719,0.00076297845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036060035,0.000031783075,0.00008687307,0.00007527363,0.000019773785,0.000018980858,0.000019193412,0.9659099,0.0003645524,0.017390562,0.0011315467,0.014915556],"study_design_scores_gemma":[0.0000043684977,0.0000066164266,0.000036256602,0.0000070822493,0.0000029008227,0.0000058395717,0.0000056067697,0.98830044,0.000063504034,0.011253833,0.00031091174,0.0000027075073],"about_ca_topic_score_codex":0.0057677994,"about_ca_topic_score_gemma":0.0055293827,"teacher_disagreement_score":0.0069155656,"about_ca_system_score_codex":0.0013607324,"about_ca_system_score_gemma":0.0013336461,"threshold_uncertainty_score":0.023134887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012717173,0.00057686574,0.96130735,0.00020649323,0.00031944137,0.00016110475,0.00017575869,0.006486238,0.018049575],"genre_scores_gemma":[0.11201601,0.00040964017,0.86872655,0.0005298828,0.00007122095,0.00032518542,0.0005460986,0.0010258586,0.016349593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970055,0.00007913501,0.000010477043,0.00004407922,0.00012369553,0.000042047333],"domain_scores_gemma":[0.99978286,0.00009325951,0.000017458191,0.00004188873,0.0000473449,0.000017336015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036375702,0.00079095736,0.00086955924,0.000688887,0.00052872126,0.00085396954,0.0018637665,0.0012620005,0.008825913],"category_scores_gemma":[0.0009046338,0.00035197928,0.0006122975,0.0011283681,0.00043871254,0.0007954873,0.0011517562,0.0014822334,0.002251617],"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.00024448687,0.00018601533,0.00044080263,0.00015429348,0.00006664334,0.00015164794,0.0001014619,0.30904287,0.010379472,0.014344706,0.019219259,0.6456684],"study_design_scores_gemma":[0.00005535084,0.000076884935,0.00012762158,0.000017675964,0.000019599722,0.000072827774,0.000013676183,0.98035645,0.0025225675,0.0055090063,0.011216829,0.000011491388],"about_ca_topic_score_codex":0.0041303732,"about_ca_topic_score_gemma":0.0049554715,"teacher_disagreement_score":0.008825913,"about_ca_system_score_codex":0.0005343841,"about_ca_system_score_gemma":0.00089797267,"threshold_uncertainty_score":0.029525697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004279212,0.000032956537,0.9923035,0.00010627965,0.00002560861,0.00013475737,0.00021220213,0.001248339,0.0016571472],"genre_scores_gemma":[0.172187,0.00008731348,0.82231385,0.00016975043,0.00004219346,0.00050882774,0.0013184049,0.0005919896,0.0027806498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787474,0.000502467,0.00013286677,0.00027682463,0.0010188372,0.00019430295],"domain_scores_gemma":[0.9957724,0.0021993024,0.00020851482,0.0006568074,0.0009768704,0.00018612665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025067173,0.0013145631,0.0015244408,0.0015094135,0.0007785162,0.0029398536,0.0043458077,0.0016544926,0.012229852],"category_scores_gemma":[0.008983815,0.0013888426,0.0020024553,0.0013830846,0.00083821017,0.0024508692,0.0030912152,0.0022621718,0.0024940618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003673832,0.0005500572,0.001361049,0.00031487006,0.00011411105,0.00032690854,0.0001654625,0.783989,0.0056263017,0.04187156,0.0052574975,0.1600558],"study_design_scores_gemma":[0.000010186403,0.00001562506,0.000030920688,0.0000072965063,0.000005818325,0.000016577886,0.000012004761,0.9903392,0.0010830081,0.007548076,0.00092585484,0.0000055085693],"about_ca_topic_score_codex":0.0034313696,"about_ca_topic_score_gemma":0.004612181,"teacher_disagreement_score":0.012229852,"about_ca_system_score_codex":0.00093522365,"about_ca_system_score_gemma":0.0020200144,"threshold_uncertainty_score":0.040912986},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034348395,0.00072573154,0.9469293,0.00090783555,0.0000705558,0.00012560288,0.00014072731,0.0004027194,0.016349029],"genre_scores_gemma":[0.818227,0.00092235324,0.16765857,0.0004328816,0.00020961254,0.000221407,0.00048124683,0.00017061396,0.0116763115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987047,0.00043315618,0.000056229655,0.00020033389,0.00039356248,0.0002119947],"domain_scores_gemma":[0.9972089,0.0018014091,0.00022638915,0.0002452276,0.00038035636,0.00013769488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013817495,0.00073751464,0.0007505768,0.00073235924,0.0004947379,0.0011159063,0.0012817652,0.0007122169,0.009192095],"category_scores_gemma":[0.005581209,0.0002919234,0.00061425293,0.0010002685,0.0011914865,0.0020575623,0.0022851329,0.0023959808,0.001044365],"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.00044124448,0.000359001,0.0010294839,0.00089996273,0.00008149315,0.00040331972,0.0005180852,0.3690488,0.013419497,0.43276027,0.012139676,0.16889907],"study_design_scores_gemma":[0.00005937907,0.00018884598,0.0003267517,0.000057135992,0.000020540476,0.00015022911,0.00011494423,0.7796826,0.006637237,0.20680395,0.005926092,0.00003223818],"about_ca_topic_score_codex":0.0020737415,"about_ca_topic_score_gemma":0.0010608556,"teacher_disagreement_score":0.009192095,"about_ca_system_score_codex":0.0014800183,"about_ca_system_score_gemma":0.0007704022,"threshold_uncertainty_score":0.030750692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6086879,0.0032585403,0.29682922,0.0028391841,0.00033292448,0.00014923429,0.00034286358,0.00008930311,0.08747094],"genre_scores_gemma":[0.9796902,0.00086565415,0.016603356,0.000030162175,0.000028149383,0.000021241785,0.00003522941,0.000012388866,0.0027137198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99878794,0.00046552334,0.000034575987,0.000106969885,0.00048718523,0.00011780723],"domain_scores_gemma":[0.99796367,0.0013153711,0.00019861167,0.00021471459,0.00025526845,0.000052456744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011166864,0.00081722654,0.000510103,0.0010211646,0.00049826223,0.003823877,0.00070953317,0.0011105214,0.003676107],"category_scores_gemma":[0.004465456,0.0003521204,0.00059573626,0.0015226658,0.0016646509,0.004443559,0.0017457013,0.0007890411,0.00034605758],"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.0006992178,0.0003018071,0.009036176,0.0004363521,0.00014575168,0.0007000765,0.00034512483,0.54640526,0.015039423,0.22038299,0.0011910822,0.20531668],"study_design_scores_gemma":[0.00003773645,0.0007918337,0.014773108,0.00028708996,0.0002731829,0.00075502344,0.0017086263,0.79190224,0.019885695,0.15585138,0.013527333,0.00020672042],"about_ca_topic_score_codex":0.001343966,"about_ca_topic_score_gemma":0.0013762724,"teacher_disagreement_score":0.003823877,"about_ca_system_score_codex":0.00163982,"about_ca_system_score_gemma":0.0008024926,"threshold_uncertainty_score":0.012297809},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054673543,0.00083281414,0.9851879,0.00033531841,0.00008741232,0.000075523705,0.00012508765,0.00007780183,0.0078107384],"genre_scores_gemma":[0.3360341,0.0026318522,0.647361,0.0003948179,0.00040789775,0.00061905035,0.00043529386,0.00029399517,0.011822012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897456,0.00031201713,0.000048161655,0.00015724858,0.0003774011,0.00013066063],"domain_scores_gemma":[0.9975829,0.0017864604,0.00015097768,0.00012849418,0.00028598087,0.00006508106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022122767,0.0017502226,0.0018925294,0.0011861388,0.0006791111,0.0026057628,0.0027521125,0.00281634,0.0066669197],"category_scores_gemma":[0.006485319,0.0019677682,0.0019133714,0.0021285983,0.0013404922,0.0025922281,0.002291374,0.0025672598,0.0005629059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019248531,0.000040528732,0.00008862611,0.00012517202,0.000022025592,0.000029129596,0.000031619875,0.9581463,0.0002904578,0.032750957,0.0006840923,0.007771849],"study_design_scores_gemma":[0.000006532138,0.0000070304663,0.000030115654,0.000008810195,0.0000052392083,0.000006544834,0.0000095309715,0.9879358,0.000061182815,0.0115419505,0.00038334122,0.0000038599974],"about_ca_topic_score_codex":0.010869145,"about_ca_topic_score_gemma":0.01152652,"teacher_disagreement_score":0.010869145,"about_ca_system_score_codex":0.0022518772,"about_ca_system_score_gemma":0.002684881,"threshold_uncertainty_score":0.022303104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013144845,0.0016657377,0.96822304,0.001561539,0.00014165534,0.0001411214,0.00018409984,0.00009757386,0.014840372],"genre_scores_gemma":[0.36519903,0.0047665867,0.6100688,0.0013881603,0.00088068366,0.00082544447,0.0008076737,0.00041599738,0.01564765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981421,0.00091305934,0.00008545852,0.0003849182,0.00029872078,0.00017565547],"domain_scores_gemma":[0.99668,0.0024601659,0.00024246,0.00023144015,0.00024812765,0.00013777903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004209705,0.0027913435,0.0015429284,0.00100085,0.0011174887,0.002566675,0.0018271732,0.0021914835,0.0071373163],"category_scores_gemma":[0.00845516,0.00088376773,0.0026577802,0.0018000485,0.0025599368,0.0053087394,0.0024736149,0.0046428354,0.0008070524],"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.00016646707,0.00013936502,0.00049566914,0.0006577396,0.00010921685,0.00036878046,0.00019577218,0.52794296,0.0019417895,0.40816835,0.009104956,0.05070895],"study_design_scores_gemma":[0.00004403552,0.0001324711,0.00019886534,0.00011611001,0.0000423934,0.00014706657,0.000064152504,0.6759398,0.0008387112,0.31612855,0.0063195415,0.000028365605],"about_ca_topic_score_codex":0.0031370313,"about_ca_topic_score_gemma":0.0023951204,"teacher_disagreement_score":0.0071373163,"about_ca_system_score_codex":0.0017349751,"about_ca_system_score_gemma":0.0019335902,"threshold_uncertainty_score":0.023876727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26919317,0.0026434078,0.6125373,0.0006694883,0.00037786714,0.00066894,0.0016550473,0.043750823,0.06850389],"genre_scores_gemma":[0.5952155,0.00042059104,0.3843142,0.00038417042,0.00004649457,0.0003457654,0.0022436464,0.0009994764,0.016030153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997758,0.000043109812,0.000012206097,0.00004191221,0.00008151157,0.000045424564],"domain_scores_gemma":[0.9997832,0.00009656501,0.000020024168,0.00003733872,0.000038642862,0.000024262588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033507467,0.00085832586,0.00037772593,0.00035359245,0.0003135713,0.00057762413,0.001449034,0.00040231337,0.014235582],"category_scores_gemma":[0.00083536404,0.00031123418,0.00042324254,0.00043574625,0.00028790813,0.00065668597,0.00048428302,0.00086245406,0.001964181],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018818554,0.00045277044,0.0036513475,0.0010857028,0.0002557769,0.0006379867,0.00025870343,0.40277138,0.086484425,0.03288372,0.080236,0.38940027],"study_design_scores_gemma":[0.00044916628,0.00063137483,0.0012113873,0.000045822253,0.000035007884,0.0001547714,0.000056890265,0.9237419,0.026824689,0.004347576,0.042456705,0.00004468371],"about_ca_topic_score_codex":0.0029428392,"about_ca_topic_score_gemma":0.0062689935,"teacher_disagreement_score":0.014235582,"about_ca_system_score_codex":0.00053645147,"about_ca_system_score_gemma":0.0010189227,"threshold_uncertainty_score":0.0476228},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006101746,0.00013909093,0.99133927,0.00008485658,0.000097824624,0.000063563675,0.000033770197,0.00024803873,0.0018918053],"genre_scores_gemma":[0.033972315,0.00020140372,0.9630219,0.000043673863,0.00005242613,0.00019103341,0.00010092399,0.000102320126,0.0023141117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955684,0.00007440254,0.000028967834,0.00009960605,0.00019179603,0.00004836325],"domain_scores_gemma":[0.99953616,0.00019997326,0.0000428729,0.000070831215,0.00011956914,0.000030622206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089302,0.0011717421,0.0012043908,0.000989493,0.0008828238,0.0010367394,0.0018619604,0.0016253012,0.005821248],"category_scores_gemma":[0.001445331,0.001095285,0.001624093,0.002169349,0.0006821316,0.0013073911,0.0011185218,0.0017882559,0.0010369705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061542384,0.00034345442,0.00056416355,0.00039294604,0.00013077413,0.00038138777,0.00018201013,0.50291055,0.032920666,0.04006752,0.009060092,0.41243112],"study_design_scores_gemma":[0.00010460639,0.00015000487,0.00022890228,0.000013625737,0.000034636352,0.00019475528,0.000025542193,0.98137707,0.0037744434,0.009607584,0.0044574374,0.000031249943],"about_ca_topic_score_codex":0.004571991,"about_ca_topic_score_gemma":0.0034204535,"teacher_disagreement_score":0.005821248,"about_ca_system_score_codex":0.0006976231,"about_ca_system_score_gemma":0.0013684422,"threshold_uncertainty_score":0.01947403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017569803,0.000089566296,0.9966112,0.000057774658,0.000010770873,0.00004897271,0.00005021982,0.00011063875,0.001263765],"genre_scores_gemma":[0.07959265,0.00038250003,0.9171943,0.00012402418,0.000041650164,0.00030256397,0.00041032996,0.000118341326,0.0018336171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987759,0.00041531405,0.00007415125,0.0002121613,0.00037043993,0.00015208698],"domain_scores_gemma":[0.9991893,0.00050876744,0.00008851784,0.00006622464,0.00011041351,0.000036778416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017462133,0.0017632818,0.0010974951,0.0012574417,0.00052404363,0.0015841344,0.0015484012,0.0013056857,0.00609892],"category_scores_gemma":[0.0025834772,0.0008952002,0.002070485,0.0015384891,0.00092035916,0.0016004186,0.0013375392,0.00265299,0.00092231063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052967105,0.00008090256,0.00034137443,0.00021285671,0.00003906197,0.00007367133,0.000070247814,0.8981253,0.0025450566,0.03558543,0.001225745,0.061647367],"study_design_scores_gemma":[0.000018264056,0.00003528408,0.000058692254,0.000023095134,0.000011265365,0.000027371172,0.000015104543,0.97829354,0.00092620787,0.018931702,0.0016508426,0.000008457872],"about_ca_topic_score_codex":0.0039033138,"about_ca_topic_score_gemma":0.0043051746,"teacher_disagreement_score":0.00609892,"about_ca_system_score_codex":0.0017146815,"about_ca_system_score_gemma":0.0023273318,"threshold_uncertainty_score":0.020402968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035738202,0.00005078865,0.96079576,0.000037266396,0.000025869229,0.00017356015,0.00012557516,0.031672243,0.0035451765],"genre_scores_gemma":[0.14513303,0.000115239294,0.83708084,0.00023144299,0.000042165226,0.0016749814,0.001057039,0.0053618653,0.009303389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987136,0.00048059592,0.00010434037,0.00021636926,0.00037079642,0.00011435497],"domain_scores_gemma":[0.9981306,0.0010127305,0.00012327923,0.00031714982,0.00029582143,0.00012044804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020706328,0.0013137576,0.0005807802,0.00065894384,0.00050463167,0.0013719068,0.0023722372,0.0008845672,0.023492154],"category_scores_gemma":[0.0052603437,0.0006455988,0.0007481146,0.00039971215,0.00047400568,0.0012148641,0.0025312137,0.0014827839,0.0046431525],"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.0028757176,0.0011148421,0.0022658273,0.0012063638,0.00027716244,0.00090983603,0.0018395062,0.123058274,0.088078775,0.07357731,0.052579906,0.65221643],"study_design_scores_gemma":[0.00020352568,0.00023472693,0.00030080607,0.000056184814,0.00003631247,0.00020848234,0.000064914,0.91490024,0.033420656,0.0094236,0.04107938,0.00007105949],"about_ca_topic_score_codex":0.00089433993,"about_ca_topic_score_gemma":0.0012586573,"teacher_disagreement_score":0.023492154,"about_ca_system_score_codex":0.00047973718,"about_ca_system_score_gemma":0.00093495543,"threshold_uncertainty_score":0.07858908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014802605,0.00057694473,0.9744342,0.00041047196,0.00013779358,0.00037927026,0.00029360916,0.00078271877,0.008182224],"genre_scores_gemma":[0.121270925,0.00059927726,0.87200046,0.00019580567,0.00009652163,0.00071188476,0.001051288,0.00027177585,0.0038021158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921155,0.0002152773,0.000035991954,0.00018125019,0.00022366304,0.00013227681],"domain_scores_gemma":[0.9988788,0.0006921759,0.000091870446,0.00009263666,0.00016583079,0.00007864926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635396,0.0015505922,0.0019415552,0.0013773226,0.0010979223,0.0016215066,0.0015856405,0.0020255926,0.00792685],"category_scores_gemma":[0.0032783898,0.0008090945,0.0010878169,0.0029017269,0.0005686317,0.0017245321,0.0012629649,0.0028124228,0.0011154982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013885608,0.00032380086,0.00053779286,0.00025193213,0.000059769744,0.00012550992,0.00007387796,0.71857625,0.001791249,0.020612393,0.011631746,0.24587686],"study_design_scores_gemma":[0.000047809313,0.000061706916,0.00009747939,0.000011812167,0.000011603025,0.00005048129,0.000019402081,0.98990786,0.00043540946,0.0076141655,0.0017327992,0.000009398136],"about_ca_topic_score_codex":0.007493631,"about_ca_topic_score_gemma":0.006625161,"teacher_disagreement_score":0.00792685,"about_ca_system_score_codex":0.0014561747,"about_ca_system_score_gemma":0.0038271481,"threshold_uncertainty_score":0.026517987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120427355,0.00090757705,0.8718731,0.0006017358,0.00014217313,0.00013858914,0.00039872222,0.0016055196,0.0039053378],"genre_scores_gemma":[0.89034474,0.00037490606,0.105789214,0.00024275765,0.00012678483,0.00010592763,0.00045983127,0.00013517015,0.00242072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742717,0.00073965115,0.00011991094,0.000637624,0.000679904,0.00039576256],"domain_scores_gemma":[0.9871122,0.009262458,0.0010846616,0.0016584364,0.0005962695,0.00028587176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388201,0.0010787213,0.0018473513,0.00041886256,0.00069097924,0.0017856446,0.002037763,0.0016715808,0.0025230006],"category_scores_gemma":[0.014609092,0.00074681605,0.0005031109,0.0013817409,0.0014550276,0.0038042555,0.0015938818,0.0020030225,0.0005729033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063126703,0.0001479049,0.0012228623,0.00011697585,0.00003415342,0.000102348284,0.00007505305,0.92463464,0.001912883,0.017244559,0.0020974146,0.05177993],"study_design_scores_gemma":[0.000013102731,0.000047699716,0.00014624439,0.000006608629,0.000004947308,0.000032457418,0.000012038681,0.98676676,0.0011351826,0.011481372,0.00034800664,0.0000055049013],"about_ca_topic_score_codex":0.0026715,"about_ca_topic_score_gemma":0.0017188429,"teacher_disagreement_score":0.0026715,"about_ca_system_score_codex":0.001346867,"about_ca_system_score_gemma":0.0014599374,"threshold_uncertainty_score":0.012630105},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015674169,0.014500082,0.2984967,0.0012052706,0.0011303255,0.00014733095,0.000961273,0.0038634392,0.6781282],"genre_scores_gemma":[0.023479905,0.0124945985,0.29602686,0.0011411126,0.0006381128,0.00035149575,0.0032661357,0.0022520092,0.66034985],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965,0.00006257176,0.000012593729,0.00006944449,0.00017976973,0.000025553487],"domain_scores_gemma":[0.99975127,0.00008607788,0.000009927237,0.00006366232,0.000073589465,0.000015540625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029363812,0.0013673335,0.001047211,0.0013801923,0.00087079586,0.0021429076,0.0016536233,0.0011506535,0.08362775],"category_scores_gemma":[0.0010982654,0.00061851117,0.00075939624,0.003618058,0.0007198025,0.0018584012,0.0010195029,0.0022933707,0.051075727],"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.00003850601,0.000079936646,0.00007643336,0.0003181636,0.000023014925,0.000036228732,0.00006918573,0.011975687,0.0012456378,0.089532845,0.28253984,0.6140646],"study_design_scores_gemma":[0.0000219868,0.00005727174,0.00021223848,0.00028137522,0.00002335604,0.00028394864,0.000047723628,0.031389043,0.0019873776,0.12153922,0.8441275,0.0000290357],"about_ca_topic_score_codex":0.0017117457,"about_ca_topic_score_gemma":0.0037408096,"teacher_disagreement_score":0.08362775,"about_ca_system_score_codex":0.0009587251,"about_ca_system_score_gemma":0.0011475747,"threshold_uncertainty_score":0.27976274},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008368768,0.00045719248,0.9868558,0.00020175366,0.000030407253,0.000119827855,0.00012315114,0.0010923886,0.0027506186],"genre_scores_gemma":[0.12752376,0.000325954,0.8657858,0.00024982027,0.00004344965,0.00056049536,0.00073008356,0.000359682,0.0044209715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992072,0.0002806828,0.000037788,0.00020765587,0.00017680206,0.00008998572],"domain_scores_gemma":[0.9986129,0.0008698985,0.00012329928,0.000158116,0.00015880646,0.00007699663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010901884,0.0009887367,0.0012880487,0.0010839589,0.00072544493,0.0011183241,0.002011388,0.0016712261,0.008958404],"category_scores_gemma":[0.004402192,0.0006738475,0.0009748891,0.0020818976,0.0008443447,0.0029347886,0.0019404682,0.0021486792,0.0021350263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054912205,0.00042013603,0.0011045295,0.0005377754,0.0001394719,0.00019188362,0.00031853755,0.6038659,0.0063599665,0.044904545,0.019667119,0.321941],"study_design_scores_gemma":[0.00011734603,0.00010098182,0.00013586541,0.00003507596,0.000023798177,0.00010967077,0.00006852191,0.9761898,0.0014067082,0.018725626,0.0030718255,0.0000147743685],"about_ca_topic_score_codex":0.0031566834,"about_ca_topic_score_gemma":0.004395478,"teacher_disagreement_score":0.008958404,"about_ca_system_score_codex":0.0012853887,"about_ca_system_score_gemma":0.0016679897,"threshold_uncertainty_score":0.029968858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53696275,0.0017724754,0.42217034,0.0024176668,0.00019553716,0.00033999459,0.0015728306,0.0007606438,0.03380779],"genre_scores_gemma":[0.82052135,0.0010504364,0.1643798,0.00024442843,0.00019921968,0.00022777132,0.0018339348,0.00026248314,0.011280596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913967,0.00022586797,0.00006677918,0.0002009036,0.00010685887,0.00025991048],"domain_scores_gemma":[0.9981483,0.0009276829,0.0002921213,0.00030713857,0.00008443927,0.0002402867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009324223,0.0009999713,0.0015817846,0.00074478023,0.0012482016,0.0028624334,0.0018259047,0.002417197,0.009318509],"category_scores_gemma":[0.004586987,0.0009770868,0.0009610028,0.00201202,0.0011953759,0.0053184726,0.0021013361,0.0011756602,0.0010745714],"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.0028631652,0.0006985126,0.0057316166,0.0017223686,0.00037761338,0.0012353536,0.0014420891,0.44816992,0.025245192,0.23679559,0.036116205,0.23960225],"study_design_scores_gemma":[0.00022625322,0.00090911926,0.0042270976,0.00019494334,0.00024648636,0.002601495,0.0015042385,0.62759036,0.019900152,0.3123445,0.03014369,0.00011175039],"about_ca_topic_score_codex":0.0013950844,"about_ca_topic_score_gemma":0.0007577055,"teacher_disagreement_score":0.009318509,"about_ca_system_score_codex":0.00090471614,"about_ca_system_score_gemma":0.00055054,"threshold_uncertainty_score":0.031173468},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16507654,0.004976739,0.73324007,0.0014255857,0.0020440465,0.00015481767,0.0004859893,0.0024812673,0.09011493],"genre_scores_gemma":[0.877132,0.001460614,0.06861924,0.00025333735,0.0005858824,0.00011889183,0.0006700987,0.0009674286,0.0501925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992028,0.0001405754,0.000030852,0.00014412784,0.00021206768,0.00026966404],"domain_scores_gemma":[0.9992536,0.0002372094,0.000052804397,0.00015439103,0.00015514377,0.00014691114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007454338,0.0010994844,0.0011052286,0.00068224146,0.0011082366,0.002732719,0.0023215716,0.0010625584,0.016801842],"category_scores_gemma":[0.0024841938,0.00063798943,0.0005416888,0.0013408612,0.0004591687,0.0023883178,0.0022987996,0.0012019308,0.0030855485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000891824,0.00020645245,0.0011417742,0.0002916732,0.000089937465,0.00042172224,0.00016667957,0.653129,0.017782869,0.030258695,0.039847977,0.25577146],"study_design_scores_gemma":[0.000015962232,0.00011093065,0.00078243227,0.000029489102,0.000017162514,0.00015412582,0.00011871942,0.9638053,0.003581283,0.023419611,0.0079470305,0.000017881559],"about_ca_topic_score_codex":0.0023308252,"about_ca_topic_score_gemma":0.002604623,"teacher_disagreement_score":0.016801842,"about_ca_system_score_codex":0.0010400965,"about_ca_system_score_gemma":0.00064661296,"threshold_uncertainty_score":0.056207716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004886568,0.00007215848,0.99070156,0.00008886994,0.00002139973,0.00005389443,0.000028467266,0.00023620401,0.003910802],"genre_scores_gemma":[0.13110575,0.00020274325,0.86495876,0.00018273127,0.000047170804,0.0002928254,0.00016551367,0.00012233706,0.0029221366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995827,0.00011683617,0.000017375407,0.00007167025,0.0001617935,0.00004958174],"domain_scores_gemma":[0.9996111,0.00020617449,0.000047371628,0.00003888172,0.00007324183,0.000023139504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006393462,0.00094196235,0.00071086205,0.0009238766,0.0005615301,0.0010765765,0.0016236834,0.0009614982,0.0035772554],"category_scores_gemma":[0.001047693,0.00045402,0.00093584356,0.00077607954,0.00071352295,0.0007997733,0.0009946579,0.00112713,0.0007160362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038337872,0.00006278419,0.00027314664,0.000095761854,0.000032942193,0.00007212192,0.00004862073,0.9154164,0.0032193167,0.022546794,0.0011759689,0.057017796],"study_design_scores_gemma":[0.000010055824,0.000028333705,0.000036294765,0.000005630164,0.000004447485,0.00002655658,0.000007757854,0.9948008,0.00051303045,0.003328733,0.0012331656,0.0000052821647],"about_ca_topic_score_codex":0.0037715144,"about_ca_topic_score_gemma":0.004529429,"teacher_disagreement_score":0.0037715144,"about_ca_system_score_codex":0.0009965707,"about_ca_system_score_gemma":0.0015403089,"threshold_uncertainty_score":0.011967123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003780952,0.99416673,0.0019520829,0.0002462048,0.00025186944,0.0000091233815,0.000042851807,0.00002256078,0.0029304908],"genre_scores_gemma":[0.001970804,0.99524176,0.0015451265,0.0001281929,0.00026762908,0.000012156885,0.00011058888,0.000008531937,0.0007153862],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969375,0.000037168473,0.00004126112,0.000072982504,0.00012352834,0.00003133794],"domain_scores_gemma":[0.99926275,0.00040883193,0.0000788058,0.000025276977,0.00018369542,0.000040632425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005438687,0.0014298994,0.0016971194,0.0026282119,0.0005332987,0.0014763838,0.0012782813,0.0012268698,0.0047706785],"category_scores_gemma":[0.0013107487,0.00077168876,0.0010118932,0.0048545557,0.0006039991,0.0027717182,0.00093903707,0.0013138996,0.0026587395],"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.00005302091,0.00015459402,0.00049766205,0.022764904,0.000111092144,0.00020059406,0.00008954642,0.004700341,0.0012644543,0.016543876,0.043757435,0.9098626],"study_design_scores_gemma":[0.000013612876,0.00016665831,0.00090988184,0.005432199,0.00016272688,0.0015437957,0.00013779377,0.0024961773,0.0010682001,0.012150973,0.97585094,0.00006694061],"about_ca_topic_score_codex":0.0015072835,"about_ca_topic_score_gemma":0.001441868,"teacher_disagreement_score":0.0047706785,"about_ca_system_score_codex":0.000564108,"about_ca_system_score_gemma":0.0013659514,"threshold_uncertainty_score":0.015959442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00428665,0.00045812962,0.9857619,0.0004004556,0.00012268002,0.00023432802,0.0001177936,0.0008630963,0.007755032],"genre_scores_gemma":[0.050605852,0.0005446072,0.94173986,0.00017982922,0.00012634433,0.00048741602,0.0005003536,0.00036907394,0.0054467237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986105,0.00034095615,0.000080261256,0.00027103783,0.00043897747,0.00025816503],"domain_scores_gemma":[0.9986526,0.0007656393,0.00012050459,0.00014406812,0.00020841988,0.00010873463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015966889,0.0020413974,0.0020551893,0.0014902693,0.0015986686,0.002282791,0.0022161724,0.0023547322,0.013816556],"category_scores_gemma":[0.0040631467,0.0011209191,0.0013620926,0.0029587974,0.00092578615,0.0026312873,0.0025536036,0.0041981256,0.004044219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029857206,0.0004642534,0.0005463524,0.00039561413,0.00011701643,0.00028629508,0.00024084197,0.48933288,0.0035087743,0.06999886,0.02802102,0.40678954],"study_design_scores_gemma":[0.0001187511,0.00010262849,0.00010105859,0.000034454286,0.000029439017,0.000108080596,0.00005182886,0.95447785,0.0008505142,0.03639132,0.0077157724,0.000018269171],"about_ca_topic_score_codex":0.0052763913,"about_ca_topic_score_gemma":0.0061944043,"teacher_disagreement_score":0.013816556,"about_ca_system_score_codex":0.0015545667,"about_ca_system_score_gemma":0.0034248647,"threshold_uncertainty_score":0.046221018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013481546,0.00027427386,0.9766192,0.00018417266,0.00012052552,0.00010825466,0.00017008757,0.00030633752,0.0087355785],"genre_scores_gemma":[0.113134526,0.0004910053,0.87828565,0.00014316062,0.00008544005,0.00028646013,0.00032461548,0.0004488218,0.0068002953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995389,0.00010273185,0.00002612595,0.00009251092,0.0001751936,0.00006466408],"domain_scores_gemma":[0.9989994,0.0007178373,0.0000780304,0.00006956973,0.000082548846,0.000052604915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077942736,0.001352389,0.0018944461,0.0009656542,0.0008452217,0.0023625037,0.0018333942,0.0021927163,0.009544251],"category_scores_gemma":[0.0023100127,0.0017075373,0.0016174081,0.0028661569,0.00088464934,0.0018593966,0.0016232582,0.0017333976,0.0008666868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005667531,0.000058697082,0.00018995615,0.00014588838,0.000026447311,0.0001244103,0.000056448644,0.93089586,0.001953757,0.019416433,0.0034620762,0.04361336],"study_design_scores_gemma":[0.000010151986,0.00001325787,0.00004727539,0.0000069878856,0.0000046626974,0.000024569834,0.000011006915,0.99017966,0.0003604887,0.008037147,0.0012972421,0.000007522303],"about_ca_topic_score_codex":0.0101033645,"about_ca_topic_score_gemma":0.0087411525,"teacher_disagreement_score":0.0101033645,"about_ca_system_score_codex":0.0011967049,"about_ca_system_score_gemma":0.0015738124,"threshold_uncertainty_score":0.031928718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07684224,0.0009657699,0.9147134,0.00027392173,0.00010297607,0.00011055666,0.0002555385,0.00036039794,0.006375234],"genre_scores_gemma":[0.6160796,0.0009562436,0.37571737,0.00012738357,0.00008907456,0.00031519224,0.0008061514,0.0002398101,0.005669075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994011,0.00016154106,0.00003763175,0.00013870782,0.00013591617,0.00012510597],"domain_scores_gemma":[0.9993488,0.00031347497,0.000094944895,0.000076814846,0.00008818413,0.00007778527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007078541,0.0012346468,0.0021057844,0.0008585087,0.00064541236,0.0012454974,0.0013297315,0.001336362,0.0031824668],"category_scores_gemma":[0.0016380909,0.00066909153,0.0011242856,0.0018277968,0.0006240838,0.0015630116,0.0012871498,0.00101567,0.0004196545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001001406,0.00006375962,0.00056069496,0.00016452959,0.000034621862,0.0001383937,0.000032109034,0.9648282,0.0014779145,0.0065453346,0.0012800589,0.024774307],"study_design_scores_gemma":[0.000014407344,0.00005139594,0.0002217561,0.000009890452,0.000011409099,0.000057021403,0.00002676064,0.9944825,0.00051187293,0.0038540855,0.0007512967,0.0000076248984],"about_ca_topic_score_codex":0.0032834418,"about_ca_topic_score_gemma":0.0023644126,"teacher_disagreement_score":0.0032834418,"about_ca_system_score_codex":0.000651678,"about_ca_system_score_gemma":0.0010213412,"threshold_uncertainty_score":0.010646403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63706577,0.0040193023,0.3232821,0.0022086937,0.00033171911,0.000120230405,0.00081818755,0.00023736239,0.03191662],"genre_scores_gemma":[0.93041617,0.001234013,0.048469514,0.000109323366,0.000118896176,0.00006977092,0.00055374333,0.000054985503,0.018973662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997385,0.00009282424,0.000010358873,0.000052055428,0.000057568806,0.00004869158],"domain_scores_gemma":[0.9993094,0.00047646492,0.00006601655,0.00001855626,0.00005490268,0.00007461567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000381315,0.0005163495,0.00097373716,0.000735495,0.0007146138,0.0015739669,0.00097409723,0.0018158186,0.0035013766],"category_scores_gemma":[0.0010896273,0.00037803449,0.00061464915,0.0013810805,0.00046806454,0.0011651409,0.00044421732,0.0008382589,0.00020818778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052108703,0.00019841542,0.0014619962,0.00036489897,0.000045257824,0.0006802495,0.00012778376,0.9212316,0.0042837625,0.030564573,0.0058595804,0.03466081],"study_design_scores_gemma":[0.0000230071,0.00007181787,0.0010477654,0.000011272109,0.000011432423,0.000093747345,0.000066716,0.98376805,0.0011870897,0.012185204,0.0015180785,0.000015812699],"about_ca_topic_score_codex":0.007769655,"about_ca_topic_score_gemma":0.0064302953,"teacher_disagreement_score":0.007769655,"about_ca_system_score_codex":0.001101684,"about_ca_system_score_gemma":0.0007907719,"threshold_uncertainty_score":0.015448868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017143538,0.0124527095,0.92084056,0.0039290874,0.00076992786,0.00024134337,0.0008987267,0.0017007263,0.042023487],"genre_scores_gemma":[0.20063029,0.013664178,0.75583243,0.0016334994,0.0025992456,0.0012928331,0.0033502262,0.0018724207,0.019124862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910488,0.0022958242,0.0004285278,0.0009542486,0.0036370193,0.0016355992],"domain_scores_gemma":[0.96708417,0.025751386,0.0014462961,0.003059538,0.0017601365,0.000898436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073910854,0.004017343,0.0037597565,0.0047517032,0.002838844,0.013169676,0.007805852,0.0049427296,0.016007585],"category_scores_gemma":[0.04520529,0.0025741507,0.0032602886,0.010696265,0.003528188,0.017959716,0.0085574165,0.012662112,0.0044905394],"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.0014368864,0.0007585668,0.00094367756,0.0011469302,0.0001735221,0.00012480587,0.00045183487,0.3107617,0.0031719808,0.37177455,0.036073882,0.27318168],"study_design_scores_gemma":[0.00017017774,0.000091478796,0.0003603281,0.00026208116,0.000094862,0.00012749262,0.00012085524,0.5746598,0.0022407083,0.40874162,0.013071186,0.0000592794],"about_ca_topic_score_codex":0.003738795,"about_ca_topic_score_gemma":0.0042228103,"teacher_disagreement_score":0.016007585,"about_ca_system_score_codex":0.006636729,"about_ca_system_score_gemma":0.0035799267,"threshold_uncertainty_score":0.05355066},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08695406,0.0020215558,0.88026834,0.0035283724,0.00026871878,0.00069421733,0.001183132,0.00092349417,0.024158029],"genre_scores_gemma":[0.47651985,0.0018319775,0.49702764,0.0018529536,0.0008810217,0.0015581204,0.0032271214,0.0010825865,0.016018711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993004,0.0027831907,0.0004591592,0.0016548628,0.0011659948,0.0009327176],"domain_scores_gemma":[0.97464424,0.01987009,0.001439544,0.0021673238,0.0007927795,0.0010860064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059271543,0.0035627172,0.004144722,0.0016729396,0.0031845851,0.0042595896,0.005205475,0.005184391,0.010733209],"category_scores_gemma":[0.03255804,0.002104436,0.0025346423,0.0048181615,0.0031888888,0.013132582,0.0065902555,0.005608906,0.0015291964],"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.00096909003,0.0009362652,0.002395766,0.0011946441,0.00026280805,0.00070354156,0.0010876954,0.41035295,0.0029735926,0.4376467,0.02712143,0.114355475],"study_design_scores_gemma":[0.00015750516,0.00022682863,0.00044228448,0.00011666198,0.000070094546,0.00039213517,0.00035775776,0.5552122,0.0017429944,0.43065578,0.01056993,0.000055824694],"about_ca_topic_score_codex":0.002160146,"about_ca_topic_score_gemma":0.0022474995,"teacher_disagreement_score":0.010733209,"about_ca_system_score_codex":0.002344439,"about_ca_system_score_gemma":0.001549779,"threshold_uncertainty_score":0.035906196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02985769,0.0020970681,0.9537731,0.00056046725,0.00019802006,0.00027024501,0.0003207119,0.000690141,0.0122325625],"genre_scores_gemma":[0.25848076,0.0016372273,0.7342886,0.00050076627,0.00015695834,0.0008117339,0.0007181298,0.00019774954,0.0032080968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992655,0.0003363158,0.00004856793,0.00011591702,0.00013702147,0.00009662571],"domain_scores_gemma":[0.998049,0.0015004394,0.00017939677,0.000078496145,0.00014055482,0.000052115658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014311962,0.0022552707,0.0016767237,0.0017861316,0.00055967865,0.0017727762,0.0019859446,0.0017400931,0.0029193412],"category_scores_gemma":[0.0033943164,0.0009087187,0.0017629494,0.0021103413,0.00063844956,0.0011078903,0.00088334,0.0019928187,0.0005891392],"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.00003473593,0.00008361287,0.00029984096,0.00010658836,0.000057903573,0.000038928894,0.000033677657,0.96672386,0.00034343367,0.0054943645,0.001005108,0.025777902],"study_design_scores_gemma":[0.000022022048,0.00002683665,0.000048488837,0.000019584517,0.000015111848,0.0000123174395,0.0000168004,0.9953004,0.00016594847,0.0036511435,0.00071604503,0.0000051704305],"about_ca_topic_score_codex":0.004815101,"about_ca_topic_score_gemma":0.005143438,"teacher_disagreement_score":0.004815101,"about_ca_system_score_codex":0.0013463912,"about_ca_system_score_gemma":0.0017406929,"threshold_uncertainty_score":0.009768844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18577814,0.0005373006,0.79021674,0.0006874769,0.0003412876,0.00021177201,0.0001612732,0.0024636593,0.019602379],"genre_scores_gemma":[0.9199308,0.00016465559,0.073535405,0.00016601523,0.000049441922,0.00011370661,0.00013080251,0.000029060862,0.005880037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982953,0.00003231189,0.000011874711,0.000034667446,0.000057740104,0.00003380736],"domain_scores_gemma":[0.9998292,0.000031658517,0.000031414842,0.000022411643,0.000043340868,0.000041866868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022309132,0.0003419345,0.00047796752,0.0002708934,0.000513129,0.0007286251,0.000699093,0.000529895,0.00204162],"category_scores_gemma":[0.0002939737,0.00018095787,0.00023562234,0.00030759172,0.00026438225,0.00066982815,0.001061082,0.00035563335,0.0004951608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008221126,0.0008935266,0.0050266837,0.0003550752,0.00014272591,0.0011970871,0.00032048806,0.5909755,0.07882269,0.018305667,0.011960657,0.2911778],"study_design_scores_gemma":[0.000028076392,0.00015996415,0.000478944,0.00000627589,0.000016411523,0.00009224042,0.000044020908,0.99020433,0.0033468732,0.0015461674,0.004066013,0.000010691023],"about_ca_topic_score_codex":0.00097145163,"about_ca_topic_score_gemma":0.0016026084,"teacher_disagreement_score":0.00204162,"about_ca_system_score_codex":0.0002289101,"about_ca_system_score_gemma":0.00074118795,"threshold_uncertainty_score":0.006829858},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031343815,0.000120952085,0.9298065,0.00039216463,0.00038067668,0.0002808337,0.0031213611,0.049198084,0.013565061],"genre_scores_gemma":[0.03289407,0.00035355822,0.8877835,0.00066005706,0.00018926414,0.0008338438,0.011549256,0.046235967,0.019500516],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707603,0.00039803144,0.0002669217,0.0005364919,0.0014097646,0.000312677],"domain_scores_gemma":[0.9965379,0.0007547106,0.00019459453,0.0014787992,0.0009087032,0.00012536344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018937764,0.0023189764,0.0012930626,0.0021943874,0.0011548552,0.0039299624,0.0025573703,0.0011013352,0.051798407],"category_scores_gemma":[0.010280536,0.0012147271,0.0031308297,0.0026342524,0.0010344263,0.003275703,0.0036735649,0.0036495847,0.036208373],"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.00049791235,0.0003336855,0.0014811124,0.000641015,0.00014562174,0.00049086305,0.00040279838,0.037659205,0.020533388,0.09633398,0.42281508,0.41866538],"study_design_scores_gemma":[0.00015723848,0.0001562349,0.0013683771,0.0001893275,0.00008222581,0.00074434705,0.00022653051,0.34568,0.045891177,0.1755143,0.42983133,0.00015891636],"about_ca_topic_score_codex":0.0023551704,"about_ca_topic_score_gemma":0.002027835,"teacher_disagreement_score":0.051798407,"about_ca_system_score_codex":0.0010408439,"about_ca_system_score_gemma":0.0018845784,"threshold_uncertainty_score":0.17328292},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036396082,0.0022220802,0.79868585,0.0013534883,0.00021164304,0.0003378336,0.0014003308,0.0019732758,0.15741931],"genre_scores_gemma":[0.26083225,0.0019964417,0.6961758,0.00062042807,0.00029681166,0.00028239316,0.002571729,0.00064952805,0.036574636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730885,0.00038393302,0.000139879,0.0003635745,0.001274695,0.00052902015],"domain_scores_gemma":[0.99808806,0.0005345499,0.00010696202,0.0005786803,0.00042148173,0.00027032776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011515426,0.00082029426,0.0016587173,0.0026968112,0.0027438982,0.0045368746,0.0035026479,0.0013143221,0.02814529],"category_scores_gemma":[0.0038178295,0.0012318821,0.0016357228,0.0047527114,0.0013924185,0.005430167,0.0046084044,0.0047588795,0.005916173],"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.00020039621,0.0004156369,0.00077697943,0.0004242493,0.00006394318,0.00014547315,0.00044696467,0.057155587,0.003306978,0.6478795,0.024912305,0.264272],"study_design_scores_gemma":[0.000063261126,0.00018105848,0.0006944275,0.00018152613,0.000075325246,0.0002822746,0.0002711383,0.22265111,0.0033479037,0.7176238,0.05456321,0.0000650391],"about_ca_topic_score_codex":0.0045183552,"about_ca_topic_score_gemma":0.0057158144,"teacher_disagreement_score":0.02814529,"about_ca_system_score_codex":0.0024058188,"about_ca_system_score_gemma":0.0029997833,"threshold_uncertainty_score":0.09415537},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004599561,0.0003983495,0.9873978,0.00012319996,0.000050925948,0.000052866908,0.000074796786,0.0005081308,0.006794444],"genre_scores_gemma":[0.12355083,0.00060963363,0.86330146,0.00018374076,0.00007616166,0.00035361442,0.00040431993,0.00031986428,0.011200379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993476,0.00023083304,0.000026776908,0.00012387718,0.0001794523,0.00009137963],"domain_scores_gemma":[0.9986915,0.0008570121,0.00008529951,0.00019215446,0.00012163621,0.00005243651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010803393,0.0014886927,0.0016259158,0.0011062372,0.0008145479,0.0015236172,0.0019099977,0.0018723605,0.015531591],"category_scores_gemma":[0.0041009807,0.00094569067,0.00091770425,0.0018997145,0.00096055376,0.0024367755,0.0015196176,0.0020718519,0.0029798949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018071845,0.00015315524,0.0003954062,0.00023366952,0.00003973372,0.000040276693,0.00008263027,0.66026795,0.0015410405,0.07269868,0.007986758,0.25637996],"study_design_scores_gemma":[0.000044464723,0.000041459196,0.00008203396,0.000032121534,0.000009924808,0.00001893819,0.000013928154,0.9339377,0.0005893636,0.061913013,0.0033066845,0.000010260815],"about_ca_topic_score_codex":0.0023356215,"about_ca_topic_score_gemma":0.0034665172,"teacher_disagreement_score":0.015531591,"about_ca_system_score_codex":0.0011551066,"about_ca_system_score_gemma":0.0011676074,"threshold_uncertainty_score":0.051958382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047292262,0.0029662086,0.9291726,0.0018524721,0.00026942862,0.00021900902,0.0010621257,0.0015752808,0.015590687],"genre_scores_gemma":[0.27899617,0.0027415932,0.6962556,0.0006476988,0.0004510832,0.00057445193,0.0031881367,0.0011386118,0.0160067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797267,0.0006217753,0.000090589376,0.00048797674,0.00045419112,0.00037284964],"domain_scores_gemma":[0.99122787,0.0062310807,0.0004565221,0.0013386284,0.00035300446,0.00039295317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022215322,0.0027194913,0.0027799266,0.0023089664,0.001538128,0.0039488752,0.00509314,0.0031343023,0.013966699],"category_scores_gemma":[0.015665501,0.0016844221,0.0020191292,0.006647052,0.0019541236,0.008704428,0.0037440863,0.005235612,0.0023686837],"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.0008690566,0.00063560955,0.0016645476,0.0008489969,0.00021239472,0.00013404597,0.00047308762,0.57229125,0.0023633207,0.14909971,0.03792199,0.233486],"study_design_scores_gemma":[0.00014163868,0.00007742087,0.00025705755,0.00006910901,0.00006242044,0.00011089434,0.00011251785,0.766519,0.00088853907,0.22656237,0.005179043,0.000019934947],"about_ca_topic_score_codex":0.0054429034,"about_ca_topic_score_gemma":0.0063242633,"teacher_disagreement_score":0.013966699,"about_ca_system_score_codex":0.0033299301,"about_ca_system_score_gemma":0.0020659773,"threshold_uncertainty_score":0.046723306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016439358,0.00014642644,0.99574214,0.00006434851,0.000051086772,0.000060858558,0.000040905248,0.0003272275,0.0019230255],"genre_scores_gemma":[0.041020654,0.00030123882,0.9544786,0.000085464126,0.000057445246,0.00033901702,0.00026898342,0.00025073113,0.0031978267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994537,0.000096299824,0.000031408857,0.00008457688,0.00029096645,0.000042953998],"domain_scores_gemma":[0.9994929,0.00023129764,0.000044354034,0.000087835484,0.00011932566,0.000024394081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052850985,0.0010564432,0.00097362767,0.0012539995,0.00046147406,0.00077270204,0.0016106601,0.0008293857,0.004970016],"category_scores_gemma":[0.001680749,0.0006115481,0.0016046964,0.0016101343,0.00045254483,0.000998942,0.0012309777,0.0019090218,0.0013207807],"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.00008530689,0.00019719715,0.00049209036,0.0005081653,0.000086225584,0.00018289975,0.000116546995,0.44371873,0.01411346,0.04026021,0.010130447,0.4901086],"study_design_scores_gemma":[0.000030015568,0.00005616718,0.00012665258,0.000023906363,0.000019325264,0.00012601572,0.000017930857,0.9752807,0.0024363084,0.013264997,0.008604613,0.000013456566],"about_ca_topic_score_codex":0.0019930843,"about_ca_topic_score_gemma":0.0022286621,"teacher_disagreement_score":0.004970016,"about_ca_system_score_codex":0.00047381595,"about_ca_system_score_gemma":0.001142474,"threshold_uncertainty_score":0.016626358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33427635,0.0003711717,0.61832654,0.0026418734,0.0006963128,0.00069926877,0.0032800634,0.009843499,0.02986492],"genre_scores_gemma":[0.6492423,0.00017283396,0.3423191,0.0002251814,0.000047637022,0.0005944571,0.0019232337,0.00091633335,0.0045591025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808735,0.000979628,0.00013667771,0.00019666448,0.00043115145,0.0001684082],"domain_scores_gemma":[0.97872376,0.015735252,0.00046766244,0.002269217,0.0024081813,0.00039597368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032110189,0.0013567597,0.0007069514,0.0006324415,0.00071458996,0.00106285,0.0028277417,0.0015550664,0.015232634],"category_scores_gemma":[0.020061802,0.00077480084,0.0008374422,0.00069150893,0.00085506967,0.0013497826,0.001374404,0.0025953453,0.0015221925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096075324,0.0020219414,0.002124935,0.00042399293,0.000073600895,0.00029158706,0.00025578766,0.89334166,0.0070244344,0.023512125,0.015172574,0.054796588],"study_design_scores_gemma":[0.00030061198,0.0002488819,0.00019376067,0.000016802725,0.000012374743,0.000022807028,0.000043298507,0.98575866,0.006630714,0.0045033456,0.0022545308,0.000014197866],"about_ca_topic_score_codex":0.009240283,"about_ca_topic_score_gemma":0.011786292,"teacher_disagreement_score":0.015232634,"about_ca_system_score_codex":0.0010441879,"about_ca_system_score_gemma":0.0018787957,"threshold_uncertainty_score":0.050958216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58552533,0.0030785867,0.27606058,0.0037530316,0.0006114631,0.00013584663,0.0013952006,0.00026259458,0.12917738],"genre_scores_gemma":[0.9170007,0.002789797,0.059787326,0.00095381023,0.0005497199,0.00019138068,0.0015141502,0.00021370246,0.016999356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937683,0.00028049495,0.000024270636,0.00010294064,0.00011482949,0.000100561105],"domain_scores_gemma":[0.99586225,0.0026962652,0.0005474479,0.00026132737,0.00025906385,0.0003736946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987398,0.0010877511,0.0012326697,0.0019486535,0.0013252926,0.002149962,0.0018597798,0.0018324195,0.012891405],"category_scores_gemma":[0.007710095,0.00070991425,0.000845568,0.0022849198,0.0023940566,0.004245994,0.0031740116,0.0030758653,0.0008277821],"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.00036557388,0.000071214316,0.0014850055,0.00031170287,0.000042464926,0.00041425662,0.00032995903,0.056347385,0.0015206106,0.90055805,0.009692132,0.02886166],"study_design_scores_gemma":[0.000038910333,0.00007973898,0.0010707723,0.0000798865,0.000021706777,0.00027365863,0.00018319767,0.105713695,0.00040443544,0.8882152,0.0038990926,0.000019708981],"about_ca_topic_score_codex":0.0016699536,"about_ca_topic_score_gemma":0.001534294,"teacher_disagreement_score":0.012891405,"about_ca_system_score_codex":0.00071302097,"about_ca_system_score_gemma":0.00045103536,"threshold_uncertainty_score":0.043126047},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078863726,0.020009333,0.1406757,0.0012145607,0.0018391245,0.000054037107,0.0005164961,0.00088306336,0.8340191],"genre_scores_gemma":[0.02962001,0.03359721,0.16079146,0.0017081207,0.0019368108,0.00026409706,0.0022925108,0.0015749916,0.76821476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997011,0.00004251185,0.000010511237,0.000053409898,0.00016888652,0.00002360344],"domain_scores_gemma":[0.999845,0.00006163355,0.000008613723,0.00003332379,0.000038454997,0.000012898979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028651708,0.0016580289,0.001081743,0.00093830423,0.00047014633,0.0020401913,0.0009584558,0.00087163225,0.059127003],"category_scores_gemma":[0.0008290723,0.00057803554,0.00074374786,0.0017315774,0.00071154593,0.0016299698,0.001256773,0.0031640278,0.035028968],"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.00004213808,0.00012365927,0.000096975404,0.00051561615,0.000032298958,0.0000749746,0.00006304391,0.013819749,0.002055534,0.24504939,0.3282463,0.40988034],"study_design_scores_gemma":[0.000011596487,0.000032254855,0.00023431436,0.0002736352,0.00001565731,0.00022221747,0.000026539004,0.016969848,0.0016192658,0.21849804,0.76207477,0.000021976086],"about_ca_topic_score_codex":0.00069476815,"about_ca_topic_score_gemma":0.0014419099,"teacher_disagreement_score":0.059127003,"about_ca_system_score_codex":0.0007272173,"about_ca_system_score_gemma":0.00080027804,"threshold_uncertainty_score":0.1977995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046313222,0.0009917696,0.9453214,0.00034676358,0.00015086091,0.00014338552,0.00017296635,0.0012372487,0.005322475],"genre_scores_gemma":[0.31997085,0.0005478262,0.6718926,0.00021695095,0.00012953018,0.00036355987,0.00052681717,0.00029167338,0.0060602324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993074,0.00016519765,0.000035020887,0.00009663843,0.00023414675,0.00016158044],"domain_scores_gemma":[0.9991966,0.00045287568,0.0000625892,0.00005967305,0.0001368497,0.00009153494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000905865,0.00096975884,0.0022319506,0.0013531226,0.0008030598,0.0016069082,0.0021006793,0.0018437463,0.0057767676],"category_scores_gemma":[0.0013489954,0.0009004145,0.0009558139,0.0028886786,0.00047426598,0.00202481,0.001277236,0.0013670811,0.0007168808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008282197,0.00045843702,0.00060335634,0.00020384115,0.00013790793,0.00012616895,0.00006026636,0.7060557,0.0047240946,0.012147675,0.0065795546,0.26807478],"study_design_scores_gemma":[0.00005403438,0.000052555835,0.00007764643,0.0000041231865,0.000011144746,0.000017939265,0.0000057479238,0.9966635,0.0004602707,0.0021558716,0.00049136055,0.0000057551533],"about_ca_topic_score_codex":0.009674701,"about_ca_topic_score_gemma":0.007873275,"teacher_disagreement_score":0.009674701,"about_ca_system_score_codex":0.0010972354,"about_ca_system_score_gemma":0.0025468087,"threshold_uncertainty_score":0.019325197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011465751,0.00022949933,0.97792065,0.00014405076,0.00007188843,0.000047843016,0.00014746161,0.0006435486,0.009329331],"genre_scores_gemma":[0.27478316,0.00021272516,0.71733403,0.00017508428,0.00005627616,0.00021162258,0.0003732108,0.00042146968,0.0064323596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999421,0.00020932392,0.000021144537,0.000068231704,0.00019899981,0.000081431375],"domain_scores_gemma":[0.9990901,0.00056607806,0.000076228804,0.000110999135,0.000118461816,0.000038127655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088037,0.00100654,0.0012988613,0.0008092383,0.0005016587,0.0012951567,0.0013072615,0.0009762857,0.008431139],"category_scores_gemma":[0.0023246661,0.0007771123,0.0009219662,0.0018272045,0.0005191388,0.0017038283,0.0012899739,0.0010452619,0.0010343095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058746245,0.000055022087,0.00020456094,0.000088085515,0.000022145445,0.00004759327,0.000033235563,0.92034894,0.0013239752,0.017951172,0.003066621,0.056799885],"study_design_scores_gemma":[0.000003978548,0.000009073214,0.00001875213,0.0000034393988,0.000001688284,0.000008724667,0.0000050804847,0.99458426,0.00019550828,0.004708911,0.0004582735,0.0000023760078],"about_ca_topic_score_codex":0.003949226,"about_ca_topic_score_gemma":0.0069322176,"teacher_disagreement_score":0.008431139,"about_ca_system_score_codex":0.0008917422,"about_ca_system_score_gemma":0.0011007447,"threshold_uncertainty_score":0.028204978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077341676,0.00075576006,0.8892789,0.00068824744,0.00019151879,0.0004253685,0.002086809,0.008353089,0.02087859],"genre_scores_gemma":[0.2736352,0.0007061624,0.7048435,0.00030565492,0.00011930114,0.00030876472,0.0047715954,0.0008505765,0.014459166],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985569,0.0001585441,0.0000950178,0.00037924026,0.00039943334,0.0004108382],"domain_scores_gemma":[0.9973922,0.0010329471,0.00014725744,0.0010381582,0.0002069198,0.00018250562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094928226,0.0014942938,0.0022708208,0.001417163,0.0011878941,0.0034688076,0.00453436,0.0016351934,0.013842698],"category_scores_gemma":[0.0036391304,0.00085328065,0.0019352022,0.004151498,0.0010827612,0.0056132935,0.0036782657,0.0030322904,0.0027320955],"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.0013510166,0.0006517444,0.0010684837,0.00076842983,0.00011667741,0.00020327003,0.0004752878,0.22969815,0.018582087,0.110204265,0.037169535,0.59971106],"study_design_scores_gemma":[0.00020196359,0.00015362793,0.0003808568,0.000056377612,0.00008029696,0.0001633238,0.00018462428,0.8663737,0.006502966,0.11583034,0.010030686,0.000041225194],"about_ca_topic_score_codex":0.011540708,"about_ca_topic_score_gemma":0.013659335,"teacher_disagreement_score":0.013842698,"about_ca_system_score_codex":0.0033552453,"about_ca_system_score_gemma":0.0026651982,"threshold_uncertainty_score":0.046308458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031765755,0.024836935,0.02577519,0.011023451,0.0017417922,0.000042424737,0.0006305514,0.00024858498,0.9325246],"genre_scores_gemma":[0.06825545,0.026293514,0.00399522,0.0014133169,0.0017490515,0.00008144459,0.000677642,0.00017971675,0.89735466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999782,0.000044579694,0.0000062336962,0.000033733548,0.000108785374,0.000024621078],"domain_scores_gemma":[0.9997849,0.000071536546,0.00001799107,0.000042833217,0.000059572303,0.000023213312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040740296,0.00068751624,0.0005341445,0.00094913295,0.0005474049,0.0023052513,0.00039263946,0.0015306729,0.05414928],"category_scores_gemma":[0.0015541516,0.0002928109,0.000246888,0.0021297024,0.00077711424,0.0022546698,0.00067023904,0.0018704481,0.013522305],"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.000016352027,0.000041347103,0.00015044904,0.00006741716,0.0000083313535,0.000042740594,0.000057202782,0.0031096211,0.00014982306,0.63686776,0.229463,0.13002598],"study_design_scores_gemma":[0.000006096682,0.000014579906,0.0003500324,0.00012631346,0.0000034389404,0.000052517982,0.000034406676,0.0033540153,0.0001150106,0.49226534,0.50367147,0.000006765172],"about_ca_topic_score_codex":0.002664817,"about_ca_topic_score_gemma":0.0031886552,"teacher_disagreement_score":0.05414928,"about_ca_system_score_codex":0.0020297088,"about_ca_system_score_gemma":0.0013084785,"threshold_uncertainty_score":0.1811474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17991965,0.0036170369,0.71737856,0.0029273587,0.0005166046,0.0001553322,0.0014475136,0.00022451184,0.09381347],"genre_scores_gemma":[0.8763328,0.0047272122,0.09187504,0.0006958323,0.0009343743,0.00029778646,0.0015130851,0.00021732943,0.023406671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988739,0.0002398947,0.000050306433,0.00019668193,0.000408075,0.0002311403],"domain_scores_gemma":[0.9967483,0.0020071168,0.00034890068,0.0002836329,0.00028676837,0.00032533717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010910903,0.0010277457,0.001226785,0.0020390674,0.0011538222,0.005793242,0.002147831,0.0013655307,0.014574721],"category_scores_gemma":[0.0074256235,0.000939827,0.0017864557,0.0032553708,0.00285128,0.0062023937,0.0034191748,0.0054033934,0.001113149],"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.000043554275,0.000030316723,0.0005568194,0.000069344795,0.000018025898,0.000069597016,0.00013875037,0.015850008,0.0006772114,0.9693713,0.0025848441,0.010590267],"study_design_scores_gemma":[0.0000161281,0.000028130164,0.00054600125,0.00004694165,0.000015822297,0.00011211447,0.00012961315,0.10778875,0.0004900168,0.88781005,0.002997699,0.000018754783],"about_ca_topic_score_codex":0.0031083806,"about_ca_topic_score_gemma":0.0016235536,"teacher_disagreement_score":0.014574721,"about_ca_system_score_codex":0.0023863283,"about_ca_system_score_gemma":0.0009875647,"threshold_uncertainty_score":0.048757374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030348776,0.003827004,0.98460627,0.00046488302,0.00027732216,0.000041819425,0.00007180308,0.00021398041,0.0074620117],"genre_scores_gemma":[0.099409856,0.005172866,0.8848808,0.0003189005,0.00070421887,0.00035145544,0.00037186674,0.00041296094,0.008377084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972197,0.001230185,0.00013186429,0.00037963933,0.0008367208,0.00020201603],"domain_scores_gemma":[0.9906222,0.0075567956,0.00031010289,0.00067990564,0.0006323016,0.00019863246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004512551,0.0018496888,0.0021797235,0.0021265743,0.0008763653,0.0043414524,0.0033998664,0.0024384127,0.009194971],"category_scores_gemma":[0.016625842,0.0016679888,0.0013171805,0.006678598,0.002718506,0.0063089426,0.0020640101,0.009308201,0.0021383222],"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.00026718728,0.0002959985,0.00038629383,0.00064750126,0.00008964345,0.00006481515,0.00017090561,0.27201992,0.0014939735,0.49432418,0.012630085,0.21760957],"study_design_scores_gemma":[0.00007902507,0.000067783774,0.00013092469,0.00012252209,0.000025128646,0.000040465464,0.00003460521,0.7236337,0.0006830033,0.26572168,0.009439293,0.000021850725],"about_ca_topic_score_codex":0.0028357627,"about_ca_topic_score_gemma":0.0019424834,"teacher_disagreement_score":0.009194971,"about_ca_system_score_codex":0.0019282794,"about_ca_system_score_gemma":0.0016126857,"threshold_uncertainty_score":0.030760229},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024745234,0.0001319372,0.99138194,0.00019133891,0.0000759203,0.00010496343,0.00008803147,0.0008623182,0.004689007],"genre_scores_gemma":[0.03616528,0.0001694062,0.9605789,0.000108213055,0.000043362295,0.00026217432,0.00026520126,0.00023798845,0.0021694675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903774,0.00018238497,0.000051768522,0.00020615077,0.0003956055,0.00012626644],"domain_scores_gemma":[0.9986619,0.0006541365,0.00010159238,0.0002790152,0.00024357314,0.00005987991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009107144,0.0012667056,0.0012703182,0.0010290801,0.0008943131,0.002223572,0.0021234713,0.0017335552,0.016458424],"category_scores_gemma":[0.0053812056,0.0006277637,0.0009536585,0.0016913562,0.000913387,0.002275994,0.0020607547,0.0028530986,0.0046174484],"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.00016687256,0.00022886563,0.00069799874,0.00037795887,0.00005409353,0.00014013983,0.00016347518,0.4184795,0.0055306787,0.10727114,0.015764851,0.45112443],"study_design_scores_gemma":[0.000057142228,0.000045881323,0.00010140043,0.00003228736,0.000011747606,0.00009763737,0.000030024179,0.93828577,0.0013505503,0.052692056,0.0072801015,0.000015378713],"about_ca_topic_score_codex":0.0029787633,"about_ca_topic_score_gemma":0.003527489,"teacher_disagreement_score":0.016458424,"about_ca_system_score_codex":0.0013575921,"about_ca_system_score_gemma":0.0028958528,"threshold_uncertainty_score":0.055058897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029158357,0.053737946,0.52313375,0.003515052,0.0023439713,0.00005931121,0.0002857165,0.0002871777,0.41372126],"genre_scores_gemma":[0.1273762,0.09626429,0.385296,0.0020969633,0.006656447,0.00039041098,0.0007848381,0.0009498281,0.38018513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945647,0.00015795644,0.00002131792,0.00007364077,0.00026464538,0.000025996995],"domain_scores_gemma":[0.9991529,0.00056711247,0.000031534622,0.00010970992,0.00010279191,0.000035927842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009207022,0.0015281724,0.0011006445,0.0013271765,0.0005688542,0.002850777,0.0015298147,0.0010438453,0.014772048],"category_scores_gemma":[0.0024162554,0.0007030251,0.0008735137,0.004086102,0.0024177467,0.004479296,0.0013116709,0.005111505,0.0034873409],"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.000007960925,0.00002657755,0.000035693538,0.00015385053,0.000013661863,0.000030128289,0.00005086353,0.0082195895,0.00017849033,0.91272527,0.02916055,0.049397357],"study_design_scores_gemma":[0.000004779065,0.000011989135,0.000113312,0.00010742068,0.000009421101,0.000075341464,0.000033776956,0.021258187,0.00015789273,0.86982393,0.10839394,0.000009918566],"about_ca_topic_score_codex":0.0014370744,"about_ca_topic_score_gemma":0.0020500526,"teacher_disagreement_score":0.014772048,"about_ca_system_score_codex":0.0014025818,"about_ca_system_score_gemma":0.00070013106,"threshold_uncertainty_score":0.049417436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057731955,0.00036374055,0.98827577,0.0001341478,0.00011712459,0.00009201135,0.00008686397,0.0005947397,0.0045625023],"genre_scores_gemma":[0.14786962,0.0005539077,0.8438795,0.00028566917,0.00017313215,0.00028091323,0.0004495763,0.00030720458,0.0062004146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951315,0.0001502503,0.000015889953,0.00006012869,0.00018830517,0.00007230845],"domain_scores_gemma":[0.9995431,0.00025199924,0.000030931158,0.000051323805,0.00009316596,0.000029526545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050109235,0.00091666606,0.0010658649,0.0009259317,0.0006492572,0.00089640403,0.0014850243,0.001010985,0.00715765],"category_scores_gemma":[0.0011570851,0.00060722313,0.0009840225,0.001863925,0.00047774156,0.0007057015,0.0009384705,0.0012900273,0.0011113341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010989438,0.00014819516,0.00023109058,0.00012066902,0.000049258833,0.000113125316,0.000041036503,0.7719733,0.0059377193,0.019487748,0.008608646,0.19317925],"study_design_scores_gemma":[0.000012928078,0.00002362012,0.000052665353,0.000006630294,0.000009032511,0.000033859662,0.0000052932296,0.9928249,0.0005528909,0.005152439,0.0013188676,0.0000068348286],"about_ca_topic_score_codex":0.0040172054,"about_ca_topic_score_gemma":0.00612717,"teacher_disagreement_score":0.00715765,"about_ca_system_score_codex":0.00072661834,"about_ca_system_score_gemma":0.0011082323,"threshold_uncertainty_score":0.023944736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5759509,0.0028928965,0.3635444,0.0031629119,0.00049013324,0.0002327014,0.00195591,0.00034179277,0.051428217],"genre_scores_gemma":[0.94839704,0.0007920152,0.027432078,0.00019425795,0.0001607233,0.00008258372,0.00039869524,0.00008566932,0.022456914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993067,0.0002407542,0.000026836527,0.00015666801,0.00008551696,0.00018354572],"domain_scores_gemma":[0.99818534,0.0012199465,0.00017273462,0.00009346173,0.00010946652,0.00021901251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094681984,0.0009925195,0.0018376652,0.00073677005,0.00085656473,0.0029188846,0.0016882552,0.0026436977,0.0077531924],"category_scores_gemma":[0.0032534173,0.00091517373,0.0009127007,0.002399721,0.0011549686,0.0027985256,0.0014008257,0.0011984047,0.00049764046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002996773,0.000080550366,0.00046462278,0.0001430333,0.00006328986,0.00027291293,0.000047151145,0.96952564,0.00092178857,0.014819224,0.0024489842,0.010913233],"study_design_scores_gemma":[0.000051140585,0.000095895826,0.00047071214,0.000014947877,0.000020049587,0.00010252928,0.00010298074,0.97021425,0.00050964096,0.027099146,0.0012973046,0.000021405538],"about_ca_topic_score_codex":0.008497066,"about_ca_topic_score_gemma":0.0066403234,"teacher_disagreement_score":0.008497066,"about_ca_system_score_codex":0.0017493316,"about_ca_system_score_gemma":0.00086379796,"threshold_uncertainty_score":0.02593702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010214494,0.0003140576,0.98212403,0.00024105709,0.000035350688,0.000036995803,0.000057179135,0.00005692706,0.0069199833],"genre_scores_gemma":[0.5377252,0.0011641294,0.45098305,0.00021096936,0.00010870905,0.00033916484,0.0003016136,0.0001405397,0.009026637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994573,0.00022101068,0.00002787541,0.00011401603,0.000107334236,0.000072394316],"domain_scores_gemma":[0.99949646,0.0003215656,0.000049710314,0.000027657932,0.000080119535,0.0000245975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059503,0.0010285366,0.0010229216,0.00065737386,0.0004424816,0.0016458076,0.0007291037,0.0013539451,0.0037995167],"category_scores_gemma":[0.0020801686,0.0003714143,0.0009239599,0.00080058543,0.0007191083,0.0012162908,0.0011250366,0.0012656678,0.00046999147],"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.000052688945,0.0000395055,0.00032915143,0.00024569547,0.00003563362,0.00010738996,0.00011549907,0.85903376,0.0015923847,0.09747892,0.002033468,0.038935967],"study_design_scores_gemma":[0.0000062219347,0.000033372784,0.00006292831,0.000013764581,0.0000055299042,0.000027864015,0.000034038632,0.9767354,0.00031563125,0.02188217,0.00087638607,0.000006690585],"about_ca_topic_score_codex":0.0031786256,"about_ca_topic_score_gemma":0.0020306874,"teacher_disagreement_score":0.0037995167,"about_ca_system_score_codex":0.0008346018,"about_ca_system_score_gemma":0.0013817147,"threshold_uncertainty_score":0.0127106905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018622784,0.00022850437,0.9779423,0.00019293741,0.00003929043,0.000036751182,0.000039926756,0.0009682929,0.0019292987],"genre_scores_gemma":[0.7250971,0.00027957393,0.2698204,0.0003720246,0.000083989275,0.00020361056,0.0002106675,0.00024462247,0.0036880097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996088,0.0000963031,0.000017980374,0.00011256343,0.000100006146,0.00006443086],"domain_scores_gemma":[0.9989575,0.00058654556,0.0001159808,0.00013586077,0.00013756442,0.00006655087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007767077,0.0011447738,0.0010477883,0.0004268338,0.00032413163,0.0009269314,0.0020050395,0.0014584652,0.002909914],"category_scores_gemma":[0.003494029,0.0007068655,0.0005395907,0.00049640465,0.0011701883,0.0018267533,0.0015721455,0.001575239,0.00047832006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007799314,0.00006719147,0.00040052304,0.00005625564,0.000022021666,0.000050898892,0.000042933534,0.9089369,0.0024855076,0.0055763912,0.0012167379,0.081066504],"study_design_scores_gemma":[0.0000045994952,0.000015379348,0.000028535653,0.0000031400223,0.0000018077897,0.0000052313767,0.0000027687379,0.9963857,0.0005107732,0.0028788305,0.00016101233,0.0000022002257],"about_ca_topic_score_codex":0.004975292,"about_ca_topic_score_gemma":0.004158275,"teacher_disagreement_score":0.004975292,"about_ca_system_score_codex":0.0010255367,"about_ca_system_score_gemma":0.0009656515,"threshold_uncertainty_score":0.0098926425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08216524,0.0028895815,0.81086326,0.003786881,0.0008284484,0.00016482428,0.0010700407,0.00024731073,0.09798436],"genre_scores_gemma":[0.69310075,0.005141779,0.19764143,0.00092789443,0.0011190174,0.0003763296,0.0015614015,0.00035134496,0.099780105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990508,0.0002707927,0.000045751953,0.00018461439,0.00029655197,0.00015146466],"domain_scores_gemma":[0.9979949,0.0013768866,0.00017158221,0.00013771604,0.00017205479,0.00014696388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013557889,0.0010180789,0.0015366034,0.0012813122,0.0008836758,0.002856318,0.0016643703,0.002670987,0.011478202],"category_scores_gemma":[0.006435352,0.0008811586,0.00086858246,0.0020815807,0.0012930983,0.0046930304,0.0021469092,0.0025516187,0.0013169021],"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.00029998345,0.00026459448,0.0009254485,0.00042812648,0.00008606891,0.00027028393,0.000083922925,0.43323845,0.0012437004,0.45331267,0.023508567,0.08633817],"study_design_scores_gemma":[0.00003496995,0.00008746345,0.000437612,0.000055453394,0.000023030838,0.00022358677,0.00010265446,0.53791386,0.00082783226,0.44965994,0.010607245,0.000026338113],"about_ca_topic_score_codex":0.0013696321,"about_ca_topic_score_gemma":0.0011834415,"teacher_disagreement_score":0.011478202,"about_ca_system_score_codex":0.000960184,"about_ca_system_score_gemma":0.0009107001,"threshold_uncertainty_score":0.038398445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07960543,0.0006288722,0.91361696,0.00031484943,0.00015824032,0.00011189917,0.000080168196,0.00083399075,0.004649593],"genre_scores_gemma":[0.5365142,0.0004264997,0.45235556,0.00020817795,0.00006708083,0.0002146694,0.00019769333,0.00023996833,0.009776148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.00014168589,0.000030923955,0.00013832799,0.0001603588,0.00009635894],"domain_scores_gemma":[0.998949,0.00050766015,0.00010129396,0.00012661662,0.0002523166,0.00006305737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087424024,0.00092773006,0.0009896298,0.00077969814,0.0007521761,0.0012649182,0.0014373118,0.0011532573,0.00310828],"category_scores_gemma":[0.002820917,0.00041025522,0.0009448981,0.0009272113,0.00061356404,0.0009876926,0.00097444904,0.0011830532,0.00047354522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023056113,0.00016066484,0.0025618367,0.00019053493,0.0001011468,0.00016718086,0.0002209835,0.75969326,0.020417841,0.010631012,0.0021145549,0.2035104],"study_design_scores_gemma":[0.000024042913,0.00016689886,0.000605423,0.000016579748,0.000044497807,0.00010138685,0.000073170864,0.98694766,0.0051507647,0.0039071813,0.0029439053,0.000018495693],"about_ca_topic_score_codex":0.0070286784,"about_ca_topic_score_gemma":0.008088097,"teacher_disagreement_score":0.0070286784,"about_ca_system_score_codex":0.0011314987,"about_ca_system_score_gemma":0.0019207991,"threshold_uncertainty_score":0.013975501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12717049,0.0009898543,0.86028224,0.0002038107,0.000120677636,0.00024498417,0.00022890525,0.0006498572,0.010109193],"genre_scores_gemma":[0.6108237,0.0003792265,0.38346583,0.00013561927,0.0000531786,0.00035994337,0.0004567666,0.00013283161,0.00419296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996131,0.00013350556,0.00002036158,0.000056971057,0.00009307807,0.00008299776],"domain_scores_gemma":[0.99926716,0.00049483625,0.000060624905,0.000057962945,0.00006637193,0.000053095067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007697406,0.0008374669,0.000999019,0.0010361169,0.00039901794,0.0009775176,0.0013774997,0.0012047768,0.003159282],"category_scores_gemma":[0.0011412362,0.0004888149,0.0008612079,0.0010052746,0.0005440797,0.0007639443,0.0006543863,0.00068968715,0.00029797238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011109006,0.0001146441,0.00041969778,0.000122164,0.000041341165,0.000085565036,0.0000447741,0.96255225,0.0014055038,0.004991293,0.00076950836,0.029342264],"study_design_scores_gemma":[0.000034710665,0.00010277704,0.00016798168,0.000012297992,0.000018581743,0.00003929923,0.00002546408,0.99599177,0.00071744533,0.002076194,0.0008047001,0.0000088117895],"about_ca_topic_score_codex":0.0038553304,"about_ca_topic_score_gemma":0.0043389057,"teacher_disagreement_score":0.0038553304,"about_ca_system_score_codex":0.00077794923,"about_ca_system_score_gemma":0.0012866302,"threshold_uncertainty_score":0.010568857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116677836,0.00034988037,0.87298775,0.00020663349,0.00006982575,0.00014331454,0.0000568749,0.0004680225,0.009039873],"genre_scores_gemma":[0.77845204,0.000120660545,0.21680492,0.00008403637,0.000027091399,0.00023154731,0.000094174895,0.000099626486,0.004085843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973744,0.00009910135,0.000010009368,0.00003587591,0.000072710856,0.000044909644],"domain_scores_gemma":[0.9991272,0.00056215475,0.00009264857,0.00003603233,0.00013478976,0.000047156725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010048595,0.0009477517,0.0009447027,0.0007917265,0.00048465407,0.00083210046,0.000697796,0.0010951577,0.00231911],"category_scores_gemma":[0.0016431998,0.0005658932,0.00062031526,0.000544599,0.0006746195,0.00048386175,0.00081309496,0.0007956329,0.00029422238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002035466,0.000017350145,0.00015566764,0.000013985231,0.0000054134266,0.00001460796,0.000008469142,0.9937063,0.0005413804,0.00070811243,0.000100740624,0.004707669],"study_design_scores_gemma":[0.0000035101518,0.000016365457,0.000032741882,0.0000024321205,0.0000012299555,0.0000025562456,0.0000025565796,0.9994579,0.00014402819,0.0002474998,0.00008811658,0.0000011089638],"about_ca_topic_score_codex":0.0035750768,"about_ca_topic_score_gemma":0.0025059043,"teacher_disagreement_score":0.0035750768,"about_ca_system_score_codex":0.0007063366,"about_ca_system_score_gemma":0.0009930601,"threshold_uncertainty_score":0.0077581406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034250014,0.0127181355,0.87181705,0.00043719533,0.0012406708,0.00010501717,0.00016550932,0.0013339561,0.077932455],"genre_scores_gemma":[0.5214509,0.0132356305,0.41359508,0.0003413178,0.001080173,0.00026101372,0.0004912951,0.00062159094,0.048923016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997546,0.000051446656,0.000017150724,0.00005936378,0.00008530704,0.000032048312],"domain_scores_gemma":[0.9997507,0.00011815899,0.000026250027,0.0000551853,0.000027834016,0.000021858319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017643717,0.00093498436,0.0010116835,0.00084477116,0.0006259367,0.001283803,0.00089781097,0.0008003882,0.0070990496],"category_scores_gemma":[0.0007955142,0.00054293324,0.00085168815,0.0032228916,0.00059883116,0.001120403,0.0011550686,0.0013740073,0.0013556469],"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.00023378024,0.0001430452,0.000322966,0.0006328775,0.000055795612,0.00061537523,0.00025665882,0.35124794,0.040315866,0.15839094,0.010565225,0.4372196],"study_design_scores_gemma":[0.000031377385,0.00025176266,0.00093786727,0.00012988497,0.000047818157,0.0010834029,0.00014394474,0.5794105,0.012983264,0.35263216,0.05228934,0.000058617934],"about_ca_topic_score_codex":0.00040779836,"about_ca_topic_score_gemma":0.0005338712,"teacher_disagreement_score":0.0070990496,"about_ca_system_score_codex":0.00047378388,"about_ca_system_score_gemma":0.00016645475,"threshold_uncertainty_score":0.023748755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45617816,0.001719679,0.44236442,0.0034727706,0.00044485257,0.00014521081,0.0013871919,0.00039669836,0.09389114],"genre_scores_gemma":[0.83611965,0.0025288253,0.107563324,0.00041845784,0.00043329864,0.0001686965,0.0017258102,0.00043514554,0.050606832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995938,0.00010018917,0.000020149286,0.000112198846,0.00007218035,0.000101499696],"domain_scores_gemma":[0.9986143,0.00076383015,0.00018368619,0.00018257163,0.000098428034,0.00015711739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801011,0.0011145109,0.0011752829,0.0009955163,0.0010408974,0.002394765,0.0013696332,0.0018724308,0.010565214],"category_scores_gemma":[0.0036506618,0.0006462141,0.0007344028,0.0022540854,0.0011996633,0.0038129399,0.0013894096,0.0020959496,0.00077931595],"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.0004055155,0.00024416455,0.001334817,0.00041815615,0.000067561356,0.00042325817,0.00028146675,0.25204378,0.0065832334,0.6121044,0.028033804,0.09805981],"study_design_scores_gemma":[0.00005551305,0.000075819764,0.000771347,0.00004460403,0.000028957791,0.00027771192,0.00027976476,0.34137663,0.0032809915,0.6438037,0.009976286,0.00002850955],"about_ca_topic_score_codex":0.0029402701,"about_ca_topic_score_gemma":0.001994928,"teacher_disagreement_score":0.010565214,"about_ca_system_score_codex":0.0010861031,"about_ca_system_score_gemma":0.00062718324,"threshold_uncertainty_score":0.035344183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0447464,0.00011691934,0.9485673,0.000069316295,0.000025238145,0.00006047426,0.000021902872,0.00028038054,0.006112177],"genre_scores_gemma":[0.5958713,0.00014966891,0.40002874,0.000048255948,0.000025455569,0.0001652307,0.00009148257,0.00014401565,0.003475862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997687,0.00007446289,0.000010966228,0.000032844182,0.00007766137,0.00003534507],"domain_scores_gemma":[0.9995123,0.00027381425,0.000050012626,0.000041121337,0.00010371637,0.000019005458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061983924,0.00076908077,0.00061002636,0.00061832694,0.000451959,0.000742059,0.00056751014,0.0008224789,0.0023678108],"category_scores_gemma":[0.0010898614,0.00042855574,0.00051407435,0.0005457989,0.0005831295,0.0004125009,0.00064662745,0.00056686625,0.0003014866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013295284,0.000016013988,0.00017000687,0.000022529048,0.0000050726217,0.000025246743,0.000017800014,0.98614615,0.0012250374,0.0025290218,0.00013406992,0.009695721],"study_design_scores_gemma":[0.0000020306334,0.000014435006,0.000034156077,0.0000016634448,0.0000011378064,0.0000046036494,0.0000029674593,0.9991247,0.0002863857,0.00032265764,0.00020414723,0.0000011267309],"about_ca_topic_score_codex":0.0031552734,"about_ca_topic_score_gemma":0.0022950089,"teacher_disagreement_score":0.0031552734,"about_ca_system_score_codex":0.00060350425,"about_ca_system_score_gemma":0.0007402964,"threshold_uncertainty_score":0.007921159},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03129766,0.0019060124,0.9435245,0.0011108594,0.00018271814,0.00018289055,0.0006227165,0.00030752094,0.020865299],"genre_scores_gemma":[0.49630696,0.0048517026,0.48308665,0.00092434726,0.0006060549,0.0005600742,0.0018447469,0.00037856278,0.011440948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970504,0.0010216681,0.00014765466,0.0005668884,0.0007662024,0.00044720288],"domain_scores_gemma":[0.9933924,0.004174684,0.00075626327,0.0008035147,0.0005853044,0.00028772373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028237,0.0016794221,0.0016446523,0.0015628954,0.0011021433,0.0031883277,0.002365333,0.001893061,0.0073541],"category_scores_gemma":[0.0129353255,0.0010281383,0.0013061134,0.0056744474,0.0015916828,0.0069697993,0.00266422,0.004407792,0.0009726297],"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.00013854561,0.00028613347,0.00095778384,0.0005781378,0.00006803847,0.00020969017,0.00016566057,0.6655675,0.0014345009,0.24940088,0.008642988,0.07255011],"study_design_scores_gemma":[0.000020541685,0.000056889687,0.0003490407,0.00006499441,0.000015427415,0.00018508741,0.00013814382,0.8089582,0.00071948057,0.18373676,0.0057269945,0.000028405222],"about_ca_topic_score_codex":0.005585707,"about_ca_topic_score_gemma":0.0042928667,"teacher_disagreement_score":0.0073541,"about_ca_system_score_codex":0.0014895344,"about_ca_system_score_gemma":0.0016729063,"threshold_uncertainty_score":0.024601936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34088275,0.0026441277,0.3955076,0.0037788684,0.0008759681,0.00023985005,0.0016770047,0.0007768274,0.25361693],"genre_scores_gemma":[0.6974824,0.0053951796,0.15536961,0.00061419874,0.0007008692,0.00021524755,0.0030396632,0.0007063601,0.13647658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997404,0.0000423039,0.000012970924,0.00007231296,0.000059901722,0.00007198304],"domain_scores_gemma":[0.99934095,0.00028679238,0.00007848989,0.00013901172,0.00006594023,0.00008876106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041830074,0.00093339913,0.0010186736,0.0007430115,0.0010692267,0.0019925276,0.0013888658,0.0014484995,0.011854829],"category_scores_gemma":[0.001726403,0.00050303823,0.0007494118,0.0023404565,0.0009398852,0.00330781,0.0012700326,0.0022128904,0.0012334138],"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.00035193906,0.0002110808,0.0006554846,0.00052158313,0.00005187513,0.0005137789,0.000305751,0.09397505,0.009869062,0.6446731,0.0525578,0.19631343],"study_design_scores_gemma":[0.00006455451,0.00009450697,0.00063617394,0.000066328525,0.000035347424,0.0005155019,0.00032005124,0.13305661,0.0044442536,0.8232205,0.037518196,0.000027946333],"about_ca_topic_score_codex":0.001979713,"about_ca_topic_score_gemma":0.0017669677,"teacher_disagreement_score":0.011854829,"about_ca_system_score_codex":0.0008411826,"about_ca_system_score_gemma":0.0005511627,"threshold_uncertainty_score":0.039658368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011341361,0.00008740629,0.00007322666,0.000074095566,0.00002857412,0.000010203828,0.9976404,0.00096665556,0.0010060384],"genre_scores_gemma":[0.00048008372,0.00009584649,0.00035596488,0.00007152357,0.000013266881,0.00008276624,0.99790996,0.0002498402,0.0007407969],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986191,0.00019455976,0.00014083079,0.00037846208,0.00036213727,0.00030495494],"domain_scores_gemma":[0.9970505,0.0010515561,0.00021601781,0.00078462006,0.0006141082,0.00028314127],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012857517,0.004768565,0.0026460271,0.0047586267,0.0013012114,0.004536349,0.0057948707,0.0044636205,0.28195515],"category_scores_gemma":[0.009478315,0.0014283552,0.0021701036,0.008578535,0.000995414,0.0029229228,0.0031500387,0.0025831268,0.32177314],"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.000038204846,0.000025982032,0.00025112706,0.00069605233,0.000018822282,0.000011439352,0.000013979851,0.000338195,0.000059287322,0.000371868,0.99676585,0.0014091567],"study_design_scores_gemma":[0.00059377647,0.000043284115,0.0018918342,0.00041097542,0.000028822853,0.00007799653,0.00008962265,0.001075298,0.0006604778,0.0029746173,0.99210817,0.000045062992],"about_ca_topic_score_codex":0.017932244,"about_ca_topic_score_gemma":0.025572231,"teacher_disagreement_score":0.7180449,"about_ca_system_score_codex":0.0022884824,"about_ca_system_score_gemma":0.002629617,"threshold_uncertainty_score":0.94323397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010622044,0.000087136395,0.000070869835,0.000076760356,0.000028752926,0.00000982142,0.9977252,0.0009044283,0.000990731],"genre_scores_gemma":[0.0004671134,0.000098081684,0.00035679265,0.00007352939,0.000013490701,0.00008238514,0.9979353,0.00023951117,0.0007338868],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985815,0.00019938598,0.00014509389,0.00038539554,0.00037765395,0.0003109757],"domain_scores_gemma":[0.9969252,0.001099995,0.00022766106,0.0008002538,0.0006528582,0.00029405754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001281258,0.004779909,0.0026100767,0.0048557674,0.0013087484,0.0046008267,0.0057593565,0.004504863,0.2763313],"category_scores_gemma":[0.009891411,0.0014211979,0.0022080757,0.008690348,0.0009690892,0.0029249708,0.0032324875,0.0026073623,0.31437817],"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.000036541693,0.000024466228,0.0002551081,0.0007039093,0.000018894876,0.000011167462,0.000013877362,0.00033665408,0.00005456496,0.00037853816,0.99678147,0.0013846675],"study_design_scores_gemma":[0.00055453094,0.000039864888,0.0018329264,0.00041221105,0.000028448178,0.00007390213,0.00008728568,0.0010219957,0.0005916654,0.0029499964,0.9923636,0.000043649896],"about_ca_topic_score_codex":0.01899915,"about_ca_topic_score_gemma":0.027565945,"teacher_disagreement_score":0.7236687,"about_ca_system_score_codex":0.002353656,"about_ca_system_score_gemma":0.0027723205,"threshold_uncertainty_score":0.9244203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010454214,0.00008585922,0.00007053425,0.0000775956,0.000028233768,0.000009722329,0.99771476,0.0009217365,0.0009869827],"genre_scores_gemma":[0.00047315593,0.00009890246,0.0003561533,0.00007483035,0.000013915827,0.00008163474,0.99790514,0.0002491302,0.00074711797],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860305,0.00019374509,0.00014318875,0.00038193792,0.00037129782,0.00030678746],"domain_scores_gemma":[0.9969248,0.0011065427,0.00022785929,0.0007895083,0.0006526501,0.0002986161],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012901672,0.0047671413,0.0026254498,0.0048495913,0.0012766892,0.004661214,0.0057581905,0.0044661383,0.28752193],"category_scores_gemma":[0.009920698,0.0014275148,0.002162576,0.008742701,0.0009821319,0.0030048916,0.0032435253,0.0025678594,0.32130045],"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.000036261266,0.000024191819,0.000251807,0.0006998216,0.000018566368,0.000011072559,0.0000139154245,0.00033155235,0.000053568754,0.0003807755,0.9967919,0.0013866073],"study_design_scores_gemma":[0.0005729728,0.00004109869,0.0018460404,0.0004109099,0.000027805476,0.00007486659,0.00008796397,0.0010530154,0.0005932036,0.003029633,0.99221873,0.00004375596],"about_ca_topic_score_codex":0.018731529,"about_ca_topic_score_gemma":0.026548628,"teacher_disagreement_score":0.71247804,"about_ca_system_score_codex":0.0023737857,"about_ca_system_score_gemma":0.0027326231,"threshold_uncertainty_score":0.96185666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010483427,0.00008529381,0.000070835646,0.000074256575,0.000027418318,0.000009599315,0.99774903,0.0008984421,0.0009802135],"genre_scores_gemma":[0.00047804386,0.00009904888,0.00035643502,0.000072487615,0.000013581432,0.000082676386,0.99790144,0.0002464467,0.0007497962],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862814,0.00019162752,0.00014068857,0.00037517986,0.00036188267,0.00030247748],"domain_scores_gemma":[0.99699306,0.0010856063,0.00022429302,0.00077633996,0.00063448463,0.0002863127],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012639854,0.0047303373,0.0025988235,0.0047761584,0.0012746595,0.004532578,0.005652096,0.004406229,0.2851761],"category_scores_gemma":[0.009619373,0.0014339391,0.002169349,0.008707749,0.0009644892,0.0029164487,0.0031706882,0.0025648372,0.32272005],"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.00003740652,0.000024358256,0.00025800118,0.0007141799,0.000018841189,0.000011190792,0.0000139529175,0.00034085396,0.000055869878,0.00037415224,0.9967524,0.0013988545],"study_design_scores_gemma":[0.00057463854,0.00004140988,0.0019133979,0.00041452475,0.000028416007,0.0000761284,0.00008902307,0.0010417965,0.00061142433,0.0029779351,0.99218714,0.000044153792],"about_ca_topic_score_codex":0.01815362,"about_ca_topic_score_gemma":0.026230682,"teacher_disagreement_score":0.7148239,"about_ca_system_score_codex":0.0023018683,"about_ca_system_score_gemma":0.0026813147,"threshold_uncertainty_score":0.9540091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121945945,0.00009077727,0.00007708356,0.00007812389,0.000031693973,0.000010981478,0.99748045,0.0010455921,0.0010633693],"genre_scores_gemma":[0.0004900123,0.00009526284,0.00036967013,0.00007300295,0.000013704046,0.00008405978,0.9978617,0.0002517215,0.00076090987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858665,0.0001988005,0.0001423792,0.0003890588,0.00037084828,0.00031228707],"domain_scores_gemma":[0.9970595,0.0010202277,0.00021196685,0.0008044054,0.00061942096,0.00028455793],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012898663,0.0048732087,0.0026325716,0.0047790445,0.0013271777,0.0045728353,0.005891426,0.0045558023,0.26859486],"category_scores_gemma":[0.009580316,0.0014147696,0.002207036,0.008499215,0.000995921,0.0029077302,0.0031715413,0.0026220817,0.31421843],"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.00003741657,0.000026028249,0.00024582783,0.0006510768,0.000018277216,0.00001119666,0.000013196916,0.000334769,0.00005789706,0.0003561189,0.99684995,0.0013981857],"study_design_scores_gemma":[0.00058760546,0.000044098517,0.0018561885,0.0003998355,0.000029084753,0.00007805494,0.00009062661,0.0011310207,0.0006805097,0.003021512,0.99203616,0.000045355955],"about_ca_topic_score_codex":0.01821072,"about_ca_topic_score_gemma":0.026495617,"teacher_disagreement_score":0.73140514,"about_ca_system_score_codex":0.002293949,"about_ca_system_score_gemma":0.0026767447,"threshold_uncertainty_score":0.8985393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43817118,0.0032806494,0.48527583,0.0058280593,0.0010316178,0.0016392543,0.0401585,0.0023458079,0.02226907],"genre_scores_gemma":[0.67418176,0.00044843863,0.29439205,0.0005241359,0.00016304861,0.0019562016,0.022302952,0.0002931834,0.0057381834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960521,0.0023951342,0.00017053909,0.0006374516,0.00046484516,0.0002799732],"domain_scores_gemma":[0.9639245,0.03152799,0.0011328894,0.0016045838,0.0013602558,0.000449792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004344079,0.0011412612,0.0009783836,0.0013754908,0.0008228767,0.0014206932,0.0026873809,0.0023850503,0.010660666],"category_scores_gemma":[0.024759188,0.0004908288,0.0015876445,0.0016205944,0.0015749587,0.0013394846,0.001245342,0.0038074611,0.00069364475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027970606,0.00027325115,0.0021980766,0.00034783964,0.0000684406,0.00014559364,0.00007365053,0.9533689,0.00018932355,0.020656366,0.011800039,0.010598842],"study_design_scores_gemma":[0.0001550164,0.000080535654,0.0006357721,0.00003750195,0.000012382574,0.000056623452,0.000085201595,0.9702439,0.0003800988,0.023886906,0.0044088783,0.00001726073],"about_ca_topic_score_codex":0.010672128,"about_ca_topic_score_gemma":0.014648656,"teacher_disagreement_score":0.010672128,"about_ca_system_score_codex":0.0021564222,"about_ca_system_score_gemma":0.002157236,"threshold_uncertainty_score":0.035663545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010432789,0.000076559816,0.00007201923,0.00007574281,0.000027645248,0.000010383154,0.99764615,0.001019335,0.0009677575],"genre_scores_gemma":[0.00048714463,0.00009008671,0.00037013614,0.000069852955,0.000013827159,0.00008770451,0.99791306,0.0002673114,0.0007009138],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984432,0.0002100299,0.00016381142,0.00042315037,0.00042244236,0.00033742955],"domain_scores_gemma":[0.99647164,0.0012191745,0.00026185537,0.0009811226,0.00072846253,0.00033781686],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013026027,0.0049803173,0.0026725496,0.004973092,0.0013971332,0.0048370613,0.005899133,0.004716594,0.2914397],"category_scores_gemma":[0.011183599,0.0015153179,0.0022370801,0.009457913,0.0010225786,0.0032022991,0.0033938515,0.0028782221,0.34722307],"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.0000395488,0.000025376585,0.00024124878,0.0006816383,0.000016868842,0.000010991357,0.000013432902,0.00031831508,0.00005845346,0.00034035972,0.99682224,0.0014315636],"study_design_scores_gemma":[0.000630978,0.000049638995,0.0019508711,0.00041046127,0.00002929209,0.00008628494,0.00009343392,0.001152549,0.00073213124,0.003073492,0.99174434,0.00004657125],"about_ca_topic_score_codex":0.017068885,"about_ca_topic_score_gemma":0.022712696,"teacher_disagreement_score":0.7085603,"about_ca_system_score_codex":0.002305303,"about_ca_system_score_gemma":0.0028788666,"threshold_uncertainty_score":0.97496295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011260609,0.00008769093,0.00007272095,0.00008065657,0.000031071366,0.000010653744,0.99763584,0.0009803898,0.0009883746],"genre_scores_gemma":[0.00047186864,0.000094308176,0.0003695619,0.00007652335,0.000014378064,0.00008579825,0.9979025,0.000247262,0.00073774107],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985668,0.00019991274,0.00014440676,0.00039007608,0.00037751155,0.00032131365],"domain_scores_gemma":[0.99688727,0.0010857055,0.00022953244,0.0008253953,0.00066218694,0.0003099999],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013006873,0.0048821545,0.0026612976,0.004925209,0.0013169936,0.0046816734,0.0059465067,0.0046142503,0.27458173],"category_scores_gemma":[0.010066187,0.0014242003,0.0022699102,0.008619609,0.0009973362,0.0029539354,0.0033236407,0.0026376434,0.31044757],"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.00003667373,0.000025172816,0.00025296715,0.0006808757,0.000018614894,0.00001135472,0.000013869661,0.0003302512,0.000054947886,0.00036277503,0.9968451,0.0013673196],"study_design_scores_gemma":[0.0005750817,0.000042489013,0.0018007089,0.000401808,0.000028725111,0.000076820426,0.00008833658,0.0010625116,0.0006018907,0.003032481,0.99224454,0.0000445442],"about_ca_topic_score_codex":0.018567525,"about_ca_topic_score_gemma":0.027273208,"teacher_disagreement_score":0.72541827,"about_ca_system_score_codex":0.0023258696,"about_ca_system_score_gemma":0.0027697235,"threshold_uncertainty_score":0.9185674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011399818,0.00008841053,0.000075264674,0.00007546714,0.000030168107,0.000010702047,0.99757546,0.0010100022,0.0010205745],"genre_scores_gemma":[0.00047621128,0.00009527869,0.00036540898,0.00007198305,0.000013479682,0.00008511235,0.99788874,0.00025282998,0.00075086503],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985971,0.00019878116,0.00014271484,0.00038541018,0.00036606664,0.00030996324],"domain_scores_gemma":[0.9970577,0.0010295776,0.00021347254,0.00080006826,0.00061457604,0.0002845976],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012996806,0.0048534567,0.0026602624,0.0047914074,0.001323359,0.0045723533,0.0059542404,0.0045091314,0.27852693],"category_scores_gemma":[0.009583556,0.0014302506,0.0022115696,0.00853237,0.0010066197,0.0029519883,0.0031814945,0.0026188765,0.32102647],"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.000037268317,0.000025646646,0.00023954794,0.0006731393,0.000018426506,0.000011073013,0.0000133605145,0.00033223542,0.000057119167,0.00035715266,0.9968395,0.0013955841],"study_design_scores_gemma":[0.00059385365,0.000043614662,0.00183347,0.00040679963,0.000029104407,0.00007744783,0.00008965858,0.0011064132,0.0006726532,0.0030102802,0.9920914,0.000045321638],"about_ca_topic_score_codex":0.01806209,"about_ca_topic_score_gemma":0.025954587,"teacher_disagreement_score":0.7214731,"about_ca_system_score_codex":0.0023054346,"about_ca_system_score_gemma":0.0026535366,"threshold_uncertainty_score":0.93176544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011526067,0.000090950816,0.000075587195,0.00007793939,0.000029892622,0.000010598022,0.9976162,0.0009712987,0.0010122719],"genre_scores_gemma":[0.00048278552,0.00009549727,0.0003732145,0.00007318685,0.000013428766,0.000083040315,0.99790764,0.00024001097,0.0007312456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998587,0.0002004324,0.00014370163,0.00038154877,0.00037555586,0.00031178189],"domain_scores_gemma":[0.9969817,0.0010596211,0.000222607,0.00080366246,0.00064279145,0.00028969202],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012696396,0.0048385374,0.0025914807,0.0048136963,0.0013149519,0.0044891904,0.0057394146,0.0045475834,0.2659449],"category_scores_gemma":[0.00964639,0.0014246838,0.0022349143,0.0085049635,0.0009794967,0.0028765341,0.0031432526,0.00260297,0.3062322],"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.000038203263,0.000025807205,0.00025772463,0.00069472136,0.000019097854,0.000011487942,0.000013574731,0.00035382385,0.000057644567,0.00037036368,0.9967559,0.001401722],"study_design_scores_gemma":[0.0005789643,0.00004302579,0.0018780862,0.0004036377,0.000029911267,0.00007848977,0.00008850658,0.0011079315,0.00064909074,0.003025172,0.9920724,0.000044867927],"about_ca_topic_score_codex":0.018734468,"about_ca_topic_score_gemma":0.027741432,"teacher_disagreement_score":0.7340551,"about_ca_system_score_codex":0.002298043,"about_ca_system_score_gemma":0.00271021,"threshold_uncertainty_score":0.8896743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000108721586,0.00008455448,0.00007257332,0.0000779387,0.00002963692,0.000010069875,0.9976427,0.0009625784,0.0010112461],"genre_scores_gemma":[0.0004645346,0.00009239945,0.00035763768,0.00007374684,0.0000136653625,0.0000814973,0.99791294,0.00024750025,0.0007560774],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985903,0.00019727727,0.0001425354,0.00038879816,0.00037186535,0.00030920914],"domain_scores_gemma":[0.997003,0.0010365617,0.00022052284,0.00079837505,0.00064482336,0.00029674702],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012894185,0.0047894497,0.0026120935,0.0047347033,0.0012784359,0.0046220142,0.005777027,0.0044610337,0.28026062],"category_scores_gemma":[0.009697205,0.0014136671,0.002167199,0.008530346,0.00097609044,0.0029438778,0.0032574637,0.0025733255,0.32339555],"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.000036076322,0.000024296281,0.00024655618,0.0006564318,0.000018060306,0.000010857362,0.0000135449245,0.00031741246,0.00005494779,0.00036493936,0.99688333,0.0013734597],"study_design_scores_gemma":[0.00055817247,0.000041154053,0.0018140659,0.00039084605,0.00002707487,0.00007443996,0.00008769045,0.0010441743,0.0006066033,0.002927214,0.99238575,0.00004286051],"about_ca_topic_score_codex":0.018153073,"about_ca_topic_score_gemma":0.026051568,"teacher_disagreement_score":0.7197394,"about_ca_system_score_codex":0.0023112008,"about_ca_system_score_gemma":0.00266743,"threshold_uncertainty_score":0.9375652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010608329,0.000083678395,0.00007121199,0.0000771072,0.000029666384,0.0000101129035,0.99768925,0.00095166615,0.0009811658],"genre_scores_gemma":[0.00047124314,0.00009278345,0.00035276104,0.00007473334,0.0000142025965,0.00008514962,0.9978802,0.00025106783,0.00077785266],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986265,0.00019382742,0.00014005553,0.00038367824,0.00035211802,0.00030395],"domain_scores_gemma":[0.9970393,0.0010308269,0.00021894682,0.0007954921,0.0006242594,0.00029127902],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012829932,0.0048106587,0.0026844302,0.0046483143,0.0013021561,0.004628815,0.0058974084,0.0045919255,0.28827012],"category_scores_gemma":[0.00970689,0.0014286614,0.0022085705,0.008403384,0.00097443885,0.0029651823,0.0032269733,0.0025867869,0.33207688],"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.000037802656,0.000024668243,0.00024168576,0.0006733849,0.000018371084,0.000010828061,0.00001330672,0.00031136288,0.000054094424,0.00034488336,0.99690264,0.0013668562],"study_design_scores_gemma":[0.0006016694,0.00004272116,0.0018195219,0.0004059747,0.000028789605,0.000074597185,0.00008838568,0.0010264349,0.00062576076,0.0030221546,0.99221957,0.00004441078],"about_ca_topic_score_codex":0.017626371,"about_ca_topic_score_gemma":0.02538462,"teacher_disagreement_score":0.7117299,"about_ca_system_score_codex":0.0022500213,"about_ca_system_score_gemma":0.0026550728,"threshold_uncertainty_score":0.9643596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011795484,0.00008760712,0.00007448952,0.00007523358,0.00003015415,0.000010593625,0.9975714,0.0009993839,0.0010332916],"genre_scores_gemma":[0.00047684225,0.000092500755,0.00035960507,0.00007115279,0.000013110417,0.000081221006,0.9979234,0.0002411721,0.000740981],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986125,0.00019597037,0.00014096207,0.00037860617,0.0003640131,0.00030785747],"domain_scores_gemma":[0.997097,0.000999332,0.00021000054,0.0007991527,0.00061149785,0.0002829852],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001263776,0.0047391276,0.0025967997,0.0047018942,0.0013092839,0.0045009665,0.005824641,0.0044836127,0.26764926],"category_scores_gemma":[0.009394632,0.0013978527,0.0021732252,0.008354542,0.00097343157,0.002851421,0.0031459315,0.0025639592,0.31355324],"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.00003803606,0.000025688109,0.0002506075,0.0006558603,0.000018379345,0.000011322365,0.000013330196,0.00033106413,0.000059027425,0.00036071872,0.9968279,0.0014080768],"study_design_scores_gemma":[0.00057191047,0.00004285238,0.0018612779,0.00039643975,0.000028568335,0.00007697445,0.000088726934,0.001078581,0.0006663948,0.0029284065,0.9922156,0.000044268858],"about_ca_topic_score_codex":0.018198155,"about_ca_topic_score_gemma":0.026391858,"teacher_disagreement_score":0.7323507,"about_ca_system_score_codex":0.0022362107,"about_ca_system_score_gemma":0.0026142285,"threshold_uncertainty_score":0.89537597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104494204,0.000085202926,0.00006737311,0.00007480994,0.00002879846,0.0000099445115,0.99774724,0.00084834825,0.001033892],"genre_scores_gemma":[0.0004688317,0.00009661676,0.00033684057,0.0000729616,0.000013573198,0.00008006894,0.9979121,0.00023781495,0.0007810703],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861705,0.00019504533,0.00014152576,0.00037934518,0.00036178477,0.0003052735],"domain_scores_gemma":[0.99695754,0.0010796876,0.00022299067,0.000797478,0.00065065856,0.00029171965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012511295,0.0047008996,0.0026167461,0.004774148,0.0013173806,0.0046536718,0.005682134,0.004438234,0.29651293],"category_scores_gemma":[0.009642655,0.0014072118,0.0021516248,0.008674464,0.0009868268,0.0029493775,0.0032008518,0.0025720752,0.3321058],"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.000036083915,0.00002476395,0.0002534943,0.00068227825,0.000018233237,0.000010807957,0.000013508117,0.00031469364,0.000054751148,0.0003645149,0.9968688,0.0013580115],"study_design_scores_gemma":[0.0005716441,0.00004148053,0.0019245762,0.0004188898,0.000028312068,0.00007469231,0.00009069302,0.000986286,0.00060166675,0.0028670784,0.99235135,0.00004318553],"about_ca_topic_score_codex":0.01850904,"about_ca_topic_score_gemma":0.026342351,"teacher_disagreement_score":0.70348704,"about_ca_system_score_codex":0.002296491,"about_ca_system_score_gemma":0.0026323274,"threshold_uncertainty_score":0.9919346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000117638825,0.000091505695,0.00007454559,0.000079908044,0.000030733405,0.0000105827085,0.99764365,0.0009653828,0.0009859393],"genre_scores_gemma":[0.00048912456,0.00009688842,0.00036848278,0.00007323697,0.000013930027,0.00008400201,0.9978922,0.00023813338,0.0007439348],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985903,0.00019721784,0.00014360415,0.00038811227,0.00037322077,0.0003075856],"domain_scores_gemma":[0.9970118,0.0010527349,0.00021940019,0.00080297235,0.0006298048,0.00028329715],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001290914,0.0048069824,0.0026238607,0.0048558824,0.0013032772,0.0045787888,0.005901953,0.0046412577,0.26659876],"category_scores_gemma":[0.009790226,0.0014378375,0.0022272416,0.008620774,0.0009949943,0.0028990214,0.0031279204,0.0026139426,0.30733204],"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.00003710984,0.000025841058,0.0002597697,0.00068481854,0.00001934939,0.000011726007,0.000013601992,0.00035618193,0.00005571431,0.0003641245,0.99674124,0.0014306252],"study_design_scores_gemma":[0.00058685004,0.000043194897,0.0018931398,0.0004069023,0.000029375624,0.00008040854,0.000090419635,0.001135611,0.00064124365,0.0029814315,0.99206597,0.000045401805],"about_ca_topic_score_codex":0.018508486,"about_ca_topic_score_gemma":0.026461963,"teacher_disagreement_score":0.73340124,"about_ca_system_score_codex":0.0023177732,"about_ca_system_score_gemma":0.0026823706,"threshold_uncertainty_score":0.8918617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009773348,0.000071173854,0.00006737333,0.00007199628,0.000025963907,0.000009533023,0.99780375,0.0009106509,0.00094184803],"genre_scores_gemma":[0.00048166572,0.00008944025,0.0003476643,0.00006855169,0.000013622651,0.000086143875,0.9979305,0.00025952636,0.0007229059],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847823,0.00020366038,0.00016122758,0.0004185468,0.0004097732,0.00032850832],"domain_scores_gemma":[0.996469,0.0012511757,0.00026453205,0.000954024,0.00072933227,0.0003319156],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012881721,0.0048010964,0.0026161077,0.004928386,0.0013736979,0.0047931876,0.0057321405,0.0045290273,0.3045927],"category_scores_gemma":[0.011159199,0.0014920286,0.0021535533,0.009510785,0.0010028726,0.0032015643,0.0033580225,0.002801271,0.3546769],"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.000038690232,0.000024348015,0.00024669222,0.00068509765,0.00001667945,0.000010825552,0.00001353629,0.00031080988,0.00005755439,0.00034637455,0.99682945,0.0014199086],"study_design_scores_gemma":[0.00061732484,0.00004753375,0.0020224573,0.00041192392,0.000028149982,0.00008337327,0.0000940229,0.0010668339,0.0006939204,0.0029750061,0.9919139,0.000045578166],"about_ca_topic_score_codex":0.017204897,"about_ca_topic_score_gemma":0.022260817,"teacher_disagreement_score":0.6954073,"about_ca_system_score_codex":0.0023316548,"about_ca_system_score_gemma":0.002888143,"threshold_uncertainty_score":0.9919141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010634437,0.00006854143,0.000074813186,0.00007130226,0.000026146196,0.0000101418045,0.997547,0.0011227652,0.00097294315],"genre_scores_gemma":[0.00046825502,0.00008208602,0.00035251287,0.000065498876,0.000013030574,0.0000845251,0.9979382,0.0002822282,0.0007137395],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851567,0.00019460844,0.0001662851,0.00039728885,0.00039882952,0.00032721707],"domain_scores_gemma":[0.99645436,0.0012172672,0.00026945965,0.0009679667,0.0007560376,0.00033498945],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012969138,0.004653407,0.0025328372,0.0051254407,0.0013324966,0.004795563,0.0057123713,0.0042789523,0.30288738],"category_scores_gemma":[0.010782951,0.0014480898,0.0020906834,0.009700356,0.0009972388,0.0031267798,0.0033351711,0.0026985172,0.3578366],"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.000039241764,0.0000252647,0.0002465699,0.00066352385,0.000016556121,0.000011076567,0.0000149300895,0.00029020882,0.00006527255,0.0003517245,0.9968514,0.0014241474],"study_design_scores_gemma":[0.00061751483,0.000048681482,0.001896036,0.00038709227,0.000026502874,0.00008024429,0.00010018214,0.0010264859,0.00072528457,0.0028342728,0.9922126,0.000045073153],"about_ca_topic_score_codex":0.016670808,"about_ca_topic_score_gemma":0.022058586,"teacher_disagreement_score":0.6971126,"about_ca_system_score_codex":0.002204469,"about_ca_system_score_gemma":0.0028052493,"threshold_uncertainty_score":0.99434656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112150316,0.000088173976,0.00007176894,0.00007609385,0.00002968014,0.000010253701,0.9976465,0.00094529596,0.0010200919],"genre_scores_gemma":[0.0004684246,0.00009536029,0.00035043506,0.00007210669,0.000013224327,0.00008130348,0.9979436,0.00023830353,0.0007372401],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985825,0.00020074502,0.00014430413,0.00038663298,0.00037324204,0.0003127042],"domain_scores_gemma":[0.99700326,0.0010462577,0.00021900154,0.0008078872,0.0006333558,0.00029012468],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012907,0.004768531,0.00263701,0.004800661,0.0013223265,0.0046029957,0.0058692265,0.004517864,0.27454683],"category_scores_gemma":[0.009710704,0.0014059271,0.00219619,0.008596175,0.000987655,0.0029175526,0.0032318945,0.0025934526,0.3161194],"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.00003678125,0.000025140589,0.00025046698,0.00067884027,0.000018523511,0.000011105499,0.000013667567,0.00032757613,0.000055803757,0.0003695445,0.99682117,0.0013913258],"study_design_scores_gemma":[0.00056251814,0.000041377592,0.0018436918,0.00041012053,0.000028330664,0.000074923635,0.000088789486,0.0010437149,0.00062183314,0.0029088182,0.992332,0.000043810564],"about_ca_topic_score_codex":0.018695898,"about_ca_topic_score_gemma":0.026922313,"teacher_disagreement_score":0.72545314,"about_ca_system_score_codex":0.002330793,"about_ca_system_score_gemma":0.0026867995,"threshold_uncertainty_score":0.91845065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011177526,0.00008886295,0.00007385985,0.000075733195,0.000029017341,0.000010277975,0.9976146,0.0009659947,0.0010299581],"genre_scores_gemma":[0.00047499186,0.00009816577,0.00036113392,0.00007211232,0.000013460444,0.00008309146,0.9979006,0.00024938295,0.00074707397],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860317,0.00019527863,0.00014249184,0.0003796845,0.00037411755,0.00030528643],"domain_scores_gemma":[0.9969957,0.0010648004,0.00022085481,0.0007976097,0.00063508656,0.0002859314],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012688913,0.004841353,0.0026242537,0.0048583006,0.0013007802,0.004543674,0.005739295,0.004416975,0.27558467],"category_scores_gemma":[0.009641481,0.001416226,0.0021725532,0.008728849,0.0009822779,0.0029257885,0.0031676544,0.0026025516,0.31813535],"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.000036630237,0.000025321971,0.00024546255,0.000679374,0.000018458317,0.000011005044,0.000013384028,0.00033821314,0.00005684657,0.00036500604,0.99681735,0.0013928659],"study_design_scores_gemma":[0.0005714255,0.000042253014,0.0018546374,0.00040437578,0.00002902991,0.00007670795,0.00008807351,0.0010905623,0.0006493257,0.002988169,0.992161,0.000044395452],"about_ca_topic_score_codex":0.018367708,"about_ca_topic_score_gemma":0.026471686,"teacher_disagreement_score":0.7244153,"about_ca_system_score_codex":0.0022903855,"about_ca_system_score_gemma":0.0026723337,"threshold_uncertainty_score":0.92192256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112077105,0.00008859072,0.00007455884,0.00007610736,0.000028571932,0.000010198719,0.9976173,0.0009765127,0.0010160255],"genre_scores_gemma":[0.00048033544,0.00009850021,0.00036687567,0.000072344206,0.000013500057,0.000083969106,0.99789053,0.00025050022,0.00074340065],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859756,0.00019659656,0.00014264089,0.0003826564,0.00037422753,0.0003063148],"domain_scores_gemma":[0.99700457,0.001066999,0.0002211529,0.0007913112,0.00063115574,0.00028481675],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001278453,0.0048537194,0.0026240852,0.004838572,0.0012880745,0.004507124,0.0057647103,0.0044408576,0.27327654],"category_scores_gemma":[0.009659217,0.0014265364,0.0021819158,0.008689086,0.0009762546,0.0029285208,0.0031767858,0.0025869014,0.31573015],"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.000037181886,0.000025047035,0.00024989215,0.0006886133,0.000018774164,0.000011184094,0.000013622435,0.0003432887,0.000057289726,0.00036752562,0.99678195,0.0014055489],"study_design_scores_gemma":[0.00056782935,0.000041785464,0.0018395857,0.00040150504,0.000028819997,0.00007687796,0.000087944696,0.0010950444,0.00064346084,0.003003826,0.99216884,0.000044478486],"about_ca_topic_score_codex":0.018341968,"about_ca_topic_score_gemma":0.026458373,"teacher_disagreement_score":0.72672343,"about_ca_system_score_codex":0.0023037745,"about_ca_system_score_gemma":0.0027063321,"threshold_uncertainty_score":0.9142011},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000106386455,0.00008747773,0.000069814465,0.000075180804,0.000028127839,0.000009683608,0.9977324,0.0008869762,0.0010039143],"genre_scores_gemma":[0.00047312383,0.0000992353,0.00034557187,0.000072591916,0.000013523861,0.000080140555,0.9979164,0.00024047292,0.0007588355],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986254,0.00019158496,0.0001393882,0.00037537797,0.00036578285,0.0003024253],"domain_scores_gemma":[0.99699163,0.0010791048,0.00022262133,0.0007750968,0.0006454343,0.00028608541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012445522,0.004763247,0.0025877256,0.00477033,0.001287858,0.004535981,0.0055917674,0.004416072,0.28268045],"category_scores_gemma":[0.009600308,0.001416846,0.0021560478,0.008634209,0.00096394354,0.002915359,0.0031413392,0.0025643846,0.32389188],"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.000036484063,0.000024195673,0.00025491964,0.0006888773,0.000018389132,0.000010791305,0.00001341466,0.00033457525,0.000054847154,0.00036156515,0.99682045,0.0013814998],"study_design_scores_gemma":[0.00057085895,0.00004169367,0.0019362161,0.00041250867,0.000028689225,0.000075773256,0.000089278794,0.001044692,0.00061294297,0.0029113817,0.9922323,0.00004363746],"about_ca_topic_score_codex":0.018939143,"about_ca_topic_score_gemma":0.027044965,"teacher_disagreement_score":0.71731955,"about_ca_system_score_codex":0.0023179606,"about_ca_system_score_gemma":0.0026967162,"threshold_uncertainty_score":0.9456603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010750114,0.000086903114,0.00007376328,0.000076163225,0.000029025294,0.000010170148,0.9976634,0.0009578553,0.0009952561],"genre_scores_gemma":[0.0004737741,0.00009751999,0.00036795132,0.00007331217,0.000013671297,0.00008547389,0.99788564,0.0002527036,0.000749962],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998594,0.00019752972,0.00014337095,0.00038382586,0.00037218782,0.0003090847],"domain_scores_gemma":[0.9969723,0.0010848385,0.00022245827,0.0007936613,0.0006374876,0.00028914725],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012887003,0.0048482683,0.002621072,0.004840579,0.0013111295,0.0045709084,0.005834537,0.0044810143,0.28120252],"category_scores_gemma":[0.0097828405,0.001440672,0.002216318,0.0086333435,0.0009837609,0.0029540088,0.0031837136,0.002625837,0.32011184],"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.00003671892,0.000024781868,0.00024420093,0.0006916756,0.000018662216,0.000011022013,0.000013499649,0.000340256,0.00005520749,0.000365836,0.99681693,0.0013811418],"study_design_scores_gemma":[0.00058161543,0.000041850537,0.0018293987,0.00040756172,0.000029026396,0.00007588952,0.00008797068,0.0010787077,0.0006325372,0.0030324108,0.9921582,0.000044872922],"about_ca_topic_score_codex":0.018565552,"about_ca_topic_score_gemma":0.026872618,"teacher_disagreement_score":0.71879745,"about_ca_system_score_codex":0.002338522,"about_ca_system_score_gemma":0.0027427308,"threshold_uncertainty_score":0.94071615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000119430115,0.000089295696,0.000076801494,0.000076430835,0.000031171523,0.000010955369,0.9974928,0.0010631497,0.0010398807],"genre_scores_gemma":[0.0004795003,0.00009221413,0.00036266865,0.000072826784,0.000013466591,0.00008291681,0.99789846,0.00025397356,0.0007439803],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859995,0.00019671612,0.00014109534,0.00038034192,0.0003666272,0.00031529993],"domain_scores_gemma":[0.99709415,0.0009865084,0.00020989061,0.0008098562,0.00061481073,0.0002848467],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012719436,0.0048477096,0.0026456849,0.004723464,0.0013280887,0.0045677875,0.0059121926,0.004553309,0.2687184],"category_scores_gemma":[0.00932079,0.0014279895,0.0022656163,0.008384814,0.001000515,0.0028680107,0.003234261,0.0026032287,0.31598628],"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.00003840422,0.00002584714,0.00025033098,0.0006619607,0.000018791483,0.0000114148625,0.0000135213095,0.0003341216,0.000059884715,0.00035440785,0.99683505,0.0013962407],"study_design_scores_gemma":[0.0005893934,0.00004357755,0.0018414664,0.00039630485,0.000029407443,0.00007802961,0.0000885691,0.0011019834,0.00067915244,0.0029547808,0.9921523,0.00004500873],"about_ca_topic_score_codex":0.018314768,"about_ca_topic_score_gemma":0.026760561,"teacher_disagreement_score":0.73128164,"about_ca_system_score_codex":0.0022382054,"about_ca_system_score_gemma":0.0026199876,"threshold_uncertainty_score":0.8989526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012333918,0.00009161323,0.00007686723,0.00008007133,0.000031357904,0.000011104793,0.9975528,0.0010219752,0.0010109221],"genre_scores_gemma":[0.00048658063,0.00009397504,0.00037658442,0.000071827104,0.000013600828,0.0000833592,0.9979048,0.00023641641,0.00073282403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985946,0.0001964976,0.00014319574,0.00038291572,0.00037436417,0.00030838765],"domain_scores_gemma":[0.9970758,0.0010110416,0.0002128584,0.00080474274,0.00061511353,0.00028047326],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012774349,0.004805062,0.002597158,0.0047983103,0.0013033319,0.0045252647,0.005899455,0.004644224,0.25696665],"category_scores_gemma":[0.009519194,0.0014246493,0.002211317,0.008437217,0.0009900781,0.002841338,0.0031097608,0.0026104976,0.3029648],"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.000037943413,0.000026582633,0.00025776235,0.0006697845,0.000019139377,0.000011985285,0.000013477809,0.00035654177,0.000058944042,0.00036150223,0.99673826,0.0014482461],"study_design_scores_gemma":[0.0005819849,0.000043852895,0.0018708197,0.00039521168,0.000029134259,0.00008169775,0.00008972135,0.0011518559,0.0006805322,0.002972607,0.99205726,0.000045336372],"about_ca_topic_score_codex":0.018073054,"about_ca_topic_score_gemma":0.026365615,"teacher_disagreement_score":0.74303335,"about_ca_system_score_codex":0.0022473221,"about_ca_system_score_gemma":0.0026284857,"threshold_uncertainty_score":0.85963905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010357365,0.0000863159,0.00006729172,0.00007453282,0.000027403721,0.000009432524,0.9978124,0.00083280535,0.0009861581],"genre_scores_gemma":[0.00047967816,0.000101406134,0.00034495452,0.00007322032,0.000013714082,0.00008128955,0.9979069,0.00023579477,0.0007631046],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986278,0.00019075752,0.00014059959,0.00037574494,0.00036384616,0.0003013809],"domain_scores_gemma":[0.9969386,0.0011194667,0.00022829158,0.00077546074,0.00065005483,0.00028809372],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012480731,0.004690792,0.0025762683,0.004840478,0.0012922598,0.004561677,0.0055663153,0.0043985257,0.2883121],"category_scores_gemma":[0.009730433,0.0014085539,0.0021412403,0.008726027,0.0009621529,0.002927858,0.003152109,0.0025545147,0.32141075],"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.000036532565,0.000024346891,0.0002632764,0.0007105596,0.000018691191,0.000011012312,0.000013789778,0.00033408645,0.000054326734,0.0003737283,0.9967777,0.0013819571],"study_design_scores_gemma":[0.00057117105,0.000040888266,0.0019628662,0.00042575883,0.000028876622,0.00007567014,0.00009091031,0.0010106927,0.0005950564,0.002937827,0.99221635,0.000043780987],"about_ca_topic_score_codex":0.018776434,"about_ca_topic_score_gemma":0.026789358,"teacher_disagreement_score":0.7116879,"about_ca_system_score_codex":0.002313392,"about_ca_system_score_gemma":0.0026871164,"threshold_uncertainty_score":0.96450007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011885519,0.000090407244,0.00007835063,0.000083253464,0.000032593543,0.000011096048,0.99747854,0.0010767862,0.001030108],"genre_scores_gemma":[0.00048678316,0.000093546674,0.00038668682,0.0000775348,0.000014415132,0.00008685896,0.99784327,0.00026091468,0.0007498855],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985701,0.00020066464,0.00014207924,0.0003905395,0.000376456,0.00032017808],"domain_scores_gemma":[0.99700433,0.0010245416,0.00021730206,0.00081602007,0.00063539465,0.00030246063],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013047408,0.004916621,0.002664628,0.004868584,0.0013375506,0.0047135283,0.0060415375,0.004667116,0.26867417],"category_scores_gemma":[0.009784707,0.0014437772,0.0023059773,0.008446713,0.0010037648,0.002938336,0.0033332412,0.0026667363,0.30952182],"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.000037741916,0.000025588386,0.00024720695,0.0006667505,0.000018866991,0.000011666183,0.000013855388,0.00033288915,0.00005660008,0.00036617756,0.9968521,0.0013704982],"study_design_scores_gemma":[0.0005816215,0.000042502572,0.0017271318,0.00038527447,0.000028828013,0.00007820753,0.00008717511,0.0011159169,0.0006269073,0.003046957,0.9922347,0.00004471298],"about_ca_topic_score_codex":0.018379679,"about_ca_topic_score_gemma":0.027077354,"teacher_disagreement_score":0.73132586,"about_ca_system_score_codex":0.0022996026,"about_ca_system_score_gemma":0.0027441606,"threshold_uncertainty_score":0.8988046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010947403,0.000085475345,0.0000714918,0.00007754236,0.000029552646,0.000010115885,0.9976761,0.00093479815,0.0010054711],"genre_scores_gemma":[0.00047031534,0.000092970084,0.00034780643,0.00007343745,0.000013758188,0.000082890714,0.99791163,0.00023932532,0.00076781557],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986135,0.00019509374,0.00014118338,0.0003843744,0.0003623375,0.00030342644],"domain_scores_gemma":[0.9970534,0.0010106912,0.00022087496,0.0007959575,0.0006293354,0.00028981097],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012775242,0.004786137,0.0026409659,0.004633169,0.0012937475,0.0045658797,0.0059122005,0.004577737,0.27856404],"category_scores_gemma":[0.009590338,0.0014244688,0.002198213,0.008399654,0.00097588776,0.0029073309,0.0032081965,0.002568232,0.32523093],"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.00003748117,0.000024654331,0.000248102,0.0006622957,0.000018482577,0.00001078439,0.000013136931,0.0003213675,0.000054798427,0.00035634424,0.9968803,0.0013721758],"study_design_scores_gemma":[0.00058885495,0.00004218885,0.0018399649,0.00040025474,0.000028510925,0.0000738241,0.0000867871,0.0010436813,0.0006270939,0.0029973562,0.9922276,0.00004373912],"about_ca_topic_score_codex":0.01807342,"about_ca_topic_score_gemma":0.026098905,"teacher_disagreement_score":0.72143596,"about_ca_system_score_codex":0.0022863802,"about_ca_system_score_gemma":0.0026858388,"threshold_uncertainty_score":0.93188953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010558498,0.00008620628,0.00007060135,0.00007581726,0.000028471062,0.00000957832,0.9977586,0.00088869344,0.00097639207],"genre_scores_gemma":[0.0004783035,0.00009838641,0.00035663217,0.00007418152,0.0000137447805,0.00008261589,0.9979018,0.00024261259,0.00075170025],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861,0.000194843,0.0001419817,0.00038219435,0.00036645282,0.00030451015],"domain_scores_gemma":[0.99695706,0.0010962997,0.00022539607,0.00078607816,0.00064559974,0.00028958323],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001264119,0.0047303215,0.0025947134,0.0048113186,0.0012946429,0.0045681214,0.0056893965,0.0044606146,0.2807165],"category_scores_gemma":[0.009856318,0.0014241711,0.00219066,0.008650314,0.0009574148,0.0029239766,0.0031682083,0.002576451,0.31631842],"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.00003691868,0.000024217245,0.00025958166,0.00069876784,0.000018988005,0.000011166326,0.000013721606,0.00033980934,0.000054234817,0.00037417584,0.9967847,0.0013836811],"study_design_scores_gemma":[0.0005681869,0.000040457686,0.0018798959,0.00041200678,0.000028866196,0.00007483281,0.00008838794,0.0010323527,0.0005923482,0.0029831144,0.99225545,0.000044091106],"about_ca_topic_score_codex":0.018969178,"about_ca_topic_score_gemma":0.02715444,"teacher_disagreement_score":0.71928346,"about_ca_system_score_codex":0.002326692,"about_ca_system_score_gemma":0.0027474943,"threshold_uncertainty_score":0.93909025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112615926,0.00008955795,0.00007430706,0.000078663,0.00003014536,0.0000102491185,0.99759173,0.0009867181,0.0010259759],"genre_scores_gemma":[0.00047835338,0.00009829079,0.00036427146,0.00007434004,0.000013875686,0.00008378051,0.9978879,0.00025162371,0.00074755226],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985758,0.00019918091,0.000144649,0.00038877825,0.00037870277,0.00031298792],"domain_scores_gemma":[0.9969511,0.0010821696,0.0002235279,0.00080326205,0.0006467729,0.00029317223],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013004439,0.0049095317,0.0026227466,0.004895161,0.0013151579,0.004604213,0.0058391495,0.004491993,0.27507204],"category_scores_gemma":[0.009919185,0.0014234424,0.002215209,0.008720782,0.0009817455,0.0029538316,0.0032237356,0.0026151428,0.31605813],"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.000036758498,0.000025045925,0.00024761367,0.00068617356,0.000018786477,0.000011108763,0.0000135914925,0.00033521833,0.000055497752,0.00036674694,0.9968195,0.0013839783],"study_design_scores_gemma":[0.00057772285,0.000041765357,0.0018258843,0.00040508914,0.000029245452,0.00007601618,0.00008801966,0.0010878461,0.00063011545,0.0030104676,0.9921834,0.000044495384],"about_ca_topic_score_codex":0.018739805,"about_ca_topic_score_gemma":0.026995715,"teacher_disagreement_score":0.72492796,"about_ca_system_score_codex":0.0023477247,"about_ca_system_score_gemma":0.0027649149,"threshold_uncertainty_score":0.9202076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011635712,0.00008816615,0.00007368778,0.00007542142,0.000029923991,0.000010355943,0.9975931,0.0009745111,0.0010384569],"genre_scores_gemma":[0.00046799966,0.00009218309,0.00035084566,0.0000706431,0.000013100289,0.00008060797,0.99793065,0.00023973215,0.0007542734],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985707,0.00020302723,0.000144672,0.00039140644,0.00037744772,0.0003127124],"domain_scores_gemma":[0.99705076,0.0010038055,0.00021721955,0.00080952526,0.0006308751,0.00028769945],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012937894,0.0047845836,0.0026225846,0.0047680642,0.0013258934,0.004545432,0.0059187314,0.004520717,0.26929298],"category_scores_gemma":[0.009519059,0.0014176401,0.0022072387,0.008554633,0.0009852988,0.0028807498,0.0032030328,0.0025713278,0.31637275],"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.000037563615,0.000025277024,0.0002512809,0.00065214647,0.000018552419,0.000010977519,0.000013272644,0.00032709015,0.00005741095,0.0003625765,0.9968574,0.0013863763],"study_design_scores_gemma":[0.0005740399,0.00004214573,0.0018670966,0.00039714415,0.00002852922,0.00007467613,0.00008759823,0.0010581646,0.00064594153,0.0029090052,0.9922718,0.00004387627],"about_ca_topic_score_codex":0.018672835,"about_ca_topic_score_gemma":0.027217388,"teacher_disagreement_score":0.73070705,"about_ca_system_score_codex":0.0022986138,"about_ca_system_score_gemma":0.0026836924,"threshold_uncertainty_score":0.90087473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011564319,0.00009027541,0.000076950746,0.000082263745,0.00003207185,0.00001099597,0.99753165,0.0010302223,0.0010299461],"genre_scores_gemma":[0.0004805787,0.00009335315,0.00038059364,0.0000764,0.000014112686,0.000084659,0.997879,0.00024839301,0.0007429664],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985488,0.00020475917,0.00014703645,0.00039348812,0.00038337937,0.00032250825],"domain_scores_gemma":[0.99692327,0.001058861,0.00022515426,0.0008296418,0.0006584168,0.00030466597],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001315461,0.004900783,0.0026447815,0.004835748,0.0013208733,0.004660712,0.005940027,0.0046395794,0.2719913],"category_scores_gemma":[0.009971428,0.0014273511,0.0022668843,0.00852022,0.001002519,0.0029517822,0.003271281,0.0026336648,0.3119759],"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.000037235735,0.000025579156,0.00024740523,0.0006730709,0.00001872325,0.000011344177,0.00001360193,0.00033295,0.00005555489,0.00036782856,0.99683565,0.0013812138],"study_design_scores_gemma":[0.0005767703,0.000042891876,0.0017903697,0.00039600822,0.000029023702,0.00007753018,0.000088268825,0.0011007375,0.00063371443,0.0030689584,0.99215126,0.00004450867],"about_ca_topic_score_codex":0.018391365,"about_ca_topic_score_gemma":0.0270802,"teacher_disagreement_score":0.7280087,"about_ca_system_score_codex":0.0023311004,"about_ca_system_score_gemma":0.002727067,"threshold_uncertainty_score":0.9099016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011466752,0.000088880115,0.00007529287,0.000078471676,0.000030334013,0.000010394276,0.9975847,0.000985693,0.0010315586],"genre_scores_gemma":[0.0004878049,0.00009727173,0.00037184695,0.00007420014,0.000013862219,0.00008431231,0.997863,0.00024996925,0.0007577156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998588,0.0001968735,0.0001428121,0.0003873539,0.0003746135,0.00031021415],"domain_scores_gemma":[0.9969831,0.0010737268,0.0002207722,0.00079415296,0.0006399341,0.00028833555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012732907,0.0048513063,0.0025900453,0.004820659,0.001311979,0.0045608827,0.0057599624,0.00453266,0.2715256],"category_scores_gemma":[0.009764474,0.0014235711,0.0022054645,0.008589931,0.00097218266,0.002912455,0.0031636201,0.0026237385,0.31307393],"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.00003715953,0.00002515834,0.00025215617,0.0006716474,0.000018505858,0.000011229359,0.000013351088,0.00034248672,0.000056238005,0.0003646999,0.99682033,0.0013870026],"study_design_scores_gemma":[0.0005754241,0.000042204792,0.0018523997,0.00040013168,0.000028916696,0.00007673902,0.0000889584,0.0010974713,0.0006406972,0.0030359891,0.99211615,0.00004485553],"about_ca_topic_score_codex":0.01861644,"about_ca_topic_score_gemma":0.02730732,"teacher_disagreement_score":0.7284744,"about_ca_system_score_codex":0.0023181855,"about_ca_system_score_gemma":0.0027636609,"threshold_uncertainty_score":0.9083436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010267683,0.00006638184,0.00006937286,0.000069188456,0.000025198084,0.000009504612,0.9977278,0.0010042429,0.0009256553],"genre_scores_gemma":[0.000474145,0.000083472645,0.0003379717,0.000065951295,0.000013342268,0.00008509172,0.997959,0.000270022,0.0007110063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985228,0.00019225784,0.00016602705,0.00039836863,0.00039355422,0.00032697766],"domain_scores_gemma":[0.9963877,0.0012918201,0.00027551418,0.0009477862,0.00076424796,0.00033294706],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012855013,0.004554693,0.0025185654,0.005116736,0.0013215817,0.0047704815,0.00555649,0.0042123403,0.31397632],"category_scores_gemma":[0.010930872,0.0014340967,0.00208698,0.009781294,0.0009919278,0.0031167902,0.003301418,0.0026506404,0.35707512],"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.00003935875,0.000025322772,0.0002606957,0.00068790495,0.0000168254,0.000011090567,0.000015222721,0.00029457198,0.00006240172,0.00035400369,0.99680895,0.0014235871],"study_design_scores_gemma":[0.00063035794,0.000048733167,0.0020284373,0.00040847232,0.000027189437,0.0000808552,0.00010510586,0.0010145186,0.0006927163,0.0028369583,0.99208075,0.000045841174],"about_ca_topic_score_codex":0.01673374,"about_ca_topic_score_gemma":0.021811198,"teacher_disagreement_score":0.6860237,"about_ca_system_score_codex":0.0022301206,"about_ca_system_score_gemma":0.002791937,"threshold_uncertainty_score":0.9785295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010208297,0.000081199025,0.00006883016,0.000076468794,0.00002904275,0.000009886171,0.9977695,0.00088277785,0.0009802008],"genre_scores_gemma":[0.00046952418,0.00009291824,0.0003441075,0.00007506478,0.00001403451,0.00008392406,0.9979032,0.00024038054,0.0007768624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998635,0.00019142425,0.00014037498,0.00037712927,0.00035353965,0.00030254328],"domain_scores_gemma":[0.99698263,0.0010633876,0.00022357824,0.000799436,0.0006372007,0.00029384828],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012712308,0.004704921,0.0026243425,0.004615194,0.0012855723,0.0045882133,0.0057474147,0.0045242636,0.29009232],"category_scores_gemma":[0.009774295,0.0014101847,0.0021566676,0.00838586,0.0009646298,0.0029323993,0.0032101548,0.0025700405,0.32968387],"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.000037009995,0.00002406351,0.00024572437,0.00066797517,0.00001801057,0.000010773194,0.000013186155,0.00031561506,0.000052724507,0.00035427327,0.9969133,0.0013472794],"study_design_scores_gemma":[0.0005750368,0.00004127968,0.0018287272,0.00040867119,0.000027959744,0.00007326484,0.00008802427,0.0009909354,0.00060203974,0.003009771,0.992311,0.000043370863],"about_ca_topic_score_codex":0.01766747,"about_ca_topic_score_gemma":0.025225306,"teacher_disagreement_score":0.70990765,"about_ca_system_score_codex":0.0022625518,"about_ca_system_score_gemma":0.002646406,"threshold_uncertainty_score":0.97045547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107427026,0.000086175685,0.00007258852,0.00007686723,0.000028775636,0.000010106392,0.9976794,0.0009418891,0.0009968537],"genre_scores_gemma":[0.00048106976,0.00009713572,0.0003528245,0.00007510585,0.000013938107,0.00008439442,0.9978809,0.00024905903,0.00076554395],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866164,0.00018684463,0.00013600757,0.00037161043,0.00034827617,0.0002957813],"domain_scores_gemma":[0.9970891,0.0010193012,0.00021672198,0.00077679654,0.0006160201,0.00028203998],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012548884,0.004747711,0.0026463103,0.004564924,0.0012668775,0.004550799,0.005800403,0.0044728047,0.2865718],"category_scores_gemma":[0.009534983,0.0014064548,0.0021575748,0.00831555,0.0009769449,0.0029252865,0.003164061,0.0025498716,0.33120185],"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.000037024984,0.000024322599,0.00024324027,0.0006767176,0.000018239783,0.00001074531,0.000013326744,0.000321792,0.00005532671,0.00035773325,0.9968587,0.001382788],"study_design_scores_gemma":[0.0005808445,0.00004232901,0.0018283125,0.00040719335,0.000028452958,0.00007596245,0.00008772858,0.0010451872,0.0006360619,0.0030232002,0.992201,0.00004361466],"about_ca_topic_score_codex":0.017609833,"about_ca_topic_score_gemma":0.024907082,"teacher_disagreement_score":0.7134282,"about_ca_system_score_codex":0.0022589422,"about_ca_system_score_gemma":0.002629411,"threshold_uncertainty_score":0.9586782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012052702,0.00008954005,0.00007659986,0.000076798686,0.000030979885,0.00001092366,0.9974962,0.0010474051,0.0010510698],"genre_scores_gemma":[0.00047784386,0.00009283408,0.0003701907,0.000071141716,0.000013309281,0.00008299639,0.9978908,0.0002496241,0.0007512168],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986076,0.00019740227,0.00014074874,0.0003790438,0.0003661433,0.00030911865],"domain_scores_gemma":[0.99710387,0.0009878436,0.00020828667,0.0008028792,0.00061526836,0.00028194062],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012748089,0.004832475,0.0026241466,0.004731514,0.0013163735,0.0044782734,0.0058738026,0.0045089666,0.26592958],"category_scores_gemma":[0.009374634,0.0014116216,0.0022077742,0.008323886,0.0009818905,0.0028745406,0.0031506484,0.002582579,0.31334576],"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.00003806622,0.000025899806,0.00024387265,0.00065382785,0.000018236418,0.000011160741,0.000013267025,0.00033146158,0.000059373913,0.00035589916,0.9968336,0.0014153133],"study_design_scores_gemma":[0.0005775368,0.00004321998,0.0018247287,0.0003930729,0.000028640752,0.00007698368,0.0000882522,0.0011056953,0.0006793384,0.002954182,0.992184,0.00004432647],"about_ca_topic_score_codex":0.018069606,"about_ca_topic_score_gemma":0.02637955,"teacher_disagreement_score":0.7340704,"about_ca_system_score_codex":0.0022331276,"about_ca_system_score_gemma":0.002601867,"threshold_uncertainty_score":0.88962305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010411775,0.00008549494,0.00007035661,0.00007553282,0.000028523342,0.000009607115,0.9977469,0.0009011724,0.0009783007],"genre_scores_gemma":[0.00046986385,0.00009820983,0.00035169418,0.00007295621,0.000013638823,0.000081215476,0.9979278,0.00024325578,0.00074148574],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861324,0.00019298251,0.00014207563,0.00037798396,0.0003677932,0.00030596458],"domain_scores_gemma":[0.99698085,0.0010842128,0.00022333833,0.0007812174,0.0006416122,0.00028876582],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00125972,0.004783031,0.0026056664,0.0047956975,0.00129605,0.004599914,0.0057262983,0.0044705183,0.28209546],"category_scores_gemma":[0.009733102,0.001426908,0.002197363,0.00866623,0.0009623235,0.0029344214,0.0031762454,0.0025900628,0.3203324],"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.00003668022,0.000024226489,0.00025548588,0.0006947088,0.000018853721,0.0000110581705,0.000013618266,0.0003381418,0.00005413902,0.00036752282,0.9968058,0.0013797375],"study_design_scores_gemma":[0.0005740007,0.00004083558,0.0018854103,0.00041538646,0.000028863575,0.00007494064,0.0000889763,0.0010371592,0.00060007337,0.0029897315,0.9922202,0.00004441729],"about_ca_topic_score_codex":0.01902602,"about_ca_topic_score_gemma":0.027324518,"teacher_disagreement_score":0.71790457,"about_ca_system_score_codex":0.002333852,"about_ca_system_score_gemma":0.0027332339,"threshold_uncertainty_score":0.94370335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010701478,0.000084094005,0.00007046367,0.00007712801,0.0000289981,0.000009994361,0.9977083,0.00091502734,0.000998942],"genre_scores_gemma":[0.0004760347,0.00009368344,0.00034441904,0.00007289745,0.000013788991,0.00008235404,0.9979069,0.00024252337,0.00076751213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866927,0.00018698153,0.0001352669,0.00036895808,0.00034625782,0.00029340174],"domain_scores_gemma":[0.9970794,0.0010235971,0.00021535328,0.0007765246,0.0006207121,0.00028445997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001253587,0.00473188,0.002611147,0.004559727,0.0012677461,0.0044898423,0.0057513886,0.0044737603,0.28361025],"category_scores_gemma":[0.009488863,0.001402278,0.0021443886,0.008227105,0.0009637985,0.0029103805,0.003127907,0.0025343685,0.32930732],"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.00003732953,0.000024479179,0.0002463352,0.00066905504,0.000018128532,0.000010710849,0.000013108298,0.0003256677,0.000054633118,0.0003516958,0.9968689,0.0013800334],"study_design_scores_gemma":[0.00059310603,0.000042940777,0.0018721691,0.00040317263,0.000028038086,0.00007474663,0.00008815523,0.0010669627,0.0006289383,0.0030116083,0.9921463,0.00004395049],"about_ca_topic_score_codex":0.01776098,"about_ca_topic_score_gemma":0.025230987,"teacher_disagreement_score":0.7163898,"about_ca_system_score_codex":0.0022551902,"about_ca_system_score_gemma":0.0026054766,"threshold_uncertainty_score":0.9487708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000109056884,0.00008692054,0.00007424058,0.0000788702,0.000029804798,0.000010169122,0.99762076,0.00097618083,0.0010140258],"genre_scores_gemma":[0.00047493615,0.00009589021,0.00036257933,0.0000760905,0.000013973121,0.00008319883,0.9978835,0.0002526508,0.0007571255],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985897,0.00019639789,0.000142796,0.00038692149,0.0003732905,0.00031083444],"domain_scores_gemma":[0.99698013,0.0010512332,0.00022290534,0.0007996518,0.0006509154,0.00029508877],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012930922,0.004779734,0.0026279083,0.00474181,0.0012802777,0.004662814,0.005844702,0.004471283,0.2833142],"category_scores_gemma":[0.009884213,0.0014071233,0.0021901764,0.008530644,0.0009827605,0.002959664,0.0032529118,0.0025769817,0.32435668],"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.000036105546,0.000023992328,0.00024348329,0.00066612795,0.00001826471,0.0000108400345,0.000013557424,0.00031907263,0.00005458757,0.00036969312,0.9968731,0.0013712082],"study_design_scores_gemma":[0.0005570337,0.00004086005,0.0017826022,0.00039787486,0.00002765507,0.00007507376,0.000086638356,0.0010338554,0.0006073846,0.0029868844,0.99236125,0.000042937754],"about_ca_topic_score_codex":0.018315494,"about_ca_topic_score_gemma":0.026114233,"teacher_disagreement_score":0.7166858,"about_ca_system_score_codex":0.0023232442,"about_ca_system_score_gemma":0.002714456,"threshold_uncertainty_score":0.94778043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011592364,0.00008796226,0.00007411843,0.000075319156,0.000030020556,0.000010458371,0.99759334,0.0009917589,0.0010211959],"genre_scores_gemma":[0.00047302461,0.00009342943,0.000352749,0.0000720371,0.000013189735,0.00008169493,0.997926,0.00024418507,0.0007437933],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998587,0.000200291,0.00014442485,0.000387316,0.00036987642,0.00031110502],"domain_scores_gemma":[0.997065,0.0010039366,0.00021603784,0.00080597866,0.00062195375,0.00028700914],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012946139,0.0047922237,0.0026279606,0.004736385,0.0013152644,0.004542494,0.0058998214,0.0044970755,0.27151853],"category_scores_gemma":[0.009520241,0.0014216433,0.002196769,0.008520781,0.0009940763,0.0029096787,0.0032006297,0.002569345,0.31654444],"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.000038005855,0.000025427065,0.00024618037,0.0006709034,0.000018618404,0.000011146274,0.000013579906,0.00032825442,0.00005820863,0.00036238474,0.9968335,0.0013938731],"study_design_scores_gemma":[0.0005842278,0.000043037257,0.00184407,0.00040317373,0.000028665168,0.00007663446,0.00008858075,0.0010576326,0.0006600135,0.0029404976,0.9922289,0.000044467986],"about_ca_topic_score_codex":0.018474422,"about_ca_topic_score_gemma":0.026594145,"teacher_disagreement_score":0.7284815,"about_ca_system_score_codex":0.002291651,"about_ca_system_score_gemma":0.002680737,"threshold_uncertainty_score":0.90831995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000118261065,0.00009077739,0.000077011275,0.00007877089,0.000030419638,0.000010697878,0.99756444,0.001017352,0.001012192],"genre_scores_gemma":[0.0004887871,0.00009537801,0.00037886578,0.0000742161,0.000013747845,0.00008538857,0.99787116,0.00025334713,0.0007391788],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860436,0.00019684836,0.00013907497,0.00037951587,0.00036980349,0.0003104995],"domain_scores_gemma":[0.9970585,0.0010253649,0.00021486916,0.0007908481,0.000622577,0.00028777137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012585926,0.0048561795,0.0026145445,0.004848036,0.0013331472,0.0045517324,0.005840703,0.0045750435,0.26330775],"category_scores_gemma":[0.009464867,0.0014428041,0.0022746106,0.008442692,0.0009810948,0.002867592,0.003206838,0.0026378112,0.30452645],"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.00003872537,0.00002576138,0.00025637355,0.00068612746,0.00001919209,0.000011774572,0.00001381453,0.0003522579,0.00005867634,0.00036660547,0.9967867,0.0013840507],"study_design_scores_gemma":[0.0005837413,0.00004253344,0.0018086041,0.00039118918,0.000029674327,0.00007899741,0.000087381544,0.0011227271,0.0006422446,0.0029953525,0.9921725,0.000045082117],"about_ca_topic_score_codex":0.01871758,"about_ca_topic_score_gemma":0.027747344,"teacher_disagreement_score":0.73669225,"about_ca_system_score_codex":0.0022644298,"about_ca_system_score_gemma":0.0027263877,"threshold_uncertainty_score":0.88085216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011088013,0.0000859248,0.00007297603,0.00007553513,0.000028873083,0.000010057126,0.9976736,0.0009449332,0.0009971854],"genre_scores_gemma":[0.00047426912,0.000094799565,0.0003643773,0.000072272764,0.000013307233,0.00008181966,0.99792373,0.00023988419,0.0007354424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986198,0.00019352268,0.00014119534,0.00037554832,0.00036603483,0.00030389632],"domain_scores_gemma":[0.9970336,0.0010488139,0.00021789115,0.00078594807,0.00062843773,0.00028540555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012468696,0.0047213957,0.0025596982,0.0047468306,0.0012898822,0.0044894945,0.0056889597,0.004453958,0.2699328],"category_scores_gemma":[0.009552413,0.0014081844,0.002170841,0.008437102,0.00094976934,0.0028562653,0.003136663,0.00256658,0.31149024],"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.000037878017,0.000024926656,0.00025740036,0.00068106287,0.000018721585,0.000011412733,0.000013551018,0.00034028114,0.00005757631,0.00037042185,0.9967841,0.0014026962],"study_design_scores_gemma":[0.0005631334,0.000041084757,0.0018518652,0.00039809855,0.000028508997,0.00007580781,0.000087260654,0.0010505292,0.0006289314,0.0029643693,0.9922665,0.000043842112],"about_ca_topic_score_codex":0.018452607,"about_ca_topic_score_gemma":0.026978923,"teacher_disagreement_score":0.7300672,"about_ca_system_score_codex":0.0022503436,"about_ca_system_score_gemma":0.0026849692,"threshold_uncertainty_score":0.9030152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010422674,0.000084312225,0.00007158646,0.00007789237,0.000028982497,0.000009896965,0.9976955,0.0009351075,0.0009924659],"genre_scores_gemma":[0.000475205,0.000096651995,0.00036151963,0.000075324206,0.000014151083,0.000083748135,0.997881,0.00025161717,0.0007607867],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986039,0.0001939941,0.00014288686,0.00038417536,0.0003660426,0.00030903792],"domain_scores_gemma":[0.9969489,0.001080843,0.00022636424,0.0007962666,0.0006482701,0.00029931474],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012985996,0.004761012,0.0026381214,0.004782949,0.0012730852,0.0046992465,0.0058167544,0.00448473,0.29110038],"category_scores_gemma":[0.009910829,0.0014323763,0.002184515,0.008706757,0.000981256,0.0029863748,0.003278444,0.002583906,0.32759616],"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.000036441274,0.000024028694,0.00024820247,0.00069212145,0.000018412109,0.000011042657,0.000013863639,0.00032172306,0.000053565967,0.0003721834,0.9968304,0.001377953],"study_design_scores_gemma":[0.00057076075,0.000041281568,0.0018300111,0.00040812278,0.000027467684,0.00007516652,0.000088412955,0.0010344869,0.00059500325,0.0030201867,0.9922655,0.000043597283],"about_ca_topic_score_codex":0.017769393,"about_ca_topic_score_gemma":0.025570946,"teacher_disagreement_score":0.7088996,"about_ca_system_score_codex":0.0023281225,"about_ca_system_score_gemma":0.0026816158,"threshold_uncertainty_score":0.9738278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011853165,0.00009273024,0.00007825242,0.000079699596,0.000030777668,0.00001066445,0.99753726,0.0010206035,0.0010314643],"genre_scores_gemma":[0.00048818634,0.00009758258,0.0003829384,0.000072785006,0.000013791521,0.0000834887,0.99787116,0.00025104685,0.00073905225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985781,0.0002002195,0.00014480227,0.00038623586,0.00037990636,0.0003108552],"domain_scores_gemma":[0.9969796,0.0010544879,0.0002222845,0.00081464025,0.00064044195,0.0002885978],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012689771,0.0048678424,0.0026062536,0.004857164,0.001305664,0.004533454,0.0057799257,0.0045193313,0.2609772],"category_scores_gemma":[0.0097120395,0.0014391128,0.0022584328,0.008607386,0.0009769083,0.0028757025,0.003185277,0.0026268198,0.3040188],"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.000037432445,0.000025298752,0.00025881676,0.00067465566,0.00001922969,0.000011400258,0.000013445603,0.0003544195,0.00005695885,0.00036815528,0.9967719,0.0014083914],"study_design_scores_gemma":[0.0005727805,0.000041899,0.001862065,0.00039469817,0.00002979804,0.00007875402,0.000087386084,0.0011323546,0.00064289814,0.003079536,0.9920328,0.000044831617],"about_ca_topic_score_codex":0.018668173,"about_ca_topic_score_gemma":0.027625633,"teacher_disagreement_score":0.7390228,"about_ca_system_score_codex":0.0022908691,"about_ca_system_score_gemma":0.0027080597,"threshold_uncertainty_score":0.87305576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010742458,0.00006707979,0.00006980072,0.000068873334,0.000026140096,0.000009964484,0.99765104,0.0010367335,0.0009630093],"genre_scores_gemma":[0.0004754664,0.0000812446,0.0003305453,0.000065198685,0.000013211816,0.0000841572,0.9979564,0.0002692414,0.0007244761],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852884,0.0001928558,0.00016481883,0.00039796397,0.00038739172,0.00032811103],"domain_scores_gemma":[0.9964694,0.0012310768,0.00026543485,0.0009573008,0.00074655656,0.00033022434],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012895868,0.0045177224,0.0025440631,0.0050347517,0.0013385842,0.0047905864,0.005645869,0.004222321,0.31574225],"category_scores_gemma":[0.010751684,0.0014176362,0.0020660148,0.009670486,0.0010095475,0.003114539,0.0033040252,0.0026359302,0.36203733],"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.000039528783,0.000026014126,0.00025414527,0.0006625241,0.000016384778,0.000010987093,0.000014913048,0.00028431398,0.00006325302,0.0003460119,0.9968575,0.0014244069],"study_design_scores_gemma":[0.00063656626,0.000050164806,0.0020211965,0.00040427415,0.00002673426,0.00008097521,0.000105976,0.001021601,0.00071735133,0.0027859241,0.9921037,0.00004556576],"about_ca_topic_score_codex":0.016384372,"about_ca_topic_score_gemma":0.021194935,"teacher_disagreement_score":0.68425775,"about_ca_system_score_codex":0.0022039665,"about_ca_system_score_gemma":0.0027059217,"threshold_uncertainty_score":0.9760106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010245768,0.000084054234,0.00006642735,0.00007596522,0.000027893402,0.000009660307,0.9978064,0.0008371772,0.0009900361],"genre_scores_gemma":[0.00048357755,0.00009915282,0.0003370442,0.00007479903,0.000014140268,0.000082901,0.99788517,0.00023702535,0.00078614615],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986737,0.0001842874,0.00013605722,0.0003683803,0.00034416417,0.00029344752],"domain_scores_gemma":[0.99702066,0.0010716288,0.00022248623,0.00076956715,0.00062881084,0.00028677858],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012399282,0.0046657533,0.0026211652,0.0046324744,0.0012767451,0.00458773,0.0056742565,0.0044493745,0.29838505],"category_scores_gemma":[0.009611121,0.0014009298,0.0021184685,0.008459263,0.0009698375,0.0029453167,0.0031592187,0.002540316,0.3335929],"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.000036654834,0.000024420944,0.00025343502,0.0006939791,0.00001816599,0.000010730905,0.000013435588,0.00031808435,0.00005317624,0.00036026942,0.99684566,0.0013719207],"study_design_scores_gemma":[0.0005933923,0.000042335945,0.001929136,0.00042407896,0.000028541548,0.00007527676,0.000091132664,0.0010126069,0.0006049257,0.0029807377,0.99217427,0.000043590655],"about_ca_topic_score_codex":0.017887993,"about_ca_topic_score_gemma":0.025074799,"teacher_disagreement_score":0.701615,"about_ca_system_score_codex":0.0022764888,"about_ca_system_score_gemma":0.0026056303,"threshold_uncertainty_score":0.99819744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010662745,0.00008630986,0.00007062082,0.00007833961,0.000029620023,0.000009953013,0.99767977,0.0009260615,0.0010126387],"genre_scores_gemma":[0.0004697204,0.00009628197,0.0003478797,0.00007486165,0.000013986725,0.00008056069,0.9979067,0.00024470396,0.00076540094],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986052,0.00019340657,0.00014117683,0.00038281226,0.00036942435,0.00030801],"domain_scores_gemma":[0.9969735,0.0010635614,0.0002232564,0.0007873704,0.0006557747,0.00029657502],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012727985,0.0047838413,0.0026220595,0.0047552856,0.0012811219,0.0046687885,0.0057430565,0.0044669993,0.2873299],"category_scores_gemma":[0.009819924,0.00141073,0.002163875,0.008594614,0.0009774342,0.0029668305,0.0032374447,0.00257418,0.3275033],"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.000035750338,0.000023917124,0.0002454676,0.0006660927,0.000018013554,0.000010669168,0.000013297622,0.00031795815,0.00005292247,0.00035841932,0.9968959,0.0013614409],"study_design_scores_gemma":[0.00057063584,0.000041895524,0.0018632641,0.00040455477,0.000027845534,0.00007504419,0.00008866881,0.0010451442,0.0006003696,0.0029398995,0.9922996,0.000043106087],"about_ca_topic_score_codex":0.018594192,"about_ca_topic_score_gemma":0.02633519,"teacher_disagreement_score":0.7126701,"about_ca_system_score_codex":0.002334374,"about_ca_system_score_gemma":0.0026910307,"threshold_uncertainty_score":0.9612143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113824026,0.00008764892,0.00007649112,0.000081496626,0.00003179918,0.0000107476835,0.9975116,0.0010500357,0.0010364093],"genre_scores_gemma":[0.00047330826,0.00009314816,0.00038155468,0.00007548334,0.000014155374,0.00008492397,0.99786466,0.00025632547,0.0007564533],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998577,0.00019916995,0.0001439707,0.0003879132,0.00037632382,0.0003157618],"domain_scores_gemma":[0.9969817,0.0010364747,0.000218646,0.000815618,0.0006481765,0.00029933001],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013048403,0.004881485,0.0026380233,0.004798374,0.0013037502,0.0046380074,0.005938676,0.004573786,0.27382722],"category_scores_gemma":[0.009869617,0.0014235555,0.002238854,0.008421897,0.0009809854,0.0029520837,0.00326703,0.0026178602,0.31653285],"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.000036843358,0.00002487579,0.00024052856,0.0006571996,0.000018225239,0.000011085934,0.000013482943,0.00032183668,0.000055553242,0.00036376237,0.99686974,0.0013868847],"study_design_scores_gemma":[0.0005652435,0.00004129965,0.0017318906,0.00038795025,0.000027824857,0.00007485663,0.00008637518,0.001072987,0.00062353146,0.003036183,0.99230826,0.000043521683],"about_ca_topic_score_codex":0.018098895,"about_ca_topic_score_gemma":0.026472392,"teacher_disagreement_score":0.7261728,"about_ca_system_score_codex":0.0022889215,"about_ca_system_score_gemma":0.0026951442,"threshold_uncertainty_score":0.91604334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010232463,0.00008164888,0.000069304886,0.000074517615,0.00002790456,0.000009493687,0.9977811,0.00088001805,0.000973748],"genre_scores_gemma":[0.00046581557,0.00009525466,0.0003503777,0.00007214005,0.000013568552,0.000082471655,0.9979254,0.00024355,0.0007513937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986162,0.00019275077,0.00014266722,0.0003806357,0.0003631556,0.00030450913],"domain_scores_gemma":[0.99693775,0.0011018383,0.00022770866,0.0007911506,0.0006517629,0.0002898495],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012660815,0.0047444636,0.0025772892,0.0047979304,0.0012882192,0.004544966,0.0056589,0.0044118683,0.28502968],"category_scores_gemma":[0.009791326,0.0014249051,0.0021754806,0.008628595,0.0009510543,0.0029337225,0.0031551158,0.0025591285,0.3227453],"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.000037124835,0.000024077617,0.00025379003,0.0006904319,0.000018648196,0.00001100526,0.000013583746,0.00032812377,0.000054050273,0.00036561416,0.99683493,0.0013686102],"study_design_scores_gemma":[0.00056494283,0.000039542236,0.0018494044,0.00040601796,0.000028195653,0.00007300121,0.00008617927,0.0009816341,0.00059039815,0.0029109789,0.99242663,0.000043230633],"about_ca_topic_score_codex":0.018680928,"about_ca_topic_score_gemma":0.026863554,"teacher_disagreement_score":0.71497035,"about_ca_system_score_codex":0.0022944948,"about_ca_system_score_gemma":0.0027193723,"threshold_uncertainty_score":0.9535193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010603154,0.00008632611,0.00007040163,0.00007848591,0.000028751545,0.000009826718,0.997721,0.00091727305,0.0009818607],"genre_scores_gemma":[0.0004802924,0.000098677825,0.00035950888,0.000075874894,0.000014222642,0.00008362371,0.9978886,0.00024561037,0.0007535719],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986082,0.0001932493,0.00014233122,0.0003814681,0.0003673731,0.00030733985],"domain_scores_gemma":[0.9969453,0.0010925763,0.00022834234,0.00078675733,0.0006473732,0.0002996838],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012921059,0.0047658724,0.0026413274,0.0048623984,0.00127141,0.004687739,0.0058245882,0.0045194104,0.2883193],"category_scores_gemma":[0.009942317,0.0014204538,0.0021822015,0.008722711,0.0009764517,0.0029769624,0.003269346,0.0025811717,0.32217544],"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.000036930287,0.000024627609,0.00025395484,0.0007050971,0.00001882462,0.000011186957,0.000013926416,0.00032846085,0.000054207594,0.00037712636,0.996788,0.0013876925],"study_design_scores_gemma":[0.0005764583,0.00004148349,0.0018471796,0.0004159348,0.00002820639,0.0000749576,0.0000884442,0.0010411522,0.00058903394,0.0030230926,0.99223,0.000043991524],"about_ca_topic_score_codex":0.018078132,"about_ca_topic_score_gemma":0.025838442,"teacher_disagreement_score":0.7116807,"about_ca_system_score_codex":0.0023374232,"about_ca_system_score_gemma":0.002690272,"threshold_uncertainty_score":0.9645241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009694732,0.000069730384,0.00006697909,0.00007391565,0.00002657459,0.000009791323,0.9977964,0.00091972505,0.0009399917],"genre_scores_gemma":[0.00048895914,0.000087900036,0.0003420697,0.00007048042,0.000014159787,0.000088554225,0.9979017,0.0002611169,0.000745041],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985285,0.00019651999,0.00015601439,0.0004112902,0.00038758558,0.00032009388],"domain_scores_gemma":[0.996546,0.0012089231,0.00025939057,0.00094854616,0.00070623675,0.0003309989],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012831667,0.004787148,0.0026559643,0.0047244616,0.001353566,0.004825055,0.0058194795,0.0046010716,0.31389835],"category_scores_gemma":[0.011066586,0.0014841513,0.0021283075,0.009196948,0.0010124366,0.0032231063,0.0033684082,0.0027854089,0.36578766],"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.00003875572,0.000024429919,0.00023839243,0.0006731806,0.000016292905,0.000010612031,0.00001324091,0.000298795,0.00005628441,0.0003338975,0.99687827,0.0014179402],"study_design_scores_gemma":[0.0006416744,0.000049342925,0.0019927716,0.0004134087,0.000027981783,0.000083286555,0.0000947916,0.0010806257,0.0007078821,0.0030508353,0.99181163,0.000045642755],"about_ca_topic_score_codex":0.01632781,"about_ca_topic_score_gemma":0.020770917,"teacher_disagreement_score":0.6861017,"about_ca_system_score_codex":0.0022900344,"about_ca_system_score_gemma":0.0027969144,"threshold_uncertainty_score":0.97864074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001186991,0.00009028877,0.00007608814,0.00007588813,0.000029902783,0.000010768914,0.99752516,0.0010259824,0.0010471818],"genre_scores_gemma":[0.0004831653,0.00009647444,0.0003646784,0.00007136839,0.00001338855,0.000083698156,0.99788576,0.00025110395,0.00075030193],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985997,0.00019804825,0.00014201435,0.000384056,0.00036886486,0.00030731878],"domain_scores_gemma":[0.9970794,0.0010146492,0.00021278774,0.0007990132,0.00061290956,0.00028120843],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012895132,0.004853144,0.002656591,0.004783905,0.0013011129,0.0045247427,0.0058688624,0.004459054,0.2711903],"category_scores_gemma":[0.009460863,0.0014179967,0.0021777549,0.008584183,0.0009982574,0.0029228313,0.003176967,0.002584465,0.3169129],"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.000037496775,0.000025892632,0.0002444894,0.0006667829,0.00001850186,0.0000111771815,0.000013430333,0.00033505782,0.000058842485,0.0003591464,0.9968141,0.001415262],"study_design_scores_gemma":[0.0005788013,0.00004346557,0.0018397935,0.0003996061,0.00002882592,0.0000779852,0.000089439294,0.0011203921,0.00068040076,0.00298498,0.99211156,0.00004477288],"about_ca_topic_score_codex":0.017889835,"about_ca_topic_score_gemma":0.025703251,"teacher_disagreement_score":0.7288097,"about_ca_system_score_codex":0.0022763538,"about_ca_system_score_gemma":0.0026271758,"threshold_uncertainty_score":0.9072219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001172808,0.00009082659,0.00007730651,0.00008134129,0.000031575993,0.0000109461425,0.99753124,0.0010341686,0.0010253675],"genre_scores_gemma":[0.00049105065,0.00009581969,0.00037592786,0.00007477762,0.000014269354,0.00008544435,0.99785465,0.00025278516,0.0007552359],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998618,0.0001938306,0.0001407741,0.00038137397,0.00036135252,0.00030469534],"domain_scores_gemma":[0.9970439,0.0010151789,0.0002183019,0.0008124397,0.00062113954,0.00028894088],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012675746,0.0048843767,0.0026615607,0.00467774,0.0012888022,0.0045672236,0.0059047285,0.004610563,0.26882654],"category_scores_gemma":[0.009622476,0.0014361324,0.0022435542,0.008356743,0.000990538,0.0029023367,0.0032142652,0.0026199329,0.3149544],"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.00003744417,0.000025364669,0.00024933837,0.00066308776,0.000018761702,0.000011181787,0.000013171483,0.0003371374,0.000055927656,0.00035215486,0.9968369,0.0013994453],"study_design_scores_gemma":[0.0005965729,0.00004364091,0.0018392875,0.00039821598,0.000029679284,0.0000793016,0.00008830297,0.0011390836,0.0006618799,0.0031419152,0.99193704,0.000045187797],"about_ca_topic_score_codex":0.017707612,"about_ca_topic_score_gemma":0.025832959,"teacher_disagreement_score":0.73117346,"about_ca_system_score_codex":0.0022586626,"about_ca_system_score_gemma":0.0026335807,"threshold_uncertainty_score":0.8993144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010508392,0.00008687031,0.000069739785,0.00007419782,0.000026844777,0.000009466161,0.9977653,0.0008859314,0.0009766459],"genre_scores_gemma":[0.00047630037,0.0001012325,0.0003522709,0.00007213967,0.000013405418,0.00008100647,0.9979221,0.000244353,0.00073730253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862146,0.00019224417,0.000141555,0.0003744685,0.00036849527,0.00030188236],"domain_scores_gemma":[0.9969512,0.0011173482,0.00022658681,0.0007752417,0.00064213,0.00028737268],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012623816,0.0047495905,0.0025908758,0.004856067,0.0012827403,0.004514481,0.0056075286,0.0044094184,0.28215435],"category_scores_gemma":[0.00969,0.0014322761,0.0021545035,0.008765215,0.0009686683,0.0029429665,0.0031451464,0.0025557629,0.3172014],"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.00003724899,0.000024552994,0.00026193482,0.0007224056,0.000018997527,0.00001125109,0.000014042232,0.00034991736,0.00005586448,0.0003828944,0.9967141,0.0014066626],"study_design_scores_gemma":[0.00057642435,0.000041193798,0.00192685,0.00041765659,0.000028719644,0.00007596581,0.000088709836,0.0010559092,0.00060790556,0.002987895,0.9921484,0.00004435012],"about_ca_topic_score_codex":0.019106789,"about_ca_topic_score_gemma":0.027239311,"teacher_disagreement_score":0.7178457,"about_ca_system_score_codex":0.0023517858,"about_ca_system_score_gemma":0.002741028,"threshold_uncertainty_score":0.94390035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121304256,0.00009385241,0.00007630249,0.00007937337,0.000030120442,0.000010637616,0.99759823,0.0009807339,0.0010093319],"genre_scores_gemma":[0.0004917558,0.00009803913,0.0003680721,0.00007136322,0.000013602942,0.000082368155,0.9978962,0.00023614262,0.0007424466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986041,0.0001948595,0.00014113172,0.0003824929,0.00037332062,0.00030407423],"domain_scores_gemma":[0.9970907,0.0010199072,0.00021427692,0.000782491,0.00061676773,0.0002757543],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012763821,0.0048158113,0.0026167165,0.0047872434,0.0012935706,0.004496721,0.0058473623,0.0046014884,0.26314914],"category_scores_gemma":[0.009407798,0.0014295309,0.0021954242,0.008639444,0.0010001546,0.0028640875,0.0031020378,0.002582611,0.30801046],"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.000037504575,0.000026043228,0.00026142955,0.0006827609,0.000019098987,0.000011761989,0.000013552176,0.00036328778,0.000057696117,0.00036216888,0.9967096,0.0014551308],"study_design_scores_gemma":[0.00058582524,0.000043974593,0.001929393,0.00040256168,0.00002910246,0.00008241684,0.00009088879,0.0011718437,0.00066826463,0.0029405495,0.9920099,0.0000452382],"about_ca_topic_score_codex":0.018197328,"about_ca_topic_score_gemma":0.026064955,"teacher_disagreement_score":0.73685086,"about_ca_system_score_codex":0.0022947153,"about_ca_system_score_gemma":0.00262045,"threshold_uncertainty_score":0.88032156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051507335,0.00012791157,0.98981655,0.00010043744,0.000032221353,0.00009290769,0.00012259267,0.001586934,0.0029696515],"genre_scores_gemma":[0.057137255,0.000117152755,0.9390661,0.00011028818,0.000018453498,0.00031605747,0.0005782538,0.00033575983,0.0023207443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995962,0.00010983336,0.000022283251,0.00009541122,0.00013291143,0.000043430013],"domain_scores_gemma":[0.999424,0.0003422026,0.00003794141,0.00006304327,0.000106502215,0.000026400594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071718346,0.0014091765,0.000785475,0.0011219077,0.00065295433,0.0010678209,0.0015903572,0.0014110531,0.009367715],"category_scores_gemma":[0.0023411447,0.0006719256,0.00086387777,0.0010605054,0.0005048463,0.0010507952,0.0014327494,0.0016054123,0.0023180952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008661142,0.000113008704,0.000985482,0.00017579849,0.000039991668,0.000107616266,0.000117039825,0.6506339,0.0042892857,0.013314673,0.010892299,0.31924435],"study_design_scores_gemma":[0.000021202497,0.00002286761,0.00007461315,0.000012712493,0.0000050211966,0.000038620477,0.000020010966,0.99018097,0.0008416424,0.0045853574,0.0041913916,0.000005634634],"about_ca_topic_score_codex":0.00318669,"about_ca_topic_score_gemma":0.0043587424,"teacher_disagreement_score":0.009367715,"about_ca_system_score_codex":0.0006276461,"about_ca_system_score_gemma":0.0012036344,"threshold_uncertainty_score":0.031338096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023751747,0.00033462673,0.9722012,0.00014305169,0.000091222326,0.00008709286,0.00004511954,0.0011361788,0.0022097311],"genre_scores_gemma":[0.5025393,0.0003147401,0.49263403,0.00015195948,0.00007385304,0.00017843222,0.00022636111,0.00019400635,0.0036874162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882513,0.0002955906,0.0000813985,0.00020370955,0.00036853543,0.00022559217],"domain_scores_gemma":[0.99904805,0.00029728966,0.000120188066,0.00014253127,0.00029491456,0.00009712041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009848272,0.0006121216,0.0009793306,0.0006664431,0.0005278239,0.0007419724,0.0011109224,0.000619727,0.002346519],"category_scores_gemma":[0.0023137575,0.0003905037,0.000688869,0.001049682,0.00045105472,0.0010174357,0.00084889086,0.00065035175,0.0006468426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063375774,0.00016205278,0.000745868,0.00016138867,0.000057950347,0.0001672878,0.000110094144,0.7625993,0.012887179,0.017521799,0.005227545,0.1997258],"study_design_scores_gemma":[0.00005342978,0.000105575986,0.00012305286,0.0000043235154,0.000009427877,0.000057458234,0.000011566312,0.9931559,0.0025387907,0.0024258762,0.0015028273,0.000011752646],"about_ca_topic_score_codex":0.003945954,"about_ca_topic_score_gemma":0.0032948519,"teacher_disagreement_score":0.003945954,"about_ca_system_score_codex":0.0007257841,"about_ca_system_score_gemma":0.0024322926,"threshold_uncertainty_score":0.007849872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033706564,0.010834855,0.02254871,0.061023973,0.0017707922,0.00004010472,0.00027777703,0.00034530234,0.89978784],"genre_scores_gemma":[0.1430621,0.012990077,0.023250012,0.023685772,0.0018941769,0.00019550382,0.00042921372,0.00089318573,0.7936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975172,0.00057975756,0.000064151245,0.00048255708,0.0010539311,0.0003023981],"domain_scores_gemma":[0.99826956,0.0006604138,0.00008116832,0.000342272,0.0005157594,0.00013083903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017496004,0.00085372303,0.00069148553,0.0017921355,0.006529217,0.007609952,0.0024952248,0.0038258375,0.025398929],"category_scores_gemma":[0.008142197,0.00058613205,0.00065768533,0.0023633894,0.013921625,0.007850642,0.0029810937,0.0071361777,0.008769397],"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.0000074049453,0.0000060786306,0.000040086226,0.000028857,0.0000017233103,0.000028584092,0.0003768041,0.0004612306,0.000035689558,0.9090646,0.078177,0.011771968],"study_design_scores_gemma":[0.0000059404297,0.000007456378,0.000082307306,0.00010126308,0.0000023213527,0.00010030933,0.0006928832,0.0012113573,0.00012875366,0.27962625,0.71802664,0.000014478157],"about_ca_topic_score_codex":0.10484273,"about_ca_topic_score_gemma":0.12896022,"teacher_disagreement_score":0.10484273,"about_ca_system_score_codex":0.015091151,"about_ca_system_score_gemma":0.011596761,"threshold_uncertainty_score":0.20846492},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011704382,0.0044803536,0.981794,0.0001847767,0.00022471875,0.00005647503,0.000109452456,0.0001692761,0.011810611],"genre_scores_gemma":[0.040664308,0.011417493,0.9161699,0.00023452267,0.00031121544,0.00029592178,0.0005381543,0.0004282303,0.029940391],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990802,0.0002989505,0.000040779294,0.00010663527,0.00041559472,0.000057891946],"domain_scores_gemma":[0.99942255,0.00031689627,0.000028754279,0.000065429675,0.00015006885,0.000016376634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011798987,0.001564388,0.0012357368,0.001413544,0.00070971163,0.0019155444,0.0019754807,0.0010302396,0.01072552],"category_scores_gemma":[0.0021931827,0.001168905,0.001374258,0.005744552,0.00072925934,0.0028192515,0.0010385632,0.0028262604,0.00305827],"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.000049640523,0.00012435146,0.0001611943,0.00066454336,0.0000929237,0.00005061187,0.00011959402,0.24869317,0.0024221395,0.2086282,0.025783349,0.51321024],"study_design_scores_gemma":[0.000016328147,0.00005758965,0.00027081982,0.00019544258,0.000040632913,0.00011478601,0.0000688161,0.7062724,0.002260564,0.22420691,0.066466235,0.000029472993],"about_ca_topic_score_codex":0.003994573,"about_ca_topic_score_gemma":0.006356197,"teacher_disagreement_score":0.01072552,"about_ca_system_score_codex":0.0014564977,"about_ca_system_score_gemma":0.00091926195,"threshold_uncertainty_score":0.035880446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025821209,0.0022208295,0.9616615,0.0008411065,0.00016853749,0.00018982947,0.00039418225,0.000832043,0.007870847],"genre_scores_gemma":[0.36407268,0.0021014789,0.62498426,0.0006305589,0.00030012403,0.00056226156,0.0015091092,0.00037895187,0.005460603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802065,0.0006921573,0.00008213713,0.00038693947,0.0004364465,0.00038172133],"domain_scores_gemma":[0.99623483,0.0027509334,0.0002759836,0.00036203468,0.00020825105,0.00016789822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024286,0.0020002734,0.0025707202,0.0012863587,0.00091321167,0.0027739925,0.0030465876,0.0019599353,0.00726098],"category_scores_gemma":[0.00868264,0.0007815902,0.0014197194,0.0030914918,0.0010220697,0.003938049,0.0020927736,0.0037628228,0.0012389366],"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.0004612935,0.0004169369,0.000999889,0.0005233113,0.00017452055,0.00015550642,0.00021494666,0.73463964,0.0015028185,0.09283552,0.014521271,0.15355428],"study_design_scores_gemma":[0.000061991705,0.00008801779,0.00010677357,0.00003511639,0.00002471548,0.000084248444,0.000057689354,0.93309253,0.00032669905,0.06453324,0.0015771837,0.000011840625],"about_ca_topic_score_codex":0.0031564238,"about_ca_topic_score_gemma":0.00345585,"teacher_disagreement_score":0.00726098,"about_ca_system_score_codex":0.0024576283,"about_ca_system_score_gemma":0.0019606554,"threshold_uncertainty_score":0.024290383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65979654,0.0025570474,0.3097714,0.00037819427,0.0000736207,0.00010055322,0.00045850078,0.00034521028,0.026518954],"genre_scores_gemma":[0.95207316,0.0016852288,0.04325757,0.00009139734,0.00007550344,0.00010844763,0.0004068821,0.00009843055,0.0022033653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985378,0.00027417275,0.00009565349,0.00020141085,0.0004935454,0.00039737095],"domain_scores_gemma":[0.9955721,0.0022970943,0.00078476075,0.00049393426,0.00040678817,0.00044527976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015326199,0.0010016713,0.0012992888,0.0021227703,0.0012201233,0.0025955737,0.0012524984,0.0006412355,0.0033022857],"category_scores_gemma":[0.0107649295,0.00095826574,0.000558046,0.0020712554,0.0023413172,0.003917342,0.002375418,0.00115929,0.00059600803],"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.000968174,0.000215603,0.0035429434,0.00033619095,0.000058456335,0.0003161995,0.0007625696,0.21433498,0.01326159,0.70466644,0.0040719495,0.05746481],"study_design_scores_gemma":[0.0000653086,0.00022563552,0.0024624928,0.0000954345,0.00002445096,0.00025209648,0.00054079056,0.60429406,0.008296385,0.3792673,0.004416351,0.00005959087],"about_ca_topic_score_codex":0.0028976488,"about_ca_topic_score_gemma":0.0013736273,"teacher_disagreement_score":0.0033022857,"about_ca_system_score_codex":0.0022633031,"about_ca_system_score_gemma":0.0005909894,"threshold_uncertainty_score":0.016421497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17941181,0.00024272568,0.7707811,0.00044012823,0.00014073859,0.0001254195,0.0002867529,0.0005208329,0.0480505],"genre_scores_gemma":[0.49345082,0.00032053396,0.49477416,0.00016670907,0.000046422574,0.00022069614,0.00048329373,0.00026659665,0.010270814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998995,0.00021203491,0.000063480176,0.00019679997,0.00032012677,0.00021262882],"domain_scores_gemma":[0.99897027,0.00029038644,0.00014311277,0.00031694083,0.00016841752,0.00011091683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047216058,0.00061333826,0.00078199175,0.00053153146,0.0007793988,0.0013537826,0.0011046723,0.0005677068,0.010423177],"category_scores_gemma":[0.002066049,0.00033145965,0.0006612713,0.0007905,0.0011351872,0.0020253959,0.0020049957,0.0011943125,0.0025087309],"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.0011232749,0.00029438082,0.0025465337,0.00048157625,0.000084575906,0.0005253865,0.0007712082,0.28056103,0.056597114,0.43878832,0.012535875,0.2056907],"study_design_scores_gemma":[0.00015391601,0.0005317976,0.0014003933,0.000116211944,0.000047957863,0.0007307546,0.00083320757,0.6165235,0.05571097,0.25366607,0.07015499,0.00013024197],"about_ca_topic_score_codex":0.0015040581,"about_ca_topic_score_gemma":0.0012738949,"teacher_disagreement_score":0.010423177,"about_ca_system_score_codex":0.00041090063,"about_ca_system_score_gemma":0.00070556457,"threshold_uncertainty_score":0.034869015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050566822,0.00040091874,0.9440976,0.0003415786,0.000120901466,0.00012474654,0.000043114254,0.0004271345,0.0038771743],"genre_scores_gemma":[0.7099986,0.00021513812,0.28499785,0.00034010477,0.000067981586,0.00035344347,0.00010572895,0.00011016415,0.0038109603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948454,0.00017572303,0.000019905185,0.000089684836,0.00013427384,0.00009582814],"domain_scores_gemma":[0.99821496,0.0011324948,0.00014677538,0.00009485644,0.00027610394,0.00013492712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015593346,0.00078307564,0.0016282232,0.00074758334,0.000473042,0.0008290732,0.002437318,0.00258982,0.003194684],"category_scores_gemma":[0.0046076076,0.0006325042,0.0006006569,0.00079560705,0.0010649672,0.0009993194,0.0014618107,0.001433326,0.00042866712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095059106,0.00007740156,0.00041362678,0.000036424226,0.000039180562,0.000046394962,0.000036977577,0.9639159,0.00081905804,0.0058459733,0.0006760268,0.02799791],"study_design_scores_gemma":[0.00002797056,0.000028631759,0.000035178527,0.0000033328774,0.0000050445888,0.0000071871273,0.0000024168614,0.99869895,0.000069316186,0.0010281241,0.000090669826,0.0000030461274],"about_ca_topic_score_codex":0.006207081,"about_ca_topic_score_gemma":0.005391838,"teacher_disagreement_score":0.006207081,"about_ca_system_score_codex":0.0012107147,"about_ca_system_score_gemma":0.001942402,"threshold_uncertainty_score":0.012341917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00871206,0.002293998,0.9141945,0.002098006,0.0005203282,0.000055600503,0.0002827294,0.00015274988,0.07169],"genre_scores_gemma":[0.42484105,0.009365339,0.45739946,0.0025383781,0.0023925558,0.00035170725,0.00091953645,0.00080450025,0.10138755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990728,0.00038204467,0.00004524878,0.00014792143,0.00027962716,0.000072277086],"domain_scores_gemma":[0.9989203,0.0005473336,0.00012114098,0.00014120522,0.00021934397,0.00005071365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018764971,0.0012718169,0.00090301904,0.0014288499,0.0011037434,0.0021177046,0.002269673,0.0011859626,0.015327411],"category_scores_gemma":[0.005489894,0.000792839,0.0013279465,0.0025283645,0.0021730566,0.0049934257,0.0021733472,0.0031384588,0.002840621],"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.00002437198,0.00006304007,0.00015112219,0.00021551266,0.000019021834,0.00008779048,0.00014582704,0.07817558,0.0006657663,0.8855823,0.008311773,0.026557766],"study_design_scores_gemma":[0.000010506421,0.000033422246,0.00016587846,0.00006428768,0.000012154082,0.00006352986,0.00008862997,0.20747876,0.0006810892,0.77394,0.01743358,0.000028133565],"about_ca_topic_score_codex":0.0041756956,"about_ca_topic_score_gemma":0.004352264,"teacher_disagreement_score":0.015327411,"about_ca_system_score_codex":0.001546762,"about_ca_system_score_gemma":0.0010901121,"threshold_uncertainty_score":0.051275313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.162422,0.0017437432,0.7999234,0.0035882755,0.00043219322,0.00052278227,0.001257889,0.0063205524,0.023789192],"genre_scores_gemma":[0.542621,0.00047717206,0.44077864,0.00086146506,0.00039046464,0.0007293763,0.002048841,0.0018739301,0.010219208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617165,0.0013840452,0.00022252162,0.0009909336,0.0006507849,0.0005800753],"domain_scores_gemma":[0.973693,0.022191454,0.0010929711,0.0016594767,0.00073410734,0.0006289017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004577176,0.002353039,0.0038791827,0.00158273,0.0016957087,0.004260496,0.00376231,0.0036268958,0.019662473],"category_scores_gemma":[0.025471512,0.0021695574,0.0022483177,0.0029303827,0.0025857599,0.0072069108,0.0034535152,0.005469798,0.0029488588],"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.0026210283,0.00089664385,0.001861706,0.00081328116,0.00021701328,0.00013536458,0.00019571572,0.82379335,0.003011957,0.027718397,0.015623079,0.12311239],"study_design_scores_gemma":[0.00027195088,0.00011185744,0.00020326846,0.000024257077,0.00004402563,0.000023105024,0.000048699454,0.9707581,0.00078131276,0.027206236,0.0005153989,0.0000118441185],"about_ca_topic_score_codex":0.0063806195,"about_ca_topic_score_gemma":0.013599908,"teacher_disagreement_score":0.019662473,"about_ca_system_score_codex":0.0030803648,"about_ca_system_score_gemma":0.00392799,"threshold_uncertainty_score":0.06577754},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04582489,0.00092611444,0.93978906,0.00093421957,0.00015463911,0.00025479004,0.00060884695,0.0024429972,0.009064383],"genre_scores_gemma":[0.4121616,0.00067743304,0.57715577,0.0006139453,0.00015071758,0.0005661045,0.0022527692,0.00067544874,0.0057461094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978294,0.00055685657,0.00011652218,0.00064005505,0.00039808344,0.00045899596],"domain_scores_gemma":[0.99641466,0.0018687308,0.00040118909,0.000834777,0.00024212559,0.0002385212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001813482,0.0027185993,0.002080931,0.00092687353,0.0009663809,0.002318854,0.004838195,0.0021344074,0.0076385117],"category_scores_gemma":[0.007856138,0.00097373716,0.0017075993,0.0028252595,0.0012830188,0.003970689,0.0033101204,0.003804525,0.0019051045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064574875,0.0005070225,0.0014472503,0.00043266904,0.00014306689,0.00013207305,0.00022505691,0.82195604,0.002211142,0.05153408,0.012303011,0.10846286],"study_design_scores_gemma":[0.00006875014,0.000053108768,0.00013598916,0.000016588372,0.000021485606,0.000038016708,0.000044782373,0.970403,0.0004304913,0.027647836,0.0011303951,0.000009504884],"about_ca_topic_score_codex":0.0065599843,"about_ca_topic_score_gemma":0.008950881,"teacher_disagreement_score":0.0076385117,"about_ca_system_score_codex":0.0027139243,"about_ca_system_score_gemma":0.0029311741,"threshold_uncertainty_score":0.025553346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026467029,0.004711103,0.9164917,0.0021878555,0.00052281277,0.00018163638,0.00074670464,0.00066483056,0.04802631],"genre_scores_gemma":[0.61752576,0.008048207,0.33879504,0.0015012007,0.0012821953,0.00085178355,0.0021903554,0.0011211181,0.028684271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902222,0.0027906187,0.00034871438,0.0012057392,0.003521921,0.0019107563],"domain_scores_gemma":[0.96142906,0.03199057,0.0013231939,0.0022960543,0.0017495501,0.0012116405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059914486,0.0029621571,0.0031481453,0.0036342216,0.0017882668,0.009792708,0.004050433,0.0033531634,0.017094946],"category_scores_gemma":[0.042436708,0.002046385,0.0022425884,0.0059694974,0.0031694649,0.011238445,0.006362467,0.010459981,0.003583953],"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.00046521134,0.00043939851,0.0006338493,0.00066631136,0.0000911929,0.000105322564,0.0002720586,0.38632607,0.002484327,0.5148417,0.014217293,0.079457365],"study_design_scores_gemma":[0.000041737367,0.000066541485,0.00023202812,0.0001597147,0.000037492428,0.0000534711,0.00004896346,0.45221832,0.0012832246,0.5404969,0.0053244177,0.000037186754],"about_ca_topic_score_codex":0.0035102458,"about_ca_topic_score_gemma":0.00417704,"teacher_disagreement_score":0.017094946,"about_ca_system_score_codex":0.0048896912,"about_ca_system_score_gemma":0.0029685237,"threshold_uncertainty_score":0.057188272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24319004,0.009205233,0.5525436,0.005101473,0.001564011,0.00026244335,0.0013011078,0.0015134003,0.18531871],"genre_scores_gemma":[0.8522373,0.0031038385,0.12525378,0.0008855253,0.0008207245,0.00026062966,0.0009309132,0.00082347053,0.015683986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779105,0.0005321023,0.00006640093,0.00043567063,0.0007004456,0.00047431665],"domain_scores_gemma":[0.9897021,0.0063759075,0.0005357385,0.0015295822,0.0011141476,0.0007425986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001963424,0.0015868647,0.0015564738,0.0025568886,0.0014396056,0.002132912,0.0026001427,0.0013572294,0.008158123],"category_scores_gemma":[0.014584874,0.000705372,0.00097384205,0.0017874525,0.002239979,0.006026768,0.003468966,0.0046572667,0.0018248404],"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.001482738,0.00042453635,0.004855532,0.0008156709,0.00016220655,0.0010065105,0.00056005944,0.14484625,0.032566644,0.6440611,0.047232367,0.12198643],"study_design_scores_gemma":[0.000060527786,0.00026502556,0.0032603831,0.00022944363,0.000098983524,0.0006091334,0.0001817919,0.46514922,0.022593584,0.47085407,0.03659304,0.000104729355],"about_ca_topic_score_codex":0.0017924987,"about_ca_topic_score_gemma":0.0021075476,"teacher_disagreement_score":0.008158123,"about_ca_system_score_codex":0.0017148139,"about_ca_system_score_gemma":0.0006419998,"threshold_uncertainty_score":0.027291596},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010662973,0.0025089192,0.9727386,0.0006328646,0.00014372825,0.00010109325,0.00014809663,0.0002727855,0.012790949],"genre_scores_gemma":[0.30119413,0.0049399803,0.6822858,0.00066489185,0.00034420032,0.0005463123,0.0006434048,0.00040931985,0.008971962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993932,0.00021150231,0.000029989484,0.00012121846,0.00017491536,0.00006914082],"domain_scores_gemma":[0.99875665,0.00081386487,0.00015162988,0.00013532802,0.000095685224,0.00004674091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010476406,0.0015077529,0.0010774123,0.0007240346,0.00054932415,0.0013130021,0.001728625,0.0013150626,0.0040623094],"category_scores_gemma":[0.00473416,0.0006081527,0.00085451454,0.0012745576,0.001507806,0.0016277706,0.0013673693,0.0017946963,0.00082116754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030941104,0.00004412434,0.00044857492,0.00025705135,0.000038466304,0.00006280431,0.000052485375,0.89308834,0.0006682345,0.07173731,0.0031870124,0.030384662],"study_design_scores_gemma":[0.000010592152,0.000020510603,0.00008990305,0.000035108165,0.000009097915,0.00003061987,0.000020967422,0.95608634,0.00029335052,0.039629135,0.0037662764,0.000008081573],"about_ca_topic_score_codex":0.0038269751,"about_ca_topic_score_gemma":0.004362711,"teacher_disagreement_score":0.0040623094,"about_ca_system_score_codex":0.0012618275,"about_ca_system_score_gemma":0.0012677846,"threshold_uncertainty_score":0.01358974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028009217,0.00041012172,0.9672531,0.00019886642,0.000053867625,0.00006329628,0.000034790268,0.00026331103,0.0037134455],"genre_scores_gemma":[0.64577526,0.0005999649,0.34752542,0.000258916,0.0000704359,0.000458411,0.0002919249,0.000102805,0.0049168714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995474,0.000120333614,0.000022867527,0.00009610865,0.00012909654,0.00008422042],"domain_scores_gemma":[0.9993555,0.00039155086,0.0000626246,0.000025068106,0.00013492165,0.000030248177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087386917,0.0009563108,0.0012102765,0.000987951,0.00054354244,0.0008990356,0.0014315955,0.0014824303,0.001802588],"category_scores_gemma":[0.0020355792,0.00049735163,0.0008554808,0.001026746,0.00057176047,0.0007548756,0.00079290813,0.0012143077,0.00027134936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023713326,0.00002995134,0.0004811975,0.000031833235,0.000025711059,0.000042841202,0.000042289706,0.96830744,0.0008096774,0.002850914,0.0005230864,0.02683127],"study_design_scores_gemma":[0.0000101096175,0.000012961658,0.00006331196,0.0000026172697,0.000003822798,0.000008194165,0.00000494721,0.9989796,0.0000868373,0.000637546,0.00018739226,0.0000026591094],"about_ca_topic_score_codex":0.012654871,"about_ca_topic_score_gemma":0.007252148,"teacher_disagreement_score":0.012654871,"about_ca_system_score_codex":0.00078098197,"about_ca_system_score_gemma":0.0016097242,"threshold_uncertainty_score":0.025162399},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3414328,0.0025752864,0.60047853,0.0011693836,0.0002386036,0.00027520748,0.00065409474,0.0018251966,0.051350795],"genre_scores_gemma":[0.75221443,0.0016134977,0.23073286,0.000494408,0.0002535354,0.0006948517,0.000782441,0.0002797602,0.012934184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982912,0.00034155798,0.0001444355,0.0003668043,0.00048484426,0.00037113726],"domain_scores_gemma":[0.9945914,0.0027042162,0.00091082003,0.0010893596,0.0004194924,0.0002847358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012397629,0.00076769135,0.0008326275,0.0007446848,0.0007833481,0.0016149676,0.0008771991,0.0010334207,0.005077425],"category_scores_gemma":[0.00691527,0.0008651534,0.00057763734,0.0012505756,0.0011903147,0.0035181772,0.0017777358,0.0012259311,0.0014293016],"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.0013189252,0.00038870776,0.0035915105,0.0010153978,0.00011401067,0.0006673284,0.0008020357,0.22938958,0.089081615,0.4656705,0.014604721,0.19335577],"study_design_scores_gemma":[0.00026176305,0.0013350595,0.0014727542,0.00023244813,0.000096317264,0.0011762975,0.00020906482,0.505978,0.05107266,0.40509045,0.032975998,0.00009918922],"about_ca_topic_score_codex":0.00053233205,"about_ca_topic_score_gemma":0.00077171746,"teacher_disagreement_score":0.005077425,"about_ca_system_score_codex":0.0011662913,"about_ca_system_score_gemma":0.0011895008,"threshold_uncertainty_score":0.016985655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031851,0.0030091573,0.46570122,0.0023868927,0.00035558172,0.00021545752,0.0005051773,0.00034323926,0.024298085],"genre_scores_gemma":[0.92115563,0.0008979006,0.07267256,0.00040017636,0.00021071667,0.000102940634,0.00016288421,0.00012397463,0.00427316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649674,0.0004939604,0.00013823168,0.00063999713,0.0006962863,0.0015348519],"domain_scores_gemma":[0.9943304,0.0029446804,0.0007308523,0.00084166485,0.0004508047,0.0007015512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022812758,0.0010748069,0.0019348199,0.0011259109,0.0016557699,0.0027743736,0.0029890311,0.0022245243,0.0034141499],"category_scores_gemma":[0.01216126,0.00062992756,0.00146556,0.0019752665,0.001887042,0.0052026385,0.0021440866,0.0021502308,0.0005127853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023495955,0.00079478126,0.008061782,0.0005482835,0.00014910132,0.0022872582,0.00053327554,0.6508726,0.019632602,0.24916121,0.007154963,0.058454536],"study_design_scores_gemma":[0.000085181484,0.00012608207,0.0015324197,0.00002409522,0.000027288881,0.0007150434,0.00015223361,0.9552776,0.0035402684,0.03619402,0.002285207,0.000040482795],"about_ca_topic_score_codex":0.009958232,"about_ca_topic_score_gemma":0.005673754,"teacher_disagreement_score":0.009958232,"about_ca_system_score_codex":0.0022295902,"about_ca_system_score_gemma":0.0018831751,"threshold_uncertainty_score":0.019800544},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002672468,0.00020572194,0.98635244,0.00019396486,0.000071373375,0.00008995377,0.00022215012,0.003522506,0.006669444],"genre_scores_gemma":[0.037286002,0.00018939673,0.94518614,0.00021155045,0.00005173505,0.00055439933,0.0006646622,0.0014641231,0.014392044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916255,0.00021542898,0.000027754206,0.00014001451,0.0003557298,0.00009853082],"domain_scores_gemma":[0.9986546,0.0008338187,0.00008587783,0.00012520676,0.00024710453,0.00005333354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015420017,0.0019089443,0.0018772475,0.0011742488,0.000852116,0.0013987315,0.002612773,0.0023438882,0.02008452],"category_scores_gemma":[0.00384342,0.0010074021,0.00094239507,0.0012699069,0.0010591969,0.0015013961,0.0022061698,0.0027117764,0.005379483],"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.0002793173,0.00015950346,0.0008516507,0.00052486797,0.0001357124,0.0002311425,0.0001532171,0.5474218,0.0027825513,0.06659618,0.038433485,0.34243053],"study_design_scores_gemma":[0.000054969543,0.000031678144,0.00010427995,0.000033635966,0.000008490064,0.000053622844,0.000017990513,0.974177,0.001676777,0.011098564,0.012729979,0.000013036641],"about_ca_topic_score_codex":0.012742081,"about_ca_topic_score_gemma":0.015017901,"teacher_disagreement_score":0.02008452,"about_ca_system_score_codex":0.0016584505,"about_ca_system_score_gemma":0.0023913702,"threshold_uncertainty_score":0.067189455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03660266,0.0019206224,0.9561078,0.0005589103,0.0001537271,0.00013190774,0.00013167561,0.0010851526,0.0033075442],"genre_scores_gemma":[0.5020856,0.0011879927,0.48942256,0.0005485132,0.00024365661,0.00050584326,0.0008163892,0.0003909394,0.0047983737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894613,0.00037655717,0.000061950406,0.00018814235,0.00022050594,0.00020666528],"domain_scores_gemma":[0.9963341,0.0027096597,0.00020515239,0.0001372796,0.000404549,0.0002093158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022440667,0.0016610491,0.004099314,0.001575329,0.000976816,0.0018091627,0.003494957,0.0029916086,0.005983171],"category_scores_gemma":[0.005469239,0.0013519078,0.0012266231,0.0020866364,0.0011686054,0.0028592462,0.0019516086,0.0035877987,0.00084470876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040200402,0.00031594862,0.00082544493,0.00015325837,0.00008223115,0.000045491808,0.00006595931,0.8436004,0.0006796815,0.011088266,0.00421296,0.13852833],"study_design_scores_gemma":[0.000015425652,0.000026117088,0.00004654911,0.0000069729535,0.000007815641,0.000005123086,0.000006025853,0.997216,0.00008143215,0.0024359992,0.00014949508,0.0000031200148],"about_ca_topic_score_codex":0.012497866,"about_ca_topic_score_gemma":0.010364747,"teacher_disagreement_score":0.012497866,"about_ca_system_score_codex":0.0017909058,"about_ca_system_score_gemma":0.0036508387,"threshold_uncertainty_score":0.02485025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09561698,0.00016534522,0.9004535,0.00006141414,0.000016394439,0.000048701608,0.000080612874,0.00020437747,0.0033526982],"genre_scores_gemma":[0.5488438,0.00015716683,0.44878897,0.000031930194,0.000008417272,0.00013101145,0.00020320877,0.00011228468,0.00172313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970824,0.00013453851,0.000011832249,0.000042046173,0.00005875305,0.00004464418],"domain_scores_gemma":[0.9996848,0.00018108856,0.000038579223,0.00002989482,0.00004106369,0.000024443434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993118,0.00077258056,0.00082427944,0.0006278732,0.00034022852,0.000763041,0.0005611572,0.000687455,0.001253501],"category_scores_gemma":[0.0011783134,0.000542553,0.00081442716,0.0007668351,0.00045657912,0.0007527586,0.0008116103,0.0005087061,0.00022161302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014278775,0.000020251677,0.0003878885,0.0000191765,0.000008641721,0.00002521653,0.000013882452,0.98950034,0.0009013936,0.0013200005,0.000105847,0.007683072],"study_design_scores_gemma":[0.0000022188822,0.000015521533,0.000096395575,0.000002209277,0.0000023695345,0.000006233564,0.000009960647,0.99872965,0.00029408676,0.00070509885,0.0001341942,0.0000021166],"about_ca_topic_score_codex":0.004655558,"about_ca_topic_score_gemma":0.005493936,"teacher_disagreement_score":0.004655558,"about_ca_system_score_codex":0.00041531262,"about_ca_system_score_gemma":0.0009248697,"threshold_uncertainty_score":0.009256959},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40333268,0.0017353348,0.57673246,0.0014788832,0.0004549279,0.00041248996,0.00049691007,0.00061797124,0.014738286],"genre_scores_gemma":[0.8926457,0.00056604756,0.097947575,0.00009495685,0.000119708726,0.00009032728,0.00023029852,0.0002790764,0.00802634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990694,0.00028690728,0.00005256918,0.00013968164,0.00014725376,0.00030437374],"domain_scores_gemma":[0.9982357,0.001069398,0.0001246372,0.00025067007,0.00010467445,0.00021488375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014509554,0.00078099757,0.0024472263,0.00083465676,0.0011952446,0.0024340032,0.001878834,0.0018545196,0.0070012426],"category_scores_gemma":[0.004575995,0.0010754808,0.0014449524,0.0018115495,0.0009840135,0.0034915428,0.001328479,0.0014650758,0.0006740704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062660914,0.0003093084,0.0010524075,0.00023860436,0.00006908874,0.00039351877,0.00007813623,0.93192774,0.0060585383,0.023239363,0.00456802,0.0314386],"study_design_scores_gemma":[0.000023500208,0.000059233418,0.00037029962,0.0000090041995,0.00001456107,0.00008369247,0.000057673195,0.9872422,0.0012143123,0.01033157,0.00058067776,0.000013186646],"about_ca_topic_score_codex":0.0058482387,"about_ca_topic_score_gemma":0.0058785127,"teacher_disagreement_score":0.0070012426,"about_ca_system_score_codex":0.0014635462,"about_ca_system_score_gemma":0.0014375321,"threshold_uncertainty_score":0.023421526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049416434,0.00096960546,0.942886,0.00068862387,0.00018525534,0.00011086941,0.00025763165,0.0012717389,0.004213827],"genre_scores_gemma":[0.7072442,0.00035661465,0.2845176,0.0005478473,0.00014872228,0.00024236488,0.00068756385,0.0002802982,0.0059747756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955183,0.00011241327,0.00002181158,0.00010675197,0.00010744394,0.000099644414],"domain_scores_gemma":[0.9978181,0.0014516241,0.00015011411,0.0001245588,0.00032780966,0.00012782116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087273336,0.0009973376,0.0018217181,0.0005941259,0.0004237708,0.0009365442,0.0017702837,0.0017548266,0.006103787],"category_scores_gemma":[0.0036733882,0.0007192588,0.0006491456,0.00092875026,0.00084605813,0.0014534843,0.0012218335,0.002139741,0.0007019336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018247562,0.00018782039,0.00046871416,0.00014390188,0.000033679575,0.00006927909,0.000039953018,0.8850578,0.0016230871,0.007635967,0.0063277767,0.098229535],"study_design_scores_gemma":[0.000007281111,0.00001166725,0.000016722926,0.0000030138162,0.0000019645477,0.0000036955573,0.0000019053056,0.9981743,0.00014362238,0.0015534488,0.00008061342,0.0000016869869],"about_ca_topic_score_codex":0.008514644,"about_ca_topic_score_gemma":0.009943932,"teacher_disagreement_score":0.008514644,"about_ca_system_score_codex":0.0011123116,"about_ca_system_score_gemma":0.001773297,"threshold_uncertainty_score":0.02041918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03785624,0.001023617,0.9034601,0.002619895,0.00076614355,0.00048310857,0.0010986617,0.0050455052,0.04764672],"genre_scores_gemma":[0.13705279,0.00044690704,0.84083635,0.0007779642,0.00019704337,0.00058064796,0.0025744694,0.0009793709,0.016554566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998367,0.00028312983,0.0000899014,0.00041226076,0.0004843912,0.00036333338],"domain_scores_gemma":[0.99783945,0.0010181915,0.00013067356,0.00046772894,0.00034144052,0.00020253175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015089127,0.0022325942,0.0022494488,0.002052454,0.0016198439,0.0034873146,0.005440091,0.0033493713,0.027401846],"category_scores_gemma":[0.0067400015,0.0011138651,0.0023659663,0.003912234,0.001049643,0.0045213676,0.0037827129,0.004908167,0.0047920938],"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.0010807206,0.0012618977,0.00128555,0.000545908,0.00021670685,0.0001877204,0.0002568659,0.24834117,0.005369659,0.072203934,0.075386934,0.59386295],"study_design_scores_gemma":[0.0002302912,0.00013241965,0.000357102,0.00006182371,0.00007995083,0.0001447808,0.000091878406,0.9433017,0.0018972264,0.045105863,0.008568961,0.000027994942],"about_ca_topic_score_codex":0.009200777,"about_ca_topic_score_gemma":0.014518738,"teacher_disagreement_score":0.027401846,"about_ca_system_score_codex":0.003845016,"about_ca_system_score_gemma":0.0049294266,"threshold_uncertainty_score":0.09166825},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012163393,0.0026289872,0.95862156,0.0006180377,0.00042620001,0.00014254445,0.00034406869,0.0012432896,0.023811797],"genre_scores_gemma":[0.11415554,0.002764549,0.85420775,0.000401141,0.0005376877,0.00045038934,0.0017289408,0.0008669688,0.02488701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841046,0.000395806,0.00008915684,0.00029135376,0.00056802295,0.00024509986],"domain_scores_gemma":[0.99627656,0.0022802763,0.00017221058,0.0008041357,0.0003235301,0.00014328604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018171524,0.0022075002,0.0021738282,0.0013270804,0.0010858492,0.002902868,0.004452339,0.0018276507,0.014937785],"category_scores_gemma":[0.0069699544,0.0012304907,0.0017431031,0.005137583,0.0010036324,0.005726816,0.0024218746,0.0041908915,0.0037283518],"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.00067341997,0.0006073365,0.0005979334,0.0007906689,0.00013437723,0.000081904735,0.00019278008,0.3339104,0.0030418057,0.12319848,0.044896223,0.49187464],"study_design_scores_gemma":[0.00010603299,0.00008393718,0.00020362713,0.00004585302,0.00003654268,0.000109886525,0.000053241944,0.84652096,0.0010892849,0.14209156,0.009647135,0.000011931749],"about_ca_topic_score_codex":0.0029611024,"about_ca_topic_score_gemma":0.0047207884,"teacher_disagreement_score":0.014937785,"about_ca_system_score_codex":0.0021668556,"about_ca_system_score_gemma":0.0019141446,"threshold_uncertainty_score":0.04997188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007167369,0.00041488354,0.9842755,0.00026897082,0.00007594366,0.000038079044,0.00011590454,0.000100004334,0.0075432975],"genre_scores_gemma":[0.4418116,0.0020457006,0.5291111,0.00046743848,0.00040397525,0.00034816694,0.00062753446,0.00047294534,0.024711467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986039,0.00065997755,0.000043899294,0.000148523,0.00036603023,0.00017762757],"domain_scores_gemma":[0.99820566,0.0010541477,0.00012188701,0.00019186601,0.0002596821,0.00016682333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018519352,0.0014081126,0.0017320268,0.001461078,0.0006268047,0.0018426987,0.0017008957,0.0014584555,0.0060403747],"category_scores_gemma":[0.0046176,0.001035995,0.0019661665,0.0018154711,0.001103168,0.0017823704,0.0023436619,0.0018409096,0.0007545703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083664505,0.00007245816,0.0003350085,0.00015162867,0.000080296326,0.00007574615,0.000077606266,0.7329118,0.0020961568,0.22383888,0.0060921726,0.03418457],"study_design_scores_gemma":[0.000005080868,0.000013737642,0.00006143383,0.000014227228,0.000012296014,0.000027723474,0.000012295567,0.9532597,0.000218083,0.045305375,0.0010639211,0.0000061127266],"about_ca_topic_score_codex":0.0027383508,"about_ca_topic_score_gemma":0.0027523702,"teacher_disagreement_score":0.0060403747,"about_ca_system_score_codex":0.0016287054,"about_ca_system_score_gemma":0.0012546583,"threshold_uncertainty_score":0.020207047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43712115,0.0007476788,0.5530324,0.00014714373,0.00003375316,0.00027760584,0.0002986806,0.0002830324,0.008058598],"genre_scores_gemma":[0.77273005,0.0003791228,0.22348747,0.000042175783,0.000011300766,0.00021981099,0.0002630216,0.00008507117,0.0027820587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996741,0.00009453364,0.000013855682,0.000070305665,0.000061822924,0.00008545291],"domain_scores_gemma":[0.99963045,0.00018734597,0.00007107536,0.000029727365,0.000036836576,0.000044559805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890044,0.0010067506,0.0012564391,0.0008529689,0.00042063996,0.0011799026,0.0008500589,0.00087859476,0.0028229724],"category_scores_gemma":[0.0011087841,0.0006523566,0.0007327331,0.0010762449,0.00043792996,0.00096992933,0.0010353373,0.00062901597,0.00035247792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014784922,0.00009895325,0.0015977153,0.00016692255,0.000038004695,0.00008722339,0.00006372095,0.9482144,0.0076574422,0.0027023947,0.000391584,0.038833834],"study_design_scores_gemma":[0.000035196223,0.0001977679,0.0014368835,0.00001685022,0.000026697215,0.000056990622,0.000105363,0.9908518,0.0038678907,0.0023444241,0.0010465004,0.000013611671],"about_ca_topic_score_codex":0.0037786805,"about_ca_topic_score_gemma":0.004469447,"teacher_disagreement_score":0.0037786805,"about_ca_system_score_codex":0.0005973493,"about_ca_system_score_gemma":0.0011662312,"threshold_uncertainty_score":0.00944376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021561072,0.00003252053,0.99656725,0.000048120706,0.000020711484,0.00004197863,0.000018920746,0.00034761787,0.00076682144],"genre_scores_gemma":[0.040950175,0.000048887036,0.9555603,0.00005910167,0.00003329679,0.00030333802,0.00011492186,0.00018999088,0.002739976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00030029318,0.00007245007,0.00018218064,0.0003577556,0.00009679989],"domain_scores_gemma":[0.99779093,0.0014054569,0.00009344583,0.0001887393,0.00043246802,0.00008894242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014654526,0.0013825459,0.0019363168,0.00072897313,0.00085095357,0.0013213533,0.0021297915,0.002665324,0.0087502925],"category_scores_gemma":[0.004165973,0.0014046377,0.0013680278,0.0012278782,0.0009350767,0.0016853237,0.0023960434,0.0025222637,0.0025638347],"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.00031737282,0.00023057694,0.00056480186,0.00033374547,0.00013848273,0.00014287866,0.00017877026,0.7524354,0.013009933,0.012741378,0.0048914407,0.21501529],"study_design_scores_gemma":[0.00002764116,0.00003547229,0.00005732376,0.000004314623,0.0000068982076,0.000017945136,0.000008389015,0.996774,0.00095508853,0.001433526,0.00066927535,0.000010013123],"about_ca_topic_score_codex":0.007973596,"about_ca_topic_score_gemma":0.009765566,"teacher_disagreement_score":0.0087502925,"about_ca_system_score_codex":0.0006383272,"about_ca_system_score_gemma":0.0029958482,"threshold_uncertainty_score":0.029272616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49090073,0.0018748605,0.3542295,0.001092688,0.00091010577,0.00017842975,0.002095743,0.00084344676,0.1478745],"genre_scores_gemma":[0.82031626,0.001239428,0.109888166,0.00034862285,0.00019959314,0.00016245435,0.002966181,0.0006544962,0.06422484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989531,0.0001830325,0.00007809073,0.0002369823,0.0002538708,0.00029482803],"domain_scores_gemma":[0.9980003,0.00059110497,0.00020341347,0.00041664098,0.00036686426,0.00042162903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046587604,0.0008098597,0.0017543914,0.0018749009,0.002099875,0.0039122324,0.0014363163,0.0014899592,0.02014484],"category_scores_gemma":[0.0036174583,0.0008133182,0.0006654118,0.0038998502,0.0010830046,0.0028921375,0.0030694196,0.0019441618,0.0029086347],"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.001119585,0.00042101758,0.0037755163,0.00048223915,0.00009193892,0.0013528608,0.0006441983,0.08491494,0.010584951,0.7739525,0.028746968,0.09391334],"study_design_scores_gemma":[0.00009097001,0.00022609218,0.0026153107,0.00014617611,0.00006496066,0.0011427997,0.0014116026,0.43250772,0.0071421643,0.50259894,0.051971365,0.00008183511],"about_ca_topic_score_codex":0.0033128443,"about_ca_topic_score_gemma":0.0038812398,"teacher_disagreement_score":0.02014484,"about_ca_system_score_codex":0.0011250853,"about_ca_system_score_gemma":0.000636587,"threshold_uncertainty_score":0.06739122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46212548,0.00083207246,0.42918634,0.0024506832,0.00036499943,0.00020189543,0.0013404978,0.00038883902,0.1031092],"genre_scores_gemma":[0.8153333,0.0014278537,0.12503177,0.00042125199,0.00026424453,0.00019486438,0.0018863708,0.00036377,0.055076577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958354,0.000103603845,0.000020683157,0.00010635629,0.00006927756,0.00011654748],"domain_scores_gemma":[0.99872416,0.00071854005,0.00014399027,0.0001520933,0.00009942707,0.00016185617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059693755,0.0010450782,0.0012338844,0.0009027721,0.0011017632,0.0020441378,0.0014597136,0.0021709679,0.013430586],"category_scores_gemma":[0.0029196674,0.0005474866,0.00082155375,0.0018919223,0.0010988384,0.003248504,0.0013985623,0.0020514843,0.0010737445],"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.00051794556,0.00029760165,0.0009842613,0.00048545987,0.000072510295,0.0010335924,0.00034985444,0.31336647,0.007505259,0.55879855,0.024132008,0.09245649],"study_design_scores_gemma":[0.00007747914,0.00012480843,0.00061810977,0.00005404625,0.000035029658,0.00043287897,0.00028429725,0.43699598,0.0038215828,0.54767686,0.00984686,0.00003205031],"about_ca_topic_score_codex":0.0024045396,"about_ca_topic_score_gemma":0.001732359,"teacher_disagreement_score":0.013430586,"about_ca_system_score_codex":0.00090507267,"about_ca_system_score_gemma":0.0006070226,"threshold_uncertainty_score":0.044929802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18701182,0.00096284325,0.7636961,0.00056729635,0.00036036357,0.00008263248,0.00028212284,0.001357259,0.045679573],"genre_scores_gemma":[0.75483936,0.0003958252,0.2280563,0.0002652454,0.00015653703,0.00012239239,0.000414933,0.00040050843,0.01534886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843866,0.000450933,0.000099124125,0.00027000185,0.00043792796,0.00030337504],"domain_scores_gemma":[0.99739,0.0009796039,0.00024778114,0.00089276145,0.00023587295,0.00025400473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011168763,0.0008397276,0.0012270713,0.001291932,0.001044997,0.0033255732,0.0019365085,0.0014084359,0.011139092],"category_scores_gemma":[0.0034683214,0.000903709,0.0008300206,0.0027504445,0.001312437,0.0029699083,0.002730467,0.0016662253,0.0020023354],"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.0016011542,0.00028230427,0.0032070014,0.00037118053,0.0001280786,0.0012351363,0.0005406331,0.15211663,0.03347663,0.7185505,0.011810902,0.07667992],"study_design_scores_gemma":[0.00020488599,0.00042804534,0.0022526728,0.00006567826,0.00007171552,0.0016102059,0.00036038086,0.6290159,0.031949125,0.31888497,0.015027514,0.00012893439],"about_ca_topic_score_codex":0.00043353852,"about_ca_topic_score_gemma":0.00036347035,"teacher_disagreement_score":0.011139092,"about_ca_system_score_codex":0.00085540744,"about_ca_system_score_gemma":0.00046380368,"threshold_uncertainty_score":0.03726399},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015018942,0.00015155486,0.9929161,0.00023086603,0.000058440808,0.00004619875,0.000032812848,0.000044886387,0.0050173746],"genre_scores_gemma":[0.087412305,0.0006703171,0.90606296,0.00031230308,0.00020918304,0.0004069876,0.000094562274,0.0001500115,0.004681469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992281,0.0003248137,0.00003346378,0.00012198602,0.00024044228,0.00005113612],"domain_scores_gemma":[0.9991441,0.00060376595,0.00007697619,0.000063420965,0.000076894095,0.00003481717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015022398,0.00139895,0.0011069055,0.0008433352,0.000645989,0.0018468122,0.0017306382,0.0017341675,0.0038006774],"category_scores_gemma":[0.0026007176,0.0006346926,0.0013371634,0.0010466464,0.0015341649,0.0014910394,0.0015992816,0.0025786096,0.0006936246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002447597,0.000051712264,0.00026090827,0.00018104311,0.00004408478,0.00008957507,0.000074043455,0.82322204,0.0012181366,0.14910337,0.0017971304,0.023933444],"study_design_scores_gemma":[0.0000095813475,0.000033403463,0.000047871712,0.00002386628,0.000008572405,0.000033087934,0.00002012358,0.9551786,0.00028579604,0.040354222,0.003994941,0.000009970868],"about_ca_topic_score_codex":0.0034501674,"about_ca_topic_score_gemma":0.0037738534,"teacher_disagreement_score":0.0038006774,"about_ca_system_score_codex":0.0010926854,"about_ca_system_score_gemma":0.0018237343,"threshold_uncertainty_score":0.012714565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087315045,0.00095586467,0.8732251,0.00068631326,0.00048250813,0.0004352397,0.0004306875,0.002106424,0.034362823],"genre_scores_gemma":[0.35561037,0.00038863564,0.63452566,0.0003175267,0.00009208734,0.00039733105,0.00054108544,0.00042375815,0.007703558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995932,0.00008165009,0.000013962797,0.00005770202,0.00010051853,0.00015289478],"domain_scores_gemma":[0.9995011,0.00024276607,0.00003673194,0.000052973046,0.00009575152,0.000070647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003985114,0.0009932758,0.0012806412,0.0011644147,0.0010091504,0.0012180279,0.0016894676,0.0017730859,0.011714812],"category_scores_gemma":[0.0013597861,0.0007254791,0.0011263877,0.0016843693,0.0005226785,0.0010817904,0.0012683088,0.0014941016,0.0012318058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026394997,0.00031785775,0.00025283362,0.00010882123,0.00003238243,0.00011485671,0.00006255249,0.84911317,0.002633611,0.011074595,0.0072074872,0.12881784],"study_design_scores_gemma":[0.00004916107,0.000057731824,0.00007393463,0.000010833831,0.00001110851,0.00002719223,0.000024823023,0.9941273,0.00047138965,0.003350685,0.0017831946,0.000012729534],"about_ca_topic_score_codex":0.015570485,"about_ca_topic_score_gemma":0.019513253,"teacher_disagreement_score":0.015570485,"about_ca_system_score_codex":0.0015013295,"about_ca_system_score_gemma":0.003008366,"threshold_uncertainty_score":0.039189935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79622304,0.00084176403,0.17329876,0.00076994556,0.00017161043,0.0000904514,0.0011429446,0.00031740515,0.02714401],"genre_scores_gemma":[0.8911511,0.0010087158,0.09569653,0.00017246603,0.00025491722,0.00032090535,0.0010512262,0.00021744875,0.010126755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987545,0.00034714406,0.0000776701,0.00027713133,0.0003247935,0.00021873713],"domain_scores_gemma":[0.9904677,0.0071891285,0.00090433675,0.00064413925,0.00044910636,0.0003454998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009927494,0.00077741046,0.000725004,0.0021969373,0.0008457062,0.0021982505,0.0010921785,0.0008013112,0.0050942353],"category_scores_gemma":[0.009211951,0.00022674505,0.0005161129,0.002735979,0.0019462475,0.004527733,0.0011038859,0.0007490409,0.00057363225],"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.0015075897,0.00021861713,0.018521454,0.0006237104,0.0000912097,0.0008051769,0.00093204004,0.05991979,0.046202965,0.76334846,0.005055317,0.10277381],"study_design_scores_gemma":[0.00006573491,0.00054133125,0.016980566,0.0003651485,0.00011236178,0.0030993165,0.00077923527,0.30594152,0.037383378,0.6125895,0.022022428,0.00011949105],"about_ca_topic_score_codex":0.00055193756,"about_ca_topic_score_gemma":0.0005729497,"teacher_disagreement_score":0.0050942353,"about_ca_system_score_codex":0.00095848535,"about_ca_system_score_gemma":0.00060541753,"threshold_uncertainty_score":0.017041922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37830037,0.0048979735,0.42581028,0.0135402335,0.0007488037,0.0005284096,0.005009931,0.00079642795,0.17036758],"genre_scores_gemma":[0.8900778,0.002223038,0.080665976,0.0010430494,0.0018494364,0.0003685865,0.0034534875,0.00043930902,0.019879328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955765,0.0011859802,0.00021944923,0.0009420014,0.0010168793,0.0010591828],"domain_scores_gemma":[0.97226614,0.022753164,0.0017234567,0.0015361257,0.0010211249,0.00069997937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025264241,0.0017144335,0.002589751,0.0016333815,0.00227124,0.007302909,0.0037484306,0.0037475277,0.013400658],"category_scores_gemma":[0.025610315,0.0013698407,0.002207394,0.0037464206,0.002690121,0.009735819,0.0030066534,0.006572109,0.0014967367],"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.001698432,0.001985015,0.004714471,0.0016516051,0.0003516465,0.0017382749,0.0008289631,0.18058296,0.0039206585,0.64963114,0.07927466,0.07362222],"study_design_scores_gemma":[0.00023978368,0.00007690113,0.00088867184,0.00005357966,0.0000801081,0.00067877024,0.00025852493,0.2984818,0.0010804641,0.69376475,0.0043406296,0.000055991597],"about_ca_topic_score_codex":0.003584672,"about_ca_topic_score_gemma":0.004592863,"teacher_disagreement_score":0.013400658,"about_ca_system_score_codex":0.002558532,"about_ca_system_score_gemma":0.0025659099,"threshold_uncertainty_score":0.044829607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059030812,0.00058924186,0.9342958,0.0005574054,0.0000991607,0.0001472422,0.00009535864,0.0008268993,0.0043581375],"genre_scores_gemma":[0.9138641,0.000198583,0.080597274,0.00021665273,0.00006064184,0.00021825598,0.000118081676,0.00013574782,0.0045906585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920255,0.0003540582,0.000036057976,0.00012866598,0.00011821477,0.0001604873],"domain_scores_gemma":[0.9967982,0.0022956962,0.00028224234,0.00012696169,0.00028605177,0.00021096076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030851848,0.0013067406,0.0023236831,0.00060972036,0.00039838013,0.00097604905,0.0017453366,0.0019167061,0.004190633],"category_scores_gemma":[0.0062799077,0.0007981836,0.00054785406,0.00058452925,0.0011762449,0.0017602963,0.0015357169,0.0021299315,0.000556768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016402906,0.000079291895,0.00017940711,0.0000479978,0.00002463581,0.000026225409,0.000018211864,0.98251235,0.0003243111,0.004636841,0.0008804507,0.011106189],"study_design_scores_gemma":[0.00001764686,0.000026244594,0.000018728353,0.0000020778562,0.00000244956,0.000002291244,0.000001441693,0.99868995,0.00004076531,0.0011584534,0.000037670805,0.0000023001921],"about_ca_topic_score_codex":0.0052817995,"about_ca_topic_score_gemma":0.004355222,"teacher_disagreement_score":0.0052817995,"about_ca_system_score_codex":0.0011693487,"about_ca_system_score_gemma":0.0019475631,"threshold_uncertainty_score":0.016316175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02621221,0.00021823753,0.9722359,0.000035674202,0.000022638325,0.00004687018,0.000047318455,0.0003599316,0.0008212613],"genre_scores_gemma":[0.20093834,0.00041696473,0.7963326,0.00007144407,0.000051689025,0.00010661675,0.0003257483,0.00014324364,0.0016134101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994418,0.000089701956,0.000037990423,0.0000852297,0.00029457753,0.00005072266],"domain_scores_gemma":[0.99886405,0.000432532,0.00018157843,0.0002187242,0.00024870434,0.000054351793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044816092,0.00078246475,0.0006252972,0.0007699306,0.0002415133,0.0006006474,0.00073460717,0.00034727246,0.0011060212],"category_scores_gemma":[0.002450093,0.00037328535,0.00038114455,0.00083582225,0.00039473872,0.0012412108,0.0009132643,0.00055504305,0.00045563807],"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.0005909163,0.00019159177,0.0011977399,0.00020378895,0.000052407955,0.00041141227,0.00034502707,0.13351987,0.18949337,0.008746705,0.0036626295,0.66158456],"study_design_scores_gemma":[0.000017718663,0.00020845648,0.00089289027,0.000018442885,0.000019328842,0.0005008562,0.000069766065,0.87791556,0.11554636,0.0020322388,0.0027486226,0.000029706618],"about_ca_topic_score_codex":0.0011425621,"about_ca_topic_score_gemma":0.0013886323,"teacher_disagreement_score":0.0011425621,"about_ca_system_score_codex":0.00039471049,"about_ca_system_score_gemma":0.0005545156,"threshold_uncertainty_score":0.003700018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012748669,0.0018213422,0.9728919,0.0004939819,0.00016048811,0.00010690558,0.00031381976,0.00060675055,0.010856017],"genre_scores_gemma":[0.3455738,0.0028177225,0.6436001,0.00047988954,0.00022008545,0.00044610022,0.001210798,0.0005990947,0.0050524166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995336,0.0014714936,0.00023513638,0.0006160412,0.0018552552,0.00048604122],"domain_scores_gemma":[0.9891261,0.0084295925,0.0006059807,0.0006714187,0.0008837811,0.00028326406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036654999,0.001892378,0.001470182,0.0026015292,0.0010595617,0.004028234,0.0014724882,0.0015450558,0.009269099],"category_scores_gemma":[0.02067276,0.0011225957,0.0017541694,0.002728568,0.0014986665,0.003971117,0.0026584917,0.0041331635,0.0016110912],"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.00019524219,0.00020124167,0.0009384879,0.00064588676,0.00006358935,0.00009218427,0.00013767705,0.6984978,0.002787979,0.16266578,0.006263652,0.12751059],"study_design_scores_gemma":[0.00002884379,0.000054002947,0.00015622635,0.00011822784,0.000021452533,0.00004209317,0.000032349046,0.8973825,0.0015431712,0.09564391,0.00495744,0.000019773386],"about_ca_topic_score_codex":0.004106933,"about_ca_topic_score_gemma":0.0057785427,"teacher_disagreement_score":0.009269099,"about_ca_system_score_codex":0.0024784612,"about_ca_system_score_gemma":0.003700779,"threshold_uncertainty_score":0.031008184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53530824,0.00045619634,0.38226286,0.00029876173,0.00012599198,0.00006965826,0.00033914697,0.00016591811,0.0809732],"genre_scores_gemma":[0.94831985,0.00021510122,0.04160458,0.00007285568,0.00006559778,0.00006402751,0.000341015,0.0000650621,0.009251883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999193,0.00015853377,0.000036425994,0.00015970283,0.00029371213,0.00015852622],"domain_scores_gemma":[0.9992299,0.0002098439,0.0001608102,0.00014200008,0.00010650052,0.00015097375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048456146,0.00035860125,0.00038847342,0.00088710774,0.0008729896,0.0019725394,0.0005402971,0.00044769852,0.005207085],"category_scores_gemma":[0.0015271404,0.00030677728,0.0007181516,0.0005033526,0.0025243834,0.0016272888,0.0020533772,0.0011570349,0.00046929112],"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.000058224323,0.00006492333,0.0007860442,0.00006868764,0.000014395432,0.0001607711,0.00018888841,0.021630641,0.0032069867,0.9608015,0.0009786602,0.012040206],"study_design_scores_gemma":[0.0000408524,0.00012271934,0.0013052848,0.00005815557,0.00001963313,0.0005538096,0.00054664334,0.09012372,0.005051408,0.8890038,0.013140427,0.000033471948],"about_ca_topic_score_codex":0.00037965356,"about_ca_topic_score_gemma":0.00034545173,"teacher_disagreement_score":0.005207085,"about_ca_system_score_codex":0.00048721206,"about_ca_system_score_gemma":0.00023229778,"threshold_uncertainty_score":0.017419457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40992415,0.0049455315,0.35643417,0.0035416544,0.0007374107,0.000105905616,0.0015789014,0.0006592045,0.22207305],"genre_scores_gemma":[0.91662186,0.0017443062,0.06137179,0.0009838282,0.0005071321,0.0001159125,0.00089547574,0.0002749772,0.017484667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792385,0.0006391686,0.00012858937,0.00041666487,0.0005660096,0.00032572084],"domain_scores_gemma":[0.9906116,0.005174032,0.00063462555,0.0016734928,0.001359168,0.00054705376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738679,0.0007576845,0.0008305546,0.0011681725,0.0011630129,0.0029610489,0.0010785254,0.0007223829,0.00882231],"category_scores_gemma":[0.0131241,0.00047374843,0.0009573245,0.0013234138,0.0041364874,0.007924233,0.00312947,0.002602331,0.0017214196],"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.00063877983,0.000037888145,0.0014757768,0.00030230798,0.000046277204,0.0003590369,0.00047985377,0.028110685,0.012111952,0.902479,0.011243887,0.042714544],"study_design_scores_gemma":[0.000040839637,0.00014422929,0.0015047122,0.000060785802,0.00001714601,0.0005317195,0.00019307209,0.0457838,0.010164312,0.91326755,0.028222771,0.00006907761],"about_ca_topic_score_codex":0.0012243039,"about_ca_topic_score_gemma":0.00057339383,"teacher_disagreement_score":0.00882231,"about_ca_system_score_codex":0.00069697155,"about_ca_system_score_gemma":0.0005308532,"threshold_uncertainty_score":0.029513597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099139124,0.00070821197,0.87652874,0.00022353671,0.000121024284,0.00003879251,0.00018439609,0.000295533,0.022760566],"genre_scores_gemma":[0.88470733,0.000784952,0.09800613,0.00006343293,0.000037459286,0.000078844925,0.0002908056,0.00012450198,0.015906606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997485,0.00009017213,0.000010207249,0.00003595852,0.00007712449,0.000037975995],"domain_scores_gemma":[0.9996909,0.00012693755,0.00003954085,0.000054113392,0.00004483412,0.00004364889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002425201,0.0005889146,0.0011418588,0.0007055481,0.0005133739,0.0014192666,0.00096667465,0.0010511051,0.0040030093],"category_scores_gemma":[0.00081682915,0.00052124064,0.0008317014,0.0011968252,0.0009515746,0.0015691373,0.00084232364,0.000878316,0.00061022665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008603621,0.000035869707,0.00022752356,0.000046663015,0.000019650013,0.00011926436,0.000028106355,0.8851624,0.0021276688,0.10313481,0.00091670797,0.008095326],"study_design_scores_gemma":[0.0000043138684,0.000007923733,0.000041666815,0.0000027755698,0.0000031051218,0.000011730123,0.0000040963346,0.9929529,0.00022568666,0.0064255833,0.00031554705,0.0000046658447],"about_ca_topic_score_codex":0.005136988,"about_ca_topic_score_gemma":0.0028612795,"teacher_disagreement_score":0.005136988,"about_ca_system_score_codex":0.0007750966,"about_ca_system_score_gemma":0.00061204226,"threshold_uncertainty_score":0.013391435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08303101,0.006092615,0.857765,0.0013041432,0.001203938,0.00011381878,0.0010479855,0.0008793922,0.04856208],"genre_scores_gemma":[0.5108009,0.009049417,0.45040578,0.0008190896,0.0011691048,0.00042646742,0.00332959,0.0006727166,0.023326939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668294,0.0008218705,0.00022935215,0.00048670865,0.0014009544,0.0003782301],"domain_scores_gemma":[0.9958305,0.0018962575,0.00044190607,0.000980807,0.0006466228,0.00020400633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012186407,0.0016129329,0.0026026356,0.0021882046,0.0014201163,0.0027685054,0.0023654194,0.0015484301,0.009292832],"category_scores_gemma":[0.012880688,0.0010098356,0.001417967,0.0033088778,0.0021181824,0.004944625,0.0052686282,0.003766133,0.0062199924],"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.001706671,0.00023151268,0.002247184,0.0015055604,0.00020217116,0.0011643126,0.0006994422,0.15715048,0.026806498,0.47349837,0.040123884,0.29466394],"study_design_scores_gemma":[0.000069619295,0.00039877178,0.0025632733,0.00027842793,0.000097539574,0.0013363597,0.00032644212,0.42944297,0.030403282,0.47239047,0.06250027,0.00019261334],"about_ca_topic_score_codex":0.001160056,"about_ca_topic_score_gemma":0.0008257126,"teacher_disagreement_score":0.009292832,"about_ca_system_score_codex":0.00067577587,"about_ca_system_score_gemma":0.00061196287,"threshold_uncertainty_score":0.031087637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050970517,0.003588293,0.9160111,0.0008180422,0.0005733018,0.00008373449,0.00011247845,0.00048408707,0.027358467],"genre_scores_gemma":[0.6738548,0.0042800126,0.3038469,0.00031933974,0.0007489996,0.00021750054,0.00029148956,0.00032933312,0.016111672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932504,0.00023594663,0.000043940967,0.00013911242,0.00017023439,0.0000857427],"domain_scores_gemma":[0.99859995,0.00086859404,0.00014848418,0.00020320325,0.000087201064,0.00009249712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055213907,0.0010649596,0.0012665825,0.0012829218,0.0010276478,0.0019397138,0.0011491368,0.0014798096,0.0057217386],"category_scores_gemma":[0.0041138288,0.0006574757,0.001399871,0.0037671525,0.0013171078,0.0020330418,0.0019436659,0.0021628148,0.00074343465],"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.00019061068,0.00016197666,0.0006008654,0.00029649964,0.000051109128,0.00040663918,0.0002584476,0.6369121,0.008139939,0.20431921,0.004349526,0.14431307],"study_design_scores_gemma":[0.000020436595,0.00009793002,0.00045896097,0.00005099055,0.000022394788,0.00026635986,0.000100260106,0.68027407,0.0020737788,0.3098433,0.006763042,0.000028500537],"about_ca_topic_score_codex":0.0009090079,"about_ca_topic_score_gemma":0.0010118902,"teacher_disagreement_score":0.0057217386,"about_ca_system_score_codex":0.00079439045,"about_ca_system_score_gemma":0.0003734245,"threshold_uncertainty_score":0.019141138},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009395283,0.953964,0.035661273,0.00069285324,0.00044140505,0.00004428785,0.00010238501,0.00010958213,0.008044742],"genre_scores_gemma":[0.009412472,0.9539842,0.032058977,0.00060067745,0.0009089737,0.0000788115,0.00039634792,0.000077179466,0.0024823844],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985172,0.0003019761,0.00020233986,0.00039308035,0.0005010226,0.000084371444],"domain_scores_gemma":[0.99582326,0.002807777,0.0002898548,0.00016608728,0.0008381453,0.000074823074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019364597,0.0021789903,0.0018054491,0.0045341854,0.00086608826,0.0019776076,0.002373254,0.0019654909,0.009870056],"category_scores_gemma":[0.005964754,0.0012536669,0.0015627384,0.011104688,0.0010154998,0.0026325053,0.00090465747,0.0018212525,0.0029192439],"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.00013708648,0.00014268748,0.0005521099,0.028699493,0.00020295341,0.00029167207,0.00018170621,0.015795488,0.0011958235,0.03194722,0.031315763,0.88953793],"study_design_scores_gemma":[0.000061256,0.00040807342,0.0023258752,0.02283516,0.00069985754,0.002159773,0.00046553923,0.021488467,0.0044537038,0.053597085,0.8913387,0.00016651793],"about_ca_topic_score_codex":0.0036311168,"about_ca_topic_score_gemma":0.0034469704,"teacher_disagreement_score":0.009870056,"about_ca_system_score_codex":0.0011729923,"about_ca_system_score_gemma":0.002195933,"threshold_uncertainty_score":0.03301859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042327218,0.09643781,0.37837464,0.0046497257,0.0020690963,0.00012713532,0.00072855916,0.00055040204,0.4747354],"genre_scores_gemma":[0.40867123,0.078459844,0.19599003,0.0015505891,0.004207765,0.00045431947,0.002681463,0.000769084,0.30721566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967766,0.000086930304,0.000015471105,0.000051550887,0.00013525055,0.000033075135],"domain_scores_gemma":[0.9995334,0.00030546158,0.000031097385,0.00003324834,0.000066861714,0.000029999124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120121,0.0008730657,0.0007266423,0.0009710431,0.00083929877,0.0014592557,0.0006353626,0.0011866326,0.009310465],"category_scores_gemma":[0.0017444968,0.00047808528,0.0006802911,0.0014076339,0.0014695585,0.002253635,0.0010908024,0.0013507825,0.0023144973],"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.000026020665,0.000028156628,0.00015756232,0.00036844387,0.000013765515,0.000110623005,0.00018001632,0.022322543,0.0010008945,0.88678795,0.026916608,0.062087577],"study_design_scores_gemma":[0.000010111093,0.000023941002,0.00020366315,0.000101554746,0.000006479003,0.00013846604,0.00004545319,0.030462788,0.000467349,0.9060697,0.06246038,0.000010006751],"about_ca_topic_score_codex":0.0013686494,"about_ca_topic_score_gemma":0.0008675271,"teacher_disagreement_score":0.009310465,"about_ca_system_score_codex":0.0010178816,"about_ca_system_score_gemma":0.00045812834,"threshold_uncertainty_score":0.031146586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020470265,0.00064319716,0.97410834,0.0003426873,0.00013780137,0.0001216014,0.00007715065,0.00048372807,0.003615301],"genre_scores_gemma":[0.43505007,0.00045237708,0.55741096,0.00061436737,0.00016546928,0.000483865,0.0003915621,0.000207667,0.005223587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991499,0.000352437,0.00004704608,0.00012258088,0.00018973826,0.00013828759],"domain_scores_gemma":[0.99653804,0.0022596323,0.00019459566,0.00018405648,0.0006448586,0.00017885599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022116832,0.00081194984,0.0021960272,0.0014835402,0.00086639205,0.0012047568,0.0025789777,0.0021234239,0.005789552],"category_scores_gemma":[0.00574157,0.0007548612,0.000933654,0.001787605,0.0012419849,0.0013591322,0.0017600777,0.001855557,0.00074591767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017492053,0.00015653076,0.00061577314,0.00011517774,0.000051100844,0.000050379174,0.000051425115,0.89367014,0.0006183916,0.0096561145,0.0028874292,0.09195272],"study_design_scores_gemma":[0.000018991435,0.000022272628,0.00003950752,0.0000054275483,0.000004086611,0.000005794657,0.0000048491956,0.997136,0.00007860006,0.002508252,0.00017350119,0.0000028152838],"about_ca_topic_score_codex":0.010537928,"about_ca_topic_score_gemma":0.007200292,"teacher_disagreement_score":0.010537928,"about_ca_system_score_codex":0.0013456041,"about_ca_system_score_gemma":0.0029436483,"threshold_uncertainty_score":0.020953178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2136751,0.0009880221,0.7712133,0.00056073844,0.00024992548,0.00015550655,0.0002578393,0.00091080734,0.011988709],"genre_scores_gemma":[0.67432,0.000359949,0.31977117,0.000086821114,0.00005229408,0.000113477916,0.00031632674,0.00014903067,0.0048309956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996642,0.00012435681,0.000020202733,0.000054825774,0.00009787892,0.000038508882],"domain_scores_gemma":[0.99915254,0.0004893529,0.00005002472,0.00006703847,0.00019971661,0.000041269155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009596376,0.0010102778,0.0011939035,0.00053905405,0.00044761295,0.0010042092,0.00078025745,0.0017277662,0.0023578496],"category_scores_gemma":[0.0016102791,0.0004914557,0.00091655256,0.000962158,0.0003624306,0.0006999046,0.0006797026,0.0010127415,0.00035590655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000164587,0.00018348896,0.000636207,0.00013374591,0.00004705923,0.00014537599,0.000049158796,0.95870113,0.0021677038,0.001459223,0.0015422612,0.03476998],"study_design_scores_gemma":[0.0000150083715,0.000029826684,0.00014017858,0.0000022566371,0.0000054536276,0.000009423948,0.000006881491,0.99888843,0.00035003183,0.0002637363,0.00028580893,0.0000029801363],"about_ca_topic_score_codex":0.0073506297,"about_ca_topic_score_gemma":0.0058349357,"teacher_disagreement_score":0.0073506297,"about_ca_system_score_codex":0.0004076689,"about_ca_system_score_gemma":0.000710963,"threshold_uncertainty_score":0.014615655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05204105,0.0005296781,0.94184,0.00016649441,0.00012146146,0.000122542,0.00006335714,0.001063227,0.0040521934],"genre_scores_gemma":[0.27741346,0.00027339652,0.71885777,0.00015061932,0.00003917586,0.000177615,0.00008827128,0.00016490537,0.0028347494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999653,0.00011117368,0.000015989335,0.000063869265,0.000115762086,0.00004027861],"domain_scores_gemma":[0.99945134,0.00027774848,0.000050338014,0.000067932706,0.00012564218,0.000027013799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009016142,0.0006766156,0.0007554488,0.0008078792,0.0005231111,0.00080188987,0.00088923104,0.0010680931,0.0024039415],"category_scores_gemma":[0.0014946195,0.00040433675,0.00094036077,0.00087646383,0.00046125133,0.00059230987,0.0005384001,0.00059766567,0.0003008655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032218784,0.00019028073,0.0009954388,0.00030631278,0.0001191421,0.000078490055,0.00012523288,0.71046877,0.03668863,0.007446514,0.0015032447,0.24175577],"study_design_scores_gemma":[0.000024928837,0.00012285826,0.0001643644,0.000009041199,0.000025368592,0.000022416181,0.000015377193,0.99083287,0.006324274,0.0011624007,0.0012895679,0.0000065336108],"about_ca_topic_score_codex":0.002666929,"about_ca_topic_score_gemma":0.003926406,"teacher_disagreement_score":0.002666929,"about_ca_system_score_codex":0.0006030929,"about_ca_system_score_gemma":0.0010677812,"threshold_uncertainty_score":0.008041978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2067586,0.0016138925,0.77532774,0.00037874677,0.00021474468,0.00026508883,0.00016221144,0.0006242948,0.014654675],"genre_scores_gemma":[0.85818255,0.000332409,0.13444747,0.00017414833,0.000060714538,0.00030921432,0.00015211754,0.000112695416,0.0062287054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949694,0.00020411678,0.00001954084,0.000050589897,0.00014376825,0.000084983265],"domain_scores_gemma":[0.9990528,0.0006475081,0.00006931147,0.00003374062,0.00015048831,0.000046056215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010200688,0.0008539842,0.0015923111,0.001140357,0.0007135318,0.0009551229,0.0012225658,0.0011441192,0.002399592],"category_scores_gemma":[0.001668926,0.0006775651,0.0006127628,0.0016138224,0.00061500364,0.00071613037,0.0006545001,0.0005060546,0.000207763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010921136,0.000049044964,0.00016252208,0.00008120073,0.000029294382,0.000025731357,0.000019549749,0.9811694,0.0007390939,0.002240392,0.0005453392,0.014829215],"study_design_scores_gemma":[0.000011408781,0.00002483153,0.000045119545,0.0000029096425,0.0000035726468,0.0000034981767,0.0000031976776,0.999146,0.00014722966,0.0004982825,0.0001117705,0.0000022494376],"about_ca_topic_score_codex":0.013271408,"about_ca_topic_score_gemma":0.011274023,"teacher_disagreement_score":0.013271408,"about_ca_system_score_codex":0.0011174105,"about_ca_system_score_gemma":0.001734819,"threshold_uncertainty_score":0.026388347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009077621,0.0003165095,0.97899014,0.0004067832,0.00012814326,0.00014632955,0.000244429,0.0010227778,0.009667419],"genre_scores_gemma":[0.08561472,0.00027329812,0.89950556,0.0003177645,0.000073467454,0.00040279562,0.00060242333,0.0002847738,0.012925188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999413,0.0001663736,0.000022819751,0.00012083177,0.00018256245,0.0000943546],"domain_scores_gemma":[0.99923134,0.00043542226,0.000042421096,0.000054526306,0.00017847093,0.000057848603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010522673,0.001015063,0.0017828142,0.0010251416,0.0007671041,0.0011594025,0.002050127,0.0023196628,0.012629052],"category_scores_gemma":[0.002272898,0.0009805061,0.0008154254,0.002055254,0.00065105443,0.0012012635,0.0014858482,0.0020304546,0.0028180869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003888906,0.00032683474,0.00060918357,0.00019506464,0.0000808446,0.00008867204,0.00010686732,0.69574076,0.0036271915,0.023211569,0.021700747,0.25392342],"study_design_scores_gemma":[0.00009324921,0.000071158924,0.00013018092,0.000016884567,0.000010806492,0.000025394693,0.00001942553,0.99170566,0.0006136476,0.0046161516,0.0026869967,0.0000104821065],"about_ca_topic_score_codex":0.009753138,"about_ca_topic_score_gemma":0.010771034,"teacher_disagreement_score":0.012629052,"about_ca_system_score_codex":0.0012303465,"about_ca_system_score_gemma":0.0025973418,"threshold_uncertainty_score":0.042248428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04658424,0.0021296793,0.93243605,0.0011298874,0.00027292667,0.0002765861,0.00067443924,0.0024897787,0.014006341],"genre_scores_gemma":[0.3520847,0.0017788244,0.6311391,0.00056477654,0.00026118354,0.0005660961,0.0024039324,0.00060635904,0.010594991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979724,0.0005003252,0.00014610031,0.00046618373,0.00045875055,0.00045624858],"domain_scores_gemma":[0.99674416,0.0018085083,0.00036891384,0.0005606239,0.00028698082,0.00023078654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019631165,0.002290101,0.0020129269,0.0013936543,0.0012875452,0.0024916418,0.0035440102,0.0018737547,0.0070925117],"category_scores_gemma":[0.0067442805,0.0008799973,0.0018981565,0.0033407772,0.00098919,0.004117276,0.0020537407,0.0021921739,0.0018483081],"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.0009878052,0.00066138286,0.0015026183,0.00063945283,0.00016085581,0.00018834883,0.0003287041,0.75169915,0.003260432,0.04960602,0.019622697,0.1713425],"study_design_scores_gemma":[0.00009192536,0.00008538448,0.00015081414,0.000022235077,0.000023539073,0.000083125924,0.000052308103,0.967607,0.0008021219,0.028803406,0.0022697619,0.000008406958],"about_ca_topic_score_codex":0.0050531924,"about_ca_topic_score_gemma":0.007043266,"teacher_disagreement_score":0.0070925117,"about_ca_system_score_codex":0.0025895354,"about_ca_system_score_gemma":0.0025306768,"threshold_uncertainty_score":0.023726821},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027599238,0.019838313,0.22741732,0.06261215,0.027123725,0.00043030592,0.005315594,0.0010304877,0.62863284],"genre_scores_gemma":[0.3976696,0.046019692,0.20965317,0.038362637,0.029244328,0.00090698566,0.008353076,0.0011191312,0.26867133],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996277,0.00008070956,0.00001853429,0.00011404331,0.00010692514,0.000052043404],"domain_scores_gemma":[0.99861205,0.0008514326,0.000078392404,0.00014851033,0.00018605725,0.00012345612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006474705,0.0008670539,0.0006960151,0.0010115587,0.0011273162,0.0015985195,0.001374684,0.0012029496,0.027914558],"category_scores_gemma":[0.0032391744,0.00022285322,0.000703062,0.0023865928,0.0011387256,0.0041590654,0.0015161753,0.0036940337,0.0047805756],"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.0003107361,0.00015032923,0.0007196705,0.0010635391,0.00005382878,0.0006257333,0.00021629373,0.0046516117,0.0026181242,0.36611515,0.487708,0.13576703],"study_design_scores_gemma":[0.000043241573,0.00010193515,0.001933395,0.00018145444,0.000056128716,0.001148743,0.00020794036,0.011434992,0.0018646403,0.76199853,0.22098231,0.000046714547],"about_ca_topic_score_codex":0.003444686,"about_ca_topic_score_gemma":0.004747211,"teacher_disagreement_score":0.027914558,"about_ca_system_score_codex":0.0008112805,"about_ca_system_score_gemma":0.0005670697,"threshold_uncertainty_score":0.09338349},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19831677,0.004659643,0.6973446,0.0031198983,0.00017471002,0.00037260627,0.00092494517,0.0010399899,0.09404692],"genre_scores_gemma":[0.84264266,0.002087139,0.12314574,0.0007017887,0.0005559953,0.00056815543,0.0019639316,0.0008452688,0.02748923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543494,0.0015149565,0.00016299842,0.0005546125,0.0015227892,0.00080960116],"domain_scores_gemma":[0.97980726,0.015694177,0.00082883344,0.0014832543,0.0015111816,0.0006752969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034563572,0.0013447187,0.0015160404,0.0030849867,0.0016812444,0.0045625325,0.0046559894,0.0019686786,0.013556371],"category_scores_gemma":[0.020175103,0.001110916,0.0020503514,0.0038636262,0.0026246158,0.0059257415,0.0029568947,0.0043780073,0.0009828714],"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.0006180549,0.0004833834,0.003584354,0.00045252332,0.00015583346,0.00010192495,0.00057207496,0.16963218,0.0057875603,0.67870647,0.018631224,0.12127445],"study_design_scores_gemma":[0.000049902403,0.00005806999,0.0011172002,0.000070472655,0.000033480275,0.00007530828,0.000076014476,0.55857146,0.0012988145,0.43531486,0.0033084855,0.000025937534],"about_ca_topic_score_codex":0.0033125803,"about_ca_topic_score_gemma":0.0039575025,"teacher_disagreement_score":0.013556371,"about_ca_system_score_codex":0.0065272013,"about_ca_system_score_gemma":0.0022813547,"threshold_uncertainty_score":0.047358394},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033574877,0.0002621508,0.7894283,0.0018081887,0.0037176143,0.00034124247,0.014570273,0.14853606,0.037978753],"genre_scores_gemma":[0.04103553,0.00065182627,0.7013326,0.00352633,0.0009783388,0.0010082006,0.039051596,0.13476944,0.077646114],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969169,0.00047106575,0.00028580357,0.00053950096,0.0015425176,0.00024418862],"domain_scores_gemma":[0.9922545,0.00133366,0.00033365277,0.004058783,0.0018124592,0.00020686234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019416958,0.0021728117,0.0011229395,0.0016277815,0.0010100743,0.0034022229,0.0032899838,0.0014376786,0.111584045],"category_scores_gemma":[0.0127909165,0.0011915301,0.0025410035,0.0023127373,0.0011323548,0.0027063037,0.0038117678,0.004035428,0.08367432],"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.00036342794,0.00013598012,0.00064934813,0.0005328693,0.00009083627,0.00035004827,0.00016613556,0.006030293,0.010646983,0.038461287,0.7755411,0.16703159],"study_design_scores_gemma":[0.0001220049,0.00009188104,0.0010177703,0.00015847711,0.00005251095,0.00083534076,0.00007887218,0.044438444,0.0425612,0.048235632,0.8623068,0.00010124511],"about_ca_topic_score_codex":0.00217611,"about_ca_topic_score_gemma":0.001752647,"teacher_disagreement_score":0.111584045,"about_ca_system_score_codex":0.0011315854,"about_ca_system_score_gemma":0.0016806633,"threshold_uncertainty_score":0.37328577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015016454,0.0003821343,0.9799256,0.00010898411,0.00002886181,0.000057824585,0.00012431513,0.00018099272,0.0041747913],"genre_scores_gemma":[0.3941637,0.0010584982,0.5959345,0.00014031056,0.0000392503,0.00038814914,0.00042755264,0.00037621098,0.007471888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932694,0.00021123288,0.000025807138,0.000121674486,0.00022717072,0.00008718361],"domain_scores_gemma":[0.99940944,0.0003624287,0.00006359505,0.000050215414,0.000079859536,0.00003452759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009670311,0.0012423682,0.001434221,0.000954102,0.000442995,0.0016230359,0.0011691103,0.0015395662,0.0036533717],"category_scores_gemma":[0.0015160267,0.00085606374,0.0010779302,0.0018183577,0.0007227248,0.00121487,0.0012389437,0.0010372872,0.00044900115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034338256,0.000030180943,0.00014678112,0.000089693836,0.000017173132,0.000035616587,0.000024372048,0.9762322,0.001582687,0.007295891,0.00045040078,0.0140606435],"study_design_scores_gemma":[0.0000061035216,0.000028456718,0.000070525086,0.000008870228,0.0000054507877,0.000022376227,0.0000091579805,0.9945358,0.0008661615,0.0035894085,0.00085219956,0.0000055476507],"about_ca_topic_score_codex":0.004150014,"about_ca_topic_score_gemma":0.0038929381,"teacher_disagreement_score":0.004150014,"about_ca_system_score_codex":0.0011898063,"about_ca_system_score_gemma":0.0014889537,"threshold_uncertainty_score":0.012221754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005180199,0.000040621864,0.000068163834,0.000043132608,0.000012994528,0.000007765968,0.99831736,0.0006678044,0.00079035165],"genre_scores_gemma":[0.00015963682,0.00004352046,0.00029862337,0.000051230367,0.0000032121222,0.000043940465,0.998841,0.00016892121,0.00039001612],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988651,0.00015792399,0.00014497821,0.00037234198,0.00028342105,0.0001762008],"domain_scores_gemma":[0.9975128,0.0006769495,0.0001903257,0.00077240344,0.000584695,0.00026273492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010403146,0.0024903421,0.001782854,0.004368137,0.000962483,0.0027860168,0.0033883213,0.0026460248,0.13401024],"category_scores_gemma":[0.0065187956,0.0009520552,0.0014576016,0.008838716,0.00049775996,0.0025047602,0.0026330424,0.002365954,0.21234122],"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.000028887598,0.000015076369,0.00027130262,0.0005502695,0.000014217204,0.000012806405,0.000015575088,0.00020708384,0.00010536798,0.00046674474,0.99663997,0.0016725966],"study_design_scores_gemma":[0.000096921685,0.000010428493,0.0012313934,0.00020610122,0.000012685394,0.000036252408,0.000050268547,0.0003291937,0.00023582166,0.0013437271,0.9964296,0.000017607677],"about_ca_topic_score_codex":0.017423151,"about_ca_topic_score_gemma":0.031123023,"teacher_disagreement_score":0.13401024,"about_ca_system_score_codex":0.0017731366,"about_ca_system_score_gemma":0.0024554937,"threshold_uncertainty_score":0.44830894},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06887318,0.0006663256,0.9203217,0.0005310787,0.00017470513,0.00015456467,0.00036169033,0.002772002,0.006144802],"genre_scores_gemma":[0.71536136,0.0003673383,0.27604553,0.00043696075,0.00015131306,0.00019251676,0.0008933914,0.00031752425,0.00623402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820113,0.00036400827,0.00010283915,0.0005820175,0.0005050401,0.00024499308],"domain_scores_gemma":[0.99445206,0.0032491705,0.00048987253,0.0011746143,0.00044070435,0.00019358998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011712328,0.0011280876,0.0014919363,0.0004366654,0.0006785613,0.0014398025,0.0018448593,0.0012145188,0.004004498],"category_scores_gemma":[0.009617338,0.0006652701,0.0006881013,0.0012618515,0.0010645235,0.003174514,0.0019841564,0.0018334419,0.0013299563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068740646,0.00015635065,0.0018071523,0.00017341929,0.00004728566,0.0001421169,0.00013816383,0.8011578,0.004121934,0.02087148,0.0062963064,0.16440064],"study_design_scores_gemma":[0.000011922795,0.000054272365,0.00011015962,0.000006344147,0.000004848965,0.00003819015,0.000012877459,0.9886708,0.001399399,0.00901732,0.0006681159,0.000005624125],"about_ca_topic_score_codex":0.0025568036,"about_ca_topic_score_gemma":0.0025319024,"teacher_disagreement_score":0.004004498,"about_ca_system_score_codex":0.0009428168,"about_ca_system_score_gemma":0.0015892644,"threshold_uncertainty_score":0.013396442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9229417,0.00515228,0.0010132455,0.030665081,0.000065228705,0.000026154372,0.0003525437,0.0000056437734,0.03977803],"genre_scores_gemma":[0.99857795,0.0006138902,0.00007103148,0.00038105622,0.000016881688,0.0000026931352,0.000027017568,7.4535313e-7,0.0003086844],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992575,0.00025621784,0.000020304939,0.000047657875,0.00016538393,0.0002530718],"domain_scores_gemma":[0.9990959,0.00028249982,0.00012547935,0.00001313391,0.00024620083,0.00023680044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010883958,0.0001883072,0.00019485605,0.0008804514,0.0011337396,0.0019845576,0.0003668745,0.0011432862,0.0048839916],"category_scores_gemma":[0.0027015822,0.00009567951,0.00046105156,0.00072893937,0.0011226459,0.0009679574,0.0006380262,0.0009236196,0.0001825566],"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.00023090307,0.00047260136,0.8074662,0.00037949928,0.00036743208,0.001961831,0.015330538,0.002798278,0.0011754294,0.042360693,0.008794392,0.118662216],"study_design_scores_gemma":[0.000040101466,0.0003507347,0.86519617,0.00067727786,0.0002610979,0.0017223082,0.077372424,0.0053301705,0.00042935924,0.018126747,0.030383145,0.00011053643],"about_ca_topic_score_codex":0.13885598,"about_ca_topic_score_gemma":0.17340742,"teacher_disagreement_score":0.13885598,"about_ca_system_score_codex":0.004932026,"about_ca_system_score_gemma":0.0032511172,"threshold_uncertainty_score":0.2760955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024098016,0.00011387076,0.9951062,0.00012374272,0.00003791678,0.00008293294,0.00008976275,0.00017555531,0.0018601271],"genre_scores_gemma":[0.078406885,0.00021842959,0.9172201,0.00017476034,0.00007727258,0.0005607289,0.000502788,0.0003322714,0.0025068035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832064,0.00060834904,0.00008021194,0.00027092115,0.0005420571,0.00017778123],"domain_scores_gemma":[0.99763584,0.001563799,0.00017147338,0.00016563425,0.00035235778,0.00011080428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002277684,0.0021714247,0.0017797033,0.0017048467,0.0007126579,0.0021777258,0.0031340385,0.001693172,0.0060994695],"category_scores_gemma":[0.004972993,0.001559599,0.0027410903,0.0023655386,0.0011227411,0.0016703081,0.00261703,0.003063982,0.0009601544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004300833,0.00012276566,0.00032981968,0.00015420673,0.000060571,0.00008390089,0.000052029463,0.9395139,0.0010626868,0.026524477,0.0019771638,0.030075373],"study_design_scores_gemma":[0.0000071721147,0.000012981796,0.000029620503,0.000008380758,0.000005710059,0.000011580479,0.000009332904,0.9922087,0.00025976048,0.006579071,0.00086299615,0.000004637493],"about_ca_topic_score_codex":0.0045821103,"about_ca_topic_score_gemma":0.004545514,"teacher_disagreement_score":0.0060994695,"about_ca_system_score_codex":0.0016413399,"about_ca_system_score_gemma":0.0020131415,"threshold_uncertainty_score":0.020404756},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004048725,0.00033264197,0.9938412,0.000050005878,0.00002971806,0.00006175661,0.000029329172,0.0001590342,0.0014476278],"genre_scores_gemma":[0.10043802,0.0008213789,0.89674956,0.00011168446,0.000055133118,0.00029544553,0.00024996922,0.00013104829,0.0011477686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867946,0.00054680434,0.000104338986,0.00011792808,0.00040992614,0.00014156754],"domain_scores_gemma":[0.9978951,0.0013579391,0.00019378285,0.0002019906,0.00026610098,0.000085073865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014687777,0.0011715753,0.0016474968,0.0013707033,0.00069131487,0.00133981,0.0017964818,0.0012801972,0.0021040456],"category_scores_gemma":[0.004065766,0.00062675634,0.0013078114,0.0025511768,0.0011179439,0.0014967738,0.0018334279,0.0019019679,0.00079527014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009290312,0.00011764658,0.0003341342,0.00022882485,0.00006741214,0.00014739057,0.00012623201,0.857686,0.002146709,0.041298117,0.002978563,0.09477608],"study_design_scores_gemma":[0.000037963026,0.000082827355,0.0001280048,0.000045979796,0.000023979588,0.000116143274,0.000043371932,0.9438322,0.0015819498,0.0502546,0.0038244268,0.000028479399],"about_ca_topic_score_codex":0.0013326616,"about_ca_topic_score_gemma":0.0014172379,"teacher_disagreement_score":0.0021040456,"about_ca_system_score_codex":0.0007591784,"about_ca_system_score_gemma":0.0010025277,"threshold_uncertainty_score":0.007767737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021240411,0.0050022714,0.87879056,0.004709726,0.0011829573,0.00024891092,0.0048228744,0.0017764206,0.082225874],"genre_scores_gemma":[0.40011975,0.007890527,0.3735413,0.0021510755,0.0020168268,0.0006314954,0.018311504,0.0012493257,0.19408828],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989636,0.00021090373,0.000052468855,0.00032703247,0.00024029244,0.00020558438],"domain_scores_gemma":[0.99896085,0.00048283712,0.000100485035,0.00014628575,0.0001935522,0.00011603141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008693231,0.0012797846,0.0017912145,0.0011313866,0.0009826453,0.0028651392,0.0016427516,0.0027065843,0.04120718],"category_scores_gemma":[0.0030901693,0.00053142913,0.00084158184,0.0023840498,0.00091596623,0.0032478278,0.002012492,0.0036219193,0.010590311],"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.00058449974,0.00034488758,0.0011337902,0.0010286965,0.00019551486,0.0003300555,0.00012742242,0.14781299,0.0038339377,0.20710558,0.2064515,0.4310512],"study_design_scores_gemma":[0.00018634534,0.00016241599,0.001465138,0.0001696564,0.00006971874,0.0006731538,0.00020578587,0.5985902,0.0047509763,0.29049715,0.1031544,0.00007517144],"about_ca_topic_score_codex":0.002748615,"about_ca_topic_score_gemma":0.002356189,"teacher_disagreement_score":0.04120718,"about_ca_system_score_codex":0.0009959214,"about_ca_system_score_gemma":0.0015345337,"threshold_uncertainty_score":0.13785172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51228404,0.0016483014,0.2774839,0.021898603,0.0009137349,0.00036420932,0.00087527017,0.00048057272,0.18405135],"genre_scores_gemma":[0.9719254,0.00028468564,0.01569847,0.0008605481,0.00016903522,0.00011849243,0.00019202192,0.000070543836,0.010680839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9914982,0.0028618744,0.0005897909,0.0016734002,0.0021122918,0.0012644287],"domain_scores_gemma":[0.9594643,0.019231293,0.008210802,0.006588254,0.004322986,0.0021823165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007389477,0.00064246746,0.0011169055,0.0014853319,0.0019799958,0.003696627,0.0014986015,0.0027389303,0.0125538185],"category_scores_gemma":[0.05866704,0.0004026869,0.00058641314,0.0015551124,0.0059606647,0.004428845,0.002482826,0.0029336947,0.0011422677],"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.00063343096,0.00023890471,0.058398698,0.00026670704,0.00019262185,0.0013706243,0.0024250718,0.060698014,0.002000956,0.7597111,0.023364391,0.09069946],"study_design_scores_gemma":[0.00009356169,0.0002605393,0.03681305,0.00015071282,0.000044234544,0.00055898534,0.0017560134,0.14408997,0.0016958507,0.7943827,0.02000402,0.00015036581],"about_ca_topic_score_codex":0.0117008705,"about_ca_topic_score_gemma":0.006565851,"teacher_disagreement_score":0.0125538185,"about_ca_system_score_codex":0.0027503266,"about_ca_system_score_gemma":0.0022436588,"threshold_uncertainty_score":0.041996658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010081776,0.00021619587,0.9844736,0.00030614255,0.00005046001,0.00012926018,0.00014518082,0.00012333233,0.0044740853],"genre_scores_gemma":[0.13342153,0.0006199405,0.86099017,0.0002123252,0.00007712655,0.0004405123,0.00030950992,0.00010688128,0.0038220433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926573,0.00025750452,0.000036941914,0.00016173141,0.00019485457,0.000083161336],"domain_scores_gemma":[0.9983816,0.0011950844,0.00012292323,0.00007923694,0.00014935315,0.00007180148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012612056,0.0012565802,0.00083145255,0.0009200927,0.0005985521,0.001552561,0.0018141269,0.0013032052,0.005322753],"category_scores_gemma":[0.002867268,0.00088203046,0.0013568302,0.0023879667,0.0009334201,0.0012822053,0.0009951697,0.001921813,0.0004363743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021094545,0.000057894526,0.00016196632,0.000089443056,0.000021914764,0.00004711853,0.00003114226,0.9653337,0.0007740607,0.01706757,0.00084136764,0.015552758],"study_design_scores_gemma":[0.0000126124605,0.000022361653,0.000041778385,0.000007441707,0.0000058885425,0.000012770786,0.0000119740125,0.9941923,0.00027265024,0.004459186,0.00095580344,0.0000052903288],"about_ca_topic_score_codex":0.010945755,"about_ca_topic_score_gemma":0.012640395,"teacher_disagreement_score":0.010945755,"about_ca_system_score_codex":0.0013992797,"about_ca_system_score_gemma":0.0028778624,"threshold_uncertainty_score":0.0217641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7565968,0.0010748121,0.20158231,0.00062162953,0.00011465953,0.0002677641,0.0005409167,0.0007947791,0.03840635],"genre_scores_gemma":[0.96740794,0.00022174319,0.0231545,0.000030574785,0.000005825725,0.00009000444,0.00012750045,0.000072533614,0.008889459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973387,0.00005861626,0.000007491612,0.000035511486,0.00009217069,0.000072382805],"domain_scores_gemma":[0.9995771,0.00022452633,0.000045942026,0.000028080585,0.00008594396,0.000038369242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053339585,0.00078253367,0.0008165494,0.00055008207,0.0005927433,0.0013342974,0.0007296622,0.0010964397,0.004806784],"category_scores_gemma":[0.0010847832,0.00062609155,0.0009553973,0.00059108745,0.00042530565,0.0007083626,0.00047417582,0.00059711304,0.00036727675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013148719,0.000029780324,0.00036220555,0.00007070644,0.000012582777,0.00009535293,0.000015911854,0.9902429,0.0027130025,0.00074492674,0.00018199564,0.005399086],"study_design_scores_gemma":[0.00001713443,0.00013780533,0.00048393712,0.0000070242013,0.000014136869,0.000019234321,0.00002838785,0.9964282,0.0019669796,0.0004725203,0.00041677727,0.0000079624915],"about_ca_topic_score_codex":0.01915514,"about_ca_topic_score_gemma":0.020370794,"teacher_disagreement_score":0.01915514,"about_ca_system_score_codex":0.0015504387,"about_ca_system_score_gemma":0.0015933614,"threshold_uncertainty_score":0.03808731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01520444,0.00018646126,0.9769105,0.00019999509,0.000068804395,0.00016395249,0.00013627703,0.0012271204,0.005902608],"genre_scores_gemma":[0.14381675,0.00015535396,0.8499523,0.00011982313,0.000030224926,0.0004892555,0.00048367772,0.00017364837,0.004779062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995666,0.00013419962,0.000025886595,0.000100901176,0.0000902816,0.00008204334],"domain_scores_gemma":[0.99960786,0.00021422743,0.00003925773,0.000031697695,0.00007110643,0.000035869176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007844122,0.0009363528,0.0012234878,0.00091716094,0.00073393475,0.0013116078,0.0016145502,0.0016536076,0.0075400365],"category_scores_gemma":[0.0014703185,0.00058820104,0.00086859573,0.0011151843,0.0004621265,0.0010705149,0.0011917589,0.0012446607,0.0013598074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023561296,0.0001800309,0.0005328907,0.00012978447,0.00005300071,0.00007508857,0.000062111605,0.85481787,0.001990613,0.011794696,0.0050228448,0.12510541],"study_design_scores_gemma":[0.000035566572,0.000026903137,0.000040547395,0.0000065394015,0.0000050792564,0.000011370308,0.000009464843,0.99637514,0.00035609916,0.0019830423,0.0011457514,0.000004363561],"about_ca_topic_score_codex":0.0045212065,"about_ca_topic_score_gemma":0.0040371283,"teacher_disagreement_score":0.0075400365,"about_ca_system_score_codex":0.0010559924,"about_ca_system_score_gemma":0.0016784287,"threshold_uncertainty_score":0.02522397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024852827,0.00020871105,0.992589,0.00007232298,0.000071766604,0.00003807125,0.000034526984,0.00027972553,0.004220559],"genre_scores_gemma":[0.09651283,0.00037265482,0.8978636,0.00021869589,0.0000812183,0.00019935916,0.00024417866,0.00030258708,0.004204876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923027,0.00015655316,0.000040551047,0.00010590754,0.0004039741,0.00006279687],"domain_scores_gemma":[0.99878436,0.00075266324,0.000058100602,0.000116256124,0.00024141447,0.000047178546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010850515,0.0014323668,0.0015956812,0.0012264048,0.0004576951,0.0012471356,0.002110239,0.0014997585,0.0059896684],"category_scores_gemma":[0.0038311766,0.00096476957,0.00090154255,0.0030262102,0.0007733149,0.0021914062,0.0020330448,0.002435788,0.0013370361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007335687,0.00015738189,0.00013883354,0.00019380561,0.00004300608,0.000036680794,0.00004666966,0.8065811,0.0025531452,0.01959176,0.004734363,0.1658498],"study_design_scores_gemma":[0.000008991666,0.000011269324,0.000015609632,0.0000070097526,0.0000030191354,0.0000071211925,0.0000033001545,0.9958514,0.00023860675,0.0033642836,0.0004851579,0.0000042520837],"about_ca_topic_score_codex":0.007262207,"about_ca_topic_score_gemma":0.008207702,"teacher_disagreement_score":0.007262207,"about_ca_system_score_codex":0.0005978474,"about_ca_system_score_gemma":0.0013233495,"threshold_uncertainty_score":0.020037472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16748185,0.010625176,0.5977253,0.01364638,0.0008333157,0.0003847413,0.0031412737,0.001403864,0.20475814],"genre_scores_gemma":[0.5487139,0.0078036017,0.3878677,0.0013859853,0.0013075905,0.00073018007,0.0035345252,0.0016106239,0.047045946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745005,0.0008790816,0.00011944243,0.00038297853,0.00086778746,0.00030062377],"domain_scores_gemma":[0.98328775,0.014245457,0.0005169107,0.0011622795,0.0004683419,0.0003191928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018481974,0.0013827388,0.002558973,0.0014538013,0.0015349159,0.0049801827,0.003513755,0.0023587157,0.022545755],"category_scores_gemma":[0.021934755,0.0012313214,0.0018014129,0.0039216704,0.0022360564,0.010323343,0.0040216967,0.0051221005,0.0022846817],"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.0009148956,0.00039849375,0.002113496,0.0010940086,0.0001851503,0.0002800579,0.0005948629,0.23625253,0.0029007383,0.49980274,0.058857966,0.19660515],"study_design_scores_gemma":[0.00010673139,0.000062491,0.0005964142,0.000097436816,0.000057656227,0.00015725556,0.00015325278,0.40670893,0.0007457554,0.5845873,0.006699836,0.00002684262],"about_ca_topic_score_codex":0.005080649,"about_ca_topic_score_gemma":0.0060476367,"teacher_disagreement_score":0.022545755,"about_ca_system_score_codex":0.0026828146,"about_ca_system_score_gemma":0.0016935541,"threshold_uncertainty_score":0.07542306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012358208,0.011210469,0.621114,0.0027434104,0.0017330846,0.00017382197,0.0013192358,0.000569899,0.3487779],"genre_scores_gemma":[0.18430565,0.020723658,0.3413438,0.0018364539,0.0019021687,0.0005721492,0.0048407884,0.0016093584,0.44286603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.00015017313,0.000038374663,0.00021393038,0.0002506704,0.000088843124],"domain_scores_gemma":[0.9994543,0.00023804056,0.00004163485,0.00014292808,0.00007954615,0.00004348369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006723342,0.0016117762,0.001395166,0.0007824457,0.0010071357,0.003391683,0.0017685159,0.002114351,0.036509532],"category_scores_gemma":[0.0022558705,0.0009564533,0.0011501231,0.0020455925,0.0012706182,0.004325524,0.002003481,0.0045214575,0.007370583],"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.000128677,0.00016713291,0.00015480281,0.00048242442,0.00004966308,0.000116394964,0.00007482606,0.055682402,0.0019396904,0.6322489,0.07960008,0.22935502],"study_design_scores_gemma":[0.00002990716,0.00008139453,0.00031693914,0.00018994136,0.00003326263,0.00028177205,0.000084072024,0.10364592,0.0028223759,0.7381306,0.15434392,0.000039857336],"about_ca_topic_score_codex":0.001110761,"about_ca_topic_score_gemma":0.000942206,"teacher_disagreement_score":0.036509532,"about_ca_system_score_codex":0.00089584355,"about_ca_system_score_gemma":0.000881736,"threshold_uncertainty_score":0.12213659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008417262,0.00034319863,0.97996867,0.000258931,0.0002134624,0.00008876374,0.00014591729,0.0012010982,0.009362739],"genre_scores_gemma":[0.06652498,0.00041798485,0.9221101,0.000221718,0.00019089931,0.00027966104,0.00058968784,0.0005381288,0.009126791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990312,0.00020519597,0.000049746912,0.00017669439,0.00038379765,0.0001533032],"domain_scores_gemma":[0.99858356,0.00068384636,0.00006718636,0.0003486632,0.00023745764,0.00007932192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011665979,0.001698555,0.0021475817,0.0013662272,0.0009502704,0.0022067,0.0033699214,0.0021276057,0.012369329],"category_scores_gemma":[0.004628993,0.000720405,0.0016568336,0.0028332178,0.00094901776,0.0033397533,0.0027093685,0.0036193565,0.0041495785],"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.0005288034,0.00047417817,0.0006414857,0.0003373128,0.00008726458,0.00014645237,0.00017789126,0.17440239,0.008317805,0.14767286,0.031510916,0.6357026],"study_design_scores_gemma":[0.00017388126,0.00010894294,0.00024795995,0.000037447568,0.000050670467,0.00015782955,0.0000487268,0.9014513,0.0022692638,0.08388555,0.0115416385,0.00002680704],"about_ca_topic_score_codex":0.0030272375,"about_ca_topic_score_gemma":0.0034119212,"teacher_disagreement_score":0.012369329,"about_ca_system_score_codex":0.001465223,"about_ca_system_score_gemma":0.0016959767,"threshold_uncertainty_score":0.04137957},"labels":[],"label_agreement":null}]}