{"meta":{"query_hash":"5b9a4da6f9bc","filters":{"venue":"Prague Stringology Conference"},"cohort_total":10,"direct_labels_cover":0,"predictions_cover":10,"exported":10,"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/5b9a4da6f9bc","api":"https://metacan.xera.ac/api/v1/cohort?venue=Prague+Stringology+Conference"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01707766616431033,"score_gpt":0.2677945298609171,"score_spread":0.2507168636966068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293388829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005057879,0.00019232593,0.9854662,0.0014124943,0.00026331426,0.00016131732,0.000014083383,0.00043989593,0.0069925147],"genre_scores_gemma":[0.7168956,0.000065285465,0.28189567,0.0007614533,0.00017215771,0.0000046303417,0.00005636079,0.0000067847036,0.00014206787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814004,0.000103936516,0.00036538523,0.0006983179,0.00022461344,0.00046771122],"domain_scores_gemma":[0.9984085,0.00011632723,0.00019496171,0.000908009,0.00021821214,0.00015400563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794002,0.0002217114,0.00029299263,0.00014100428,0.00034769985,0.00022831874,0.0012516103,0.00013813897,0.00005302955],"category_scores_gemma":[0.00010560682,0.0002136565,0.000066684916,0.00041633745,0.000090531976,0.0005366241,0.00046260015,0.00036796607,0.00008238099],"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.000005678921,0.00012942053,0.00032401373,0.000010998743,0.000018311386,0.00014134517,0.00025419105,0.000026515863,0.002207461,0.23305061,0.0021356095,0.76169586],"study_design_scores_gemma":[0.0021595168,0.00085166126,0.08546436,0.0005271128,0.000043291242,0.0007781968,0.00008781558,0.82435745,0.0069717737,0.046549875,0.030555507,0.0016534681],"about_ca_topic_score_codex":0.000026480864,"about_ca_topic_score_gemma":0.0000011517617,"teacher_disagreement_score":0.8243309,"about_ca_system_score_codex":0.000034934674,"about_ca_system_score_gemma":0.00012523122,"threshold_uncertainty_score":0.8712659},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02014224060489709,"score_gpt":0.2683239865334741,"score_spread":0.24818174592857703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295102091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027360339,0.000024061737,0.96621454,0.00042441743,0.00051741226,0.00007708599,0.0000035483376,0.00018225746,0.0051963343],"genre_scores_gemma":[0.9804112,0.000008451323,0.019209247,0.00013957344,0.000114935894,0.000010550737,0.000015579748,0.000004910785,0.00008559614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882114,0.00013919968,0.0001892787,0.000415005,0.00016209572,0.00027328476],"domain_scores_gemma":[0.9989704,0.00016683464,0.00009565125,0.00056058064,0.00010584122,0.00010072917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019501224,0.00012595307,0.0001598689,0.00006353271,0.00013499684,0.00012097112,0.0008803538,0.000079778336,0.00004011035],"category_scores_gemma":[0.00015689024,0.000110758076,0.000027404132,0.00014715001,0.000067242654,0.00039466098,0.0004465454,0.00017922549,0.000068362795],"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.0000055704913,0.000037310918,0.008111449,0.000007333151,0.000008135727,0.0000068296113,0.00014136967,0.0000988154,0.002009978,0.89777076,0.0003192343,0.09148321],"study_design_scores_gemma":[0.0026791927,0.0007349924,0.1448686,0.00009977814,0.000022277609,0.000103504964,0.00004167181,0.71533597,0.011586223,0.05954405,0.06379974,0.0011840113],"about_ca_topic_score_codex":0.0001709418,"about_ca_topic_score_gemma":0.000039581675,"teacher_disagreement_score":0.9530508,"about_ca_system_score_codex":0.000020764668,"about_ca_system_score_gemma":0.00012154128,"threshold_uncertainty_score":0.45165834},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02664909317515039,"score_gpt":0.2750735642817489,"score_spread":0.24842447110659852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399734345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039094295,0.000046275116,0.95291376,0.0007616746,0.0004546648,0.0001581603,0.0000045098386,0.00023234317,0.006334334],"genre_scores_gemma":[0.92836833,0.000016607333,0.070862375,0.00024570693,0.00013540534,0.000022493374,0.000011474583,0.000008793922,0.0003288287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814427,0.0002068869,0.00025570477,0.0006594326,0.00020732997,0.0005263531],"domain_scores_gemma":[0.998376,0.00020456749,0.000098251396,0.0009826416,0.00016557911,0.00017294871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004894932,0.00019562231,0.00025022548,0.00011622626,0.00020813465,0.00018274535,0.0016527795,0.000112836635,0.000057453628],"category_scores_gemma":[0.000108615386,0.0001710603,0.000048541515,0.00022267483,0.00013370228,0.0004736647,0.0010786105,0.00036399544,0.00016157003],"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.000032163774,0.000120407385,0.0030198733,0.000029115707,0.000034164386,0.000027519744,0.00043729093,0.00028762163,0.015727978,0.65435094,0.00076649,0.32516643],"study_design_scores_gemma":[0.0014521912,0.00034480033,0.012329524,0.000032647768,0.0000070997366,0.000059856615,0.000020247504,0.9648409,0.00471157,0.0071912627,0.008548785,0.00046109932],"about_ca_topic_score_codex":0.00025604473,"about_ca_topic_score_gemma":0.00003010854,"teacher_disagreement_score":0.9645533,"about_ca_system_score_codex":0.000023115426,"about_ca_system_score_gemma":0.00013065946,"threshold_uncertainty_score":0.69756365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Least-squares function approximation; Computer science; Mathematics; Statistics","score_opus":0.0176302303259467,"score_gpt":0.2506568914963618,"score_spread":0.23302666117041507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402411904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69514275,0.000008776401,0.2670309,0.0014362086,0.0002396941,0.00008448239,0.0000024207789,0.000098418495,0.035956353],"genre_scores_gemma":[0.99866915,0.0000018863793,0.00082978414,0.00034769656,0.000029188706,0.000012092354,0.0000010198124,0.0000043018376,0.000104876504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.00019810339,0.00017617836,0.00025892426,0.00013602171,0.00020851642],"domain_scores_gemma":[0.9980634,0.0010320413,0.00012693554,0.0006758109,0.0000629902,0.00003881355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046489993,0.00010835795,0.00015672576,0.000028025765,0.00008529652,0.000039429637,0.0011184633,0.00005668872,0.00014991412],"category_scores_gemma":[0.0003811962,0.0000712165,0.000042592575,0.00013362912,0.00018020594,0.00008385726,0.00024592617,0.0001626319,0.00014290011],"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.0000039807173,0.000022029291,0.003731613,0.000005248596,0.000006550351,0.0000016866408,0.00011389683,0.000004284406,0.00020861372,0.9838371,0.00019585382,0.011869132],"study_design_scores_gemma":[0.00076466595,0.00033612584,0.15799664,0.00011964435,0.000015747737,0.0000720342,0.00006828947,0.065933235,0.011844466,0.7586319,0.003719224,0.0004980418],"about_ca_topic_score_codex":0.0000361168,"about_ca_topic_score_gemma":0.000004725426,"teacher_disagreement_score":0.3035264,"about_ca_system_score_codex":0.0000080872,"about_ca_system_score_gemma":0.000040469185,"threshold_uncertainty_score":0.29041246},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Programming language","score_opus":0.05683039625031779,"score_gpt":0.3251004874468627,"score_spread":0.26827009119654494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402772263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014476472,0.00059602025,0.9809305,0.0014569248,0.0004893788,0.00035014036,0.00000580841,0.00088235346,0.00081238855],"genre_scores_gemma":[0.5266582,0.0000036922704,0.47284058,0.00026507984,0.000074942654,0.000082069535,0.0000037961483,0.000007725925,0.000063956686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982522,0.000073378964,0.0002899266,0.00054638326,0.00018639908,0.0006516819],"domain_scores_gemma":[0.99824876,0.0003253753,0.00019715852,0.0006336608,0.00040370531,0.0001913288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953614,0.00021936126,0.00028937025,0.00015753655,0.00013858241,0.00015399732,0.0017109165,0.0003205311,0.0000069668336],"category_scores_gemma":[0.0013010196,0.00020384803,0.00006449566,0.00029610647,0.0001432786,0.00077299785,0.00064912403,0.0004403489,0.000022914654],"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.000028764725,0.00002579895,0.0008981379,0.00001944801,0.000013881255,0.000017597573,0.0004670411,0.000003243403,0.00021419405,0.96941835,0.0003823064,0.028511245],"study_design_scores_gemma":[0.0007168171,0.00053588115,0.00036376365,0.000058960744,0.000013362684,0.00013879205,0.00007277342,0.0075139445,0.012693118,0.974994,0.0024657669,0.00043281558],"about_ca_topic_score_codex":0.000030249581,"about_ca_topic_score_gemma":0.000010706142,"teacher_disagreement_score":0.5121817,"about_ca_system_score_codex":0.00006696788,"about_ca_system_score_gemma":0.00038237413,"threshold_uncertainty_score":0.83126813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Alphabet; Computer science; Natural language processing; Arithmetic; Mathematics; Linguistics","score_opus":0.02033900445680297,"score_gpt":0.2581649648182438,"score_spread":0.23782596036144082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574587615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0358898,0.000047280526,0.9517279,0.0019738488,0.0005041756,0.00012189386,0.000030753807,0.00026745678,0.009436861],"genre_scores_gemma":[0.9838794,0.000055045948,0.01466102,0.00021975764,0.0000836545,0.000029766501,0.000007782518,0.0000067015235,0.0010568905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99869466,0.00007278482,0.00021716524,0.0005126497,0.00015907573,0.00034368545],"domain_scores_gemma":[0.99860793,0.00019966383,0.00011261774,0.0008543855,0.00010949937,0.00011590595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015901813,0.00014339194,0.00016631957,0.00008424179,0.00015191792,0.00008097967,0.0009765902,0.00010195893,0.00025958323],"category_scores_gemma":[0.00013757717,0.00009830674,0.000046231104,0.00014993927,0.0001219961,0.000670204,0.00062500825,0.00011796256,0.0001669173],"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.000010380987,0.000051448536,0.0044423654,0.0000075335856,0.000020366133,0.00004688644,0.000095067684,0.0000015707996,0.011719828,0.86069435,0.0037781408,0.11913206],"study_design_scores_gemma":[0.0075649326,0.0013617213,0.44109425,0.00077406224,0.00005760979,0.00048384105,0.00004867949,0.03595654,0.038348407,0.17107148,0.30050176,0.0027367133],"about_ca_topic_score_codex":0.000047212918,"about_ca_topic_score_gemma":0.000012627999,"teacher_disagreement_score":0.9479896,"about_ca_system_score_codex":0.000030417492,"about_ca_system_score_gemma":0.00011757935,"threshold_uncertainty_score":0.40088323},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028967915614915542,"score_gpt":0.2742273210300127,"score_spread":0.24525940541509714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784266189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20664272,0.0007825777,0.7645167,0.018567117,0.0020724616,0.00088144763,0.00002280861,0.00010322944,0.0064109396],"genre_scores_gemma":[0.9973079,0.00027572262,0.0019682255,0.00012962762,0.000081969534,0.000023804352,7.9235326e-7,0.000004876822,0.00020711393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984754,0.00028359293,0.00029340235,0.00037087145,0.0002535192,0.00032321227],"domain_scores_gemma":[0.9966057,0.0005954555,0.00050037727,0.0020734887,0.00016831073,0.000056647008],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008908487,0.0001561126,0.00022158095,0.000016720853,0.0015611856,0.00031295817,0.0038584585,0.00007288576,0.0000066956936],"category_scores_gemma":[0.0007211822,0.000070701244,0.000063014486,0.00007417944,0.0017027381,0.00034138383,0.0012918147,0.00033683807,0.0000061455585],"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.00029764668,0.000115833725,0.031827305,0.000055675657,0.00015824921,0.000015255098,0.0026459866,0.00007319391,0.027673623,0.819041,0.0005875106,0.11750873],"study_design_scores_gemma":[0.007463317,0.00052141666,0.6114064,0.00050424767,0.00014314787,0.0002382698,0.00033730143,0.19512184,0.079149686,0.07301827,0.030979563,0.0011165771],"about_ca_topic_score_codex":0.00025762198,"about_ca_topic_score_gemma":0.00013344872,"teacher_disagreement_score":0.79066515,"about_ca_system_score_codex":0.0000076218353,"about_ca_system_score_gemma":0.00018564588,"threshold_uncertainty_score":0.99973863},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.018973375194458054,"score_gpt":0.25768951666373485,"score_spread":0.2387161414692768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990480882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025965167,0.00013146953,0.96167576,0.002945682,0.0010059503,0.00051116874,0.00001174031,0.00021141613,0.0075416532],"genre_scores_gemma":[0.9314102,0.000036570524,0.065483,0.0021474394,0.00018020583,0.000032977747,0.000014905177,0.000012522351,0.00068218156],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981167,0.00016173354,0.00028272835,0.0006989538,0.0002779551,0.00046193687],"domain_scores_gemma":[0.99793214,0.00024209186,0.00013158577,0.0013779403,0.00016569308,0.00015055537],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042711402,0.00021504384,0.00028062286,0.00009908523,0.00019470454,0.00024280346,0.0023613428,0.00008573389,0.00010549156],"category_scores_gemma":[0.00005907286,0.00014977084,0.00005882145,0.00042579827,0.00006414927,0.0003949935,0.0010129383,0.00034554015,0.0010094354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056957546,0.0001869292,0.012427483,0.00007463849,0.00012143134,0.000091797854,0.002190315,0.0006006654,0.016728213,0.4654878,0.017977623,0.48405614],"study_design_scores_gemma":[0.0025470033,0.0014722892,0.12014034,0.00047893525,0.00004117515,0.0004328317,0.00019084348,0.3805847,0.012413844,0.012597572,0.46703854,0.0020619503],"about_ca_topic_score_codex":0.00007395827,"about_ca_topic_score_gemma":0.0000056841945,"teacher_disagreement_score":0.90544504,"about_ca_system_score_codex":0.000030449808,"about_ca_system_score_gemma":0.00011316912,"threshold_uncertainty_score":0.9997684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Computer science; Order (exchange); String (physics); Physics; Theoretical physics","score_opus":0.03421952724317334,"score_gpt":0.2951806101801776,"score_spread":0.26096108293700426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991315247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02165639,0.00008161647,0.9720019,0.00042996596,0.00088135037,0.00015372083,0.00000883384,0.000266952,0.004519276],"genre_scores_gemma":[0.80306387,0.000010131924,0.19613525,0.00021143125,0.00027601485,0.000017644557,0.0000106898915,0.000010081087,0.00026490787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980493,0.00010972533,0.00035724274,0.00068900513,0.0002584142,0.00053627964],"domain_scores_gemma":[0.9983546,0.00010461169,0.00017493805,0.00086174125,0.00035233775,0.0001517635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024243024,0.00023118943,0.00030343793,0.00014006138,0.00028094242,0.00022770755,0.0014692299,0.00014811296,0.00014259166],"category_scores_gemma":[0.000070796756,0.00021023597,0.000041167088,0.0003997987,0.00022954235,0.0006584206,0.0011373765,0.00032252166,0.0003523346],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016254458,0.00014290267,0.00606943,0.00001336674,0.000046190577,0.000041381867,0.0012154975,0.000014827568,0.0012913964,0.08042248,0.002050957,0.9086753],"study_design_scores_gemma":[0.0016065399,0.00085743895,0.02460039,0.00011492818,0.000022383796,0.00013510622,0.00019038994,0.89538,0.01197237,0.007249975,0.05689171,0.0009787338],"about_ca_topic_score_codex":0.00008475011,"about_ca_topic_score_gemma":0.000025513633,"teacher_disagreement_score":0.9076966,"about_ca_system_score_codex":0.000030452524,"about_ca_system_score_gemma":0.00015775312,"threshold_uncertainty_score":0.8573174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Simple (philosophy); Indeterminate; Computer science; Matching (statistics); Algorithm; Mathematics; Statistics; Philosophy","score_opus":0.0373691897122394,"score_gpt":0.2672908017011263,"score_spread":0.2299216119888869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117285148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22981238,0.00002183623,0.76579845,0.0018182029,0.0002488796,0.00015539471,0.00001985799,0.00029366126,0.0018313277],"genre_scores_gemma":[0.9949984,0.000013282614,0.0026769289,0.0021342726,0.000118597745,0.0000139069525,0.0000149160505,0.000010715132,0.000018973758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826896,0.000105201456,0.0002778931,0.0006935011,0.00024153515,0.00041292066],"domain_scores_gemma":[0.9988542,0.00014754295,0.00016430084,0.0005505631,0.000069286376,0.00021406359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014061067,0.00022367663,0.0002629158,0.00006797779,0.00017831617,0.0001915279,0.001448465,0.000116184776,0.00006484335],"category_scores_gemma":[0.00009369144,0.00020427186,0.000051042418,0.00019880231,0.0000569092,0.0004866927,0.001007095,0.00045690296,0.00017285284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000585199,0.00015616119,0.010775922,0.0001002258,0.00006096949,0.0006293489,0.0030048012,0.00065698696,0.0059414846,0.08706306,0.0022503575,0.88930213],"study_design_scores_gemma":[0.004268916,0.0030359435,0.113677755,0.00035300644,0.000042378237,0.0001487751,0.00035301162,0.77110773,0.035055794,0.026620805,0.042586252,0.0027496093],"about_ca_topic_score_codex":0.00006832691,"about_ca_topic_score_gemma":0.0000053317435,"teacher_disagreement_score":0.8865526,"about_ca_system_score_codex":0.000022821929,"about_ca_system_score_gemma":0.00008952483,"threshold_uncertainty_score":0.8329964},"labels":[],"label_agreement":null}]}