{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3918485,0.0044468683,0.47631973,0.033148523,0.0010472109,0.00042965933,0.004676363,0.002087002,0.08599612],"genre_scores_gemma":[0.8498493,0.0017789343,0.12462864,0.0013917547,0.00093443965,0.00042814907,0.0032269575,0.0010364281,0.016725445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917561,0.0026955456,0.00056798814,0.0010064116,0.0032055103,0.00076853856],"domain_scores_gemma":[0.93032795,0.05713623,0.0018497482,0.0074719223,0.0021478734,0.0010662548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004147049,0.00087531167,0.0019684976,0.002013814,0.0025000835,0.0075044595,0.0040413965,0.003524624,0.021785038],"category_scores_gemma":[0.052541386,0.0013466958,0.001799657,0.005152078,0.0035735115,0.01990876,0.005081049,0.0047856234,0.0023872603],"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.0017934322,0.00036663187,0.0064947647,0.00062126626,0.00020737007,0.0004789807,0.00078961306,0.28004843,0.006856428,0.47999388,0.03989146,0.18245773],"study_design_scores_gemma":[0.00013271911,0.00006628749,0.0010917058,0.000047996495,0.00008312561,0.00027146717,0.00020442034,0.5213436,0.0025713067,0.47027093,0.003873803,0.000042741558],"about_ca_topic_score_codex":0.0031200454,"about_ca_topic_score_gemma":0.003923688,"teacher_disagreement_score":0.021785038,"about_ca_system_score_codex":0.004306825,"about_ca_system_score_gemma":0.004124241,"threshold_uncertainty_score":0.07287824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34754875,0.0060040215,0.5424311,0.00912511,0.0012390984,0.0001472947,0.00049065374,0.00039004782,0.09262388],"genre_scores_gemma":[0.969909,0.0014786847,0.020336436,0.0005630679,0.00069918396,0.00009172715,0.00015067308,0.000090554975,0.0066807396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471855,0.0018786149,0.00033842734,0.0011023136,0.0016291302,0.00033287844],"domain_scores_gemma":[0.95252496,0.031986054,0.003268065,0.0061027138,0.003787502,0.0023307477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048696143,0.00062077364,0.0020565228,0.003279599,0.0026710809,0.0048943087,0.002053822,0.0030861117,0.0074504316],"category_scores_gemma":[0.055254232,0.0010601731,0.0007848664,0.0021817219,0.0074831587,0.012486378,0.007755636,0.00387575,0.001005652],"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.00027133743,0.000054237942,0.002264705,0.00023337985,0.00007755576,0.00022591946,0.00042766175,0.009473574,0.0029285054,0.954502,0.001998402,0.027542725],"study_design_scores_gemma":[0.000054922897,0.00018104681,0.0011781161,0.000048574053,0.00006191741,0.00048104965,0.00031139332,0.03821487,0.0019316172,0.9516872,0.0057993247,0.000050019746],"about_ca_topic_score_codex":0.00044368135,"about_ca_topic_score_gemma":0.00029713436,"teacher_disagreement_score":0.0074504316,"about_ca_system_score_codex":0.00076126703,"about_ca_system_score_gemma":0.00082711276,"threshold_uncertainty_score":0.02575326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31557995,0.00029588165,0.66220087,0.00015302736,0.00014696078,0.00006415852,0.00018893438,0.00024959218,0.021120744],"genre_scores_gemma":[0.79438597,0.0005128542,0.16556206,0.00013775771,0.00013835123,0.00020599258,0.0006245007,0.0002962364,0.03813622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990834,0.00016761136,0.000077717006,0.0001756346,0.00040151048,0.00009412893],"domain_scores_gemma":[0.9981029,0.00071668986,0.0002683718,0.00026079747,0.00037178455,0.0002793709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070064235,0.0007221234,0.0009660251,0.002390615,0.00071183866,0.0018338994,0.0015502557,0.00078014145,0.0068770302],"category_scores_gemma":[0.0038296354,0.00067692745,0.0006662221,0.0015805658,0.0011304315,0.0026773748,0.003861799,0.0016105014,0.00088308245],"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.00014348085,0.00009545861,0.0012714386,0.000101993806,0.000058539397,0.00025338473,0.0003205042,0.033893704,0.00788182,0.8977743,0.0013559812,0.056849413],"study_design_scores_gemma":[0.000016130489,0.000119962366,0.0007557758,0.000039552942,0.00003571583,0.00034504003,0.00017238967,0.15447582,0.0043969536,0.8345767,0.005044792,0.00002105637],"about_ca_topic_score_codex":0.00032150184,"about_ca_topic_score_gemma":0.00058828684,"teacher_disagreement_score":0.0068770302,"about_ca_system_score_codex":0.00036778636,"about_ca_system_score_gemma":0.00023394212,"threshold_uncertainty_score":0.023005962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5336827,0.0010846287,0.4489218,0.0008023939,0.00017025803,0.00012666799,0.0011726615,0.0013358834,0.012703051],"genre_scores_gemma":[0.7430601,0.00025955358,0.24933974,0.000091004804,0.00009139698,0.0001094987,0.0017030635,0.00030891466,0.005036681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968196,0.0010803571,0.00022466714,0.0006704393,0.00086041953,0.00034436234],"domain_scores_gemma":[0.9893959,0.0064006853,0.0007961984,0.002057711,0.00077388337,0.00057564594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023441636,0.00078972225,0.0019569434,0.0028101078,0.0015513572,0.003918762,0.0027930972,0.0013514883,0.005507273],"category_scores_gemma":[0.022014959,0.00074120774,0.0008486394,0.003139763,0.0016735571,0.007323517,0.0027702188,0.0016080122,0.0011468438],"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.0029320335,0.00033774594,0.025244689,0.00061985495,0.00025802647,0.00027747295,0.0010891764,0.18370491,0.015855707,0.42765653,0.012034566,0.32998934],"study_design_scores_gemma":[0.00010066783,0.0002006367,0.0032110768,0.00005804201,0.00007558851,0.00031777687,0.00032528685,0.60778,0.00804854,0.3752107,0.0046186512,0.00005297764],"about_ca_topic_score_codex":0.0025983662,"about_ca_topic_score_gemma":0.0050147837,"teacher_disagreement_score":0.005507273,"about_ca_system_score_codex":0.0015244822,"about_ca_system_score_gemma":0.0015044629,"threshold_uncertainty_score":0.018423617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046429066,0.00044825792,0.99240863,0.0003440484,0.000071438044,0.000019445584,0.000021088126,0.00015350828,0.001890707],"genre_scores_gemma":[0.19295046,0.00096069276,0.7947341,0.00040161607,0.00024801298,0.00026118683,0.0002519366,0.00074617134,0.009445822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701285,0.001599327,0.00014113652,0.0005770998,0.00047752663,0.0001921312],"domain_scores_gemma":[0.98343855,0.0127319805,0.0005479642,0.0018557411,0.0009900836,0.0004357234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006960535,0.0020030064,0.0029968824,0.0018161694,0.0011942652,0.0030555746,0.0050775483,0.00415684,0.008459986],"category_scores_gemma":[0.030716585,0.0015064267,0.0018788985,0.0031463664,0.003425843,0.006812999,0.004508922,0.0075095645,0.00139025],"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.00029932384,0.00018026964,0.0006625327,0.00026449864,0.00016352897,0.00010739941,0.00027697085,0.40781102,0.0015433978,0.45441705,0.005234779,0.12903914],"study_design_scores_gemma":[0.000034334545,0.00004653618,0.00009491832,0.0000353069,0.00002335035,0.000041122865,0.000029568944,0.7858253,0.00043589706,0.21195216,0.0014604663,0.000021045831],"about_ca_topic_score_codex":0.0030530917,"about_ca_topic_score_gemma":0.0023967365,"teacher_disagreement_score":0.008459986,"about_ca_system_score_codex":0.0019365575,"about_ca_system_score_gemma":0.0020355114,"threshold_uncertainty_score":0.036811292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3647443,0.00053673185,0.577274,0.000576272,0.00020212425,0.00010009446,0.0002831445,0.00031660052,0.05596671],"genre_scores_gemma":[0.88463455,0.0007597167,0.07541422,0.0003034831,0.00014451407,0.00011533649,0.00054959004,0.0002934275,0.03778526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.00013698191,0.000024113251,0.00010054291,0.0001887288,0.00010105663],"domain_scores_gemma":[0.9985876,0.0006339761,0.0001921169,0.00019061202,0.00016750119,0.00022825044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059589726,0.0010963801,0.0010840523,0.0013878915,0.0008515461,0.0014091582,0.00137437,0.0011335787,0.010599563],"category_scores_gemma":[0.0033507103,0.00059893104,0.0005604401,0.0011464303,0.0017046527,0.002816296,0.005610228,0.0017473749,0.00136866],"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.00023858312,0.000075781485,0.0009334977,0.00010534941,0.000027616421,0.00022841724,0.00023876909,0.09049388,0.004813084,0.86970127,0.002728547,0.030415174],"study_design_scores_gemma":[0.00003292771,0.00010665465,0.00042806784,0.000044961584,0.000015926367,0.00016880101,0.00021991778,0.22297075,0.0019486365,0.76961565,0.004430403,0.000017248633],"about_ca_topic_score_codex":0.00057578133,"about_ca_topic_score_gemma":0.0008725625,"teacher_disagreement_score":0.010599563,"about_ca_system_score_codex":0.0004689088,"about_ca_system_score_gemma":0.0002635286,"threshold_uncertainty_score":0.03545904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044606633,0.006032674,0.8729165,0.01867837,0.0012080731,0.0003280895,0.0018587626,0.001974725,0.05239624],"genre_scores_gemma":[0.45328483,0.006171632,0.48429695,0.0062492965,0.0028501966,0.0016052367,0.00627805,0.0029717055,0.03629202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942772,0.0015886159,0.00019107704,0.0010181672,0.0017529072,0.0011720603],"domain_scores_gemma":[0.9475352,0.042211007,0.0014025553,0.0040302547,0.0022587932,0.0025621818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061273267,0.0030000925,0.00459135,0.0035033138,0.0034935377,0.008299644,0.010018554,0.007656091,0.033460267],"category_scores_gemma":[0.049448743,0.001588647,0.0026905816,0.0054956875,0.0040731,0.016030155,0.00910792,0.016426183,0.0054185675],"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.0023154065,0.0010179946,0.0029707775,0.0014074622,0.00035546516,0.00030388398,0.0007748288,0.26114145,0.0065913545,0.4486678,0.08727141,0.18718229],"study_design_scores_gemma":[0.00036764002,0.0002454777,0.00075650244,0.00016996189,0.00016971827,0.0002813302,0.00020286087,0.48232123,0.0016684509,0.5016749,0.012088158,0.000053809425],"about_ca_topic_score_codex":0.0022458448,"about_ca_topic_score_gemma":0.002952251,"teacher_disagreement_score":0.033460267,"about_ca_system_score_codex":0.0045267213,"about_ca_system_score_gemma":0.0036448785,"threshold_uncertainty_score":0.111935735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03934045,0.0005151319,0.95422333,0.00065730285,0.00040366856,0.00018293314,0.0001991556,0.0034533383,0.0010246673],"genre_scores_gemma":[0.47219878,0.00028102848,0.52177596,0.0005053033,0.00059040065,0.00017081633,0.00040744425,0.00038257433,0.003687681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9831818,0.0038591458,0.0012588085,0.0027272664,0.0075444607,0.0014286074],"domain_scores_gemma":[0.91841644,0.03460334,0.005381151,0.025249006,0.014328245,0.002021872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007166964,0.0022015832,0.0038867856,0.004129326,0.002368401,0.0036116112,0.005459153,0.0044773933,0.0023239385],"category_scores_gemma":[0.053455662,0.0010834814,0.0015267528,0.0050929543,0.0019861432,0.007415024,0.0047725355,0.0046604313,0.0018295228],"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.0039669587,0.0016241055,0.023852687,0.00042892862,0.0005829383,0.001194869,0.00044557048,0.11845912,0.07478388,0.021397667,0.0120120095,0.74125135],"study_design_scores_gemma":[0.00008618236,0.00037656265,0.001655901,0.000027999604,0.00016912546,0.001401604,0.00007906788,0.9378824,0.045006756,0.01049717,0.0027215176,0.00009564423],"about_ca_topic_score_codex":0.0028308842,"about_ca_topic_score_gemma":0.005722164,"teacher_disagreement_score":0.007166964,"about_ca_system_score_codex":0.0014481581,"about_ca_system_score_gemma":0.0054625273,"threshold_uncertainty_score":0.03790301},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3572493,0.004157692,0.19069901,0.13238424,0.0033882533,0.00015148328,0.0020542154,0.0015809147,0.30833492],"genre_scores_gemma":[0.89010173,0.0022429067,0.033472665,0.012243608,0.0024070577,0.00022991218,0.0017135352,0.0004912493,0.057097297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720263,0.0007377121,0.00014011656,0.00079489994,0.00058221107,0.0005423575],"domain_scores_gemma":[0.98120075,0.0127372295,0.0006865937,0.0031145012,0.0014513067,0.00080952834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041012415,0.0008256815,0.0025572402,0.0018033863,0.0047646128,0.008159439,0.002724555,0.005782771,0.026244357],"category_scores_gemma":[0.02525836,0.0009819841,0.0013648974,0.0037982645,0.009561608,0.030406564,0.0056111696,0.0071349274,0.0034746279],"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.00014947649,0.00005037589,0.000487018,0.00006573489,0.000012162306,0.0000645462,0.00024902666,0.0014031115,0.00024049732,0.9816297,0.009293138,0.006355184],"study_design_scores_gemma":[0.0000275113,0.000005210781,0.00007676124,0.000012546414,0.0000057828734,0.000034749428,0.00010915343,0.0019267092,0.00008922464,0.99487287,0.002831427,0.000007956807],"about_ca_topic_score_codex":0.0024323866,"about_ca_topic_score_gemma":0.0024892278,"teacher_disagreement_score":0.026244357,"about_ca_system_score_codex":0.0026485047,"about_ca_system_score_gemma":0.0020258692,"threshold_uncertainty_score":0.08779615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1733579,0.00318343,0.7733056,0.010105918,0.0006189403,0.00015300894,0.00085661665,0.000437077,0.037981544],"genre_scores_gemma":[0.75307405,0.0021888546,0.22211622,0.0013566699,0.0016837212,0.00049485505,0.0008638837,0.0005988346,0.017622849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562055,0.0015615743,0.00034010276,0.00101225,0.0008234877,0.000641973],"domain_scores_gemma":[0.974171,0.017637054,0.0019311875,0.001973017,0.0019507735,0.0023370024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064853993,0.0018360933,0.0032267035,0.002128903,0.0027396895,0.005301726,0.0042875563,0.0029685097,0.007080621],"category_scores_gemma":[0.029133426,0.00102722,0.002878218,0.0026804833,0.0042872876,0.016159512,0.0069592926,0.0073852357,0.0004122863],"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.00027234235,0.00014543679,0.0006860752,0.00023099314,0.00009107123,0.0000748873,0.00027231974,0.017463304,0.0011442201,0.956715,0.0043238956,0.018580498],"study_design_scores_gemma":[0.00003617325,0.00010455574,0.00037943549,0.00003553173,0.000039561543,0.00013771564,0.00016571044,0.05457368,0.0009252055,0.94170254,0.0018758778,0.000023988654],"about_ca_topic_score_codex":0.0006153596,"about_ca_topic_score_gemma":0.0006660358,"teacher_disagreement_score":0.007080621,"about_ca_system_score_codex":0.0024056218,"about_ca_system_score_gemma":0.0017125818,"threshold_uncertainty_score":0.03429848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11552886,0.0008871911,0.8767895,0.00045461667,0.00025074923,0.00013017647,0.00032352135,0.0018769873,0.0037584275],"genre_scores_gemma":[0.52758205,0.00053926354,0.46314615,0.00024893024,0.0001486687,0.00016119807,0.00071733864,0.00027703622,0.0071793688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980718,0.00043989343,0.00019523615,0.00033995262,0.0007791488,0.00017389406],"domain_scores_gemma":[0.9954626,0.002341243,0.00028424256,0.0013222593,0.0004872645,0.00010246248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010493146,0.0005697957,0.0012619958,0.0016965178,0.00064364634,0.0012675425,0.0013227339,0.0012742686,0.0036748094],"category_scores_gemma":[0.009190893,0.00040721,0.00047168822,0.003994023,0.00071661366,0.003652381,0.0021645897,0.0010553236,0.0012565646],"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.001265356,0.00015188302,0.0015908397,0.00030779632,0.000059803886,0.0004670441,0.00016368623,0.03658244,0.028780794,0.061713077,0.0066079865,0.86230934],"study_design_scores_gemma":[0.00014446683,0.00030853174,0.00080823875,0.00005788196,0.000043677348,0.00084446924,0.00011016661,0.7271944,0.046973445,0.21695122,0.006526851,0.000036592555],"about_ca_topic_score_codex":0.0005258284,"about_ca_topic_score_gemma":0.0006320143,"teacher_disagreement_score":0.0036748094,"about_ca_system_score_codex":0.00040890698,"about_ca_system_score_gemma":0.0006175275,"threshold_uncertainty_score":0.012293458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3547211,0.0006125129,0.6271235,0.002120753,0.00017638048,0.0005531893,0.0009917769,0.0029805878,0.010720276],"genre_scores_gemma":[0.61434793,0.00023848913,0.37711906,0.00031971265,0.00009555635,0.00027997672,0.0017928807,0.00056316,0.005243262],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684167,0.0006590124,0.00022576709,0.0009278961,0.0008385826,0.0005070017],"domain_scores_gemma":[0.98496246,0.010933588,0.0010571947,0.0017859541,0.000746987,0.0005137836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017314727,0.0015843231,0.0028727313,0.0018727204,0.002321799,0.0033566724,0.003266783,0.0030351027,0.01229786],"category_scores_gemma":[0.013134344,0.0013578798,0.002566327,0.0026539492,0.0019381099,0.007494944,0.0044221766,0.0021994696,0.0018573462],"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.0055309082,0.0014806899,0.011029085,0.0016112892,0.00063727057,0.0010037593,0.0014506223,0.36617428,0.034978025,0.12002685,0.017032675,0.43904462],"study_design_scores_gemma":[0.000837263,0.00042608383,0.00091491616,0.00005176728,0.00017960033,0.00054922857,0.0005610787,0.70554274,0.013360154,0.2743585,0.0031603358,0.000058350353],"about_ca_topic_score_codex":0.0017907524,"about_ca_topic_score_gemma":0.0046542636,"teacher_disagreement_score":0.01229786,"about_ca_system_score_codex":0.0021025995,"about_ca_system_score_gemma":0.002899548,"threshold_uncertainty_score":0.041140497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67327356,0.0003777743,0.31683332,0.0008719206,0.00006991861,0.00013702149,0.0011427809,0.0007855619,0.0065081385],"genre_scores_gemma":[0.8448274,0.00018587538,0.15054831,0.00006299851,0.00004976155,0.000049047005,0.0014066919,0.00026838927,0.002601596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995869,0.00009687208,0.000016607746,0.00012818762,0.000090302114,0.00008117326],"domain_scores_gemma":[0.99727196,0.0018846671,0.0002220166,0.00022811913,0.00015928516,0.0002338339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046172293,0.0006208562,0.0013263065,0.0013016708,0.0009494174,0.0016886065,0.0012702438,0.0013320924,0.004272192],"category_scores_gemma":[0.005093167,0.0008481442,0.0009469638,0.0013103,0.0011307934,0.002268892,0.0013207695,0.0010020388,0.00040239657],"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.0020872026,0.00049096247,0.015886424,0.00073652173,0.00033072545,0.0009923042,0.00091941765,0.72657514,0.026566653,0.06394501,0.0113426605,0.15012698],"study_design_scores_gemma":[0.00007787602,0.000083142215,0.0017088702,0.000019711824,0.000036099747,0.00010424572,0.00021025143,0.9450856,0.0033869187,0.047940813,0.0013311423,0.00001540231],"about_ca_topic_score_codex":0.0068848305,"about_ca_topic_score_gemma":0.011036671,"teacher_disagreement_score":0.0068848305,"about_ca_system_score_codex":0.0006423551,"about_ca_system_score_gemma":0.0008423874,"threshold_uncertainty_score":0.0142918825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03756061,0.00070682215,0.93192446,0.002602156,0.0006258404,0.00031022515,0.00049204996,0.0028391771,0.02293877],"genre_scores_gemma":[0.15546557,0.0003725127,0.832815,0.0008450143,0.00014349555,0.0002963378,0.0007730968,0.00051633554,0.008772741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902046,0.00019061772,0.00007390125,0.00032980106,0.00018242915,0.00020266918],"domain_scores_gemma":[0.99865615,0.00045298226,0.00007205985,0.00051141006,0.00018309994,0.00012425441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008918062,0.0014745108,0.0015891243,0.0011036615,0.0017504625,0.0025237817,0.00321874,0.0033548798,0.018647464],"category_scores_gemma":[0.0040559303,0.000703257,0.0015661421,0.0019652608,0.0011501088,0.0060075405,0.0030013751,0.002906608,0.0023918664],"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.001457462,0.00077006593,0.0011688927,0.0010444255,0.00025386113,0.00025011995,0.00046231036,0.07261342,0.021139052,0.17851052,0.049712237,0.6726177],"study_design_scores_gemma":[0.0009401681,0.0005444611,0.001325062,0.0001786792,0.00034714572,0.0008586496,0.00046311837,0.48420414,0.018691389,0.44978034,0.04251968,0.00014724588],"about_ca_topic_score_codex":0.0021346714,"about_ca_topic_score_gemma":0.004028137,"teacher_disagreement_score":0.018647464,"about_ca_system_score_codex":0.001691531,"about_ca_system_score_gemma":0.0022698021,"threshold_uncertainty_score":0.062381983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059914894,0.010950686,0.8820861,0.005143646,0.0009889442,0.0001261324,0.0009791693,0.0014234075,0.038386997],"genre_scores_gemma":[0.68680125,0.013070188,0.24692842,0.0017410048,0.001573812,0.00034623814,0.0018951336,0.0007085711,0.04693528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993087,0.00022530332,0.000037819307,0.00013656505,0.00023448002,0.000057180656],"domain_scores_gemma":[0.9975127,0.001433337,0.00016305086,0.0005200722,0.00025120066,0.000119666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006656938,0.00059895386,0.0008734106,0.0020693266,0.000853963,0.0029494185,0.0011088342,0.0013575488,0.00921118],"category_scores_gemma":[0.006405223,0.0004671873,0.00046159135,0.0039732303,0.0019267503,0.006023439,0.0015751708,0.0024415907,0.0013092858],"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.0001444614,0.0000510277,0.0003896558,0.00018092684,0.000019493269,0.00007042346,0.0001212202,0.023014754,0.0015842409,0.79609007,0.01250753,0.16582619],"study_design_scores_gemma":[0.00001684137,0.000022155686,0.00011261623,0.000028077775,0.0000090984,0.00008390561,0.00003659274,0.03835446,0.001117795,0.9494461,0.0107618645,0.000010533946],"about_ca_topic_score_codex":0.00074278703,"about_ca_topic_score_gemma":0.0008905101,"teacher_disagreement_score":0.00921118,"about_ca_system_score_codex":0.00095880823,"about_ca_system_score_gemma":0.0007342681,"threshold_uncertainty_score":0.030814469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37216672,0.00044649676,0.60203224,0.000563829,0.0002797421,0.00026007922,0.00030334952,0.0010748069,0.02287266],"genre_scores_gemma":[0.72930765,0.00048386463,0.2606551,0.000082202285,0.00006276301,0.00018809114,0.00037521828,0.00024080269,0.008604327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941945,0.000115068215,0.00004691936,0.00012262436,0.00016756335,0.000128477],"domain_scores_gemma":[0.9991302,0.00033437202,0.00010153722,0.00024742764,0.000053232277,0.0001332939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028259607,0.0008710166,0.0014018974,0.0011572085,0.0014148989,0.0018563722,0.0017457919,0.0014364887,0.0066378764],"category_scores_gemma":[0.0019259023,0.00096992566,0.0006802194,0.0023496724,0.0010189571,0.0021325275,0.005218989,0.0011128352,0.0015313639],"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.0023385782,0.0007375616,0.0029772616,0.0005159406,0.00013817384,0.0041063842,0.0010458131,0.6999426,0.04243101,0.080906555,0.006567527,0.15829262],"study_design_scores_gemma":[0.0002668763,0.00058391073,0.0006152907,0.000056060642,0.00006299467,0.000660352,0.0006354369,0.8968417,0.017308556,0.07043804,0.012480206,0.000050678842],"about_ca_topic_score_codex":0.0009321163,"about_ca_topic_score_gemma":0.0007930933,"teacher_disagreement_score":0.0066378764,"about_ca_system_score_codex":0.00036032993,"about_ca_system_score_gemma":0.00037127818,"threshold_uncertainty_score":0.02220589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13237433,0.00049091724,0.81790143,0.0012767155,0.0003553582,0.0001211441,0.00027130812,0.00062291545,0.046585806],"genre_scores_gemma":[0.71750283,0.0010985457,0.23552072,0.00052496494,0.00027814019,0.00026197618,0.0003327947,0.00035479027,0.0441253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995546,0.000110393536,0.000017409418,0.000099310455,0.00013761934,0.00008066772],"domain_scores_gemma":[0.9986625,0.00051279395,0.00016391552,0.00025105505,0.00022338584,0.00018634902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005826509,0.0005090718,0.0006878298,0.0011757873,0.0008491033,0.0016960972,0.001055393,0.0010279381,0.008426369],"category_scores_gemma":[0.0036260034,0.00051966036,0.00038047894,0.00089154294,0.0012295821,0.0029207477,0.0030200994,0.0014789454,0.0011240115],"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.00028607546,0.00007788584,0.0005509455,0.000112099464,0.000026001206,0.00012062803,0.00014618783,0.07102289,0.008394357,0.82240164,0.007032588,0.08982883],"study_design_scores_gemma":[0.000054662596,0.00007077132,0.00032461068,0.000026581974,0.000020755953,0.00017328156,0.000108432374,0.51008767,0.0042472617,0.47302866,0.011832129,0.000025183634],"about_ca_topic_score_codex":0.0010339061,"about_ca_topic_score_gemma":0.0013597771,"teacher_disagreement_score":0.008426369,"about_ca_system_score_codex":0.0009937808,"about_ca_system_score_gemma":0.00052039843,"threshold_uncertainty_score":0.028189003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011380413,0.0062886407,0.9217164,0.0029660482,0.0019370005,0.000049411865,0.00036032038,0.0008094971,0.054492295],"genre_scores_gemma":[0.1971853,0.0073593245,0.67162055,0.0041238666,0.005129189,0.000258708,0.0017946329,0.0028355573,0.10969284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759775,0.00063143374,0.00012208188,0.00054741674,0.00093768135,0.00016355005],"domain_scores_gemma":[0.99347323,0.0029541953,0.00022250332,0.0021349106,0.0009542213,0.00026091287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109768,0.0020025736,0.0022875431,0.001875589,0.0012324871,0.0015311175,0.0022690496,0.001649246,0.0322426],"category_scores_gemma":[0.011807416,0.0010220784,0.0017698937,0.0048188474,0.0020917482,0.0063658594,0.004755394,0.005767488,0.0058377855],"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.00039432404,0.0002124118,0.0010269003,0.00089285424,0.00022771093,0.00027720162,0.00036045408,0.03567548,0.010024232,0.42586285,0.0497606,0.475285],"study_design_scores_gemma":[0.00007482262,0.0001282428,0.0013905703,0.00014558111,0.00016330938,0.0006247775,0.0001664248,0.12902531,0.0072737965,0.74807656,0.112844914,0.00008571276],"about_ca_topic_score_codex":0.0020954062,"about_ca_topic_score_gemma":0.0024252362,"teacher_disagreement_score":0.0322426,"about_ca_system_score_codex":0.0008616692,"about_ca_system_score_gemma":0.0006536149,"threshold_uncertainty_score":0.107862234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31954375,0.00075726537,0.66599756,0.0012557206,0.000081625694,0.0001418248,0.00025578216,0.00073298893,0.011233409],"genre_scores_gemma":[0.8779949,0.00030517316,0.118213125,0.00016981216,0.000056203447,0.00013554057,0.0003270245,0.00037161872,0.002426517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790275,0.0010231842,0.00007357188,0.00023929421,0.00047271437,0.00028846037],"domain_scores_gemma":[0.9499377,0.043722346,0.0015667409,0.0020671468,0.0016665763,0.0010395257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056386804,0.0006342657,0.0012957471,0.00212906,0.0018268967,0.0018841139,0.0027657328,0.0018273628,0.005266295],"category_scores_gemma":[0.04214465,0.00094507687,0.0011993598,0.0018316103,0.003266968,0.0031896816,0.002239329,0.0016342758,0.00032798084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005126331,0.00008979261,0.0020812105,0.0001704899,0.0000865467,0.00007255481,0.00025063404,0.79435796,0.0025241666,0.17819716,0.0022170264,0.019439913],"study_design_scores_gemma":[0.000031737363,0.000038341026,0.00028851337,0.000013550071,0.00001372391,0.000022319166,0.000025707168,0.9535628,0.0003746647,0.04541604,0.0002017974,0.000010872401],"about_ca_topic_score_codex":0.004640621,"about_ca_topic_score_gemma":0.004807466,"teacher_disagreement_score":0.0056386804,"about_ca_system_score_codex":0.002806561,"about_ca_system_score_gemma":0.0025057814,"threshold_uncertainty_score":0.029820502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2452018,0.0026202917,0.70299226,0.002808553,0.00034826514,0.00036452914,0.00069338013,0.0051625674,0.039808277],"genre_scores_gemma":[0.6546388,0.0013686242,0.32544404,0.00034843196,0.00020360522,0.00025077446,0.0013570297,0.0007134345,0.015675252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969597,0.0005259741,0.00026082018,0.0005721662,0.00096785824,0.00071343686],"domain_scores_gemma":[0.9955556,0.0018804978,0.0003679937,0.0015213792,0.00043968295,0.00023479563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018896429,0.0016873771,0.0016889779,0.0027471727,0.0020183914,0.0060383943,0.002797397,0.0021098715,0.013876928],"category_scores_gemma":[0.008547167,0.0008187457,0.0014709703,0.0033002775,0.0017895688,0.012860272,0.0053636115,0.0028231174,0.0040545594],"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.0017623113,0.00042147774,0.0025837303,0.000541169,0.00015753445,0.0001614654,0.0012683487,0.047612164,0.010072967,0.42724362,0.014993274,0.49318203],"study_design_scores_gemma":[0.00043967328,0.00019860368,0.00046587933,0.00014681846,0.000089727524,0.00025634767,0.0004378408,0.1283109,0.011285382,0.8440465,0.0142527195,0.000069622765],"about_ca_topic_score_codex":0.0015112724,"about_ca_topic_score_gemma":0.0027652227,"teacher_disagreement_score":0.013876928,"about_ca_system_score_codex":0.0031424237,"about_ca_system_score_gemma":0.00285353,"threshold_uncertainty_score":0.0464229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7624642,0.0032214823,0.21289358,0.003004138,0.00024434313,0.00015027309,0.0026032713,0.00044223497,0.014976421],"genre_scores_gemma":[0.918318,0.0015178343,0.07215799,0.00016517947,0.0001787098,0.00013486213,0.002259441,0.00022824785,0.005039761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983975,0.00047025701,0.00013931215,0.0003464592,0.00044106678,0.00020531002],"domain_scores_gemma":[0.95471215,0.038657952,0.0022163608,0.0012677072,0.0015148453,0.0016310423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002504604,0.0008769217,0.0015752579,0.002974334,0.001383713,0.0026471927,0.0026650552,0.0014742799,0.0071453694],"category_scores_gemma":[0.03387286,0.0006709331,0.0006367053,0.0030062103,0.00210803,0.004360359,0.0019740872,0.0019217894,0.00035532765],"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.0019497364,0.0002502594,0.022129979,0.0009826706,0.00026186623,0.00025491562,0.00058872363,0.7574972,0.0064551653,0.12212473,0.008754803,0.07874995],"study_design_scores_gemma":[0.00008416553,0.00017614792,0.003866367,0.000062319064,0.000056499375,0.00021173018,0.00026523808,0.91587996,0.0014364708,0.07604933,0.0018823349,0.000029409157],"about_ca_topic_score_codex":0.0033984468,"about_ca_topic_score_gemma":0.0049914406,"teacher_disagreement_score":0.0071453694,"about_ca_system_score_codex":0.0017565315,"about_ca_system_score_gemma":0.0012571872,"threshold_uncertainty_score":0.023903668},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023078702,0.006440333,0.085287936,0.25120285,0.6208869,0.00011188023,0.002122802,0.0038923738,0.027746974],"genre_scores_gemma":[0.13542157,0.017738365,0.14487179,0.18092336,0.29985353,0.0005491388,0.0048313634,0.009349241,0.20646165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9850209,0.0045284536,0.0011796167,0.0028956407,0.005640983,0.0007343304],"domain_scores_gemma":[0.9562827,0.016995309,0.0016706286,0.0069840094,0.016792879,0.0012744464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007419859,0.0032029368,0.003297457,0.004370946,0.006627126,0.005048587,0.009035851,0.0063460437,0.03192697],"category_scores_gemma":[0.10355441,0.0020916625,0.003471677,0.0059349076,0.0077936924,0.010926624,0.0043206248,0.017250262,0.0148058785],"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.000120073324,0.000030747433,0.00014666739,0.0002183121,0.000066242465,0.00014310623,0.00015336141,0.00085540814,0.00029698398,0.047881532,0.93594676,0.014140651],"study_design_scores_gemma":[0.00015915524,0.00005218273,0.00088682555,0.0003081553,0.00017516762,0.0006143734,0.00018548136,0.009390872,0.002040838,0.2711662,0.71476585,0.0002549124],"about_ca_topic_score_codex":0.025437683,"about_ca_topic_score_gemma":0.022888279,"teacher_disagreement_score":0.03192697,"about_ca_system_score_codex":0.005895203,"about_ca_system_score_gemma":0.00495819,"threshold_uncertainty_score":0.10680634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6245763,0.004405543,0.31678513,0.011134466,0.00032301323,0.00035027912,0.0014501134,0.0007364287,0.0402388],"genre_scores_gemma":[0.9592269,0.001908267,0.029648691,0.00056847563,0.000443532,0.00020585231,0.00037288154,0.00044610887,0.0071792356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964038,0.0016264819,0.0001580626,0.0005167275,0.0005407053,0.0007542104],"domain_scores_gemma":[0.7872818,0.1897234,0.0077259196,0.004332662,0.0037173626,0.0072188694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010571835,0.0017994976,0.0045789275,0.0037892647,0.001773102,0.005750912,0.004547195,0.0041477364,0.017848663],"category_scores_gemma":[0.09436822,0.0016237035,0.0015907957,0.0031852378,0.0065275324,0.020397117,0.0045400932,0.0043430664,0.0007702381],"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.0023145452,0.00035975556,0.003778251,0.0008254622,0.00020292238,0.00025982177,0.0013456444,0.23395544,0.0051342645,0.7078782,0.0080775935,0.035868205],"study_design_scores_gemma":[0.00028384826,0.00042721754,0.0014067687,0.00013155669,0.00013034632,0.00028538186,0.0005342007,0.37928152,0.0010830314,0.6144619,0.0018794435,0.00009476695],"about_ca_topic_score_codex":0.0020237523,"about_ca_topic_score_gemma":0.0019453837,"teacher_disagreement_score":0.017848663,"about_ca_system_score_codex":0.0037289187,"about_ca_system_score_gemma":0.0018775058,"threshold_uncertainty_score":0.059709728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11091349,0.00015392211,0.8553457,0.00018002494,0.00019076304,0.00020493349,0.00029447852,0.0007118563,0.032004893],"genre_scores_gemma":[0.5898848,0.00022316932,0.38953343,0.00008848752,0.000048903905,0.00017372763,0.00082787283,0.00060126424,0.01861834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995658,0.00011580167,0.000020169673,0.00006974846,0.00018167413,0.000046853205],"domain_scores_gemma":[0.99889094,0.00056633283,0.00006328733,0.00016736091,0.00021772571,0.000094480405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005109059,0.00047025093,0.0006179455,0.001482829,0.0006344084,0.0010379322,0.000959117,0.00084941526,0.009199416],"category_scores_gemma":[0.003512488,0.00052680913,0.00068755524,0.0007631377,0.000669613,0.001286624,0.0019192017,0.00092866534,0.0014515567],"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.00015372019,0.00011023363,0.0009722181,0.00033830135,0.00004691108,0.00058571756,0.00068259356,0.11008916,0.017520232,0.6984574,0.009084181,0.16195928],"study_design_scores_gemma":[0.00006779344,0.00007721452,0.00027510023,0.000077336044,0.000028209726,0.00030009873,0.00024883874,0.44131815,0.011246423,0.5230844,0.02324161,0.000034807592],"about_ca_topic_score_codex":0.0004136604,"about_ca_topic_score_gemma":0.0010616726,"teacher_disagreement_score":0.009199416,"about_ca_system_score_codex":0.00044881867,"about_ca_system_score_gemma":0.00028911262,"threshold_uncertainty_score":0.03077507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37623456,0.0006020745,0.47156513,0.0032689928,0.00067229546,0.00048463847,0.0025791477,0.0022410075,0.14235213],"genre_scores_gemma":[0.6899803,0.00047343943,0.25547883,0.00095683377,0.00021265578,0.00041429026,0.0021125488,0.00062030094,0.049750794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990349,0.00031755673,0.000043289176,0.00023414497,0.00014763126,0.00022250667],"domain_scores_gemma":[0.99496067,0.0020717445,0.0002927521,0.0013822501,0.00048666666,0.00080594147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066801923,0.0006165542,0.0007246393,0.0008296596,0.0024684668,0.0022061467,0.0019215259,0.0009757162,0.019273436],"category_scores_gemma":[0.0040191785,0.00067463913,0.00054894394,0.0015599821,0.0010543796,0.0028417057,0.0019016803,0.0019508564,0.0028721346],"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.001385681,0.0006151773,0.0031526529,0.00053957367,0.000086312524,0.0005544487,0.00054219953,0.029282559,0.019400142,0.776055,0.037448883,0.13093741],"study_design_scores_gemma":[0.00024086316,0.00012483631,0.0010668995,0.000060022,0.00007186633,0.00051393453,0.00032660377,0.08267267,0.00953932,0.8757714,0.029573422,0.000038137863],"about_ca_topic_score_codex":0.001991882,"about_ca_topic_score_gemma":0.0048731277,"teacher_disagreement_score":0.019273436,"about_ca_system_score_codex":0.0012777123,"about_ca_system_score_gemma":0.0014369246,"threshold_uncertainty_score":0.06447607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1561166,0.0012845071,0.82332194,0.0019862377,0.00014463147,0.0002544297,0.0010717592,0.0011824945,0.014637404],"genre_scores_gemma":[0.60033333,0.0008879024,0.38426343,0.0004985253,0.00021448584,0.0003162534,0.0017394833,0.0005473172,0.011199233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954614,0.0015189847,0.00033645457,0.0010191558,0.0011578446,0.00050615385],"domain_scores_gemma":[0.9663517,0.0269325,0.0013185082,0.0029993455,0.0016086563,0.00078925595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003835499,0.00088739354,0.0028261638,0.0045667333,0.002589851,0.0056343563,0.004070267,0.0019861213,0.008401792],"category_scores_gemma":[0.027818581,0.001475324,0.0025426066,0.004757301,0.0035727797,0.015201151,0.006662973,0.00352054,0.0014101241],"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.0016121179,0.0006640373,0.012151585,0.0009488624,0.00052170095,0.00038337527,0.002008491,0.04759312,0.008794868,0.5605924,0.018932419,0.345797],"study_design_scores_gemma":[0.00012990377,0.00006921623,0.00060388143,0.0001051001,0.00014073515,0.00025890683,0.00048659174,0.11575863,0.0038787746,0.8733997,0.0051191915,0.000049413848],"about_ca_topic_score_codex":0.0014432088,"about_ca_topic_score_gemma":0.0020669508,"teacher_disagreement_score":0.008401792,"about_ca_system_score_codex":0.0015660371,"about_ca_system_score_gemma":0.0016570102,"threshold_uncertainty_score":0.028106749},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05669967,0.020840576,0.8994584,0.007355302,0.00090023916,0.00014661068,0.00039444453,0.0002652175,0.013939481],"genre_scores_gemma":[0.5148559,0.024159465,0.441655,0.0010957022,0.004233433,0.00032114016,0.00096256414,0.00036547187,0.012351276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411833,0.0023898936,0.0005303835,0.0010679126,0.0015161318,0.00037739595],"domain_scores_gemma":[0.9505093,0.04005166,0.0019855034,0.0043624975,0.0023115242,0.00077941036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009429348,0.0009828265,0.0040017907,0.0045162863,0.0025031418,0.0070495955,0.0052876356,0.005562756,0.0055952924],"category_scores_gemma":[0.06852252,0.0010968627,0.001805304,0.01728913,0.005661457,0.017661598,0.0049664965,0.006122372,0.00078920997],"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.00032365992,0.00024900486,0.0018327903,0.00052254874,0.00011876514,0.0004776079,0.00051763834,0.10811605,0.0010704328,0.7114119,0.008549554,0.16680996],"study_design_scores_gemma":[0.00003625396,0.000060597573,0.00028149987,0.00008633062,0.00004305675,0.0004492705,0.00024940007,0.23567484,0.0006100561,0.75598824,0.0064765103,0.00004398761],"about_ca_topic_score_codex":0.0023311004,"about_ca_topic_score_gemma":0.0021272271,"teacher_disagreement_score":0.009429348,"about_ca_system_score_codex":0.0022499883,"about_ca_system_score_gemma":0.0030569998,"threshold_uncertainty_score":0.04986775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82545817,0.000501604,0.11925766,0.0005018815,0.00046468936,0.000097891876,0.00033548888,0.0006183341,0.052764397],"genre_scores_gemma":[0.9554799,0.00020139196,0.027723923,0.000223862,0.00006955288,0.00008031356,0.0002125448,0.0002191788,0.015789371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998029,0.00003222225,0.000010049949,0.000060694732,0.000036965583,0.00005730574],"domain_scores_gemma":[0.9994229,0.00013839215,0.000059850838,0.00016665236,0.000050709026,0.00016153857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014502961,0.00026667994,0.0005839535,0.00041696287,0.0011388015,0.0010893071,0.00075563096,0.0008090182,0.015664384],"category_scores_gemma":[0.0010032816,0.00040828594,0.00044152138,0.00035090046,0.0007768047,0.0009299243,0.0011360488,0.00088588335,0.0018570971],"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.00070496445,0.0001712634,0.0014374753,0.00023853108,0.000058859277,0.00090194616,0.0013526316,0.049187448,0.08803934,0.80794567,0.008172066,0.041789807],"study_design_scores_gemma":[0.00015364654,0.0002465857,0.0014585134,0.000043128748,0.000042783446,0.0005345287,0.0008406663,0.14647514,0.031212851,0.7966306,0.022292698,0.00006880508],"about_ca_topic_score_codex":0.000479459,"about_ca_topic_score_gemma":0.0006542247,"teacher_disagreement_score":0.015664384,"about_ca_system_score_codex":0.00029334766,"about_ca_system_score_gemma":0.00025046314,"threshold_uncertainty_score":0.052402556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01518488,0.00027490157,0.9815361,0.00031469652,0.00018831718,0.00005135771,0.00017837538,0.0007683784,0.0015030121],"genre_scores_gemma":[0.22232597,0.00061651826,0.76832104,0.0005367037,0.00038964374,0.00013347552,0.0008427685,0.0003013799,0.006532556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991246,0.00020038776,0.00006293038,0.00014419864,0.00039452763,0.00007346279],"domain_scores_gemma":[0.9980679,0.000570346,0.00010104318,0.0008313658,0.0002896348,0.00013982427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005570249,0.00055968616,0.0010124418,0.00060092687,0.00047706894,0.00097537733,0.0010571188,0.0009936052,0.0045984974],"category_scores_gemma":[0.0038201045,0.0003890056,0.00036458153,0.0013168581,0.00058458885,0.0017527705,0.0024722198,0.0012914169,0.002229728],"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.0014247186,0.0002737781,0.00091021124,0.00026860874,0.000089699744,0.00030155742,0.00014226366,0.05509604,0.08461738,0.05082421,0.017344505,0.7887071],"study_design_scores_gemma":[0.00038397597,0.00050726463,0.00053504144,0.000043732132,0.0000627412,0.0015498091,0.00012559285,0.87512386,0.052317683,0.05237203,0.01690909,0.000069266156],"about_ca_topic_score_codex":0.0005858802,"about_ca_topic_score_gemma":0.0012433046,"teacher_disagreement_score":0.0045984974,"about_ca_system_score_codex":0.00023455768,"about_ca_system_score_gemma":0.00088775204,"threshold_uncertainty_score":0.015383482},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2849333,0.0011640826,0.45050743,0.003853684,0.0006641746,0.00033146288,0.006559671,0.002482437,0.24950376],"genre_scores_gemma":[0.81739813,0.0012702745,0.08204087,0.00078558445,0.00054757344,0.00027961488,0.004787903,0.00085017626,0.09203982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999086,0.00026422556,0.0000712522,0.00013432698,0.00023831437,0.00020590842],"domain_scores_gemma":[0.9968003,0.0015423407,0.00036671574,0.00053406,0.0005596986,0.00019688421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091101945,0.00040792936,0.00030105747,0.0010074625,0.0008718445,0.0017933472,0.0005057407,0.00048516947,0.014254947],"category_scores_gemma":[0.004422649,0.00030457322,0.000314378,0.0014500205,0.0008932086,0.002067002,0.0011730688,0.001056082,0.0045980695],"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.00018321376,0.000053296993,0.00069004565,0.000107634965,0.0000068412023,0.00016400027,0.00034334307,0.003067693,0.0042504054,0.9225018,0.01733289,0.05129882],"study_design_scores_gemma":[0.000094956915,0.00013694257,0.0016649818,0.00014574888,0.000020566702,0.0008133726,0.00018695298,0.023871085,0.01437598,0.86904013,0.0895603,0.0000889747],"about_ca_topic_score_codex":0.0019792467,"about_ca_topic_score_gemma":0.0024499143,"teacher_disagreement_score":0.014254947,"about_ca_system_score_codex":0.0010214535,"about_ca_system_score_gemma":0.0014569313,"threshold_uncertainty_score":0.04768759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8746937,0.0008980623,0.11283225,0.0009661051,0.00008779344,0.00008002982,0.0014174347,0.0003466577,0.008678039],"genre_scores_gemma":[0.98017234,0.00025339035,0.016626123,0.000055537283,0.00016122023,0.000058545276,0.00083089835,0.00007774347,0.0017642872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968886,0.00054117735,0.00033100788,0.00082967384,0.0010718112,0.0003378469],"domain_scores_gemma":[0.94025826,0.046398558,0.0042442475,0.0050131506,0.0023948497,0.0016909424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021052745,0.000295466,0.0011514418,0.0038517173,0.0012888311,0.0037818558,0.0016658384,0.0013993484,0.006328235],"category_scores_gemma":[0.027955074,0.00047948663,0.0009079441,0.0045607267,0.0020806328,0.0072131986,0.001643009,0.0016049485,0.00060276967],"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.0020643768,0.0009034477,0.22613586,0.0006748398,0.00037528874,0.0016558752,0.0018461017,0.055847503,0.026893465,0.43168133,0.006849442,0.2450725],"study_design_scores_gemma":[0.00009310809,0.00028241976,0.04924906,0.0000632685,0.00016430237,0.0042152177,0.0009411819,0.291759,0.011629557,0.63676554,0.0046843346,0.00015298315],"about_ca_topic_score_codex":0.00056144584,"about_ca_topic_score_gemma":0.00041257977,"teacher_disagreement_score":0.006328235,"about_ca_system_score_codex":0.0010907655,"about_ca_system_score_gemma":0.0007909182,"threshold_uncertainty_score":0.02117002},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026897073,0.00019801351,0.96011966,0.00021325167,0.00011191018,0.00020893125,0.00017518298,0.004762619,0.0073133144],"genre_scores_gemma":[0.1399024,0.00010003054,0.8506575,0.00017590531,0.000033631524,0.00024975682,0.00050820824,0.00048735813,0.00788515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940705,0.00006323073,0.000044579516,0.00009821734,0.0003058106,0.00008109374],"domain_scores_gemma":[0.9991392,0.00024162026,0.00005922266,0.00023220222,0.00024174358,0.00008597023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035619165,0.0007696746,0.00081834284,0.001477981,0.00091714255,0.0014390264,0.0013095383,0.0011215786,0.011932972],"category_scores_gemma":[0.0022795224,0.00035436373,0.0004370373,0.001437943,0.00070856785,0.0014429691,0.0020950285,0.0011965352,0.0036566034],"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.00061039295,0.00025966103,0.0006424834,0.00019037616,0.00003658141,0.00018388263,0.00023228896,0.025892274,0.035423435,0.04157244,0.01220783,0.8827483],"study_design_scores_gemma":[0.0007242411,0.0005698985,0.0012083371,0.00011103398,0.00007648506,0.00082766946,0.00029366932,0.7867868,0.08265976,0.09255932,0.034014426,0.00016839776],"about_ca_topic_score_codex":0.0038748682,"about_ca_topic_score_gemma":0.0067188386,"teacher_disagreement_score":0.011932972,"about_ca_system_score_codex":0.00090190815,"about_ca_system_score_gemma":0.0015115738,"threshold_uncertainty_score":0.039919734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21632604,0.0045144605,0.7125467,0.003112743,0.00085216516,0.000083226994,0.00032128065,0.00026176937,0.06198166],"genre_scores_gemma":[0.85857016,0.0033605832,0.106010504,0.00072395784,0.00063316704,0.000106024905,0.0005382587,0.00016033195,0.029897086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993357,0.00021481713,0.000036993824,0.00008532409,0.00024252944,0.00008456423],"domain_scores_gemma":[0.99782914,0.0012913285,0.00017555317,0.00018833029,0.00035043847,0.00016514955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011898063,0.00063520763,0.00081279245,0.0020959238,0.0007803381,0.0012905563,0.0008059815,0.0014743726,0.004395411],"category_scores_gemma":[0.009380712,0.0002941377,0.0003878161,0.0015734304,0.0017464644,0.002936141,0.0019206309,0.0020428386,0.0012068902],"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.0001372301,0.000028100743,0.00041908518,0.00006063558,0.000010625454,0.00012915548,0.00015304337,0.016437028,0.0023657186,0.941818,0.0019731515,0.03646836],"study_design_scores_gemma":[0.000031882668,0.000063520216,0.0003994167,0.000048273243,0.000010026223,0.0002878968,0.00006321479,0.112219825,0.001905882,0.8786758,0.0062675383,0.000026807422],"about_ca_topic_score_codex":0.0009832071,"about_ca_topic_score_gemma":0.0006468315,"teacher_disagreement_score":0.004395411,"about_ca_system_score_codex":0.000801718,"about_ca_system_score_gemma":0.00060622185,"threshold_uncertainty_score":0.014704168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16051131,0.0011261803,0.8040934,0.004375333,0.00022682104,0.00016454705,0.0019009341,0.00047729784,0.02712417],"genre_scores_gemma":[0.74035037,0.002204319,0.21129216,0.00060878263,0.00023479102,0.0002750285,0.0027874347,0.0004150989,0.041832045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992705,0.0002797831,0.00003115842,0.00021462784,0.00009950063,0.00010442504],"domain_scores_gemma":[0.99701333,0.0020758216,0.00028988477,0.00019863973,0.00018269138,0.00023962284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497714,0.00072252273,0.0014041569,0.0010594517,0.0011534095,0.0023173487,0.0018453195,0.0024290818,0.009590401],"category_scores_gemma":[0.0067308815,0.0006311411,0.00080142356,0.0016546241,0.0010676023,0.0062609483,0.0017151247,0.0018219948,0.00086680823],"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.00029187105,0.00016699078,0.0010923459,0.00044399162,0.00008407875,0.00033572517,0.00026204102,0.56380826,0.002238631,0.37632364,0.012116076,0.042836413],"study_design_scores_gemma":[0.000052373456,0.00004813825,0.0002530054,0.00003633835,0.000023627763,0.000099641235,0.0001634112,0.5576121,0.00068396225,0.4360774,0.0049266657,0.000023374057],"about_ca_topic_score_codex":0.007337636,"about_ca_topic_score_gemma":0.008314552,"teacher_disagreement_score":0.009590401,"about_ca_system_score_codex":0.0017834047,"about_ca_system_score_gemma":0.0018652679,"threshold_uncertainty_score":0.032083035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6755803,0.0020348185,0.23605542,0.014515264,0.0003957155,0.00041056846,0.0060060015,0.001905368,0.06309648],"genre_scores_gemma":[0.925298,0.0009059237,0.056447703,0.00075143325,0.00035825156,0.00025974808,0.004598765,0.0007876042,0.010592614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674076,0.0009015426,0.00016064798,0.0007621826,0.00067316863,0.0007617332],"domain_scores_gemma":[0.9829411,0.012280161,0.0010146406,0.0020992237,0.000623445,0.0010413638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023347104,0.0012686508,0.0020510275,0.0010098635,0.0019163004,0.0071900976,0.004351818,0.0023374744,0.020271763],"category_scores_gemma":[0.018070571,0.00093865074,0.0019675556,0.002741106,0.002241719,0.012872361,0.003325801,0.0046341987,0.0013588888],"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.0030443503,0.0010722518,0.010851038,0.0010294324,0.00032077671,0.0005897239,0.001186388,0.2475374,0.010344329,0.55983716,0.043953758,0.12023341],"study_design_scores_gemma":[0.000297459,0.00006957945,0.0013203968,0.00004165757,0.0001223728,0.00023462407,0.00034701804,0.27405888,0.0026723049,0.71634287,0.004458941,0.000033798515],"about_ca_topic_score_codex":0.004514843,"about_ca_topic_score_gemma":0.0065097995,"teacher_disagreement_score":0.020271763,"about_ca_system_score_codex":0.004877095,"about_ca_system_score_gemma":0.0035354393,"threshold_uncertainty_score":0.06781578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122603774,0.0032281957,0.8357934,0.008081479,0.00044258806,0.00045807366,0.0014946042,0.00049154815,0.027406394],"genre_scores_gemma":[0.61606336,0.003562401,0.34920982,0.0012109667,0.0007852582,0.000862247,0.0022226956,0.0006089346,0.025474206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977679,0.00095458183,0.00012351375,0.00039173604,0.00040340362,0.00035883003],"domain_scores_gemma":[0.9750752,0.0212566,0.0009954883,0.0008805722,0.00066059,0.00113154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030792612,0.0014590361,0.0026145792,0.0018678139,0.0016525051,0.005077172,0.003880456,0.004059106,0.010808054],"category_scores_gemma":[0.021734942,0.0019236306,0.0015281441,0.0036745458,0.0023469063,0.011150279,0.003575157,0.0054406347,0.00080591615],"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.00055449875,0.000396313,0.0018140059,0.00083668536,0.00017799252,0.00029143153,0.00039735105,0.21749221,0.0019620797,0.6987667,0.018309431,0.059001226],"study_design_scores_gemma":[0.00014196514,0.000051657295,0.00031828188,0.00009284012,0.0000584341,0.00015481036,0.00015554276,0.2890893,0.0008363927,0.7050731,0.0040018945,0.000025759904],"about_ca_topic_score_codex":0.0031066283,"about_ca_topic_score_gemma":0.0033904086,"teacher_disagreement_score":0.010808054,"about_ca_system_score_codex":0.0023796763,"about_ca_system_score_gemma":0.0018223563,"threshold_uncertainty_score":0.036156535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15676753,0.0048429007,0.811009,0.006015238,0.00084858347,0.00023679473,0.00057594985,0.00091978646,0.018784288],"genre_scores_gemma":[0.82522476,0.00244313,0.16014606,0.0010214911,0.00082586816,0.0005330274,0.000515819,0.00055587373,0.008734016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99077964,0.0033754224,0.00047789328,0.0012300775,0.0027289395,0.0014080895],"domain_scores_gemma":[0.920565,0.056026958,0.0039614057,0.011425475,0.0055432967,0.0024778626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01127962,0.0013002909,0.0030692897,0.0021253566,0.0031149727,0.004937376,0.0038788493,0.0027722125,0.0052901893],"category_scores_gemma":[0.053701278,0.00118364,0.001783017,0.0020934269,0.004927296,0.014161118,0.0047255647,0.0067282994,0.001005196],"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.0026635893,0.0002166218,0.0021463914,0.00038135567,0.00017435208,0.00013308697,0.00044107944,0.09792612,0.010151186,0.8123839,0.012230284,0.06115197],"study_design_scores_gemma":[0.00015535616,0.00033736028,0.0007393385,0.00010688149,0.000113239796,0.00036209167,0.00012745279,0.34758267,0.0041355854,0.64284897,0.0034051794,0.00008589709],"about_ca_topic_score_codex":0.00068609655,"about_ca_topic_score_gemma":0.0015254028,"teacher_disagreement_score":0.01127962,"about_ca_system_score_codex":0.0051269773,"about_ca_system_score_gemma":0.0045236964,"threshold_uncertainty_score":0.059653103},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5383973,0.00014520624,0.45655823,0.00053194887,0.00011336274,0.00006344293,0.0001429759,0.0012319164,0.002815686],"genre_scores_gemma":[0.96029663,0.00004688295,0.038385674,0.000034145465,0.000036164438,0.000027490607,0.00006737367,0.0000748095,0.0010308452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984125,0.00042569562,0.000120082404,0.00036361755,0.00038892045,0.00028917912],"domain_scores_gemma":[0.98213446,0.0118689835,0.0016676693,0.0020400903,0.0013419697,0.0009468393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481187,0.0006779178,0.0014978017,0.0013028652,0.0012301854,0.0028347056,0.0020602567,0.0011166938,0.0023994767],"category_scores_gemma":[0.020005904,0.00061845395,0.00052016287,0.0014761686,0.0014455367,0.005477477,0.0028989813,0.0013242667,0.00024396634],"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.0017915906,0.00017796023,0.006505658,0.00014204622,0.000072046714,0.0003343758,0.0002992003,0.88078576,0.0052911155,0.055234548,0.0013469955,0.0480187],"study_design_scores_gemma":[0.000030961917,0.00005047032,0.00020553739,0.000005403638,0.00001432292,0.000029779281,0.000045833607,0.96047795,0.0024589554,0.036528874,0.00014273757,0.00000908318],"about_ca_topic_score_codex":0.0016255511,"about_ca_topic_score_gemma":0.0026242237,"teacher_disagreement_score":0.0028347056,"about_ca_system_score_codex":0.0017549052,"about_ca_system_score_gemma":0.0010182293,"threshold_uncertainty_score":0.013121963},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02438544,0.015481003,0.644615,0.045458034,0.0058035706,0.00006153194,0.0004763386,0.00050585857,0.26321325],"genre_scores_gemma":[0.68647116,0.01398843,0.14808673,0.016695237,0.0068418225,0.0002937409,0.00057522045,0.000979424,0.12606835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983102,0.0006169764,0.00008346094,0.00036207927,0.0004842029,0.00014310444],"domain_scores_gemma":[0.9939075,0.0041998546,0.00021660788,0.0007978364,0.00073661597,0.00014163286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024107378,0.0007234122,0.0010403508,0.0014779106,0.0013076949,0.002961771,0.0015464615,0.0018704071,0.015969422],"category_scores_gemma":[0.0145379305,0.0005072888,0.00096016715,0.0023411189,0.0046597365,0.0063660163,0.0032805046,0.007032134,0.0027788247],"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.00003452436,0.000008922217,0.00014419228,0.00004827442,0.000015781749,0.000090661146,0.000069048234,0.00075308856,0.00038408925,0.9740382,0.008949099,0.015464041],"study_design_scores_gemma":[0.000018838422,0.000013738495,0.00016855252,0.000023756265,0.00001228072,0.00020896556,0.000065983215,0.006520553,0.00064920564,0.9693071,0.02299444,0.000016504346],"about_ca_topic_score_codex":0.0014920301,"about_ca_topic_score_gemma":0.0010944881,"teacher_disagreement_score":0.015969422,"about_ca_system_score_codex":0.00096267567,"about_ca_system_score_gemma":0.00090113113,"threshold_uncertainty_score":0.053423047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20947012,0.0009170347,0.66967785,0.004014631,0.00041667037,0.00024748358,0.00059459446,0.001059914,0.11360169],"genre_scores_gemma":[0.80417126,0.0012363386,0.14088908,0.0012485399,0.0003093452,0.00024677996,0.00073473796,0.0006134869,0.05055054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990852,0.0002508188,0.00004463585,0.00023871726,0.00024385819,0.00013667364],"domain_scores_gemma":[0.9910597,0.0061142165,0.0004185557,0.0011715153,0.0005815943,0.0006543901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011255179,0.0005307553,0.0011405841,0.0010067961,0.0013598391,0.0034175958,0.0017299158,0.0011905199,0.016433926],"category_scores_gemma":[0.013909487,0.00073320523,0.0006963043,0.0014374377,0.0026235876,0.0071546547,0.0031313389,0.0032189908,0.0028690747],"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.00027289684,0.00007292064,0.0010447636,0.00015857098,0.000025560108,0.0001233783,0.0005727082,0.006344839,0.0028372847,0.9319465,0.007837155,0.04876337],"study_design_scores_gemma":[0.000053762444,0.000028125869,0.00018997033,0.000021119233,0.000014407835,0.000106537795,0.00015380878,0.020557556,0.0011153789,0.9710245,0.006726224,0.000008564468],"about_ca_topic_score_codex":0.00047815757,"about_ca_topic_score_gemma":0.0009722455,"teacher_disagreement_score":0.016433926,"about_ca_system_score_codex":0.00093476754,"about_ca_system_score_gemma":0.00069039443,"threshold_uncertainty_score":0.05497694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016959993,0.00018138131,0.96405536,0.0005015196,0.0002911497,0.00018963224,0.00026600045,0.0055077034,0.012047214],"genre_scores_gemma":[0.13853255,0.00016355675,0.84523994,0.00031593235,0.00011390303,0.00023771144,0.00082531304,0.00054462557,0.014026443],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992009,0.00010230619,0.00007826961,0.0003548939,0.00018154441,0.000082205406],"domain_scores_gemma":[0.99890685,0.00029356,0.000054359305,0.00041434477,0.00025403706,0.00007695879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352811,0.00075740117,0.00092528784,0.0010182342,0.0009196637,0.0023755673,0.0021240665,0.0018694192,0.013783291],"category_scores_gemma":[0.0024809523,0.0005894318,0.0010464091,0.0013098195,0.00089963846,0.0035857295,0.0019889115,0.0017146473,0.007870873],"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.0005954107,0.00025340926,0.0010672591,0.00021431848,0.000055460972,0.0002821366,0.00019944321,0.008788705,0.028824944,0.11289291,0.022312917,0.82451314],"study_design_scores_gemma":[0.00027299928,0.0005488713,0.0008902593,0.0001285199,0.00012675382,0.002299568,0.00035268746,0.5314122,0.096086964,0.30441192,0.06332694,0.0001423822],"about_ca_topic_score_codex":0.0005687626,"about_ca_topic_score_gemma":0.00041253082,"teacher_disagreement_score":0.013783291,"about_ca_system_score_codex":0.00047248972,"about_ca_system_score_gemma":0.0008766965,"threshold_uncertainty_score":0.046109736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100649506,0.0016917669,0.70739335,0.0065109106,0.0014544509,0.00019987384,0.0011568202,0.0011593085,0.17978401],"genre_scores_gemma":[0.64970213,0.001762791,0.23396716,0.0020164526,0.0016159535,0.00046849975,0.0025040912,0.0010698652,0.10689302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956145,0.0011006461,0.00029166724,0.0010579875,0.0015313958,0.000403771],"domain_scores_gemma":[0.98735446,0.0060215103,0.0007507202,0.003460033,0.0015249931,0.00088838453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020931081,0.0011691315,0.0019223061,0.0044535645,0.0037744686,0.006705991,0.0033229555,0.0028674463,0.021719921],"category_scores_gemma":[0.020611558,0.0010437882,0.0015755263,0.00648315,0.0035875582,0.013675592,0.0057033785,0.0062570777,0.0041243387],"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.000055656492,0.0000354845,0.0005347132,0.000050293973,0.000014959385,0.000034421664,0.00009413389,0.0014696132,0.0004555307,0.9628034,0.0059059504,0.028545784],"study_design_scores_gemma":[0.000008612962,0.000011116617,0.00012557599,0.000013627316,0.000013423517,0.00011893876,0.000032757514,0.007274285,0.0005445588,0.9853247,0.0065227137,0.000009675414],"about_ca_topic_score_codex":0.0008246039,"about_ca_topic_score_gemma":0.00090626726,"teacher_disagreement_score":0.021719921,"about_ca_system_score_codex":0.0023769294,"about_ca_system_score_gemma":0.001545044,"threshold_uncertainty_score":0.07266039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68106407,0.00084863836,0.16228804,0.0040570255,0.00045957635,0.000110437264,0.0012797728,0.000793086,0.14909936],"genre_scores_gemma":[0.9397618,0.00018397534,0.02073795,0.00044971195,0.00012824223,0.00007289711,0.0006737742,0.00018718216,0.03780441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990268,0.00020861453,0.00007807408,0.00020957467,0.00019875387,0.00027816714],"domain_scores_gemma":[0.99652594,0.0017106901,0.0002791251,0.00051564275,0.0005406319,0.00042795445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085008034,0.0004016686,0.0009957834,0.0011860727,0.0032000944,0.005619112,0.0009714395,0.0012190273,0.012524027],"category_scores_gemma":[0.0036996768,0.00050121825,0.0009377429,0.00137359,0.0035655792,0.0064880513,0.0022508265,0.0030336038,0.0017114491],"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.000088898654,0.000018363706,0.0003027786,0.000022171062,0.0000044262815,0.00007195931,0.0003854256,0.00059068785,0.0005627416,0.99449337,0.00077696855,0.0026822025],"study_design_scores_gemma":[0.000019052726,0.00001780865,0.00020238734,0.000008917442,0.0000067554447,0.00007103875,0.00025174808,0.0022933031,0.0005304643,0.994212,0.0023707566,0.000015885496],"about_ca_topic_score_codex":0.002126458,"about_ca_topic_score_gemma":0.0030374916,"teacher_disagreement_score":0.012524027,"about_ca_system_score_codex":0.001839137,"about_ca_system_score_gemma":0.0012391302,"threshold_uncertainty_score":0.04189706},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037603874,0.0032538215,0.9251349,0.0028381215,0.00036648125,0.0005091241,0.0009412488,0.0018529341,0.027499473],"genre_scores_gemma":[0.17879407,0.0026550696,0.80083406,0.00075895764,0.00032042232,0.0008547705,0.0025278402,0.000601767,0.012653042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830186,0.00041870642,0.00013123629,0.00051684753,0.0003794758,0.00025178524],"domain_scores_gemma":[0.9936481,0.0043118135,0.0003298693,0.00089551206,0.0004679798,0.0003466466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017864828,0.0017343921,0.0015749729,0.0026987586,0.0016926321,0.0039748554,0.004661305,0.0032181786,0.014982258],"category_scores_gemma":[0.013382533,0.0011637289,0.0017410839,0.0056377235,0.0014649212,0.009707578,0.004349643,0.0038993133,0.0026642848],"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.0009431257,0.00053031475,0.0013683815,0.0013433768,0.00017795536,0.00010451961,0.0004686407,0.1331412,0.0029957057,0.35458726,0.034105103,0.47023433],"study_design_scores_gemma":[0.00039031482,0.00008302995,0.00030941502,0.000107248685,0.000089890804,0.00015395753,0.00020258036,0.29990935,0.0019467644,0.6789866,0.017786134,0.000034752105],"about_ca_topic_score_codex":0.0040763295,"about_ca_topic_score_gemma":0.0054995925,"teacher_disagreement_score":0.014982258,"about_ca_system_score_codex":0.0027815758,"about_ca_system_score_gemma":0.002861757,"threshold_uncertainty_score":0.05012065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16372268,0.005384529,0.77469116,0.004771627,0.0006369691,0.00014895992,0.00026819741,0.00064998644,0.049725868],"genre_scores_gemma":[0.88601685,0.0050740223,0.08111967,0.0005247205,0.0008289749,0.00018240421,0.00046665827,0.00020183586,0.025584748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893624,0.00044192764,0.000037002217,0.0001490207,0.00027412028,0.00016167006],"domain_scores_gemma":[0.9935138,0.0047466466,0.0005900177,0.0003576088,0.00045611296,0.00033579057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011467296,0.00058185065,0.0014284315,0.001805694,0.0014482484,0.0023754858,0.0018879746,0.001612678,0.0053692544],"category_scores_gemma":[0.01041677,0.000798787,0.00055480504,0.0025147398,0.002577358,0.0032633627,0.00207565,0.0019142702,0.0007385018],"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.00024049862,0.000067798625,0.0008267633,0.00021165592,0.00004668035,0.00013151318,0.00037078196,0.2337213,0.0025859785,0.71311134,0.008951301,0.039734352],"study_design_scores_gemma":[0.00008368217,0.00007816008,0.00033916047,0.00003111271,0.000040095238,0.00018356633,0.00016326664,0.48518693,0.0008079222,0.5054834,0.007576507,0.00002625],"about_ca_topic_score_codex":0.0021825836,"about_ca_topic_score_gemma":0.0021733895,"teacher_disagreement_score":0.0053692544,"about_ca_system_score_codex":0.0017814866,"about_ca_system_score_gemma":0.0009119827,"threshold_uncertainty_score":0.01796192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39915752,0.0028547405,0.46864942,0.0045444327,0.0007066693,0.0001693719,0.0005544643,0.00063984696,0.12272354],"genre_scores_gemma":[0.8585276,0.001981871,0.108164385,0.0008647004,0.0005151742,0.00014409007,0.00057948835,0.0003638666,0.02885874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903786,0.00037547646,0.000049831764,0.00019233681,0.0001852531,0.00015931389],"domain_scores_gemma":[0.9912407,0.0050861523,0.0007899328,0.0013541023,0.0008521943,0.0006769182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866198,0.00048500762,0.0008558725,0.0019620536,0.002147044,0.0030380604,0.0021075788,0.0014875273,0.010963082],"category_scores_gemma":[0.010411734,0.0010468184,0.0011883678,0.002953753,0.003025678,0.0038056676,0.001895302,0.0032859582,0.00068588543],"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.00003999106,0.000019954869,0.0005326404,0.00004260385,0.0000074198165,0.00005639794,0.00035530544,0.0038226834,0.00047585153,0.98263115,0.0018980986,0.010118092],"study_design_scores_gemma":[0.000020147747,0.0000128755855,0.00043880125,0.000027800417,0.000017016418,0.000090419344,0.00024944448,0.01785052,0.00027185926,0.97549635,0.0055148397,0.000009801545],"about_ca_topic_score_codex":0.0058754846,"about_ca_topic_score_gemma":0.006799306,"teacher_disagreement_score":0.010963082,"about_ca_system_score_codex":0.0016626725,"about_ca_system_score_gemma":0.0009662327,"threshold_uncertainty_score":0.036675155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6272511,0.0016253205,0.33096164,0.0019616126,0.00040419094,0.00038098122,0.0026358468,0.0012850529,0.033494346],"genre_scores_gemma":[0.8101431,0.0008494693,0.17257342,0.00047474026,0.000091627335,0.0003814916,0.0021466345,0.0006649877,0.012674508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943787,0.000107193744,0.000053096745,0.00012690542,0.00015169439,0.00012325941],"domain_scores_gemma":[0.9982855,0.0007618638,0.00013526586,0.0003571579,0.00028272977,0.00017738494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039142225,0.00043344204,0.00084750727,0.0017625517,0.0014828708,0.0018826132,0.0009440311,0.0011605213,0.0069971723],"category_scores_gemma":[0.006155585,0.0004172708,0.0005349108,0.0019400064,0.0011458063,0.0026742087,0.001647642,0.0008858707,0.0010326161],"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.0019363431,0.00022437138,0.0040739533,0.00090983097,0.00007000708,0.00043332853,0.0012547862,0.030934732,0.04268998,0.49927714,0.017117355,0.40107822],"study_design_scores_gemma":[0.000118261494,0.0003327123,0.0012849205,0.00033959578,0.000065769855,0.0005183556,0.0006985086,0.10095294,0.0314953,0.8434088,0.020707477,0.00007737228],"about_ca_topic_score_codex":0.0013244672,"about_ca_topic_score_gemma":0.0023634206,"teacher_disagreement_score":0.0069971723,"about_ca_system_score_codex":0.0010209943,"about_ca_system_score_gemma":0.0017150849,"threshold_uncertainty_score":0.023407876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19724132,0.0005618461,0.7899968,0.0017433662,0.00027185638,0.00015203003,0.003522639,0.0033585217,0.0031516333],"genre_scores_gemma":[0.60667837,0.0004750238,0.38517395,0.00028266147,0.0001842844,0.00011512565,0.0040927106,0.0004137208,0.0025841799],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987159,0.00025530427,0.00012021287,0.00038498358,0.00042440576,0.00009916809],"domain_scores_gemma":[0.9904233,0.0066287047,0.00035082418,0.001592865,0.0008259908,0.00017834757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008617087,0.0006380301,0.0009986483,0.0025112317,0.0008022047,0.0015931126,0.0016401691,0.0022605194,0.0037321511],"category_scores_gemma":[0.013377396,0.00048792057,0.0008662534,0.0028335308,0.0010550809,0.00481615,0.0015809061,0.0019110835,0.0010959186],"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.0020339657,0.0004870341,0.01471916,0.0008565193,0.00019416447,0.0030356953,0.0006185145,0.18875186,0.04179466,0.16782862,0.013317284,0.56636244],"study_design_scores_gemma":[0.00003591316,0.000113059614,0.0008412789,0.00005482509,0.00006710191,0.00047134646,0.00015199464,0.78974956,0.012548756,0.19173093,0.0042047286,0.000030449612],"about_ca_topic_score_codex":0.0019284666,"about_ca_topic_score_gemma":0.0023954029,"teacher_disagreement_score":0.0037321511,"about_ca_system_score_codex":0.0006798468,"about_ca_system_score_gemma":0.001106253,"threshold_uncertainty_score":0.012485266},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00973888,0.00035101103,0.98741406,0.00048913085,0.00014786609,0.00008852961,0.00011411863,0.0012054244,0.00045102093],"genre_scores_gemma":[0.09091638,0.00020244125,0.90591854,0.00021721181,0.00019166736,0.00018779999,0.00047738795,0.0006498069,0.0012387102],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902683,0.0056554847,0.00055402744,0.0015913334,0.0015811081,0.00034977283],"domain_scores_gemma":[0.90157527,0.077885896,0.0024160615,0.012060969,0.0050547407,0.0010070674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019735467,0.0015446469,0.003483522,0.0045212344,0.00270071,0.0030753391,0.0068679955,0.004086214,0.006635821],"category_scores_gemma":[0.1109476,0.0014494509,0.0025388217,0.004362316,0.0032813824,0.0070071323,0.0050947377,0.006414105,0.002244248],"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.001356735,0.00031534221,0.006300986,0.0005660742,0.0005130155,0.00047721993,0.00067622756,0.22871698,0.0049777464,0.11559072,0.014765853,0.6257431],"study_design_scores_gemma":[0.00011590805,0.00007036859,0.00066149223,0.000052412775,0.00008450338,0.00030989802,0.000073648735,0.8384218,0.002837759,0.15428007,0.0030455352,0.000046674224],"about_ca_topic_score_codex":0.00392517,"about_ca_topic_score_gemma":0.005483083,"teacher_disagreement_score":0.019735467,"about_ca_system_score_codex":0.0019389985,"about_ca_system_score_gemma":0.004312171,"threshold_uncertainty_score":0.10437238},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31652248,0.0018649237,0.6600009,0.002900584,0.00020446428,0.00022948527,0.00064937165,0.00037387435,0.017253796],"genre_scores_gemma":[0.92121464,0.0012634235,0.06540851,0.00039760064,0.00041579214,0.00025469676,0.0005966496,0.00015092385,0.010297846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973659,0.0010507623,0.000119791446,0.0006259927,0.00051352696,0.00032404947],"domain_scores_gemma":[0.9710231,0.022016186,0.0028547177,0.0016073278,0.0010929332,0.0014057525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003746054,0.0007598396,0.0020329403,0.0020416996,0.0017232635,0.0044719325,0.0040407977,0.0022329988,0.0056752735],"category_scores_gemma":[0.025270391,0.0015255765,0.0014655922,0.0033222905,0.0028856064,0.007072366,0.002624355,0.0028594015,0.0004849119],"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.00048297818,0.00016587129,0.0027165946,0.00020245134,0.000115701005,0.00030664806,0.0007087884,0.14230137,0.0020829292,0.83061635,0.0040972163,0.016203087],"study_design_scores_gemma":[0.00013303866,0.000060156992,0.00082480424,0.000032319458,0.00007148794,0.00032058722,0.0002282469,0.39867306,0.00063391885,0.5970002,0.0019907919,0.00003135079],"about_ca_topic_score_codex":0.0014766586,"about_ca_topic_score_gemma":0.0019002452,"teacher_disagreement_score":0.0056752735,"about_ca_system_score_codex":0.0019579188,"about_ca_system_score_gemma":0.00093858136,"threshold_uncertainty_score":0.019811213},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61154956,0.0007662035,0.37386703,0.0014859362,0.00033604167,0.000088663284,0.00097438873,0.0042963997,0.0066358726],"genre_scores_gemma":[0.9699055,0.00014590652,0.027953979,0.00006241431,0.00013342954,0.000061502236,0.0005058313,0.00017213532,0.0010592688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968624,0.0009696341,0.00024189068,0.0006372278,0.00074798113,0.0005408505],"domain_scores_gemma":[0.9627418,0.0284073,0.0013728864,0.004567864,0.0020382241,0.0008718723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005033051,0.0009721132,0.0018043402,0.0017868783,0.0014039516,0.0036361043,0.0019367039,0.001440678,0.0041088425],"category_scores_gemma":[0.035238612,0.00088806683,0.0007929833,0.002010502,0.0020432041,0.00805925,0.0023212105,0.0018695947,0.0007811628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004121684,0.0003481072,0.017776983,0.00026428932,0.0002780659,0.00027061405,0.00055692584,0.7356528,0.012006875,0.11810335,0.0061413962,0.10447888],"study_design_scores_gemma":[0.000024913707,0.00007686809,0.00079517055,0.000010300875,0.000025419262,0.000023710445,0.000037040012,0.94034034,0.0040985565,0.054259863,0.000292359,0.000015374862],"about_ca_topic_score_codex":0.0024831055,"about_ca_topic_score_gemma":0.0024965699,"teacher_disagreement_score":0.005033051,"about_ca_system_score_codex":0.002557184,"about_ca_system_score_gemma":0.0023037777,"threshold_uncertainty_score":0.026617587},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06659449,0.0022534437,0.92351866,0.0014585357,0.0002781671,0.00022242779,0.0025031746,0.0012634576,0.0019076301],"genre_scores_gemma":[0.33759683,0.0025810387,0.6363041,0.00033777382,0.00072773645,0.00055339275,0.015094445,0.00073145964,0.0060732765],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956802,0.0009231013,0.0006586634,0.0012540147,0.0011875972,0.00029632222],"domain_scores_gemma":[0.9801831,0.013623043,0.0016009595,0.0022129393,0.0019090099,0.00047089177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003806481,0.0012229314,0.0031662032,0.0040791724,0.0016726722,0.0028477018,0.0032092885,0.0036366745,0.003753056],"category_scores_gemma":[0.023717737,0.001110935,0.0014585026,0.008082368,0.0016642252,0.007633507,0.0020696477,0.0028834655,0.0014856834],"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.002019015,0.0006524173,0.004543444,0.0016820681,0.00035059013,0.0013731598,0.00073479104,0.4003227,0.011084102,0.06610705,0.018346306,0.49278435],"study_design_scores_gemma":[0.00010209754,0.00017032857,0.00062637444,0.00008139972,0.0000595795,0.00041745015,0.0003404545,0.849076,0.004620054,0.1408074,0.0036610968,0.00003782267],"about_ca_topic_score_codex":0.0030494612,"about_ca_topic_score_gemma":0.0024928497,"teacher_disagreement_score":0.0040791724,"about_ca_system_score_codex":0.0012555711,"about_ca_system_score_gemma":0.002932861,"threshold_uncertainty_score":0.020130873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31988877,0.000556122,0.62250745,0.0012265871,0.00043840337,0.00027288354,0.00026816624,0.0012193909,0.05362223],"genre_scores_gemma":[0.6244169,0.00043626726,0.3572222,0.00059172144,0.0001247301,0.00022467966,0.0003990621,0.00044517705,0.016139336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991423,0.0003596848,0.000042922926,0.00015032034,0.00017831757,0.00012655272],"domain_scores_gemma":[0.9978635,0.00115806,0.00014845365,0.00044393612,0.00023261676,0.00015342557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866974,0.0007989431,0.00084293424,0.00075271376,0.0010498286,0.0014382196,0.0008643068,0.00081844465,0.006236452],"category_scores_gemma":[0.0042334483,0.0006220974,0.0005862408,0.0010187377,0.0014392362,0.0015087445,0.0025464965,0.0012049811,0.0017357747],"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.0008248848,0.00025235035,0.0038948809,0.0005111072,0.000118970645,0.0009766925,0.0010677115,0.05429193,0.047464818,0.6791926,0.012483652,0.19892043],"study_design_scores_gemma":[0.00028906658,0.00051830866,0.0008981614,0.00013156034,0.00010073497,0.0010789908,0.0008020359,0.18855691,0.035721097,0.7412929,0.030525016,0.000085268504],"about_ca_topic_score_codex":0.00055770704,"about_ca_topic_score_gemma":0.0012845106,"teacher_disagreement_score":0.006236452,"about_ca_system_score_codex":0.00052865595,"about_ca_system_score_gemma":0.0010859935,"threshold_uncertainty_score":0.020863056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46231756,0.004748634,0.30804002,0.094013564,0.0025895503,0.00023764124,0.0017951485,0.0011285784,0.12512933],"genre_scores_gemma":[0.93127495,0.0017653093,0.04438513,0.004073732,0.0032849815,0.00029386766,0.00080672704,0.00042156916,0.013693717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897037,0.0032597624,0.00058018795,0.0032287322,0.0018365786,0.0013909433],"domain_scores_gemma":[0.86275584,0.11122133,0.003989492,0.010998383,0.005391678,0.0056433273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013238411,0.0015243777,0.004787709,0.0046185316,0.008508656,0.009465377,0.0075614513,0.007472591,0.01543333],"category_scores_gemma":[0.10483473,0.0029577212,0.0038252012,0.0055904314,0.01857476,0.04595593,0.014135405,0.014693062,0.0015346302],"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.00027720793,0.00008453622,0.0014545111,0.00012490831,0.000034890156,0.000116294636,0.0009662666,0.0034537567,0.00036557685,0.9807161,0.006391151,0.006014753],"study_design_scores_gemma":[0.00006417952,0.000020418871,0.00020889849,0.0000431853,0.000026185815,0.00008853531,0.00019833095,0.0077350116,0.00024029695,0.98893076,0.0024143965,0.000029863586],"about_ca_topic_score_codex":0.002353421,"about_ca_topic_score_gemma":0.0019826281,"teacher_disagreement_score":0.01543333,"about_ca_system_score_codex":0.0041218107,"about_ca_system_score_gemma":0.0018346676,"threshold_uncertainty_score":0.07001227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4698735,0.0027897854,0.46638954,0.004801463,0.0003315601,0.00010295907,0.0018578493,0.001801921,0.05205147],"genre_scores_gemma":[0.9069439,0.0013488245,0.07326076,0.00068341085,0.00048643426,0.000160461,0.0022369914,0.00077327975,0.014105993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984989,0.00043822406,0.00012521807,0.0003154205,0.00037977356,0.00024235155],"domain_scores_gemma":[0.97733194,0.015968956,0.0018228244,0.002500947,0.0014276532,0.00094763737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019882028,0.00059686013,0.0012594734,0.002791694,0.0020640336,0.0039793015,0.0019946177,0.0016812619,0.00743998],"category_scores_gemma":[0.022361357,0.0007634989,0.0006096677,0.0037517708,0.004130195,0.009139161,0.0035697897,0.003133693,0.0013175161],"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.00049074535,0.00008956812,0.0018156444,0.00014646974,0.000022713224,0.00021032667,0.0007594853,0.018515285,0.002663664,0.9314306,0.004798758,0.03905681],"study_design_scores_gemma":[0.000019872932,0.000043367327,0.00027636037,0.000044591114,0.000011921479,0.00007511368,0.000097343196,0.033090845,0.0010146417,0.96304244,0.0022668852,0.000016626513],"about_ca_topic_score_codex":0.0006821293,"about_ca_topic_score_gemma":0.00085682067,"teacher_disagreement_score":0.00743998,"about_ca_system_score_codex":0.0013042731,"about_ca_system_score_gemma":0.0012122045,"threshold_uncertainty_score":0.024889171},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5359805,0.00067937677,0.42392945,0.0005342619,0.00017482832,0.00015695216,0.006817568,0.0046339473,0.027093107],"genre_scores_gemma":[0.7888488,0.00059013587,0.1846054,0.00010528493,0.00005988912,0.00006116796,0.011058324,0.0007789497,0.013892009],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968386,0.000042324788,0.00002200609,0.000098106066,0.000084605876,0.00006908762],"domain_scores_gemma":[0.9981997,0.00087194925,0.00015686444,0.00035029958,0.00027030433,0.0001508086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023780821,0.00091646076,0.0007651366,0.0016777472,0.0005682969,0.001972147,0.0011336348,0.0007585258,0.014461424],"category_scores_gemma":[0.0032980086,0.0007191388,0.00070394896,0.0017921039,0.00059196446,0.0041684685,0.001868142,0.0012467211,0.0027190605],"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.0008463792,0.00041812845,0.014904658,0.0012160935,0.00015991407,0.0010495029,0.0013715357,0.24986148,0.016004303,0.24636923,0.03457414,0.43322468],"study_design_scores_gemma":[0.00008315072,0.00023893264,0.0026183836,0.0001736009,0.00013564389,0.00034766897,0.0016285379,0.6420314,0.014074497,0.31192994,0.026685908,0.000052347616],"about_ca_topic_score_codex":0.0020592434,"about_ca_topic_score_gemma":0.005519797,"teacher_disagreement_score":0.014461424,"about_ca_system_score_codex":0.00061649457,"about_ca_system_score_gemma":0.00047804133,"threshold_uncertainty_score":0.04837829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007480626,0.00021679136,0.98757136,0.00008986768,0.00015987846,0.0001160145,0.00012541408,0.0023112858,0.0019287185],"genre_scores_gemma":[0.0564942,0.00014039864,0.93477166,0.00013999353,0.00007232735,0.0001913397,0.00047010096,0.00023359072,0.0074862745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990963,0.000102367594,0.00006800306,0.0001982764,0.00046163425,0.00007348677],"domain_scores_gemma":[0.99917847,0.00017131501,0.00004042404,0.0002963651,0.00026624583,0.000047277666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063426147,0.00082969555,0.0013086213,0.001516976,0.00074867374,0.0012281728,0.0024485665,0.0013689701,0.014620622],"category_scores_gemma":[0.0019998776,0.0005203615,0.0006896851,0.0025678826,0.0003964858,0.0020908825,0.0020314152,0.0008849023,0.0070426227],"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.0004444283,0.00013921272,0.0005068188,0.00013980982,0.00008112357,0.000103515784,0.00002726483,0.01147698,0.035186347,0.008921738,0.007638179,0.93533456],"study_design_scores_gemma":[0.00034529497,0.00043214756,0.0014183047,0.000033045402,0.00014654589,0.0013881339,0.000059730475,0.8594705,0.068109825,0.03567264,0.032841112,0.00008276472],"about_ca_topic_score_codex":0.0011095976,"about_ca_topic_score_gemma":0.0016676068,"teacher_disagreement_score":0.014620622,"about_ca_system_score_codex":0.0003677266,"about_ca_system_score_gemma":0.0009874997,"threshold_uncertainty_score":0.048910916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18188164,0.0006014575,0.7935611,0.0003727955,0.000079704376,0.00011374501,0.0005488405,0.0005254467,0.022315286],"genre_scores_gemma":[0.79690486,0.00069235,0.18934706,0.00018552724,0.000059253303,0.00025366258,0.0012448211,0.00033058942,0.010981826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988416,0.00014382163,0.00009295498,0.00020203723,0.00054873974,0.00017073314],"domain_scores_gemma":[0.99767834,0.0011141071,0.00020633884,0.00039176494,0.0003757679,0.00023362263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008054264,0.0005102081,0.0015802605,0.002967337,0.0018623201,0.0028292884,0.002235932,0.001264567,0.0064344495],"category_scores_gemma":[0.006707116,0.0008024402,0.001253769,0.0023066644,0.002731206,0.0032281056,0.0064348727,0.0025843286,0.00078150013],"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.0000613513,0.000035101737,0.0005875747,0.000101503225,0.000018917444,0.000077459656,0.00044702584,0.023664102,0.0010809766,0.9359411,0.0015110825,0.03647382],"study_design_scores_gemma":[0.000020605128,0.000023880286,0.00025894665,0.00005154395,0.000016266176,0.00012290532,0.00023783412,0.08479358,0.0011568569,0.9084165,0.0048838546,0.000017127273],"about_ca_topic_score_codex":0.002098172,"about_ca_topic_score_gemma":0.0021380463,"teacher_disagreement_score":0.0064344495,"about_ca_system_score_codex":0.0012975656,"about_ca_system_score_gemma":0.0005834589,"threshold_uncertainty_score":0.021525323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038906597,0.00042150563,0.85158795,0.0028612565,0.0003872183,0.00027130696,0.00027738002,0.00031742328,0.1049694],"genre_scores_gemma":[0.7966223,0.00053643103,0.12625961,0.00053193653,0.0002829247,0.00047194585,0.0002379243,0.00013091035,0.07492606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793017,0.0011696066,0.00007648871,0.000300354,0.00031564487,0.0002078108],"domain_scores_gemma":[0.99687237,0.0015408784,0.0001720994,0.000679016,0.00042168924,0.00031410527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025005394,0.0008636461,0.0011186119,0.0010305577,0.0011196219,0.0028161472,0.0016248997,0.0014143531,0.02093646],"category_scores_gemma":[0.008583935,0.00048000913,0.0005602177,0.001199047,0.0015671417,0.0028140738,0.0028166159,0.001931428,0.0024139578],"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.0002377733,0.00019677822,0.00042696708,0.00015078676,0.000064915504,0.00007851025,0.00014486854,0.06457633,0.001592637,0.8398634,0.013152063,0.07951501],"study_design_scores_gemma":[0.000055559107,0.00010462943,0.00019670962,0.00003409234,0.000029734905,0.000123357,0.000093297225,0.22140414,0.0007812904,0.7679811,0.009174407,0.000021703627],"about_ca_topic_score_codex":0.00032648246,"about_ca_topic_score_gemma":0.0005019586,"teacher_disagreement_score":0.02093646,"about_ca_system_score_codex":0.00094933924,"about_ca_system_score_gemma":0.0012123621,"threshold_uncertainty_score":0.07003945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04700812,0.0003978353,0.938763,0.0005843039,0.00017453637,0.00008717048,0.00018001423,0.00038474408,0.012420243],"genre_scores_gemma":[0.56648797,0.00028452434,0.42378014,0.00021898314,0.000119998695,0.00017447473,0.00025304974,0.00049173244,0.0081891185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961877,0.00011978526,0.000016680307,0.00010714282,0.00009775684,0.00003987703],"domain_scores_gemma":[0.9989863,0.0006824279,0.00006153671,0.000081923805,0.00011189928,0.00007585151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091042765,0.00080778636,0.0016186652,0.00065018417,0.00049088546,0.0012656925,0.00148954,0.0026303339,0.005361234],"category_scores_gemma":[0.0044554723,0.00079796836,0.0006015822,0.0005785597,0.00097286777,0.0010905213,0.0020203632,0.0010963613,0.0006279076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096978656,0.000042361786,0.00026129858,0.00009323714,0.000016498285,0.00010887539,0.00003997601,0.9578908,0.0022952245,0.016324272,0.0018761109,0.020954348],"study_design_scores_gemma":[0.000009856253,0.000021947742,0.000030947143,0.0000057642046,0.000003837859,0.000018406497,0.000005212653,0.99615127,0.00030681244,0.002877637,0.00056526775,0.0000030225629],"about_ca_topic_score_codex":0.0021694172,"about_ca_topic_score_gemma":0.0016496079,"teacher_disagreement_score":0.005361234,"about_ca_system_score_codex":0.00077464175,"about_ca_system_score_gemma":0.0007180893,"threshold_uncertainty_score":0.017935097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27985546,0.00093131524,0.4584694,0.0029355695,0.00062568136,0.00021290296,0.0014907653,0.0015513758,0.2539274],"genre_scores_gemma":[0.857958,0.0006467318,0.039499115,0.00097484747,0.0002261893,0.00018327414,0.0014786095,0.00061769196,0.09841554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969745,0.00006012424,0.000011894902,0.000092677925,0.00008575265,0.000052008036],"domain_scores_gemma":[0.9984926,0.00036902213,0.0001871147,0.000311789,0.00028923183,0.00035017086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003047588,0.0005928385,0.00087835867,0.0020430302,0.0016407259,0.0020019333,0.0010855389,0.0010525892,0.02543684],"category_scores_gemma":[0.0022323413,0.00045109793,0.00061880064,0.0011702324,0.001463475,0.0023177708,0.002536719,0.0023825238,0.0034646366],"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.000053175434,0.000036665813,0.00046688406,0.000053089396,0.000015494501,0.00010228194,0.00011025375,0.003359096,0.0014049344,0.9718927,0.005819333,0.01668619],"study_design_scores_gemma":[0.000018058443,0.000019958681,0.00032496598,0.000019528345,0.00001379742,0.00014178081,0.00013676299,0.01258276,0.0009098394,0.9769503,0.0088708345,0.000011557105],"about_ca_topic_score_codex":0.0010571319,"about_ca_topic_score_gemma":0.0017099712,"teacher_disagreement_score":0.02543684,"about_ca_system_score_codex":0.00069892145,"about_ca_system_score_gemma":0.00063242315,"threshold_uncertainty_score":0.08509475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032899782,0.00067251886,0.95910615,0.0003643073,0.00026548622,0.00012152016,0.00033077717,0.001933194,0.004306301],"genre_scores_gemma":[0.44042122,0.0006723174,0.54513997,0.00044039162,0.00036121963,0.0003359366,0.0014184179,0.00044573096,0.010764754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971016,0.0009920578,0.00021711321,0.0005652305,0.0009148081,0.00020910459],"domain_scores_gemma":[0.9947531,0.002425533,0.00019785929,0.0020195,0.00045346413,0.00015044735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019099552,0.0005611511,0.001708209,0.0023817567,0.00087120297,0.001578558,0.0016035265,0.0014843513,0.0057193167],"category_scores_gemma":[0.010691084,0.0005919916,0.0009741627,0.003991082,0.001040883,0.0030850044,0.002644052,0.0013568721,0.0021316814],"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.0012765991,0.00035084155,0.002550717,0.0002755389,0.00016555979,0.00027923685,0.00014905319,0.11684503,0.016840959,0.10137787,0.010794171,0.74909437],"study_design_scores_gemma":[0.000095700816,0.00017732619,0.00054601766,0.000031446983,0.000057264384,0.00037496514,0.00004432609,0.8325185,0.015846536,0.14455499,0.0057269493,0.000025968928],"about_ca_topic_score_codex":0.0009299802,"about_ca_topic_score_gemma":0.0011473246,"teacher_disagreement_score":0.0057193167,"about_ca_system_score_codex":0.0006200986,"about_ca_system_score_gemma":0.0013653961,"threshold_uncertainty_score":0.019132972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091111556,0.0007583059,0.7804334,0.0010531475,0.00051987194,0.00061407965,0.0019448376,0.00268946,0.12087534],"genre_scores_gemma":[0.54342353,0.0009538138,0.40479478,0.00042113083,0.00023606657,0.0004402282,0.0025856504,0.0005354636,0.04660937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986864,0.0002680551,0.00012763844,0.00024637327,0.0004209645,0.0002505829],"domain_scores_gemma":[0.9963858,0.00079454435,0.00022342906,0.0018355731,0.0004657623,0.00029488362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001197214,0.0006489287,0.00096448,0.0013910122,0.0014374466,0.003107631,0.0023593127,0.00102384,0.0220131],"category_scores_gemma":[0.0045912783,0.000493777,0.0006905125,0.0024195414,0.0008574267,0.004164201,0.0026760346,0.0020720598,0.0037594584],"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.00064664584,0.00030211356,0.00042358637,0.00019774998,0.00003409608,0.000100568854,0.00028059847,0.025289826,0.0084398305,0.7726931,0.015765334,0.1758266],"study_design_scores_gemma":[0.0002239907,0.00040853408,0.00044492292,0.00011764978,0.000090079884,0.0003604065,0.00029741775,0.15529774,0.01158574,0.7609297,0.07015692,0.000086819535],"about_ca_topic_score_codex":0.000572378,"about_ca_topic_score_gemma":0.00076276914,"teacher_disagreement_score":0.0220131,"about_ca_system_score_codex":0.0013031852,"about_ca_system_score_gemma":0.0010880148,"threshold_uncertainty_score":0.07364112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10538456,0.00029486706,0.88426477,0.00011776838,0.00006300021,0.00006230848,0.0001470403,0.0003326565,0.0093329875],"genre_scores_gemma":[0.64870536,0.0006509688,0.34346247,0.000051225958,0.00004677852,0.00008160421,0.0002974048,0.00022698725,0.006477112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973756,0.000058524536,0.000011134623,0.000033769415,0.00013479816,0.000024313364],"domain_scores_gemma":[0.998917,0.0006027627,0.00009641071,0.00017545334,0.00014577464,0.000062569954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040098856,0.0004638322,0.0005568248,0.0010296279,0.0003131405,0.0010739891,0.0008777928,0.00055390917,0.0023832766],"category_scores_gemma":[0.004069751,0.00045277615,0.00037986191,0.0008970453,0.00070545566,0.0009169137,0.0013360032,0.0010587212,0.00040842837],"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.00027127637,0.000090062575,0.0011758719,0.00015415686,0.000028817367,0.00016083386,0.00033865834,0.7251454,0.00970925,0.13435453,0.0018542857,0.1267169],"study_design_scores_gemma":[0.000013059275,0.00003892668,0.000115137685,0.000013460812,0.0000061617684,0.000063966116,0.00003969849,0.9663314,0.0016903522,0.029107116,0.002575489,0.000005246799],"about_ca_topic_score_codex":0.0014680289,"about_ca_topic_score_gemma":0.001932717,"teacher_disagreement_score":0.0023832766,"about_ca_system_score_codex":0.00044652645,"about_ca_system_score_gemma":0.00033343225,"threshold_uncertainty_score":0.007972777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023172215,0.0007077422,0.9724337,0.00026731862,0.000070596216,0.0000818252,0.00027023375,0.0004957673,0.0025005986],"genre_scores_gemma":[0.26404858,0.0010531835,0.72726935,0.00010987586,0.00009207109,0.00023983765,0.0015051881,0.00034380853,0.0053382334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991548,0.00019548064,0.00006165354,0.00015790276,0.0002965543,0.00013356122],"domain_scores_gemma":[0.9959721,0.0028854618,0.00019536815,0.00038602887,0.00036650262,0.00019455342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574772,0.0013164016,0.0018425706,0.0022788502,0.0010459861,0.0023247832,0.00304571,0.0015288849,0.005602495],"category_scores_gemma":[0.011096172,0.0009414868,0.0011395194,0.0039105215,0.0011601958,0.0032669818,0.0028075848,0.0028973126,0.000929157],"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.0003048631,0.0001450113,0.001376239,0.00026217068,0.00006121712,0.00005808587,0.0003296082,0.78542084,0.0011637388,0.06389819,0.005862846,0.14111714],"study_design_scores_gemma":[0.000032560994,0.000024389778,0.00008918229,0.000017227614,0.000012240115,0.000025087891,0.00005965865,0.96565086,0.00028643306,0.03256192,0.0012342542,0.0000062705076],"about_ca_topic_score_codex":0.009816318,"about_ca_topic_score_gemma":0.010748352,"teacher_disagreement_score":0.009816318,"about_ca_system_score_codex":0.00206283,"about_ca_system_score_gemma":0.0014310265,"threshold_uncertainty_score":0.019518375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008335424,0.00013405425,0.98725885,0.00029825282,0.00004293835,0.00008430486,0.00027700872,0.0009682309,0.002600848],"genre_scores_gemma":[0.15213536,0.00024436487,0.84264183,0.00021196417,0.00015914963,0.00030717466,0.0012822183,0.00057123124,0.002446728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937736,0.0013831173,0.0006291308,0.0017208644,0.0017344041,0.0007589005],"domain_scores_gemma":[0.97389627,0.018083988,0.0011947473,0.003917524,0.002286831,0.0006205699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005436039,0.0013372406,0.0024347792,0.005197567,0.0035013466,0.007447523,0.006379274,0.0032850886,0.0095809],"category_scores_gemma":[0.0359218,0.001365279,0.0031027442,0.0053139166,0.0054010055,0.012629806,0.006984723,0.0052138944,0.0024913775],"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.0005101724,0.000275654,0.0015468427,0.0003494283,0.00008659092,0.00019820916,0.00046511574,0.12654822,0.0049875444,0.67882055,0.0072080456,0.17900367],"study_design_scores_gemma":[0.000034478133,0.000064964224,0.00016168325,0.00007126268,0.00003899183,0.00008451087,0.000114712595,0.31411028,0.0036926512,0.67802095,0.0035584124,0.000047077774],"about_ca_topic_score_codex":0.003059611,"about_ca_topic_score_gemma":0.004216058,"teacher_disagreement_score":0.0095809,"about_ca_system_score_codex":0.0023197588,"about_ca_system_score_gemma":0.004715466,"threshold_uncertainty_score":0.032051325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002459424,0.00018575296,0.9954501,0.0001313905,0.000087394736,0.000044147047,0.000054774475,0.0007238499,0.0008631739],"genre_scores_gemma":[0.057384305,0.00029049226,0.9368362,0.00012978887,0.00015447875,0.00024324951,0.00051417155,0.0004250902,0.004022192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654764,0.00060844305,0.0002811032,0.0007745289,0.0014135437,0.00037480675],"domain_scores_gemma":[0.9928572,0.003068266,0.0004426877,0.0018506049,0.0015325631,0.00024861546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030516784,0.0023512624,0.0029206073,0.0033017257,0.0016343155,0.003026124,0.0040148534,0.0028487812,0.009571615],"category_scores_gemma":[0.01922415,0.0015130701,0.002165011,0.0039955084,0.0020290462,0.0044510434,0.0062878546,0.0041679894,0.0040782],"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.00061838876,0.0002578912,0.0009837536,0.00020040256,0.00012031822,0.00012443622,0.0001746924,0.18640843,0.0059332433,0.056909993,0.014172308,0.73409617],"study_design_scores_gemma":[0.0000876064,0.000063101485,0.00025036195,0.000022505,0.000043441207,0.00012136619,0.000060861516,0.91380703,0.0043791384,0.07646231,0.0046734335,0.00002881655],"about_ca_topic_score_codex":0.0032300625,"about_ca_topic_score_gemma":0.003855424,"teacher_disagreement_score":0.009571615,"about_ca_system_score_codex":0.0013026772,"about_ca_system_score_gemma":0.0026016172,"threshold_uncertainty_score":0.03202021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3801,0.00037197984,0.553287,0.0009387949,0.00038213076,0.00018966215,0.00070287084,0.0020870268,0.061940517],"genre_scores_gemma":[0.8943277,0.00019059727,0.09393909,0.00020221942,0.00007770526,0.00010066997,0.0005988257,0.0003513231,0.010211881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987992,0.0002044766,0.00008866811,0.00018492767,0.00038463256,0.00033813305],"domain_scores_gemma":[0.99737597,0.000991035,0.0001904728,0.000924558,0.00026776263,0.00025020208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095707184,0.0006334969,0.0008983929,0.0009396708,0.0013155306,0.0040096706,0.0011082514,0.0011915358,0.006579516],"category_scores_gemma":[0.003500543,0.0006598457,0.00080501544,0.0010915383,0.0018770678,0.005876008,0.003288447,0.0017601395,0.0011362458],"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.00057592685,0.000085458705,0.00041169848,0.000106570005,0.000028791896,0.00020995339,0.00069651316,0.010354274,0.009943782,0.94061,0.0024614371,0.034515787],"study_design_scores_gemma":[0.000062261046,0.000064436215,0.00015443316,0.000027431632,0.00003073381,0.00011449964,0.0002677719,0.031144485,0.008946911,0.95408934,0.005071643,0.000025942436],"about_ca_topic_score_codex":0.0006592259,"about_ca_topic_score_gemma":0.0013021103,"teacher_disagreement_score":0.006579516,"about_ca_system_score_codex":0.00074577314,"about_ca_system_score_gemma":0.00075699424,"threshold_uncertainty_score":0.022010684},"labels":[],"label_agreement":null},{"id":"W2168358943","doi":"10.1016/j.jda.2011.12.006","title":"Chains-into-bins processes","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bin; Ball (mathematics); Chain (unit); Combinatorics; Set (abstract data type); Object (grammar); Mathematics; Computer science; Process (computing); Mathematical optimization; Algorithm; Discrete mathematics; Geometry; Artificial intelligence; Physics","score_opus":0.021561247602419897,"score_gpt":0.22196563655160817,"score_spread":0.20040438894918827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168358943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0718637,0.00068994437,0.90565825,0.0017120796,0.00036548666,0.00032416533,0.0006268923,0.00045627574,0.018303225],"genre_scores_gemma":[0.643538,0.0019116348,0.2604951,0.0009745838,0.0005033776,0.0007138681,0.0015396547,0.0005275307,0.08979621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973074,0.0008562412,0.00015796501,0.0006047521,0.0004578904,0.0006157838],"domain_scores_gemma":[0.9903092,0.0055643404,0.0006739163,0.0012859128,0.0010626045,0.0011039991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348792,0.0017047192,0.0039854185,0.0018033689,0.0026560829,0.005099206,0.006211674,0.0051549138,0.02585294],"category_scores_gemma":[0.016231377,0.0020296585,0.0026453426,0.0044938675,0.0034510137,0.00943797,0.0053440086,0.0064944196,0.0030417917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006621724,0.0003383796,0.0010412956,0.00016589981,0.00008942321,0.00026396217,0.00021007351,0.326319,0.001322767,0.6397119,0.0062777344,0.02359743],"study_design_scores_gemma":[0.000105010564,0.000059922128,0.00014779842,0.000025293019,0.000033328473,0.0000505258,0.000072065755,0.66925097,0.0006232389,0.32786557,0.0017404606,0.000025767002],"about_ca_topic_score_codex":0.0048694923,"about_ca_topic_score_gemma":0.00490724,"teacher_disagreement_score":0.02585294,"about_ca_system_score_codex":0.0023554706,"about_ca_system_score_gemma":0.0017756772,"threshold_uncertainty_score":0.08648676},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13335843,0.00043630847,0.8574862,0.00026856677,0.000103041304,0.00006673008,0.00006813356,0.0011968015,0.0070157684],"genre_scores_gemma":[0.5245548,0.0001935457,0.47087154,0.00010167516,0.000037874543,0.00013021292,0.000121403275,0.00023503552,0.003753902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997304,0.0001033317,0.000013406727,0.00004710768,0.00006729831,0.00003851507],"domain_scores_gemma":[0.9996604,0.00018907616,0.000027077747,0.00006823484,0.00003477581,0.000020514677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037613342,0.0004939592,0.0008343633,0.00039831863,0.0003240606,0.0005011776,0.0006934498,0.0007404005,0.002605603],"category_scores_gemma":[0.0013585836,0.00034032387,0.00044406365,0.00059336534,0.00035587413,0.0006192762,0.00078559184,0.00081980665,0.00058564346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008632134,0.00043169872,0.0011748824,0.00023278552,0.00009114125,0.0001923559,0.00009822602,0.46261194,0.079334095,0.07527116,0.003969822,0.3757287],"study_design_scores_gemma":[0.00008764977,0.000104007304,0.00009185837,0.0000058671367,0.000015562126,0.000048536083,0.000011345401,0.96373135,0.010908992,0.023527548,0.0014579702,0.0000092766495],"about_ca_topic_score_codex":0.0003364543,"about_ca_topic_score_gemma":0.00078842405,"teacher_disagreement_score":0.002605603,"about_ca_system_score_codex":0.00028682675,"about_ca_system_score_gemma":0.000441218,"threshold_uncertainty_score":0.008716643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28444695,0.0017923192,0.67111456,0.0013452956,0.00017609082,0.000082255756,0.0008425897,0.00033946894,0.039860457],"genre_scores_gemma":[0.87972426,0.0014809174,0.10279272,0.0001401247,0.00005593157,0.00006795311,0.00075077236,0.00011507254,0.014872177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998895,0.000030568506,0.000007887686,0.000020720805,0.00003590324,0.00001542694],"domain_scores_gemma":[0.99972254,0.000117223535,0.000046806734,0.000025049563,0.000052721574,0.000035680958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023751093,0.0002590288,0.0006579019,0.0006550596,0.00039896125,0.0010091243,0.000807462,0.00086911605,0.0036943727],"category_scores_gemma":[0.0014476066,0.00022013632,0.00024721236,0.0008005175,0.00048188507,0.0016608024,0.0006883151,0.0007119207,0.00055481796],"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.0002208712,0.00004408716,0.0006421344,0.0002100665,0.000030702427,0.00018192608,0.00010512238,0.35451135,0.0039292984,0.6002984,0.004700799,0.035125326],"study_design_scores_gemma":[0.000042508436,0.00003621305,0.00036503875,0.000021636588,0.000012245559,0.00017919793,0.00007262623,0.65695244,0.0006528461,0.3377703,0.0038817085,0.000013269276],"about_ca_topic_score_codex":0.0010927322,"about_ca_topic_score_gemma":0.0010482181,"teacher_disagreement_score":0.0036943727,"about_ca_system_score_codex":0.0004905,"about_ca_system_score_gemma":0.00032141848,"threshold_uncertainty_score":0.0123589635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15594904,0.000575463,0.8361914,0.00037775666,0.000131162,0.00019286352,0.00033103558,0.0012387339,0.0050125443],"genre_scores_gemma":[0.45141825,0.0004463389,0.5409073,0.0001275795,0.00008369932,0.00011846191,0.0009367584,0.00040860847,0.005552977],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991708,0.00021584368,0.0000693572,0.00012846367,0.00030594977,0.00010967401],"domain_scores_gemma":[0.99442166,0.0029244204,0.0003345622,0.0012588067,0.00068643613,0.0003740767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006366,0.0004876886,0.0010859547,0.0015636323,0.0008123299,0.0013002588,0.0012478764,0.0010517582,0.0036971625],"category_scores_gemma":[0.007947642,0.0006484063,0.0005167331,0.0023374867,0.0010358138,0.0025500378,0.0020932127,0.0012374676,0.001057894],"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.001641329,0.00042015113,0.0045689014,0.00057938125,0.00007711886,0.0008619939,0.0010501761,0.22489995,0.046227485,0.21021096,0.013253239,0.49620938],"study_design_scores_gemma":[0.00010814182,0.00022026576,0.0004001112,0.00006081568,0.000033706317,0.00024186943,0.00017299052,0.816148,0.017371811,0.16002752,0.0051895105,0.000025272015],"about_ca_topic_score_codex":0.0010137082,"about_ca_topic_score_gemma":0.0023078346,"teacher_disagreement_score":0.0036971625,"about_ca_system_score_codex":0.0006073007,"about_ca_system_score_gemma":0.0010333582,"threshold_uncertainty_score":0.012368202},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012077898,0.00030939988,0.98175734,0.00038182657,0.00017656045,0.000057280897,0.00020804681,0.0012747566,0.0037568312],"genre_scores_gemma":[0.36611903,0.0006817306,0.6166944,0.00081677915,0.0006282889,0.00025175526,0.0009374874,0.00139937,0.012471255],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817526,0.0004925533,0.00008011556,0.0002558842,0.0007626073,0.00023364407],"domain_scores_gemma":[0.99524456,0.0017136274,0.00020592091,0.0018720519,0.0006210308,0.00034276565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026052438,0.00075861835,0.001586283,0.0016185712,0.0014695283,0.0018191248,0.0023911053,0.0015239117,0.008731791],"category_scores_gemma":[0.011149369,0.00064015435,0.0011403343,0.0022915287,0.0014378267,0.003946329,0.005092461,0.003031028,0.0020068418],"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.00131469,0.0002457925,0.0014291758,0.00020575235,0.00010573149,0.00025657113,0.00029142995,0.11950303,0.006044331,0.41210887,0.020451343,0.4380433],"study_design_scores_gemma":[0.00007663746,0.00010593613,0.0003030258,0.000043644683,0.000045151508,0.00016622251,0.000041762818,0.58282423,0.0022931555,0.40469852,0.009363947,0.000037801525],"about_ca_topic_score_codex":0.0015534697,"about_ca_topic_score_gemma":0.002687845,"teacher_disagreement_score":0.008731791,"about_ca_system_score_codex":0.0006257094,"about_ca_system_score_gemma":0.0016254034,"threshold_uncertainty_score":0.029210746},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034427205,0.021599231,0.0465734,0.32265514,0.022178918,0.000030383,0.00047467084,0.00018423451,0.5828613],"genre_scores_gemma":[0.28259137,0.056795217,0.042499077,0.14332598,0.066016115,0.00022448438,0.0011418635,0.00047222318,0.40693364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983602,0.00046186204,0.000040819104,0.00031771782,0.0006606625,0.00015873481],"domain_scores_gemma":[0.9966717,0.0010987184,0.00015808037,0.0005933362,0.0009894602,0.00048859266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022783526,0.00052362564,0.00059435103,0.0008389426,0.0013799506,0.004556315,0.00181542,0.0030444667,0.07962207],"category_scores_gemma":[0.0069419476,0.00015181761,0.0004647977,0.00073256827,0.0029989479,0.0053089154,0.0018979658,0.0047981306,0.011449471],"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.00002585109,0.000030392566,0.000088741646,0.00005004502,0.0000037594518,0.00003480662,0.00004690555,0.00027980513,0.00012102853,0.9054572,0.07018429,0.02367719],"study_design_scores_gemma":[0.0000204495,0.000019835348,0.00012280459,0.000095627176,0.00000333742,0.00013112961,0.00013250031,0.00087725575,0.00020288554,0.6688727,0.3295143,0.000007183867],"about_ca_topic_score_codex":0.001300558,"about_ca_topic_score_gemma":0.0014363738,"teacher_disagreement_score":0.9203779,"about_ca_system_score_codex":0.0020780724,"about_ca_system_score_gemma":0.0020035803,"threshold_uncertainty_score":0.2663623},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024836898,0.005368916,0.0034095172,0.14637692,0.82497156,0.00004526233,0.0008555579,0.0004029359,0.018320918],"genre_scores_gemma":[0.022281988,0.01642621,0.01071473,0.22012697,0.40255076,0.0003376506,0.0025260262,0.0023055754,0.32273003],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939758,0.0012857242,0.0007635571,0.0010227262,0.002460599,0.00049156655],"domain_scores_gemma":[0.9794341,0.0053080334,0.0007591238,0.0017007873,0.012259246,0.0005387161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036647862,0.0025610256,0.0028185584,0.0058075846,0.0047864416,0.0046618334,0.005280971,0.006927722,0.06447683],"category_scores_gemma":[0.04630154,0.0012474974,0.0032140634,0.0038869516,0.004123142,0.0066036675,0.00333467,0.009344429,0.033827838],"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.000018116232,0.0000072605935,0.000035612557,0.000073318915,0.00001331187,0.000059186525,0.000023548588,0.00007364905,0.00003897828,0.0048878225,0.99123806,0.0035311352],"study_design_scores_gemma":[0.000034945424,0.000026521313,0.0010015762,0.00026388493,0.000091969065,0.00024701032,0.00008101176,0.000907606,0.00035464962,0.024109688,0.97279435,0.00008664597],"about_ca_topic_score_codex":0.029408373,"about_ca_topic_score_gemma":0.035500597,"teacher_disagreement_score":0.06447683,"about_ca_system_score_codex":0.007180746,"about_ca_system_score_gemma":0.0038205744,"threshold_uncertainty_score":0.21569651},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01578853,0.00014610826,0.9812335,0.00023749436,0.00008456807,0.000034303237,0.00019017296,0.00030993955,0.0019754632],"genre_scores_gemma":[0.18842073,0.00040869843,0.8032405,0.00022213018,0.00012332742,0.000119927536,0.00076203217,0.0002707598,0.0064319796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999265,0.00016795499,0.000045932502,0.00010856479,0.00034116255,0.00007133576],"domain_scores_gemma":[0.9962632,0.0023070995,0.00027542957,0.0006089386,0.0003875963,0.0001576898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074082956,0.00085491233,0.0007320135,0.0007211768,0.00038665935,0.0011640076,0.0009562593,0.0012539728,0.0063825576],"category_scores_gemma":[0.007029813,0.00070174364,0.00046024076,0.0013378061,0.0006409804,0.0023737168,0.0014356442,0.0018460627,0.0011393398],"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.0007173801,0.00017942235,0.00085269427,0.0004116025,0.000058144393,0.00044366755,0.00020549413,0.42220816,0.028035173,0.109458566,0.014487482,0.42294222],"study_design_scores_gemma":[0.000038784357,0.00008355734,0.00012740439,0.000021788734,0.0000074488476,0.00016931798,0.000053771564,0.9439402,0.01034772,0.041665256,0.0035250336,0.000019722005],"about_ca_topic_score_codex":0.0033293637,"about_ca_topic_score_gemma":0.0045968234,"teacher_disagreement_score":0.0063825576,"about_ca_system_score_codex":0.0003869446,"about_ca_system_score_gemma":0.0011311097,"threshold_uncertainty_score":0.021351755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014599949,0.0004321618,0.9752548,0.00038500404,0.00020744764,0.00009210236,0.00088323036,0.0021657923,0.0059796106],"genre_scores_gemma":[0.14176747,0.0008931569,0.842441,0.0003314258,0.00026561835,0.00045730587,0.0030176248,0.000906918,0.009919471],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976931,0.00050466054,0.00034825626,0.0004777137,0.0007870671,0.00018917632],"domain_scores_gemma":[0.99384356,0.0021167663,0.00034120178,0.0026151254,0.00086494425,0.00021834642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206906,0.0006380578,0.0013133886,0.0020233209,0.0011975613,0.003516344,0.0017611444,0.0013213205,0.011445909],"category_scores_gemma":[0.011779214,0.0005808904,0.0008075059,0.00565326,0.001329503,0.0074394974,0.0031787842,0.0025085672,0.004999672],"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.00067778205,0.00015244987,0.0010024294,0.00026381173,0.000042590615,0.00024858754,0.0003354804,0.039658334,0.013326986,0.45012504,0.015507644,0.47865883],"study_design_scores_gemma":[0.000085555796,0.00030543894,0.0002896292,0.00016729189,0.000050743914,0.000625373,0.00019282741,0.30178642,0.020458072,0.6113914,0.064566635,0.000080590435],"about_ca_topic_score_codex":0.00044881695,"about_ca_topic_score_gemma":0.00042280863,"teacher_disagreement_score":0.011445909,"about_ca_system_score_codex":0.0008632319,"about_ca_system_score_gemma":0.0015256868,"threshold_uncertainty_score":0.03829038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029543452,0.004054298,0.9309245,0.0036800676,0.00021648416,0.000061075676,0.0002762892,0.00022250549,0.031021371],"genre_scores_gemma":[0.81045717,0.007285663,0.14776935,0.002036696,0.0021339618,0.0005146967,0.0011275585,0.00065936835,0.028015513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952461,0.0023077768,0.00020429144,0.0006525681,0.0012184669,0.00037084136],"domain_scores_gemma":[0.95758516,0.034358636,0.0019514577,0.002608459,0.0023606457,0.001135557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007010133,0.0013261158,0.0028692533,0.0041453694,0.0022007988,0.006621569,0.0035136999,0.002760191,0.009402183],"category_scores_gemma":[0.059941154,0.0009326347,0.0015024644,0.004754498,0.0070337784,0.0119195245,0.006064988,0.0046888045,0.00084608706],"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.000027162465,0.000015985785,0.00029936087,0.000046826754,0.000017444945,0.000015172887,0.000061241866,0.0075167785,0.0001413935,0.9824737,0.001485644,0.007899277],"study_design_scores_gemma":[0.000009473041,0.00000878961,0.000093100774,0.000018887442,0.0000074306618,0.000022617578,0.0000144617,0.04018482,0.00012756692,0.9580464,0.0014567475,0.000009759096],"about_ca_topic_score_codex":0.0028239805,"about_ca_topic_score_gemma":0.0014794025,"teacher_disagreement_score":0.009402183,"about_ca_system_score_codex":0.0037812593,"about_ca_system_score_gemma":0.0015408539,"threshold_uncertainty_score":0.037073553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047242735,0.0009449106,0.9394754,0.0007299039,0.00025071838,0.00017627008,0.0003408304,0.0012465416,0.009592687],"genre_scores_gemma":[0.29843444,0.0008124114,0.6788597,0.00036181178,0.00038560384,0.0003934534,0.0010769726,0.00048197908,0.019193722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973303,0.00078514277,0.0002120849,0.00041987022,0.0009772788,0.00027531284],"domain_scores_gemma":[0.99273294,0.0039132955,0.00048612786,0.001623404,0.0009529375,0.00029132326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002784891,0.0013645536,0.0014054948,0.0029983276,0.0012912404,0.0027818985,0.0017869243,0.0015475397,0.010762207],"category_scores_gemma":[0.022089958,0.00078093953,0.0007249888,0.0027718893,0.0022585487,0.0056981295,0.0035882075,0.0027593905,0.0031758859],"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.0007755924,0.0002290279,0.0008326599,0.00036205212,0.000050594317,0.00013542788,0.0004614001,0.067394614,0.0061931787,0.5543922,0.014114942,0.3550583],"study_design_scores_gemma":[0.00014039224,0.00024749493,0.00015834812,0.00008766407,0.000026182277,0.00020241215,0.00020986881,0.29191443,0.0064452146,0.6912337,0.009274818,0.00005946623],"about_ca_topic_score_codex":0.0013898185,"about_ca_topic_score_gemma":0.003184593,"teacher_disagreement_score":0.010762207,"about_ca_system_score_codex":0.0012743281,"about_ca_system_score_gemma":0.002050048,"threshold_uncertainty_score":0.036003172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08844643,0.0003853476,0.8996431,0.00021317863,0.00014777103,0.00026270954,0.00041548756,0.0031398183,0.0073462436],"genre_scores_gemma":[0.52947867,0.0002223396,0.4595768,0.00014248012,0.00006872681,0.00020872605,0.0010934768,0.0006279947,0.008580818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899465,0.00016086591,0.00006650868,0.00027606174,0.00030331165,0.0001986122],"domain_scores_gemma":[0.9978435,0.0011911801,0.00013277623,0.00047515723,0.00016319081,0.00019423092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095898873,0.0015048146,0.0025334612,0.0009729994,0.0007296264,0.0014744771,0.002379948,0.001921624,0.012954853],"category_scores_gemma":[0.00509878,0.0010919856,0.0016652825,0.00070863875,0.0013119633,0.0029315618,0.006191986,0.0018116832,0.0014104021],"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.0012735706,0.0002618516,0.0016226996,0.00038700688,0.00013142305,0.0003001093,0.00032957518,0.59101766,0.011580225,0.030366918,0.009204593,0.3535244],"study_design_scores_gemma":[0.000041723564,0.00009971577,0.00015730204,0.000017953093,0.000011223107,0.000046606678,0.000066902154,0.9791711,0.0014671857,0.018011877,0.00089799205,0.000010414928],"about_ca_topic_score_codex":0.0046355054,"about_ca_topic_score_gemma":0.0057462924,"teacher_disagreement_score":0.012954853,"about_ca_system_score_codex":0.0006414311,"about_ca_system_score_gemma":0.0008446822,"threshold_uncertainty_score":0.0433383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09919998,0.00024624268,0.88874584,0.00038664194,0.0002884186,0.00010584183,0.00014227167,0.0009349541,0.009949826],"genre_scores_gemma":[0.5203142,0.00033306537,0.46316257,0.00019388569,0.00009776604,0.00012335388,0.0002849984,0.0007702423,0.014719953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997584,0.000055770466,0.000014070314,0.00006846009,0.000061941326,0.000041322623],"domain_scores_gemma":[0.9993894,0.0002181591,0.00004744548,0.00016110914,0.00012777119,0.000056209265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052591885,0.0009801708,0.00093672046,0.0005381492,0.00039228177,0.00094509934,0.00079256925,0.0012142025,0.007682833],"category_scores_gemma":[0.002159066,0.00046262564,0.0006272464,0.0005130688,0.0005123487,0.0012089687,0.0010245299,0.0009892216,0.0015631878],"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.00079254893,0.0003219924,0.001548501,0.00042505615,0.000091998634,0.00041052405,0.00026528136,0.5470905,0.09927575,0.03297809,0.011014743,0.30578503],"study_design_scores_gemma":[0.000093558585,0.000782337,0.0005490736,0.000044706063,0.000053640622,0.00026452792,0.00020896726,0.9310031,0.029889433,0.029947693,0.0071387785,0.000024198991],"about_ca_topic_score_codex":0.00042886537,"about_ca_topic_score_gemma":0.00054778566,"teacher_disagreement_score":0.007682833,"about_ca_system_score_codex":0.00030921708,"about_ca_system_score_gemma":0.00055972586,"threshold_uncertainty_score":0.025701642},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70594865,0.0010274552,0.22338867,0.0011211851,0.0003766524,0.00010109497,0.00037361187,0.00057188544,0.06709068],"genre_scores_gemma":[0.9229555,0.00044916075,0.03469777,0.00046051905,0.00014129224,0.00009073534,0.00029313756,0.00026103493,0.040650852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999446,0.000112543916,0.000046987327,0.000081070604,0.0001886986,0.00012470776],"domain_scores_gemma":[0.99832326,0.0006628737,0.0002478307,0.00026580368,0.00031469113,0.00018564177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049097365,0.00043540326,0.0005238129,0.0018523054,0.00093027484,0.0019610978,0.00063122774,0.0010830902,0.0078360895],"category_scores_gemma":[0.005267479,0.00030696712,0.00038929255,0.0013171486,0.0020241558,0.0022871515,0.001445676,0.001328934,0.0010724289],"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.00019280883,0.000030383218,0.0005964128,0.000035435776,0.0000047090653,0.00021642653,0.00034007916,0.0043296167,0.0025528227,0.9704549,0.0017473141,0.019499047],"study_design_scores_gemma":[0.00003703951,0.00009098984,0.00059139857,0.00005835096,0.000013272197,0.00037612772,0.00029492495,0.04887199,0.004678952,0.9354814,0.009452533,0.000052964184],"about_ca_topic_score_codex":0.0025297466,"about_ca_topic_score_gemma":0.002817922,"teacher_disagreement_score":0.0078360895,"about_ca_system_score_codex":0.0012634902,"about_ca_system_score_gemma":0.0009373294,"threshold_uncertainty_score":0.026214361},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020380685,0.00021678313,0.96367645,0.00028758045,0.00029087742,0.00008796676,0.00016237004,0.002904972,0.011992419],"genre_scores_gemma":[0.22792365,0.00021567802,0.75185454,0.00036773892,0.00015976433,0.00024355296,0.0007302671,0.0015773507,0.016927399],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982882,0.00041807463,0.00012760653,0.00025822278,0.00062310917,0.00028474294],"domain_scores_gemma":[0.99797946,0.00050929206,0.000086590495,0.0007858853,0.00055284816,0.00008587725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674073,0.00078604853,0.0010769202,0.0011674945,0.0012584744,0.0019010721,0.0015633501,0.0009952153,0.0131495325],"category_scores_gemma":[0.006420679,0.0005729309,0.00071811734,0.0016497971,0.0010440283,0.0027610431,0.0029683753,0.0021752538,0.006345012],"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.0009528012,0.00016661039,0.0013454654,0.00026675427,0.00005853787,0.00036061692,0.000651414,0.015148065,0.05656088,0.2839632,0.023385268,0.6171404],"study_design_scores_gemma":[0.0002657143,0.0004865925,0.0011024355,0.00019163101,0.0000945135,0.0009131914,0.00061662437,0.21042243,0.22613905,0.4263635,0.13318768,0.00021662247],"about_ca_topic_score_codex":0.0011696696,"about_ca_topic_score_gemma":0.002453985,"teacher_disagreement_score":0.0131495325,"about_ca_system_score_codex":0.0006810319,"about_ca_system_score_gemma":0.0017860781,"threshold_uncertainty_score":0.04398954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2873821,0.0026870845,0.65164745,0.0026246554,0.00052395125,0.00015792192,0.0014967662,0.0019376486,0.051542472],"genre_scores_gemma":[0.8550064,0.0016231551,0.12515737,0.00058484485,0.00050816656,0.0002295564,0.0019522363,0.0005828709,0.014355351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769235,0.0006377248,0.0001521891,0.00043206004,0.00068971334,0.00039600994],"domain_scores_gemma":[0.9934237,0.00378119,0.00031870144,0.001732297,0.0004174758,0.00032662533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012251181,0.0008924004,0.0015702179,0.0018735388,0.0012310288,0.0026113358,0.0011343467,0.0018631552,0.008117757],"category_scores_gemma":[0.0126175815,0.00076860486,0.0010383828,0.0032596285,0.0014863231,0.0052201105,0.0039272252,0.0020035468,0.0013609438],"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.001129388,0.00022498795,0.002535792,0.00046251915,0.00015505916,0.00067958,0.00042637676,0.16597308,0.008324297,0.5762651,0.024199951,0.21962391],"study_design_scores_gemma":[0.000058994272,0.00012754653,0.0006258399,0.00006140357,0.0000625385,0.0004924653,0.00010147458,0.30943736,0.0046843486,0.6755155,0.008806509,0.000026024863],"about_ca_topic_score_codex":0.000615612,"about_ca_topic_score_gemma":0.00050857617,"teacher_disagreement_score":0.008117757,"about_ca_system_score_codex":0.0010618839,"about_ca_system_score_gemma":0.00087220466,"threshold_uncertainty_score":0.027156651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34961453,0.0028478834,0.5980974,0.013830266,0.0006129155,0.0005167553,0.0024494359,0.0020484705,0.029982332],"genre_scores_gemma":[0.82137424,0.0011256029,0.16328038,0.0011827296,0.0008852493,0.00047937265,0.0019986068,0.0006578777,0.00901596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901828,0.003233784,0.0007403014,0.0018112304,0.0026640391,0.0013678607],"domain_scores_gemma":[0.8511694,0.117312044,0.006351527,0.017836528,0.0049009556,0.0024295691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006607648,0.0013448591,0.0026812484,0.0025730429,0.0022402797,0.007570059,0.0057916436,0.003422309,0.010599058],"category_scores_gemma":[0.077908136,0.0010571213,0.002658919,0.005370851,0.00489488,0.020271646,0.0044452786,0.0055557517,0.0012156513],"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.0026837294,0.0007156366,0.012312137,0.0009562755,0.00027543807,0.00048847223,0.001038973,0.19629857,0.009127177,0.5814951,0.02030985,0.17429869],"study_design_scores_gemma":[0.00017368389,0.00025315987,0.002079532,0.00006365182,0.00023739773,0.0005015306,0.00028214272,0.47034085,0.005049089,0.517779,0.0031634502,0.00007665759],"about_ca_topic_score_codex":0.002464207,"about_ca_topic_score_gemma":0.0038615053,"teacher_disagreement_score":0.010599058,"about_ca_system_score_codex":0.003975282,"about_ca_system_score_gemma":0.005420459,"threshold_uncertainty_score":0.035457373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041695565,0.00070499524,0.94683427,0.0019472394,0.00012278139,0.000055573564,0.0003709463,0.00029117576,0.0079774745],"genre_scores_gemma":[0.5276483,0.0016203179,0.4509754,0.0008147819,0.00068137853,0.00039959,0.0019569346,0.0007694267,0.015133824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973368,0.0014130761,0.0000996673,0.0005906047,0.0003287818,0.00023108214],"domain_scores_gemma":[0.9860534,0.011793946,0.0004766164,0.0007512434,0.00043802924,0.00048677684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054136403,0.0011062088,0.003231538,0.0020885395,0.0017606198,0.0041489145,0.0031510468,0.003074582,0.013584342],"category_scores_gemma":[0.025186706,0.0013616974,0.0020667482,0.0022689297,0.0024251367,0.007075514,0.004164387,0.0042815288,0.0011518335],"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.00054217107,0.00030286438,0.0027361363,0.0002967771,0.00024891738,0.00016398281,0.0003142823,0.29137564,0.0007854828,0.60944426,0.0101830475,0.08360642],"study_design_scores_gemma":[0.000045307188,0.000048959002,0.00017505474,0.00002703172,0.000021158216,0.000043294724,0.000067639114,0.36404088,0.00025287003,0.63341296,0.0018477541,0.00001719698],"about_ca_topic_score_codex":0.0027482756,"about_ca_topic_score_gemma":0.002577103,"teacher_disagreement_score":0.013584342,"about_ca_system_score_codex":0.0016537777,"about_ca_system_score_gemma":0.0024614201,"threshold_uncertainty_score":0.04544419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11951122,0.010454915,0.60105395,0.00719096,0.0048368447,0.0017690291,0.041781392,0.023963055,0.18943864],"genre_scores_gemma":[0.466241,0.00777189,0.27400747,0.001296748,0.0020408323,0.0012699452,0.07272007,0.0030524556,0.17159948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975539,0.0004061572,0.00030318342,0.00028035953,0.0012458467,0.00021044347],"domain_scores_gemma":[0.99340785,0.0011639176,0.0002710176,0.0032533854,0.0015493719,0.000354509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011252745,0.0006549303,0.0013293233,0.008281692,0.0015348421,0.0067919134,0.0013289022,0.0011528379,0.04018693],"category_scores_gemma":[0.009472242,0.0005506195,0.0007045184,0.010563743,0.0011100385,0.008713184,0.0035155052,0.0015923475,0.020874102],"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.0007287676,0.00046943853,0.0025260088,0.000587012,0.000096397736,0.00028713694,0.00035363072,0.005600013,0.016164688,0.11445844,0.13277946,0.725949],"study_design_scores_gemma":[0.0002377136,0.00034672627,0.0033709717,0.00038144874,0.00022847574,0.0014749286,0.00069109135,0.12328401,0.06421448,0.42718795,0.37845993,0.0001221878],"about_ca_topic_score_codex":0.0014055187,"about_ca_topic_score_gemma":0.0017024485,"teacher_disagreement_score":0.04018693,"about_ca_system_score_codex":0.0013212324,"about_ca_system_score_gemma":0.0019883343,"threshold_uncertainty_score":0.1344387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84183925,0.0006518021,0.13247831,0.0014786259,0.0001878233,0.00008972105,0.00091211597,0.00047566902,0.021886682],"genre_scores_gemma":[0.97645444,0.0001423346,0.019075787,0.00011936006,0.00010636939,0.000108818786,0.00045078335,0.00011032812,0.0034316576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967616,0.0005925641,0.00028556728,0.0008474161,0.00089477573,0.00061811664],"domain_scores_gemma":[0.97690773,0.016223151,0.0017546895,0.0021337045,0.0009932463,0.0019874678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523338,0.00074483134,0.002355911,0.0021322079,0.0034394455,0.0061295745,0.0034858848,0.0023577565,0.0110146925],"category_scores_gemma":[0.01514486,0.0016107091,0.0019498059,0.0018881101,0.0054607503,0.012672995,0.003795303,0.0027645023,0.00046703455],"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.0007533125,0.00011412878,0.0060065207,0.00024372466,0.00006742929,0.0004094818,0.0012696985,0.005886997,0.0037987642,0.9716248,0.0017161213,0.008109136],"study_design_scores_gemma":[0.00008586517,0.000096270414,0.0018270108,0.000047555477,0.00007059069,0.0005117123,0.0005286883,0.017647559,0.0024928686,0.9746815,0.0019741382,0.000036182544],"about_ca_topic_score_codex":0.0005031394,"about_ca_topic_score_gemma":0.00061463384,"teacher_disagreement_score":0.0110146925,"about_ca_system_score_codex":0.0016478553,"about_ca_system_score_gemma":0.0009346914,"threshold_uncertainty_score":0.03684783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053142005,0.003109318,0.00021727155,0.032957837,0.9589942,0.00002870714,0.00007057347,0.000079244215,0.0044897087],"genre_scores_gemma":[0.00094824244,0.003058332,0.00022672379,0.017192695,0.9497626,0.000036124628,0.00006989244,0.00008796893,0.028617337],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960133,0.0006257399,0.00038531862,0.0005049922,0.0020643333,0.0004064136],"domain_scores_gemma":[0.9773687,0.00486013,0.0015801074,0.0009953165,0.01075391,0.0044418024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004228348,0.002720658,0.002800385,0.003807754,0.0022730832,0.0072197537,0.002388202,0.008828496,0.044571955],"category_scores_gemma":[0.029963352,0.0007639745,0.0018371745,0.001326633,0.0018623263,0.0025508152,0.001626021,0.010157118,0.025835743],"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.000020850955,0.0000065901913,0.000013840766,0.00004800009,0.0000073278666,0.000046538014,0.000001998503,0.000016678265,0.000017943834,0.00018357653,0.99536043,0.004276164],"study_design_scores_gemma":[0.00008076115,0.000019002868,0.00016846828,0.00020991745,0.000031950258,0.00020536626,0.000013874662,0.00019050708,0.00011543363,0.0013924878,0.9975593,0.000012727007],"about_ca_topic_score_codex":0.0011774286,"about_ca_topic_score_gemma":0.002803892,"teacher_disagreement_score":0.044571955,"about_ca_system_score_codex":0.0026136965,"about_ca_system_score_gemma":0.0031952611,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049525002,0.0030021134,0.00019772799,0.031721644,0.96127856,0.000024335075,0.00006169249,0.000070588474,0.0035937447],"genre_scores_gemma":[0.0008992077,0.0027488908,0.00018883518,0.017455807,0.9556753,0.000031215193,0.00006386948,0.00006538479,0.022871582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958507,0.0006830084,0.00042675063,0.00054254744,0.0020947948,0.0004020855],"domain_scores_gemma":[0.97723836,0.005332258,0.0017022244,0.0010352973,0.010128068,0.00456389],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045304527,0.0027329884,0.0027119108,0.0038116323,0.002147413,0.0075257127,0.0023299938,0.009225291,0.044099648],"category_scores_gemma":[0.03369509,0.0007790327,0.0018541005,0.0011535347,0.0018528397,0.0027491068,0.001822895,0.009985946,0.024943646],"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.000022610737,0.0000070731844,0.000016473807,0.00005615441,0.00000880864,0.000052354997,0.0000023782297,0.000019813866,0.00002019786,0.00022741237,0.994941,0.0046258103],"study_design_scores_gemma":[0.00008756751,0.000022393424,0.0001661451,0.00024237936,0.000033793265,0.00021728507,0.000014535107,0.00020365046,0.000112707196,0.0015586803,0.9973277,0.00001324995],"about_ca_topic_score_codex":0.00087317254,"about_ca_topic_score_gemma":0.0020635033,"teacher_disagreement_score":0.9559004,"about_ca_system_score_codex":0.002469466,"about_ca_system_score_gemma":0.0029156627,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056316043,0.0028352968,0.00021668403,0.029689698,0.96252793,0.000023847302,0.00008007521,0.00008118409,0.0044889515],"genre_scores_gemma":[0.00095020066,0.0028856737,0.00022622904,0.01371278,0.9527439,0.000033433225,0.00008392776,0.00008529196,0.02927856],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960865,0.0006350889,0.0003814909,0.00053115276,0.0019744707,0.00039129338],"domain_scores_gemma":[0.9780999,0.00518171,0.0016229918,0.0010751522,0.009715726,0.004304626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039157593,0.0025631802,0.0024834508,0.0033811326,0.0021398214,0.0071517495,0.0022244449,0.008242964,0.057355225],"category_scores_gemma":[0.032558143,0.00067841704,0.00150774,0.0010777869,0.0017189606,0.0027657356,0.0017597828,0.009365557,0.030764414],"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.000021537002,0.000007844049,0.000016858783,0.000057339355,0.000007074596,0.000055448836,0.000002526736,0.00001864587,0.000021082305,0.00026367223,0.9942356,0.0052924594],"study_design_scores_gemma":[0.0000675546,0.000017740573,0.00012017864,0.0001958308,0.000022335666,0.0001935567,0.000013334526,0.00016274054,0.000105015984,0.0015229038,0.9975683,0.0000103902685],"about_ca_topic_score_codex":0.0007068517,"about_ca_topic_score_gemma":0.0016403041,"teacher_disagreement_score":0.9426448,"about_ca_system_score_codex":0.0022331255,"about_ca_system_score_gemma":0.0027607856,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005757229,0.0033897301,0.0002173315,0.0336289,0.95811325,0.000026828118,0.00007386191,0.00008167243,0.004410913],"genre_scores_gemma":[0.00096632796,0.0029142061,0.00022365876,0.01664101,0.9488933,0.00003521995,0.00006988057,0.000078289166,0.030178016],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99641114,0.0006177759,0.00036023537,0.0004971613,0.0017449091,0.00036881503],"domain_scores_gemma":[0.98067766,0.0044511384,0.001400327,0.0009350834,0.008753588,0.0037822805],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039111343,0.0029323434,0.0028639908,0.003688219,0.002147655,0.0068083736,0.002262711,0.008862931,0.043567523],"category_scores_gemma":[0.027023584,0.0007893502,0.0017301306,0.0012058285,0.001700971,0.0025744888,0.0015707315,0.009910759,0.025266334],"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.00002550725,0.0000071891773,0.000013681619,0.000055340268,0.000007705038,0.000049506976,0.0000020551797,0.000016383563,0.000022269069,0.00017243729,0.9950664,0.0045615835],"study_design_scores_gemma":[0.000083276514,0.000021961361,0.0001792223,0.00020575116,0.000034333156,0.00023015036,0.00001352581,0.00018414714,0.0001250349,0.0011424937,0.9977671,0.000012985458],"about_ca_topic_score_codex":0.0009270554,"about_ca_topic_score_gemma":0.0021548253,"teacher_disagreement_score":0.95643246,"about_ca_system_score_codex":0.0021940803,"about_ca_system_score_gemma":0.002447394,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005761272,0.0023208882,0.0001580938,0.022296654,0.9703461,0.000021748154,0.00006838861,0.000072563154,0.004657938],"genre_scores_gemma":[0.0011478198,0.0027022136,0.00023705607,0.015317649,0.93126905,0.000037968384,0.00009996108,0.00008791803,0.049100358],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996874,0.0005086057,0.000379044,0.00042249195,0.0014979604,0.0003179184],"domain_scores_gemma":[0.9770697,0.0051969276,0.001753127,0.0011131747,0.0116204405,0.003246739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038544058,0.0025651264,0.0026774716,0.004961308,0.0024023948,0.0060567753,0.0022386091,0.008225981,0.05428324],"category_scores_gemma":[0.026756426,0.00079443585,0.0016078317,0.001689335,0.0014515622,0.002690642,0.0013984705,0.009319812,0.03289975],"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.000024722087,0.000006535257,0.000013830482,0.00006370206,0.00000673149,0.00007607578,0.0000030039096,0.000012318237,0.00003490651,0.00015103858,0.99449855,0.005108585],"study_design_scores_gemma":[0.000042863612,0.000016804534,0.0001815234,0.00015022607,0.000030113542,0.000243784,0.0000191221,0.00010587974,0.00014822053,0.00071803964,0.99833375,0.000009651955],"about_ca_topic_score_codex":0.0008153547,"about_ca_topic_score_gemma":0.0018439868,"teacher_disagreement_score":0.05428324,"about_ca_system_score_codex":0.0019375383,"about_ca_system_score_gemma":0.002219092,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005757229,0.0033897301,0.0002173315,0.0336289,0.95811325,0.000026828118,0.00007386191,0.00008167243,0.004410913],"genre_scores_gemma":[0.00096632796,0.0029142061,0.00022365876,0.01664101,0.9488933,0.00003521995,0.00006988057,0.000078289166,0.030178016],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99641114,0.0006177759,0.00036023537,0.0004971613,0.0017449091,0.00036881503],"domain_scores_gemma":[0.98067766,0.0044511384,0.001400327,0.0009350834,0.008753588,0.0037822805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039111343,0.0029323434,0.0028639908,0.003688219,0.002147655,0.0068083736,0.002262711,0.008862931,0.043567523],"category_scores_gemma":[0.027023584,0.0007893502,0.0017301306,0.0012058285,0.001700971,0.0025744888,0.0015707315,0.009910759,0.025266334],"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.00002550725,0.0000071891773,0.000013681619,0.000055340268,0.000007705038,0.000049506976,0.0000020551797,0.000016383563,0.000022269069,0.00017243729,0.9950664,0.0045615835],"study_design_scores_gemma":[0.000083276514,0.000021961361,0.0001792223,0.00020575116,0.000034333156,0.00023015036,0.00001352581,0.00018414714,0.0001250349,0.0011424937,0.9977671,0.000012985458],"about_ca_topic_score_codex":0.0009270554,"about_ca_topic_score_gemma":0.0021548253,"teacher_disagreement_score":0.043567523,"about_ca_system_score_codex":0.0021940803,"about_ca_system_score_gemma":0.002447394,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055070115,0.0028817472,0.00019119984,0.03241727,0.96009487,0.00002646386,0.00006556744,0.000067664834,0.0042002974],"genre_scores_gemma":[0.000935551,0.0029493424,0.00020432587,0.015973192,0.9508319,0.000034270313,0.00006710665,0.000068886984,0.028935345],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961826,0.0006516653,0.0004021114,0.0004964515,0.0018665466,0.00040050858],"domain_scores_gemma":[0.97860503,0.005174522,0.0015197485,0.001035465,0.0097418055,0.003923481],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004179413,0.0029450927,0.002807661,0.0038577851,0.0022253129,0.0068855155,0.0023515676,0.009303523,0.0427034],"category_scores_gemma":[0.027860774,0.00082551397,0.0018273541,0.0012602415,0.0017683493,0.002650696,0.0016096437,0.010406576,0.024948884],"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.000025431971,0.000007398994,0.00001470178,0.00005939051,0.000008319635,0.000056226745,0.0000021100145,0.000018896444,0.00002232143,0.00018371733,0.99507844,0.0045229644],"study_design_scores_gemma":[0.000078602556,0.000020946562,0.00017558776,0.00020271644,0.000034247503,0.00023128765,0.000014078261,0.000178449,0.00012738054,0.0010249848,0.9978992,0.000012671964],"about_ca_topic_score_codex":0.00092131423,"about_ca_topic_score_gemma":0.0021579475,"teacher_disagreement_score":0.9572966,"about_ca_system_score_codex":0.0024158396,"about_ca_system_score_gemma":0.002629841,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3754695,0.015932668,0.30734208,0.0659053,0.0017380557,0.0003868017,0.0061674393,0.0015950757,0.22546312],"genre_scores_gemma":[0.90221,0.008652661,0.05222139,0.004328086,0.0033897785,0.00041344838,0.004109873,0.00085868896,0.02381608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946004,0.0018407961,0.00024473426,0.00090069906,0.0014000152,0.0010134019],"domain_scores_gemma":[0.9281379,0.063174844,0.0018780321,0.0032276788,0.0015597045,0.002021757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046518636,0.0017862958,0.0039508822,0.003049442,0.0032113346,0.0065631703,0.006129212,0.0041953516,0.022428587],"category_scores_gemma":[0.042590875,0.0020672244,0.0027702646,0.005081838,0.007113402,0.023032328,0.0075194044,0.011291523,0.0019269484],"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.002226375,0.000607095,0.0035907961,0.0014411006,0.0002849317,0.0003969289,0.0012908386,0.13172886,0.0020906273,0.72270316,0.06725062,0.06638872],"study_design_scores_gemma":[0.00018098358,0.000060435104,0.0007554166,0.00009239956,0.000051697913,0.00015315309,0.00026947886,0.07906499,0.00033977555,0.9142644,0.0047368817,0.00003041405],"about_ca_topic_score_codex":0.0034945984,"about_ca_topic_score_gemma":0.0029841708,"teacher_disagreement_score":0.022428587,"about_ca_system_score_codex":0.0036588,"about_ca_system_score_gemma":0.002565617,"threshold_uncertainty_score":0.07503116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03411299,0.019117268,0.7238773,0.028776115,0.00719456,0.00020206026,0.0010296591,0.0010670695,0.18462302],"genre_scores_gemma":[0.6580257,0.01962118,0.19208089,0.020780077,0.009498273,0.0007486426,0.0018687063,0.0026840821,0.094692536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959615,0.0012016894,0.00019793668,0.000960071,0.0011194622,0.00055937114],"domain_scores_gemma":[0.9830556,0.011938117,0.00044702835,0.0022738352,0.0018589873,0.00042642644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042441213,0.0017015073,0.0027964038,0.00454227,0.0035086165,0.0051671993,0.0028886828,0.0031483038,0.017173553],"category_scores_gemma":[0.029791474,0.0010377127,0.0026518535,0.00626635,0.008461587,0.016327195,0.011946562,0.00890626,0.0036329788],"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.0002766922,0.000059151054,0.00038247087,0.00021106964,0.000046894813,0.00017394699,0.00042647243,0.0024437932,0.0017601463,0.9392055,0.023295846,0.03171802],"study_design_scores_gemma":[0.000057655747,0.0000616169,0.0004043522,0.00012668059,0.00006697222,0.00040023238,0.00013897853,0.01225962,0.0016143429,0.9502094,0.034603946,0.00005623332],"about_ca_topic_score_codex":0.0029513272,"about_ca_topic_score_gemma":0.0015950022,"teacher_disagreement_score":0.017173553,"about_ca_system_score_codex":0.0023424637,"about_ca_system_score_gemma":0.0014287491,"threshold_uncertainty_score":0.05745125},"labels":[],"label_agreement":null}]}