{"meta":{"query_hash":"9018dc6bc9d9","filters":{"venue":"Algorithmic operations research"},"cohort_total":40,"direct_labels_cover":0,"predictions_cover":40,"exported":40,"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/9018dc6bc9d9","api":"https://metacan.xera.ac/api/v1/cohort?venue=Algorithmic+operations+research"},"results":[{"id":"W1481493156","doi":"","title":"Optimization in 2 m 3 n Factorial Experiments","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","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":"Computer science; Integer programming; Factorial experiment; Post hoc; Factorial; Design of experiments; Mathematical optimization; Orthogonal array; Theoretical computer science; Industrial engineering; Algorithm; Mathematics; Machine learning; Taguchi methods; Engineering; Statistics","score_opus":0.5038899504498755,"score_gpt":0.6029256541613165,"score_spread":0.09903570371144099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481493156","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.0092253,0.00041123034,0.9877751,0.00019162017,0.000031981035,0.0003150551,0.00006624944,0.00011290559,0.0018705423],"genre_scores_gemma":[0.14709887,0.00048357164,0.84777874,0.00022236288,0.00006403502,0.0025571904,0.000116219555,0.00006402567,0.0016149059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9595641,0.03424145,0.0010953585,0.0027563637,0.001735892,0.00060690305],"domain_scores_gemma":[0.9535488,0.04115858,0.0024634195,0.0017102439,0.00082546327,0.00029357304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027076438,0.0018609653,0.0030251918,0.0012061957,0.00080546475,0.0018653921,0.0018269522,0.0015388796,0.0030382813],"category_scores_gemma":[0.040364884,0.001479337,0.002226301,0.001866889,0.0030946499,0.0018865096,0.0019618939,0.0016961157,0.0004400799],"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.0012104879,0.0003713207,0.0015798424,0.001616716,0.00041964045,0.0002024697,0.00029993968,0.65069246,0.0045711817,0.21581066,0.001611354,0.12161399],"study_design_scores_gemma":[0.0004475489,0.0015598073,0.0012453557,0.00010770849,0.00010798649,0.00006571824,0.00007946775,0.7689641,0.002990894,0.21933585,0.005022605,0.00007289151],"about_ca_topic_score_codex":0.0018500692,"about_ca_topic_score_gemma":0.0024841605,"teacher_disagreement_score":0.027076438,"about_ca_system_score_codex":0.0028044933,"about_ca_system_score_gemma":0.0036452177,"threshold_uncertainty_score":0.14319563},"labels":[],"label_agreement":null},{"id":"W1482466102","doi":"","title":"Probabilistic optimization in graph-problems","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"Probabilistic logic; Null graph; Voltage graph; Graph; Mathematics; Graph property; Vertex (graph theory); Computation; Regular graph; Combinatorics; Mathematical optimization; Discrete mathematics; Line graph; Algorithm","score_opus":0.05702908760854954,"score_gpt":0.34465273981799505,"score_spread":0.2876236522094455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482466102","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.015114927,0.0015947372,0.9716015,0.0022938321,0.000081450504,0.00008299996,0.00024193525,0.00018573785,0.008802903],"genre_scores_gemma":[0.65165824,0.0044550505,0.3276315,0.0011579598,0.00094764173,0.00064255774,0.0009177805,0.00031953305,0.01226977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556726,0.002240198,0.00017850428,0.000794271,0.00081479724,0.00040501333],"domain_scores_gemma":[0.98460686,0.0131394435,0.00084361684,0.00075064145,0.00038519435,0.00027432706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041732593,0.0017135638,0.0016114747,0.0013059872,0.0010447531,0.00360248,0.0022365118,0.0025369304,0.004846787],"category_scores_gemma":[0.016167399,0.0008338113,0.0021762145,0.0027419417,0.004026406,0.00859537,0.002789491,0.00500815,0.0007155914],"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.000038967337,0.000057675625,0.00031760687,0.00020950363,0.000050078976,0.00006950947,0.000098810495,0.17691714,0.0003575416,0.8117218,0.0019517471,0.008209635],"study_design_scores_gemma":[0.00001795954,0.000029701063,0.000121851706,0.000019837393,0.000013587895,0.000040918334,0.000026900518,0.33281067,0.0001877555,0.6641139,0.00260586,0.000011077917],"about_ca_topic_score_codex":0.0024875435,"about_ca_topic_score_gemma":0.0022484171,"teacher_disagreement_score":0.004846787,"about_ca_system_score_codex":0.0038602287,"about_ca_system_score_gemma":0.0015961151,"threshold_uncertainty_score":0.028008103},"labels":[],"label_agreement":null},{"id":"W1488163438","doi":"","title":"Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"graph theory and CDMA systems","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":"Mathematics; Multileaf collimator; Integer matrix; Context (archaeology); Mathematical optimization; Binary number; Decomposition method (queueing theory); Algorithm; Discrete mathematics; Beam (structure); Symmetric matrix; Nonnegative matrix","score_opus":0.03833592896667294,"score_gpt":0.3791121652766149,"score_spread":0.34077623630994197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488163438","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.046873055,0.00029563456,0.946914,0.00027687754,0.000030134972,0.00009292491,0.00014115084,0.0001729103,0.0052033295],"genre_scores_gemma":[0.40329272,0.00051020953,0.58763224,0.00012466693,0.00007012796,0.0001712569,0.00046179694,0.00015471593,0.0075822244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959534,0.00014456322,0.000016030674,0.000066048975,0.0001209952,0.000057027173],"domain_scores_gemma":[0.99929,0.0003958588,0.000104241204,0.000099938225,0.000059771468,0.000050180402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057891605,0.00064449495,0.0004189171,0.0005113385,0.00041127493,0.0007941792,0.0004228532,0.0005045374,0.004110792],"category_scores_gemma":[0.0021365567,0.00032165207,0.00047509966,0.000809029,0.0006620974,0.0011892691,0.00069177087,0.0008139535,0.0006789749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036540147,0.0001274619,0.0007324754,0.00037106036,0.000043435062,0.00017440427,0.00025982532,0.5462837,0.028026234,0.22200799,0.0056752283,0.19593278],"study_design_scores_gemma":[0.000043048352,0.000146318,0.000418728,0.000027073978,0.000022105527,0.000110577086,0.0000816936,0.83337617,0.0069032726,0.15346642,0.005383588,0.000021003232],"about_ca_topic_score_codex":0.0020830114,"about_ca_topic_score_gemma":0.0039567733,"teacher_disagreement_score":0.004110792,"about_ca_system_score_codex":0.00089316815,"about_ca_system_score_gemma":0.0008561005,"threshold_uncertainty_score":0.013751924},"labels":[],"label_agreement":null},{"id":"W1498489264","doi":"","title":"Complementarity Problems And Positive Definite Matrices","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Mathematical Inequalities and Applications","field":"Mathematics","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":"Positive-definite matrix; Complementarity (molecular biology); Mathematics; Semidefinite programming; Linear complementarity problem; Semidefinite embedding; Complementarity theory; Matrix (chemical analysis); Regular polygon; Combinatorics; Applied mathematics; Mathematical optimization; Quadratically constrained quadratic program; Nonlinear system; Eigenvalues and eigenvectors","score_opus":0.36717440365499077,"score_gpt":0.4818244199868566,"score_spread":0.11465001633186583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498489264","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.017263735,0.0023929637,0.9338268,0.0012075535,0.00019943208,0.00007278574,0.00024032485,0.00010299618,0.04469334],"genre_scores_gemma":[0.67483896,0.0068435525,0.28356597,0.0011665537,0.0011114731,0.0005194927,0.0008527626,0.00015960894,0.030941727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985655,0.0004945075,0.00006438141,0.00029090562,0.00047076016,0.00011397254],"domain_scores_gemma":[0.9985026,0.0008621435,0.00019202525,0.00010422386,0.00027910428,0.000059907656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011556019,0.000945193,0.0006360824,0.0009787529,0.0008106588,0.0018240459,0.0005621816,0.0010140192,0.0067667095],"category_scores_gemma":[0.0037446215,0.0003147412,0.00066418236,0.0013678077,0.0031045808,0.0022698021,0.0013382611,0.002127622,0.001206168],"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.000019057641,0.000022805052,0.00015946075,0.00013532482,0.000017627086,0.00016509484,0.00014514773,0.01940057,0.00150051,0.9535605,0.0033341565,0.021539677],"study_design_scores_gemma":[0.000010598551,0.0000350037,0.00017872079,0.00002959347,0.0000068504146,0.0002324563,0.00008858305,0.07128516,0.0008812665,0.91326517,0.013967073,0.000019538815],"about_ca_topic_score_codex":0.0011643947,"about_ca_topic_score_gemma":0.0008781571,"teacher_disagreement_score":0.0067667095,"about_ca_system_score_codex":0.0008007902,"about_ca_system_score_gemma":0.0008182302,"threshold_uncertainty_score":0.02263689},"labels":[],"label_agreement":null},{"id":"W1501033600","doi":"","title":"Some Structural Properties of a Least Central Subtree of a Tree","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Combinatorics; Cardinality (data modeling); Tree (set theory); Mathematics; Graph; Set (abstract data type); Discrete mathematics; Computer science; Data mining","score_opus":0.05119654889255751,"score_gpt":0.3449830083518981,"score_spread":0.29378645945934057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501033600","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.7539953,0.0008675192,0.22408468,0.0008591139,0.00004332432,0.00008138416,0.00044618428,0.00020183247,0.01942064],"genre_scores_gemma":[0.9108489,0.00040636712,0.08331102,0.00012545305,0.00012451167,0.000082709084,0.000775903,0.00014575658,0.004179279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943525,0.00012294186,0.000036516365,0.00014475334,0.00016700875,0.0000935486],"domain_scores_gemma":[0.99644035,0.0016973853,0.0006596675,0.0003328862,0.0003956403,0.00047412133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000956401,0.00022568302,0.00059845025,0.0012202256,0.0015873323,0.0019620182,0.0007688844,0.0008915395,0.0032282453],"category_scores_gemma":[0.004373435,0.00042577583,0.00060040306,0.0014741591,0.0024098814,0.0028873135,0.0013622994,0.0011174653,0.00049564766],"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.00019458776,0.000095295225,0.004203733,0.00022311127,0.000023494236,0.0007435664,0.001716229,0.010690988,0.02246163,0.93228114,0.0021335443,0.02523263],"study_design_scores_gemma":[0.000061000977,0.00014793756,0.0028256522,0.00005403459,0.000037655478,0.0010507941,0.001034932,0.053674836,0.008498638,0.922882,0.009695185,0.000037323447],"about_ca_topic_score_codex":0.00073690974,"about_ca_topic_score_gemma":0.0009849289,"teacher_disagreement_score":0.0032282453,"about_ca_system_score_codex":0.0008715205,"about_ca_system_score_gemma":0.00060488895,"threshold_uncertainty_score":0.010799587},"labels":[],"label_agreement":null},{"id":"W1506248691","doi":"","title":"A Network Flow Model for Irrigation Water Management","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Water resources management and optimization","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":"Prosperity; Computer science; Irrigation; Flow network; Water flow; Mathematical optimization; Operations research; Water resource management; Environmental science; Environmental engineering; Mathematics; Economics; Ecology","score_opus":0.054873097763336647,"score_gpt":0.2986850760117749,"score_spread":0.24381197824843825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506248691","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.0076184315,0.0006432934,0.9599329,0.0014269971,0.00019749884,0.00011885646,0.0010063535,0.00034352066,0.028712198],"genre_scores_gemma":[0.6215983,0.0045745806,0.260181,0.0005388991,0.00043101795,0.001357894,0.002195761,0.00038268682,0.1087399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995554,0.00017016503,0.000019594572,0.00008648614,0.000103447404,0.00006501005],"domain_scores_gemma":[0.9995499,0.00025496466,0.000049838192,0.000019760202,0.000092305105,0.000033133856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088159146,0.0011140949,0.00084953505,0.0009177536,0.0009814061,0.0018339176,0.0022084643,0.0026260118,0.014162263],"category_scores_gemma":[0.0021633685,0.0005824754,0.0009482928,0.002159551,0.00084043114,0.003249137,0.00095467677,0.0018300915,0.0013014327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013444029,0.000023701952,0.00012592641,0.000023234361,0.00000760982,0.000037528534,0.000025384894,0.9112051,0.00019551575,0.081427485,0.0018856346,0.0050294576],"study_design_scores_gemma":[0.000005908732,0.000008225633,0.000036132016,0.000005291449,0.0000032351284,0.000008745557,0.000006740362,0.97939134,0.000034308916,0.017320674,0.0031742945,0.000005119344],"about_ca_topic_score_codex":0.024749378,"about_ca_topic_score_gemma":0.01821371,"teacher_disagreement_score":0.024749378,"about_ca_system_score_codex":0.0032714352,"about_ca_system_score_gemma":0.0022404501,"threshold_uncertainty_score":0.049210608},"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":"W1526859640","doi":"","title":"K 3,3 Minors and the Maximum-Flow Problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Minor (academic); Combinatorics; Mathematics; Planar graph; Graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Graph minor; Flow (mathematics); Discrete mathematics; Planar; Computer science; Chordal graph; Line graph; Geometry; Voltage graph; Artificial intelligence","score_opus":0.053062170730478746,"score_gpt":0.34197726507755705,"score_spread":0.2889150943470783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526859640","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.6220156,0.0012725532,0.34545478,0.002803018,0.00012652477,0.0002591783,0.0012461677,0.0009000208,0.025922153],"genre_scores_gemma":[0.83730316,0.0007864425,0.14828278,0.00039137847,0.00015605525,0.0001873011,0.0023775236,0.00022993346,0.010285507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955076,0.000118648975,0.000027856544,0.00011697414,0.000068075984,0.00011767771],"domain_scores_gemma":[0.9986064,0.0006052785,0.00028940305,0.00018495142,0.00010176359,0.0002121864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818357,0.0007291944,0.00060484913,0.00058029406,0.0009323393,0.001287417,0.0009344087,0.00080885785,0.0036721635],"category_scores_gemma":[0.0023309183,0.00061615184,0.00093119266,0.0006864085,0.0010521029,0.003521733,0.0015084263,0.0011600797,0.0005692643],"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.0019253097,0.0008149045,0.0077814995,0.0007839697,0.00017861469,0.001116319,0.0014112914,0.1341136,0.032807514,0.6177224,0.028980937,0.17236371],"study_design_scores_gemma":[0.0001543014,0.0001962537,0.0028398538,0.000058561513,0.000058451427,0.001023053,0.00045952,0.15360427,0.0062090787,0.8169916,0.018359,0.00004603578],"about_ca_topic_score_codex":0.0023643216,"about_ca_topic_score_gemma":0.002232867,"teacher_disagreement_score":0.0036721635,"about_ca_system_score_codex":0.0008000634,"about_ca_system_score_gemma":0.0007232116,"threshold_uncertainty_score":0.012284577},"labels":[],"label_agreement":null},{"id":"W1529269817","doi":"","title":"Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms forMulti-objective Network Partitioning","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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":"Tabu search; Simulated annealing; Mathematical optimization; Heuristics; Computer science; Metaheuristic; Evolutionary algorithm; Set (abstract data type); Pareto principle; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.028422498015934283,"score_gpt":0.32132988627485826,"score_spread":0.292907388258924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529269817","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.7038182,0.01568528,0.24662603,0.0011107863,0.00045325307,0.00031456945,0.0004748539,0.0025512418,0.028965792],"genre_scores_gemma":[0.89044875,0.0017395597,0.10499777,0.00010985447,0.00004460179,0.00013359493,0.00040433768,0.00022893192,0.0018925088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996151,0.0022007609,0.00018331087,0.00023128046,0.0009552278,0.0002784932],"domain_scores_gemma":[0.9893121,0.008288579,0.0005175281,0.00073703524,0.0010010399,0.00014371071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040654107,0.0015168944,0.0017649393,0.002165052,0.00092795596,0.0017680201,0.0014883393,0.002252743,0.002072896],"category_scores_gemma":[0.014359878,0.00048134936,0.0010260459,0.002897493,0.0007350809,0.0019060567,0.0007795863,0.0008813617,0.0003348192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005302889,0.00020249233,0.0015938347,0.00028786744,0.00019544589,0.000039992115,0.000102260754,0.9157763,0.001968005,0.004594306,0.0009742317,0.07373493],"study_design_scores_gemma":[0.000038455888,0.0002668948,0.0009826113,0.000020775095,0.000042679385,0.00003806877,0.00004791114,0.9938552,0.0023826887,0.0015662919,0.00074336096,0.000015133327],"about_ca_topic_score_codex":0.007835726,"about_ca_topic_score_gemma":0.0054078824,"teacher_disagreement_score":0.007835726,"about_ca_system_score_codex":0.0019055931,"about_ca_system_score_gemma":0.0013977222,"threshold_uncertainty_score":0.02150017},"labels":[],"label_agreement":null},{"id":"W1536437679","doi":"","title":"Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Fraser Health; Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Image segmentation; Computer vision; Toolbox; Market segmentation; Image (mathematics); Noise reduction; Medical imaging; Pattern recognition (psychology); Scale-space segmentation; Markov random field","score_opus":0.08648639396389575,"score_gpt":0.4188762014867848,"score_spread":0.33238980752288905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536437679","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.5543638,0.0037235564,0.42392245,0.0008762754,0.00036358435,0.0006054589,0.0017625866,0.0054780357,0.008904271],"genre_scores_gemma":[0.6304034,0.0010076337,0.36032596,0.0001719117,0.00007073958,0.00030611563,0.0026720946,0.0012231617,0.003818903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971545,0.0010524011,0.00024375487,0.00044431022,0.000913561,0.00019144511],"domain_scores_gemma":[0.9847217,0.010253766,0.0006386923,0.0016488883,0.0024623978,0.0002744716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042554014,0.0009842133,0.0011528895,0.0021581755,0.0008650499,0.0010483344,0.0009000127,0.0014402617,0.0034540158],"category_scores_gemma":[0.024779364,0.0004407915,0.000538112,0.0018763499,0.0008451657,0.00093363837,0.00062132,0.00057670707,0.0009403456],"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.0050351373,0.0012335774,0.0049207243,0.0023708337,0.00037807832,0.0006156833,0.0010892617,0.2389428,0.24704574,0.003985171,0.007820622,0.48656237],"study_design_scores_gemma":[0.00021082499,0.001932287,0.01320377,0.00013177987,0.00018933261,0.0011421845,0.00036500386,0.805132,0.16817786,0.00326822,0.0061240103,0.00012272462],"about_ca_topic_score_codex":0.0056705778,"about_ca_topic_score_gemma":0.0048829676,"teacher_disagreement_score":0.0056705778,"about_ca_system_score_codex":0.00088332786,"about_ca_system_score_gemma":0.0006670951,"threshold_uncertainty_score":0.022504985},"labels":[],"label_agreement":null},{"id":"W1541832321","doi":"","title":"Multiobjective Optimization in Health Care Management. A metaheuristic and simulation approach.","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Metaheuristic; Context (archaeology); Computer science; Mathematical optimization; Management science; Operations research; Multi-objective optimization; Quality (philosophy); Health care; Mathematics; Machine learning; Artificial intelligence; Engineering; Economics","score_opus":0.14069196126595543,"score_gpt":0.49944701197538677,"score_spread":0.35875505070943137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541832321","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.006033993,0.013559011,0.9490845,0.007369836,0.00049761246,0.00014648332,0.00015176901,0.00014924472,0.023007594],"genre_scores_gemma":[0.341785,0.013473235,0.6325351,0.001543198,0.00077628065,0.0007013456,0.00019192237,0.00013673874,0.008857114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791294,0.001448048,0.00006657226,0.0000977781,0.00041061983,0.00006389687],"domain_scores_gemma":[0.9978975,0.0015603221,0.00019068767,0.00009963036,0.00015049447,0.000101322825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003181242,0.0010394591,0.00095949037,0.0016153204,0.00049525686,0.0020880022,0.0011249095,0.0017130132,0.0021489451],"category_scores_gemma":[0.004608487,0.0005710421,0.0009979511,0.0017923068,0.0020616925,0.0016324486,0.0012718944,0.0020971,0.00035676718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023114288,0.000080484824,0.00067760446,0.00030346523,0.00022939166,0.00006311424,0.00009789562,0.58014524,0.0003284089,0.36999458,0.0044595124,0.043597136],"study_design_scores_gemma":[0.000029723833,0.000060413186,0.0002923842,0.00016625047,0.000039192604,0.00005306047,0.00011893356,0.6867349,0.00021440507,0.29649878,0.015774371,0.000017594037],"about_ca_topic_score_codex":0.00396355,"about_ca_topic_score_gemma":0.005342407,"teacher_disagreement_score":0.00396355,"about_ca_system_score_codex":0.0021862586,"about_ca_system_score_gemma":0.0034438907,"threshold_uncertainty_score":0.016824245},"labels":[],"label_agreement":null},{"id":"W1547588018","doi":"","title":"Recoverable Robustness for Train Shunting Problems","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":20,"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":"Robustness (evolution); Unavailability; Computer science; Shunting; Mathematical optimization; Exploit; Algorithm; Reliability engineering; Mathematics; Engineering","score_opus":0.05416012265873652,"score_gpt":0.3219233463933957,"score_spread":0.26776322373465916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547588018","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.020953426,0.001051011,0.9727419,0.0003487865,0.000039330662,0.00005405332,0.00008204504,0.00022831881,0.004501191],"genre_scores_gemma":[0.77530277,0.003316651,0.2125703,0.00024462133,0.00039972103,0.00033180413,0.0006081504,0.00041891684,0.006806974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981285,0.000609892,0.00013553807,0.0004054771,0.0005011615,0.00021945329],"domain_scores_gemma":[0.9931832,0.005176216,0.0007759594,0.00036954932,0.00031669848,0.00017835385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024842066,0.0016361799,0.0014586333,0.00153637,0.0005185372,0.0019875064,0.0012616622,0.0019462253,0.003482458],"category_scores_gemma":[0.010601263,0.0004336321,0.0023031784,0.0011026846,0.002145356,0.0024096705,0.0028453588,0.0028761814,0.00036488823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009882137,0.000047812147,0.00048405878,0.00030467386,0.000074139534,0.00016639101,0.0001201398,0.8712545,0.0036016325,0.101192825,0.0010269581,0.02162799],"study_design_scores_gemma":[0.000010057115,0.00006411517,0.00016721895,0.000027943383,0.000016275048,0.000067986046,0.000037323334,0.9149205,0.0011792019,0.08241146,0.0010814088,0.000016415137],"about_ca_topic_score_codex":0.00097268063,"about_ca_topic_score_gemma":0.0004135049,"teacher_disagreement_score":0.003482458,"about_ca_system_score_codex":0.0012086015,"about_ca_system_score_gemma":0.00071902404,"threshold_uncertainty_score":0.013137877},"labels":[],"label_agreement":null},{"id":"W1549649786","doi":"","title":"A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"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":"Interior point method; Algorithm; Newton's method in optimization; Complementarity (molecular biology); Centrality; Computer science; Kernel (algebra); Function (biology); Linear complementarity problem; Point (geometry); Mathematical optimization; Mathematics; Nonlinear system; Iterative method; Local convergence; Discrete mathematics; Combinatorics; Geometry","score_opus":0.18032849498786968,"score_gpt":0.45035541205422147,"score_spread":0.2700269170663518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549649786","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.0013566104,0.000045234883,0.9977558,0.000029834035,0.000010117842,0.000020047777,0.000009474353,0.00009618364,0.00067674485],"genre_scores_gemma":[0.07330146,0.00014445434,0.92345136,0.000058992417,0.000026808584,0.00025708927,0.00012821656,0.00017937867,0.0024522566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994306,0.00017447256,0.000032021733,0.00007678165,0.00023419998,0.000051830284],"domain_scores_gemma":[0.9992981,0.00035556266,0.00006297686,0.00008179477,0.00015204566,0.00004948365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008457554,0.0009038312,0.001088751,0.0006091017,0.0005731439,0.0006979719,0.0014868822,0.0011888682,0.0040318496],"category_scores_gemma":[0.0026649283,0.0004917903,0.0008882065,0.00078413973,0.0007837091,0.0014532469,0.0018963955,0.0019485339,0.00121558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017339096,0.00016152661,0.0004607479,0.00032513318,0.00005455286,0.00021489538,0.00017984265,0.7187539,0.008309719,0.09556373,0.0033752448,0.17242739],"study_design_scores_gemma":[0.000016649652,0.00001927406,0.000045189656,0.000007839286,0.0000038875696,0.00004162761,0.000005755047,0.989626,0.00079055683,0.008066853,0.0013685011,0.000007996769],"about_ca_topic_score_codex":0.0022028363,"about_ca_topic_score_gemma":0.0017629822,"teacher_disagreement_score":0.0040318496,"about_ca_system_score_codex":0.0006567708,"about_ca_system_score_gemma":0.0018947708,"threshold_uncertainty_score":0.013487816},"labels":[],"label_agreement":null},{"id":"W1559508785","doi":"","title":"Robust Selling Times in Adaptive Portfolio Management","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Stock price; Computer science; Portfolio; Stock (firearms); Portfolio optimization; Econometrics; Project portfolio management; Robust optimization; Investment strategy; Operations research; Mathematical optimization; Economics; Microeconomics; Financial economics; Mathematics; Series (stratigraphy); Profit (economics); Project management","score_opus":0.12120749882051815,"score_gpt":0.3038757568824742,"score_spread":0.18266825806195605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559508785","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.03400937,0.00077099033,0.96281075,0.0002695977,0.000037524773,0.000031278578,0.000028308656,0.0001790357,0.0018630817],"genre_scores_gemma":[0.9061461,0.0006141417,0.09074744,0.00009499118,0.00012137524,0.00012436749,0.00006234006,0.00007522738,0.0020138824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838626,0.00063275447,0.00009443844,0.00034805833,0.00040494642,0.00013367388],"domain_scores_gemma":[0.99461114,0.0038284392,0.00083611347,0.00027960926,0.00028257407,0.00016214194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039574387,0.0010350301,0.0013565051,0.00074601406,0.00045109214,0.0014666254,0.0012557134,0.0012207818,0.0016700069],"category_scores_gemma":[0.015003674,0.00071213953,0.00060535176,0.0007861535,0.0014806921,0.0023835578,0.001125402,0.001421118,0.00024747013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098404176,0.000038411683,0.00056392,0.0000453103,0.00004512577,0.000062256935,0.00005240071,0.9324189,0.0010304574,0.039190404,0.00028340876,0.026171155],"study_design_scores_gemma":[0.000012465964,0.000030944906,0.00010754601,0.000004244616,0.0000065139407,0.000012335944,0.0000046975374,0.97379965,0.000260129,0.025597831,0.00015567876,0.000008101027],"about_ca_topic_score_codex":0.0015277439,"about_ca_topic_score_gemma":0.00067569956,"teacher_disagreement_score":0.0039574387,"about_ca_system_score_codex":0.00091387896,"about_ca_system_score_gemma":0.000781442,"threshold_uncertainty_score":0.020929158},"labels":[],"label_agreement":null},{"id":"W1561159387","doi":"","title":"Mean-Absolute Deviation Portfolio Models with Discrete Choice Constraints","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":2,"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 Toronto","funders":"","keywords":"Portfolio; Variance (accounting); Mathematical optimization; Absolute deviation; Solver; Linear programming; Heuristic; Set (abstract data type); Portfolio optimization; Mathematics; Integer programming; Computer science; Statistics; Economics; Finance","score_opus":0.3088138248982664,"score_gpt":0.4443298865650969,"score_spread":0.1355160616668305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561159387","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.026294848,0.0012380297,0.9604247,0.0016190581,0.00015857695,0.00007488237,0.0003431124,0.00014421338,0.009702581],"genre_scores_gemma":[0.8240775,0.0015613451,0.15182486,0.000545401,0.00038061835,0.00037493603,0.0005384876,0.000084888736,0.02061208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615616,0.0020998083,0.00015053502,0.00067473034,0.0005805027,0.00033828415],"domain_scores_gemma":[0.99357295,0.004864221,0.00072043535,0.00029136965,0.0003320641,0.0002188863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005659154,0.0016588185,0.0026782996,0.00084805366,0.0005186932,0.00370246,0.003641268,0.0031705964,0.0054673506],"category_scores_gemma":[0.011899426,0.0011783858,0.0013503002,0.0018235989,0.0015419605,0.0038432446,0.0017935972,0.0034689265,0.0006527257],"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.000065046115,0.00007545416,0.00047249073,0.00007003958,0.0000873664,0.00013997294,0.000030262234,0.76784414,0.00017137974,0.2201628,0.0011868501,0.009694229],"study_design_scores_gemma":[0.00003198523,0.00003160156,0.000100574376,0.000011186488,0.000016469423,0.000033971428,0.0000083692685,0.897245,0.000101299986,0.101495914,0.0009104227,0.000013296959],"about_ca_topic_score_codex":0.002781348,"about_ca_topic_score_gemma":0.002697514,"teacher_disagreement_score":0.005659154,"about_ca_system_score_codex":0.0017230741,"about_ca_system_score_gemma":0.001443329,"threshold_uncertainty_score":0.029928803},"labels":[],"label_agreement":null},{"id":"W1563143451","doi":"","title":"The α-reliable shortest path problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Shortest path problem; Mathematical optimization; Computer science; Path (computing); Heuristic; Knapsack problem; Set (abstract data type); Integer programming; A priori and a posteriori; Constrained Shortest Path First; Longest path problem; Mathematics; K shortest path routing; Theoretical computer science","score_opus":0.08721923934476747,"score_gpt":0.3182600762586555,"score_spread":0.23104083691388802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563143451","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.06722223,0.0016838596,0.9110356,0.0014402075,0.00015270102,0.00033214004,0.0012635689,0.00039991247,0.01646977],"genre_scores_gemma":[0.7298191,0.0031005815,0.25356182,0.00022552241,0.00028702914,0.0006457614,0.0016707148,0.0002310042,0.010458493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981913,0.0007744547,0.000116703486,0.0003838193,0.0003326304,0.00020106004],"domain_scores_gemma":[0.99664694,0.0021698845,0.0005367103,0.00019472367,0.00027502375,0.00017670932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020682693,0.0014469072,0.001396433,0.0009550092,0.00074168434,0.0014291641,0.0015335184,0.0017966835,0.005116199],"category_scores_gemma":[0.008016433,0.00054716447,0.00070909003,0.0017741389,0.0010398919,0.0023499876,0.0011030955,0.0012341223,0.00079444115],"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.00014753557,0.000056862948,0.00050340465,0.0003525141,0.0000643992,0.00025514918,0.000119639415,0.8982842,0.0011426779,0.053005625,0.003907198,0.04216073],"study_design_scores_gemma":[0.00007302197,0.00016870478,0.0004189012,0.000057894962,0.00003692282,0.00037599247,0.00015466243,0.8399058,0.00094434526,0.14863819,0.009193487,0.000032043023],"about_ca_topic_score_codex":0.0017549986,"about_ca_topic_score_gemma":0.0009835385,"teacher_disagreement_score":0.005116199,"about_ca_system_score_codex":0.00084102916,"about_ca_system_score_gemma":0.0012377263,"threshold_uncertainty_score":0.017115355},"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":"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":"W1590078554","doi":"","title":"Simplex Adjacency Graphs in Linear Optimization","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Combinatorics; Simplex; Adjacency list; Mathematics; Context (archaeology); Linear programming; Chordal graph; Indifference graph; Degeneracy (biology); Duality (order theory); Discrete mathematics; Computer science; Graph; Mathematical optimization","score_opus":0.04304331769652263,"score_gpt":0.3724864654297721,"score_spread":0.32944314773324945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590078554","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.035913803,0.008686987,0.8617055,0.0028982672,0.0003488865,0.000061622486,0.00063437206,0.0004042718,0.089346215],"genre_scores_gemma":[0.7034984,0.011504607,0.25492013,0.00085480796,0.001056415,0.0003389798,0.0009285788,0.00036997246,0.026528072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929416,0.00033994386,0.000020993457,0.00013276855,0.00015500853,0.000057110392],"domain_scores_gemma":[0.9986785,0.0009225441,0.000116913645,0.00009611031,0.00012257973,0.00006334306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006491808,0.0008054237,0.0005378641,0.001455598,0.00084795675,0.002024651,0.0007407908,0.0013095876,0.0075190635],"category_scores_gemma":[0.0033231354,0.00045146383,0.0005708462,0.002663237,0.0023611754,0.003482481,0.0013901924,0.0022879874,0.0012878132],"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.0000069846806,0.000006698652,0.00007297805,0.000038378064,0.000005038684,0.000028812978,0.00007041775,0.017122118,0.00018505657,0.9705917,0.0017773649,0.010094389],"study_design_scores_gemma":[0.0000023262876,0.0000041831945,0.000052307973,0.000010091229,0.0000022924662,0.00001823388,0.000024383971,0.022981234,0.0000751978,0.9724715,0.0043536965,0.0000046589357],"about_ca_topic_score_codex":0.002397716,"about_ca_topic_score_gemma":0.001961544,"teacher_disagreement_score":0.0075190635,"about_ca_system_score_codex":0.0011917526,"about_ca_system_score_gemma":0.00050132046,"threshold_uncertainty_score":0.025153756},"labels":[],"label_agreement":null},{"id":"W1593747011","doi":"","title":"Global convergence of a primal-dual interior-point method for nonlinear programming","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":23,"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":"Interior point method; Iterated function; Convergence (economics); Nonlinear programming; Mathematical optimization; Dual (grammatical number); Point (geometry); Computer science; Nonlinear system; Linear programming; Mathematics; Mathematical analysis","score_opus":0.15464668638929757,"score_gpt":0.4936075924287063,"score_spread":0.3389609060394087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593747011","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.0017001816,0.000085412634,0.9969926,0.000046956542,0.000024559384,0.000018918283,0.000008748796,0.00006223354,0.0010603141],"genre_scores_gemma":[0.12742232,0.0002854684,0.86814487,0.000115846,0.000074024785,0.0002999507,0.000091766444,0.00032191846,0.003243729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988418,0.00059464853,0.000036411493,0.00011903103,0.00034884116,0.0000592661],"domain_scores_gemma":[0.9981462,0.0011848564,0.00009878013,0.00016931462,0.00032244617,0.00007841437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040788646,0.0010832843,0.001352389,0.0007557642,0.0005165942,0.000937178,0.0014021931,0.0011800072,0.0025883745],"category_scores_gemma":[0.0072556436,0.00068393245,0.0008991765,0.00054341526,0.0018291649,0.0011881426,0.0027349123,0.0026024734,0.00088558084],"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.000185271,0.00012476798,0.0006933435,0.00037200237,0.00008051493,0.0001351438,0.00019009736,0.7824449,0.0065600043,0.12182457,0.00268779,0.08470161],"study_design_scores_gemma":[0.000011651244,0.000022253793,0.00003869086,0.00001576087,0.0000048402917,0.000025757821,0.0000052683263,0.98583186,0.0010505038,0.011733039,0.0012545384,0.0000058476503],"about_ca_topic_score_codex":0.0007342436,"about_ca_topic_score_gemma":0.00061538065,"teacher_disagreement_score":0.0040788646,"about_ca_system_score_codex":0.00057151366,"about_ca_system_score_gemma":0.0011164752,"threshold_uncertainty_score":0.021571338},"labels":[],"label_agreement":null},{"id":"W1606844304","doi":"","title":"General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Line search; Convergence (economics); Mathematical optimization; Independence (probability theory); Line (geometry); Forcing (mathematics); Computer science; Mathematics; Applied mathematics; Mathematical analysis; Statistics","score_opus":0.11569012925258547,"score_gpt":0.46239019056594616,"score_spread":0.3467000613133607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606844304","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.004053128,0.00010425373,0.9928893,0.00005699388,0.000027451995,0.000044430923,0.000030296022,0.00008612297,0.0027080367],"genre_scores_gemma":[0.15881781,0.00036347457,0.8324926,0.00021397887,0.00006150004,0.00047120094,0.00013398977,0.00011829462,0.007327153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.00012766429,0.000028040862,0.00007569495,0.00019404665,0.000031299503],"domain_scores_gemma":[0.9996977,0.00010896298,0.000041757932,0.00007335297,0.00006279114,0.000015564947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079844304,0.0007069329,0.0006722946,0.00052227755,0.00042765652,0.0005025414,0.0012147635,0.0011306017,0.0055924435],"category_scores_gemma":[0.0013568618,0.00033386075,0.00069823134,0.0006976421,0.000667736,0.0010779091,0.0009956876,0.0010098548,0.0010388701],"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.00018019255,0.00016402903,0.00076940464,0.0005625041,0.00008980697,0.000448424,0.00019864082,0.5038792,0.05755463,0.2721118,0.0034185003,0.16062291],"study_design_scores_gemma":[0.00003704801,0.00007814729,0.00019448402,0.000023005166,0.000006955547,0.000117040436,0.000008446767,0.9639879,0.004678883,0.023587326,0.0072615114,0.000019293695],"about_ca_topic_score_codex":0.00052822835,"about_ca_topic_score_gemma":0.0013440077,"teacher_disagreement_score":0.0055924435,"about_ca_system_score_codex":0.0003079042,"about_ca_system_score_gemma":0.00078423944,"threshold_uncertainty_score":0.018708587},"labels":[],"label_agreement":null},{"id":"W1628824412","doi":"","title":"Uncertainty and Information: Foundations of Generalized Information Theory (a book review)","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","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":"Computer science; Epistemology; Management science; Mathematical economics; Information retrieval; Mathematics; Philosophy; Engineering","score_opus":0.1689708614860037,"score_gpt":0.45968607080501434,"score_spread":0.2907152093190106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1628824412","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.00033321895,0.9643285,0.007720265,0.005317871,0.0031588578,0.000026452726,0.0003085412,0.0000906364,0.018715609],"genre_scores_gemma":[0.0048720045,0.9644051,0.0060566445,0.003127479,0.005403176,0.000054973407,0.0004607338,0.0000705987,0.015549256],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991048,0.00011612319,0.000057239416,0.000117329655,0.00054477435,0.000059645037],"domain_scores_gemma":[0.9974825,0.0015938977,0.00016687583,0.00009146884,0.00056110387,0.00010423122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010810462,0.0011340355,0.0017279695,0.00411531,0.0005708247,0.0036169651,0.0010029848,0.001713912,0.012698617],"category_scores_gemma":[0.0048160036,0.0005762266,0.000759756,0.0076187826,0.0014767044,0.0051793098,0.0011232498,0.0030033346,0.007373915],"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.00003557723,0.00005110794,0.00021385796,0.0028338078,0.000073574796,0.00008819955,0.00013327124,0.0017484569,0.0003307693,0.03930618,0.45610577,0.4990795],"study_design_scores_gemma":[0.000009721295,0.000031452033,0.00076897745,0.0020606369,0.000033275264,0.00051671156,0.00008436456,0.00078032876,0.00014966294,0.05998989,0.93553776,0.000037192567],"about_ca_topic_score_codex":0.0024814927,"about_ca_topic_score_gemma":0.0028357464,"teacher_disagreement_score":0.012698617,"about_ca_system_score_codex":0.0014910635,"about_ca_system_score_gemma":0.0024038178,"threshold_uncertainty_score":0.042481124},"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":"W1651694003","doi":"","title":"Santosh Narayan Kabadi 1956-2010","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Social and Economic Development in India","field":"Social Sciences","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.10170559541952362,"score_gpt":0.4393494547887703,"score_spread":0.3376438593692467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651694003","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.032725003,0.06260103,0.031331193,0.060822323,0.05678859,0.0003176029,0.00433929,0.00070544746,0.7503695],"genre_scores_gemma":[0.18981448,0.029317282,0.013734309,0.0042284536,0.013275806,0.0001835464,0.0016965794,0.00027422546,0.74747527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889046,0.00019897158,0.00009980485,0.00030933216,0.0003927041,0.00010878522],"domain_scores_gemma":[0.997122,0.00078632514,0.00014946162,0.00043013776,0.0012578515,0.00025426483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014622199,0.0009484328,0.0007073221,0.0020136386,0.0022348303,0.0027758847,0.0010541149,0.001346406,0.043194845],"category_scores_gemma":[0.0055065737,0.00040063608,0.0005122633,0.002447522,0.0020739974,0.00226724,0.0027888294,0.0026014142,0.016731622],"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.00038375292,0.000121971665,0.00173608,0.0006753685,0.00007172529,0.0002984003,0.0007328025,0.004696278,0.001673838,0.35164228,0.3258822,0.31208536],"study_design_scores_gemma":[0.000018317856,0.00005543353,0.0013548372,0.00018588842,0.000030312536,0.00019137989,0.00011767409,0.0013673705,0.0014095933,0.023834478,0.9714121,0.00002257053],"about_ca_topic_score_codex":0.008672058,"about_ca_topic_score_gemma":0.01495866,"teacher_disagreement_score":0.043194845,"about_ca_system_score_codex":0.0067332755,"about_ca_system_score_gemma":0.0056447424,"threshold_uncertainty_score":0.14450121},"labels":[],"label_agreement":null},{"id":"W1669838345","doi":"","title":"The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":86,"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":"Decomposition; Computation; Set (abstract data type); Mathematical optimization; Computer science; Scale (ratio); Sampling (signal processing); Nested set model; Multistage sampling; Decomposition method (queueing theory); Mathematics; Algorithm; Statistics; Data mining","score_opus":0.1881139073848471,"score_gpt":0.5090869338795994,"score_spread":0.32097302649475223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669838345","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.0014355971,0.00007036814,0.99783057,0.000019973439,0.000013434109,0.00001694343,0.00001278478,0.000033012482,0.00056743366],"genre_scores_gemma":[0.10460519,0.0002680879,0.8919675,0.000059467944,0.000044372347,0.00021016189,0.00009444225,0.00009580845,0.0026550286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989812,0.00055327534,0.000025752413,0.000080502046,0.0002972335,0.00006202613],"domain_scores_gemma":[0.998971,0.0006303921,0.00008550715,0.000102919046,0.00012820619,0.00008195068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021587806,0.0006985718,0.0007850455,0.00039770664,0.00029029616,0.000505459,0.00087419525,0.0005412189,0.0028721837],"category_scores_gemma":[0.0040796506,0.00044808164,0.0008387758,0.0005067668,0.00066171226,0.0009610815,0.0010826385,0.0013660652,0.0004888931],"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.00009604775,0.000119480355,0.00049063197,0.00023373004,0.00007395146,0.00015708078,0.00011387269,0.67536426,0.008319509,0.21032757,0.0022406895,0.1024632],"study_design_scores_gemma":[0.000011047111,0.000031863216,0.000069402064,0.000010832201,0.0000062844492,0.000021928337,0.0000039712486,0.9731362,0.0005398477,0.024132188,0.0020298692,0.0000067067467],"about_ca_topic_score_codex":0.002773767,"about_ca_topic_score_gemma":0.003948408,"teacher_disagreement_score":0.0028721837,"about_ca_system_score_codex":0.0004594515,"about_ca_system_score_gemma":0.0013106931,"threshold_uncertainty_score":0.0114168525},"labels":[],"label_agreement":null},{"id":"W167710240","doi":"","title":"The alpha-reliable shortest path problem.","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Machine Learning and Algorithms","field":"Computer Science","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":"Alpha (finance); Path (computing); Shortest path problem; Mathematics; Combinatorics; Computer science; Statistics; Graph; Computer network","score_opus":0.04682918372997396,"score_gpt":0.343110913445022,"score_spread":0.296281729715048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167710240","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.09476851,0.0069080708,0.8331184,0.007775564,0.0011565229,0.0002882838,0.00468348,0.00091119984,0.050389938],"genre_scores_gemma":[0.73029566,0.005776505,0.23191398,0.0005438937,0.001259053,0.00044940764,0.003995752,0.0003929497,0.025372798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980907,0.0007202361,0.00012028883,0.00037088085,0.00045854793,0.00023937626],"domain_scores_gemma":[0.98787564,0.007910853,0.0011666785,0.0013378599,0.0011020117,0.0006069677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028193332,0.0011559878,0.0014397447,0.0013920683,0.0011602594,0.0021632325,0.002181857,0.0021155102,0.010007579],"category_scores_gemma":[0.02450563,0.0006024474,0.0006623662,0.0024363801,0.0014931025,0.005800354,0.0019470832,0.002340639,0.0022522856],"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.0011133859,0.0001725502,0.0020123126,0.0009964667,0.00022013529,0.00033900133,0.00028573084,0.30678642,0.0015011479,0.38723537,0.07093908,0.22839844],"study_design_scores_gemma":[0.00008676693,0.00010864023,0.00050747115,0.0000932341,0.000050494178,0.00026423167,0.00012314133,0.26366255,0.00087637553,0.7211393,0.013068098,0.000019707704],"about_ca_topic_score_codex":0.0013693463,"about_ca_topic_score_gemma":0.0013068278,"teacher_disagreement_score":0.010007579,"about_ca_system_score_codex":0.0010207735,"about_ca_system_score_gemma":0.0016016909,"threshold_uncertainty_score":0.033478737},"labels":[],"label_agreement":null},{"id":"W1823796094","doi":"","title":"Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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 Toronto; McMaster University","funders":"","keywords":"Software; Computer science; Radio frequency; Specific absorption rate; Algorithm; Pulse (music); Telecommunications","score_opus":0.2984122185525563,"score_gpt":0.4958848011205555,"score_spread":0.1974725825679992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823796094","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.11234398,0.0010036535,0.87589085,0.00040968647,0.00014426267,0.00027701535,0.00009674066,0.0013028852,0.008530847],"genre_scores_gemma":[0.3492896,0.00037361265,0.6466944,0.00014447718,0.000050658833,0.00032587373,0.00024064747,0.00048814187,0.0023924964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983701,0.0006526495,0.00009203943,0.00016382488,0.00059576036,0.00012563476],"domain_scores_gemma":[0.9914836,0.0060822554,0.00034887006,0.00035971517,0.0015206661,0.00020478816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004767641,0.0012674925,0.0010490223,0.0013732205,0.00051607325,0.0012216356,0.0017996663,0.0019968923,0.002199844],"category_scores_gemma":[0.012900844,0.0004953074,0.000722405,0.0012561267,0.00066145783,0.001337138,0.0012523339,0.0010902149,0.0003900117],"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.00090527424,0.00036938235,0.0013353318,0.00019612453,0.00009214334,0.000053136224,0.00013241223,0.7758657,0.002428522,0.01719205,0.0015790403,0.19985081],"study_design_scores_gemma":[0.000041587427,0.000113610186,0.00012956563,0.00000505718,0.000010597025,0.000015517962,0.000013792104,0.9975822,0.0008276482,0.00086545135,0.00038797624,0.000007112009],"about_ca_topic_score_codex":0.009741733,"about_ca_topic_score_gemma":0.0070189578,"teacher_disagreement_score":0.009741733,"about_ca_system_score_codex":0.0016008333,"about_ca_system_score_gemma":0.0022928526,"threshold_uncertainty_score":0.025214016},"labels":[],"label_agreement":null},{"id":"W2096143056","doi":"","title":"Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks","year":2007,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Decomposition; Computer science; Group (periodic table); Mathematics; Mathematical optimization; Theoretical computer science; Algorithm; Chemistry","score_opus":0.3875462872364164,"score_gpt":0.5302215977139096,"score_spread":0.14267531047749327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096143056","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.022351125,0.0005376508,0.9706124,0.00051464804,0.00010682846,0.00028979615,0.00014531732,0.0003832331,0.0050590513],"genre_scores_gemma":[0.13107817,0.00035789108,0.8643873,0.0002764976,0.000069578506,0.000662807,0.00036024736,0.00012897704,0.002678533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994902,0.0032411404,0.0002216107,0.0004404431,0.0007923494,0.00040236712],"domain_scores_gemma":[0.9920516,0.004976322,0.0005145299,0.0010801977,0.0009343261,0.00044299153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058790618,0.001769688,0.0015923657,0.0025925077,0.0008454533,0.0023452411,0.004518505,0.0031177283,0.0051593585],"category_scores_gemma":[0.01408757,0.0011222914,0.0018936953,0.0039437693,0.0012806832,0.0031274846,0.0024996686,0.0034176428,0.0009813028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081193354,0.0010339568,0.0011165461,0.00047369333,0.00028845135,0.00012591139,0.00047423484,0.6006574,0.0038081808,0.08653578,0.008527041,0.29614696],"study_design_scores_gemma":[0.00014873086,0.00012109089,0.00018039704,0.000026226506,0.000030161575,0.00006080952,0.000051113562,0.97092587,0.0007004886,0.025862262,0.0018724954,0.000020415624],"about_ca_topic_score_codex":0.0031141392,"about_ca_topic_score_gemma":0.004611916,"teacher_disagreement_score":0.0058790618,"about_ca_system_score_codex":0.0024707234,"about_ca_system_score_gemma":0.0022258624,"threshold_uncertainty_score":0.03109181},"labels":[],"label_agreement":null},{"id":"W2123428140","doi":"","title":"The makespan problem of scheduling multi groups of jobs on multi processors at different speeds","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Scheduling and Optimization Algorithms","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":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Upper and lower bounds; Parallel computing; Mathematics; Computer network; Routing (electronic design automation)","score_opus":0.0685321649947203,"score_gpt":0.3414718059983619,"score_spread":0.2729396410036416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123428140","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.2562775,0.0010504983,0.73295885,0.00061304483,0.0002194049,0.00037989713,0.00029012532,0.00028203463,0.007928674],"genre_scores_gemma":[0.84348655,0.00075818633,0.1510251,0.00010386602,0.00021420693,0.00048456015,0.0003619249,0.00021320689,0.003352435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987929,0.0004031604,0.000069045,0.00024288226,0.00030069912,0.00019140195],"domain_scores_gemma":[0.99877566,0.0007476022,0.0001821008,0.000081370104,0.00010928054,0.00010395837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018019514,0.0011561017,0.0011631891,0.0008039028,0.001084682,0.0008628943,0.0010808175,0.00072669075,0.001877076],"category_scores_gemma":[0.004676355,0.0005220136,0.00085345993,0.0013140204,0.00072148367,0.0021268083,0.00090837764,0.00073916535,0.00016974789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006967635,0.00015246308,0.0011080337,0.0006525717,0.00026336548,0.00029453542,0.00018048048,0.9100281,0.009026933,0.0151458625,0.0016324284,0.060818482],"study_design_scores_gemma":[0.00007522517,0.00057521794,0.001986761,0.000023621964,0.00008701791,0.00027823087,0.0001687467,0.9547366,0.0058048437,0.033630986,0.0026112495,0.000021495289],"about_ca_topic_score_codex":0.0017708872,"about_ca_topic_score_gemma":0.0011629133,"teacher_disagreement_score":0.001877076,"about_ca_system_score_codex":0.0010043953,"about_ca_system_score_gemma":0.0012977812,"threshold_uncertainty_score":0.009529769},"labels":[],"label_agreement":null},{"id":"W2126636640","doi":"","title":"O(m) Bound on Number of Iterations in Sphere Methods for LP","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Mathematical proof; Mathematics; Matrix (chemical analysis); Subject (documents); Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Geometry","score_opus":0.26597364242412347,"score_gpt":0.6091308202330554,"score_spread":0.34315717780893196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126636640","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.022278009,0.003576931,0.91186446,0.0040808055,0.00076105713,0.00031295363,0.00050623826,0.0024982472,0.054121226],"genre_scores_gemma":[0.25703433,0.0027413808,0.70412254,0.0020923058,0.0011318296,0.0012889468,0.0013290175,0.0029455007,0.027314175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99380773,0.002814298,0.00026613884,0.0006937425,0.001785587,0.00063255336],"domain_scores_gemma":[0.969749,0.023866149,0.0008938103,0.0032175072,0.0015950098,0.0006785917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059657414,0.0039421814,0.001865173,0.00130621,0.0012876783,0.0022827436,0.0034506104,0.0021729565,0.019972166],"category_scores_gemma":[0.033106927,0.0008912121,0.0021325336,0.0013445542,0.0037879273,0.007380294,0.0054997336,0.007936106,0.005221235],"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.00324501,0.0007123397,0.0044269217,0.0019550747,0.00037946858,0.0007794533,0.0010125577,0.2015085,0.014262026,0.4083744,0.058823485,0.3045208],"study_design_scores_gemma":[0.00018959213,0.00037929096,0.0008814479,0.00020539307,0.00008149257,0.0002320124,0.00016829082,0.7331421,0.0051202457,0.24436837,0.015174132,0.000057656922],"about_ca_topic_score_codex":0.0025140066,"about_ca_topic_score_gemma":0.004725233,"teacher_disagreement_score":0.019972166,"about_ca_system_score_codex":0.0019243631,"about_ca_system_score_gemma":0.0018716297,"threshold_uncertainty_score":0.06681359},"labels":[],"label_agreement":null},{"id":"W2127378345","doi":"","title":"Reductions for the stable set problem","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"Independent set; Clique; Mathematics; Combinatorics; Graph; Benchmark (surveying); Set (abstract data type); Reduction (mathematics); Clique problem; Discrete mathematics; Mathematical optimization; Computer science; Pathwidth; Line graph","score_opus":0.2833151832057892,"score_gpt":0.39454671468208496,"score_spread":0.11123153147629578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127378345","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.025074864,0.0008501466,0.927381,0.0026665276,0.00029960036,0.0004995905,0.0007878524,0.00082930375,0.041611176],"genre_scores_gemma":[0.28667754,0.0021422652,0.67609054,0.0011506231,0.00094970915,0.0015332031,0.003964113,0.000975708,0.026516298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974247,0.00075740344,0.00012388384,0.0004167686,0.0010049882,0.00027224974],"domain_scores_gemma":[0.9966665,0.0020564068,0.00014866765,0.00064562855,0.0003544432,0.00012836685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019776695,0.0017310173,0.0010542998,0.0017022598,0.0019240673,0.002491079,0.0029736834,0.0015579885,0.012614373],"category_scores_gemma":[0.0055953665,0.00065482734,0.0036832846,0.0017547823,0.0022542388,0.006389907,0.0045192796,0.0071978415,0.0018625453],"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.0001621155,0.0003508487,0.0004246258,0.00060628337,0.00010894699,0.00019528603,0.0004036465,0.07078501,0.0055321124,0.7795721,0.032745756,0.10911321],"study_design_scores_gemma":[0.00004999231,0.00006439736,0.00022923265,0.000045110308,0.000047127465,0.00015371777,0.0001577321,0.08646647,0.0033010698,0.886625,0.022833228,0.000027008906],"about_ca_topic_score_codex":0.0016667243,"about_ca_topic_score_gemma":0.0026181082,"teacher_disagreement_score":0.012614373,"about_ca_system_score_codex":0.0017928429,"about_ca_system_score_gemma":0.001872363,"threshold_uncertainty_score":0.042199254},"labels":[],"label_agreement":null},{"id":"W2145224703","doi":"","title":"The AID Method for Global Optimization","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Mathematical optimization; Global optimization; Benchmark (surveying); Minification; Computer science; Population; Diversification (marketing strategy); Function (biology); Mathematics; Biology","score_opus":0.13021669306649986,"score_gpt":0.42655424674246667,"score_spread":0.2963375536759668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145224703","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.0016292844,0.00037433283,0.99140114,0.00009488566,0.00006095862,0.00004719524,0.000035832134,0.0002661583,0.0060902145],"genre_scores_gemma":[0.09448616,0.00062373694,0.8939987,0.0002186422,0.00011133537,0.0004467904,0.0001548966,0.00029704924,0.0096627055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934155,0.00025581333,0.00002225428,0.00006284023,0.00027102602,0.000046470854],"domain_scores_gemma":[0.9994948,0.0002372282,0.00004204453,0.000086529246,0.00010544663,0.000033887147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013268093,0.0010037338,0.0010773584,0.0012822065,0.00057709665,0.0010596188,0.0013564645,0.0010554418,0.006116482],"category_scores_gemma":[0.0022818737,0.00042500652,0.0010992959,0.0009370253,0.0010123565,0.0009267804,0.0022657348,0.0019610361,0.0012026065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011086755,0.00006364542,0.0006981588,0.00036789785,0.00012196873,0.00011155939,0.00013710764,0.4848631,0.0064626923,0.2222367,0.009701243,0.275125],"study_design_scores_gemma":[0.000048518705,0.0000749778,0.00017760086,0.000039569197,0.000029310222,0.0000999022,0.00002022464,0.9403392,0.00183883,0.033667244,0.023644963,0.000019664933],"about_ca_topic_score_codex":0.0012928211,"about_ca_topic_score_gemma":0.0012266156,"teacher_disagreement_score":0.006116482,"about_ca_system_score_codex":0.00055613555,"about_ca_system_score_gemma":0.0013059189,"threshold_uncertainty_score":0.020461679},"labels":[],"label_agreement":null},{"id":"W2156841116","doi":"","title":"Quadratic Binary Programming Models in Computational Biology","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"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":"Heuristics; Solver; Quadratic equation; Linearization; Quadratic programming; Binary number; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Arithmetic","score_opus":0.08857950310823591,"score_gpt":0.376263285187368,"score_spread":0.2876837820791321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156841116","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.009382922,0.005055963,0.94861275,0.005282731,0.00035174534,0.00010666737,0.0003374318,0.0002327631,0.030637],"genre_scores_gemma":[0.45888522,0.010572485,0.47734597,0.0022273757,0.0016446805,0.0008480158,0.0014582684,0.00026659758,0.046751406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997914,0.001205618,0.000059878796,0.0002445196,0.00040669614,0.00016923426],"domain_scores_gemma":[0.9951361,0.0038898995,0.0002521523,0.0002616149,0.00031208651,0.00014805268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028860976,0.001127978,0.00096526096,0.00081514614,0.0007347269,0.0023915,0.0016059238,0.0016244272,0.007856443],"category_scores_gemma":[0.008176479,0.00046278816,0.0008371773,0.0025865752,0.0024220035,0.003662304,0.0017794956,0.0035316532,0.0016807577],"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.000028060655,0.00005380957,0.00018690902,0.0001636666,0.000019021023,0.000033353434,0.0001077785,0.15019788,0.00014787215,0.8223038,0.006417637,0.020340199],"study_design_scores_gemma":[0.00002217366,0.000028399245,0.00009952284,0.00003543473,0.0000074107043,0.00002356083,0.000050532584,0.36988777,0.00013093762,0.61676925,0.012932106,0.000013084994],"about_ca_topic_score_codex":0.0053201024,"about_ca_topic_score_gemma":0.0038332553,"teacher_disagreement_score":0.007856443,"about_ca_system_score_codex":0.0020518622,"about_ca_system_score_gemma":0.0017250781,"threshold_uncertainty_score":0.02628237},"labels":[],"label_agreement":null},{"id":"W2158930128","doi":"","title":"Probabilistic Model and Solution Algorithm for the Electricity Retailers in the Italian Market","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Electric Power System Optimization","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":"Bidding; Simulated annealing; Electricity market; Computer science; Probabilistic logic; Electricity; Mathematical optimization; Portfolio; Algorithm; Economics; Mathematics; Artificial intelligence; Microeconomics; Finance; Engineering","score_opus":0.0691444894806862,"score_gpt":0.297606831795214,"score_spread":0.22846234231452783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158930128","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.01781211,0.0001843011,0.9772974,0.00037182707,0.000025145451,0.000062366125,0.00013432303,0.00019954875,0.0039128554],"genre_scores_gemma":[0.5548999,0.0004833162,0.43140575,0.00019923624,0.00007519659,0.0007460113,0.0006185583,0.0001684736,0.011403609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995127,0.00020125844,0.000019451825,0.0000922077,0.000101310914,0.000073121846],"domain_scores_gemma":[0.9992242,0.0005402485,0.000076400174,0.000032922733,0.00009395456,0.00003230021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010941874,0.00081593025,0.0011630206,0.0007559734,0.0006524231,0.0011323532,0.001531033,0.0016019066,0.0050561326],"category_scores_gemma":[0.0029765703,0.0006036326,0.0010872855,0.00098845,0.00070854125,0.0010949444,0.0012225052,0.0012858565,0.00055817823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014954849,0.000009778732,0.00014112519,0.000017002367,0.000008837602,0.000016809605,0.000019500449,0.9847506,0.000098010714,0.00983476,0.0002978508,0.0047907988],"study_design_scores_gemma":[0.0000044839335,0.0000042488273,0.000028464388,0.0000016501652,0.0000018840466,0.000004350971,0.000003932056,0.9964,0.000030595173,0.0033325565,0.00018615038,0.0000016200086],"about_ca_topic_score_codex":0.013697921,"about_ca_topic_score_gemma":0.01110426,"teacher_disagreement_score":0.013697921,"about_ca_system_score_codex":0.0016025649,"about_ca_system_score_gemma":0.0021971024,"threshold_uncertainty_score":0.027236402},"labels":[],"label_agreement":null},{"id":"W3029385445","doi":"","title":"Nachruf. Zum Tode von Winfried Brugger","year":2011,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"German Social Sciences and History","field":"Social Sciences","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.17048039276643875,"score_gpt":0.40564908351251894,"score_spread":0.23516869074608018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029385445","genre_codex":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004998335,0.2762669,0.021392656,0.47848967,0.06028754,0.00007590537,0.0021861105,0.001364872,0.15493801],"genre_scores_gemma":[0.08925473,0.15086095,0.0153810745,0.12717578,0.040051218,0.0003440446,0.001904939,0.003352301,0.571675],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990662,0.00028131093,0.000041725347,0.00021006759,0.00031162138,0.000089161986],"domain_scores_gemma":[0.9984871,0.00088150037,0.00007350146,0.00011002143,0.00030569377,0.0001420891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583312,0.00084197096,0.00084234483,0.0011073812,0.0010884778,0.0016692717,0.0007180886,0.0019334686,0.05940421],"category_scores_gemma":[0.0064649996,0.0003716447,0.0002883831,0.0009373606,0.001485658,0.0037019309,0.0021513298,0.004372741,0.044535782],"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.000079077305,0.000030268466,0.00016152905,0.00017183613,0.000013502392,0.00012942131,0.0001453284,0.00022437084,0.00023027419,0.036229722,0.89145905,0.07112561],"study_design_scores_gemma":[0.00003280478,0.000025016609,0.00033803552,0.00041239226,0.000013251397,0.0004253357,0.00015473206,0.000586113,0.0005832503,0.063671164,0.933725,0.000032838867],"about_ca_topic_score_codex":0.001509673,"about_ca_topic_score_gemma":0.0019547457,"teacher_disagreement_score":0.05940421,"about_ca_system_score_codex":0.0010718998,"about_ca_system_score_gemma":0.00084041717,"threshold_uncertainty_score":0.19872689},"labels":[],"label_agreement":null},{"id":"W3031183160","doi":"","title":"Nachruf. Zum Tode von Gerd Roelcke","year":2012,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Memory, History, Trauma, Identity","field":"Arts and Humanities","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":"GERD; Philosophy; Medicine; Internal medicine; Reflux; Disease","score_opus":0.11455364630279154,"score_gpt":0.3611729432833378,"score_spread":0.2466192969805463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031183160","genre_codex":"commentary","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.0041865944,0.28175977,0.012208776,0.49881607,0.06023452,0.000075324206,0.0018786961,0.0012634086,0.13957682],"genre_scores_gemma":[0.09198178,0.14126027,0.010534324,0.1623795,0.04134351,0.0003009064,0.0013673024,0.0029461295,0.5478863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991266,0.00027173734,0.000045701043,0.00017739004,0.00029173578,0.00008684751],"domain_scores_gemma":[0.9985806,0.0008253367,0.00007987797,0.00009939221,0.00028107877,0.00013376736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753942,0.0008113381,0.00079550623,0.0010142708,0.0010825739,0.0020712456,0.0007265097,0.0022090392,0.061355297],"category_scores_gemma":[0.006777768,0.0003643804,0.00024637187,0.00075076637,0.0015795834,0.003529714,0.0023407002,0.0048376946,0.047572747],"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.00008202882,0.000028142122,0.00017190412,0.00018008731,0.000013592127,0.00018390035,0.00021249441,0.00015504759,0.00019895787,0.033475563,0.8815428,0.083755516],"study_design_scores_gemma":[0.000025994304,0.00002193401,0.00028291874,0.00042354706,0.0000096247195,0.0006359268,0.0002269073,0.00037726658,0.0003519744,0.040179137,0.9574375,0.000027169901],"about_ca_topic_score_codex":0.0014775716,"about_ca_topic_score_gemma":0.0020119366,"teacher_disagreement_score":0.061355297,"about_ca_system_score_codex":0.00091559195,"about_ca_system_score_gemma":0.00080783106,"threshold_uncertainty_score":0.2052539},"labels":[],"label_agreement":null},{"id":"W3031690743","doi":"","title":"Rezension zu: Braczyk, Boris Alexander: Rechtsgrund und Grundrecht, Grundlegend einer systematischen Grundrechtstheorie: Schriften zur Rechtstheorie, Heft 175, Berlin 1996","year":2001,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Law and Political Science","field":"Social Sciences","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":"Philosophy; Humanities","score_opus":0.08867625373547645,"score_gpt":0.4285875478775111,"score_spread":0.33991129414203464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031690743","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.0028961978,0.5084782,0.014993877,0.3794041,0.04280761,0.00010680141,0.0022058792,0.00035497732,0.04875228],"genre_scores_gemma":[0.12303466,0.4440673,0.019654812,0.14645945,0.050741356,0.0007399934,0.0027326923,0.0012008307,0.21136896],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989784,0.0002588312,0.00008383687,0.00022758081,0.0003372494,0.000114162416],"domain_scores_gemma":[0.99817455,0.0010988995,0.00013042444,0.000095203235,0.00042704988,0.00007383586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001995985,0.0011749319,0.0011623983,0.0026171783,0.0013686267,0.00514677,0.0014600307,0.0035108677,0.040905856],"category_scores_gemma":[0.008590894,0.00053015066,0.0005560674,0.0044349525,0.0025575298,0.009248227,0.0028219004,0.0048784907,0.012535254],"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.000029536457,0.00002338586,0.00009138034,0.00036784523,0.000018901423,0.000046080175,0.0005195911,0.00012749976,0.00007852201,0.071172856,0.8990883,0.028436013],"study_design_scores_gemma":[0.00003425165,0.000010001412,0.00094516895,0.0009361091,0.000030904623,0.00018433828,0.0005041672,0.00033635503,0.00042123164,0.11376713,0.8827838,0.000046564524],"about_ca_topic_score_codex":0.010180483,"about_ca_topic_score_gemma":0.014419316,"teacher_disagreement_score":0.040905856,"about_ca_system_score_codex":0.002811725,"about_ca_system_score_gemma":0.0026434087,"threshold_uncertainty_score":0.13684374},"labels":[],"label_agreement":null},{"id":"W3031953439","doi":"","title":"Rezension zu: Uhlenbrock Henning, Der Staat als juristische Person: Dogmengeschichtliche Untersuchungen zu einem Grundbegriff der deutschen Staatsrechtslehre, Berlin Duncker & Humblot (Schriften zur Verfassungsgeschichte Band 61) 2000, 197 S.","year":2002,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Law and Political Science","field":"Social Sciences","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":"Philosophy; Humanities; Political science","score_opus":0.15202241411061462,"score_gpt":0.3827758540505588,"score_spread":0.23075343993994418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031953439","genre_codex":"commentary","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.001365163,0.4557535,0.0017823965,0.500929,0.010727826,0.000032650885,0.00054233236,0.00005269824,0.028814362],"genre_scores_gemma":[0.10434648,0.44122493,0.005202741,0.28016448,0.023258243,0.00032015794,0.0007367696,0.00039103033,0.14435518],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987582,0.0004368522,0.00008861173,0.00022995335,0.00036626263,0.000120132005],"domain_scores_gemma":[0.9976767,0.0016599834,0.00014463968,0.0000622265,0.0003548544,0.00010165819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022929518,0.001108,0.0007537852,0.002021529,0.0031757548,0.006256891,0.0013895234,0.0068861246,0.020261036],"category_scores_gemma":[0.008089761,0.000579535,0.0004175555,0.0041064294,0.0041306145,0.013452939,0.0028712652,0.0072380006,0.003958183],"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.000022307395,0.000014510106,0.0001802066,0.00022057802,0.00001096841,0.000049371236,0.0016366482,0.00008443922,0.000042913663,0.10777508,0.87407744,0.015885571],"study_design_scores_gemma":[0.00003215776,0.000008091321,0.0013264959,0.0012597066,0.00002010212,0.00010204465,0.002232073,0.00016932421,0.00022161746,0.12056039,0.87402546,0.00004246331],"about_ca_topic_score_codex":0.039687715,"about_ca_topic_score_gemma":0.058726784,"teacher_disagreement_score":0.039687715,"about_ca_system_score_codex":0.0052683484,"about_ca_system_score_gemma":0.0046578236,"threshold_uncertainty_score":0.07891345},"labels":[],"label_agreement":null},{"id":"W3033253995","doi":"","title":"Rezension zu: Schliesky, Utz, Souveränität und Legitimität von Herrschaftsgewalt: Die Weiterentwicklung von Begriffen der Staatslehre und des Staatsrechts im europäischen Mehrebenensystem, Tübingen (Mohr Siebeck) 2004, 815 S.","year":2005,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Law and Political Science","field":"Social Sciences","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":"Philosophy","score_opus":0.09449557842601454,"score_gpt":0.41708374513190255,"score_spread":0.322588166705888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033253995","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.010350317,0.4376246,0.016629646,0.43540785,0.005945986,0.000057800546,0.0015308437,0.00020835055,0.09224465],"genre_scores_gemma":[0.3630183,0.32487586,0.019860625,0.051223874,0.012050414,0.0003760072,0.001182,0.0006285788,0.22678429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911267,0.0002653837,0.00006648634,0.00019950079,0.00025575666,0.000100264886],"domain_scores_gemma":[0.998669,0.00084263174,0.00014299991,0.00007718623,0.00020987118,0.00005831181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019441221,0.0010699929,0.00081960636,0.0024701261,0.0026774793,0.006841694,0.0010510194,0.004889743,0.018286899],"category_scores_gemma":[0.005563073,0.0004979489,0.000624381,0.0041376837,0.0064892126,0.015461804,0.0028603137,0.0055920244,0.0032609366],"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.000046658006,0.000022280432,0.00044525397,0.000324164,0.000032701864,0.000078333316,0.0019388208,0.0005388904,0.00016757275,0.61325425,0.3493704,0.033780623],"study_design_scores_gemma":[0.0000282905,0.000011469432,0.0019173489,0.0007200523,0.000043956225,0.00011456222,0.0011436229,0.000881141,0.00061624823,0.6268418,0.36763337,0.00004821734],"about_ca_topic_score_codex":0.02034501,"about_ca_topic_score_gemma":0.03769365,"teacher_disagreement_score":0.02034501,"about_ca_system_score_codex":0.007818256,"about_ca_system_score_gemma":0.005207189,"threshold_uncertainty_score":0.061175823},"labels":[],"label_agreement":null}]}