{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Branislav Ďurian","is_ca":false},{"name":"Tamanna Chhabra","is_ca":false},{"name":"Sukhpal Singh Ghuman","is_ca":true},{"name":"Tommi Hirvola","is_ca":false},{"name":"Hannu Peltola","is_ca":false},{"name":"Jorma Tarhio","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007976225,0.00106212,0.001618776,0.002314007,0.0009219719,0.001658908,0.002887183,0.001155432,0.01129148],"category_scores_gemma":[0.004047522,0.0005897181,0.0009718936,0.004416298,0.0007408416,0.003725228,0.002279192,0.001301418,0.005132981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085821,"about_ca_system_score_gemma":0.002481461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003225834,"about_ca_topic_score_gemma":0.004674462,"domain_scores_codex":[0.9981287,0.0002257492,0.0001772954,0.0003115791,0.001002818,0.0001539121],"domain_scores_gemma":[0.9978392,0.0004771805,0.0001340701,0.0007080831,0.0007571662,0.0000844301],"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.0008408947,0.0002766671,0.0009806419,0.0003430149,0.0001016792,0.000161883,0.0001186634,0.08338434,0.02204495,0.03536168,0.01349262,0.8428929],"study_design_scores_gemma":[0.0002526243,0.0002514156,0.0005220996,0.00003888974,0.00006451525,0.0004895144,0.00005019807,0.9187132,0.02251058,0.03708261,0.01996646,0.00005791256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01731867,0.0008196136,0.9675991,0.0002409386,0.0002240054,0.000169802,0.0003301652,0.005070286,0.008227509],"genre_scores_gemma":[0.1186375,0.0004240056,0.864778,0.0003043213,0.0001069526,0.0003082483,0.001178652,0.0005151262,0.0137472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01129148,"threshold_uncertainty_score":0.03777373,"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","authors":[{"name":"František Franěk","is_ca":true},{"name":"Asma Paracha","is_ca":false},{"name":"William F. Smyth","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00151389,0.0002890007,0.0006340711,0.001504403,0.001308583,0.004376386,0.001205112,0.001003884,0.01347017],"category_scores_gemma":[0.01636172,0.0004133792,0.000623881,0.002287394,0.002994956,0.009697365,0.003194848,0.002191842,0.003768835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001112736,"about_ca_system_score_gemma":0.001558643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001859412,"about_ca_topic_score_gemma":0.001251085,"domain_scores_codex":[0.9970943,0.000716483,0.0003128659,0.0006278062,0.0008964934,0.0003521012],"domain_scores_gemma":[0.9937496,0.002662575,0.0004643583,0.001619511,0.001297216,0.0002067749],"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.0002052561,0.00004077334,0.0004148597,0.00006958219,0.00001211451,0.0001598141,0.0004712645,0.001811191,0.003084538,0.9207232,0.005421896,0.06758555],"study_design_scores_gemma":[0.00002571059,0.00009193961,0.0004416604,0.00005746865,0.00001959474,0.0002878781,0.0002163983,0.00872719,0.005007834,0.9555488,0.02954345,0.00003209655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1048422,0.003164028,0.7028167,0.002806957,0.001351392,0.0001583607,0.001951934,0.002340599,0.1805678],"genre_scores_gemma":[0.7783569,0.00189937,0.1564849,0.002138501,0.001340816,0.0003090468,0.003287401,0.00106839,0.05511472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01347017,"threshold_uncertainty_score":0.04506224,"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","authors":[{"name":"Haoyue Bai","is_ca":true},{"name":"František Franěk","is_ca":true},{"name":"William F. Smyth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512983,0.000869203,0.0007909031,0.001219838,0.001737712,0.002420481,0.0008097258,0.001347635,0.02297935],"category_scores_gemma":[0.004522679,0.0005636528,0.001182358,0.00141008,0.002853096,0.005088694,0.002497572,0.002558494,0.00626026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008476603,"about_ca_system_score_gemma":0.001246902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001125891,"about_ca_topic_score_gemma":0.001176731,"domain_scores_codex":[0.998192,0.0002358601,0.0001054076,0.0006771382,0.0004400492,0.0003495802],"domain_scores_gemma":[0.9979961,0.0004700955,0.0001484819,0.0006444759,0.0005033694,0.0002375077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001503532,0.00004030414,0.0005435328,0.00008841044,0.000009218388,0.0003657169,0.0003720284,0.001540332,0.004622645,0.9510365,0.006880522,0.03435035],"study_design_scores_gemma":[0.00004647409,0.0001004475,0.0003435536,0.00005045994,0.00002148064,0.0007106776,0.000320153,0.01403581,0.007664614,0.9236592,0.05298154,0.00006566284],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1049919,0.0008688825,0.7629396,0.002099302,0.0012939,0.000203652,0.001192563,0.002393787,0.1240164],"genre_scores_gemma":[0.6899204,0.0007111343,0.2462719,0.00138202,0.0005226666,0.0003397976,0.001905506,0.00137382,0.05757278],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02297935,"threshold_uncertainty_score":0.0768736,"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","authors":[{"name":"František Franěk","is_ca":true},{"name":"Michael Liut","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002939961,0.0009892541,0.001155585,0.002292596,0.001418374,0.004048849,0.00299333,0.001894941,0.01017502],"category_scores_gemma":[0.01990851,0.0006639286,0.0008353704,0.004302778,0.002127386,0.008710042,0.004347364,0.005502804,0.005012662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001547819,"about_ca_system_score_gemma":0.002218134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002288089,"about_ca_topic_score_gemma":0.003878886,"domain_scores_codex":[0.9978751,0.0006293071,0.0001963221,0.0003725603,0.0006814173,0.0002453528],"domain_scores_gemma":[0.9942849,0.002937849,0.0002287582,0.001425271,0.0009316389,0.0001915481],"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.0004399254,0.0001001859,0.0009027697,0.0002387673,0.00005569231,0.0001236934,0.0003400454,0.01673221,0.002922548,0.654159,0.02608332,0.2979019],"study_design_scores_gemma":[0.00006044024,0.0000578289,0.0001945923,0.0001052828,0.00002635442,0.0001855983,0.0001245197,0.1215099,0.004201655,0.8521444,0.02134804,0.00004139085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009099554,0.002876745,0.9657529,0.001772544,0.0007540711,0.00006957907,0.0002055394,0.001901954,0.01756711],"genre_scores_gemma":[0.1781351,0.002464641,0.7875015,0.001495215,0.0008495806,0.0004126007,0.0009723239,0.0008796367,0.02728953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01017502,"threshold_uncertainty_score":0.03403884,"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","authors":[{"name":"Neerja Mhaskar","is_ca":false},{"name":"William F. Smyth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007409387,0.0004493497,0.0007281333,0.001132763,0.0006150397,0.001619351,0.001377777,0.001083931,0.007406329],"category_scores_gemma":[0.007415913,0.000291504,0.000417302,0.002469161,0.0008734767,0.004411692,0.00239502,0.0008286249,0.003591073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004427126,"about_ca_system_score_gemma":0.0005225763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004172507,"about_ca_topic_score_gemma":0.000550359,"domain_scores_codex":[0.9983906,0.0003105239,0.0002053019,0.0003209556,0.0005963791,0.0001763122],"domain_scores_gemma":[0.9972968,0.0007581376,0.0001625033,0.001317893,0.0003829308,0.00008171836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001002356,0.0001878097,0.001838126,0.0006981489,0.00007957887,0.0007592894,0.0003426961,0.01660032,0.03516626,0.3225164,0.01726042,0.6035486],"study_design_scores_gemma":[0.00008157391,0.0002170583,0.001204549,0.0001335519,0.00005588109,0.001719684,0.0001693902,0.1937985,0.061881,0.7024739,0.03820042,0.0000644325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08625396,0.001232871,0.8790105,0.0005128676,0.0004200172,0.0001763513,0.001075118,0.003313474,0.02800495],"genre_scores_gemma":[0.6484825,0.0005520212,0.329757,0.0003814128,0.0001711622,0.0001604673,0.001783068,0.0005064023,0.01820595],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007406329,"threshold_uncertainty_score":0.02477664,"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","authors":[{"name":"Ali Alatabbi","is_ca":false},{"name":"Jacqueline W. Daykin","is_ca":false},{"name":"Neerja Mhaskar","is_ca":false},{"name":"M. Sohel Rahman","is_ca":false},{"name":"William F. Smyth","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836338,0.001074324,0.001159063,0.002833661,0.001180977,0.002354327,0.002505901,0.001330727,0.03658494],"category_scores_gemma":[0.006770191,0.0005832432,0.0009339766,0.005084177,0.0005048999,0.003714956,0.00217445,0.001484691,0.01643278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009041483,"about_ca_system_score_gemma":0.002261606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003904888,"about_ca_topic_score_gemma":0.007378474,"domain_scores_codex":[0.998265,0.0002237471,0.0001653462,0.000402511,0.000757916,0.000185635],"domain_scores_gemma":[0.9976548,0.0006314976,0.0001189059,0.00080678,0.0006725767,0.0001154707],"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.000853035,0.0001883379,0.00106916,0.0003077809,0.00009813687,0.0001488039,0.0001546304,0.005867419,0.0222687,0.01930184,0.04188783,0.9078543],"study_design_scores_gemma":[0.0009047894,0.001103698,0.00539445,0.0002681668,0.0002534508,0.002483471,0.0006396294,0.4988587,0.1435794,0.1379886,0.2082922,0.0002335081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02945048,0.002959321,0.9202488,0.0006385921,0.00133141,0.0003791724,0.002219434,0.0249624,0.0178105],"genre_scores_gemma":[0.1598374,0.0006959786,0.8029857,0.0005137728,0.0003285845,0.0003183836,0.006036261,0.002084743,0.02719913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03658494,"threshold_uncertainty_score":0.1223888,"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","authors":[{"name":"František Franěk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00600151,0.0008919188,0.002144117,0.004131327,0.004886783,0.007732048,0.00339975,0.003709647,0.02102252],"category_scores_gemma":[0.05780078,0.001502055,0.001347045,0.003001168,0.01121575,0.02492332,0.006698439,0.007863427,0.00381815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002409261,"about_ca_system_score_gemma":0.001297397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009560014,"about_ca_topic_score_gemma":0.0011429,"domain_scores_codex":[0.9931625,0.002430087,0.0005440464,0.001934544,0.001179472,0.0007494413],"domain_scores_gemma":[0.9357288,0.04946175,0.002496088,0.005742717,0.003607029,0.00296356],"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.0001197021,0.00001906963,0.0007107367,0.00007604209,0.00001693229,0.00006336805,0.0002071753,0.001088365,0.0004077554,0.9828799,0.003774732,0.01063606],"study_design_scores_gemma":[0.00001216288,0.00001255151,0.0002526954,0.00003500089,0.00001153979,0.0001227991,0.00007894142,0.002989421,0.000266394,0.9928707,0.003333807,0.00001391929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1904596,0.01045345,0.4733635,0.02264638,0.004058263,0.0001682477,0.001998426,0.0007897257,0.2960623],"genre_scores_gemma":[0.8442238,0.003493413,0.1006105,0.002121031,0.002379182,0.0003582308,0.0008551389,0.000589976,0.04536868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02102252,"threshold_uncertainty_score":0.07032734,"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","authors":[{"name":"Neerja Mhaskar","is_ca":true},{"name":"Michael Soltys","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00146556,0.0005971555,0.0008117615,0.001929926,0.001452846,0.002113136,0.00222684,0.001368647,0.01580511],"category_scores_gemma":[0.01807836,0.0004736978,0.0007408882,0.002479623,0.001291046,0.005252101,0.003220431,0.001712468,0.005799658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008972235,"about_ca_system_score_gemma":0.00136727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000711901,"about_ca_topic_score_gemma":0.001275581,"domain_scores_codex":[0.9962146,0.001067738,0.000433631,0.0007232255,0.001102427,0.0004584059],"domain_scores_gemma":[0.9854239,0.006600045,0.0007430487,0.005504855,0.001439214,0.0002889231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001304724,0.000215617,0.00255058,0.0007508429,0.000150238,0.001944083,0.0009204087,0.02272027,0.01772803,0.5079235,0.0397037,0.404088],"study_design_scores_gemma":[0.00008577144,0.0001865885,0.0007211512,0.00031353,0.0000956252,0.001991432,0.0002444615,0.09553966,0.03383289,0.8146206,0.05228977,0.00007864114],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.119027,0.005320279,0.7886106,0.002754702,0.001982032,0.0002993615,0.003422692,0.007650468,0.07093287],"genre_scores_gemma":[0.7269704,0.001618627,0.2111864,0.001733262,0.001019995,0.0004165721,0.004014851,0.001521821,0.05151811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01580511,"threshold_uncertainty_score":0.05287331,"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","authors":[{"name":"František Franěk","is_ca":true},{"name":"Mei Jiang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430516,0.00151844,0.001264093,0.002225184,0.001203497,0.002754031,0.003180528,0.001641685,0.00670532],"category_scores_gemma":[0.01239205,0.0008110123,0.001751123,0.003372706,0.002378721,0.007540911,0.002410367,0.002845912,0.003573654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416724,"about_ca_system_score_gemma":0.002343496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003601123,"about_ca_topic_score_gemma":0.005362258,"domain_scores_codex":[0.9954765,0.0009104846,0.0003804468,0.001206579,0.001641914,0.0003839787],"domain_scores_gemma":[0.9946185,0.001815425,0.0002981365,0.002025985,0.001115255,0.0001267244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009911947,0.0001201468,0.002658425,0.0005362845,0.0001755221,0.0002598895,0.0005433511,0.04230262,0.01945472,0.2401708,0.0219655,0.6708215],"study_design_scores_gemma":[0.0002692649,0.0007094351,0.002645252,0.0003633099,0.0002066823,0.002395471,0.0003405997,0.4151206,0.09507167,0.3135394,0.1690381,0.0003001934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01414828,0.0009569721,0.9668861,0.0004906652,0.0002996649,0.0002145699,0.0002996206,0.004001468,0.01270278],"genre_scores_gemma":[0.08086152,0.0005795998,0.9026989,0.000462241,0.0002806429,0.0002799169,0.0007105518,0.0009947666,0.01313191],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00670532,"threshold_uncertainty_score":0.02243149,"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","authors":[{"name":"Neerja Mhaskar","is_ca":true},{"name":"Michael Soltys","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004797684,0.001056543,0.0008430579,0.004146846,0.002980242,0.007353048,0.002963381,0.002381251,0.01467396],"category_scores_gemma":[0.009527232,0.001053049,0.002607614,0.003864239,0.01028874,0.01847737,0.005560784,0.005809077,0.00525656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002448746,"about_ca_system_score_gemma":0.002233247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002768504,"about_ca_topic_score_gemma":0.002431393,"domain_scores_codex":[0.9963853,0.00154495,0.0004138785,0.0006980154,0.0007156138,0.000242203],"domain_scores_gemma":[0.9952974,0.002452305,0.0003151522,0.0008745807,0.0007557815,0.0003048428],"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.000004050581,0.000005469632,0.00003609404,0.00003690402,0.000004426061,0.0000440374,0.0001503424,0.0002102572,0.0001101397,0.9934684,0.001683775,0.004246108],"study_design_scores_gemma":[0.00000650071,0.000005886494,0.00003528648,0.0000444587,0.000005915899,0.00009277352,0.00009411531,0.001675211,0.0001802856,0.9657056,0.0321458,0.000008080479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001851939,0.002998941,0.9539691,0.003376615,0.0007737646,0.00008375159,0.0004427542,0.0007600538,0.03574301],"genre_scores_gemma":[0.1915507,0.004930931,0.7655622,0.003302922,0.002280892,0.0006397471,0.002136374,0.001049643,0.02854659],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01467396,"threshold_uncertainty_score":0.04908925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}