{"meta":{"query_hash":"a06ad09ae753","filters":{"venue":"Journal of Discrete Algorithms"},"cohort_total":97,"direct_labels_cover":1,"predictions_cover":97,"exported":97,"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/a06ad09ae753","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Discrete+Algorithms"},"results":[{"id":"W1553958932","doi":"10.1016/j.jda.2014.11.002","title":"The complexity of string partitioning","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; String (physics); Partition (number theory); Combinatorics; Integer (computer science); Collision; Mathematics; Computer science; Discrete mathematics","score_opus":0.03160110801655073,"score_gpt":0.2713666600122118,"score_spread":0.2397655519956611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553958932","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.004824268,0.0003790047,0.99262303,0.0010371293,0.00058680604,0.000039942133,0.0000044365997,0.000013471954,0.0004918864],"genre_scores_gemma":[0.7969211,0.00011513465,0.20246638,0.000056505996,0.00039252522,0.000001047055,0.0000015463871,0.000007455174,0.00003835042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985894,0.000120727076,0.00051625195,0.00011301237,0.00046739122,0.00019321196],"domain_scores_gemma":[0.9984915,0.00020496611,0.0006021792,0.00038347126,0.00021977707,0.000098077384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244052,0.00009225773,0.00020847823,0.000057163357,0.00025398543,0.0001491271,0.0010215574,0.000030164209,0.000005689036],"category_scores_gemma":[0.00011607764,0.000054467484,0.00012249163,0.0001808171,0.00017392523,0.0006286687,0.00026449846,0.00020240725,0.0000030317392],"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.000042950905,0.00012125985,0.00096607086,0.000033960197,0.00013821802,0.000020590582,0.00065778976,0.0013630927,0.0019120851,0.37916923,0.0041118637,0.6114629],"study_design_scores_gemma":[0.0015969373,0.00094636163,0.020797564,0.00038375775,0.00004388668,0.00024186348,0.0002469141,0.75556743,0.011518655,0.16152342,0.046750277,0.00038291252],"about_ca_topic_score_codex":0.000018944513,"about_ca_topic_score_gemma":0.000002923019,"teacher_disagreement_score":0.7920968,"about_ca_system_score_codex":0.000018447745,"about_ca_system_score_gemma":0.000045257773,"threshold_uncertainty_score":0.22211196},"labels":[],"label_agreement":null},{"id":"W1575954839","doi":"10.1016/j.jda.2005.12.004","title":"The strength of weak proximity","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Graph drawing","score_opus":0.008308327042227587,"score_gpt":0.2407506924496122,"score_spread":0.2324423654073846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575954839","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.039025456,0.0013857875,0.9538409,0.0026715298,0.0008503102,0.000089224435,0.0000042853085,0.000012923397,0.0021195456],"genre_scores_gemma":[0.90295327,0.000065475295,0.09581674,0.000026846465,0.00056224247,0.000001233188,0.0000018911327,0.0000043852374,0.0005679207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891305,0.000060679627,0.00041568317,0.00007993491,0.0004165216,0.000114105496],"domain_scores_gemma":[0.9989467,0.00015067542,0.00041727908,0.00015696311,0.00028871102,0.000039673057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052634533,0.000066741064,0.00011862657,0.00007528273,0.00011269134,0.00008381851,0.00041694188,0.000024085924,0.0000032581343],"category_scores_gemma":[0.00004571566,0.000040845716,0.00010651057,0.00029916756,0.0000387587,0.0004400852,0.000060422288,0.000110652385,0.0000016395963],"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.000061429026,0.000384603,0.0010625616,0.000030324165,0.00016396899,0.000029618732,0.0003185509,0.017198164,0.005842947,0.3627841,0.017325282,0.59479845],"study_design_scores_gemma":[0.0026918042,0.0015254454,0.07218464,0.00012829641,0.00008264705,0.0005061854,0.00022320088,0.50827456,0.064321764,0.25670585,0.09279282,0.00056283054],"about_ca_topic_score_codex":0.000012195189,"about_ca_topic_score_gemma":0.0000063454145,"teacher_disagreement_score":0.8639278,"about_ca_system_score_codex":0.000019503523,"about_ca_system_score_gemma":0.0001049123,"threshold_uncertainty_score":0.166564},"labels":[],"label_agreement":null},{"id":"W1902053630","doi":"10.1016/j.jda.2011.03.001","title":"Spanners of additively weighted point sets","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Voronoi diagram; Spanner; Bounded function; Geometric graph theory; Embedding; Dual graph; Graph; Discrete mathematics; Planar graph; Line graph; Geometry; Graph power; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.026122430943131235,"score_gpt":0.25249988215935676,"score_spread":0.22637745121622552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902053630","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.03251408,0.00038306497,0.9631753,0.0004972436,0.0007919101,0.00007313236,0.000016514605,0.000016382615,0.0025323518],"genre_scores_gemma":[0.6562905,0.00004109813,0.34332332,0.00008942444,0.00015245727,9.4742796e-7,0.0000038995845,0.0000058441547,0.000092546026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988177,0.000067714485,0.00046323767,0.00012361984,0.00039033813,0.00013739504],"domain_scores_gemma":[0.9987469,0.00006281694,0.0005079884,0.00014808784,0.00042292144,0.00011130747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039254586,0.000098150515,0.00020022166,0.00024216677,0.000042974545,0.000026077514,0.00040041353,0.00003960344,0.00007786779],"category_scores_gemma":[0.00004425363,0.000077700344,0.00017984363,0.00038652975,0.000038099868,0.0007001752,0.00007567522,0.00012596902,0.00000796193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036948652,0.0011934728,0.0009024793,0.000104228115,0.0013410354,0.0006221485,0.016245838,0.0019752625,0.010516242,0.12557834,0.030424163,0.8107273],"study_design_scores_gemma":[0.006902484,0.0069075893,0.11570359,0.0006117789,0.00031580104,0.0029216409,0.0012915134,0.3777013,0.24355672,0.23080337,0.01164118,0.0016430198],"about_ca_topic_score_codex":0.000009701832,"about_ca_topic_score_gemma":9.983593e-7,"teacher_disagreement_score":0.8090843,"about_ca_system_score_codex":0.000024489635,"about_ca_system_score_gemma":0.00012275609,"threshold_uncertainty_score":0.3168528},"labels":[],"label_agreement":null},{"id":"W1966403111","doi":"10.1016/j.jda.2012.04.003","title":"Counting and computing the Rand and block distances of pairs of set partitions","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Block (permutation group theory); Integer (computer science); Polynomial; Block size; Discrete mathematics; Computer science","score_opus":0.03980883968067587,"score_gpt":0.3289858052444653,"score_spread":0.2891769655637894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966403111","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.9758866,0.0020182715,0.02122527,0.00017429102,0.0002920706,0.00014202902,0.00001980542,0.000006753976,0.0002349547],"genre_scores_gemma":[0.9664327,0.00011254349,0.0332483,0.0000058047835,0.00017837288,7.0857e-7,2.8605385e-7,0.000012485903,0.000008781092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877036,0.00007025227,0.0006506019,0.000054673983,0.00029194815,0.00016218977],"domain_scores_gemma":[0.9974712,0.001124283,0.0010397842,0.00012623056,0.00016978262,0.00006867768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010301607,0.00010551969,0.0003844311,0.000041809708,0.00009204886,0.000017487335,0.00011224315,0.000036837377,0.000003338223],"category_scores_gemma":[0.0005120131,0.00006602838,0.00006921158,0.000103955455,0.00018644148,0.00021860114,0.000065828775,0.00015564534,1.0170823e-7],"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.00061417616,0.0022114315,0.08796532,0.009384253,0.003436909,0.000042067426,0.13003497,0.00066427054,0.014067945,0.7174838,0.0050629764,0.029031847],"study_design_scores_gemma":[0.004245046,0.00062464236,0.004980178,0.0020436638,0.000991273,0.0005576283,0.01945107,0.006652582,0.010334879,0.94854605,0.0010682597,0.0005047434],"about_ca_topic_score_codex":0.0000021687756,"about_ca_topic_score_gemma":0.0000011861229,"teacher_disagreement_score":0.2310622,"about_ca_system_score_codex":0.000012013282,"about_ca_system_score_gemma":0.000017539278,"threshold_uncertainty_score":0.2692559},"labels":[],"label_agreement":null},{"id":"W1966697435","doi":"10.1016/j.jda.2006.12.008","title":"Fixed parameter algorithms for one-sided crossing minimization revisited","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Minification; Vertex (graph theory); Algorithm; Graph; Computer science; Crossing number (knot theory); Combinatorics; Mathematics; Mathematical optimization","score_opus":0.049295907580973075,"score_gpt":0.3497608363701669,"score_spread":0.30046492878919384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966697435","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.0012492392,0.00021026147,0.9970137,0.00062208704,0.000526368,0.00016880201,0.000027499758,0.000043366515,0.00013869411],"genre_scores_gemma":[0.031498723,0.00008351472,0.96617573,0.0009785419,0.0007466533,0.0000020779119,0.00006649065,0.000031879736,0.00041640276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997657,0.000064228865,0.0010321568,0.00027097666,0.0005902509,0.00038540232],"domain_scores_gemma":[0.99739397,0.0004274724,0.0008631355,0.00036964423,0.0007083327,0.00023747158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014524508,0.00019073178,0.00038827388,0.000355305,0.00024820797,0.0008081526,0.0007673919,0.00010590013,0.000018938596],"category_scores_gemma":[0.0007648326,0.00016393243,0.00024973994,0.0006986681,0.00007920531,0.001299413,0.00010876628,0.00017908224,0.0000062175],"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.00034298812,0.0010034775,0.0016108169,0.0002901565,0.00094084686,0.00027277137,0.004505172,0.0017760384,0.0064944956,0.028750163,0.032592703,0.9214204],"study_design_scores_gemma":[0.0034886738,0.0007717778,0.0026742062,0.00046843782,0.00017463815,0.00018448118,0.00024429412,0.9346052,0.013485372,0.005833684,0.03738211,0.00068713585],"about_ca_topic_score_codex":0.00000382304,"about_ca_topic_score_gemma":0.0000016773722,"teacher_disagreement_score":0.93282914,"about_ca_system_score_codex":0.00007604769,"about_ca_system_score_gemma":0.00013923233,"threshold_uncertainty_score":0.77930343},"labels":[],"label_agreement":null},{"id":"W1972171563","doi":"10.1016/j.jda.2012.03.004","title":"On bounded degree plane strong geometric spanners","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Spanner; Combinatorics; Degree (music); Pitteway triangulation; Point set triangulation; Mathematics; Plane (geometry); Minimum-weight triangulation; Constrained Delaunay triangulation; Bounded function; Bowyer–Watson algorithm; Geometry; Computer science; Mathematical analysis; Physics","score_opus":0.03682748905994071,"score_gpt":0.28260200490666726,"score_spread":0.24577451584672655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972171563","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.061231494,0.0010413907,0.9332241,0.00076996535,0.0020337286,0.00007168036,0.000005063052,0.000023812012,0.0015988073],"genre_scores_gemma":[0.9162445,0.000033993547,0.082320444,0.00019209698,0.0009467897,0.0000012708306,0.0000060494904,0.000008338894,0.00024653826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841434,0.0000722256,0.0003866242,0.00013134046,0.0006772455,0.00031824614],"domain_scores_gemma":[0.99884224,0.0002092729,0.00034366522,0.00019611178,0.00016068568,0.00024804423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007078011,0.00013603667,0.00019861177,0.000604871,0.00011423823,0.00014183274,0.0004345214,0.00005274223,0.000032137195],"category_scores_gemma":[0.00013135775,0.00010786752,0.0001297164,0.00085889397,0.000022206419,0.0010738254,0.000071410395,0.00023636413,0.00004265042],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016274181,0.0008667367,0.0022354152,0.000041090087,0.00048453847,0.00014083346,0.0012465065,0.029447118,0.0010659939,0.1756121,0.026620477,0.76207644],"study_design_scores_gemma":[0.016292043,0.012525674,0.3386947,0.00060782256,0.000501638,0.0061319266,0.0009551854,0.3743638,0.03880829,0.086934835,0.11976356,0.0044205305],"about_ca_topic_score_codex":0.000004563022,"about_ca_topic_score_gemma":7.159062e-7,"teacher_disagreement_score":0.855013,"about_ca_system_score_codex":0.000088275636,"about_ca_system_score_gemma":0.00008839618,"threshold_uncertainty_score":0.43987098},"labels":[],"label_agreement":null},{"id":"W1973111150","doi":"10.1016/s1570-8667(03)00077-7","title":"A lower bound for the breakpoint phylogeny problem","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Breakpoint; Phylogenetics; Heuristics; Phylogenetic tree; Genome; Computer science; Combinatorics; Biology; Mathematics; Algorithm; Computational biology; Evolutionary biology; Gene; Mathematical optimization; Genetics; Chromosome","score_opus":0.010738364970273969,"score_gpt":0.2569843468178186,"score_spread":0.24624598184754465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973111150","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.31139803,0.01763571,0.6558877,0.008717527,0.0026956191,0.0021663997,0.0001783494,0.000024462433,0.0012961817],"genre_scores_gemma":[0.88032037,0.0015210959,0.11175569,0.00074302795,0.0041169655,0.00008081549,0.000045043344,0.00011526069,0.0013017387],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874,0.000026689142,0.00042974297,0.00019920977,0.00028263422,0.0003216872],"domain_scores_gemma":[0.9989434,0.000023787165,0.00033125927,0.0003010726,0.00028715382,0.000113329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052986864,0.00018896107,0.00021304325,0.00005479904,0.0001442673,0.0000734199,0.00042883022,0.00010284637,0.000016922888],"category_scores_gemma":[0.00005633074,0.000120158016,0.00037235205,0.00010161544,0.0001074715,0.000010656645,0.000085256754,0.00015297848,0.000006475509],"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.0010878909,0.0007448168,0.00034262225,0.00014247758,0.0027686362,0.000093872804,0.0007733999,0.007109355,0.88630307,0.00067955756,0.012695515,0.08725877],"study_design_scores_gemma":[0.017616404,0.011593906,0.0060662013,0.00024624364,0.00097500876,0.0019386659,0.0013618531,0.00076050166,0.20921548,0.01867312,0.7300154,0.0015372323],"about_ca_topic_score_codex":0.000013830532,"about_ca_topic_score_gemma":0.000012919475,"teacher_disagreement_score":0.71731985,"about_ca_system_score_codex":0.00004484107,"about_ca_system_score_gemma":0.00017764942,"threshold_uncertainty_score":0.48999017},"labels":[],"label_agreement":null},{"id":"W1976508410","doi":"10.1016/j.jda.2012.10.006","title":"A novel approach for leveraging co-occurrence to improve the false positive error in signature files","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bloom filter; False positive rate; Signature (topology); Computer science; Word error rate; Index (typography); Search engine indexing; Error detection and correction; Type I and type II errors; Data mining; Statistics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.03029142257773487,"score_gpt":0.2858053166275522,"score_spread":0.25551389404981734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976508410","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.02068357,0.00075389224,0.9760185,0.0013454662,0.0006394004,0.00030383738,0.0001498221,0.000013125463,0.00009239407],"genre_scores_gemma":[0.9147018,0.0000085296315,0.084046915,0.0007297223,0.0004222651,0.000020460999,0.000008001956,0.000008842937,0.00005343843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986352,0.00006888337,0.00035567998,0.00019463181,0.00035425468,0.00039139256],"domain_scores_gemma":[0.99892575,0.00024702516,0.00025386212,0.00023941051,0.00016848603,0.00016547654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696667,0.00016022229,0.0002450555,0.00015383624,0.00012376727,0.0001532091,0.0008594651,0.000059307094,0.0000012198724],"category_scores_gemma":[0.00012517002,0.00010185599,0.00018737654,0.00025249878,0.00002896834,0.00076755526,0.00012927435,0.0004346498,0.0000016082947],"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.0011010767,0.0032522208,0.0062254174,0.00028202962,0.0011129979,0.00012520379,0.09684152,0.01851226,0.19273022,0.0130267,0.03390146,0.6328889],"study_design_scores_gemma":[0.0065143765,0.0018385001,0.027945254,0.00071364344,0.00018921816,0.0011564288,0.0071742367,0.93464273,0.012059028,0.0010849027,0.0048950906,0.0017865587],"about_ca_topic_score_codex":0.000035832505,"about_ca_topic_score_gemma":0.0000015249004,"teacher_disagreement_score":0.9161305,"about_ca_system_score_codex":0.00007275698,"about_ca_system_score_gemma":0.00007281985,"threshold_uncertainty_score":0.41535667},"labels":[],"label_agreement":null},{"id":"W1977065097","doi":"10.1016/j.jda.2009.10.001","title":"On the generalized Berge sorting conjecture","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Direktion für Entwicklung und Zusammenarbeit; Mitacs; Canada Research Chairs","keywords":"Combinatorics; Conjecture; Sorting; Mathematics; String (physics); Algorithm","score_opus":0.011191178383329208,"score_gpt":0.24998249405102738,"score_spread":0.23879131566769818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977065097","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.27509734,0.0017707748,0.6742206,0.041932177,0.0016775109,0.00021741053,0.0000056443714,0.00012354237,0.0049549798],"genre_scores_gemma":[0.96559924,0.000052125535,0.028853893,0.0047996705,0.00052658905,8.3741384e-7,5.8658225e-7,0.000008844564,0.00015821478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870956,0.00011730774,0.00039597845,0.00013659011,0.0004073387,0.00023325428],"domain_scores_gemma":[0.9988814,0.00019365108,0.0004268987,0.00033791852,0.00006991569,0.00009020232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077946065,0.00013445792,0.0002149689,0.00007617098,0.00014692207,0.00018189297,0.0009772436,0.000047968064,0.000040116414],"category_scores_gemma":[0.000103510225,0.0000703791,0.00019762195,0.00021541883,0.000028598308,0.00032030427,0.00005399185,0.0003109289,0.000009353962],"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.000033561482,0.00010574303,0.000027983739,0.0000040660652,0.00010477461,0.00025149732,0.0012527942,0.00086633366,0.005194528,0.7742322,0.015308692,0.2026178],"study_design_scores_gemma":[0.0022170404,0.0019406633,0.0031390595,0.00026214446,0.000060962044,0.0010115481,0.0002394053,0.15932167,0.018259007,0.80479944,0.008115507,0.00063355535],"about_ca_topic_score_codex":0.0000025418274,"about_ca_topic_score_gemma":2.6845856e-7,"teacher_disagreement_score":0.6905019,"about_ca_system_score_codex":0.000025875233,"about_ca_system_score_gemma":0.0000437416,"threshold_uncertainty_score":0.28699765},"labels":[],"label_agreement":null},{"id":"W1977150669","doi":"10.1016/j.jda.2013.03.008","title":"All-maximum and all-minimum problems under some measures","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Perimeter; Measure (data warehouse); Line (geometry); Pi; RADIUS; Plane (geometry); Product (mathematics); Point (geometry); Set (abstract data type); Geometry; Computer science","score_opus":0.027468210880338385,"score_gpt":0.2626702243679236,"score_spread":0.2352020134875852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977150669","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.05567641,0.00295155,0.92345685,0.01628162,0.0010281906,0.00025474743,0.0000025678964,0.0000419964,0.00030605638],"genre_scores_gemma":[0.8829159,0.00058883236,0.112590596,0.002480656,0.00096762285,0.000013037262,0.000006070194,0.000020896745,0.0004163685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984492,0.00008046772,0.0004572949,0.00020521629,0.00056649564,0.00024130031],"domain_scores_gemma":[0.99887264,0.000092555216,0.00030242774,0.00017774849,0.0003362943,0.00021834589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047445475,0.00015155903,0.00021679173,0.00020605973,0.00008446228,0.0003601085,0.00038497054,0.00006261689,0.000021795937],"category_scores_gemma":[0.00003946332,0.00011599061,0.000095517295,0.00020540155,0.00004268932,0.001804358,0.0001273036,0.00019920328,0.000024768575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057302634,0.0006527903,0.0006091504,0.00014352943,0.0019879842,0.00012582162,0.0051011834,0.055811044,0.058860872,0.07285215,0.047977533,0.75582063],"study_design_scores_gemma":[0.0032265477,0.0014159486,0.017658722,0.0001476547,0.00014960689,0.0011014136,0.0002692215,0.35190728,0.004542124,0.58961624,0.029035084,0.0009301519],"about_ca_topic_score_codex":0.000020631862,"about_ca_topic_score_gemma":0.0000021885185,"teacher_disagreement_score":0.8272395,"about_ca_system_score_codex":0.0000363932,"about_ca_system_score_gemma":0.00008873206,"threshold_uncertainty_score":0.47299597},"labels":[],"label_agreement":null},{"id":"W1977410585","doi":"10.1016/j.jda.2006.10.003","title":"Fast pattern-matching on indeterminate strings","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Indeterminate; String (physics); Alphabet; Pattern matching; String searching algorithm; Matching (statistics); Combinatorics; Mathematics; Integer (computer science); Position (finance); Algorithm; Computer science; Discrete mathematics; Artificial intelligence; Pure mathematics; Linguistics","score_opus":0.00796072570902388,"score_gpt":0.2421792449441994,"score_spread":0.23421851923517553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977410585","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.0513492,0.00017348111,0.9458547,0.0005699067,0.00089534785,0.00007265118,0.00001838411,0.000044367716,0.0010219302],"genre_scores_gemma":[0.91491735,0.000042392563,0.08332622,0.00031348737,0.0011158322,0.0000022782792,0.0000071279796,0.000026148939,0.00024917244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997981,0.0000715776,0.0006130886,0.00026619254,0.0007333579,0.00033479312],"domain_scores_gemma":[0.99859977,0.00009788775,0.00059245137,0.0004313198,0.00013696906,0.00014159786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425768,0.00021451643,0.00031119402,0.00023536467,0.00015257063,0.00033055755,0.0011872246,0.00007620685,0.000016253465],"category_scores_gemma":[0.000013987843,0.0001565897,0.00018002547,0.00022592735,0.00003329165,0.0012563647,0.0003035369,0.00043425275,0.000023846405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026399397,0.00024735136,0.0006938689,0.000025263884,0.0000510724,0.00084849464,0.00047024887,0.0024600094,0.0017116921,0.0023311945,0.00473163,0.98640275],"study_design_scores_gemma":[0.011637809,0.006871285,0.14042409,0.0034165997,0.00019204448,0.0043479977,0.0007101905,0.62594193,0.04375725,0.098087855,0.060579695,0.0040332526],"about_ca_topic_score_codex":0.000105247374,"about_ca_topic_score_gemma":0.0000031177917,"teacher_disagreement_score":0.98236954,"about_ca_system_score_codex":0.000063370644,"about_ca_system_score_gemma":0.000055252425,"threshold_uncertainty_score":0.6385543},"labels":[],"label_agreement":null},{"id":"W1982134706","doi":"10.1016/j.jda.2011.04.002","title":"Finding common RNA pseudoknot structures in polynomial time","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudoknot; Time complexity; RNA; Computation; Computer science; Polynomial; Algorithm; Mathematics; Theoretical computer science; Combinatorics; Biology; Genetics","score_opus":0.01926749540988061,"score_gpt":0.25708302439689823,"score_spread":0.23781552898701763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982134706","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.99434525,0.00086264376,0.0016240947,0.00007856989,0.00036962843,0.00010602614,0.000011907645,0.000003910455,0.0025979474],"genre_scores_gemma":[0.98688525,0.00010736805,0.012149669,0.00008099978,0.00049381825,0.0000021098251,0.000005863332,0.000022586952,0.00025231225],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896055,0.00009832161,0.00040382918,0.00014517503,0.00017107159,0.00022107277],"domain_scores_gemma":[0.9993771,0.000012673133,0.00028994185,0.00017986937,0.000042792548,0.000097654556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003587069,0.0001464209,0.00024694757,0.0001056185,0.00004338328,0.000020891906,0.0003094803,0.00014980025,0.00015660869],"category_scores_gemma":[0.000046786008,0.00011774453,0.00015262153,0.000061910236,0.000040774627,0.000012093159,0.00006696303,0.00015787572,0.000008603292],"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.00030878172,0.000043049607,0.0007804629,0.000008519269,0.00007878917,0.000063755404,0.00021567577,0.000012248611,0.9773333,0.00003852631,0.00097648415,0.020140419],"study_design_scores_gemma":[0.0008091975,0.00073648297,0.0050013466,0.000045263856,0.000029360423,0.00017511017,0.00010577475,0.000061718456,0.98936164,0.0012648233,0.0021850797,0.00022418668],"about_ca_topic_score_codex":0.0000393055,"about_ca_topic_score_gemma":0.000006623849,"teacher_disagreement_score":0.019916233,"about_ca_system_score_codex":0.000016923068,"about_ca_system_score_gemma":0.000054726544,"threshold_uncertainty_score":0.48014826},"labels":[],"label_agreement":null},{"id":"W1983271670","doi":"10.1016/j.jda.2006.09.004","title":"Computing the maximum clique in the visibility graph of a simple polygon","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Visibility graph; Simple polygon; Clique graph; Visibility polygon; Mathematics; Vertex (graph theory); Polygon covering; Graph; Block graph; Regular polygon; Discrete mathematics; Graph power; Line graph; 1-planar graph; Geometry","score_opus":0.010632268095251732,"score_gpt":0.26875956718571214,"score_spread":0.2581272990904604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983271670","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.32500947,0.00039974492,0.6715477,0.002483695,0.00020915498,0.00011131534,0.0000027709832,0.0000057280454,0.00023039385],"genre_scores_gemma":[0.98035187,0.000010108394,0.019147264,0.00020845931,0.0002691719,8.107384e-7,0.00000232383,0.0000031426173,0.00000684142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983537,0.00028154752,0.000610318,0.0001273606,0.00047001638,0.00015702227],"domain_scores_gemma":[0.99871814,0.0003787979,0.0004426748,0.00025538067,0.00017873863,0.000026248195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020167436,0.00009217698,0.00017154093,0.00014690627,0.0001068255,0.000094635,0.00070329354,0.00003402119,0.000002790743],"category_scores_gemma":[0.00005804719,0.0000501892,0.00015270057,0.00077743485,0.000053299416,0.00029911593,0.000084619365,0.00023505658,7.3866863e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017070358,0.0014156977,0.020719321,0.00011797858,0.00019094933,0.00018792036,0.009331082,0.35637066,0.008683556,0.15134315,0.0067569464,0.444712],"study_design_scores_gemma":[0.0012499643,0.00059283816,0.277503,0.00006760098,0.000029755898,0.0003666459,0.0005674788,0.3599653,0.0041159536,0.35366848,0.0016232248,0.00024975147],"about_ca_topic_score_codex":0.0001519966,"about_ca_topic_score_gemma":0.000040675408,"teacher_disagreement_score":0.6553424,"about_ca_system_score_codex":0.000024462985,"about_ca_system_score_gemma":0.00008939828,"threshold_uncertainty_score":0.20466562},"labels":[],"label_agreement":null},{"id":"W1985142908","doi":"10.1016/j.jda.2008.04.003","title":"Yet another optimal algorithm for 3-edge-connectivity","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Algorithm; Enhanced Data Rates for GSM Evolution; Graph; Connectivity; Edge contraction; Mathematics; Computer science; Combinatorics; Line graph; Voltage graph; Artificial intelligence","score_opus":0.02465649113162753,"score_gpt":0.2608431391470576,"score_spread":0.23618664801543005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985142908","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.008007931,0.00039748466,0.98719096,0.0005130446,0.0031077,0.00018898181,0.000012657034,0.00004256324,0.0005386463],"genre_scores_gemma":[0.32634854,0.00012000721,0.66792107,0.0005493379,0.0029363725,0.000024158444,0.0000025212028,0.00005012826,0.0020478538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982056,0.000111971036,0.0006374826,0.00026715643,0.0004099772,0.00036779238],"domain_scores_gemma":[0.9982991,0.00023831832,0.0005259089,0.00033120153,0.00046123817,0.00014421297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081360707,0.00020215998,0.00044689086,0.0001809402,0.0002483625,0.00012026645,0.00075129373,0.00011169652,0.000023115803],"category_scores_gemma":[0.00006353108,0.00015638617,0.000415391,0.0002706128,0.000065767614,0.00093057705,0.00008556167,0.00025766893,0.000012522139],"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.00019968365,0.0007982615,0.0006492293,0.000073337535,0.001181039,0.0009250247,0.009027844,0.006323574,0.0017493943,0.008590041,0.17713183,0.79335076],"study_design_scores_gemma":[0.002424169,0.0015648406,0.00076678325,0.00010858128,0.000032566302,0.0041566333,0.00019065237,0.92884594,0.0032041117,0.0011261182,0.057078436,0.0005011819],"about_ca_topic_score_codex":0.000017667388,"about_ca_topic_score_gemma":0.0000022719232,"teacher_disagreement_score":0.92252237,"about_ca_system_score_codex":0.00008169075,"about_ca_system_score_gemma":0.00012497335,"threshold_uncertainty_score":0.63772434},"labels":[],"label_agreement":null},{"id":"W1987706313","doi":"10.1016/j.jda.2015.01.003","title":"String shuffle: Circuits and graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"String (physics); Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Reduction (mathematics); Computer science","score_opus":0.032039400917502854,"score_gpt":0.2727656157756264,"score_spread":0.24072621485812357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987706313","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.037338674,0.0041146604,0.95541215,0.00079186447,0.0013959365,0.0000918004,0.000011180168,0.00004912343,0.0007945927],"genre_scores_gemma":[0.7668761,0.0004961177,0.2315412,0.0002569427,0.0006488113,0.00000216684,0.000003609598,0.000024267281,0.00015077501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985286,0.000062712745,0.0004041457,0.00020018299,0.0005683602,0.0002359981],"domain_scores_gemma":[0.998666,0.000056477966,0.00031985846,0.00031016264,0.00024528455,0.00040225632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006681577,0.0001417007,0.00025490345,0.00018399139,0.00008352467,0.00024568988,0.00073793234,0.00005777718,0.0000038158],"category_scores_gemma":[0.00007524848,0.00010438581,0.00007786781,0.00028803997,0.0000478474,0.0015525465,0.00034443458,0.0002549007,0.0000049887503],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023985518,0.00013773295,0.0024385655,0.000028883336,0.0001409974,0.0005493365,0.0019433035,0.00021484775,0.0008569925,0.028710676,0.014155734,0.9507989],"study_design_scores_gemma":[0.017240766,0.006318871,0.045049578,0.0013879465,0.00028655835,0.011480493,0.0026943078,0.46513125,0.008949172,0.288794,0.14941987,0.0032471674],"about_ca_topic_score_codex":0.000018216027,"about_ca_topic_score_gemma":8.6601665e-7,"teacher_disagreement_score":0.9475518,"about_ca_system_score_codex":0.00003250143,"about_ca_system_score_gemma":0.00012399761,"threshold_uncertainty_score":0.42567295},"labels":[],"label_agreement":null},{"id":"W1989681946","doi":"10.1016/j.jda.2003.12.003","title":"Packing two disks into a polygonal environment","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Simple polygon; RADIUS; Computation; Algebraic number; Mathematics; Randomized algorithm; Tree (set theory); Time complexity; Polygonal chain; Running time; Simple (philosophy); Computational geometry; Regular polygon; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.010991902919686066,"score_gpt":0.26512032313862094,"score_spread":0.2541284202189349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989681946","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.040403243,0.000643182,0.9552356,0.003013201,0.00049923017,0.00004914478,0.0000014563838,0.0000132721925,0.00014168586],"genre_scores_gemma":[0.71463335,0.000051272324,0.28461888,0.00016782848,0.00048018407,0.0000013021712,0.000002348203,0.0000055954583,0.000039232236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986846,0.00004087781,0.00038471702,0.00016157831,0.0005568411,0.00017141661],"domain_scores_gemma":[0.9993009,0.00004173321,0.0002751268,0.0001655273,0.00007139073,0.00014533692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655637,0.00011533554,0.00015748636,0.00016524106,0.00012228517,0.00012951507,0.00038601583,0.000029673805,0.000017495207],"category_scores_gemma":[0.000023590856,0.00009444629,0.00013740528,0.00021852517,0.000031674335,0.0007102678,0.000119830926,0.00017591905,0.000022619],"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.000046757945,0.0003795343,0.00036463662,0.000019905463,0.00022581547,0.00033161353,0.0034880051,0.35773575,0.016043616,0.07780059,0.00038363965,0.54318017],"study_design_scores_gemma":[0.010979771,0.0028255738,0.021780247,0.00035670155,0.00014483974,0.0029525217,0.00039107195,0.1920401,0.06397812,0.67912996,0.023902474,0.0015186318],"about_ca_topic_score_codex":0.000017298147,"about_ca_topic_score_gemma":0.000002154991,"teacher_disagreement_score":0.6742301,"about_ca_system_score_codex":0.00013322677,"about_ca_system_score_gemma":0.00013181994,"threshold_uncertainty_score":0.3851408},"labels":[],"label_agreement":null},{"id":"W1991315286","doi":"10.1016/j.jda.2008.07.007","title":"Light orthogonal networks with constant geometric dilation","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Spatial network; Dilation (metric space); Spanner; Euclidean geometry; Constant (computer programming); Plane (geometry); Euclidean distance; Graph; Geometry; Computer science","score_opus":0.01306487721437632,"score_gpt":0.22650260851156517,"score_spread":0.21343773129718885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991315286","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.032303844,0.0010197512,0.96467674,0.0008322446,0.0004748486,0.00007120743,0.0000014291466,0.000021635655,0.00059828017],"genre_scores_gemma":[0.8797886,0.00019074694,0.11922866,0.00013539396,0.0005223758,0.000001553907,0.000004760668,0.000007703171,0.000120228804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984754,0.000061391955,0.0004403872,0.00017158873,0.0006530933,0.00019816711],"domain_scores_gemma":[0.99867684,0.00011394834,0.00043637087,0.0001630899,0.00045814944,0.00015162467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037092326,0.00013155882,0.00021438183,0.00044513275,0.00019130901,0.00008304257,0.00030888812,0.000050741775,0.000016042968],"category_scores_gemma":[0.00003824966,0.00009370355,0.00010139703,0.0014433314,0.000033999946,0.00086172257,0.000054254975,0.00021668282,0.000005323465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003006563,0.0005045652,0.012698671,0.000028717946,0.0005397906,0.0017300592,0.0011104614,0.7098727,0.001081351,0.029869663,0.009875281,0.23238806],"study_design_scores_gemma":[0.003227482,0.0022772239,0.075080894,0.00013121605,0.000077089804,0.009454312,0.000054432316,0.8920151,0.0022959518,0.0028956481,0.011769998,0.0007206682],"about_ca_topic_score_codex":0.0000015847104,"about_ca_topic_score_gemma":0.0000012434357,"teacher_disagreement_score":0.8474847,"about_ca_system_score_codex":0.000047700345,"about_ca_system_score_gemma":0.00021532836,"threshold_uncertainty_score":0.38211197},"labels":[],"label_agreement":null},{"id":"W1992800733","doi":"10.1016/j.jda.2012.03.003","title":"More results on overlapping squares","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Computer science; Least-squares function approximation; Combinatorics; Algorithm; Mathematics; Statistics; Mathematical physics","score_opus":0.02257373619451643,"score_gpt":0.29064074069788065,"score_spread":0.26806700450336424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992800733","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.025841175,0.0027057438,0.95691794,0.004142503,0.004969464,0.00019682526,0.00007732669,0.000111425354,0.005037618],"genre_scores_gemma":[0.72485495,0.0002443364,0.27031207,0.00089027156,0.0033014854,0.0000032459404,0.000013088271,0.0000323325,0.0003482164],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99791896,0.00008339576,0.00059756875,0.00019653427,0.0007775828,0.0004259683],"domain_scores_gemma":[0.99827003,0.00016609284,0.00055010116,0.0005447209,0.0001502238,0.00031882687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082283345,0.00018734619,0.00028540223,0.00019947179,0.00014553925,0.00015999406,0.000999161,0.00007571873,0.000011173999],"category_scores_gemma":[0.00013854205,0.00012927684,0.00017571702,0.00028072135,0.00003960772,0.0020092274,0.0002747498,0.00036106136,0.00003351983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054021983,0.0011885947,0.0014468302,0.000068851,0.00037607425,0.0006776981,0.010359277,0.0018090815,0.0034505748,0.020966986,0.123871796,0.835244],"study_design_scores_gemma":[0.012209674,0.0052720658,0.104843676,0.0023093512,0.00017841005,0.0037035309,0.0022527322,0.25662923,0.014560318,0.006816317,0.588365,0.002859666],"about_ca_topic_score_codex":0.000013993321,"about_ca_topic_score_gemma":2.2062815e-7,"teacher_disagreement_score":0.83238435,"about_ca_system_score_codex":0.0000688947,"about_ca_system_score_gemma":0.00006074857,"threshold_uncertainty_score":0.52717566},"labels":[],"label_agreement":null},{"id":"W1993464679","doi":"10.1016/j.jda.2006.03.004","title":"On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Heuristics; Travelling salesman problem; Heuristic; Consistent heuristic; Mathematics; Null-move heuristic; Algorithm; Mathematical optimization; Probabilistic logic; Matching (statistics); Set (abstract data type); Hamiltonian (control theory); Combinatorics; Computer science; Search algorithm; Incremental heuristic search","score_opus":0.012738928510713957,"score_gpt":0.24941058678552908,"score_spread":0.23667165827481512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993464679","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.025446257,0.00018801261,0.97163665,0.0016973591,0.00056188094,0.00026963346,0.00003633871,0.000012315973,0.00015153941],"genre_scores_gemma":[0.67830664,0.0000067443657,0.32063657,0.00013599779,0.00057876075,0.000017612128,0.000010324813,0.00001410317,0.00029324426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984437,0.00007932357,0.0005754763,0.00017659701,0.00052080967,0.00020408374],"domain_scores_gemma":[0.99826366,0.0004656183,0.0005148775,0.00023172685,0.0004578073,0.00006631137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867942,0.0001416856,0.0002362637,0.00017010457,0.00013210125,0.00009943222,0.0005244955,0.000046812802,0.000009047376],"category_scores_gemma":[0.00013509126,0.00009381625,0.00021891348,0.00034045853,0.00006052176,0.00023043832,0.000053115593,0.00015922669,0.0000022393906],"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.00016372382,0.0014785773,0.00031349942,0.00009994859,0.0002581569,0.00013425124,0.00069887924,0.071622856,0.001809543,0.40836132,0.02250918,0.49255008],"study_design_scores_gemma":[0.0015920801,0.0022474711,0.013209831,0.0001304614,0.000110620465,0.00027897538,0.00006075991,0.7602439,0.0032631168,0.21729878,0.0012255907,0.00033840616],"about_ca_topic_score_codex":0.000017815983,"about_ca_topic_score_gemma":0.0000039643014,"teacher_disagreement_score":0.68862104,"about_ca_system_score_codex":0.000052964133,"about_ca_system_score_gemma":0.00015661714,"threshold_uncertainty_score":0.38257155},"labels":[],"label_agreement":null},{"id":"W1995833618","doi":"10.1016/j.jda.2004.04.011","title":"Efficient algorithms for Koblitz curves over fields of characteristic three","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Finite field; Computation; Arithmetic; Mathematics; Point (geometry); Field (mathematics); Computer science; Multiplication (music); Window (computing); Discrete mathematics; Combinatorics; Pure mathematics; Geometry","score_opus":0.0169061173818016,"score_gpt":0.2731545774228335,"score_spread":0.2562484600410319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995833618","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.052301228,0.003246676,0.9411852,0.0017983692,0.001058283,0.00027542087,0.00003528906,0.000023804061,0.00007574162],"genre_scores_gemma":[0.760555,0.00057048054,0.23785034,0.00041040176,0.0005397796,0.0000145778,0.0000049750442,0.000027609494,0.000026823065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978786,0.00003910977,0.00083087874,0.00025768764,0.0006307521,0.00036294645],"domain_scores_gemma":[0.9981031,0.00019507493,0.00070816616,0.00042876965,0.00038116562,0.00018373066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067046075,0.00021669817,0.00050342176,0.00031679787,0.00010910318,0.000077325254,0.0009803426,0.00010800008,0.00001462856],"category_scores_gemma":[0.00011449238,0.0001617818,0.00053802214,0.0005424477,0.00012418603,0.00026141063,0.0001334213,0.00027948534,0.0000021661845],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010730075,0.007466215,0.0061786934,0.005692096,0.004553254,0.0013820927,0.012105802,0.05524527,0.018502109,0.15020703,0.008080558,0.7295139],"study_design_scores_gemma":[0.028275868,0.015495243,0.27259567,0.010034545,0.0013844792,0.0024897368,0.00053595175,0.40010372,0.038232364,0.21997093,0.006987042,0.0038944336],"about_ca_topic_score_codex":0.00003937966,"about_ca_topic_score_gemma":0.000007412205,"teacher_disagreement_score":0.72561944,"about_ca_system_score_codex":0.000040595158,"about_ca_system_score_gemma":0.00017894199,"threshold_uncertainty_score":0.65972704},"labels":[],"label_agreement":null},{"id":"W1996923782","doi":"10.1016/j.jda.2010.12.002","title":"On the number of shortest descending paths on the surface of a convex terrain","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Terrain; Regular polygon; Mathematics; Surface (topology); Combinatorics; Computer science; Geometry; Geography; Cartography","score_opus":0.016868138799955253,"score_gpt":0.2749265895926963,"score_spread":0.25805845079274103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996923782","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.8799485,0.000028273134,0.11346004,0.0045987447,0.0007772321,0.000113934795,0.000008428424,0.000006008027,0.0010588437],"genre_scores_gemma":[0.9868428,0.000008450622,0.012703449,0.00022255316,0.00015007526,8.900472e-7,7.772487e-7,0.0000055048,0.000065468696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986814,0.0001247289,0.00040998036,0.00011072022,0.0005490651,0.00012406237],"domain_scores_gemma":[0.99805033,0.00090921397,0.00048010543,0.00027914066,0.00022809068,0.000053133404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313118,0.00010170554,0.0001817333,0.000059482823,0.00009898957,0.000057054593,0.0006084563,0.000041272593,0.00006774898],"category_scores_gemma":[0.0002469986,0.00005245344,0.00013770134,0.0003159139,0.00007847511,0.0001837161,0.000067579356,0.00035890978,0.000006068832],"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.00015217693,0.0007118726,0.0037489303,0.000038293663,0.00039096372,0.00005258275,0.006117199,0.023160653,0.14934729,0.74136865,0.0076780696,0.06723332],"study_design_scores_gemma":[0.0017703259,0.001884933,0.034380432,0.000553711,0.00009828135,0.0005810286,0.001003417,0.64758205,0.22422683,0.08467245,0.0026132744,0.0006332484],"about_ca_topic_score_codex":0.000007680881,"about_ca_topic_score_gemma":0.0000023829296,"teacher_disagreement_score":0.6566962,"about_ca_system_score_codex":0.000013709355,"about_ca_system_score_gemma":0.000091926224,"threshold_uncertainty_score":0.21389893},"labels":[],"label_agreement":null},{"id":"W1997569066","doi":"10.1016/j.jda.2014.01.002","title":"Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20]","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Disjoint sets; Set (abstract data type); Algorithm; Computer science; Mathematics; Combinatorics","score_opus":0.019056176328588144,"score_gpt":0.30864762417329683,"score_spread":0.2895914478447087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997569066","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.007062428,0.0002165118,0.98448205,0.0042066574,0.0029773728,0.00035641668,0.00003436572,0.000110800924,0.00055336946],"genre_scores_gemma":[0.5499224,0.00024249732,0.44444877,0.0006069454,0.0018535872,0.00005720628,0.000023797722,0.00016119036,0.0026836176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948289,0.000730796,0.0011621373,0.00070409797,0.0014928522,0.0010812664],"domain_scores_gemma":[0.99583954,0.0005958027,0.00073435716,0.0011265127,0.00062958436,0.0010741946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033062282,0.00049190654,0.00077811966,0.00111681,0.0005785876,0.0004382382,0.0024780459,0.00016429828,0.00005268739],"category_scores_gemma":[0.0004653389,0.00040009164,0.0005039885,0.0018853477,0.00023348011,0.0018873008,0.00081250485,0.0010705127,0.00016482432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003876282,0.00057790475,0.0027361098,0.00014711377,0.0009988147,0.0007295387,0.009859954,0.018247535,0.011282316,0.03884868,0.021476973,0.89470744],"study_design_scores_gemma":[0.0063302247,0.006806903,0.007716817,0.0010125085,0.0002520296,0.0029418285,0.0018257169,0.6278001,0.019049192,0.170696,0.1520347,0.0035339396],"about_ca_topic_score_codex":0.000038693117,"about_ca_topic_score_gemma":0.000027445796,"teacher_disagreement_score":0.8911735,"about_ca_system_score_codex":0.00029676792,"about_ca_system_score_gemma":0.00015532754,"threshold_uncertainty_score":0.9998451},"labels":[],"label_agreement":null},{"id":"W1999757901","doi":"10.1016/s1570-8667(03)00022-4","title":"On time versus size for monotone dynamic monopolies in regular topologies","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Monotone polygon; Mathematics; Combinatorics; Hypercube; Simple (philosophy); Network topology; Computation; Dynamo; Discrete mathematics; Graph; Computer science; Topology (electrical circuits); Algorithm; Physics","score_opus":0.055838635520928194,"score_gpt":0.4016639778191219,"score_spread":0.34582534229819367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999757901","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.9599904,0.00055912964,0.028139988,0.0035389967,0.00077646744,0.00044336,0.00005941489,0.000021897391,0.006470374],"genre_scores_gemma":[0.9815509,0.000048601327,0.015296208,0.000081386985,0.00005975075,0.000016715956,0.000001008771,0.000012954837,0.0029325183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981188,0.00019203429,0.0007201698,0.00020874153,0.00052228995,0.0002379721],"domain_scores_gemma":[0.99489653,0.0040034377,0.0004537924,0.00035812132,0.0001980129,0.00009009261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023566766,0.0001341894,0.00036271647,0.00022140515,0.00010499286,0.00009522741,0.0005577781,0.00007646239,0.00018341235],"category_scores_gemma":[0.005291634,0.00009179546,0.00020634047,0.0003915891,0.00015091604,0.00025357565,0.000029720364,0.00018330317,0.000071570015],"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.007400536,0.0014464813,0.00055572874,0.000026321231,0.00053349975,0.00014353321,0.0041509536,0.019726338,0.023709346,0.72875696,0.026183207,0.18736711],"study_design_scores_gemma":[0.0025353697,0.0009931977,0.0011333883,0.0000294052,0.000030526993,0.000027621561,0.0027784344,0.0039495938,0.0048887087,0.9744677,0.008959576,0.000206502],"about_ca_topic_score_codex":0.0000025446238,"about_ca_topic_score_gemma":0.0000042245542,"teacher_disagreement_score":0.24571075,"about_ca_system_score_codex":0.00007062265,"about_ca_system_score_gemma":0.00006971592,"threshold_uncertainty_score":0.6334962},"labels":[],"label_agreement":null},{"id":"W1999899863","doi":"10.1016/j.jda.2012.04.013","title":"Generating simple convex Venn diagrams","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Isometry (Riemannian geometry); Monotone polygon; Simple (philosophy); Mathematics; Isometry group; Symmetry (geometry); Combinatorics; Regular polygon; Geometry; Pure mathematics","score_opus":0.018870069576207245,"score_gpt":0.27755810722365803,"score_spread":0.2586880376474508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999899863","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.06422093,0.0016848849,0.9317791,0.0006025831,0.0013905424,0.0000529607,0.0000023395958,0.000020464488,0.00024622955],"genre_scores_gemma":[0.8179683,0.00003884786,0.17949456,0.00033271938,0.0020406162,0.0000018405998,0.0000057577704,0.0000076121364,0.00010973967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872386,0.000083712875,0.00040823684,0.000104498926,0.00041621662,0.00026345204],"domain_scores_gemma":[0.999001,0.00010502717,0.0003260137,0.00016195625,0.0002004488,0.00020551725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007241864,0.00010814385,0.0001823552,0.00012649434,0.00012498135,0.00013630172,0.0003328132,0.00004267953,0.000020796952],"category_scores_gemma":[0.00008564784,0.00008797437,0.00012433271,0.00032538254,0.000019195346,0.0012396009,0.00009083226,0.00016469952,0.000017747176],"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.0000272879,0.0004818171,0.007408374,0.00004528451,0.00031684324,0.00008632905,0.0040064286,0.03844609,0.020675346,0.041764654,0.024234375,0.86250716],"study_design_scores_gemma":[0.0019121796,0.0008071746,0.016977768,0.00006421154,0.00007979416,0.0011777831,0.00024164954,0.8559885,0.020129964,0.0134411715,0.08838681,0.00079298246],"about_ca_topic_score_codex":0.0000034156014,"about_ca_topic_score_gemma":6.671187e-7,"teacher_disagreement_score":0.8617142,"about_ca_system_score_codex":0.00004006153,"about_ca_system_score_gemma":0.00007272863,"threshold_uncertainty_score":0.35874906},"labels":[],"label_agreement":null},{"id":"W2001146041","doi":"10.1016/j.jda.2013.08.002","title":"Acyclic coloring with few division vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Wheel graph; Subdivision; Path graph; Complete coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.01441011631649932,"score_gpt":0.27871174020359285,"score_spread":0.26430162388709355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001146041","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.2863914,0.00053367583,0.7105642,0.0013538484,0.00026835361,0.00018177181,7.951908e-7,0.000037723235,0.0006682464],"genre_scores_gemma":[0.8705376,0.000086423584,0.12898232,0.00008024536,0.00011688385,0.0000073231404,2.5645065e-7,0.00001510905,0.0001738799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821454,0.00010498293,0.00035114677,0.0002000038,0.0007547794,0.00037455955],"domain_scores_gemma":[0.9985406,0.00020740982,0.00029386525,0.0003689838,0.00033555622,0.00025361916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047647124,0.0001428996,0.0002447923,0.00022238861,0.00014018673,0.00029411053,0.0012110717,0.000039001417,0.000038185164],"category_scores_gemma":[0.0000770127,0.00009031001,0.00009583266,0.0005238179,0.000097905104,0.0026583828,0.00025446323,0.00035499694,0.000053907934],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002189732,0.00042579474,0.014573661,0.00010609252,0.0005649693,0.0007244503,0.0035076393,0.0041082497,0.025900396,0.022185668,0.0015505693,0.9261335],"study_design_scores_gemma":[0.012132154,0.015825514,0.2535386,0.001932314,0.00016451023,0.0024239414,0.0024775157,0.34832168,0.075367905,0.26764822,0.017218003,0.0029496185],"about_ca_topic_score_codex":0.000015119623,"about_ca_topic_score_gemma":0.000001502383,"teacher_disagreement_score":0.9231839,"about_ca_system_score_codex":0.00004991415,"about_ca_system_score_gemma":0.000059157923,"threshold_uncertainty_score":0.36827353},"labels":[],"label_agreement":null},{"id":"W2001331197","doi":"10.1016/j.jda.2013.10.003","title":"Finding dominators via disjoint set union","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Benbria (Canada); Université du Québec en Outaouais","funders":"","keywords":"Computer science; Disjoint sets; Correctness; Disjoint union (topology); Set (abstract data type); Theoretical computer science; Data structure; Graph; Time complexity; Simple (philosophy); Algorithm; Code (set theory); Linear programming; Mathematics; Programming language","score_opus":0.018498740320456616,"score_gpt":0.25915218095984277,"score_spread":0.24065344063938615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001331197","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.014001387,0.00032925938,0.98174286,0.0009700738,0.0017236484,0.00016944694,6.219406e-7,0.000041382853,0.001021316],"genre_scores_gemma":[0.9779514,0.000026813366,0.021185549,0.00007417822,0.00041082755,0.0000053353397,0.0000013362514,0.0000123177215,0.00033221624],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823684,0.00016180844,0.0005595571,0.00019345124,0.00049127144,0.00035709052],"domain_scores_gemma":[0.9985967,0.00006952358,0.00055386435,0.00031261452,0.00021967568,0.00024761408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016909,0.00016755158,0.0003060868,0.0001812006,0.00012153308,0.00034447003,0.00081428775,0.00008221446,0.00004389891],"category_scores_gemma":[0.000048341997,0.00011363719,0.00020359542,0.0003101285,0.00004850849,0.001161926,0.00016922531,0.00026359488,0.000113691305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010431299,0.00021605012,0.0048040696,0.00009509389,0.00033394666,0.00035493978,0.00834929,0.00013147327,0.0029004095,0.04788952,0.009710924,0.92520386],"study_design_scores_gemma":[0.009519498,0.006825471,0.07031409,0.00033642337,0.00025853663,0.007391502,0.0055525587,0.28114164,0.019292723,0.40009627,0.19526702,0.004004267],"about_ca_topic_score_codex":0.0001135032,"about_ca_topic_score_gemma":0.0000021044946,"teacher_disagreement_score":0.96395004,"about_ca_system_score_codex":0.00008289188,"about_ca_system_score_gemma":0.000061277125,"threshold_uncertainty_score":0.463399},"labels":[],"label_agreement":null},{"id":"W2002246332","doi":"10.1016/j.jda.2010.08.004","title":"The longest common extension problem revisited and applications to approximate string searching","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Substring; String (physics); Extension (predicate logic); Computation; Constant (computer programming); Algorithm; String searching algorithm; Approximate string matching; Preprocessor; Mathematics; Computer science; Range (aeronautics); Pattern matching; Data structure; Artificial intelligence","score_opus":0.014157796226955652,"score_gpt":0.29080555133089003,"score_spread":0.27664775510393436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002246332","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.011644248,0.0006502615,0.98443586,0.0023753997,0.00023138736,0.00038237893,0.000010149921,0.000037743936,0.00023256992],"genre_scores_gemma":[0.17717431,0.0006488367,0.8206807,0.00026422454,0.0010318415,0.000031731615,0.000007337961,0.00003222323,0.00012880148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985329,0.0000737056,0.00043665638,0.00024429648,0.00044256603,0.00026989623],"domain_scores_gemma":[0.9984129,0.00021211243,0.000303407,0.0005872693,0.000218008,0.0002662703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012358841,0.00013562856,0.00020628008,0.000117679025,0.00056815223,0.0005801985,0.0010011329,0.00004957709,0.0000016711424],"category_scores_gemma":[0.00005079885,0.000081440696,0.00006082,0.00032401047,0.000059094647,0.0006969646,0.0006579051,0.0006002205,0.000004398568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001717551,0.0000419343,0.00022301589,0.000022300337,0.000024208748,0.000022754142,0.00029185606,0.000088715555,0.007897594,0.017487133,0.0007635112,0.9731198],"study_design_scores_gemma":[0.0026149251,0.0014082924,0.027806794,0.0010870453,0.00011634722,0.002961294,0.0006132737,0.59061146,0.00755692,0.080799334,0.28298274,0.0014415728],"about_ca_topic_score_codex":0.000013879483,"about_ca_topic_score_gemma":0.00000629291,"teacher_disagreement_score":0.97167826,"about_ca_system_score_codex":0.00001646167,"about_ca_system_score_gemma":0.000044263023,"threshold_uncertainty_score":0.55948675},"labels":[],"label_agreement":null},{"id":"W2004001692","doi":"10.1016/j.jda.2012.04.002","title":"Monomer-dimer tatami tilings of square regions","year":2012,"lang":"en","type":"preprint","venue":"Journal of Discrete Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Dimer; Monomer; Square (algebra); Square tiling; Mathematics; Substitution tiling; Hexagonal tiling; Grid; Physics; Geometry; Polymer","score_opus":0.018253734975467534,"score_gpt":0.24423502890339974,"score_spread":0.2259812939279322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004001692","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.7199139,0.09462503,0.14361294,0.00040692318,0.024490895,0.0012956597,0.0009054731,0.00036743112,0.014381773],"genre_scores_gemma":[0.99463123,0.0007666799,0.003288915,0.000010334496,0.0010404985,0.000009723774,0.000022720667,0.00008646824,0.00014341265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977356,0.00010894804,0.0011743413,0.00016320021,0.00046478887,0.00035307248],"domain_scores_gemma":[0.99811983,0.000077544515,0.00080249313,0.0005077848,0.00025031762,0.0002420448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008077353,0.00037241567,0.00089413335,0.0003540295,0.000042225303,0.000039337436,0.00058483565,0.0004046512,0.00007699636],"category_scores_gemma":[0.00003000536,0.00031990118,0.0006910915,0.00017373862,0.00009218175,0.00023847232,0.00014440872,0.0012698866,0.000016061222],"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.0010728847,0.0020357931,0.01294231,0.030005816,0.040709857,0.0010642081,0.063030496,0.5369393,0.052232742,0.03010343,0.09761282,0.13225031],"study_design_scores_gemma":[0.017194794,0.0036321185,0.030606251,0.045992013,0.015439086,0.0064936318,0.030487146,0.18286347,0.1264043,0.18973863,0.33322772,0.01792082],"about_ca_topic_score_codex":0.000025150435,"about_ca_topic_score_gemma":0.0000018236333,"teacher_disagreement_score":0.35407585,"about_ca_system_score_codex":0.00007019291,"about_ca_system_score_gemma":0.00006273059,"threshold_uncertainty_score":0.9999253},"labels":[],"label_agreement":null},{"id":"W2004160229","doi":"10.1016/j.jda.2011.11.003","title":"A distribution-sensitive dictionary with low space overhead","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Overhead (engineering); Computer science; Sequence (biology); Data structure; Space (punctuation); Distribution (mathematics); Sensitivity (control systems); Algorithm; Mathematics","score_opus":0.01216150086142602,"score_gpt":0.2241221282317116,"score_spread":0.2119606273702856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004160229","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.0088212015,0.00021679854,0.9888552,0.0003702443,0.0005283543,0.00008982311,0.00007241187,0.000041832467,0.0010041659],"genre_scores_gemma":[0.64870954,0.00018381963,0.3500753,0.00017296722,0.0005856368,0.0000044421927,0.00003489484,0.000025570867,0.00020785024],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9983815,0.000076659984,0.00038712722,0.00025463256,0.0006110966,0.00028897953],"domain_scores_gemma":[0.99843526,0.000066681576,0.00046246784,0.0004062301,0.00038823398,0.00024115319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029533307,0.00019521578,0.00028464172,0.00009887566,0.0001666296,0.00009397388,0.00063618494,0.00006726443,0.000026296158],"category_scores_gemma":[0.000027908556,0.00012904857,0.00013087124,0.0003539327,0.000097494034,0.0016027831,0.00021548294,0.00031808316,0.000017402019],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003939326,0.0058294553,0.01426888,0.00027791358,0.0034687226,0.019521601,0.030561056,0.0015958827,0.004378112,0.19754575,0.119849056,0.59876424],"study_design_scores_gemma":[0.014363255,0.0147449365,0.46122298,0.0033176574,0.0005335716,0.020248557,0.003856645,0.3534727,0.052321285,0.026297146,0.045498054,0.0041232095],"about_ca_topic_score_codex":0.000056628687,"about_ca_topic_score_gemma":0.0000024183312,"teacher_disagreement_score":0.6398883,"about_ca_system_score_codex":0.00007319547,"about_ca_system_score_gemma":0.0001553972,"threshold_uncertainty_score":0.5262448},"labels":[],"label_agreement":null},{"id":"W2004251193","doi":"10.1016/j.jda.2012.04.006","title":"Quasi-cyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math> and enumeration of defining polynomials","year":2012,"lang":"lv","type":"article","venue":"Journal of Discrete Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamming distance; Mathematics; Circulant matrix; Hamming code; Combinatorics; Minimum distance; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code","score_opus":0.018735499125186666,"score_gpt":0.2489108541747267,"score_spread":0.23017535504954004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004251193","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.78742796,0.004059608,0.010560522,0.00067713874,0.0041136364,0.000043694912,0.00028777166,0.00011431368,0.19271533],"genre_scores_gemma":[0.9843287,0.0014734629,0.010262171,0.00086778594,0.0022808146,0.00014796563,0.00019817917,0.00033514522,0.00010577364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9920916,0.0005763043,0.0021259892,0.001091516,0.0022459268,0.0018686868],"domain_scores_gemma":[0.9925372,0.0014306309,0.0031759744,0.0015835816,0.00020056155,0.0010720325],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035889156,0.0007187771,0.000444773,0.00067125045,0.0012790661,0.0016715475,0.0019473605,0.0013786386,0.12546863],"category_scores_gemma":[0.0007921825,0.0012164849,0.0016574961,0.0011105546,0.0011676992,0.0030822768,0.0014537153,0.0014522419,0.00038990792],"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.00223379,0.00048168979,0.00011487275,0.0008387512,0.002246765,0.00075613405,0.005841002,0.0008689479,0.0063852076,0.87774354,0.09299895,0.009490365],"study_design_scores_gemma":[0.002990435,0.002685714,0.00059928227,0.0015744946,0.0014935791,0.002558395,0.0016931976,0.08677646,0.8959108,0.00039068094,0.001956357,0.0013706215],"about_ca_topic_score_codex":0.00082315505,"about_ca_topic_score_gemma":0.00031472818,"teacher_disagreement_score":0.8895256,"about_ca_system_score_codex":0.000015827169,"about_ca_system_score_gemma":0.0010696473,"threshold_uncertainty_score":0.9999178},"labels":[],"label_agreement":null},{"id":"W2015957628","doi":"10.1016/j.jda.2006.04.002","title":"Two-pattern strings II—frequency of occurrence and substring complexity","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Combinatorics; Mathematics; Generalization; Fibonacci number; Prefix; Aperiodic graph; Discrete mathematics; Computer science; Data structure","score_opus":0.02468135140777174,"score_gpt":0.28292771750166096,"score_spread":0.25824636609388923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015957628","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.5491479,0.0007500787,0.44929412,0.00014013312,0.00032148213,0.000045404213,0.000011582793,0.000018641078,0.00027068166],"genre_scores_gemma":[0.9468218,0.000046654368,0.052932054,0.00006123711,0.00012599087,2.2787508e-7,9.244806e-7,0.0000050855374,0.0000060064112],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984053,0.000041403277,0.0006517951,0.0001840084,0.000429182,0.00028834806],"domain_scores_gemma":[0.99862605,0.00014335256,0.00062893395,0.00026599213,0.00016539464,0.00017029187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013123562,0.0001457987,0.00031530205,0.00018700099,0.000105997555,0.00006579646,0.00077650027,0.000041490224,0.000011714363],"category_scores_gemma":[0.000044721794,0.000118078984,0.000109882465,0.00028067856,0.0001507181,0.0007385282,0.00027131147,0.0002642381,9.80323e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041230676,0.0002980232,0.055641823,0.00014303977,0.00021354748,0.00047874745,0.0046933587,0.000054043518,0.0199038,0.05193778,0.00026661885,0.866328],"study_design_scores_gemma":[0.010325815,0.003780444,0.5702381,0.0020622096,0.00023406355,0.004863677,0.0026124069,0.065705374,0.16115262,0.17559402,0.0010202337,0.0024110177],"about_ca_topic_score_codex":0.00009199255,"about_ca_topic_score_gemma":0.000009483053,"teacher_disagreement_score":0.863917,"about_ca_system_score_codex":0.000032099346,"about_ca_system_score_gemma":0.000049151742,"threshold_uncertainty_score":0.48151213},"labels":[],"label_agreement":null},{"id":"W2016908520","doi":"10.1016/j.jda.2005.07.003","title":"A loop-free two-close Gray-code algorithm for listing k-ary Dyck words","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Gray code; Combinatorics; Mathematics; Suffix; Algorithm; Gray (unit); String (physics); Computer science; Discrete mathematics","score_opus":0.017518718276061277,"score_gpt":0.2913363529879703,"score_spread":0.273817634711909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016908520","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.0013061019,0.0024003116,0.99136484,0.0024035412,0.0015084612,0.0003127824,0.00019526371,0.000111792266,0.00039689284],"genre_scores_gemma":[0.00381443,0.00022107933,0.9910243,0.00065966946,0.0036483663,0.000018685094,0.000024729026,0.000055900957,0.00053280743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960587,0.00012722975,0.0012782359,0.0005992906,0.0010621372,0.00087437953],"domain_scores_gemma":[0.9961445,0.00036150057,0.0010559597,0.0012328613,0.00054456526,0.0006606479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015293132,0.00044959772,0.0007029092,0.00037637915,0.00046722378,0.0005037686,0.0032703676,0.00015292183,0.000047821173],"category_scores_gemma":[0.0003447177,0.0003535338,0.0005087175,0.000557401,0.000114691815,0.0028225908,0.0009752303,0.0006295614,0.000021208043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032729025,0.00017452688,0.000027191947,0.000019641377,0.000103220525,0.00011242021,0.00037213572,0.0003180068,0.0002842608,0.0012348264,0.01590019,0.9814209],"study_design_scores_gemma":[0.0046193465,0.0007549371,0.00019934405,0.00035565786,0.00009636963,0.0008272882,0.00013558878,0.90955704,0.0018065714,0.011994303,0.06894996,0.00070356723],"about_ca_topic_score_codex":0.000032999877,"about_ca_topic_score_gemma":0.000015640584,"teacher_disagreement_score":0.9807173,"about_ca_system_score_codex":0.00018112925,"about_ca_system_score_gemma":0.0003332343,"threshold_uncertainty_score":0.99989164},"labels":[],"label_agreement":null},{"id":"W2019497371","doi":"10.1016/j.jda.2009.01.002","title":"On the Ehrenfeucht–Mycielski sequence","year":2009,"lang":"pl","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Upper and lower bounds; Combinatorics; Ackermann function; Prefix; Mathematics; Sequence (biology); Suffix; Discrete mathematics; Inverse","score_opus":0.03914521642632646,"score_gpt":0.3010556464635271,"score_spread":0.26191043003720066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019497371","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.015326553,0.010102008,0.8919877,0.0654693,0.008601577,0.0007533466,0.00018321407,0.000110102905,0.0074662147],"genre_scores_gemma":[0.91251516,0.0024405876,0.07026702,0.0089350175,0.0038650853,0.0000042565043,0.000013232586,0.000058472055,0.0019011493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520046,0.00040448338,0.0012543871,0.0005408797,0.0018338904,0.00076592545],"domain_scores_gemma":[0.9956122,0.0006555471,0.0014199613,0.0013387512,0.00050977734,0.00046373883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018204071,0.00052582624,0.00067788345,0.00025998856,0.000562083,0.0009067985,0.0036381185,0.00021395208,0.0002225335],"category_scores_gemma":[0.0003437356,0.00030156056,0.0005423505,0.00080736773,0.00020342233,0.0016053508,0.00035632422,0.001467477,0.00016233682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019239592,0.00065968814,0.000034539207,0.00002026372,0.0002302263,0.0013309631,0.0019631397,0.0010029365,0.0018800654,0.08427198,0.09437799,0.81403583],"study_design_scores_gemma":[0.0043407576,0.014012229,0.0071809334,0.0038019528,0.0003992274,0.0035587419,0.00048322862,0.5932087,0.006549164,0.2790938,0.0849793,0.0023919614],"about_ca_topic_score_codex":0.00001903207,"about_ca_topic_score_gemma":0.0000012193941,"teacher_disagreement_score":0.8971886,"about_ca_system_score_codex":0.00015935162,"about_ca_system_score_gemma":0.00043590297,"threshold_uncertainty_score":0.9999437},"labels":[],"label_agreement":null},{"id":"W2026304802","doi":"10.1016/j.jda.2014.11.008","title":"The shortest path problem in the Knödel graph","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Shortest path problem; Distance; Graph; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","score_opus":0.009150218732017937,"score_gpt":0.23360562131199245,"score_spread":0.2244554025799745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026304802","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.0044140723,0.00068174343,0.9810322,0.0068041123,0.0017671336,0.00018849122,8.9014793e-7,0.00001675555,0.005094605],"genre_scores_gemma":[0.9923608,0.000103192244,0.0062321867,0.00041143384,0.00074424763,0.00000600338,2.3392852e-7,0.0000071450763,0.00013477093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998286,0.0003496852,0.00055233453,0.0001230921,0.00044479585,0.00024406664],"domain_scores_gemma":[0.99876475,0.0003472911,0.00033853928,0.00035065334,0.00014290538,0.000055886663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031248922,0.000106698455,0.00017425213,0.00007480649,0.00021420686,0.00039794928,0.001327226,0.000042945514,0.0000019275506],"category_scores_gemma":[0.00004727939,0.000047072674,0.00016120874,0.0003454015,0.00004512094,0.00035373168,0.000064440326,0.00035810733,0.0000053621793],"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.0000681963,0.00034923689,0.0037193191,0.00003229287,0.00027532634,0.00024324871,0.017844794,0.015656924,0.00022638467,0.40923974,0.08341188,0.46893266],"study_design_scores_gemma":[0.001170457,0.0013292978,0.008129116,0.0002996296,0.000025701964,0.0015859749,0.0021591736,0.80317515,0.000050476214,0.05263222,0.1290495,0.00039329432],"about_ca_topic_score_codex":0.000028157798,"about_ca_topic_score_gemma":0.000037235393,"teacher_disagreement_score":0.9879467,"about_ca_system_score_codex":0.000022275228,"about_ca_system_score_gemma":0.00003564241,"threshold_uncertainty_score":0.3837434},"labels":[],"label_agreement":null},{"id":"W2035543139","doi":"10.1016/j.jda.2011.03.004","title":"Parameterized complexity of even/odd subgraph problems","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Parameterized complexity; Combinatorics; Induced subgraph isomorphism problem; Mathematics; Cograph; Vertex (graph theory); Pathwidth; Eulerian path; Discrete mathematics; Induced subgraph; Graph; Line graph; Voltage graph; Lagrangian","score_opus":0.10129136067345934,"score_gpt":0.3090173922446653,"score_spread":0.20772603157120595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035543139","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.1250439,0.0004938772,0.87147474,0.0002084724,0.00043124767,0.0002823021,0.00001663395,0.000043880045,0.002004964],"genre_scores_gemma":[0.61198217,0.0002045727,0.3876644,0.000023481405,0.000053194777,0.0000042749343,7.975634e-7,0.000015835116,0.000051279832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747616,0.00027961817,0.0008260327,0.00024010085,0.000767754,0.0004103132],"domain_scores_gemma":[0.9977054,0.00013799503,0.0008110821,0.0006033433,0.00049592764,0.00024624035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012625746,0.0001884005,0.00051486015,0.00038834332,0.00008116554,0.000044975688,0.0018224658,0.00006910866,0.000059089798],"category_scores_gemma":[0.00009554711,0.00014374412,0.00034634955,0.000763026,0.0005029849,0.000966377,0.000289092,0.00038939004,0.000007473637],"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.0017251496,0.0027645433,0.017639542,0.00058737455,0.0020701836,0.0009336574,0.021144155,0.0004063221,0.13862865,0.61551577,0.000906548,0.19767812],"study_design_scores_gemma":[0.0029288735,0.003034797,0.028022407,0.00025194723,0.000054567037,0.00042690325,0.0002681407,0.012644253,0.04899886,0.9023189,0.0004817739,0.00056858093],"about_ca_topic_score_codex":0.000045438203,"about_ca_topic_score_gemma":0.0000048112356,"teacher_disagreement_score":0.48693827,"about_ca_system_score_codex":0.000032738615,"about_ca_system_score_gemma":0.00010941274,"threshold_uncertainty_score":0.5861715},"labels":[],"label_agreement":null},{"id":"W2037387767","doi":"10.1016/j.jda.2006.05.002","title":"Cut problems in graphs with a budget constraint","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maximum cut; Approximation algorithm; Constraint (computer-aided design); Mathematics; Mathematical optimization; Constant (computer programming); Combinatorics; Computer science; Graph","score_opus":0.010646582172347409,"score_gpt":0.2290906437144165,"score_spread":0.2184440615420691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037387767","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.044645704,0.0012324812,0.9454012,0.002507847,0.00071159174,0.0003567157,0.000025234174,0.00008651655,0.005032735],"genre_scores_gemma":[0.738214,0.00008312271,0.26113918,0.00016877624,0.00025087906,0.000009045893,0.000003942929,0.000021781309,0.000109248474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977873,0.0000946786,0.0007421205,0.00028506696,0.0006562651,0.0004345689],"domain_scores_gemma":[0.99872047,0.00010028368,0.0004716283,0.00035462895,0.00021515696,0.00013783414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006507629,0.00023418358,0.00041622642,0.00051050493,0.000091988666,0.00021536525,0.0010004975,0.00007204251,0.000015409336],"category_scores_gemma":[0.00001643905,0.00017035031,0.00019006724,0.0010017017,0.00022898379,0.00082101143,0.000121970246,0.00048945064,0.000004342616],"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.00021522392,0.0029530437,0.057189703,0.00028858834,0.00059256225,0.0054925606,0.0044540707,0.023700625,0.0022563487,0.56297535,0.0075962436,0.33228567],"study_design_scores_gemma":[0.011299178,0.004463645,0.08445729,0.001509035,0.000105596955,0.008471521,0.0007219636,0.12574416,0.0029582086,0.7396493,0.018455045,0.002165079],"about_ca_topic_score_codex":0.0001402769,"about_ca_topic_score_gemma":0.00016925583,"teacher_disagreement_score":0.6935683,"about_ca_system_score_codex":0.000058329337,"about_ca_system_score_gemma":0.0001729122,"threshold_uncertainty_score":0.6946684},"labels":[],"label_agreement":null},{"id":"W2045758343","doi":"10.1016/j.jda.2005.03.003","title":"On the mean number of encryptions for tree-based broadcast encryption schemes","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Broadcast encryption; Computer science; Encryption; Stateless protocol; Scheme (mathematics); Cryptanalysis; Mathematics; Computer network; Tree (set theory); Theoretical computer science; Computer security; Discrete mathematics; Public-key cryptography; Combinatorics","score_opus":0.019086180210556407,"score_gpt":0.288083670207468,"score_spread":0.2689974899969116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045758343","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.049225964,0.00016645124,0.9465784,0.0030139147,0.00024365273,0.00017063157,0.000060434544,0.000018929253,0.00052164483],"genre_scores_gemma":[0.68947184,0.0000512746,0.309775,0.0003242794,0.00034344554,0.000008904692,0.0000075833937,0.000009216006,0.000008474375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857086,0.000082798404,0.00050321745,0.00016816233,0.00046507423,0.00020991325],"domain_scores_gemma":[0.9983077,0.00041791968,0.00048450904,0.00042253247,0.00026746216,0.00009987788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321351,0.00014197669,0.0002238183,0.00014589418,0.00015189241,0.00009276187,0.00082084234,0.00006029901,0.000056942175],"category_scores_gemma":[0.000102266466,0.000090810645,0.00037951095,0.00036656976,0.00009740494,0.0006357999,0.00005294495,0.0002217486,0.00000929164],"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.00016984147,0.00059880223,0.00039416755,0.00003646198,0.00017117636,0.0000061170713,0.0011090243,0.0004412286,0.0029910787,0.7627799,0.0057127145,0.22558953],"study_design_scores_gemma":[0.010610297,0.0038193378,0.008211544,0.00089084875,0.00039243812,0.00027343188,0.00094091205,0.43497452,0.087506354,0.2673552,0.18350534,0.0015197868],"about_ca_topic_score_codex":0.000005566016,"about_ca_topic_score_gemma":0.0000086860755,"teacher_disagreement_score":0.64024585,"about_ca_system_score_codex":0.00003170098,"about_ca_system_score_gemma":0.00009052817,"threshold_uncertainty_score":0.37031507},"labels":[],"label_agreement":null},{"id":"W2046692948","doi":"10.1016/j.jda.2004.04.004","title":"Computing input multiplicity in anonymous synchronous networks with dynamic faults","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hypercube; Multiplicity (mathematics); Computer science; Discrete mathematics; Function (biology); Network topology; Parity (physics); Topology (electrical circuits); Mathematics; Algorithm; Combinatorics; Parallel computing; Computer network","score_opus":0.005700822171285885,"score_gpt":0.23666292599654382,"score_spread":0.23096210382525792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046692948","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.16632938,0.00033837106,0.83190316,0.00025531033,0.0008319544,0.00013182306,8.756947e-7,0.00003305097,0.00017609017],"genre_scores_gemma":[0.9480383,0.000031113363,0.05141767,0.00013149936,0.0003430323,0.000001533918,9.560044e-7,0.000016162212,0.000019763533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980289,0.00010514503,0.00076672283,0.00027674896,0.00039639458,0.0004261366],"domain_scores_gemma":[0.9986552,0.00009170018,0.0005952312,0.00029412052,0.00021231831,0.00015144401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068469136,0.00021609677,0.00044357008,0.00022831767,0.00012316646,0.00015273302,0.0007150157,0.00010948749,0.000002967213],"category_scores_gemma":[0.000019933786,0.00015763566,0.0001369643,0.00053648883,0.000049559716,0.00061426364,0.00012214846,0.0005696614,0.000005056767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044553126,0.00011263213,0.0011789153,0.000013768951,0.00006568429,0.0005451658,0.0012150846,0.9708643,0.00005679506,0.0005301933,0.000029443874,0.02534345],"study_design_scores_gemma":[0.0021470867,0.0007171369,0.006706857,0.000470817,0.000009346085,0.0016633952,0.0001860897,0.9874739,0.000054753422,0.00023921627,0.00008031199,0.00025106748],"about_ca_topic_score_codex":0.00018583302,"about_ca_topic_score_gemma":0.00026803432,"teacher_disagreement_score":0.7817089,"about_ca_system_score_codex":0.00032262996,"about_ca_system_score_gemma":0.00013533795,"threshold_uncertainty_score":0.6428196},"labels":[],"label_agreement":null},{"id":"W2048425099","doi":"10.1016/j.jda.2011.03.009","title":"The three squares lemma revisited","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Substring; Lemma (botany); String (physics); Combinatorics; Correctness; Mathematics; Preprocessor; Computation; Computer science; Discrete mathematics; Algorithm; Artificial intelligence; Data structure","score_opus":0.03224341166779137,"score_gpt":0.2565605238204628,"score_spread":0.22431711215267142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048425099","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.0017679982,0.0041406644,0.98994887,0.00071724417,0.0011036302,0.000112610855,0.000008846927,0.000043829652,0.0021563077],"genre_scores_gemma":[0.21809874,0.0025480029,0.77619493,0.0005788903,0.002037788,0.000010490294,0.000006339054,0.000059503196,0.00046529644],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998231,0.00009419708,0.00058558676,0.00019453483,0.0005830481,0.00031165604],"domain_scores_gemma":[0.9981412,0.00014208235,0.0005486322,0.00070191856,0.00029049034,0.00017562491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008652004,0.00016317614,0.00024207639,0.00009714058,0.00033585023,0.00026024022,0.0021271657,0.000058381807,0.000029234192],"category_scores_gemma":[0.0000856403,0.00008698254,0.00019411312,0.00030948696,0.000086350155,0.0011491895,0.00042212685,0.00032552093,0.000026151885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009737072,0.00013925612,0.001181812,0.000017286238,0.00020172512,0.000375906,0.0012692327,0.000014806956,0.00032862497,0.03774372,0.030125402,0.9285049],"study_design_scores_gemma":[0.004526878,0.0041056653,0.09617017,0.00092542666,0.00021918338,0.0027376977,0.0007476814,0.23628983,0.007631612,0.21295053,0.43187997,0.0018153572],"about_ca_topic_score_codex":0.000034506018,"about_ca_topic_score_gemma":0.0000057132975,"teacher_disagreement_score":0.9266895,"about_ca_system_score_codex":0.000027428725,"about_ca_system_score_gemma":0.00007948762,"threshold_uncertainty_score":0.39528385},"labels":[],"label_agreement":null},{"id":"W2049045223","doi":"10.1016/j.jda.2005.06.005","title":"Strictly chordal graphs are leaf powers","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Interval graph; Block graph; Closeness; Tree (set theory); Graph; Adjacency list; Discrete mathematics; Computer science; 1-planar graph","score_opus":0.00895923626441606,"score_gpt":0.2502875828235165,"score_spread":0.24132834655910043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049045223","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.96318984,0.011544402,0.015489048,0.0031002946,0.0013308785,0.00038977765,0.00009934067,0.000027659253,0.0048287357],"genre_scores_gemma":[0.96520364,0.0018503966,0.028630823,0.00051649276,0.0023510305,0.0000055718506,0.00004077568,0.0000684592,0.0013328108],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983104,0.00006645351,0.0005362526,0.00025201574,0.00045335895,0.00038154158],"domain_scores_gemma":[0.9986573,0.0000110930205,0.00052395015,0.00031362887,0.00025861754,0.00023545192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038302407,0.00024032086,0.0003022703,0.00018207077,0.00008076623,0.000056478068,0.00043947966,0.00015325054,0.00008779672],"category_scores_gemma":[0.00006928981,0.00020400384,0.0003551213,0.00020194746,0.000081499784,0.00002293551,0.00009715795,0.00025826853,0.000026001053],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008872907,0.001176943,0.027193485,0.00011747312,0.0029647218,0.00038575532,0.0008566653,0.0032580292,0.60137635,0.00025081105,0.11259141,0.24894106],"study_design_scores_gemma":[0.00762733,0.0037491617,0.030234413,0.00014564832,0.00039204457,0.0010509512,0.0018444307,0.0008734778,0.13705567,0.0005699955,0.81491655,0.0015403498],"about_ca_topic_score_codex":0.000005355664,"about_ca_topic_score_gemma":0.0000100465295,"teacher_disagreement_score":0.7023251,"about_ca_system_score_codex":0.00004392808,"about_ca_system_score_gemma":0.000087691806,"threshold_uncertainty_score":0.8319035},"labels":[],"label_agreement":null},{"id":"W2050304496","doi":"10.1016/s1570-8667(03)00037-6","title":"Two-pattern strings I—A recognition algorithm","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Generalization; Class (philosophy); Computer science; String searching algorithm; Algorithm; Pattern matching; Mathematics; Combinatorics; Pattern recognition (psychology); Discrete mathematics; Artificial intelligence; Data structure","score_opus":0.015317200453146392,"score_gpt":0.2522856864990134,"score_spread":0.236968486045867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050304496","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.009614921,0.0005800009,0.9861228,0.00029259096,0.0011759459,0.00007482169,0.000010474016,0.00007548642,0.002052974],"genre_scores_gemma":[0.335132,0.00021287489,0.66291827,0.00081360014,0.0007140455,0.0000047773306,0.000005158068,0.000037817215,0.00016142064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982071,0.00016564674,0.0005635534,0.00022826738,0.0005064476,0.0003289734],"domain_scores_gemma":[0.9986531,0.00011462629,0.00049494545,0.00031891195,0.0002216199,0.00019679354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890546,0.00018535575,0.00029164995,0.00020654072,0.00009948444,0.0002203222,0.0007133694,0.00006178779,0.00006363472],"category_scores_gemma":[0.00007680534,0.00014980714,0.00021455334,0.00034114602,0.000042451895,0.0011582217,0.00007718161,0.0003185424,0.00004888415],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002951822,0.00007098546,0.00008233024,0.0000073527804,0.00006333524,0.00018297763,0.0002849147,0.000019594481,0.00050664775,0.0017233344,0.00086722884,0.99618834],"study_design_scores_gemma":[0.01768884,0.004174317,0.004897258,0.0013820141,0.00041122496,0.015978958,0.002920694,0.4178474,0.14696994,0.32983866,0.05391895,0.0039717336],"about_ca_topic_score_codex":0.000014531877,"about_ca_topic_score_gemma":8.0542384e-7,"teacher_disagreement_score":0.9922166,"about_ca_system_score_codex":0.00005721191,"about_ca_system_score_gemma":0.00008929708,"threshold_uncertainty_score":0.61089575},"labels":[],"label_agreement":null},{"id":"W2055575272","doi":"10.1016/j.jda.2008.09.011","title":"Counting distance permutations","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Aeronautics and Space Administration","keywords":"Permutation (music); Metric space; Vector space; Mathematics; String (physics); Point (geometry); Combinatorics; Tree (set theory); Metric (unit); Space (punctuation); Computer science; Discrete mathematics; Pure mathematics","score_opus":0.020306791770880833,"score_gpt":0.2551660287123915,"score_spread":0.2348592369415107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055575272","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.004367899,0.00046786177,0.99123913,0.0010341222,0.0007147948,0.0000590536,0.000010236919,0.000040634142,0.002066289],"genre_scores_gemma":[0.48346236,0.00063751097,0.51222634,0.00049036474,0.00093117205,0.000004182458,0.0000116248775,0.000024952134,0.0022114825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849963,0.000037678266,0.00046146562,0.00017690693,0.0005754626,0.0002488594],"domain_scores_gemma":[0.998889,0.0000611068,0.00040306954,0.0003204409,0.00021134623,0.000114996146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710798,0.00012836861,0.000211805,0.00016283293,0.00024332028,0.00017041579,0.0010858363,0.000028200464,0.000018819173],"category_scores_gemma":[0.00006039703,0.00010417365,0.00013812735,0.00043682277,0.00007417505,0.0022979444,0.00017106778,0.00019698875,0.000030999472],"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.000076927274,0.001139557,0.0135248415,0.0001891116,0.0011810113,0.0086828405,0.011974754,0.004423986,0.0016843915,0.1860416,0.17346527,0.5976157],"study_design_scores_gemma":[0.0037664084,0.00086993666,0.031094356,0.00027871155,0.00013621207,0.0033982699,0.00085394667,0.63016504,0.0009063722,0.012992331,0.31412128,0.0014171288],"about_ca_topic_score_codex":0.000006852622,"about_ca_topic_score_gemma":0.0000012541121,"teacher_disagreement_score":0.62574106,"about_ca_system_score_codex":0.00004007661,"about_ca_system_score_gemma":0.00007770747,"threshold_uncertainty_score":0.4248078},"labels":[],"label_agreement":null},{"id":"W2057158872","doi":"10.1016/j.jda.2012.04.015","title":"Cool-lex order and k-ary Catalan structures","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Victoria; University of Manitoba","funders":"","keywords":"Catalan number; Combinatorics; Lexicographical order; Mathematics; Complement (music); Order (exchange); Precomputation; Binary tree; Sequence (biology); Discrete mathematics; Algorithm; Computer science","score_opus":0.009989566069584637,"score_gpt":0.24947602503031416,"score_spread":0.2394864589607295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057158872","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.49957383,0.01678923,0.47595897,0.002033303,0.0035414412,0.00018419814,0.000026407684,0.00011588056,0.0017767316],"genre_scores_gemma":[0.9158961,0.00014212013,0.08264777,0.00046393348,0.0007258674,7.5395644e-7,0.000002003048,0.000012994389,0.00010844164],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989598,0.000059378617,0.0002902506,0.00011310502,0.00029539835,0.00028209214],"domain_scores_gemma":[0.9990754,0.00007698145,0.00023952396,0.00023531944,0.00008621712,0.00028654933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004608349,0.00012982047,0.00021103825,0.00010250843,0.00008272307,0.00012831074,0.0004986039,0.000053058207,0.000037095462],"category_scores_gemma":[0.00005529296,0.00008920331,0.00006559188,0.00018006214,0.000061829036,0.0011762806,0.0001802679,0.00020230093,0.0000050423964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013071753,0.00033270792,0.015008277,0.00013265832,0.0006469358,0.00036160267,0.014026135,0.00010945477,0.0073982035,0.15044148,0.026246617,0.7851652],"study_design_scores_gemma":[0.010045601,0.00228288,0.5909029,0.0004978566,0.0003969978,0.019171752,0.0034823744,0.07578347,0.024965638,0.14756182,0.121639654,0.0032690463],"about_ca_topic_score_codex":0.0000126729765,"about_ca_topic_score_gemma":5.6699594e-7,"teacher_disagreement_score":0.7818962,"about_ca_system_score_codex":0.00001783541,"about_ca_system_score_gemma":0.00004749183,"threshold_uncertainty_score":0.36376056},"labels":[],"label_agreement":null},{"id":"W2060148847","doi":"10.1016/s1570-8667(03)00002-9","title":"Algorithms for shortest paths and d-cycle problems","year":2003,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Shortest path problem; Cyclomatic complexity; Mathematics; Yen's algorithm; Path (computing); Widest path problem; Combinatorics; Graph; Shortest Path Faster Algorithm; Algorithm; K shortest path routing; Dijkstra's algorithm; Computer science; Discrete mathematics; Software","score_opus":0.026545878178149074,"score_gpt":0.3063723455624698,"score_spread":0.2798264673843207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060148847","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.0037531438,0.0020225265,0.99230915,0.00051799114,0.00042791018,0.000351278,0.0000135462005,0.00003071753,0.0005737133],"genre_scores_gemma":[0.2107419,0.0005344164,0.78776723,0.00016429204,0.0002868974,0.000037157653,0.0000019943318,0.000049719216,0.000416402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979171,0.0001430601,0.00055434863,0.0003282449,0.0005465724,0.0005106379],"domain_scores_gemma":[0.9982208,0.0003384313,0.00032590464,0.00038509385,0.00039923386,0.0003305195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015631198,0.00020714736,0.00036349104,0.0002489941,0.00019611107,0.00020965553,0.00075976964,0.00007897602,0.000009389298],"category_scores_gemma":[0.00030348697,0.00016262587,0.00018197649,0.0004293251,0.00014029857,0.0011009756,0.000121162004,0.00033265734,0.000003355064],"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.00012011921,0.00060273486,0.0022075782,0.00020045614,0.0005169209,0.00035958525,0.0028935429,0.0022711004,0.008954155,0.24393941,0.0018605079,0.7360739],"study_design_scores_gemma":[0.005196482,0.0038764891,0.0013777538,0.00026048775,0.00008025668,0.0023164507,0.000583625,0.1850818,0.008690463,0.74367476,0.047775194,0.0010862374],"about_ca_topic_score_codex":0.0000024458327,"about_ca_topic_score_gemma":0.0000015849977,"teacher_disagreement_score":0.7349877,"about_ca_system_score_codex":0.000047542104,"about_ca_system_score_gemma":0.00013268343,"threshold_uncertainty_score":0.6631691},"labels":[],"label_agreement":null},{"id":"W2061572891","doi":"10.1016/j.jda.2006.07.001","title":"Broadcasting in geometric radio networks","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Node (physics); Computer science; Transmitter; RADIUS; Computer network; Range (aeronautics); Topology (electrical circuits); Telecommunications; Mathematics; Physics; Combinatorics; Engineering","score_opus":0.008412946655087569,"score_gpt":0.22873498992787675,"score_spread":0.22032204327278918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061572891","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.010129479,0.00437534,0.98248,0.0002574778,0.001012435,0.00010185077,6.548786e-7,0.00003152141,0.0016112783],"genre_scores_gemma":[0.87811613,0.00017152759,0.119662784,0.000095159885,0.0017349414,0.0000035379853,0.0000014132768,0.000022212238,0.00019227953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976907,0.00011620982,0.00089687796,0.00024597184,0.00054041576,0.000509824],"domain_scores_gemma":[0.9985089,0.0002540277,0.0006108132,0.00034796572,0.00014329412,0.00013500627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849832,0.00018685308,0.00039175947,0.00059265754,0.00006783191,0.00021154305,0.0011067356,0.00010728115,0.000017040942],"category_scores_gemma":[0.00006335106,0.00015911144,0.00018013577,0.0021867503,0.000039196573,0.0008985016,0.00018750627,0.0006035831,0.0000063622406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024063864,0.00019786236,0.0131213525,0.000015259944,0.000056145476,0.0012950867,0.00014249988,0.5395294,0.00008158384,0.0032448056,0.011203961,0.43108803],"study_design_scores_gemma":[0.0012204433,0.00025454597,0.037489638,0.00012926463,0.0000147563005,0.0007039457,0.000018926443,0.9540963,0.000102763835,0.0019246946,0.0037422555,0.00030246886],"about_ca_topic_score_codex":0.00008214338,"about_ca_topic_score_gemma":0.000014969821,"teacher_disagreement_score":0.8679867,"about_ca_system_score_codex":0.00014231857,"about_ca_system_score_gemma":0.0000762003,"threshold_uncertainty_score":0.6488376},"labels":[],"label_agreement":null},{"id":"W2063861912","doi":"10.1016/j.jda.2012.06.001","title":"Acyclic colorings of graph subdivisions revisited","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Subdivision; Directed acyclic graph; Graph coloring; Complete coloring; Edge coloring; List coloring; Greedy coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.026209169668095143,"score_gpt":0.32118895212746473,"score_spread":0.29497978245936957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063861912","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.14096622,0.0044806786,0.8505506,0.0008806826,0.000617844,0.00024126176,0.000015799505,0.000046871442,0.0022000705],"genre_scores_gemma":[0.90004635,0.0003652693,0.099240355,0.000058656813,0.0001588368,0.0000024253848,8.82109e-7,0.00001544213,0.00011176497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977504,0.00018619861,0.00064483285,0.00015051427,0.00078527123,0.00048279442],"domain_scores_gemma":[0.9978638,0.0003141065,0.0005965376,0.00049341307,0.00036806797,0.00036405068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015476758,0.00014924999,0.00038791896,0.00049145747,0.000099371406,0.000049249804,0.0013067854,0.000061593244,0.000028680348],"category_scores_gemma":[0.00026760742,0.00011344636,0.00028530927,0.0011465466,0.00014388005,0.0017363684,0.0003173272,0.00040277393,0.000012676372],"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.0003703973,0.0014365842,0.05239205,0.00026023143,0.0010062446,0.00023306509,0.005287776,0.00037594163,0.06877171,0.6750771,0.0046136505,0.19017525],"study_design_scores_gemma":[0.010103395,0.007070993,0.27622652,0.0019542123,0.000421134,0.0030087165,0.0018817205,0.013633796,0.17125426,0.43884557,0.07265858,0.0029411113],"about_ca_topic_score_codex":0.000003547122,"about_ca_topic_score_gemma":1.8316426e-7,"teacher_disagreement_score":0.7590802,"about_ca_system_score_codex":0.00003904931,"about_ca_system_score_gemma":0.000056235,"threshold_uncertainty_score":0.46262085},"labels":[],"label_agreement":null},{"id":"W2066342920","doi":"10.1016/j.jda.2014.06.003","title":"The lexicographically smallest universal cycle for binary strings with minimum specified weight","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Aperiodic graph; Mathematics; Binary number; Combinatorics; Discrete mathematics; Prefix; Simple (philosophy); Amortized analysis; Set (abstract data type); Order (exchange); Arithmetic; Computer science; Data structure","score_opus":0.008251096188583884,"score_gpt":0.22370187750932216,"score_spread":0.21545078132073828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066342920","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.011983525,0.0004121298,0.9823497,0.0035103236,0.00070979155,0.00019316433,0.0000138699215,0.00003521894,0.0007922966],"genre_scores_gemma":[0.44823813,0.00074035244,0.5482251,0.00032707248,0.0019152289,0.000011656731,0.000012587396,0.00005558278,0.00047430032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822277,0.00008724495,0.00045558132,0.00027749577,0.0005724353,0.00038449303],"domain_scores_gemma":[0.9979424,0.00044371534,0.00051949435,0.00053535076,0.00032621974,0.00023284521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074783276,0.0002064152,0.0002871028,0.00014637902,0.0004461165,0.00030870337,0.0016404951,0.00007591378,0.00000549805],"category_scores_gemma":[0.000047359616,0.00011248238,0.00019986731,0.0003466961,0.00015492589,0.000691239,0.00026522466,0.00030665126,0.000002793416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031863896,0.0008214459,0.001789783,0.00012973782,0.0011657141,0.00051819015,0.0017316834,0.0029471226,0.0034060997,0.1969397,0.041715134,0.745649],"study_design_scores_gemma":[0.007407724,0.0070001534,0.009629517,0.00038426215,0.00014370824,0.0005316672,0.00045318808,0.5637683,0.0015141327,0.022321906,0.38589194,0.00095348863],"about_ca_topic_score_codex":0.000010045048,"about_ca_topic_score_gemma":0.000005532242,"teacher_disagreement_score":0.7446955,"about_ca_system_score_codex":0.00003257986,"about_ca_system_score_gemma":0.00011306628,"threshold_uncertainty_score":0.45868984},"labels":[],"label_agreement":null},{"id":"W2067300659","doi":"10.1016/j.jda.2014.12.006","title":"Inferring an indeterminate string from a prefix graph","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; Prefix; Lexicographical order; String (physics); Graph; Alphabet; Indeterminate; Simple graph","score_opus":0.013818488217496715,"score_gpt":0.2617633147738582,"score_spread":0.24794482655636152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067300659","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.13880867,0.00021959735,0.8597702,0.00012287198,0.0007703547,0.00005383942,0.000011175516,0.000049580503,0.00019370556],"genre_scores_gemma":[0.70772314,0.00005650348,0.29126415,0.0001284776,0.0007766048,0.0000019871072,0.0000073258066,0.0000192568,0.000022534465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799824,0.0001607431,0.0005984233,0.0003154027,0.00060499355,0.00032218624],"domain_scores_gemma":[0.9982219,0.00012272882,0.0005564206,0.0006583022,0.00012590758,0.00031479142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006636123,0.0002083774,0.00035553038,0.00024154155,0.00015435273,0.00038629284,0.0015597334,0.00009207362,0.000010804837],"category_scores_gemma":[0.00006829447,0.00015888605,0.00015472606,0.00025656063,0.000040100727,0.0028269808,0.0004304974,0.00041101885,0.000007732462],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031398227,0.00014205535,0.002089847,0.000012804672,0.0000933896,0.00012522879,0.0010988653,0.0006465303,0.0033873096,0.0021992999,0.0003101431,0.98986316],"study_design_scores_gemma":[0.003025714,0.0018076339,0.044549864,0.00057784293,0.000082701146,0.00031888112,0.00018673993,0.86521596,0.010484867,0.059616666,0.0131631475,0.0009699589],"about_ca_topic_score_codex":0.00009845124,"about_ca_topic_score_gemma":0.0000060579846,"teacher_disagreement_score":0.98889315,"about_ca_system_score_codex":0.00003470401,"about_ca_system_score_gemma":0.00005948652,"threshold_uncertainty_score":0.64791846},"labels":[],"label_agreement":null},{"id":"W2068640667","doi":"10.1016/j.jda.2013.06.001","title":"Gene tree correction for reconciliation and species tree inference: Complexity and algorithms","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Tree (set theory); Inference; Tree rearrangement; Mathematics; Combinatorics; Phylogenetic tree; Set (abstract data type); Algorithm; Biology; Computer science; Gene; Artificial intelligence; Genetics","score_opus":0.03059460569472111,"score_gpt":0.2696137614868005,"score_spread":0.23901915579207939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068640667","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.97867227,0.0028603387,0.016727287,0.000506547,0.00062807987,0.0002627622,0.000037671456,0.000001930068,0.00030313994],"genre_scores_gemma":[0.9716006,0.0032326179,0.023697956,0.00009130449,0.0007698243,0.000016924989,0.000025604884,0.000015507367,0.00054965686],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992248,0.000032507975,0.00031351237,0.00017359784,0.000101354635,0.0001542379],"domain_scores_gemma":[0.9992314,0.00004485478,0.00024955417,0.00009939055,0.00028394087,0.00009084283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020824994,0.0001375188,0.0002294623,0.00004775936,0.000111809175,0.00005943118,0.000078092795,0.00008396931,0.000008010515],"category_scores_gemma":[0.00011249897,0.000111989015,0.00007919309,0.000037454785,0.000121886544,0.000006702062,0.0000602661,0.000072455994,5.946046e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016157221,0.000073007766,0.021033967,0.00004581128,0.00044106873,0.000001833984,0.0005057041,0.000053475298,0.5945076,0.000067841036,0.0064881067,0.37662005],"study_design_scores_gemma":[0.0038417627,0.0039769816,0.82028216,0.00005278475,0.0002070148,0.0002490485,0.001492157,0.01242576,0.13180512,0.0056525622,0.01935781,0.0006568454],"about_ca_topic_score_codex":0.00003153122,"about_ca_topic_score_gemma":0.00005203615,"teacher_disagreement_score":0.79924816,"about_ca_system_score_codex":0.000014257174,"about_ca_system_score_gemma":0.00003585596,"threshold_uncertainty_score":0.45667794},"labels":[],"label_agreement":null},{"id":"W2071645752","doi":"10.1016/j.jda.2008.11.002","title":"Threshold dominating cliques in random graphs and interval routing","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Interval graph; Discrete mathematics; Interval (graph theory); Indifference graph; Chordal graph; Block graph; Split graph; Routing (electronic design automation); Clique; Pathwidth; Graph; Computer science; Line graph; 1-planar graph","score_opus":0.024496507497742983,"score_gpt":0.30680819512786284,"score_spread":0.2823116876301199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071645752","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.6644626,0.0015806768,0.33223614,0.00053797424,0.00023160975,0.00014189736,0.0000013632753,0.000030522522,0.0007771808],"genre_scores_gemma":[0.9238176,0.00048599616,0.07551057,0.00006326077,0.00006386139,0.0000023649,2.0184305e-7,0.000010981008,0.00004518832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818254,0.00019685282,0.00060581986,0.000213581,0.00046056614,0.00034063193],"domain_scores_gemma":[0.9987829,0.0003818978,0.00032220304,0.00021130404,0.0001579651,0.00014375449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018676976,0.00014318488,0.00036835382,0.00041914987,0.00013192258,0.00008841533,0.0006886078,0.00005674338,0.0000032762273],"category_scores_gemma":[0.00027179753,0.000111463174,0.00013991115,0.00048273912,0.00018348613,0.0012337908,0.00028278818,0.0005992324,0.0000010132042],"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.0020119906,0.0006621979,0.17213804,0.00018465624,0.00052738737,0.009705629,0.039170604,0.0017355635,0.013580447,0.2075014,0.00065776793,0.5521243],"study_design_scores_gemma":[0.025693294,0.0031163201,0.06614406,0.0016646873,0.00004386237,0.010134497,0.0022594214,0.3530417,0.018333117,0.51755464,0.00045478367,0.0015595874],"about_ca_topic_score_codex":0.0000094822835,"about_ca_topic_score_gemma":0.0000044688354,"teacher_disagreement_score":0.55056477,"about_ca_system_score_codex":0.00004501415,"about_ca_system_score_gemma":0.000069977235,"threshold_uncertainty_score":0.45453364},"labels":[],"label_agreement":null},{"id":"W2071925009","doi":"10.1016/j.jda.2007.04.002","title":"Computing the throughput of Concatenation State Machines","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Concatenation (mathematics); Infimum and supremum; Combinatorics; Alphabet; Graph; Mathematics; Path (computing); Throughput; Enhanced Data Rates for GSM Evolution; Algorithm; Discrete mathematics; Minimum weight; Function (biology); Computer science; Artificial intelligence","score_opus":0.009754639617023692,"score_gpt":0.28754800989303453,"score_spread":0.2777933702760108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071925009","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.057473388,0.0005878508,0.93850565,0.0016891696,0.00092587434,0.00007490672,0.0000022653985,0.00002869105,0.0007122171],"genre_scores_gemma":[0.87795055,0.000051015122,0.12116872,0.00019634605,0.00047841063,2.0954892e-7,0.0000011722533,0.000012750371,0.00014080343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798506,0.00013813691,0.00079601316,0.00015569753,0.00064069335,0.00028436922],"domain_scores_gemma":[0.9979866,0.0003726587,0.000884219,0.00028411177,0.00037691082,0.00009545673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027692614,0.00015131618,0.00029527495,0.00015803151,0.00016032819,0.00010272183,0.0010164503,0.00004122538,0.000005392057],"category_scores_gemma":[0.00014218995,0.00008823349,0.0001841793,0.00044899888,0.00009831317,0.00043078678,0.00017384072,0.0004446364,0.0000039369634],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035557918,0.000105840176,0.004508806,0.00003762668,0.00018584538,0.000112667396,0.00467793,0.00995958,0.001468498,0.0051602507,0.0006574731,0.97308993],"study_design_scores_gemma":[0.0017508036,0.0008641216,0.06571546,0.00018780648,0.000054601885,0.0007629981,0.0004290193,0.9093999,0.007429516,0.0081228865,0.0048765033,0.00040638258],"about_ca_topic_score_codex":0.00007980058,"about_ca_topic_score_gemma":0.000010158294,"teacher_disagreement_score":0.97268355,"about_ca_system_score_codex":0.00003214787,"about_ca_system_score_gemma":0.00007693543,"threshold_uncertainty_score":0.35980573},"labels":[],"label_agreement":null},{"id":"W2079307253","doi":"10.1016/s1570-8667(03)00080-7","title":"The longest common subsequence problem for arc-annotated sequences","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta","funders":"","keywords":"Longest common subsequence problem; Sequence (biology); Subsequence; Arc (geometry); Longest increasing subsequence; Computer science; Matching (statistics); Combinatorics; Algorithm; Similarity (geometry); Artificial intelligence; Mathematics; Biology; Genetics; Statistics","score_opus":0.018082766195424867,"score_gpt":0.2840613365543329,"score_spread":0.26597857035890804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079307253","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.00751294,0.0021934886,0.98040044,0.008155109,0.0010287421,0.00039181337,0.000037566286,0.00005730396,0.00022256692],"genre_scores_gemma":[0.28902102,0.0010215638,0.70848435,0.00039248154,0.00081609254,0.000038205042,0.000015989166,0.00003561731,0.00017469873],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978348,0.00008332203,0.0007248719,0.00027193717,0.0006337118,0.0004513774],"domain_scores_gemma":[0.9978342,0.00029196122,0.00072330347,0.0005232181,0.000426203,0.00020108384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010670079,0.0002138786,0.00031803094,0.00009543237,0.00054866774,0.0005264895,0.0021609562,0.000073080606,0.0000021514504],"category_scores_gemma":[0.00007744222,0.00012224576,0.00020359411,0.00038074132,0.0001869253,0.001435632,0.00023034059,0.0003410928,0.0000067120377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033781125,0.0005157024,0.00066650915,0.00013404625,0.00051247637,0.0008145456,0.0031475658,0.015789714,0.009202225,0.13570698,0.00788026,0.82529217],"study_design_scores_gemma":[0.008935285,0.0065917326,0.0060635693,0.0015531123,0.0001983326,0.0041781645,0.00097232295,0.1396494,0.03522214,0.6885039,0.10613709,0.0019948937],"about_ca_topic_score_codex":0.000087646324,"about_ca_topic_score_gemma":0.000027571255,"teacher_disagreement_score":0.82329726,"about_ca_system_score_codex":0.000109473665,"about_ca_system_score_gemma":0.00031211227,"threshold_uncertainty_score":0.5076951},"labels":[],"label_agreement":null},{"id":"W2080400420","doi":"10.1016/j.jda.2014.12.001","title":"Constructing non-cyclic pandiagonal Latin squares of prime orders","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prime (order theory); Latin square; Integer (computer science); Cyclic group; Order (exchange); Combinatorics; Mathematics; Algorithm; Computer science; Chemistry; Organic chemistry","score_opus":0.005259730341367534,"score_gpt":0.20498974070893228,"score_spread":0.19973001036756474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080400420","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.93536675,0.00038989156,0.057538252,0.0000431569,0.0011544479,0.00009784532,0.000017624587,0.00003690638,0.0053551137],"genre_scores_gemma":[0.9949408,0.000018829152,0.0046522985,0.00000807514,0.0003267934,0.0000013168984,0.0000022478746,0.000025051308,0.000024582518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872506,0.00007170743,0.0006412638,0.00007979533,0.00027280697,0.00020938955],"domain_scores_gemma":[0.99918115,0.00016119951,0.00031767,0.00014141283,0.00009221647,0.00010635776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055994635,0.00015017942,0.00040064115,0.00021072631,0.00004073115,0.000024873802,0.00019882954,0.00007820765,0.000045919576],"category_scores_gemma":[0.00006976724,0.00012335705,0.00019318397,0.00021320314,0.00008383906,0.00017329132,0.000017132066,0.00024883568,0.0000052655937],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045822948,0.0002923518,0.13655058,0.0021361306,0.0037616189,0.00015950488,0.00906446,0.042881206,0.15702207,0.03181567,0.0035713399,0.61228687],"study_design_scores_gemma":[0.018506216,0.004509922,0.06740184,0.0053707683,0.0011592767,0.0027921908,0.020546218,0.4349884,0.37232298,0.048496474,0.019833658,0.0040720375],"about_ca_topic_score_codex":0.000009434369,"about_ca_topic_score_gemma":0.0000032769765,"teacher_disagreement_score":0.6082148,"about_ca_system_score_codex":0.000025539191,"about_ca_system_score_gemma":0.00002005797,"threshold_uncertainty_score":0.5030354},"labels":[],"label_agreement":null},{"id":"W2084966456","doi":"10.1016/j.jda.2012.10.005","title":"On a conjecture of Erdős for multiplicities of cliques","year":2012,"lang":"fr","type":"article","venue":"Journal of Discrete Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Conjecture; Complement (music); Order (exchange); Graph; Counterexample; Limit (mathematics); Discrete mathematics","score_opus":0.032779831028874655,"score_gpt":0.3383146528657846,"score_spread":0.30553482183690994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084966456","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.88639563,0.04628395,0.051971324,0.0013172716,0.00842006,0.0009528885,0.0014257905,0.00001752703,0.0032155665],"genre_scores_gemma":[0.9189276,0.00074067886,0.07770365,0.00010749632,0.001530081,0.000004005531,0.0000033166423,0.000056909183,0.0009262663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997506,0.00019468818,0.0012938055,0.00010986486,0.00047459846,0.00042103365],"domain_scores_gemma":[0.9953035,0.0018230715,0.0019044678,0.0003082437,0.00048102497,0.00017968452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012264879,0.00029371234,0.000985723,0.0002225634,0.00009320268,0.0000151900795,0.00035144782,0.00030241272,0.00015015875],"category_scores_gemma":[0.00078604365,0.00020819683,0.0008024313,0.00012060909,0.00042396816,0.00028190538,0.000078115634,0.0004257389,6.6676427e-7],"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.00090913527,0.0005990372,0.00084036146,0.0024287635,0.0014518234,0.000008071279,0.018129202,0.000090132526,0.001192997,0.9445655,0.006763344,0.023021631],"study_design_scores_gemma":[0.003759199,0.004630536,0.0012293729,0.0027284103,0.0013034835,0.00029048033,0.004332203,0.000961659,0.05690874,0.911788,0.011545019,0.00052291533],"about_ca_topic_score_codex":0.000014887985,"about_ca_topic_score_gemma":0.0000019910185,"teacher_disagreement_score":0.055715743,"about_ca_system_score_codex":0.00005260999,"about_ca_system_score_gemma":0.00007656108,"threshold_uncertainty_score":0.84900206},"labels":[],"label_agreement":null},{"id":"W2086340885","doi":"10.1016/j.jda.2011.08.005","title":"On the structure of run-maximal strings","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Property (philosophy); Combinatorics; Cover (algebra); Mathematics; Compression (physics); String searching algorithm; Computer science; Algorithm; Data structure; Discrete mathematics; Physics; Engineering","score_opus":0.02079478762518111,"score_gpt":0.23601376440565444,"score_spread":0.21521897678047333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086340885","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.21113163,0.00048175076,0.7839696,0.0007859645,0.0015235706,0.00019334917,0.00007360035,0.00003242753,0.0018081077],"genre_scores_gemma":[0.9007943,0.0000366973,0.09878752,0.00015188658,0.00018419509,3.2150902e-7,0.0000010809935,0.000010057394,0.000033906286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849415,0.000074381656,0.00047288853,0.00016276522,0.00058934826,0.00020648919],"domain_scores_gemma":[0.99842584,0.00013171528,0.0006161821,0.00051852694,0.00019871393,0.000109035915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031694904,0.0001506275,0.0002544974,0.000116981995,0.00009850535,0.000059106995,0.0015840265,0.00006346333,0.00012595039],"category_scores_gemma":[0.00006844503,0.00007916504,0.00015544923,0.00024402369,0.00007622793,0.0006202717,0.0002811434,0.00037076615,0.0000046678138],"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.0006105165,0.000915949,0.0015218712,0.00010212962,0.0008294666,0.00059275085,0.013671701,0.0004830263,0.036012087,0.46365094,0.028220952,0.4533886],"study_design_scores_gemma":[0.005514879,0.009398552,0.059365954,0.0014021745,0.0002503538,0.0015997192,0.0013904917,0.12239124,0.38490427,0.4004799,0.011480065,0.001822394],"about_ca_topic_score_codex":0.00002871731,"about_ca_topic_score_gemma":9.3864037e-7,"teacher_disagreement_score":0.6896627,"about_ca_system_score_codex":0.000020156996,"about_ca_system_score_gemma":0.000073890405,"threshold_uncertainty_score":0.32282564},"labels":[],"label_agreement":null},{"id":"W2087236754","doi":"10.1016/j.jda.2014.11.006","title":"Computing upward topological book embeddings of upward planar digraphs","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Planarity testing; Digraph; Planar; Planar graph; Point (geometry); Combinatorics; Mathematics; Planar straight-line graph; Book embedding; Set (abstract data type); Graph; Topology (electrical circuits); Computer science; Discrete mathematics; Geometry; 1-planar graph; Computer graphics (images)","score_opus":0.010233486860440585,"score_gpt":0.2610799165336955,"score_spread":0.25084642967325493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087236754","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.049005117,0.0005629567,0.9477185,0.0013298542,0.0006831663,0.00006035696,0.0000026369203,0.000025035482,0.0006123647],"genre_scores_gemma":[0.729897,0.00005190825,0.2690875,0.00035896225,0.0004937852,5.126125e-7,0.0000031164973,0.000006926566,0.000100301426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821013,0.00013714316,0.0006700352,0.00019806753,0.00056063733,0.0002239989],"domain_scores_gemma":[0.9984517,0.00027597693,0.00062289543,0.00019747834,0.00030326945,0.00014866893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090189034,0.00014549894,0.0003567009,0.00025765452,0.00010665184,0.00008719729,0.00058911165,0.000072691546,0.000017158749],"category_scores_gemma":[0.00014399098,0.00011357119,0.00022973208,0.00038519944,0.00007063583,0.0005277884,0.000106911815,0.00022687923,0.00000551666],"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.00021357212,0.0006420994,0.0041616657,0.00017773217,0.0006380939,0.00017144252,0.0043689883,0.06858187,0.011998421,0.24364842,0.025834868,0.63956285],"study_design_scores_gemma":[0.0026425861,0.0031117562,0.018480996,0.00028136498,0.000097311,0.0008953534,0.00022084422,0.85255384,0.014781472,0.06230526,0.043878634,0.00075059326],"about_ca_topic_score_codex":0.000005062351,"about_ca_topic_score_gemma":5.298821e-7,"teacher_disagreement_score":0.78397197,"about_ca_system_score_codex":0.000027042142,"about_ca_system_score_gemma":0.00007554218,"threshold_uncertainty_score":0.46312988},"labels":[],"label_agreement":null},{"id":"W2087601184","doi":"10.1016/j.jda.2006.11.004","title":"A simple fast hybrid pattern-matching algorithm","year":2007,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"","keywords":"Simple (philosophy); Algorithm; Alphabet; Pattern matching; Matching (statistics); Computer science; String searching algorithm; SIMPLE algorithm; Independence (probability theory); Mathematics; Artificial intelligence; Statistics","score_opus":0.010511051524354267,"score_gpt":0.26868393093719184,"score_spread":0.25817287941283756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087601184","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.0057346295,0.00057363324,0.9913851,0.00030133623,0.0013536727,0.000109422705,0.000042013773,0.00007178519,0.00042838833],"genre_scores_gemma":[0.27846706,0.00016586922,0.71824056,0.0007390261,0.0021662568,0.0000025142128,0.000025093206,0.00005500812,0.00013860273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966784,0.00008810817,0.0010762924,0.00038929173,0.0010919188,0.0006760012],"domain_scores_gemma":[0.99749273,0.00021766326,0.0008198958,0.00067653373,0.00033192793,0.0004612364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017243609,0.00031692872,0.0004982648,0.000357647,0.00024984305,0.00036277922,0.0018316074,0.0000847529,0.00004553381],"category_scores_gemma":[0.00004680539,0.00024376022,0.0003127223,0.00040482706,0.000061754035,0.0020416682,0.000610411,0.0006056072,0.0000352059],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010175697,0.000093592076,0.00013221717,0.000010217657,0.00006251476,0.0009017245,0.00038908227,0.000095132484,0.0004915562,0.00018018148,0.0025326188,0.995101],"study_design_scores_gemma":[0.0074461377,0.0028604367,0.021558726,0.0008616904,0.0001949926,0.010405956,0.00175908,0.7493245,0.02862445,0.048816927,0.12515871,0.002988388],"about_ca_topic_score_codex":0.000098244134,"about_ca_topic_score_gemma":0.0000054329294,"teacher_disagreement_score":0.9921126,"about_ca_system_score_codex":0.00011389213,"about_ca_system_score_gemma":0.00011927479,"threshold_uncertainty_score":0.99402535},"labels":[],"label_agreement":null},{"id":"W2090891537","doi":"10.1016/j.jda.2014.12.005","title":"Universal point sets for planar three-trees","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Planar graph; Cardinality (data modeling); Planar; Mathematics; Plane (geometry); Embedding; Class (philosophy); Point (geometry); Upper and lower bounds; Set (abstract data type); Tree (set theory); Discrete mathematics; Computer science; Graph; Geometry; Artificial intelligence","score_opus":0.035795818754654034,"score_gpt":0.28785916265787115,"score_spread":0.2520633439032171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090891537","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.006637776,0.00035229317,0.98869467,0.0030088245,0.00090350886,0.00008676933,0.000009793687,0.000017014781,0.00028937758],"genre_scores_gemma":[0.321449,0.000018790435,0.67708963,0.00028670588,0.0008819538,0.0000025634963,0.00001398811,0.000011523724,0.00024585403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905044,0.0000329208,0.00027484747,0.0001246939,0.00037027252,0.0001467984],"domain_scores_gemma":[0.9989436,0.00009342667,0.00023825686,0.00013252551,0.00040877453,0.00018340349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005439188,0.00009058498,0.00015518216,0.00016442823,0.00006274851,0.00009835425,0.00038518483,0.000037402784,0.00000307923],"category_scores_gemma":[0.000073709794,0.00007323915,0.00011246872,0.00022223967,0.00001863921,0.0007784843,0.000047381436,0.00009280223,0.000005779681],"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.00054810493,0.00047348457,0.0011705272,0.000052738542,0.00066801964,0.00041623708,0.0048671137,0.09708811,0.0022877583,0.17894422,0.16683787,0.5466458],"study_design_scores_gemma":[0.003760137,0.0021521936,0.0032128638,0.00005990648,0.00005810522,0.00056470215,0.00036416168,0.7760848,0.0018993514,0.1785043,0.032944642,0.0003948714],"about_ca_topic_score_codex":0.000007240997,"about_ca_topic_score_gemma":0.000011509138,"teacher_disagreement_score":0.6789967,"about_ca_system_score_codex":0.00006254288,"about_ca_system_score_gemma":0.0002268065,"threshold_uncertainty_score":0.29866058},"labels":[],"label_agreement":null},{"id":"W2091484735","doi":"10.1016/j.jda.2005.06.009","title":"Utilitarian resource assignment","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Social cost; Price of anarchy; Mathematical optimization; Resource allocation; Resource (disambiguation); Mathematical economics; Computer science; Best response; Game theory; Total cost; Mathematics; Economics; Microeconomics; Price of stability","score_opus":0.07711950346725295,"score_gpt":0.39232270845129946,"score_spread":0.3152032049840465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091484735","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.3170391,0.0025110524,0.4633009,0.080354325,0.0010121302,0.0005269457,0.00009568566,0.000070869915,0.13508897],"genre_scores_gemma":[0.97724074,0.000013439449,0.017013865,0.0004358249,0.00077759876,0.0000023785944,8.530143e-7,0.000009321798,0.0045059556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723995,0.00020623149,0.00092758547,0.00018270503,0.0012415565,0.00020194768],"domain_scores_gemma":[0.99796885,0.0005789661,0.00056604785,0.0004366483,0.00022851325,0.0002209959],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038713769,0.000108432076,0.00026346472,0.000184455,0.00014215506,0.00014053151,0.0008905581,0.000052705658,0.0009790992],"category_scores_gemma":[0.00058794377,0.00006911154,0.00022670752,0.0003814706,0.00010486199,0.00039896707,0.00007964522,0.0002484182,0.000363205],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001120626,0.00024583263,0.0006176457,0.000001727622,0.00008132419,0.000028577,0.0017408337,0.0019880165,0.0015878999,0.017041314,0.07518918,0.9013656],"study_design_scores_gemma":[0.0005232893,0.00018906585,0.0036969187,0.000017652968,0.000029351526,0.00014018538,0.0019993125,0.0023182812,0.0014873793,0.05958063,0.9298817,0.00013626624],"about_ca_topic_score_codex":0.0000019132387,"about_ca_topic_score_gemma":0.000002357485,"teacher_disagreement_score":0.9012293,"about_ca_system_score_codex":0.000052937638,"about_ca_system_score_gemma":0.00006165825,"threshold_uncertainty_score":0.99993414},"labels":[],"label_agreement":null},{"id":"W2100967180","doi":"10.1016/j.jda.2003.12.004","title":"Optimizing a constrained convex polygonal annulus","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polygon (computer graphics); Star-shaped polygon; Polygon covering; Convex polygon; Rectilinear polygon; Regular polygon; Annulus (botany); Mathematics; Point in polygon; Combinatorics; Mathematical optimization; Algorithm; Computer science; Convex set; Geometry; Simple polygon; Convex optimization","score_opus":0.012492690460309706,"score_gpt":0.2567539926501066,"score_spread":0.24426130218979691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100967180","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.012726302,0.0006587427,0.9817258,0.003472076,0.0007678806,0.000057865927,0.0000045185684,0.000024707877,0.00056212017],"genre_scores_gemma":[0.5802977,0.000025669779,0.41895366,0.00027978665,0.00037805765,9.121708e-7,0.0000025189902,0.000005208641,0.000056467026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872494,0.00003898721,0.00043123143,0.00015031369,0.00045922145,0.00019529763],"domain_scores_gemma":[0.9990347,0.0000596305,0.00030899598,0.0001379805,0.00029418367,0.00016452877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039089072,0.00011738381,0.00020375488,0.00021175183,0.00010633161,0.00015679037,0.00039122842,0.000045883815,0.000018263072],"category_scores_gemma":[0.000055711203,0.00009911349,0.0001459981,0.00038776832,0.000051233583,0.0008128041,0.00007253561,0.00018867347,0.000011013146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012190349,0.0004846965,0.00010403014,0.000041427098,0.0004762466,0.0010672037,0.005196714,0.51161563,0.018259678,0.2195174,0.0015620278,0.24155301],"study_design_scores_gemma":[0.018459626,0.004487698,0.006420944,0.0005575613,0.00018178517,0.012012215,0.000984715,0.70004886,0.0523676,0.18556044,0.016963517,0.001955006],"about_ca_topic_score_codex":0.000005415369,"about_ca_topic_score_gemma":8.7796576e-7,"teacher_disagreement_score":0.5675714,"about_ca_system_score_codex":0.000066756795,"about_ca_system_score_gemma":0.00036478625,"threshold_uncertainty_score":0.40417305},"labels":[],"label_agreement":null},{"id":"W2107640410","doi":"10.1016/j.jda.2008.10.002","title":"Sigma-local graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Planarity testing; Combinatorics; Vertex (graph theory); Locality; Mathematics; Polyhedron; Modular decomposition; Plane (geometry); Indifference graph; Planar graph; Pathwidth; Maximal independent set; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Line graph; Geometry","score_opus":0.017124027973588217,"score_gpt":0.24782401956857114,"score_spread":0.23069999159498292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107640410","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.020692106,0.00063909346,0.976327,0.0009889228,0.0007373143,0.00003576835,0.000001320286,0.000019732168,0.0005587574],"genre_scores_gemma":[0.8529306,0.00014224395,0.1460924,0.00025296,0.0003255635,9.2836444e-7,0.0000017990444,0.0000055247224,0.0002479785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988155,0.000053738997,0.00036213495,0.00012738127,0.00048921304,0.00015203108],"domain_scores_gemma":[0.999162,0.00007058447,0.00022909502,0.00015614541,0.00024813047,0.00013405267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002849156,0.00009395366,0.0001620566,0.00021717811,0.00013916293,0.00004678504,0.0004058395,0.000038382568,0.000015671108],"category_scores_gemma":[0.00003244531,0.00007526592,0.00015540358,0.0004794789,0.000054604003,0.00070261775,0.00006520867,0.00016188284,0.000012216893],"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.00009168366,0.00052205735,0.0013446772,0.000030230269,0.00037389793,0.0018309116,0.0031750451,0.084533595,0.004025993,0.108851194,0.04244154,0.7527792],"study_design_scores_gemma":[0.0040752366,0.0024698414,0.040089108,0.000108414235,0.00006740119,0.012682176,0.00020109511,0.74483687,0.018508123,0.121083386,0.054823242,0.0010551278],"about_ca_topic_score_codex":0.0000037570342,"about_ca_topic_score_gemma":6.098533e-7,"teacher_disagreement_score":0.8322385,"about_ca_system_score_codex":0.00002847416,"about_ca_system_score_gemma":0.00014077646,"threshold_uncertainty_score":0.3069255},"labels":[],"label_agreement":null},{"id":"W2109262879","doi":"10.1016/j.jda.2010.09.004","title":"String matching with alphabet sampling","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Subsequence; Longest common subsequence problem; String (physics); Alphabet; String searching algorithm; Computer science; Matching (statistics); Sampling (signal processing); Space (punctuation); Generalized suffix tree; Spamming; Suffix array; Suffix tree; Range (aeronautics); Substring; Longest increasing subsequence; Mathematics; Combinatorics; Algorithm; Artificial intelligence; Pattern matching; Data structure; Statistics; The Internet","score_opus":0.013350417132978727,"score_gpt":0.2691607421952065,"score_spread":0.2558103250622278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109262879","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.0988916,0.00013965301,0.8993094,0.00039989964,0.0009484863,0.000056834597,0.000006339876,0.000040161303,0.00020765197],"genre_scores_gemma":[0.28174096,0.000026187588,0.7175151,0.00008112905,0.00058472663,0.0000010890498,0.0000020515174,0.000015753907,0.000032995187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836713,0.00003263325,0.0004441971,0.00023166284,0.0006118079,0.00031253893],"domain_scores_gemma":[0.9985212,0.00011035365,0.00046817044,0.00047273532,0.00019956352,0.00022798593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059373333,0.00017890972,0.0002805139,0.00016724455,0.00018791111,0.00036670314,0.0011997746,0.00006838963,0.000020858019],"category_scores_gemma":[0.00003096367,0.000117184136,0.00010290979,0.0002638229,0.000043677413,0.0017945304,0.00029021036,0.00074562867,0.000007053751],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001254693,0.0003292649,0.002643749,0.00007193616,0.000365284,0.0008571276,0.002698148,0.0032483628,0.06131335,0.042358216,0.0016792683,0.8843098],"study_design_scores_gemma":[0.018497996,0.006734442,0.075140454,0.0033851385,0.00049040595,0.0209378,0.0025527372,0.5005807,0.06991534,0.12644607,0.16917223,0.0061466573],"about_ca_topic_score_codex":0.000026748527,"about_ca_topic_score_gemma":0.0000069282455,"teacher_disagreement_score":0.87816316,"about_ca_system_score_codex":0.000020372743,"about_ca_system_score_gemma":0.000116044495,"threshold_uncertainty_score":0.47786304},"labels":[],"label_agreement":null},{"id":"W2117485843","doi":"10.1016/j.jda.2009.06.001","title":"Ordered interval routing schemes","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Disjoint sets; Mathematics; Interval graph; Routing (electronic design automation); Equal-cost multi-path routing; Discrete mathematics; Static routing; Computer science; Graph; Line graph; Routing protocol; Computer network; Pathwidth","score_opus":0.020526101915145673,"score_gpt":0.3183674353720518,"score_spread":0.2978413334569061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117485843","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.014358421,0.00059012487,0.9804521,0.0026078883,0.00032369472,0.0000684922,0.000001088143,0.000042937303,0.0015552111],"genre_scores_gemma":[0.7410606,0.00005090641,0.25822073,0.00023047678,0.0002504937,5.2525445e-7,3.6335618e-7,0.000008397957,0.0001774808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982474,0.00011136877,0.0004850473,0.00018880457,0.00059535506,0.00037203173],"domain_scores_gemma":[0.99872756,0.00010067349,0.0003360109,0.0003479191,0.00029797634,0.00018987387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008642548,0.00013918018,0.0002714069,0.00023358023,0.000106023756,0.00017810617,0.0013728841,0.00004777466,0.00001464722],"category_scores_gemma":[0.00022769847,0.000107062544,0.00019908279,0.0005179824,0.000056789602,0.0012374986,0.00016313125,0.0004475385,0.000012910208],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007524699,0.00013088727,0.00028410184,0.000007983802,0.00009500834,0.00035998737,0.00084669737,0.00019262415,0.006620065,0.07619404,0.00069188065,0.9145015],"study_design_scores_gemma":[0.0064500915,0.0066693253,0.012958551,0.00074951845,0.000066033,0.003024526,0.0011040504,0.2355175,0.05264586,0.65745795,0.021784954,0.001571643],"about_ca_topic_score_codex":0.0000010709329,"about_ca_topic_score_gemma":3.9236224e-7,"teacher_disagreement_score":0.91292983,"about_ca_system_score_codex":0.000052167743,"about_ca_system_score_gemma":0.00008818198,"threshold_uncertainty_score":0.43658838},"labels":[],"label_agreement":null},{"id":"W2123306533","doi":"10.1016/j.jda.2005.06.008","title":"Area-preserving approximations of polygonal paths","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Path (computing); Integer (computer science); Monotone polygon; Measure (data warehouse); Approximation algorithm; Discrete mathematics; Geometry; Computer science","score_opus":0.017485411038258868,"score_gpt":0.2625111394373805,"score_spread":0.24502572839912165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123306533","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.025060834,0.000657947,0.9702742,0.0026423675,0.00029379097,0.000054001965,0.000006890961,0.0000125297665,0.0009974156],"genre_scores_gemma":[0.5978697,0.00003125035,0.40143454,0.000094958596,0.0004029104,0.0000012390681,0.0000034943303,0.0000043531722,0.00015755792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986985,0.000050114835,0.0005165281,0.00011106771,0.0004903998,0.00013340634],"domain_scores_gemma":[0.9988335,0.00010332052,0.00043030683,0.00018657467,0.00035177573,0.00009455056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000440003,0.00008791926,0.00017559186,0.00023665465,0.000072112045,0.00006575753,0.00049718306,0.00003591558,0.00004106899],"category_scores_gemma":[0.00008388569,0.00007326716,0.0001364875,0.00040422333,0.00002344919,0.0009967756,0.00011342547,0.00013334294,0.000004718062],"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.000049087994,0.0006072563,0.00063668884,0.000066834196,0.000295009,0.00003786093,0.003161539,0.19355506,0.019497337,0.07010032,0.010143337,0.7018497],"study_design_scores_gemma":[0.00077257026,0.0002716444,0.004768104,0.000076488555,0.000026798374,0.00024882102,0.00008932695,0.96227956,0.0113055715,0.013688792,0.0062792613,0.00019303735],"about_ca_topic_score_codex":0.0000034126588,"about_ca_topic_score_gemma":0.0000019489098,"teacher_disagreement_score":0.7687245,"about_ca_system_score_codex":0.000033171076,"about_ca_system_score_gemma":0.00013102335,"threshold_uncertainty_score":0.2987748},"labels":[],"label_agreement":null},{"id":"W2127945324","doi":"10.1016/j.jda.2009.05.001","title":"Approximation algorithms for shortest descending paths in terrains","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Shortest path problem; K shortest path routing; Yen's algorithm; Terrain; Algorithm; Path (computing); Computer science; Constrained Shortest Path First; Shortest Path Faster Algorithm; Generalization; Euclidean shortest path; Approximation algorithm; Point (geometry); Mathematical optimization; Mathematics; Dijkstra's algorithm; Geometry; Theoretical computer science","score_opus":0.03003635432018853,"score_gpt":0.3028809910076843,"score_spread":0.27284463668749576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127945324","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.009773082,0.00027812598,0.9870496,0.0019474026,0.0005469098,0.00020722329,0.000005112663,0.000021713973,0.00017087885],"genre_scores_gemma":[0.5746015,0.0000306696,0.42463553,0.00020683401,0.00046048468,0.0000049632727,0.0000111213,0.0000060875846,0.000042853782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849296,0.000054641983,0.0006128204,0.00020601599,0.00038687035,0.0002466715],"domain_scores_gemma":[0.9990505,0.000112692374,0.00034694903,0.00015593869,0.00022619312,0.00010770904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086233276,0.0001394525,0.0002462534,0.0004276933,0.00009460871,0.00017101437,0.00040840486,0.00006294846,0.0000029808016],"category_scores_gemma":[0.00011714475,0.00012256345,0.00014558203,0.0005537171,0.000015235843,0.0011500359,0.000032306307,0.00017065449,0.000001688045],"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.00003387981,0.00025741084,0.00020099836,0.000015842017,0.00003157972,0.000046568763,0.0013385059,0.016834967,0.0045431857,0.013964322,0.00080694957,0.9619258],"study_design_scores_gemma":[0.0013122257,0.00082978903,0.0105521,0.00009486664,0.000015589774,0.0001873154,0.00010007921,0.94827896,0.0029766697,0.03430701,0.0010943467,0.0002510413],"about_ca_topic_score_codex":0.0000021216274,"about_ca_topic_score_gemma":0.0000021843402,"teacher_disagreement_score":0.96167475,"about_ca_system_score_codex":0.00010574735,"about_ca_system_score_gemma":0.00011429639,"threshold_uncertainty_score":0.4997992},"labels":[],"label_agreement":null},{"id":"W2130384369","doi":"10.1016/j.jda.2012.12.004","title":"A computational framework for determining run-maximal strings","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"String (physics); Computation; Combinatorics; Mathematics; Function (biology); Binary number; Key (lock); Element (criminal law); Cover (algebra); Discrete mathematics; Algorithm; Computer science; Arithmetic; Mathematical physics","score_opus":0.025830563042006628,"score_gpt":0.3077244475159101,"score_spread":0.28189388447390346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130384369","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.0062304097,0.00061782234,0.99125373,0.0003862252,0.00128004,0.000110799665,0.00002387931,0.000030412273,0.000066652596],"genre_scores_gemma":[0.20300356,0.000014739223,0.7957119,0.0001692542,0.0010606215,0.0000046294845,0.0000054281577,0.000013527128,0.000016366894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822426,0.00004681047,0.00056467485,0.00017937568,0.00054453325,0.00044036945],"domain_scores_gemma":[0.9981599,0.00046555584,0.0005679344,0.00025871917,0.00025117685,0.00029672368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007169608,0.00017589203,0.00030240437,0.00016078107,0.00019281634,0.00020037015,0.00086034066,0.00009585232,0.000015157663],"category_scores_gemma":[0.00016309276,0.00013768405,0.00021100375,0.00021512402,0.000039534578,0.0020392183,0.00025629287,0.00030553373,0.000007914488],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014476269,0.00052517897,0.004717399,0.00009090997,0.00031611705,0.00007555553,0.0041052443,0.004321357,0.00032841568,0.1302678,0.0064842133,0.84862304],"study_design_scores_gemma":[0.0026495596,0.0013318866,0.017220719,0.0005599849,0.00010016028,0.0011278833,0.00033102746,0.82565945,0.0012562402,0.12017569,0.028709436,0.00087793026],"about_ca_topic_score_codex":0.00000254645,"about_ca_topic_score_gemma":7.54528e-8,"teacher_disagreement_score":0.8477451,"about_ca_system_score_codex":0.000051293282,"about_ca_system_score_gemma":0.00010202752,"threshold_uncertainty_score":0.56145924},"labels":[],"label_agreement":null},{"id":"W2156148354","doi":"10.1016/j.jda.2008.12.002","title":"Algorithms for optimal outlier removal","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Perimeter; Convex hull; Mathematics; Combinatorics; Set (abstract data type); Regular polygon; Bounding overwatch; Point (geometry); Constant (computer programming); Outlier; Minimum bounding box; Algorithm; Mathematical optimization; Computer science; Geometry; Statistics; Artificial intelligence","score_opus":0.02320484431757027,"score_gpt":0.30016347908188373,"score_spread":0.2769586347643135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156148354","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.0042919083,0.00064967654,0.98920465,0.004249863,0.0010578166,0.00014307514,0.000007387398,0.000029748491,0.00036587968],"genre_scores_gemma":[0.06328785,0.000043284213,0.9339125,0.0006146132,0.0014474937,0.0000025894844,0.00000781083,0.000009138033,0.00067470345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841356,0.000046005633,0.00054806384,0.00021995461,0.00050506345,0.00026737203],"domain_scores_gemma":[0.9986687,0.00010490399,0.0003707317,0.00021457308,0.00046996918,0.00017114478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069321116,0.00015559512,0.00026407975,0.0002414026,0.00013885259,0.00019905895,0.0005618733,0.00006759004,0.000008794291],"category_scores_gemma":[0.0000938951,0.00012882269,0.00026284283,0.000377384,0.000020902853,0.0009152669,0.000045551147,0.00017089899,0.000006908689],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077253186,0.00018475467,0.00000820746,0.000009313805,0.000093660405,0.00013225262,0.00051843806,0.021348925,0.0022340876,0.020452451,0.009421118,0.94551957],"study_design_scores_gemma":[0.0027910061,0.0027768586,0.0020033296,0.00005849975,0.00006445438,0.0018489045,0.0000772829,0.870294,0.006254332,0.038848627,0.07447219,0.0005105389],"about_ca_topic_score_codex":9.535105e-7,"about_ca_topic_score_gemma":1.9841222e-7,"teacher_disagreement_score":0.945009,"about_ca_system_score_codex":0.00005370925,"about_ca_system_score_gemma":0.0001539158,"threshold_uncertainty_score":0.5253237},"labels":[],"label_agreement":null},{"id":"W2163277843","doi":"10.1016/j.jda.2006.10.004","title":"Realizing partitions respecting full and partial order information","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University; Queen's University","funders":"","keywords":"Combinatorics; Extension (predicate logic); Integer (computer science); Mathematics; Interval (graph theory); Order (exchange); Simple (philosophy); Set (abstract data type); Polynomial; Discrete mathematics; Computer science","score_opus":0.009012382437779043,"score_gpt":0.24551526842619206,"score_spread":0.23650288598841301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163277843","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.019745858,0.00022594968,0.9768106,0.0011307488,0.00022322798,0.000045586705,0.0000022942002,0.000031274507,0.0017844595],"genre_scores_gemma":[0.79209524,0.00006338407,0.20710906,0.00016879784,0.0005187276,0.000002267854,0.0000031856762,0.0000054369903,0.00003386366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904346,0.00003705062,0.00042551573,0.000081780556,0.00023471637,0.00017746305],"domain_scores_gemma":[0.9992331,0.00005628151,0.00035265237,0.00012167654,0.00016678059,0.000069492184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002835531,0.00008376318,0.00013328128,0.000112811234,0.00016163813,0.00018931458,0.00019230323,0.000034297533,0.000005953294],"category_scores_gemma":[0.000069812515,0.00006552218,0.00004829498,0.00026479017,0.000033412693,0.0022866842,0.00006941035,0.00015822671,0.0000051681964],"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.00011154289,0.00018206649,0.002221682,0.00006926322,0.00012477415,0.0002561762,0.0032750645,0.020411536,0.0036736312,0.58770865,0.0060570976,0.3759085],"study_design_scores_gemma":[0.005973013,0.0024801996,0.031268008,0.00044259205,0.0001548769,0.004417497,0.0025613222,0.35660252,0.00831715,0.45857117,0.12758079,0.0016308438],"about_ca_topic_score_codex":0.00001598612,"about_ca_topic_score_gemma":0.000004572093,"teacher_disagreement_score":0.7723494,"about_ca_system_score_codex":0.000025749407,"about_ca_system_score_gemma":0.000042183703,"threshold_uncertainty_score":0.26719168},"labels":[],"label_agreement":null},{"id":"W2168358943","doi":"10.1016/j.jda.2011.12.006","title":"Chains-into-bins processes","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bin; Ball (mathematics); Chain (unit); Combinatorics; Set (abstract data type); Object (grammar); Mathematics; Computer science; Process (computing); Mathematical optimization; Algorithm; Discrete mathematics; Geometry; Artificial intelligence; Physics","score_opus":0.021561247602419897,"score_gpt":0.22196563655160817,"score_spread":0.20040438894918827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168358943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026839726,0.00668779,0.8751342,0.00043024847,0.0038479052,0.00031150205,0.000023792481,0.00048115756,0.086243644],"genre_scores_gemma":[0.9060419,0.0013843968,0.09148162,0.00007945076,0.00042583645,0.0000030485178,0.0000037073323,0.000059973823,0.0005200514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.000011947688,0.0003214515,0.000059833506,0.0001769034,0.0001531513],"domain_scores_gemma":[0.99950355,0.000016158916,0.00011028325,0.00009464988,0.0001656071,0.00010977749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014634954,0.000112475595,0.00017065863,0.000121127756,0.000038423463,0.000030380186,0.00017652397,0.000054560798,0.00018388923],"category_scores_gemma":[0.000035641755,0.00009020832,0.000068859634,0.00021920305,0.000025943467,0.00027742534,0.000012555609,0.00017234267,0.000018874474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040165763,0.0012275301,0.016467614,0.0051668994,0.0037082296,0.001117303,0.1354447,0.37152,0.007627358,0.008061005,0.04791091,0.40134677],"study_design_scores_gemma":[0.011022825,0.0040027327,0.013126946,0.0027126851,0.0008145295,0.0022611297,0.0051569855,0.5485396,0.13087448,0.017988872,0.25878334,0.0047158655],"about_ca_topic_score_codex":0.0000055079695,"about_ca_topic_score_gemma":0.000004357739,"teacher_disagreement_score":0.8792022,"about_ca_system_score_codex":0.000025078614,"about_ca_system_score_gemma":0.000040336912,"threshold_uncertainty_score":0.36785886},"labels":[],"label_agreement":null},{"id":"W2172617180","doi":"10.1016/j.jda.2012.04.017","title":"Efficient codon optimization with motif engineering","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Codon usage bias; Gene; Computational biology; Genome; Motif (music); Computer science; Coding region; Genetic code; Stop codon; Genetics; Translational efficiency; Biology; Translation (biology); Messenger RNA; Physics","score_opus":0.006408145509374658,"score_gpt":0.21503941123799533,"score_spread":0.20863126572862067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172617180","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.27258274,0.0013567442,0.7254356,0.0000704014,0.00028855447,0.00008158822,0.0000042492916,0.00000461487,0.00017549496],"genre_scores_gemma":[0.8919652,0.000070932445,0.10721042,0.000029620374,0.0006225172,0.0000026254056,0.000005912065,0.000022395978,0.000070363385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993445,0.000027398555,0.00018860896,0.000074674856,0.00017962404,0.00018513906],"domain_scores_gemma":[0.9995092,0.00000809121,0.00016521612,0.000115203984,0.00008555468,0.00011671914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029150624,0.00010223467,0.00012212091,0.00004550691,0.000031964202,0.000017121738,0.000103472106,0.00006607903,0.000020944583],"category_scores_gemma":[0.00004153785,0.00007266916,0.00006936879,0.0000587062,0.000013786621,0.0000060710213,0.000023220258,0.00006629589,0.0000019423726],"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.00014916164,0.00010089818,0.0005177534,0.000021501426,0.00016047944,0.000008424007,0.00011496452,0.5266709,0.46727708,0.00007052028,0.00014508305,0.0047632395],"study_design_scores_gemma":[0.0011994549,0.0013242164,0.0010498719,0.00012979262,0.00012093483,0.00052125164,0.00016860514,0.04296907,0.94556856,0.000007046727,0.006524134,0.00041708117],"about_ca_topic_score_codex":0.0000012023477,"about_ca_topic_score_gemma":1.0518087e-7,"teacher_disagreement_score":0.6193825,"about_ca_system_score_codex":0.000011867504,"about_ca_system_score_gemma":0.000023728004,"threshold_uncertainty_score":0.29633623},"labels":[],"label_agreement":null},{"id":"W2175772512","doi":"10.1016/j.jda.2012.04.009","title":"Kinetic Euclidean minimum spanning tree in the plane","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Euclidean minimum spanning tree; Delaunay triangulation; Mathematics; Combinatorics; Spanning tree; Constrained Delaunay triangulation; Minimum spanning tree; Bowyer–Watson algorithm; Plane (geometry); Euclidean geometry; Euclidean space; Pitteway triangulation; Triangulation; Geometry; Kruskal's algorithm","score_opus":0.021837724064157616,"score_gpt":0.27487479110109514,"score_spread":0.2530370670369375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175772512","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.2465991,0.002841013,0.7402255,0.0056478237,0.0018637222,0.00014901135,0.0000025112136,0.000017490356,0.0026538484],"genre_scores_gemma":[0.95381457,0.000024460443,0.04487934,0.00033095208,0.0008668284,0.0000013754064,0.0000023017124,0.000004094628,0.00007606379],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987789,0.00013169198,0.000360575,0.00008353927,0.00042695168,0.00021835584],"domain_scores_gemma":[0.99928266,0.00019836107,0.00021852269,0.00015375449,0.00006494893,0.00008173066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882511,0.00008848252,0.00013488882,0.00018843902,0.00005864526,0.00010053246,0.00049383927,0.00003064065,0.00000872343],"category_scores_gemma":[0.00006558034,0.000056987923,0.00007609415,0.0004282326,0.000017303022,0.0006692137,0.000052587526,0.00019820996,0.000010143223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011313384,0.0010337431,0.016837679,0.00006373827,0.00021281361,0.0004898148,0.03575942,0.024667406,0.007264788,0.05912881,0.022918014,0.83151066],"study_design_scores_gemma":[0.004498749,0.0018296906,0.6040669,0.0002923951,0.0001152272,0.0046181153,0.0023068401,0.28807756,0.004305057,0.020116497,0.068731,0.0010419698],"about_ca_topic_score_codex":0.0000060558946,"about_ca_topic_score_gemma":0.000003009846,"teacher_disagreement_score":0.83046865,"about_ca_system_score_codex":0.00002406145,"about_ca_system_score_gemma":0.000039974504,"threshold_uncertainty_score":0.23239},"labels":[],"label_agreement":null},{"id":"W2176745125","doi":"10.1016/j.jda.2011.12.013","title":"Efficient chaining of seeds in ordered trees","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Chaining; Extension (predicate logic); Combinatorics; Set (abstract data type); Computer science; Tree (set theory); Time complexity; Computational complexity theory; Mathematics; Forward chaining; Order (exchange); Constant (computer programming); Discrete mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Expert system","score_opus":0.028365662946910574,"score_gpt":0.2556116409046778,"score_spread":0.22724597795776724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176745125","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.15613037,0.0009661766,0.8400698,0.00014954344,0.00079319876,0.00010841396,0.0000099676645,0.000022244374,0.0017502998],"genre_scores_gemma":[0.780368,0.00004551454,0.2194328,0.000027041959,0.00008989586,0.0000011538525,8.1952743e-7,0.0000087916715,0.00002600533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983185,0.0000803538,0.0007035941,0.00017892629,0.00046851014,0.00025010953],"domain_scores_gemma":[0.9987167,0.00006234262,0.0005751201,0.00035658383,0.00016905977,0.00012016917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006944629,0.00014035155,0.00035640807,0.00034181605,0.000042305106,0.000032913737,0.0009816714,0.00006165831,0.00002706053],"category_scores_gemma":[0.000050881852,0.00010246583,0.00012717058,0.00047837684,0.00005423598,0.00033780208,0.00028354785,0.00023533683,0.0000030429737],"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.00044807888,0.002448642,0.014726016,0.00014014343,0.00037734018,0.0014095791,0.04386279,0.014175649,0.011159198,0.020520063,0.0013196314,0.8894129],"study_design_scores_gemma":[0.002811808,0.0013142979,0.07083212,0.0006004871,0.00003062523,0.00028133637,0.0009958588,0.911282,0.007735305,0.0029045164,0.0007605631,0.00045109022],"about_ca_topic_score_codex":0.000086218584,"about_ca_topic_score_gemma":0.00000631754,"teacher_disagreement_score":0.89710635,"about_ca_system_score_codex":0.000030752395,"about_ca_system_score_gemma":0.00009614366,"threshold_uncertainty_score":0.41784352},"labels":[],"label_agreement":null},{"id":"W2180616177","doi":"10.1016/j.jda.2011.12.017","title":"Skip lift: A probabilistic alternative to red–black trees","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lift (data mining); Pointer (user interface); Computer science; Data structure; Combinatorics; Probabilistic logic; Algorithm; Mathematics; Discrete mathematics; Data mining; Artificial intelligence; Programming language","score_opus":0.03582305399091825,"score_gpt":0.27033341733777766,"score_spread":0.2345103633468594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180616177","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.0078206565,0.00023829001,0.98588324,0.0012111908,0.0011719503,0.0002608766,0.000025347425,0.00005376555,0.003334715],"genre_scores_gemma":[0.2873559,0.00011717949,0.7105303,0.0004708251,0.0010030984,0.000011316,0.0000036957845,0.000036201287,0.00047148054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775386,0.00011592895,0.000687337,0.00036482947,0.00069258944,0.00038546644],"domain_scores_gemma":[0.99797004,0.000086376414,0.00051084545,0.0006293756,0.00036790365,0.00043545137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056438986,0.00024450486,0.00040052668,0.0002680714,0.0001037379,0.00016445339,0.0019010643,0.00006987717,0.000067234694],"category_scores_gemma":[0.0001629575,0.00017382276,0.00019565206,0.00044562065,0.00010994939,0.0012767718,0.0005587105,0.00031743557,0.00006653698],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007640028,0.0022876945,0.0015796563,0.00014104515,0.0010036862,0.003373124,0.05082411,0.0034355111,0.0025436338,0.071927056,0.08299784,0.77912265],"study_design_scores_gemma":[0.007659576,0.013949709,0.059772816,0.0022167163,0.00033825828,0.002235205,0.0020230394,0.580593,0.020482235,0.22463451,0.08247928,0.0036156552],"about_ca_topic_score_codex":0.00009357937,"about_ca_topic_score_gemma":0.00001085241,"teacher_disagreement_score":0.775507,"about_ca_system_score_codex":0.00007704072,"about_ca_system_score_gemma":0.000120411256,"threshold_uncertainty_score":0.7088286},"labels":[],"label_agreement":null},{"id":"W2227651644","doi":"10.1016/j.jda.2015.01.002","title":"Perspectives","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.04219775299299622,"score_gpt":0.3192331879182858,"score_spread":0.2770354349252896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227651644","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.79951704,0.035650127,0.028441794,0.009266362,0.005181308,0.00063334825,0.00023346025,0.00033674814,0.12073983],"genre_scores_gemma":[0.96112204,0.000061149265,0.036115948,0.000053087977,0.0017796779,0.0000013719225,0.0000019352324,0.00008686282,0.0007779402],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980952,0.00012774272,0.00047712235,0.00013508889,0.0008844685,0.00028038834],"domain_scores_gemma":[0.9977872,0.000044654338,0.0005483582,0.00020787182,0.0009372953,0.00047463892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011244001,0.00016350814,0.00033654884,0.00026563316,0.000044164048,0.000077372744,0.00037219774,0.000057985784,0.00010434097],"category_scores_gemma":[0.0004734851,0.00012062955,0.00022594939,0.0003449321,0.00012687585,0.00071771175,0.000057677167,0.00035599992,0.00062354916],"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.002805673,0.0021109504,0.015538064,0.000050635652,0.0030052853,0.0037062778,0.100916125,0.0027461788,0.022796452,0.012539254,0.78332895,0.050456174],"study_design_scores_gemma":[0.032026045,0.011510104,0.03979748,0.00067155086,0.0014344389,0.0153878,0.3320646,0.015983192,0.01569398,0.06130514,0.47071597,0.0034097212],"about_ca_topic_score_codex":0.00001731933,"about_ca_topic_score_gemma":0.0000025674017,"teacher_disagreement_score":0.31261298,"about_ca_system_score_codex":0.0002872382,"about_ca_system_score_gemma":0.00026998963,"threshold_uncertainty_score":0.80146706},"labels":[],"label_agreement":null},{"id":"W2403255229","doi":"10.1016/j.jda.2016.05.003","title":"Corrigendum to “On a lemma of Crochemore and Rytter” [Journal of Discrete Algorithms 34 (2015) 18–22]","year":2016,"lang":"en","type":"erratum","venue":"Journal of Discrete Algorithms","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Lemma (botany); Algorithm; Mathematics; Computer science; Biology","score_opus":0.014457780096897379,"score_gpt":0.25190660296500295,"score_spread":0.23744882286810556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403255229","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056169722,0.14265901,0.17968747,0.004036313,0.541864,0.00450127,0.008566602,0.00046380726,0.062051855],"genre_scores_gemma":[0.43658727,0.048486594,0.04227552,0.0013032246,0.11010662,0.00014465224,0.0004206604,0.0038687827,0.35680667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9941127,0.0002538971,0.002837067,0.00041745516,0.0015498456,0.0008290637],"domain_scores_gemma":[0.9950386,0.00015355714,0.0024355913,0.00070281356,0.0008426065,0.00082678464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016070298,0.0009886981,0.0024660255,0.0012689847,0.00012032911,0.00014997253,0.001254458,0.00080794696,0.00027210315],"category_scores_gemma":[0.00018294866,0.000700242,0.0010602443,0.00046201193,0.0002512282,0.00053276843,0.0001604934,0.0020938655,0.000020372509],"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.00043460136,0.00009114905,0.000070107,0.0011018321,0.0018084031,0.00065238203,0.00097165734,0.00018101929,0.0034452332,0.000120689576,0.9705235,0.020599423],"study_design_scores_gemma":[0.007014818,0.0073527894,0.0012070666,0.018877357,0.0016585976,0.0069491873,0.002555471,0.0025941136,0.0112563735,0.0035536764,0.9337965,0.003184041],"about_ca_topic_score_codex":0.000014995222,"about_ca_topic_score_gemma":0.0000055727737,"teacher_disagreement_score":0.43175733,"about_ca_system_score_codex":0.00025143794,"about_ca_system_score_gemma":0.0002752724,"threshold_uncertainty_score":0.99954486},"labels":[],"label_agreement":null},{"id":"W2479263369","doi":"10.1016/j.jda.2016.07.001","title":"Reconstructing binary matrices with timetabling constraints","year":2016,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Dimension (graph theory); Binary number; Greedy algorithm; Relaxation (psychology); Matrix (chemical analysis); Mathematical optimization; Mathematics; Computational complexity theory; Computer science; Algorithm; Time complexity; Combinatorics","score_opus":0.013487613310519635,"score_gpt":0.25613811537437825,"score_spread":0.2426505020638586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479263369","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.00907032,0.00050145376,0.9863839,0.0008440034,0.00020488065,0.0000559577,0.0000039179795,0.00012943168,0.0028061133],"genre_scores_gemma":[0.22102596,0.000061864564,0.7786182,0.000050680348,0.00011173476,0.000001152408,1.1862827e-7,0.0000131597435,0.00011714801],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860597,0.000042322226,0.00046898634,0.000205479,0.00041133983,0.00026588433],"domain_scores_gemma":[0.99840957,0.00016411293,0.0006971674,0.00024782275,0.00034613613,0.00013517594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004180031,0.0001561881,0.00026634193,0.00027945125,0.000074910065,0.00039694837,0.00090301683,0.000043972195,0.00001535058],"category_scores_gemma":[0.00012187041,0.00008399324,0.00009008165,0.0003845455,0.00022925547,0.003733063,0.000160209,0.00015323158,0.000009520813],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014706205,0.000029082918,0.0007706952,0.000014594264,0.00006022205,0.00023066904,0.00006329188,0.0000019205588,0.0068168165,0.00097487494,0.00037818003,0.99064493],"study_design_scores_gemma":[0.013378491,0.010438483,0.0042195744,0.017953712,0.0005467354,0.09624629,0.0016080654,0.023721604,0.5499816,0.2594145,0.016863206,0.005627768],"about_ca_topic_score_codex":0.0000015897867,"about_ca_topic_score_gemma":1.5684009e-7,"teacher_disagreement_score":0.9850172,"about_ca_system_score_codex":0.00004787381,"about_ca_system_score_gemma":0.0001846911,"threshold_uncertainty_score":0.3827782},"labels":[],"label_agreement":null},{"id":"W2552773400","doi":"10.1016/j.jda.2016.11.002","title":"A prefix array for parameterized strings","year":2016,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Parameterized complexity; Prefix; Mathematics; Combinatorics; Computer science; Algorithm","score_opus":0.019458479569679422,"score_gpt":0.27346738350236816,"score_spread":0.2540089039326887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552773400","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.003368718,0.00024295149,0.9934925,0.0017122871,0.000847343,0.00015690358,0.000044294975,0.000035101148,0.000099888544],"genre_scores_gemma":[0.05054508,0.0001548786,0.9481072,0.00015699613,0.0006175464,0.000014142667,0.0000020856764,0.000020652045,0.00038145608],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983596,0.000055213728,0.0005659072,0.00025729113,0.00043212122,0.00032983097],"domain_scores_gemma":[0.99821466,0.00029654804,0.00055960903,0.00045474948,0.0002648914,0.0002095259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057731377,0.00017203261,0.0003431132,0.00014090711,0.000099615216,0.00016006209,0.0011703441,0.00007046901,0.000017284061],"category_scores_gemma":[0.00015852705,0.00009224996,0.00025413928,0.00016228195,0.000047934616,0.0014935799,0.00016024684,0.000115631345,0.000009387378],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021198379,0.0001566264,0.00013671664,0.000033081316,0.00018562023,0.00005036541,0.0003618918,0.0000135712,0.12886302,0.0036414447,0.009545245,0.85680044],"study_design_scores_gemma":[0.023479877,0.0075091957,0.004349162,0.0019777522,0.00022808126,0.0013764787,0.00016438693,0.032669634,0.28173864,0.10307121,0.5412311,0.0022044622],"about_ca_topic_score_codex":0.0000038613643,"about_ca_topic_score_gemma":2.998353e-7,"teacher_disagreement_score":0.85459596,"about_ca_system_score_codex":0.000049845006,"about_ca_system_score_gemma":0.00010246898,"threshold_uncertainty_score":0.37618443},"labels":[],"label_agreement":null},{"id":"W2568188511","doi":"10.1016/j.jda.2011.10.002","title":"Indexability, concentration, and VC theory","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Search engine indexing; Histogram; Measure (data warehouse); Dimension (graph theory); Similarity (geometry); Similarity measure; Statistical analysis","score_opus":0.025446906063955575,"score_gpt":0.2651457390474658,"score_spread":0.23969883298351022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568188511","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.005721329,0.00078403245,0.9896167,0.0002730578,0.0003369655,0.000054504533,0.0000012003053,0.000011373751,0.003200835],"genre_scores_gemma":[0.3334849,0.000093248585,0.666035,0.00020588998,0.00011840997,6.7469404e-7,1.1083873e-7,0.0000047784165,0.000056992045],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989542,0.00021377581,0.0003322,0.0001418961,0.00020519295,0.00015275196],"domain_scores_gemma":[0.9991623,0.000084516774,0.00023371789,0.00021755775,0.00015304418,0.00014882028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001336821,0.000095448435,0.0001865277,0.00003544967,0.000056483623,0.00006983573,0.0004179185,0.00005439171,0.000023639941],"category_scores_gemma":[0.00006590241,0.000066974775,0.00007296098,0.000116176896,0.000087600696,0.00065734074,0.00009513786,0.00019065879,0.0000014779879],"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.000034043645,0.00007375014,0.0021414126,0.000014077707,0.00007580574,0.0000622523,0.004958413,7.0959675e-7,0.00039776383,0.49588436,0.00036412122,0.49599332],"study_design_scores_gemma":[0.0006634151,0.0004167293,0.022450715,0.000039619616,0.00003218763,0.00039882207,0.00007156155,0.004794446,0.004034993,0.96628505,0.000614646,0.00019783685],"about_ca_topic_score_codex":0.0000051610855,"about_ca_topic_score_gemma":6.001929e-7,"teacher_disagreement_score":0.49579546,"about_ca_system_score_codex":0.000014380353,"about_ca_system_score_gemma":0.00007049488,"threshold_uncertainty_score":0.27311522},"labels":[],"label_agreement":null},{"id":"W2586556622","doi":"10.1016/j.jda.2017.01.003","title":"Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences","year":2017,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Substring; Combinatorics; Ranking (information retrieval); Rank (graph theory); Sequence (biology); Mathematics; Order (exchange); Algorithm; Simple (philosophy); Computer science; Artificial intelligence; Data structure","score_opus":0.03259474542133807,"score_gpt":0.34319060051526473,"score_spread":0.3105958550939267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586556622","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.011831258,0.0008779765,0.97109336,0.013910176,0.0012901913,0.00020406889,0.000023910454,0.00004557865,0.0007234545],"genre_scores_gemma":[0.10522024,0.00082274247,0.8920607,0.00048930594,0.0010998335,0.000007173846,0.0000024279936,0.000026260797,0.00027132986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728215,0.00016270977,0.00065585726,0.00046796416,0.0008506373,0.00058067846],"domain_scores_gemma":[0.9969097,0.00022353222,0.00088015676,0.0010044564,0.0002520574,0.0007301115],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015693972,0.00029903455,0.00052151864,0.00020728851,0.00070214865,0.0015994307,0.002025577,0.00014314806,0.000025033603],"category_scores_gemma":[0.0005697858,0.00022350968,0.00015541913,0.00017121636,0.00018632674,0.0034656925,0.0010448421,0.0005562714,0.000017801898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002682064,0.00036285174,0.0027730933,0.00007656132,0.00033885936,0.0028871538,0.0030240056,0.00019871183,0.0032290064,0.0070620016,0.04410786,0.9356717],"study_design_scores_gemma":[0.008365977,0.00475555,0.055303205,0.0016839717,0.0003299242,0.0135616725,0.0013862491,0.71048623,0.010839653,0.023290323,0.16723748,0.0027597388],"about_ca_topic_score_codex":0.0002156208,"about_ca_topic_score_gemma":0.000013371666,"teacher_disagreement_score":0.93291193,"about_ca_system_score_codex":0.00008932915,"about_ca_system_score_gemma":0.00035888702,"threshold_uncertainty_score":0.99943703},"labels":[],"label_agreement":null},{"id":"W2618053861","doi":"10.1016/j.jda.2017.04.005","title":"Guarding monotone art galleries with sliding cameras in linear time","year":2017,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Monotone polygon; Polygon (computer graphics); Combinatorics; Simple polygon; Mathematics; Time complexity; Line segment; Guard (computer science); Regular polygon; Point in polygon; Algorithm; Point (geometry); Polygon covering; Computer science; Geometry","score_opus":0.01341665127511504,"score_gpt":0.2715726209023183,"score_spread":0.2581559696272033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618053861","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.12609161,0.00022083284,0.8683244,0.0028980763,0.0005898138,0.00010412037,0.0000017211972,0.000018811,0.0017506003],"genre_scores_gemma":[0.795106,0.000059614944,0.20322421,0.000084205356,0.0005033981,0.0000024586711,0.0000021604426,0.00001054644,0.0010073906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989031,0.000042786505,0.00033653452,0.00015715888,0.00038418823,0.00017624916],"domain_scores_gemma":[0.99893045,0.000058320707,0.00046925037,0.00027553545,0.00018035165,0.00008611501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000542151,0.000113975315,0.00023061926,0.00020082538,0.00023892801,0.0003370212,0.00053832063,0.000035698096,0.00001255521],"category_scores_gemma":[0.00009127442,0.00008805716,0.000070945505,0.00015478522,0.00003382122,0.0015094983,0.00011837533,0.00019123153,0.000021683081],"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.0009150884,0.0009004136,0.026646938,0.00016494597,0.0012474711,0.004142784,0.011081022,0.33301318,0.050668642,0.027517559,0.018401785,0.52530015],"study_design_scores_gemma":[0.0029309436,0.0010853608,0.044981733,0.0004485527,0.000039021732,0.0008182717,0.00014692567,0.9224056,0.010884037,0.0044721738,0.011160302,0.00062706595],"about_ca_topic_score_codex":0.000010512406,"about_ca_topic_score_gemma":0.0000053924136,"teacher_disagreement_score":0.6690144,"about_ca_system_score_codex":0.00004407063,"about_ca_system_score_gemma":0.000113211405,"threshold_uncertainty_score":0.35908666},"labels":[],"label_agreement":null},{"id":"W2762553061","doi":"10.1016/j.jda.2015.09.003","title":"Folding a paper strip to minimize thickness","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology; Air Force Office of Scientific Research; Uehara Memorial Foundation; National Science Foundation","keywords":"Folding (DSP implementation); Fold (higher-order function); Graph; Algorithm; Plane (geometry); Computer science; State (computer science); Geometry; Mathematics; Mathematical optimization; Combinatorics; Topology (electrical circuits); Structural engineering; Engineering","score_opus":0.02279011712349572,"score_gpt":0.2588444840929991,"score_spread":0.23605436696950338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762553061","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.07035844,0.0014931002,0.920461,0.00043310723,0.005381518,0.00016511734,0.00003145758,0.00010231115,0.0015739527],"genre_scores_gemma":[0.6254536,0.00038604808,0.37126178,0.0003820768,0.00211354,0.000009374127,0.0000036454198,0.00011544429,0.00027448675],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906486,0.000017196624,0.00035979995,0.000074799966,0.00026357273,0.00021979726],"domain_scores_gemma":[0.99933076,0.000023942835,0.00008593039,0.00012124336,0.00013626536,0.0003018614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032679096,0.00013056204,0.00027071618,0.00008011355,0.000021956685,0.000045182493,0.00017240335,0.00006158839,0.000030481422],"category_scores_gemma":[0.00008841947,0.00010416357,0.000075369586,0.000118527096,0.000006580732,0.00032717278,0.00003616907,0.00014203422,0.0000168766],"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.00048522404,0.00013409519,0.000048721264,0.00025442278,0.0005635152,0.00068052055,0.0054218327,0.23223093,0.57115835,0.0024248753,0.033160567,0.15343691],"study_design_scores_gemma":[0.013423338,0.0024738936,0.0006736212,0.0015051428,0.00056755514,0.0023007477,0.009618995,0.0764128,0.25794482,0.03625616,0.5957057,0.0031172258],"about_ca_topic_score_codex":0.0000024082458,"about_ca_topic_score_gemma":9.258021e-7,"teacher_disagreement_score":0.5625451,"about_ca_system_score_codex":0.00007469846,"about_ca_system_score_gemma":0.00003681494,"threshold_uncertainty_score":0.4247667},"labels":[],"label_agreement":null},{"id":"W2762796277","doi":"10.1016/j.jda.2017.10.002","title":"Necklaces and Lyndon words in colexicographic and binary reflected Gray code order","year":2017,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science, ICT and Future Planning","keywords":"De Bruijn sequence; Gray code; Binary number; Combinatorics; Order (exchange); Code (set theory); Sequence (biology); Gray (unit); Mathematics; Computer science; Algorithm; Arithmetic; Chemistry; Set (abstract data type)","score_opus":0.01710391269247407,"score_gpt":0.2983183978350761,"score_spread":0.281214485142602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762796277","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.8351896,0.0066276514,0.15173383,0.0043133916,0.0011348329,0.0002826229,0.000030995205,0.00004990936,0.0006372003],"genre_scores_gemma":[0.85854787,0.0025068903,0.13851981,0.000119376906,0.00020209886,0.0000037740547,0.0000028567138,0.000016901146,0.00008043555],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99853474,0.000093963696,0.00043359984,0.0002967291,0.00036667654,0.00027430643],"domain_scores_gemma":[0.998478,0.000081634375,0.0005618497,0.00052573776,0.00015343189,0.00019936606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060179806,0.00018638905,0.00035494223,0.00030543658,0.00035430663,0.0006311904,0.00090971316,0.00009397744,0.0000052999526],"category_scores_gemma":[0.00011155002,0.00013643206,0.000052455336,0.00026456604,0.00018768816,0.0018702626,0.00060197816,0.00035437944,7.9395625e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059941376,0.0006781496,0.12790015,0.00020326972,0.00035869807,0.0026782004,0.0045257737,0.00020921661,0.01101855,0.0043460308,0.0061860555,0.8412965],"study_design_scores_gemma":[0.0054259417,0.0015681406,0.60412025,0.0008835257,0.00005539647,0.0009178726,0.00028713743,0.3674706,0.0006853658,0.01043059,0.0074185813,0.0007366259],"about_ca_topic_score_codex":0.00010594405,"about_ca_topic_score_gemma":0.000064838,"teacher_disagreement_score":0.84055984,"about_ca_system_score_codex":0.000018757648,"about_ca_system_score_gemma":0.00007284461,"threshold_uncertainty_score":0.60865843},"labels":[],"label_agreement":null},{"id":"W2766136522","doi":"10.1016/j.jda.2018.08.001","title":"Lyndon array construction during Burrows–Wheeler inversion","year":2018,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Inversion (geology); Representation (politics); Stack (abstract data type); Time complexity; Inverse; Parenthesis; Space (punctuation); String (physics)","score_opus":0.009784970311766398,"score_gpt":0.24248935677992522,"score_spread":0.23270438646815883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766136522","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.10876864,0.00027085413,0.8857996,0.0006926456,0.0030548822,0.000093061084,0.000007876948,0.00006182386,0.0012506144],"genre_scores_gemma":[0.4892099,0.0002061811,0.5074253,0.00022485536,0.0026809298,0.0000017597371,0.0000044141607,0.000023783809,0.00022284169],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99813604,0.00008719947,0.00053628156,0.0002764677,0.0006512593,0.00031276804],"domain_scores_gemma":[0.9983271,0.000039764425,0.0005603421,0.00045028512,0.0003965024,0.00022605903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038882793,0.00018567825,0.0002799779,0.00024996116,0.00029260493,0.00019597873,0.0008969621,0.00008329511,0.00008514944],"category_scores_gemma":[0.000048856407,0.0001408059,0.00015568259,0.00037691204,0.00015676169,0.0019984017,0.00025673665,0.00031416724,0.000050703507],"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.000520862,0.0004644278,0.0051158792,0.00015196795,0.0005140067,0.00065446296,0.004529148,0.00016477754,0.30367425,0.0052395156,0.0333949,0.6455758],"study_design_scores_gemma":[0.011473597,0.004651333,0.030611586,0.001631544,0.00021357743,0.0077043963,0.001487751,0.19782747,0.6220088,0.018880863,0.10105609,0.0024529777],"about_ca_topic_score_codex":0.00001850712,"about_ca_topic_score_gemma":0.0000014575697,"teacher_disagreement_score":0.6431228,"about_ca_system_score_codex":0.00008395124,"about_ca_system_score_gemma":0.00009156378,"threshold_uncertainty_score":0.5741898},"labels":[],"label_agreement":null},{"id":"W2898462080","doi":"10.1016/j.jda.2018.09.003","title":"String covering with optimal covers","year":2018,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Combinatorics; Mathematics; Computer science","score_opus":0.009639088027083973,"score_gpt":0.2480819542534558,"score_spread":0.23844286622637184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898462080","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.0415748,0.00016522843,0.95675427,0.00020569685,0.0006044328,0.000054835953,0.0000084364465,0.00003287107,0.00059946254],"genre_scores_gemma":[0.4545929,0.00005681951,0.54417056,0.00012817932,0.0009306954,0.0000010010165,0.000001637006,0.000017262588,0.00010095315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847114,0.000037279166,0.000363686,0.00022000993,0.00060695637,0.00030091903],"domain_scores_gemma":[0.99868125,0.00005470039,0.00039730445,0.0003809042,0.00028896844,0.00019687082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034466057,0.00016298504,0.00025139545,0.00014172128,0.0001712623,0.00026498374,0.0009701677,0.00004818826,0.000026042135],"category_scores_gemma":[0.000025810985,0.00010994105,0.00008805575,0.0003101792,0.000097410164,0.001832586,0.00030575678,0.00024510972,0.000016007993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011228878,0.0005982207,0.004294204,0.00009296722,0.0012068446,0.002837617,0.0059124543,0.01741388,0.014453791,0.023660604,0.02286393,0.9055426],"study_design_scores_gemma":[0.0066515496,0.011068888,0.00930548,0.0013151702,0.00016823101,0.0046146093,0.0009536905,0.7867134,0.06367407,0.0021934381,0.111495376,0.0018460616],"about_ca_topic_score_codex":0.000018122242,"about_ca_topic_score_gemma":0.0000015383073,"teacher_disagreement_score":0.90369654,"about_ca_system_score_codex":0.000056333858,"about_ca_system_score_gemma":0.0001352242,"threshold_uncertainty_score":0.4483266},"labels":[],"label_agreement":null},{"id":"W2900649734","doi":"10.1016/j.jda.2018.11.013","title":"Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction","year":2018,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compaction; Vertex (graph theory); Mathematical proof; Bipartite graph; Vertex cover; Mathematics; Computational complexity theory; Combinatorics; Computer science; Time complexity; Discrete mathematics; Graph; Algorithm; Geometry; Geology","score_opus":0.07855679433831916,"score_gpt":0.36484302836865035,"score_spread":0.28628623403033115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900649734","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.11765423,0.000104255814,0.87919044,0.0017336834,0.0006351074,0.00010722079,0.000011214008,0.0000482251,0.00051562884],"genre_scores_gemma":[0.8855678,0.000009535513,0.11382201,0.000057603535,0.0004697936,9.0743043e-7,0.0000064716523,0.000011460348,0.00005444541],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99784946,0.00027341518,0.0005867584,0.00024808812,0.00076696946,0.0002753173],"domain_scores_gemma":[0.99728197,0.00079247606,0.00052360876,0.00026812454,0.0008570186,0.00027678022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011280936,0.00016111242,0.00029530065,0.00041217342,0.0005100859,0.00020195723,0.00047092605,0.00009513235,0.000026245445],"category_scores_gemma":[0.0003188073,0.00014295238,0.00010379296,0.0006901513,0.00045050602,0.0020426968,0.00009731769,0.0006255083,0.000028778119],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043491067,0.0003446587,0.5392583,0.000088937224,0.0005903768,0.000067965615,0.0032760473,0.002609238,0.0005502099,0.35757074,0.011246719,0.08396193],"study_design_scores_gemma":[0.0006491966,0.0004488517,0.6083938,0.00003881334,0.000019299641,0.0003222918,0.000089072404,0.030266479,0.00019221017,0.35853252,0.0008920493,0.00015543356],"about_ca_topic_score_codex":0.000015506095,"about_ca_topic_score_gemma":0.000004432991,"teacher_disagreement_score":0.7679135,"about_ca_system_score_codex":0.00013786939,"about_ca_system_score_gemma":0.00011546899,"threshold_uncertainty_score":0.5829429},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2901207548","doi":"10.1016/j.jda.2018.11.007","title":"Exploring the median of permutations problem","year":2018,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Permutation (music); Combinatorics; Mathematics; Integer programming; Solver; Heuristic; Reduction (mathematics); Set (abstract data type); Integer (computer science); Vertex (graph theory); Function (biology); Space (punctuation); Computer science; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.07075268947540732,"score_gpt":0.3030294259198073,"score_spread":0.2322767364444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901207548","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.004489338,0.0001250111,0.98913234,0.0040991274,0.00063186843,0.000065010834,0.0000020357465,0.000008887758,0.0014463888],"genre_scores_gemma":[0.24937186,0.00007018973,0.74987227,0.000092367576,0.0005249081,0.000003270157,1.4585403e-7,0.000006525118,0.000058452486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884546,0.00012276758,0.00041017815,0.000105356696,0.00035199575,0.00016425987],"domain_scores_gemma":[0.9988234,0.00011963034,0.00034256425,0.00027640222,0.00034247228,0.00009552137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009160471,0.000086394204,0.00018141093,0.00010750939,0.00011191462,0.000060619746,0.0007957002,0.000022775677,0.000008334915],"category_scores_gemma":[0.000057965433,0.000048971888,0.00012905942,0.000331398,0.00012053919,0.0007743908,0.00009356067,0.00018179901,0.0000034831196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012187813,0.000058211266,0.00006227577,0.000020955787,0.00012559448,0.00002792984,0.0147864465,0.000032753036,0.0030744239,0.093447536,0.0010876511,0.887264],"study_design_scores_gemma":[0.0020995867,0.0030242016,0.009151404,0.00060272205,0.00022075788,0.0012399973,0.0014227184,0.12225896,0.06225866,0.783206,0.013729711,0.00078530563],"about_ca_topic_score_codex":0.000010635141,"about_ca_topic_score_gemma":0.000004235313,"teacher_disagreement_score":0.8864787,"about_ca_system_score_codex":0.000015946254,"about_ca_system_score_gemma":0.00010175288,"threshold_uncertainty_score":0.19970156},"labels":[],"label_agreement":null},{"id":"W2912383825","doi":"10.1016/j.jda.2012.10.001","title":"Indexing hypertext","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Search engine indexing; Hypertext; Graph; Generalization; Theoretical computer science; Information retrieval; World Wide Web; Mathematics","score_opus":0.018523307870755,"score_gpt":0.26859644792830023,"score_spread":0.2500731400575452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912383825","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.005524688,0.0030197415,0.98703307,0.0005319021,0.002071898,0.000051275067,0.000004371988,0.000034033546,0.0017289945],"genre_scores_gemma":[0.5220187,0.0001971372,0.47502995,0.00042763082,0.0020534182,0.0000018082094,0.000002855664,0.00002045682,0.00024808903],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840045,0.0000677532,0.00043878102,0.00012631174,0.00053670694,0.00042997603],"domain_scores_gemma":[0.9987,0.00007816092,0.00037159654,0.000370362,0.00013754731,0.0003423185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007642314,0.00014101037,0.00024811717,0.00015382386,0.00011628113,0.00013718152,0.000979159,0.00006464489,0.00004281416],"category_scores_gemma":[0.0000578226,0.000098379205,0.00014480563,0.0002640481,0.000031017917,0.0028509223,0.0003232523,0.00029222018,0.000041350217],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028780561,0.00039155525,0.004326594,0.000025764974,0.00017041995,0.00013653582,0.0022433314,0.000119770404,0.0027878468,0.01645482,0.025899753,0.9474148],"study_design_scores_gemma":[0.004895277,0.0014842977,0.05383761,0.0006469576,0.00016443661,0.0062965215,0.0008590096,0.18845318,0.013990485,0.012733638,0.7146239,0.002014646],"about_ca_topic_score_codex":0.000008276437,"about_ca_topic_score_gemma":2.2185012e-7,"teacher_disagreement_score":0.9454002,"about_ca_system_score_codex":0.000046045978,"about_ca_system_score_gemma":0.00006697736,"threshold_uncertainty_score":0.40117875},"labels":[],"label_agreement":null},{"id":"W4205254578","doi":"10.1016/j.jda.2011.12.002","title":"Number of holes in unavoidable sets of partial words II","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Winnipeg","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.020873642163818533,"score_gpt":0.26923992195902396,"score_spread":0.24836627979520542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205254578","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.927322,0.00038665094,0.06904751,0.00015027903,0.0005261613,0.00007690603,0.000010151527,0.000013945755,0.0024664325],"genre_scores_gemma":[0.9252632,0.000047407368,0.07453628,0.000032419925,0.000060282207,0.000001029067,3.6555414e-7,0.000007701955,0.00005127047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985178,0.00008899765,0.00069147255,0.00012838675,0.0003601732,0.00021318004],"domain_scores_gemma":[0.99884176,0.00005821864,0.00061119185,0.0002878185,0.00011529329,0.00008572828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077352964,0.000113537,0.00036493424,0.00013678633,0.0000311495,0.00001605511,0.0007769798,0.00006156501,0.00008212892],"category_scores_gemma":[0.00003747588,0.00008684577,0.00015110987,0.00033965972,0.00011032642,0.00060211297,0.00021179196,0.00018132228,0.0000032806186],"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.00079076143,0.0044845645,0.115694694,0.0004616781,0.00095523713,0.0011978666,0.07569915,0.0007770278,0.024063261,0.28469297,0.0037007695,0.487482],"study_design_scores_gemma":[0.009508225,0.004116552,0.13312402,0.0025143065,0.00020311803,0.0013581048,0.0039675976,0.118079446,0.42992675,0.29273242,0.0028487449,0.0016206976],"about_ca_topic_score_codex":0.00007448767,"about_ca_topic_score_gemma":0.0000033808897,"teacher_disagreement_score":0.48586133,"about_ca_system_score_codex":0.00002033768,"about_ca_system_score_gemma":0.000089137946,"threshold_uncertainty_score":0.35414678},"labels":[],"label_agreement":null},{"id":"W4205488725","doi":"10.1016/j.jda.2013.10.001","title":"Editorial","year":2013,"lang":"es","type":"editorial","venue":"Journal of Discrete Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.008067270375943267,"score_gpt":0.27886163531596386,"score_spread":0.27079436494002057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205488725","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001572717,0.0038404446,0.00034476316,0.00028787344,0.9900898,0.0007707866,0.0029426012,0.000085218824,0.0014812476],"genre_scores_gemma":[0.00007000698,0.003724158,0.0057192473,0.000020380123,0.9866629,0.000024040262,0.00035790072,0.0010206943,0.0024006523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9775924,0.0012527385,0.005644223,0.001114839,0.012287464,0.002108344],"domain_scores_gemma":[0.971605,0.0023700362,0.01243292,0.0014886352,0.010171489,0.0019318955],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0049394695,0.0022999048,0.0045070727,0.001856399,0.00045322228,0.0020879519,0.004197946,0.0048230886,0.0018477632],"category_scores_gemma":[0.007005454,0.0018804936,0.0030900203,0.0011658787,0.0008050499,0.0030961977,0.0007237318,0.010457901,0.011567083],"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.000975532,0.00041669095,0.000018777728,0.00025251822,0.0026292105,0.00026733804,0.00031833403,0.00005397347,0.00092070235,0.000025820817,0.99050254,0.003618584],"study_design_scores_gemma":[0.007100843,0.0034015838,0.000043654305,0.002152457,0.0025507677,0.00020523886,0.00029468126,0.00022933284,0.00022080618,0.00071874104,0.98117584,0.0019060804],"about_ca_topic_score_codex":0.00036263108,"about_ca_topic_score_gemma":0.000006630167,"teacher_disagreement_score":0.009719321,"about_ca_system_score_codex":0.0020095606,"about_ca_system_score_gemma":0.0049860463,"threshold_uncertainty_score":0.9990647},"labels":[],"label_agreement":null},{"id":"W4206204035","doi":"10.1016/j.jda.2015.02.001","title":"Editorial","year":2015,"lang":"es","type":"editorial","venue":"Journal of Discrete Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.014351432721081914,"score_gpt":0.3069957977380818,"score_spread":0.29264436501699986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206204035","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064404885,0.0060886876,0.00025025086,0.00023930879,0.98505306,0.0005220433,0.005484014,0.000085124215,0.0022130974],"genre_scores_gemma":[0.00005208126,0.0021283885,0.0044761035,0.000014625137,0.99024034,0.000009969567,0.00049983105,0.00096915814,0.001609535],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9735456,0.0014578656,0.0053092083,0.0010650405,0.016692707,0.001929591],"domain_scores_gemma":[0.9665709,0.001705586,0.011764269,0.0014357938,0.015925787,0.0025976356],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.010712595,0.0021768133,0.0046251407,0.0018465017,0.00033699026,0.0014194079,0.0040877224,0.0046738978,0.0003942883],"category_scores_gemma":[0.012434496,0.0018202064,0.0026761736,0.001359167,0.00078166334,0.0023555197,0.00076573924,0.010109202,0.0042941202],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027702076,0.00044514352,0.000016140075,0.00019277997,0.0024035906,0.0005907347,0.0005358955,0.00010764695,0.00030463148,0.000016436672,0.99040097,0.0022158157],"study_design_scores_gemma":[0.0102573745,0.004663385,0.000010903355,0.0019022516,0.0030758819,0.0002936393,0.00044893392,0.00015539795,0.0001063034,0.0011363949,0.97611624,0.0018333236],"about_ca_topic_score_codex":0.00017742252,"about_ca_topic_score_gemma":0.000011400558,"teacher_disagreement_score":0.014284766,"about_ca_system_score_codex":0.0033746501,"about_ca_system_score_gemma":0.011878969,"threshold_uncertainty_score":0.9996172},"labels":[],"label_agreement":null},{"id":"W4206899209","doi":"10.1016/j.jda.2018.11.015","title":"Editorial","year":2018,"lang":"es","type":"editorial","venue":"Journal of Discrete Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.009013054074208039,"score_gpt":0.29555590730432635,"score_spread":0.2865428532301183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206899209","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001352036,0.00247503,0.00046544167,0.00019252636,0.98978615,0.000512652,0.0046322634,0.00008533058,0.0017153976],"genre_scores_gemma":[0.00005991673,0.0024484817,0.006299128,0.000019510484,0.9882165,0.0000095113155,0.00035312792,0.0009966615,0.0015971519],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9774676,0.0012859949,0.0054353746,0.0012152544,0.012539196,0.0020565933],"domain_scores_gemma":[0.9704234,0.0020439127,0.012448781,0.0015929204,0.011777738,0.0017132317],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0075134174,0.0022020326,0.0042244615,0.0018771599,0.000568248,0.0015201936,0.0043410626,0.0048172628,0.0012741154],"category_scores_gemma":[0.008921716,0.0018423056,0.0031496345,0.001340958,0.001417718,0.0021403835,0.00077967474,0.00830772,0.0075140344],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026328815,0.00041045752,0.000020094161,0.0002178611,0.0027666695,0.00035457074,0.00043902668,0.000014144985,0.0006584594,0.000014458633,0.9908299,0.001641469],"study_design_scores_gemma":[0.007446389,0.006386646,0.000027637148,0.0025784757,0.0030545043,0.0002468057,0.00023563077,0.00012434136,0.00040608985,0.000711158,0.9769379,0.0018444438],"about_ca_topic_score_codex":0.00012821345,"about_ca_topic_score_gemma":0.000012565908,"teacher_disagreement_score":0.0138920285,"about_ca_system_score_codex":0.0020496098,"about_ca_system_score_gemma":0.006049986,"threshold_uncertainty_score":0.99963886},"labels":[],"label_agreement":null},{"id":"W4234500218","doi":"10.1016/j.jda.2012.07.002","title":"Editorial","year":2012,"lang":"es","type":"editorial","venue":"Journal of Discrete Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.010599725804860951,"score_gpt":0.29305331534219814,"score_spread":0.2824535895373372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234500218","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088688816,0.009566446,0.00039102446,0.0001641051,0.98366416,0.0005106612,0.004133095,0.000077658624,0.0014041469],"genre_scores_gemma":[0.00022056716,0.0033855233,0.0046544173,0.000015143406,0.9891532,0.000011840379,0.00040213214,0.0010331931,0.0011239594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97767687,0.0013660528,0.0052254824,0.00087928027,0.0122746015,0.0025777218],"domain_scores_gemma":[0.9751558,0.0023300142,0.012181317,0.0013939324,0.006583095,0.0023558955],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.008178298,0.0022224712,0.0042923884,0.0017498075,0.00046122147,0.0011085306,0.0036022593,0.0048259706,0.0010983904],"category_scores_gemma":[0.005924635,0.0018560451,0.003306587,0.0011576588,0.000731071,0.0032077595,0.00070597476,0.010480008,0.0057580383],"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.0017872746,0.0006305175,0.000071004004,0.0002720364,0.0027361594,0.00019189487,0.000527903,0.000026400146,0.0007792629,0.000030115703,0.98947257,0.0034748644],"study_design_scores_gemma":[0.006613651,0.0022849147,0.00007900053,0.0017576221,0.0042933337,0.00027811588,0.00025738176,0.000045383335,0.00025394798,0.00028331403,0.9819625,0.0018908125],"about_ca_topic_score_codex":0.00013055521,"about_ca_topic_score_gemma":0.0000058421338,"teacher_disagreement_score":0.0075100446,"about_ca_system_score_codex":0.0021861964,"about_ca_system_score_gemma":0.0042200577,"threshold_uncertainty_score":0.9999284},"labels":[],"label_agreement":null},{"id":"W4248679402","doi":"10.1016/j.jda.2004.04.010","title":"Editorial","year":2004,"lang":"es","type":"editorial","venue":"Journal of Discrete Algorithms","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.007218399082258171,"score_gpt":0.29535023212277245,"score_spread":0.28813183304051426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248679402","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005425033,0.001256583,0.3622487,0.00032746972,0.6355927,0.00016204613,0.00006271536,0.00008148687,0.0002629198],"genre_scores_gemma":[0.00013987397,0.0030530344,0.15322174,0.000032490218,0.8430799,0.0000067010837,0.000028640598,0.00010217984,0.00033543096],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98909485,0.00033747323,0.0029461945,0.0009487039,0.0056681093,0.0010046607],"domain_scores_gemma":[0.98790884,0.00081008225,0.0054643694,0.0014354141,0.0037175063,0.0006637889],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0022794716,0.0010975652,0.0023619458,0.001142554,0.00031134952,0.00113732,0.0053875432,0.0017676058,0.00005480864],"category_scores_gemma":[0.0017631466,0.00092129805,0.0019310977,0.0012657514,0.00036156696,0.0027997915,0.0009135308,0.0043248525,0.000084498315],"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.00008859282,0.00017779162,0.00000439336,0.00007800443,0.0006040254,0.00026872146,0.00024984212,0.00028219956,0.00017234289,0.00058884267,0.97958136,0.017903887],"study_design_scores_gemma":[0.0018693542,0.0017934414,0.00000842702,0.0012151764,0.0006092833,0.00009996269,0.000035903002,0.00055592955,0.0009450436,0.018394545,0.97347766,0.0009952475],"about_ca_topic_score_codex":0.000092634655,"about_ca_topic_score_gemma":0.000006707265,"teacher_disagreement_score":0.20902693,"about_ca_system_score_codex":0.0012929699,"about_ca_system_score_gemma":0.0033344016,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W4251513919","doi":"10.1016/j.jda.2012.03.005","title":"Editorial","year":2012,"lang":"es","type":"editorial","venue":"Journal of Discrete Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.010599725804860951,"score_gpt":0.29305331534219814,"score_spread":0.2824535895373372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251513919","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088688816,0.009566446,0.00039102446,0.0001641051,0.98366416,0.0005106612,0.004133095,0.000077658624,0.0014041469],"genre_scores_gemma":[0.00022056716,0.0033855233,0.0046544173,0.000015143406,0.9891532,0.000011840379,0.00040213214,0.0010331931,0.0011239594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97767687,0.0013660528,0.0052254824,0.00087928027,0.0122746015,0.0025777218],"domain_scores_gemma":[0.9751558,0.0023300142,0.012181317,0.0013939324,0.006583095,0.0023558955],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.008178298,0.0022224712,0.0042923884,0.0017498075,0.00046122147,0.0011085306,0.0036022593,0.0048259706,0.0010983904],"category_scores_gemma":[0.005924635,0.0018560451,0.003306587,0.0011576588,0.000731071,0.0032077595,0.00070597476,0.010480008,0.0057580383],"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.0017872746,0.0006305175,0.000071004004,0.0002720364,0.0027361594,0.00019189487,0.000527903,0.000026400146,0.0007792629,0.000030115703,0.98947257,0.0034748644],"study_design_scores_gemma":[0.006613651,0.0022849147,0.00007900053,0.0017576221,0.0042933337,0.00027811588,0.00025738176,0.000045383335,0.00025394798,0.00028331403,0.9819625,0.0018908125],"about_ca_topic_score_codex":0.00013055521,"about_ca_topic_score_gemma":0.0000058421338,"teacher_disagreement_score":0.0075100446,"about_ca_system_score_codex":0.0021861964,"about_ca_system_score_gemma":0.0042200577,"threshold_uncertainty_score":0.9999284},"labels":[],"label_agreement":null},{"id":"W4251560973","doi":"10.1016/j.jda.2011.08.004","title":"Editorial","year":2011,"lang":"es","type":"editorial","venue":"Journal of Discrete Algorithms","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.013373288548428322,"score_gpt":0.28215627518096387,"score_spread":0.2687829866325355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251560973","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006899725,0.0039089797,0.00044834125,0.000081070786,0.9877464,0.0005218607,0.0037489545,0.00008516928,0.0033901897],"genre_scores_gemma":[0.0000843555,0.004172115,0.0059995763,0.000014289924,0.98696506,0.000011883751,0.00027419336,0.0010231329,0.0014553673],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98002255,0.0012398805,0.005465898,0.0011219657,0.010141289,0.0020084223],"domain_scores_gemma":[0.9744382,0.0015828423,0.012737826,0.0015183174,0.0079398,0.00178302],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0061945766,0.0022455726,0.0043767155,0.0019414619,0.0004293385,0.00094367453,0.0044220746,0.004817568,0.0013872078],"category_scores_gemma":[0.0058653974,0.0018832001,0.0034280214,0.0011215454,0.00087618496,0.0022626964,0.0007228928,0.0102494,0.0049786135],"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.002904403,0.0005745773,0.000029903475,0.00023917078,0.0029766222,0.0005562401,0.00074436096,0.000012370243,0.00045085655,0.0000484884,0.98882496,0.002638062],"study_design_scores_gemma":[0.0070964587,0.004455889,0.0000508127,0.0021726512,0.0035387913,0.00025532264,0.00025506216,0.0000419279,0.00037402916,0.0011412844,0.97871155,0.001906235],"about_ca_topic_score_codex":0.00030822092,"about_ca_topic_score_gemma":0.000012717178,"teacher_disagreement_score":0.01011341,"about_ca_system_score_codex":0.0015801857,"about_ca_system_score_gemma":0.005433927,"threshold_uncertainty_score":0.99952567},"labels":[],"label_agreement":null},{"id":"W974563791","doi":"10.1016/j.jda.2015.05.013","title":"On the hardness of full Steiner tree problems","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Gomory–Hu tree; Vertex (graph theory); K-ary tree; Tree (set theory); Time complexity; Approximation algorithm; Discrete mathematics; Bottleneck; Graph; Tree structure; Binary tree; Computer science","score_opus":0.052736863236860866,"score_gpt":0.2655842799530101,"score_spread":0.21284741671614923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W974563791","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.033180445,0.0012507543,0.94447124,0.01037123,0.0035947126,0.0003504189,0.00002120845,0.00005521369,0.006704769],"genre_scores_gemma":[0.8159813,0.00012518505,0.18072246,0.00085429504,0.0011393744,0.000014706561,0.0000027608594,0.000048697722,0.0011111877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977619,0.0001703008,0.00063361775,0.00018709271,0.000982573,0.00026452966],"domain_scores_gemma":[0.997887,0.00021854482,0.00062554673,0.0005722647,0.0004947284,0.0002018991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013927238,0.0001812732,0.00035770732,0.00019401402,0.00008656254,0.0001248033,0.001761891,0.000058257654,0.000018411534],"category_scores_gemma":[0.00017629238,0.00010337023,0.00026435012,0.00055996206,0.00015414624,0.00050863525,0.00023583313,0.00038365068,0.000012365349],"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.000378258,0.0014600937,0.00043638796,0.000133951,0.0009195708,0.00034501855,0.011272628,0.0058279037,0.0031640176,0.51051325,0.08468693,0.38086203],"study_design_scores_gemma":[0.006695556,0.010262353,0.0026557227,0.0010576221,0.0001672233,0.0015966244,0.0017575885,0.29939708,0.0084732445,0.6184933,0.048153106,0.0012905838],"about_ca_topic_score_codex":0.00001641097,"about_ca_topic_score_gemma":0.000006491017,"teacher_disagreement_score":0.7828009,"about_ca_system_score_codex":0.00004155469,"about_ca_system_score_gemma":0.00016776123,"threshold_uncertainty_score":0.42153156},"labels":[],"label_agreement":null},{"id":"W982892443","doi":"10.1016/j.jda.2015.05.006","title":"On a lemma of Crochemore and Rytter","year":2015,"lang":"de","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Lemma (botany); Generalization; Mathematics; Combinatorics; Position (finance); Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.02995527514708905,"score_gpt":0.28109114939238333,"score_spread":0.25113587424529427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W982892443","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.15341513,0.042418506,0.7829149,0.008021551,0.010740229,0.0005249222,0.00030853134,0.000045911205,0.001610355],"genre_scores_gemma":[0.63243806,0.0026058888,0.3566302,0.0015612391,0.005685927,0.0000044631233,0.000028978337,0.00011288036,0.0009323918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969624,0.00016179697,0.0009887945,0.00035489365,0.0011608127,0.00037126557],"domain_scores_gemma":[0.9968602,0.0001751432,0.0011612223,0.00058996363,0.00063325814,0.0005802302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010069144,0.00031999644,0.00069215905,0.00027933356,0.00008711681,0.00023250429,0.0010047817,0.00016530849,0.000028353095],"category_scores_gemma":[0.00019283881,0.00023261912,0.00021253132,0.00031661591,0.0002079146,0.0009514901,0.00058953,0.0005535024,0.000029585759],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015706344,0.0017042977,0.0016821136,0.00047238462,0.0014149068,0.002342054,0.0140187,0.0010540232,0.0022073002,0.008675102,0.25638157,0.7084769],"study_design_scores_gemma":[0.026612503,0.027033819,0.011899858,0.0077791964,0.0013345979,0.003274347,0.0027254631,0.64554197,0.023279764,0.06351226,0.1836017,0.0034045207],"about_ca_topic_score_codex":0.00003618547,"about_ca_topic_score_gemma":7.561487e-7,"teacher_disagreement_score":0.7050724,"about_ca_system_score_codex":0.00006310073,"about_ca_system_score_gemma":0.00031371528,"threshold_uncertainty_score":0.94859326},"labels":[],"label_agreement":null}]}