{"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":"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.014148284,0.0009569721,0.9668861,0.0004906652,0.00029966485,0.0002145699,0.00029962056,0.0040014684,0.012702781],"genre_scores_gemma":[0.080861524,0.0005795998,0.9026989,0.00046224098,0.00028064288,0.0002799169,0.0007105518,0.0009947666,0.01313191],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99547654,0.00091048464,0.0003804468,0.0012065787,0.0016419135,0.00038397868],"domain_scores_gemma":[0.99461854,0.0018154245,0.0002981365,0.0020259847,0.0011152554,0.00012672442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430516,0.0015184395,0.0012640926,0.0022251839,0.0012034969,0.0027540305,0.0031805283,0.0016416846,0.0067053204],"category_scores_gemma":[0.012392051,0.00081101235,0.0017511225,0.0033727055,0.0023787213,0.007540911,0.0024103674,0.0028459125,0.0035736538],"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.0009911947,0.00012014675,0.0026584247,0.00053628447,0.00017552215,0.00025988946,0.0005433511,0.042302623,0.019454723,0.24017084,0.021965496,0.67082155],"study_design_scores_gemma":[0.0002692649,0.00070943515,0.0026452518,0.00036330993,0.00020668226,0.0023954709,0.00034059968,0.41512063,0.09507167,0.31353942,0.16903813,0.0003001934],"about_ca_topic_score_codex":0.0036011229,"about_ca_topic_score_gemma":0.0053622583,"teacher_disagreement_score":0.0067053204,"about_ca_system_score_codex":0.0014167244,"about_ca_system_score_gemma":0.0023434958,"threshold_uncertainty_score":0.022431493},"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":"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.10499192,0.0008688825,0.76293963,0.0020993017,0.0012939004,0.00020365202,0.0011925632,0.0023937868,0.124016404],"genre_scores_gemma":[0.68992037,0.00071113434,0.24627188,0.0013820201,0.0005226666,0.00033979764,0.001905506,0.00137382,0.05757278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998192,0.00023586012,0.00010540765,0.00067713816,0.00044004922,0.0003495802],"domain_scores_gemma":[0.9979961,0.00047009546,0.00014848188,0.0006444759,0.0005033694,0.00023750767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512983,0.000869203,0.00079090305,0.001219838,0.0017377116,0.0024204808,0.0008097258,0.0013476349,0.02297935],"category_scores_gemma":[0.004522679,0.0005636528,0.0011823575,0.0014100799,0.0028530955,0.0050886944,0.0024975722,0.0025584942,0.00626026],"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.00015035324,0.00004030414,0.00054353283,0.000088410445,0.000009218388,0.00036571687,0.00037202844,0.0015403315,0.004622645,0.9510365,0.0068805222,0.034350354],"study_design_scores_gemma":[0.000046474088,0.00010044752,0.0003435536,0.000050459945,0.000021480642,0.00071067765,0.00032015296,0.014035807,0.007664614,0.9236592,0.052981537,0.00006566284],"about_ca_topic_score_codex":0.0011258905,"about_ca_topic_score_gemma":0.0011767313,"teacher_disagreement_score":0.02297935,"about_ca_system_score_codex":0.0008476603,"about_ca_system_score_gemma":0.0012469016,"threshold_uncertainty_score":0.0768736},"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":"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.01731867,0.00081961363,0.9675991,0.00024093862,0.00022400537,0.00016980205,0.00033016523,0.005070286,0.0082275085],"genre_scores_gemma":[0.11863752,0.00042400556,0.86477804,0.00030432126,0.00010695255,0.0003082483,0.0011786523,0.0005151262,0.013747198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981287,0.00022574922,0.00017729535,0.00031157906,0.0010028176,0.00015391206],"domain_scores_gemma":[0.99783915,0.00047718047,0.00013407008,0.0007080831,0.00075716624,0.000084430096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007976225,0.0010621197,0.0016187755,0.0023140074,0.0009219719,0.0016589082,0.0028871833,0.0011554324,0.011291475],"category_scores_gemma":[0.004047522,0.0005897181,0.0009718936,0.004416298,0.0007408416,0.0037252284,0.0022791917,0.0013014178,0.005132981],"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.0008408947,0.00027666712,0.0009806419,0.00034301486,0.000101679245,0.000161883,0.000118663396,0.08338434,0.022044947,0.03536168,0.013492619,0.8428929],"study_design_scores_gemma":[0.00025262428,0.00025141556,0.00052209955,0.000038889735,0.00006451525,0.0004895144,0.00005019807,0.91871315,0.02251058,0.03708261,0.019966463,0.00005791256],"about_ca_topic_score_codex":0.003225834,"about_ca_topic_score_gemma":0.004674462,"teacher_disagreement_score":0.011291475,"about_ca_system_score_codex":0.0010858213,"about_ca_system_score_gemma":0.002481461,"threshold_uncertainty_score":0.03777373},"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":"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.19045964,0.0104534505,0.47336355,0.022646379,0.0040582633,0.0001682477,0.0019984264,0.00078972575,0.29606226],"genre_scores_gemma":[0.8442238,0.0034934129,0.10061046,0.0021210313,0.002379182,0.00035823075,0.0008551389,0.000589976,0.045368675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931625,0.0024300872,0.0005440464,0.001934544,0.0011794724,0.00074944133],"domain_scores_gemma":[0.93572885,0.049461752,0.002496088,0.0057427166,0.0036070293,0.0029635604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00600151,0.00089191884,0.0021441174,0.004131327,0.0048867827,0.0077320477,0.00339975,0.003709647,0.021022525],"category_scores_gemma":[0.05780078,0.0015020553,0.0013470446,0.0030011681,0.011215752,0.024923317,0.006698439,0.007863427,0.0038181504],"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.00011970209,0.000019069626,0.00071073667,0.00007604209,0.000016932288,0.00006336805,0.00020717531,0.0010883649,0.00040775537,0.98287994,0.0037747317,0.010636058],"study_design_scores_gemma":[0.000012162879,0.000012551508,0.0002526954,0.00003500089,0.000011539791,0.00012279913,0.00007894142,0.0029894214,0.00026639402,0.99287075,0.003333807,0.000013919287],"about_ca_topic_score_codex":0.0009560014,"about_ca_topic_score_gemma":0.0011428996,"teacher_disagreement_score":0.021022525,"about_ca_system_score_codex":0.0024092612,"about_ca_system_score_gemma":0.0012973968,"threshold_uncertainty_score":0.07032734},"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":"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.0018519388,0.002998941,0.9539691,0.0033766155,0.00077376456,0.00008375159,0.00044275424,0.00076005375,0.03574301],"genre_scores_gemma":[0.19155073,0.0049309307,0.7655622,0.0033029225,0.0022808919,0.0006397471,0.0021363744,0.0010496435,0.028546587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638534,0.0015449501,0.00041387847,0.00069801544,0.00071561383,0.000242203],"domain_scores_gemma":[0.9952974,0.0024523053,0.00031515217,0.0008745807,0.00075578154,0.00030484278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047976845,0.0010565429,0.00084305793,0.0041468465,0.002980242,0.0073530483,0.0029633814,0.0023812514,0.014673958],"category_scores_gemma":[0.009527232,0.001053049,0.0026076138,0.003864239,0.010288743,0.018477371,0.0055607837,0.005809077,0.0052565597],"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.0000040505806,0.0000054696325,0.000036094036,0.000036904024,0.000004426061,0.000044037402,0.00015034236,0.00021025725,0.000110139656,0.9934684,0.0016837745,0.0042461082],"study_design_scores_gemma":[0.0000065007102,0.0000058864944,0.000035286477,0.000044458702,0.0000059158992,0.00009277352,0.00009411531,0.0016752112,0.0001802856,0.96570563,0.0321458,0.000008080479],"about_ca_topic_score_codex":0.002768504,"about_ca_topic_score_gemma":0.0024313927,"teacher_disagreement_score":0.014673958,"about_ca_system_score_codex":0.002448746,"about_ca_system_score_gemma":0.0022332466,"threshold_uncertainty_score":0.049089253},"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":"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.11902699,0.005320279,0.78861064,0.002754702,0.0019820316,0.00029936148,0.0034226924,0.0076504685,0.070932865],"genre_scores_gemma":[0.72697043,0.001618627,0.21118638,0.0017332623,0.001019995,0.0004165721,0.004014851,0.0015218215,0.05151811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99621457,0.0010677384,0.000433631,0.0007232255,0.0011024266,0.00045840588],"domain_scores_gemma":[0.98542386,0.006600045,0.00074304873,0.005504855,0.0014392142,0.00028892313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00146556,0.0005971555,0.0008117615,0.0019299263,0.0014528455,0.0021131358,0.0022268402,0.0013686469,0.015805108],"category_scores_gemma":[0.018078363,0.00047369784,0.0007408882,0.0024796226,0.0012910463,0.005252101,0.0032204308,0.0017124679,0.005799658],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013047239,0.00021561704,0.0025505796,0.00075084285,0.00015023805,0.001944083,0.0009204087,0.02272027,0.017728033,0.5079235,0.0397037,0.40408802],"study_design_scores_gemma":[0.00008577144,0.00018658853,0.00072115124,0.00031352998,0.000095625204,0.001991432,0.00024446152,0.09553966,0.03383289,0.81462055,0.052289765,0.00007864114],"about_ca_topic_score_codex":0.000711901,"about_ca_topic_score_gemma":0.0012755813,"teacher_disagreement_score":0.015805108,"about_ca_system_score_codex":0.00089722354,"about_ca_system_score_gemma":0.0013672698,"threshold_uncertainty_score":0.052873313},"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":"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.104842156,0.0031640278,0.7028167,0.002806957,0.0013513925,0.00015836071,0.0019519343,0.0023405992,0.18056783],"genre_scores_gemma":[0.7783569,0.0018993695,0.15648486,0.002138501,0.0013408164,0.00030904682,0.0032874013,0.0010683902,0.05511472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970943,0.00071648305,0.0003128659,0.00062780624,0.00089649344,0.00035210123],"domain_scores_gemma":[0.9937496,0.0026625746,0.00046435834,0.0016195107,0.0012972158,0.00020677492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015138901,0.00028900075,0.00063407107,0.0015044034,0.0013085832,0.0043763863,0.0012051115,0.0010038839,0.01347017],"category_scores_gemma":[0.016361717,0.00041337917,0.000623881,0.0022873941,0.0029949555,0.009697365,0.003194848,0.0021918423,0.0037688354],"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.00020525612,0.000040773342,0.00041485974,0.00006958219,0.000012114506,0.00015981414,0.0004712645,0.0018111914,0.0030845376,0.9207232,0.0054218965,0.06758555],"study_design_scores_gemma":[0.00002571059,0.00009193961,0.00044166044,0.000057468646,0.000019594741,0.0002878781,0.00021639826,0.00872719,0.005007834,0.95554876,0.029543448,0.00003209655],"about_ca_topic_score_codex":0.0018594124,"about_ca_topic_score_gemma":0.001251085,"teacher_disagreement_score":0.01347017,"about_ca_system_score_codex":0.0011127361,"about_ca_system_score_gemma":0.0015586428,"threshold_uncertainty_score":0.045062244},"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":"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.009099554,0.0028767453,0.9657529,0.0017725436,0.00075407105,0.000069579066,0.00020553936,0.0019019538,0.017567106],"genre_scores_gemma":[0.17813508,0.002464641,0.78750145,0.0014952153,0.00084958057,0.0004126007,0.0009723239,0.0008796367,0.027289532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978751,0.0006293071,0.00019632211,0.0003725603,0.0006814173,0.00024535277],"domain_scores_gemma":[0.9942849,0.002937849,0.00022875823,0.0014252709,0.00093163893,0.00019154814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029399614,0.0009892541,0.0011555854,0.0022925963,0.0014183741,0.0040488485,0.00299333,0.0018949411,0.010175016],"category_scores_gemma":[0.019908508,0.00066392863,0.00083537045,0.004302778,0.0021273862,0.008710042,0.004347364,0.005502804,0.005012662],"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.00043992535,0.000100185855,0.00090276974,0.00023876734,0.00005569231,0.00012369345,0.00034004537,0.016732208,0.0029225484,0.654159,0.026083317,0.29790193],"study_design_scores_gemma":[0.000060440245,0.0000578289,0.00019459231,0.00010528278,0.000026354424,0.00018559826,0.0001245197,0.12150991,0.0042016553,0.85214436,0.021348044,0.00004139085],"about_ca_topic_score_codex":0.0022880887,"about_ca_topic_score_gemma":0.003878886,"teacher_disagreement_score":0.010175016,"about_ca_system_score_codex":0.001547819,"about_ca_system_score_gemma":0.0022181345,"threshold_uncertainty_score":0.03403884},"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":"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.02945048,0.0029593213,0.9202488,0.0006385921,0.00133141,0.0003791724,0.0022194337,0.024962397,0.017810497],"genre_scores_gemma":[0.15983742,0.00069597864,0.8029857,0.0005137728,0.00032858446,0.0003183836,0.006036261,0.0020847425,0.027199134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826497,0.00022374713,0.00016534621,0.00040251104,0.000757916,0.000185635],"domain_scores_gemma":[0.9976548,0.0006314976,0.000118905904,0.00080678,0.0006725767,0.00011547066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836338,0.0010743237,0.001159063,0.0028336614,0.001180977,0.002354327,0.0025059008,0.0013307268,0.036584936],"category_scores_gemma":[0.006770191,0.0005832432,0.00093397655,0.005084177,0.0005048999,0.0037149556,0.0021744499,0.0014846914,0.016432777],"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.000853035,0.00018833792,0.0010691603,0.0003077809,0.00009813687,0.00014880394,0.00015463043,0.0058674193,0.022268703,0.019301837,0.04188783,0.90785426],"study_design_scores_gemma":[0.00090478937,0.0011036976,0.00539445,0.00026816677,0.00025345077,0.0024834708,0.00063962943,0.49885875,0.14357941,0.13798855,0.20829217,0.00023350808],"about_ca_topic_score_codex":0.003904888,"about_ca_topic_score_gemma":0.0073784743,"teacher_disagreement_score":0.036584936,"about_ca_system_score_codex":0.00090414827,"about_ca_system_score_gemma":0.0022616056,"threshold_uncertainty_score":0.12238884},"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":"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.08625396,0.0012328713,0.8790105,0.00051286764,0.00042001717,0.00017635126,0.0010751177,0.0033134741,0.028004952],"genre_scores_gemma":[0.6484825,0.0005520212,0.32975703,0.00038141277,0.00017116222,0.00016046726,0.0017830681,0.0005064023,0.01820595],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839056,0.00031052393,0.00020530193,0.00032095565,0.0005963791,0.00017631217],"domain_scores_gemma":[0.99729675,0.0007581376,0.00016250335,0.001317893,0.00038293083,0.00008171836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007409387,0.0004493497,0.0007281333,0.0011327628,0.00061503967,0.0016193512,0.0013777766,0.001083931,0.0074063293],"category_scores_gemma":[0.0074159126,0.000291504,0.000417302,0.0024691608,0.00087347673,0.0044116923,0.00239502,0.00082862494,0.0035910732],"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.0010023556,0.00018780972,0.0018381262,0.00069814886,0.000079578866,0.00075928937,0.0003426961,0.016600316,0.03516626,0.32251638,0.017260423,0.6035486],"study_design_scores_gemma":[0.00008157391,0.00021705835,0.0012045493,0.00013355193,0.000055881086,0.0017196843,0.00016939024,0.19379853,0.061881,0.7024739,0.038200423,0.0000644325],"about_ca_topic_score_codex":0.0004172507,"about_ca_topic_score_gemma":0.00055035896,"teacher_disagreement_score":0.0074063293,"about_ca_system_score_codex":0.0004427126,"about_ca_system_score_gemma":0.00052257633,"threshold_uncertainty_score":0.024776638},"labels":[],"label_agreement":null}]}