{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23840894,0.0025131654,0.71609247,0.00094525336,0.006299328,0.002927239,0.000044079206,0.00012954127,0.03264],"genre_scores_gemma":[0.70286393,0.000032597247,0.29317614,0.00003685612,0.00093018217,0.00022477067,0.0000148288955,0.000022829217,0.0026978727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932349,0.002293016,0.0006763457,0.0004735161,0.0025520646,0.0007701914],"domain_scores_gemma":[0.997428,0.0010665925,0.000026987458,0.00065283244,0.0005592691,0.00026628986],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01176098,0.00014610356,0.00023310022,0.0010159255,0.000401866,0.0005375537,0.000770458,0.00013376471,0.0023566736],"category_scores_gemma":[0.004133842,0.00012071648,0.00005813989,0.0024692228,0.00017544747,0.0017350237,0.0003108729,0.00041273137,0.0013013971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032095125,0.004315772,0.027707951,0.0000086750315,0.00007605277,0.000034077493,0.038646206,0.5490734,0.21689399,0.038168106,0.018050104,0.10670472],"study_design_scores_gemma":[0.0019553772,0.00032182207,0.0050887866,0.000020661331,0.0000037099892,0.000018499453,0.008321367,0.89448833,0.07641145,0.0015082584,0.01128106,0.00058069295],"about_ca_topic_score_codex":0.00039334942,"about_ca_topic_score_gemma":0.00001837832,"teacher_disagreement_score":0.46445498,"about_ca_system_score_codex":0.0003397849,"about_ca_system_score_gemma":0.00017190917,"threshold_uncertainty_score":0.9994762},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025807735,0.0000796064,0.9661029,0.0026211892,0.00076835195,0.0011138795,0.000008873339,0.0001956612,0.003301814],"genre_scores_gemma":[0.4476586,0.00007953425,0.5508394,0.00007961567,0.00021763988,0.00047253745,0.000030531726,0.000022008628,0.0006000948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975989,0.00026291714,0.00034478746,0.0005762717,0.00065665116,0.00056046003],"domain_scores_gemma":[0.9982232,0.00022259202,0.000014836213,0.0008918123,0.0005118847,0.00013570802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977152,0.00013639919,0.00014881081,0.0008948313,0.0005794961,0.00060598215,0.001342051,0.00011623215,0.0001498335],"category_scores_gemma":[0.0003784078,0.00013317456,0.000049380422,0.0030259576,0.0002835203,0.00084677135,0.00040492232,0.001087684,0.000095166666],"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.0000023220523,0.00042622845,0.00022122131,0.000021941047,0.000010990622,0.000022669798,0.001210179,0.417348,0.0016012373,0.5384554,0.00028491672,0.040394887],"study_design_scores_gemma":[0.0002981696,0.00006840824,0.0007173263,0.000015433083,8.799685e-7,0.00002211093,0.000037466878,0.973245,0.00014629049,0.024617007,0.00066964416,0.00016223252],"about_ca_topic_score_codex":0.0006352225,"about_ca_topic_score_gemma":0.0021506317,"teacher_disagreement_score":0.55589706,"about_ca_system_score_codex":0.000054221706,"about_ca_system_score_gemma":0.000276388,"threshold_uncertainty_score":0.58435},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.964643,0.0010112249,0.030855427,0.00029272266,0.0005700728,0.0012110098,0.000082990424,0.00021570305,0.0011178744],"genre_scores_gemma":[0.99195194,0.0001200078,0.006390081,0.000013740823,0.00034190266,0.0005316558,0.00012899013,0.000041943546,0.00047971975],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989228,0.00010797765,0.00021264155,0.00021379258,0.0002022956,0.00034047855],"domain_scores_gemma":[0.9992488,0.00023625024,0.0000080526825,0.00026200447,0.00013526028,0.00010962472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008423006,0.00012867055,0.00013848799,0.00032970053,0.0007155773,0.00023217224,0.00016746733,0.00012614373,0.00005896326],"category_scores_gemma":[0.000037772326,0.00012446938,0.00004695367,0.00032286183,0.00009486811,0.0002911121,0.000024321018,0.00045413265,0.000034272944],"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.000091572896,0.0002359531,0.0019512626,0.00016409211,0.00035107075,0.000016480344,0.0064924518,0.077287756,0.7357891,0.12830135,0.0041098185,0.045209073],"study_design_scores_gemma":[0.0014788363,0.00025224657,0.0032475782,0.000042538144,0.000013259927,0.00006244058,0.0009279432,0.9651776,0.013160486,0.0037775317,0.011472549,0.00038697486],"about_ca_topic_score_codex":0.00004910001,"about_ca_topic_score_gemma":0.00004914943,"teacher_disagreement_score":0.88788986,"about_ca_system_score_codex":0.000036267516,"about_ca_system_score_gemma":0.00004821315,"threshold_uncertainty_score":0.5503714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84901404,0.0014777263,0.09767,0.00829202,0.0001343759,0.004245844,0.00071560696,0.00023726067,0.038213152],"genre_scores_gemma":[0.83699226,0.0001814183,0.15943934,0.000104191546,0.0002954187,0.0006140901,0.00009044144,0.000032108324,0.002250738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984129,0.00022152351,0.00030658641,0.00018033406,0.00040322638,0.0004754458],"domain_scores_gemma":[0.9982453,0.0010167998,0.000018809558,0.00028134327,0.00026015277,0.00017757324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017241448,0.00010668449,0.00015866276,0.00012568275,0.0006887034,0.00016156389,0.00015359388,0.000052408846,0.0005475939],"category_scores_gemma":[0.0002489362,0.00008913164,0.000029154775,0.00034608063,0.00016555762,0.000271881,0.00019030127,0.00027433707,0.00015000452],"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.0000013527862,0.00029847148,0.00020462394,0.00007279523,0.00002716255,3.1055353e-7,0.0028132952,0.0000025786267,0.00027133955,0.9926829,0.002195161,0.0014300174],"study_design_scores_gemma":[0.0016499676,0.0004117008,0.0040989765,0.0002867013,0.00013975089,0.00013181611,0.012634351,0.06386132,0.0027452882,0.8738952,0.039015543,0.0011293829],"about_ca_topic_score_codex":0.0006577951,"about_ca_topic_score_gemma":0.0001416098,"teacher_disagreement_score":0.11878769,"about_ca_system_score_codex":0.000057121506,"about_ca_system_score_gemma":0.00003203645,"threshold_uncertainty_score":0.59957695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98533744,0.000319918,0.012133606,0.00085339963,0.00025267343,0.00068339426,0.000022719698,0.000048105856,0.00034874535],"genre_scores_gemma":[0.9628032,0.000030551735,0.036396075,0.000007024809,0.00014547628,0.00006598847,0.0000037793018,0.000014518114,0.0005334012],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970335,0.00033903524,0.00039780806,0.00041010426,0.0011214663,0.0006980977],"domain_scores_gemma":[0.99750483,0.00013402554,0.000033304463,0.0010501444,0.0011019525,0.0001757671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011133895,0.00013545403,0.00023872934,0.0006027038,0.00033554598,0.00012885737,0.0018082934,0.000088223846,0.000055713255],"category_scores_gemma":[0.00047882958,0.00010872841,0.00008414231,0.0012766933,0.00097029714,0.0011330257,0.0006081438,0.0008088827,0.00002240719],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035677433,0.00010397,0.00037701786,0.00004309205,0.000031292664,0.0000063039674,0.0015247178,0.0004966129,0.6432672,0.3298094,0.000041331583,0.02426337],"study_design_scores_gemma":[0.0011491431,0.0004746956,0.0063678203,0.0000625521,0.0000048885136,0.00005472284,0.0005945102,0.40427572,0.5669095,0.019623801,0.00017405956,0.00030858867],"about_ca_topic_score_codex":0.00040158757,"about_ca_topic_score_gemma":0.00049625785,"teacher_disagreement_score":0.4037791,"about_ca_system_score_codex":0.00003975552,"about_ca_system_score_gemma":0.0007135382,"threshold_uncertainty_score":0.4433816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038847232,0.00012808302,0.98493904,0.0002467355,0.00024290175,0.0011860013,0.000008350042,0.00017583134,0.00918832],"genre_scores_gemma":[0.7465452,0.00006514957,0.23830143,0.000056487985,0.0009009372,0.0012802768,0.0005292645,0.000068592395,0.012252684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875575,0.000038412305,0.00017043675,0.00013549032,0.0002606403,0.00063927146],"domain_scores_gemma":[0.9995926,0.000015846368,0.000002713594,0.00021044296,0.00010051291,0.000077886856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815418,0.000101682024,0.000080353915,0.00018064727,0.00037173764,0.00015197939,0.00015138433,0.000051492,0.00006654564],"category_scores_gemma":[0.000004577941,0.00008416887,0.000031783326,0.00021949195,0.000024415043,0.00041780938,0.00007518882,0.000119143435,0.00018967284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035322603,0.000020720274,0.000010062357,0.00004202144,0.000033933462,2.4061663e-7,0.0008125007,0.98510206,0.00007534725,0.0025274644,0.0065722046,0.004799931],"study_design_scores_gemma":[0.0002513914,0.000012439157,0.000031878128,0.000009511665,0.000013071838,4.402357e-7,0.000063450214,0.9904421,0.00034958837,0.0009611499,0.0077475826,0.0001173802],"about_ca_topic_score_codex":0.000004090303,"about_ca_topic_score_gemma":0.000009164744,"teacher_disagreement_score":0.74663764,"about_ca_system_score_codex":0.00009322357,"about_ca_system_score_gemma":0.0000038186045,"threshold_uncertainty_score":0.3432307},"labels":[],"label_agreement":null},{"id":"W1517789689","doi":"","title":"On Packing Rectangles with Resource Augmentation: Maximizing the Profit","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Unit square; Combinatorics; Packing problems; Mathematics; Profit (economics); Bounded function; Square (algebra); Mathematical optimization; Microeconomics; Economics; Geometry","score_opus":0.07067051632240474,"score_gpt":0.3019838953193751,"score_spread":0.23131337899697035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517789689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5887814,0.0016654999,0.19418752,0.016585173,0.00082290126,0.0059747766,0.00007306723,0.002301579,0.18960807],"genre_scores_gemma":[0.9780873,0.00030684072,0.016130276,0.00016860098,0.00022390364,0.00033083349,0.00006749871,0.00007832541,0.004606437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859405,0.00016434389,0.00017505132,0.00020019188,0.00053696096,0.00032940452],"domain_scores_gemma":[0.9991471,0.0002543125,0.000008079381,0.00033568195,0.00018970949,0.00006509332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051716756,0.00012278266,0.000094899515,0.00019574891,0.0011845265,0.00017117869,0.00021874366,0.00005336074,0.00014562282],"category_scores_gemma":[0.00007374929,0.00008441774,0.000023595538,0.00081689184,0.00015737486,0.00017044277,0.000030052113,0.00046912054,0.00015762485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147056,0.000019932782,0.0001416573,0.000015301555,0.000040954998,0.000019248107,0.0031443248,0.9804142,0.00033291333,0.0032975208,0.006929942,0.005629282],"study_design_scores_gemma":[0.0009811269,0.0002884802,0.00064898905,0.0001537258,0.000010314406,0.00017133016,0.0017067433,0.96727407,0.004476945,0.00013934266,0.023762042,0.00038689672],"about_ca_topic_score_codex":0.000042254895,"about_ca_topic_score_gemma":0.000058681504,"teacher_disagreement_score":0.3893059,"about_ca_system_score_codex":0.00011097446,"about_ca_system_score_gemma":0.00007272899,"threshold_uncertainty_score":0.91105396},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043514878,0.0019986182,0.91431373,0.02151936,0.00020338499,0.0031301058,0.000014982849,0.0002710504,0.01503388],"genre_scores_gemma":[0.4697136,0.0015853208,0.51396704,0.00027769222,0.00024092228,0.000988237,0.000009269552,0.00003853292,0.0131794205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966984,0.0009341261,0.00023643399,0.0005079681,0.000979516,0.0006435746],"domain_scores_gemma":[0.9976165,0.00070859713,0.0000117197915,0.0009304121,0.00056457415,0.00016816557],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028505104,0.00012933409,0.00016282711,0.00035399315,0.0021582728,0.0003353948,0.0014174599,0.00006056664,0.00004308061],"category_scores_gemma":[0.00030709486,0.000085760264,0.00004903674,0.0015877599,0.0017140044,0.0007420602,0.00082243036,0.0006901917,0.0002688585],"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.00006531965,0.00016619347,0.00016654219,0.00002007168,0.000065738954,0.00014276782,0.00803078,0.0033322286,0.00065774587,0.7819966,0.0034055742,0.20195042],"study_design_scores_gemma":[0.0022017602,0.00016002415,0.00049176323,0.000015702419,0.000002675043,0.00051538483,0.0002888615,0.8922172,0.0009579441,0.09380401,0.009085144,0.000259495],"about_ca_topic_score_codex":0.00023032681,"about_ca_topic_score_gemma":0.00006093889,"teacher_disagreement_score":0.888885,"about_ca_system_score_codex":0.00005699482,"about_ca_system_score_gemma":0.00029357534,"threshold_uncertainty_score":0.9991408},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16227221,0.00075596623,0.8340251,0.00029651815,0.0002317357,0.001201456,0.000045054625,0.00022285357,0.00094910525],"genre_scores_gemma":[0.59275687,0.00021281022,0.40591973,0.000021943559,0.00025178798,0.00008376444,0.00007307616,0.00002932503,0.00065068936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961111,0.00045054665,0.00065799896,0.0008248613,0.0010196711,0.0009358023],"domain_scores_gemma":[0.9963801,0.0004053619,0.00006429874,0.0006630092,0.0023064488,0.00018076645],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013718582,0.0002743756,0.000341374,0.0005619371,0.0015253734,0.00024375714,0.0006529652,0.00016041138,0.00003417211],"category_scores_gemma":[0.00018316612,0.00028013124,0.00006951578,0.0024899817,0.0005343833,0.0019189023,0.00057725725,0.0006232082,0.000036641188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015377576,0.00014062456,0.0016321136,0.000019842797,0.000031353506,0.0000114914865,0.0004393729,0.9798793,0.0004616872,0.0045068907,0.000118095166,0.012743852],"study_design_scores_gemma":[0.0009150171,0.00027625856,0.013332145,0.0000678795,0.0000060854804,0.000050611874,0.000143751,0.9823111,0.0018148005,0.00062083924,0.00017444548,0.00028700786],"about_ca_topic_score_codex":0.0012989383,"about_ca_topic_score_gemma":0.000102382975,"teacher_disagreement_score":0.43048468,"about_ca_system_score_codex":0.00028692058,"about_ca_system_score_gemma":0.00040800715,"threshold_uncertainty_score":0.9999651},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046961126,0.00009271469,0.9936492,0.00028357116,0.00011108913,0.00077098765,0.00004673571,0.000037059835,0.00031254935],"genre_scores_gemma":[0.15152197,0.000031830863,0.8475551,0.00009481857,0.000038477458,0.00040631983,0.000030134284,0.000010085644,0.00031127082],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99702156,0.00039801636,0.0005351696,0.00032618415,0.00146031,0.00025875831],"domain_scores_gemma":[0.99809575,0.00026854296,0.00007031898,0.00063891686,0.0008070464,0.000119434146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019293625,0.000100327,0.00023555069,0.00056664913,0.00023458194,0.000051124374,0.0013544754,0.00008380123,0.00045728002],"category_scores_gemma":[0.00035744064,0.00007388579,0.00016166968,0.0021858474,0.00047741926,0.0004418821,0.0003990894,0.00019564926,0.000004859213],"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.000014144312,0.0016331315,0.00035836015,0.000046666653,0.0009921109,0.000007082701,0.011796302,0.00008892261,0.24241522,0.009330782,0.003132333,0.730185],"study_design_scores_gemma":[0.0002507042,0.00013898504,0.0006776279,0.0000127838985,0.00003282465,0.0000018487748,0.0004843513,0.3013429,0.69689,0.00009948737,0.000010134323,0.000058322545],"about_ca_topic_score_codex":0.00064838777,"about_ca_topic_score_gemma":0.00003079629,"teacher_disagreement_score":0.7301266,"about_ca_system_score_codex":0.00007341481,"about_ca_system_score_gemma":0.00033876498,"threshold_uncertainty_score":0.50068957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03947434,0.0012655348,0.9436286,0.0016337383,0.00022487064,0.0065357056,0.00005465845,0.00014491884,0.0070376447],"genre_scores_gemma":[0.7172505,0.0013493715,0.27836412,0.00021931953,0.00013294363,0.0009490846,0.00038221132,0.000036705074,0.0013157234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511147,0.0023487795,0.0007990669,0.0005601257,0.0005211746,0.0006593714],"domain_scores_gemma":[0.9979626,0.00039049174,0.00005399017,0.00034813193,0.0010512802,0.00019353972],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020569677,0.00016766049,0.00028547316,0.0008779905,0.0038943079,0.000047700276,0.00013500123,0.00018478092,0.00009731655],"category_scores_gemma":[0.0004289165,0.00016556618,0.000026974947,0.0014139933,0.00014482385,0.00042117923,0.000120164,0.000907457,0.00005008653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019563651,0.00009120272,0.0011769898,0.00020164682,0.000014006789,0.000005952965,0.019405577,0.97416615,0.0000021229707,0.0018087358,0.00007988182,0.0030281793],"study_design_scores_gemma":[0.0010902792,0.000095493335,0.0038394518,0.00008746172,0.000003949626,0.0000043258865,0.014216456,0.9799133,9.4384734e-7,0.000019031499,0.00058829866,0.00014098584],"about_ca_topic_score_codex":0.002671561,"about_ca_topic_score_gemma":0.0006198575,"teacher_disagreement_score":0.6777762,"about_ca_system_score_codex":0.0007375629,"about_ca_system_score_gemma":0.00086935447,"threshold_uncertainty_score":0.9974025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2368528,0.001388782,0.72364867,0.0016047753,0.0009852673,0.0024864418,0.000053207033,0.0006943198,0.032285735],"genre_scores_gemma":[0.9703338,0.00010361874,0.022335263,0.000021459238,0.0005646109,0.0004216932,0.000047210204,0.000041838408,0.0061305137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860084,0.00005344245,0.0002718598,0.00023220698,0.0002840228,0.0005576134],"domain_scores_gemma":[0.99932384,0.000081146616,0.000005447657,0.00025156856,0.00025365688,0.00008431584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011980366,0.00011617735,0.00014934922,0.00022707289,0.00050446455,0.00023898191,0.00022854371,0.00009123484,0.00005092339],"category_scores_gemma":[0.00009322904,0.00011097563,0.00005092903,0.0005598311,0.000029197807,0.00028052175,0.000012193407,0.00024299226,0.000030443725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011357271,0.000029568515,0.0000019468662,0.000027655078,0.000008824553,0.0000010279482,0.00026776528,0.9459597,0.006695461,0.0017183105,0.0018906221,0.043398008],"study_design_scores_gemma":[0.00026065923,0.000104830746,0.000056402558,0.000038883438,0.0000020803236,0.0000069152384,0.00017459715,0.9850827,0.0011449776,0.00013570074,0.012846519,0.00014575907],"about_ca_topic_score_codex":0.000117958014,"about_ca_topic_score_gemma":0.00011638814,"teacher_disagreement_score":0.733481,"about_ca_system_score_codex":0.000110357585,"about_ca_system_score_gemma":0.00007018467,"threshold_uncertainty_score":0.4525455},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014601806,0.00007522252,0.9897033,0.0015513088,0.0004149776,0.00527865,0.00035576118,0.00024161491,0.0009189824],"genre_scores_gemma":[0.022664655,0.000049155416,0.96418786,0.0002839302,0.0011450808,0.004440145,0.00074025197,0.0002072016,0.0062816967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939654,0.000796443,0.00092844287,0.00080290536,0.001816073,0.0016907189],"domain_scores_gemma":[0.9946035,0.0015094422,0.00009479824,0.0010846021,0.0021569065,0.00055071485],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00494127,0.00044518977,0.000508915,0.0010853823,0.0020813043,0.0002664998,0.0006082088,0.00024667825,0.0012545974],"category_scores_gemma":[0.0015317831,0.00042339324,0.00020517089,0.0014872088,0.00030097313,0.0009798014,0.00045423053,0.0011596909,0.00029297758],"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.0029425526,0.019751275,0.0011330857,0.0024352884,0.001579589,0.000036020698,0.01080437,0.22834586,0.008810296,0.10540981,0.11765317,0.5010987],"study_design_scores_gemma":[0.002807921,0.0016394482,0.000052305844,0.00012068555,0.000032753935,0.000013398933,0.0006787327,0.970599,0.0008233912,0.0019947495,0.02080091,0.0004366885],"about_ca_topic_score_codex":0.0002894568,"about_ca_topic_score_gemma":0.000437686,"teacher_disagreement_score":0.7422531,"about_ca_system_score_codex":0.00096417306,"about_ca_system_score_gemma":0.00052307977,"threshold_uncertainty_score":0.9998218},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05973498,0.0026871404,0.010767113,0.0028892797,0.00025976688,0.0012253089,0.00005890146,0.00006363945,0.92231387],"genre_scores_gemma":[0.96686304,0.0017293389,0.017761135,0.00020787824,0.00014535998,0.00010133975,0.000028180937,0.00001593679,0.013147797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985773,0.00004071164,0.00044020746,0.00040459525,0.000095577554,0.00044158814],"domain_scores_gemma":[0.9995472,0.000027432472,0.00002577495,0.0002696313,0.000068936795,0.0000610685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012034891,0.00011359353,0.00020722428,0.00070745,0.00026736778,0.00019619301,0.00024148262,0.00007070534,0.0006493282],"category_scores_gemma":[0.000035712303,0.00012711546,0.000043234173,0.0008245607,0.000072954805,0.00042137768,0.000046495228,0.00028719002,0.0006281543],"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.000009132986,0.00014635369,0.0003204976,0.0000050877793,0.0000138800915,0.000026279291,0.00020876799,0.007713349,0.000005855311,0.98378354,0.002064609,0.0057026586],"study_design_scores_gemma":[0.0016513685,0.00078913715,0.09497544,0.00012017576,0.000005637715,0.00000898821,0.0018853786,0.5447761,0.0001223161,0.3154022,0.039450306,0.00081297755],"about_ca_topic_score_codex":0.0005371225,"about_ca_topic_score_gemma":0.00006987027,"teacher_disagreement_score":0.9091661,"about_ca_system_score_codex":0.00015847497,"about_ca_system_score_gemma":0.00003996555,"threshold_uncertainty_score":0.8073863},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08651361,0.00021481194,0.785979,0.0006928138,0.00030645702,0.0014881984,0.00009755445,0.00013453873,0.12457302],"genre_scores_gemma":[0.9363512,0.00038283927,0.054469265,0.00007713692,0.0001842906,0.00015213805,0.00007011098,0.00003400031,0.008279038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447966,0.0006377643,0.0007732821,0.00077938306,0.0026938184,0.00063608564],"domain_scores_gemma":[0.9954754,0.00047972682,0.00008907389,0.0009909967,0.0026687626,0.0002960467],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004912045,0.00020889919,0.00028346948,0.0009649521,0.0009523029,0.0006363167,0.0008922774,0.00014123821,0.0018917532],"category_scores_gemma":[0.00085360545,0.00014786243,0.00007504993,0.0025965248,0.0005972556,0.0020235851,0.00016436186,0.0004522125,0.00071422243],"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.00028466512,0.0008215372,0.013086325,0.00001152159,0.00031304779,0.00017986464,0.021021763,0.2823193,0.0005248394,0.26577517,0.018440941,0.397221],"study_design_scores_gemma":[0.00101003,0.00038256714,0.01330167,0.00003218747,0.000027169526,0.00006737224,0.0024635748,0.9597749,0.00068674935,0.01595834,0.005822242,0.00047317997],"about_ca_topic_score_codex":0.0016429506,"about_ca_topic_score_gemma":0.0014111333,"teacher_disagreement_score":0.84983754,"about_ca_system_score_codex":0.00009371855,"about_ca_system_score_gemma":0.0006314411,"threshold_uncertainty_score":0.99902064},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40463406,0.0018798345,0.0152568435,0.08011449,0.0031450922,0.008157543,0.000025208594,0.0011476161,0.4856393],"genre_scores_gemma":[0.95376945,0.0006016821,0.0013436229,0.0006190958,0.0010019094,0.00056959304,0.00007989347,0.000028251096,0.041986514],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981027,0.00003496861,0.0003053302,0.00030798066,0.00074367004,0.00050533],"domain_scores_gemma":[0.99861586,0.000037209127,0.000008618994,0.0005010456,0.00081535825,0.00002191093],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001581352,0.00011798455,0.00009438789,0.00022318184,0.0035096353,0.0004886324,0.00051140174,0.000041912226,0.0005243733],"category_scores_gemma":[0.00019360124,0.00008559228,0.000048082988,0.0011989723,0.00024616357,0.00081061374,0.0002815679,0.00029048452,0.0042712875],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030538686,0.0006446523,0.0032899596,0.00008674654,0.000107864915,0.00003841787,0.0005465091,0.07603365,0.0004232716,0.3111268,0.57600284,0.03166876],"study_design_scores_gemma":[0.00020622846,0.0000144829955,0.003025835,0.000009669029,0.000005685531,0.0000034668892,0.00046571332,0.4018525,0.000018426756,0.00059035065,0.59365875,0.0001489047],"about_ca_topic_score_codex":0.0077036624,"about_ca_topic_score_gemma":0.0030581057,"teacher_disagreement_score":0.5491354,"about_ca_system_score_codex":0.00006315806,"about_ca_system_score_gemma":0.00010179682,"threshold_uncertainty_score":0.9989041},"labels":[],"label_agreement":null},{"id":"W1566305412","doi":"","title":"Minimum Cost Flow Problem on Dynamic Multi Generative Network flows","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimum-cost flow problem; Flow network; Multi-commodity flow problem; Mathematical optimization; Computer science; Computation; Flow (mathematics); Time horizon; Mathematics; Algorithm","score_opus":0.04003761077161055,"score_gpt":0.33751022360090305,"score_spread":0.2974726128292925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566305412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063132204,0.00051829993,0.8837163,0.0031718928,0.006159337,0.00820852,0.0004073068,0.0018932845,0.032792892],"genre_scores_gemma":[0.3394892,0.0002531424,0.65021926,0.00014449272,0.00087433355,0.0010086513,0.00046208253,0.00015544418,0.007393402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981409,0.00015677474,0.00030741194,0.0003499145,0.0004294084,0.0006156113],"domain_scores_gemma":[0.99881077,0.00013418244,0.000009007282,0.00046554138,0.0003920111,0.00018848365],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008089573,0.00021100057,0.000178784,0.00026318082,0.0006682373,0.0003380371,0.00031105016,0.00019272103,0.0005342792],"category_scores_gemma":[0.00008080183,0.00020192117,0.000051271305,0.00080051046,0.000101152815,0.00020911424,0.00006083252,0.0012309308,0.00085569307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003773984,0.000062110805,0.0000150246315,0.000012496732,0.000031257543,0.0000046571217,0.00048807377,0.9759745,0.0053410945,0.00070552784,0.0040448853,0.0133165885],"study_design_scores_gemma":[0.00049181277,0.000064666034,0.00007675841,0.000026237913,0.0000039478746,0.000007215976,0.00004327316,0.989058,0.00052532845,0.000071662085,0.009403591,0.00022750466],"about_ca_topic_score_codex":0.00004543645,"about_ca_topic_score_gemma":0.0021690645,"teacher_disagreement_score":0.276357,"about_ca_system_score_codex":0.00010835261,"about_ca_system_score_gemma":0.00012345186,"threshold_uncertainty_score":0.9999223},"labels":[],"label_agreement":null},{"id":"W1569707558","doi":"","title":"Variants of Shortest Path Problems","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Longest path problem; Combinatorics; Shortest path problem; Bottleneck; Discrete mathematics; Path (computing); Algebraic number; Mathematical optimization; Graph; Computer science","score_opus":0.1195355251014714,"score_gpt":0.31015488838466304,"score_spread":0.19061936328319162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569707558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103525884,0.0014729957,0.48054865,0.00028284805,0.0015436182,0.0036827552,0.0002384645,0.0011938595,0.40751094],"genre_scores_gemma":[0.9682594,0.00026998713,0.030280992,0.0000066147263,0.00005082753,0.00008601726,0.000029636669,0.000032867483,0.0009836376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896604,0.00007295938,0.00025420316,0.0001466712,0.00028274537,0.0002774042],"domain_scores_gemma":[0.9992646,0.000034343975,0.000006319718,0.00028827827,0.0003264111,0.00008006115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713394,0.00008776308,0.00011556974,0.00023847684,0.00013026556,0.00004189072,0.00021198095,0.0000730449,0.0008324671],"category_scores_gemma":[0.000046566733,0.000084396364,0.000026620553,0.00061786984,0.00008440462,0.00018792083,0.000040027786,0.0002472638,0.00015578564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008767937,0.00051099947,0.0020336362,0.00018811876,0.00019363487,0.000018006109,0.014350069,0.91281116,0.017594146,0.022821771,0.005011247,0.024458472],"study_design_scores_gemma":[0.00026628893,0.00010713774,0.0023026268,0.000055267265,0.00000570636,0.00000904499,0.00018187864,0.99189365,0.0034053714,0.0002977091,0.0013121098,0.00016320046],"about_ca_topic_score_codex":0.00021960225,"about_ca_topic_score_gemma":0.00006752473,"teacher_disagreement_score":0.8647335,"about_ca_system_score_codex":0.000031675285,"about_ca_system_score_gemma":0.000065432556,"threshold_uncertainty_score":0.91149306},"labels":[],"label_agreement":null},{"id":"W1576467755","doi":"","title":"Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling","year":2007,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Windsor","funders":"","keywords":"Travelling salesman problem; Scheme (mathematics); Generalization; Mathematics; Combinatorics; Mathematical optimization","score_opus":0.09858564593074017,"score_gpt":0.3929758128072795,"score_spread":0.29439016687653935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576467755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11848883,0.0017926826,0.8740072,0.0016746277,0.0006640285,0.0026402816,0.00035144456,0.0000936018,0.00028726284],"genre_scores_gemma":[0.9775227,0.0007474265,0.020364821,0.00006109974,0.00045847002,0.00030186013,0.00018384833,0.00003174535,0.00032807613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990267,0.000053649394,0.00025843788,0.00014805028,0.0002211484,0.00029197018],"domain_scores_gemma":[0.998086,0.0012261096,0.000015774354,0.00019669942,0.00042593438,0.000049477316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021278362,0.00009123256,0.00010306319,0.00011593785,0.0011339345,0.000118478856,0.00017425699,0.00006605776,0.000031746276],"category_scores_gemma":[0.00023585142,0.00006420689,0.00004613663,0.00034671885,0.0001713697,0.0002236123,0.000028164957,0.00024430887,0.0000025111037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034815144,0.000105518404,0.00022504822,0.00027747772,0.00019215663,0.0000013789282,0.0032664798,0.90739226,0.02628923,0.048616886,0.0037272447,0.009871504],"study_design_scores_gemma":[0.00040674218,0.000075021264,0.0008368585,0.000024324663,0.000018509989,0.0000066636417,0.0007211848,0.99279916,0.002452688,0.000682863,0.0018861797,0.00008982657],"about_ca_topic_score_codex":0.00007012824,"about_ca_topic_score_gemma":0.00008469322,"teacher_disagreement_score":0.8590338,"about_ca_system_score_codex":0.000037965638,"about_ca_system_score_gemma":0.00007303814,"threshold_uncertainty_score":0.8721422},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014486655,0.00027608604,0.97880864,0.0017190711,0.00014940428,0.0008676954,0.000010106547,0.00015485688,0.0035274688],"genre_scores_gemma":[0.45935223,0.0001891984,0.53643644,0.00005740924,0.00017709384,0.00037746437,0.0000740484,0.00003763505,0.003298497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963937,0.0006922979,0.00040888914,0.0006501135,0.0010046059,0.0008504191],"domain_scores_gemma":[0.9979507,0.00030389806,0.00001642355,0.0008949965,0.0007131293,0.00012087941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002101245,0.00015434517,0.00017018078,0.0014234518,0.00058190804,0.0003225992,0.0013142016,0.000104893086,0.00011920186],"category_scores_gemma":[0.0002642823,0.00015319457,0.000054522192,0.004705107,0.00023740336,0.0012526572,0.00044735026,0.0006743457,0.00018435852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006796769,0.00022412394,0.00031882233,0.000007477476,0.000005204159,0.000042322838,0.00018640215,0.6805169,0.0012461805,0.3035866,0.00052762293,0.013331525],"study_design_scores_gemma":[0.00046989467,0.00008735794,0.00060071633,0.000013699461,6.21113e-7,0.000010899365,0.000064604494,0.96716565,0.0012169805,0.029078765,0.0011153389,0.00017549934],"about_ca_topic_score_codex":0.0009539621,"about_ca_topic_score_gemma":0.0005727585,"teacher_disagreement_score":0.44486558,"about_ca_system_score_codex":0.0001747931,"about_ca_system_score_gemma":0.0003181484,"threshold_uncertainty_score":0.6247093},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083310595,0.000092817834,0.987478,0.0005882646,0.00012131741,0.0026558575,0.0002701824,0.00009885989,0.00036362722],"genre_scores_gemma":[0.0091143465,0.00012443797,0.9875192,0.000021042688,0.00019859198,0.0008538409,0.00007989968,0.000053406173,0.0020352374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609375,0.00049177284,0.0008033233,0.0005908117,0.0012043699,0.0008159768],"domain_scores_gemma":[0.9946892,0.0010405415,0.00007172844,0.00065396674,0.0033133556,0.00023120665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025864812,0.00022675807,0.0004415567,0.0003499977,0.00073345046,0.00007667567,0.00053435436,0.00015682665,0.00029486537],"category_scores_gemma":[0.0041308226,0.00021583693,0.00015055652,0.0016542242,0.0005519613,0.00041421782,0.0003601241,0.00041419393,0.000035744284],"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.0016236542,0.007175076,0.0017351599,0.0027955922,0.0017481958,0.00043169668,0.023333224,0.06501144,0.021028377,0.27774864,0.024787672,0.57258123],"study_design_scores_gemma":[0.0015300285,0.0006357757,0.000046263205,0.000069572845,0.000017540851,0.00019755276,0.0012323083,0.9791673,0.00820242,0.003989317,0.004597207,0.0003147517],"about_ca_topic_score_codex":0.00018707922,"about_ca_topic_score_gemma":0.000119486096,"teacher_disagreement_score":0.91415584,"about_ca_system_score_codex":0.00035234995,"about_ca_system_score_gemma":0.0009380036,"threshold_uncertainty_score":0.8801575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035132384,0.00005628579,0.9889996,0.001970296,0.000048416845,0.003447111,0.00014245458,0.0001702277,0.0016523661],"genre_scores_gemma":[0.030604566,0.00020933883,0.96312004,0.00005133049,0.00035278598,0.0005297596,0.00024115905,0.00006377921,0.0048272302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626505,0.00030044912,0.00084010774,0.0005460276,0.0012104464,0.0008379399],"domain_scores_gemma":[0.99446154,0.0007549218,0.00005872786,0.0007165673,0.0037940822,0.00021414024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029383576,0.00024750657,0.0004385286,0.000999249,0.00063975353,0.00014410795,0.00059123826,0.0002301036,0.00027702368],"category_scores_gemma":[0.001813083,0.00023716662,0.00013441539,0.0016383898,0.00036050798,0.0005486659,0.00013000227,0.00056671794,0.000010771205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033840336,0.0021336863,0.000017311915,0.00026924865,0.00017406084,0.000015540967,0.0023780733,0.527273,0.03155332,0.17071371,0.0029091653,0.2622245],"study_design_scores_gemma":[0.0009937447,0.0008818257,0.000006293866,0.00004939616,0.00001170744,0.000013477395,0.00027766114,0.908031,0.07316935,0.016034853,0.0002976641,0.00023306212],"about_ca_topic_score_codex":0.000059166625,"about_ca_topic_score_gemma":0.000029558174,"teacher_disagreement_score":0.380758,"about_ca_system_score_codex":0.00028340716,"about_ca_system_score_gemma":0.00062178326,"threshold_uncertainty_score":0.9671374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03916096,0.026422981,0.8017947,0.046452343,0.00039620275,0.008789072,0.001042378,0.00050768844,0.07543368],"genre_scores_gemma":[0.39886114,0.19047703,0.35031858,0.023686523,0.00064486114,0.0045180134,0.0029529214,0.00008161703,0.028459303],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99691314,0.00040827072,0.0009731438,0.00017665642,0.0013027882,0.00022598733],"domain_scores_gemma":[0.99570894,0.0007198738,0.00010918023,0.00068511954,0.0026709854,0.000105871746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004979818,0.00010319798,0.00022276575,0.00058949366,0.001063896,0.00019249145,0.0005448513,0.00007044407,0.0011805099],"category_scores_gemma":[0.003899577,0.00007995928,0.00006358015,0.0016152142,0.00054294785,0.00347699,0.00022525026,0.0002463748,0.00037801501],"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.000022128721,0.00007752307,0.00007652405,0.0000784549,0.000026978378,8.4372135e-7,0.001829284,0.0021883573,0.000109399734,0.27131835,0.5720042,0.15226796],"study_design_scores_gemma":[0.00029644885,0.000088261186,0.0006444959,0.00008499194,0.000007753415,0.0000651661,0.0002614633,0.066314265,0.0002189466,0.008311794,0.9235718,0.00013458052],"about_ca_topic_score_codex":0.00020962408,"about_ca_topic_score_gemma":0.000010724917,"teacher_disagreement_score":0.4514761,"about_ca_system_score_codex":0.000054187814,"about_ca_system_score_gemma":0.00031396543,"threshold_uncertainty_score":0.99973255},"labels":[],"label_agreement":null},{"id":"W1629073290","doi":"","title":"A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Mathematical optimization; Integer programming; Trim; Stochastic programming; Nonlinear system; Nonlinear programming; Class (philosophy); Exploit; Branch and price; Mathematics; Computer science; Artificial intelligence","score_opus":0.07428170403181933,"score_gpt":0.35446976122891016,"score_spread":0.28018805719709083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629073290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012341519,0.00011930648,0.99427724,0.00028177348,0.00015372843,0.0015266592,0.000035408717,0.00030901426,0.0020627077],"genre_scores_gemma":[0.62082493,0.000023747214,0.3737363,0.000037762577,0.00037558237,0.00067236694,0.00085357705,0.000055939676,0.0034198365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855626,0.00007784601,0.0002619257,0.00026856974,0.00032796498,0.0005074151],"domain_scores_gemma":[0.9991133,0.000053157615,0.000008162827,0.00028239895,0.00042430082,0.00011867121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076926156,0.0001483306,0.00015092295,0.0002883475,0.000384272,0.00027605315,0.00021240744,0.000099125966,0.000041230353],"category_scores_gemma":[0.000092760405,0.00014482833,0.00005927042,0.00065660285,0.00006863843,0.00022886031,0.000024207662,0.00037708922,0.00005376815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072868893,0.00013131983,0.0000011387186,0.000027668706,0.000019959096,6.722279e-7,0.00036316042,0.9663126,0.001074199,0.0017920844,0.0006308639,0.029639037],"study_design_scores_gemma":[0.00062503846,0.00015885741,0.0000064184132,0.000019128001,0.000005962274,0.0000059802933,0.00015736466,0.9967373,0.00029309266,0.000053974847,0.0017706045,0.00016629201],"about_ca_topic_score_codex":0.0000393443,"about_ca_topic_score_gemma":0.000038745125,"teacher_disagreement_score":0.620541,"about_ca_system_score_codex":0.00012378712,"about_ca_system_score_gemma":0.000083557774,"threshold_uncertainty_score":0.5905928},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7913222,0.000038757258,0.000075253876,0.009036754,0.003297916,0.0006315138,0.000020622,0.00012095865,0.19545604],"genre_scores_gemma":[0.91214055,0.00021656697,0.007682633,0.00019054223,0.0025008433,0.00022622583,0.000036491576,0.000024026569,0.07698212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979179,0.00026108892,0.00023769127,0.00031436406,0.0005629584,0.00070600386],"domain_scores_gemma":[0.99880356,0.00026177915,0.0000139706535,0.00027347836,0.0003903086,0.00025693583],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033049162,0.00009519068,0.00012824686,0.00023354228,0.0035103066,0.0004886076,0.00058267167,0.00020505795,0.0052095824],"category_scores_gemma":[0.00081784156,0.00009809404,0.000051169707,0.0006353998,0.00076075125,0.0004330116,0.00010735671,0.000829155,0.003035127],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018737326,0.00054964336,0.02416371,0.000015062394,0.00014512088,0.000039380644,0.14360651,0.00005947641,0.00892632,0.47082523,0.13247615,0.21917465],"study_design_scores_gemma":[0.0004417949,0.000046529534,0.017028607,0.000011414992,0.000005661666,0.0000057334155,0.018362338,0.0013359636,0.0006248808,0.0052303034,0.956479,0.00042776432],"about_ca_topic_score_codex":0.01380743,"about_ca_topic_score_gemma":0.034150165,"teacher_disagreement_score":0.82400286,"about_ca_system_score_codex":0.0001502093,"about_ca_system_score_gemma":0.0012108763,"threshold_uncertainty_score":0.997787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100419335,0.00009366897,0.98411965,0.0025060538,0.0001386521,0.0024913277,0.00009750867,0.00005652101,0.00045468964],"genre_scores_gemma":[0.17949149,0.000050641676,0.8032867,0.00003685166,0.00049027195,0.0013096432,0.0005876157,0.00005543011,0.014691384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953335,0.0011725967,0.0007092558,0.0006031299,0.0016229749,0.00055853656],"domain_scores_gemma":[0.99223995,0.0036776422,0.000102496706,0.00063219893,0.0032282232,0.00011947797],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007987165,0.0001758486,0.00023991519,0.0003844678,0.0029621236,0.0011368787,0.00061566563,0.00009946652,0.000028375865],"category_scores_gemma":[0.0011387673,0.00010531835,0.0000846818,0.0018473252,0.00034406356,0.00049155223,0.000074008916,0.00038352044,0.00012931191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003134541,0.000301793,0.0003564495,0.0000032923338,0.000051667485,0.00000811123,0.00067344663,0.76752454,0.0009197649,0.01371468,0.0033908929,0.21274188],"study_design_scores_gemma":[0.0008518202,0.00037955298,0.0025636172,0.000016258293,0.000014477907,0.000024988762,0.0006333853,0.9768262,0.000079521786,0.002113936,0.0163372,0.00015906592],"about_ca_topic_score_codex":0.0011534311,"about_ca_topic_score_gemma":0.0023059063,"teacher_disagreement_score":0.21258281,"about_ca_system_score_codex":0.00010542326,"about_ca_system_score_gemma":0.00032269926,"threshold_uncertainty_score":0.99990004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024730375,0.0030529704,0.8761466,0.039244596,0.0015325513,0.0026018135,0.000019082048,0.0011027041,0.05156928],"genre_scores_gemma":[0.6289437,0.0017591293,0.28716204,0.0003259522,0.0010733325,0.00074084755,0.000031176955,0.00005937857,0.07990448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969509,0.0003896974,0.0003081082,0.0005226944,0.0010464282,0.000782118],"domain_scores_gemma":[0.99777037,0.00037676236,0.00001815178,0.0010312705,0.0006216679,0.00018177039],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022085584,0.00015325917,0.00013929774,0.00017827642,0.0047208797,0.0007037105,0.0017481521,0.00006914998,0.000040764553],"category_scores_gemma":[0.00023859016,0.00010373788,0.00006197465,0.0013361188,0.00031810894,0.00053490215,0.00051318936,0.000897422,0.0007404358],"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.000014275087,0.0009097564,0.0024091308,0.000022443555,0.00016190985,0.00049710943,0.007332047,0.050072588,0.0018928854,0.28691503,0.17146856,0.47830427],"study_design_scores_gemma":[0.0002304185,0.00017405977,0.00097054336,0.000013135798,0.0000014277639,0.0001548949,0.00006685185,0.8845069,0.0002465098,0.00091982377,0.1125436,0.00017185695],"about_ca_topic_score_codex":0.0010392474,"about_ca_topic_score_gemma":0.00008099283,"teacher_disagreement_score":0.8344343,"about_ca_system_score_codex":0.00008007041,"about_ca_system_score_gemma":0.0005496467,"threshold_uncertainty_score":0.9965748},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19345844,0.0006038821,0.7749202,0.0017768018,0.00019487261,0.009103637,0.0002934432,0.00036990445,0.019278798],"genre_scores_gemma":[0.5143092,0.00014338539,0.48386165,0.00007334523,0.00017029008,0.0009240435,0.0001630908,0.00002863994,0.00032629204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759823,0.00032606808,0.0003377705,0.0003642213,0.0010375676,0.0003361453],"domain_scores_gemma":[0.9960409,0.00011586012,0.00003854679,0.0007763518,0.0028856373,0.00014272104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025513775,0.00013292441,0.00019398017,0.00022378546,0.00058844424,0.000034788194,0.00030068227,0.000078876335,0.0007293041],"category_scores_gemma":[0.00035973437,0.0000989597,0.000063910506,0.00077916286,0.00049402256,0.00032656925,0.00010926954,0.000509072,0.000042579097],"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.00019623179,0.0031307423,0.00073750067,0.00007836307,0.00023241827,0.00006561426,0.028087493,0.024672544,0.06871868,0.10960174,0.0008412426,0.7636374],"study_design_scores_gemma":[0.0028661552,0.0010897184,0.0018242345,0.0001962198,0.00027792083,0.00017917594,0.015465386,0.89038885,0.07859294,0.0074774167,0.0012507695,0.00039124073],"about_ca_topic_score_codex":0.0008890366,"about_ca_topic_score_gemma":0.00019560212,"teacher_disagreement_score":0.8657163,"about_ca_system_score_codex":0.00021673014,"about_ca_system_score_gemma":0.00060533965,"threshold_uncertainty_score":0.79853684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02395626,0.000029604707,0.96712965,0.0018970572,0.0001826284,0.0011774924,0.00007782017,0.00004541885,0.0055040717],"genre_scores_gemma":[0.9291625,0.0000019072596,0.06669719,0.00011556095,0.0003708721,0.0006419439,0.00009209003,0.000018763198,0.0028991573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964015,0.00055238744,0.0005719369,0.00065860566,0.001337937,0.0004776302],"domain_scores_gemma":[0.9929116,0.004562511,0.00006181183,0.00056327507,0.0017247314,0.0001760836],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.014793312,0.00013386362,0.0001813256,0.0008113746,0.0019063134,0.00048780403,0.00066775345,0.000106802894,0.0003402831],"category_scores_gemma":[0.0022372094,0.000110167064,0.00011085719,0.0017000221,0.00035185483,0.0005279495,0.00009404473,0.00037566142,0.0004366084],"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.00023619954,0.0006314337,0.00019447878,0.000006633127,0.00007650375,0.000005934064,0.0021824597,0.106241174,0.008962602,0.5246588,0.0052985125,0.35150528],"study_design_scores_gemma":[0.0007542887,0.00021652352,0.000868104,0.000011895781,0.000009607861,0.000008145913,0.0048293606,0.83306277,0.035027508,0.1152055,0.009789755,0.00021655278],"about_ca_topic_score_codex":0.0000743955,"about_ca_topic_score_gemma":0.000100732264,"teacher_disagreement_score":0.90520626,"about_ca_system_score_codex":0.00018240252,"about_ca_system_score_gemma":0.00023462408,"threshold_uncertainty_score":0.99939305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9221289,0.0016780588,0.07355894,0.00029500967,0.0004156941,0.0011642586,0.000046251276,0.00015734618,0.0005555343],"genre_scores_gemma":[0.8467963,0.00035162628,0.15136404,0.000005745211,0.00015688542,0.00014330719,0.000029017989,0.00005275123,0.0011003402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786997,0.00016905593,0.0005017125,0.00019937163,0.00067045516,0.00058943994],"domain_scores_gemma":[0.99857664,0.0003020209,0.00003414927,0.00041187165,0.0005156363,0.00015969951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010317414,0.0001898239,0.00023347854,0.00028641077,0.00050638575,0.00006842256,0.00036651237,0.0001221589,0.00005707833],"category_scores_gemma":[0.00021613069,0.0001370251,0.0000735809,0.0006733932,0.00020887058,0.00017744912,0.000110097404,0.0004760856,0.000063797495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033008182,0.00061061035,0.003639718,0.00020504584,0.00016468846,0.0000010164243,0.0042787,0.96150434,0.012358927,0.0018948164,0.00008371299,0.015225418],"study_design_scores_gemma":[0.00064780563,0.00007809047,0.0025746196,0.00007947412,0.000011019467,0.000003735352,0.0009345783,0.9511015,0.044259094,0.000007960673,0.0001454321,0.00015671938],"about_ca_topic_score_codex":0.000047141508,"about_ca_topic_score_gemma":0.00009503422,"teacher_disagreement_score":0.07780511,"about_ca_system_score_codex":0.00016574308,"about_ca_system_score_gemma":0.000044308843,"threshold_uncertainty_score":0.55877215},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02233015,0.00017544988,0.9665691,0.00080264476,0.0002293098,0.002754692,0.00009403332,0.00005563852,0.0069889794],"genre_scores_gemma":[0.036768682,0.00006770313,0.9539785,0.000033064745,0.00025950593,0.0011771793,0.000057762183,0.00006883655,0.007588783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965589,0.00092829525,0.00064586976,0.000344416,0.00067882997,0.00084371114],"domain_scores_gemma":[0.994665,0.0032674356,0.00004087304,0.00063348754,0.0011945755,0.00019858607],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045396565,0.00018106026,0.00033380074,0.00051317055,0.00043695114,0.00010875618,0.0003698446,0.00015887569,0.0010747733],"category_scores_gemma":[0.00464744,0.00017209406,0.00008939821,0.0014884496,0.00021023887,0.0005730483,0.00013574597,0.00058259146,0.00012949848],"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.00018555945,0.004258368,0.0016450397,0.00038334352,0.00018435204,0.0000046194555,0.008871954,0.018294467,0.006499687,0.7882805,0.007207853,0.16418427],"study_design_scores_gemma":[0.0041602035,0.00051207776,0.00074838585,0.0002443966,0.000031577503,0.000033015287,0.0042114,0.8518767,0.029118223,0.086979665,0.021243481,0.00084091845],"about_ca_topic_score_codex":0.00007341408,"about_ca_topic_score_gemma":0.00011565959,"teacher_disagreement_score":0.83358216,"about_ca_system_score_codex":0.00029965685,"about_ca_system_score_gemma":0.0003116917,"threshold_uncertainty_score":0.99983835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038026136,0.0002777213,0.98897374,0.0034288757,0.00046602573,0.001351614,0.000041390864,0.00013768784,0.004942709],"genre_scores_gemma":[0.06816573,0.00020144795,0.91870534,0.00014755124,0.00048670656,0.0022429186,0.000022356722,0.00002654272,0.010001392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981097,0.0001905906,0.00024198146,0.00043184374,0.00046369643,0.00056216615],"domain_scores_gemma":[0.997782,0.0003731954,0.000014577323,0.00097349583,0.00075505336,0.00010169501],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019098463,0.0001131167,0.00010763872,0.0002540579,0.0025040582,0.0004522959,0.0016640805,0.000056170786,0.00014444228],"category_scores_gemma":[0.00012303151,0.0000828118,0.00008044772,0.0013767636,0.00030616933,0.00069014076,0.00041640992,0.00040250435,0.00011850872],"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.0000055006335,0.0001842463,0.000009722042,0.000011390985,0.00006292676,0.0000028803831,0.0050518666,0.000617245,0.00025863797,0.9087894,0.016269278,0.06873693],"study_design_scores_gemma":[0.00042135725,0.00030066073,0.00030636645,0.000017884799,0.000010985074,0.000054209377,0.0011159624,0.8047938,0.0024420035,0.09355835,0.09671611,0.0002623294],"about_ca_topic_score_codex":0.001015773,"about_ca_topic_score_gemma":0.00024307119,"teacher_disagreement_score":0.815231,"about_ca_system_score_codex":0.000059021928,"about_ca_system_score_gemma":0.00032500815,"threshold_uncertainty_score":0.99879456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007987715,0.00018953708,0.9880477,0.0025557016,0.00041475377,0.0014857347,0.000022917866,0.00013223643,0.0071434397],"genre_scores_gemma":[0.0007065838,0.00020363962,0.9938566,0.00008991056,0.00016902402,0.00095173076,0.000022556682,0.000021214832,0.0039787344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957196,0.0010804438,0.00047948083,0.0006720742,0.0011644431,0.00088393973],"domain_scores_gemma":[0.99496484,0.0009151943,0.000034016106,0.0012559111,0.0025783805,0.000251679],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006144621,0.00017350224,0.00017770675,0.00022922216,0.0024602,0.0010532682,0.0024370435,0.00011272298,0.00012898014],"category_scores_gemma":[0.0019431851,0.00012914305,0.00009212886,0.0022249913,0.00024365817,0.0007330831,0.0006035346,0.0003559608,0.00013914233],"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.000027521333,0.00019302091,0.000020182315,0.0000121979165,0.000076333126,0.000007696262,0.00070685,0.11717242,0.00003298577,0.6577772,0.004519446,0.21945417],"study_design_scores_gemma":[0.00046491346,0.00016488574,0.000043771634,0.0000049914124,0.000004490403,0.00002124027,0.00012177715,0.9846103,0.0004253382,0.0054474967,0.008542479,0.0001482927],"about_ca_topic_score_codex":0.0002800124,"about_ca_topic_score_gemma":0.0000824281,"teacher_disagreement_score":0.8674379,"about_ca_system_score_codex":0.00022573772,"about_ca_system_score_gemma":0.0007465078,"threshold_uncertainty_score":0.9999837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95569694,0.0010026298,0.04063311,0.00073731516,0.000091929236,0.0009535961,0.000022697512,0.000023923933,0.0008378724],"genre_scores_gemma":[0.9465602,0.0002703623,0.051137585,0.00004082101,0.00017825987,0.00030751442,0.0005235353,0.000025560641,0.0009561751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981796,0.00030511772,0.00028545855,0.00044938797,0.0002955605,0.0004848479],"domain_scores_gemma":[0.9992237,0.000034206954,0.000013501121,0.00030307894,0.0003347333,0.00009074996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006703459,0.00013269462,0.00014038647,0.00034565318,0.0003750526,0.000039676106,0.00027688418,0.00013803445,0.000040464703],"category_scores_gemma":[0.00008187629,0.00013420303,0.000047321344,0.0005427008,0.00027940777,0.000017234508,0.00018402048,0.00026348044,0.00007736741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009285207,0.0015792862,0.008348989,0.00006206506,0.00021427967,0.00015858305,0.002370486,0.7480882,0.18725213,0.0075681475,0.002349522,0.041915495],"study_design_scores_gemma":[0.0022550288,0.001200208,0.005471899,0.00002836993,0.0000071336003,0.00017394255,0.0007356458,0.9762401,0.0030034392,0.0023187057,0.0079719005,0.00059364387],"about_ca_topic_score_codex":0.00025327964,"about_ca_topic_score_gemma":0.0001521977,"teacher_disagreement_score":0.22815193,"about_ca_system_score_codex":0.00006192633,"about_ca_system_score_gemma":0.0003784755,"threshold_uncertainty_score":0.5472641},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044701807,0.00080357416,0.9869861,0.00048403247,0.00011297682,0.0031623952,0.000031331023,0.00008747832,0.0038619293],"genre_scores_gemma":[0.95098406,0.00045576904,0.04496307,0.000036798017,0.00010688235,0.0022817736,0.0000263908,0.000046766047,0.0010984837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984821,0.00024693765,0.00025745906,0.00022559329,0.0003333258,0.00045459697],"domain_scores_gemma":[0.9990095,0.00037060963,0.000009603627,0.00033941033,0.00022828771,0.000042612144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026243702,0.000122008336,0.000113314585,0.00021442598,0.00046649438,0.0001352501,0.00034493482,0.000089274545,0.000021694585],"category_scores_gemma":[0.00022637058,0.00008238007,0.00002947056,0.00083124527,0.00010139504,0.00024116303,0.000031482123,0.00037725834,0.0000071957247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050900337,0.00035088015,0.00012776759,0.00021340647,0.00021742466,0.00001156809,0.017620955,0.65924937,0.00081375823,0.013865491,0.027863886,0.2796146],"study_design_scores_gemma":[0.00022978836,0.000065614775,0.000376899,0.000010524947,0.000011119071,0.000013686906,0.00021712987,0.9981958,0.000068004505,0.00054868823,0.00016228057,0.000100407655],"about_ca_topic_score_codex":0.00028485272,"about_ca_topic_score_gemma":0.00041387614,"teacher_disagreement_score":0.9465139,"about_ca_system_score_codex":0.0001836964,"about_ca_system_score_gemma":0.00010415722,"threshold_uncertainty_score":0.35879448},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07061449,0.013396506,0.0026517217,0.014337037,0.012396699,0.004262932,0.00025052667,0.00039237202,0.8816977],"genre_scores_gemma":[0.8420424,0.0041414252,0.0074182046,0.00040908006,0.0060369344,0.00028843072,0.000058625315,0.000074535055,0.13953039],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932457,0.0015520512,0.00054190675,0.00082484435,0.002250193,0.0015852593],"domain_scores_gemma":[0.99730957,0.00019125911,0.000051765634,0.0006183286,0.001182042,0.0006470549],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.005171259,0.0002620979,0.00033991877,0.00042625406,0.0064938674,0.00058043684,0.0014151486,0.00039946215,0.010495531],"category_scores_gemma":[0.0004046017,0.00026571288,0.00018792115,0.002357036,0.0031628811,0.0008639107,0.00034513208,0.0010710129,0.009844304],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053732092,0.0012345796,0.00051189784,0.000048158563,0.00017606358,0.00011149346,0.64171463,0.000035743582,0.0010122233,0.17224894,0.11035028,0.072502255],"study_design_scores_gemma":[0.00058031845,0.00044002215,0.0031793986,0.0000669653,0.00006854181,0.000002352984,0.049425088,0.005554165,0.0002456223,0.0030865865,0.93656015,0.0007907728],"about_ca_topic_score_codex":0.058341827,"about_ca_topic_score_gemma":0.015812673,"teacher_disagreement_score":0.8262099,"about_ca_system_score_codex":0.00079469226,"about_ca_system_score_gemma":0.0023762835,"threshold_uncertainty_score":0.9999795},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38288346,0.12517339,0.0045426115,0.011726502,0.054485157,0.009601383,0.0026696934,0.0009746663,0.40794313],"genre_scores_gemma":[0.6801963,0.00198545,0.0020542655,0.0002608624,0.021944616,0.0004947903,0.00046914158,0.00020191578,0.29239267],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99260384,0.0014521504,0.00089575077,0.00082315184,0.0020481038,0.0021770024],"domain_scores_gemma":[0.9958696,0.00033654584,0.00006833602,0.0014550091,0.0015205115,0.0007499919],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004044857,0.00050423044,0.0005498173,0.0010340762,0.0058216923,0.0018849187,0.0010453309,0.0003250277,0.021322927],"category_scores_gemma":[0.0004964043,0.00052281556,0.00026435097,0.00046437056,0.001618785,0.0018791071,0.00044577682,0.0019589362,0.030968351],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010822067,0.003963814,0.0011106329,0.0006735178,0.0008263317,0.00014298146,0.08998131,0.00019217275,0.0020074823,0.30801192,0.5563006,0.03668101],"study_design_scores_gemma":[0.0008334806,0.00030340918,0.00095681805,0.00009517168,0.00015481439,0.000021952565,0.00414225,0.0077618607,0.00046930675,0.00023795577,0.98425376,0.0007691902],"about_ca_topic_score_codex":0.007743501,"about_ca_topic_score_gemma":0.0048869625,"teacher_disagreement_score":0.42795318,"about_ca_system_score_codex":0.0011614092,"about_ca_system_score_gemma":0.00076747756,"threshold_uncertainty_score":0.99972236},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1694169,0.10664849,0.037211522,0.15138142,0.02969124,0.028628604,0.0023595777,0.00274698,0.47191525],"genre_scores_gemma":[0.69017917,0.027420444,0.018127047,0.0017006533,0.015676497,0.0011106391,0.0007413128,0.0004553528,0.24458888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.97368455,0.010427243,0.002431989,0.0028705215,0.005923188,0.004662502],"domain_scores_gemma":[0.98753595,0.0039666537,0.0002712783,0.0025781593,0.003224447,0.0024234909],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.025102459,0.0011314326,0.0015165516,0.0011144083,0.009281768,0.0033534302,0.0033503664,0.0017728806,0.005120321],"category_scores_gemma":[0.0049168603,0.0010176513,0.0005433132,0.007844809,0.004436068,0.0027124572,0.0010665758,0.003779437,0.009266019],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023866557,0.0013791104,0.0014971226,0.00036596012,0.000812389,0.0006454759,0.010327222,0.0004821449,0.0010296953,0.9194574,0.033651084,0.030113757],"study_design_scores_gemma":[0.0023732292,0.0013276311,0.0010914479,0.0013872159,0.0006020934,0.00018176656,0.0066644154,0.016879056,0.001423311,0.02924976,0.9362299,0.0025901778],"about_ca_topic_score_codex":0.04859834,"about_ca_topic_score_gemma":0.019058285,"teacher_disagreement_score":0.90257883,"about_ca_system_score_codex":0.0017594913,"about_ca_system_score_gemma":0.004084428,"threshold_uncertainty_score":0.99952304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39781332,0.18744765,0.0037677805,0.13138835,0.0109791,0.01487545,0.0025707956,0.0014278875,0.24972965],"genre_scores_gemma":[0.84770894,0.011991958,0.008777219,0.0019442701,0.006723738,0.00048328438,0.0002580035,0.00025764585,0.12185494],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98107725,0.0048801247,0.0015541412,0.0026511862,0.0052909423,0.004546347],"domain_scores_gemma":[0.99117196,0.0018930269,0.00019874448,0.0017084442,0.0026443475,0.0023834992],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.007870317,0.0011260587,0.0011896875,0.00071028864,0.008997309,0.0035464952,0.0025957678,0.001362729,0.012369492],"category_scores_gemma":[0.0022710343,0.0009973813,0.0004580368,0.0040160483,0.0034185688,0.0020734149,0.0007304161,0.0038425033,0.007835044],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006154064,0.006004646,0.005912971,0.0007476133,0.004852437,0.0013367289,0.17250891,0.003536325,0.014438178,0.09702065,0.6390046,0.054021522],"study_design_scores_gemma":[0.0037197296,0.0015477203,0.0025789733,0.0006155088,0.00088993524,0.000052845833,0.00853783,0.04946578,0.0034910215,0.0007284746,0.92555314,0.0028190576],"about_ca_topic_score_codex":0.0190958,"about_ca_topic_score_gemma":0.007877246,"teacher_disagreement_score":0.44989562,"about_ca_system_score_codex":0.0011382492,"about_ca_system_score_gemma":0.0025573429,"threshold_uncertainty_score":0.9999337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6504848,0.14866284,0.01462267,0.06342248,0.009437593,0.016039757,0.002649751,0.001427169,0.093252935],"genre_scores_gemma":[0.9198659,0.0059492365,0.012485151,0.0006261535,0.0077801947,0.00031036613,0.00033859196,0.00024341462,0.052401002],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9823583,0.0050654905,0.0016786617,0.002138142,0.004548086,0.004211341],"domain_scores_gemma":[0.9917705,0.0015594055,0.00019103977,0.0015464445,0.0028181493,0.002114442],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0077152937,0.00093238504,0.0010015769,0.0007941653,0.009508302,0.0033077716,0.002400879,0.000836924,0.0022285862],"category_scores_gemma":[0.002029634,0.0008400985,0.00038159496,0.003148202,0.004414126,0.0035273852,0.0012717125,0.002440235,0.0058621233],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080517074,0.007846841,0.004959385,0.0017882322,0.0058295126,0.0014656391,0.1566587,0.020958506,0.011088747,0.2868606,0.09493565,0.40680304],"study_design_scores_gemma":[0.0024372651,0.0012173244,0.0011865298,0.0011608994,0.0007757968,0.000025350799,0.008368242,0.066527344,0.003664169,0.004383909,0.9078563,0.0023968827],"about_ca_topic_score_codex":0.033256285,"about_ca_topic_score_gemma":0.033980284,"teacher_disagreement_score":0.81292063,"about_ca_system_score_codex":0.0024451464,"about_ca_system_score_gemma":0.0032922497,"threshold_uncertainty_score":0.9998612},"labels":[],"label_agreement":null}]}