{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":10,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":10,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"5b9a4da6f9bc","filters":{"venue":"Prague Stringology Conference"}},"results":[{"id":"W2399734345","doi":"","title":"Improved Two-Way Bit-parallel Search","year":2014,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Sheridan College","funders":"","keywords":"String searching algorithm; Computer science; Sublinear function; String (physics); Algorithm; Bit array; Matching (statistics); Approximate string matching; Bit (key); Pattern matching; Theoretical computer science; Mathematics; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02664909317515039,"gpt":0.2750735642817489,"spread":0.2484244711065985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004894932,0.0001956223,0.0002502255,0.0001162263,0.0002081346,0.0001827454,0.00165278,0.0001128366,0.00005745363],"category_scores_gemma":[0.0001086154,0.0001710603,0.00004854151,0.0002226748,0.0001337023,0.0004736647,0.001078611,0.0003639954,0.00016157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002311543,"about_ca_system_score_gemma":0.0001306595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002560447,"about_ca_topic_score_gemma":0.00003010854,"domain_scores_codex":[0.9981443,0.0002068869,0.0002557048,0.0006594326,0.00020733,0.0005263531],"domain_scores_gemma":[0.998376,0.0002045675,0.0000982514,0.0009826416,0.0001655791,0.0001729487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003216377,0.0001204074,0.003019873,0.00002911571,0.00003416439,0.00002751974,0.0004372909,0.0002876216,0.01572798,0.6543509,0.00076649,0.3251664],"study_design_scores_gemma":[0.001452191,0.0003448003,0.01232952,0.00003264777,0.000007099737,0.00005985661,0.0000202475,0.9648409,0.00471157,0.007191263,0.008548785,0.0004610993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0390943,0.00004627512,0.9529138,0.0007616746,0.0004546648,0.0001581603,0.000004509839,0.0002323432,0.006334334],"genre_scores_gemma":[0.9283683,0.00001660733,0.07086238,0.0002457069,0.0001354053,0.00002249337,0.00001147458,0.000008793922,0.0003288287],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9645533,"threshold_uncertainty_score":0.6975636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2784266189","doi":"","title":"The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array.","year":2017,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Equivalence (formal languages); Suffix array; Suffix; Computer science; Mathematics; Combinatorics; Algorithm; Discrete mathematics; Data structure; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02896791561491554,"gpt":0.2742273210300127,"spread":0.2452594054150971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008908487,0.0001561126,0.000221581,0.00001672085,0.001561186,0.0003129582,0.003858458,0.00007288576,0.000006695694],"category_scores_gemma":[0.0007211822,0.00007070124,0.00006301449,0.00007417944,0.001702738,0.0003413838,0.001291815,0.0003368381,0.000006145558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007621835,"about_ca_system_score_gemma":0.0001856459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000257622,"about_ca_topic_score_gemma":0.0001334487,"domain_scores_codex":[0.9984754,0.0002835929,0.0002934024,0.0003708715,0.0002535192,0.0003232123],"domain_scores_gemma":[0.9966057,0.0005954555,0.0005003773,0.002073489,0.0001683107,0.00005664701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0002976467,0.0001158337,0.0318273,0.00005567566,0.0001582492,0.0000152551,0.002645987,0.00007319391,0.02767362,0.819041,0.0005875106,0.1175087],"study_design_scores_gemma":[0.007463317,0.0005214167,0.6114064,0.0005042477,0.0001431479,0.0002382698,0.0003373014,0.1951218,0.07914969,0.07301827,0.03097956,0.001116577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2066427,0.0007825777,0.7645167,0.01856712,0.002072462,0.0008814476,0.00002280861,0.0001032294,0.00641094],"genre_scores_gemma":[0.9973079,0.0002757226,0.001968225,0.0001296276,0.00008196953,0.00002380435,7.923533e-7,0.000004876822,0.0002071139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7906651,"threshold_uncertainty_score":0.9997386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295102091","doi":"","title":"Two squares canonical factorization","year":2014,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Lemma (botany); Factorization; Mathematics; Conjecture; String (physics); Combinatorics; Least-squares function approximation; Canonical form; Pure mathematics; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02014224060489709,"gpt":0.2683239865334741,"spread":0.248181745928577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001950122,0.0001259531,0.0001598689,0.00006353271,0.0001349968,0.0001209711,0.0008803538,0.00007977834,0.00004011035],"category_scores_gemma":[0.0001568902,0.0001107581,0.00002740413,0.00014715,0.00006724265,0.000394661,0.0004465454,0.0001792255,0.00006836279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002076467,"about_ca_system_score_gemma":0.0001215413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001709418,"about_ca_topic_score_gemma":0.00003958168,"domain_scores_codex":[0.9988211,0.0001391997,0.0001892787,0.000415005,0.0001620957,0.0002732848],"domain_scores_gemma":[0.9989704,0.0001668346,0.00009565125,0.0005605806,0.0001058412,0.0001007292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005570491,0.00003731092,0.008111449,0.000007333151,0.000008135727,0.000006829611,0.0001413697,0.0000988154,0.002009978,0.8977708,0.0003192343,0.09148321],"study_design_scores_gemma":[0.002679193,0.0007349924,0.1448686,0.00009977814,0.00002227761,0.000103505,0.00004167181,0.715336,0.01158622,0.05954405,0.06379974,0.001184011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02736034,0.00002406174,0.9662145,0.0004244174,0.0005174123,0.00007708599,0.000003548338,0.0001822575,0.005196334],"genre_scores_gemma":[0.9804112,0.000008451323,0.01920925,0.0001395734,0.0001149359,0.00001055074,0.00001557975,0.000004910785,0.00008559614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9530508,"threshold_uncertainty_score":0.4516583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2990480882","doi":"","title":"Algorithms to Compute the Lyndon Array Revisited.","year":2019,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01897337519445805,"gpt":0.2576895166637349,"spread":0.2387161414692768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000427114,0.0002150438,0.0002806229,0.00009908523,0.0001947045,0.0002428035,0.002361343,0.00008573389,0.0001054916],"category_scores_gemma":[0.00005907286,0.0001497708,0.00005882145,0.0004257983,0.00006414927,0.0003949935,0.001012938,0.0003455401,0.001009435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003044981,"about_ca_system_score_gemma":0.0001131691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007395827,"about_ca_topic_score_gemma":0.000005684195,"domain_scores_codex":[0.9981167,0.0001617335,0.0002827283,0.0006989538,0.0002779551,0.0004619369],"domain_scores_gemma":[0.9979321,0.0002420919,0.0001315858,0.00137794,0.0001656931,0.0001505554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005695755,0.0001869292,0.01242748,0.00007463849,0.0001214313,0.00009179785,0.002190315,0.0006006654,0.01672821,0.4654878,0.01797762,0.4840561],"study_design_scores_gemma":[0.002547003,0.001472289,0.1201403,0.0004789353,0.00004117515,0.0004328317,0.0001908435,0.3805847,0.01241384,0.01259757,0.4670385,0.00206195],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02596517,0.0001314695,0.9616758,0.002945682,0.00100595,0.0005111687,0.00001174031,0.0002114161,0.007541653],"genre_scores_gemma":[0.9314102,0.00003657052,0.065483,0.002147439,0.0001802058,0.00003297775,0.00001490518,0.00001252235,0.0006821816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.905445,"threshold_uncertainty_score":0.9997684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3117285148","doi":"","title":"Simple KMP Pattern-Matching on Indeterminate Strings.","year":2020,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Simple (philosophy); Indeterminate; Computer science; Matching (statistics); Algorithm; Mathematics; Statistics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.0373691897122394,"gpt":0.2672908017011263,"spread":0.2299216119888869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406107,0.0002236766,0.0002629158,0.00006797779,0.0001783162,0.0001915279,0.001448465,0.0001161848,0.00006484335],"category_scores_gemma":[0.00009369144,0.0002042719,0.00005104242,0.0001988023,0.0000569092,0.0004866927,0.001007095,0.000456903,0.0001728528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002282193,"about_ca_system_score_gemma":0.00008952483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006832691,"about_ca_topic_score_gemma":0.000005331744,"domain_scores_codex":[0.998269,0.0001052015,0.0002778931,0.0006935011,0.0002415351,0.0004129207],"domain_scores_gemma":[0.9988542,0.0001475429,0.0001643008,0.0005505631,0.00006928638,0.0002140636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000585199,0.0001561612,0.01077592,0.0001002258,0.00006096949,0.0006293489,0.003004801,0.000656987,0.005941485,0.08706306,0.002250358,0.8893021],"study_design_scores_gemma":[0.004268916,0.003035943,0.1136778,0.0003530064,0.00004237824,0.0001487751,0.0003530116,0.7711077,0.03505579,0.02662081,0.04258625,0.002749609],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2298124,0.00002183623,0.7657984,0.001818203,0.0002488796,0.0001553947,0.00001985799,0.0002936613,0.001831328],"genre_scores_gemma":[0.9949984,0.00001328261,0.002676929,0.002134273,0.0001185977,0.00001390695,0.00001491605,0.00001071513,0.00001897376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8865526,"threshold_uncertainty_score":0.8329964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2991315247","doi":"","title":"A Faster V-order String Comparison Algorithm.","year":2018,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Order (exchange); String (physics); Physics; Theoretical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03421952724317334,"gpt":0.2951806101801776,"spread":0.2609610829370043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002424302,0.0002311894,0.0003034379,0.0001400614,0.0002809424,0.0002277076,0.00146923,0.000148113,0.0001425917],"category_scores_gemma":[0.00007079676,0.000210236,0.00004116709,0.0003997987,0.0002295423,0.0006584206,0.001137377,0.0003225217,0.0003523346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003045252,"about_ca_system_score_gemma":0.0001577531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008475011,"about_ca_topic_score_gemma":0.00002551363,"domain_scores_codex":[0.9980493,0.0001097253,0.0003572427,0.0006890051,0.0002584142,0.0005362796],"domain_scores_gemma":[0.9983546,0.0001046117,0.000174938,0.0008617413,0.0003523378,0.0001517635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001625446,0.0001429027,0.00606943,0.00001336674,0.00004619058,0.00004138187,0.001215497,0.00001482757,0.001291396,0.08042248,0.002050957,0.9086753],"study_design_scores_gemma":[0.00160654,0.000857439,0.02460039,0.0001149282,0.0000223838,0.0001351062,0.0001903899,0.89538,0.01197237,0.007249975,0.05689171,0.0009787338],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02165639,0.00008161647,0.9720019,0.000429966,0.0008813504,0.0001537208,0.00000883384,0.000266952,0.004519276],"genre_scores_gemma":[0.8030639,0.00001013192,0.1961353,0.0002114313,0.0002760148,0.00001764456,0.00001068989,0.00001008109,0.0002649079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9076966,"threshold_uncertainty_score":0.8573174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402411904","doi":"","title":"On the Number of Distinct Squares.","year":2014,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Least-squares function approximation; Computer science; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0176302303259467,"gpt":0.2506568914963618,"spread":0.2330266611704151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004648999,0.0001083579,0.0001567258,0.00002802576,0.00008529652,0.00003942964,0.001118463,0.00005668872,0.0001499141],"category_scores_gemma":[0.0003811962,0.0000712165,0.00004259258,0.0001336291,0.0001802059,0.00008385726,0.0002459262,0.0001626319,0.0001429001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000080872,"about_ca_system_score_gemma":0.00004046919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000361168,"about_ca_topic_score_gemma":0.000004725426,"domain_scores_codex":[0.9990222,0.0001981034,0.0001761784,0.0002589243,0.0001360217,0.0002085164],"domain_scores_gemma":[0.9980634,0.001032041,0.0001269355,0.0006758109,0.0000629902,0.00003881355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003980717,0.00002202929,0.003731613,0.000005248596,0.000006550351,0.000001686641,0.0001138968,0.000004284406,0.0002086137,0.9838371,0.0001958538,0.01186913],"study_design_scores_gemma":[0.000764666,0.0003361258,0.1579966,0.0001196443,0.00001574774,0.0000720342,0.00006828947,0.06593323,0.01184447,0.7586319,0.003719224,0.0004980418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6951427,0.000008776401,0.2670309,0.001436209,0.0002396941,0.00008448239,0.000002420779,0.0000984185,0.03595635],"genre_scores_gemma":[0.9986691,0.000001886379,0.0008297841,0.0003476966,0.00002918871,0.00001209235,0.000001019812,0.000004301838,0.0001048765],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3035264,"threshold_uncertainty_score":0.2904125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2574587615","doi":"","title":"Forced Repetitions over Alphabet Lists.","year":2016,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Alphabet; Computer science; Natural language processing; Arithmetic; Mathematics; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02033900445680297,"gpt":0.2581649648182438,"spread":0.2378259603614408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001590181,0.0001433919,0.0001663196,0.00008424179,0.0001519179,0.00008097967,0.0009765902,0.0001019589,0.0002595832],"category_scores_gemma":[0.0001375772,0.00009830674,0.0000462311,0.0001499393,0.0001219961,0.000670204,0.0006250083,0.0001179626,0.0001669173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003041749,"about_ca_system_score_gemma":0.0001175794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004721292,"about_ca_topic_score_gemma":0.000012628,"domain_scores_codex":[0.9986947,0.00007278482,0.0002171652,0.0005126497,0.0001590757,0.0003436854],"domain_scores_gemma":[0.9986079,0.0001996638,0.0001126177,0.0008543855,0.0001094994,0.0001159059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001038099,0.00005144854,0.004442365,0.000007533586,0.00002036613,0.00004688644,0.00009506768,0.0000015708,0.01171983,0.8606943,0.003778141,0.1191321],"study_design_scores_gemma":[0.007564933,0.001361721,0.4410942,0.0007740622,0.00005760979,0.0004838411,0.00004867949,0.03595654,0.03834841,0.1710715,0.3005018,0.002736713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0358898,0.00004728053,0.9517279,0.001973849,0.0005041756,0.0001218939,0.00003075381,0.0002674568,0.009436861],"genre_scores_gemma":[0.9838794,0.00005504595,0.01466102,0.0002197576,0.0000836545,0.0000297665,0.000007782518,0.000006701523,0.00105689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9479896,"threshold_uncertainty_score":0.4008832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293388829","doi":"","title":"Crochemore's Repetitions Algorithm Revisited - Computing Runs.","year":2009,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Suffix array; Time complexity; Suffix; Extension (predicate logic); Compressed suffix array; Factorization; Parallel algorithm; Suffix tree; Data structure","retraction":null,"screen_n_in":null,"score":{"opus":0.01707766616431033,"gpt":0.2677945298609171,"spread":0.2507168636966068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794002,0.0002217114,0.0002929926,0.0001410043,0.0003476999,0.0002283187,0.00125161,0.000138139,0.00005302955],"category_scores_gemma":[0.0001056068,0.0002136565,0.00006668492,0.0004163375,0.00009053198,0.0005366241,0.0004626001,0.0003679661,0.00008238099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003493467,"about_ca_system_score_gemma":0.0001252312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002648086,"about_ca_topic_score_gemma":0.000001151762,"domain_scores_codex":[0.99814,0.0001039365,0.0003653852,0.0006983179,0.0002246134,0.0004677112],"domain_scores_gemma":[0.9984085,0.0001163272,0.0001949617,0.000908009,0.0002182121,0.0001540056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005678921,0.0001294205,0.0003240137,0.00001099874,0.00001831139,0.0001413452,0.0002541911,0.00002651586,0.002207461,0.2330506,0.00213561,0.7616959],"study_design_scores_gemma":[0.002159517,0.0008516613,0.08546436,0.0005271128,0.00004329124,0.0007781968,0.00008781558,0.8243575,0.006971774,0.04654988,0.03055551,0.001653468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005057879,0.0001923259,0.9854662,0.001412494,0.0002633143,0.0001613173,0.00001408338,0.0004398959,0.006992515],"genre_scores_gemma":[0.7168956,0.00006528547,0.2818957,0.0007614533,0.0001721577,0.000004630342,0.00005636079,0.000006784704,0.0001420679],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8243309,"threshold_uncertainty_score":0.8712659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402772263","doi":"","title":"A Formal Framework for Stringology.","year":2015,"lang":"en","type":"article","venue":"Prague Stringology Conference","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.05683039625031779,"gpt":0.3251004874468627,"spread":0.2682700911965449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953614,0.0002193613,0.0002893702,0.0001575365,0.0001385824,0.0001539973,0.001710917,0.0003205311,0.000006966834],"category_scores_gemma":[0.00130102,0.000203848,0.00006449566,0.0002961065,0.0001432786,0.0007729979,0.000649124,0.0004403489,0.00002291465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006696788,"about_ca_system_score_gemma":0.0003823741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003024958,"about_ca_topic_score_gemma":0.00001070614,"domain_scores_codex":[0.9982522,0.00007337896,0.0002899266,0.0005463833,0.0001863991,0.0006516819],"domain_scores_gemma":[0.9982488,0.0003253753,0.0001971585,0.0006336608,0.0004037053,0.0001913288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002876473,0.00002579895,0.0008981379,0.00001944801,0.00001388125,0.00001759757,0.0004670411,0.000003243403,0.000214194,0.9694183,0.0003823064,0.02851124],"study_design_scores_gemma":[0.0007168171,0.0005358811,0.0003637637,0.00005896074,0.00001336268,0.000138792,0.00007277342,0.007513945,0.01269312,0.974994,0.002465767,0.0004328156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01447647,0.0005960203,0.9809305,0.001456925,0.0004893788,0.0003501404,0.00000580841,0.0008823535,0.0008123885],"genre_scores_gemma":[0.5266582,0.00000369227,0.4728406,0.0002650798,0.00007494265,0.00008206953,0.000003796148,0.000007725925,0.00006395669],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5121817,"threshold_uncertainty_score":0.8312681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}