{"meta":{"query_hash":"d7a78aca0323","filters":{"venue":"Justus-Liebig-Universität Gießen"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/d7a78aca0323","api":"https://metacan.xera.ac/api/v1/cohort?venue=Justus-Liebig-Universit%C3%A4t+Gie%C3%9Fen"},"results":[{"id":"W12813696","doi":"10.25596/jalc-2002-083","title":"Maximal and Minimal Partial Clones","year":2002,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"Advanced Algebra and Logic","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":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); Intersection (aeronautics); Combinatorics; Mathematics; Set (abstract data type); Partial function; clone (Java method); Element (criminal law); Discrete mathematics; Computer science; Biology; Genetics; Gene","score_opus":0.021406086907278337,"score_gpt":0.20084994107979312,"score_spread":0.1794438541725148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12813696","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64928496,0.0032134927,0.27452865,0.005085614,0.0001539212,0.00012540742,0.0018052029,0.00070824014,0.06509448],"genre_scores_gemma":[0.9284992,0.00079127256,0.059082627,0.0005997983,0.00020491885,0.00019642962,0.0015716716,0.00011549078,0.008938482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963356,0.00076111464,0.00034755928,0.0012615772,0.00080233184,0.00049181154],"domain_scores_gemma":[0.98919666,0.0061879163,0.0008734329,0.0018474763,0.0009450738,0.0009494678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029256039,0.00041772932,0.0013338139,0.0009553627,0.0030179194,0.0030827308,0.0010749445,0.0017142148,0.007250109],"category_scores_gemma":[0.013053168,0.000749344,0.0012214751,0.001182054,0.0042207893,0.009532007,0.0044329213,0.0017992295,0.00062221184],"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.00026090097,0.000030346788,0.0048589446,0.00019950168,0.00003279062,0.00025906,0.0014536511,0.0013616633,0.0036053725,0.96336204,0.002167198,0.022408525],"study_design_scores_gemma":[0.00004086592,0.00007749283,0.002501035,0.000081057886,0.00005488894,0.0012583607,0.001360504,0.003972219,0.0046475814,0.9596743,0.026290158,0.000041659456],"about_ca_topic_score_codex":0.00085685984,"about_ca_topic_score_gemma":0.00072749524,"teacher_disagreement_score":0.007250109,"about_ca_system_score_codex":0.0016120785,"about_ca_system_score_gemma":0.0010181934,"threshold_uncertainty_score":0.024254024},"labels":[],"label_agreement":null},{"id":"W1539025858","doi":"10.25596/jalc-2004-233","title":"Regular Expressions: New Results and Open Problems","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sketch; Computer science; Regular expression; Theoretical computer science; Programming language; Algorithm","score_opus":0.0232650438718394,"score_gpt":0.23158112755538385,"score_spread":0.20831608368354446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539025858","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.028816236,0.25694323,0.51182854,0.07534999,0.0059086867,0.00013518386,0.0011425987,0.0016356119,0.11823995],"genre_scores_gemma":[0.3002919,0.29347447,0.3051217,0.014807648,0.043723404,0.0004673426,0.0030875776,0.002410041,0.03661603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99210125,0.002720006,0.00067706563,0.0018407309,0.0021241044,0.0005368211],"domain_scores_gemma":[0.96008664,0.032032426,0.0009151997,0.0034985475,0.0024082894,0.0010589225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011794755,0.0022850926,0.0035879212,0.0057589416,0.0030957477,0.010684071,0.0048644342,0.004214255,0.012020629],"category_scores_gemma":[0.02184083,0.0017723487,0.0040831105,0.008186156,0.018280402,0.062146742,0.0064445995,0.013728691,0.004393344],"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.000060054354,0.000085682295,0.00031094596,0.0007497186,0.00004016239,0.00018259497,0.000648583,0.0013422741,0.00026482495,0.9322502,0.011013489,0.053051446],"study_design_scores_gemma":[0.00001048322,0.000015720589,0.00008308865,0.0001358326,0.000014075671,0.00016729333,0.00022111865,0.0021057548,0.00015082964,0.97757304,0.019497944,0.000024833442],"about_ca_topic_score_codex":0.0013894903,"about_ca_topic_score_gemma":0.0008320215,"teacher_disagreement_score":0.012020629,"about_ca_system_score_codex":0.0034695347,"about_ca_system_score_gemma":0.0018663798,"threshold_uncertainty_score":0.062377393},"labels":[],"label_agreement":null},{"id":"W2144860383","doi":"10.25596/jalc-2004-121","title":"Bimachines and Structurally-Reversed Automata","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Rational function; Nondeterministic algorithm; Computer science; Finite-state machine; Automaton; Function (biology); Word (group theory); Simple (philosophy); Trigonometric functions; Point (geometry); Range (aeronautics); Preprocessor; Power (physics); Algorithm; Theoretical computer science; Mathematics; Pure mathematics; Artificial intelligence; Engineering","score_opus":0.004140554167445769,"score_gpt":0.18249941646308462,"score_spread":0.17835886229563885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144860383","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.09221281,0.00074016256,0.8730214,0.0006029798,0.00019068137,0.00010438557,0.00015559072,0.00080621196,0.03216564],"genre_scores_gemma":[0.75567794,0.00067688635,0.2261056,0.0005428276,0.00018469288,0.00029156002,0.0002879086,0.00018303744,0.01604948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831945,0.00045644163,0.00016515226,0.00052781124,0.0003744013,0.00015663449],"domain_scores_gemma":[0.99834013,0.0006872142,0.00019475319,0.0004682011,0.00021943997,0.0000902393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084990537,0.00038799713,0.00032595344,0.00052752794,0.00074036734,0.0015878751,0.00071815774,0.0010817724,0.004554972],"category_scores_gemma":[0.002506841,0.00034902708,0.00083572394,0.0003524109,0.0046761353,0.003589935,0.0017518395,0.0018249281,0.0010549453],"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.000014186904,0.0000073090077,0.00013049667,0.00002264956,0.0000036597648,0.00007769636,0.00021652787,0.0015328367,0.0024093713,0.9908125,0.00017110772,0.0046016276],"study_design_scores_gemma":[0.000013086438,0.00006408284,0.00013368817,0.000021306025,0.000011569873,0.0002800433,0.000121784964,0.01628257,0.0077424967,0.96248573,0.0128226755,0.000020777607],"about_ca_topic_score_codex":0.00039946495,"about_ca_topic_score_gemma":0.0003823437,"teacher_disagreement_score":0.004554972,"about_ca_system_score_codex":0.00065156963,"about_ca_system_score_gemma":0.00054374867,"threshold_uncertainty_score":0.015237868},"labels":[],"label_agreement":null},{"id":"W2402226617","doi":"10.25596/jalc-2014-157","title":"Generating the Pseudo-Powers of a Word","year":2014,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; Word (group theory); Abelian group; Computer science; Closure (psychology); Power (physics); Connection (principal bundle); Arithmetic; Mathematics; Pure mathematics; Physics; Geometry","score_opus":0.008362743079370773,"score_gpt":0.19823471050112798,"score_spread":0.18987196742175722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402226617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6094183,0.0004508177,0.32488495,0.0006373903,0.0003165151,0.00010858905,0.00014589613,0.00055046397,0.063487075],"genre_scores_gemma":[0.9500117,0.00019249709,0.038655262,0.00015222703,0.00013919789,0.00010883016,0.000094914576,0.00020828393,0.010437169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870133,0.00038307902,0.00011000977,0.00034688402,0.00031234676,0.00014622793],"domain_scores_gemma":[0.99684405,0.0014496123,0.00028870613,0.0007302228,0.00043657332,0.00025076573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012659988,0.00034335238,0.00041071308,0.00094365247,0.0012125833,0.0018504726,0.0005524839,0.00046292561,0.0042959885],"category_scores_gemma":[0.0039740982,0.00034554233,0.0008361147,0.00037102116,0.0037913262,0.0051617455,0.0023419287,0.00084233965,0.0008667599],"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.00008062388,0.000023022048,0.00061979017,0.000065898814,0.000012280123,0.00045410078,0.0014151412,0.00080969825,0.017460477,0.9660274,0.0003930316,0.0126385605],"study_design_scores_gemma":[0.000029645988,0.00015504379,0.0006481016,0.00004616099,0.000029330407,0.0009928071,0.00079181755,0.011011992,0.023664108,0.94463456,0.017942876,0.00005358201],"about_ca_topic_score_codex":0.00012845437,"about_ca_topic_score_gemma":0.00013517348,"teacher_disagreement_score":0.0042959885,"about_ca_system_score_codex":0.00042641553,"about_ca_system_score_gemma":0.00039874035,"threshold_uncertainty_score":0.014371455},"labels":[],"label_agreement":null},{"id":"W2758996273","doi":"10.25596/jalc-2017-169","title":"State Complexity of Prefix Distance of Subregular Languages","year":2017,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Prefix; Upper and lower bounds; Mathematics; Regular language; Combinatorics; Deterministic finite automaton; Finite-state machine; Alphabet; Neighbourhood (mathematics); Nondeterministic finite automaton; Discrete mathematics; Automaton; Computer science; Algorithm; Automata theory; Theoretical computer science","score_opus":0.024655987397331262,"score_gpt":0.25231424399670954,"score_spread":0.22765825659937827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758996273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8718284,0.0002672388,0.116899654,0.00062738295,0.00002480174,0.00005732833,0.0007981686,0.00066715566,0.008829783],"genre_scores_gemma":[0.982834,0.000076758224,0.013871571,0.00004341214,0.00002177365,0.00007248732,0.0005187606,0.000084602514,0.0024767383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793434,0.00037450058,0.00021769505,0.0006229961,0.0005671673,0.00028325254],"domain_scores_gemma":[0.9849166,0.011010504,0.0010179303,0.0015231374,0.0008758533,0.0006558978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010358499,0.00031233727,0.00085730787,0.00068456173,0.0008437994,0.002585429,0.001429367,0.0008595695,0.007931719],"category_scores_gemma":[0.011439275,0.00042839893,0.0010105709,0.00059000624,0.001839046,0.0049546883,0.002058825,0.001372576,0.00069476117],"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.001963583,0.00019509136,0.0109076295,0.0006704191,0.00009805806,0.00070401246,0.0022997973,0.2789464,0.042880766,0.61277217,0.0024270308,0.046135053],"study_design_scores_gemma":[0.000054346707,0.00016389621,0.0018229361,0.000027158832,0.000048860402,0.000249793,0.00018280266,0.56152457,0.015607806,0.41875207,0.0015120088,0.000053785876],"about_ca_topic_score_codex":0.0014644419,"about_ca_topic_score_gemma":0.0012462492,"teacher_disagreement_score":0.007931719,"about_ca_system_score_codex":0.0016667236,"about_ca_system_score_gemma":0.00080291944,"threshold_uncertainty_score":0.0265342},"labels":[],"label_agreement":null},{"id":"W40576911","doi":"10.25596/jalc-2004-333","title":"Context Derivation Sets and Context-Free Normal Forms","year":2004,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"semigroups and automata theory","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":"Western University","funders":"","keywords":"Terminal and nonterminal symbols; Symbol (formal); Context-free grammar; Context-sensitive grammar; Computer science; Tree-adjoining grammar; Context (archaeology); Grammar; Mildly context-sensitive grammar formalism; Indexed grammar; Extended Affix Grammar; Mathematics; Combinatory categorial grammar; Rule-based machine translation; Algorithm; Natural language processing; Artificial intelligence; Generative grammar; Programming language; Linguistics; Phrase structure rules","score_opus":0.009273650047310978,"score_gpt":0.19586749789400532,"score_spread":0.18659384784669433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40576911","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.030326992,0.0008673227,0.9279304,0.0006425014,0.00017348754,0.0001510999,0.00026694624,0.0018206852,0.037820626],"genre_scores_gemma":[0.44038326,0.0010549276,0.5352294,0.00044490353,0.000226686,0.0003930748,0.0010198823,0.0006727183,0.020575201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997256,0.0007100048,0.00026364852,0.00060973613,0.0009857197,0.00017481849],"domain_scores_gemma":[0.9970668,0.0015376935,0.00015396958,0.0005904808,0.000514737,0.00013629391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016578157,0.0007691684,0.0004970794,0.0015664375,0.0011452395,0.0028404342,0.0011775509,0.0009794057,0.006948449],"category_scores_gemma":[0.005397999,0.0005185471,0.0010309402,0.0012040014,0.003967002,0.005261274,0.0024050327,0.0027470093,0.0021730764],"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.000021794947,0.000015844735,0.00012412106,0.000045850527,0.000007625448,0.00013387424,0.00035507313,0.0027739047,0.0016852483,0.9562154,0.0009261466,0.037695203],"study_design_scores_gemma":[0.0000096901695,0.000013616494,0.000053555275,0.000021505473,0.000006006604,0.00014030593,0.000050365834,0.0075164344,0.0022177426,0.97754216,0.012415857,0.000012773666],"about_ca_topic_score_codex":0.00070827146,"about_ca_topic_score_gemma":0.0007353244,"teacher_disagreement_score":0.006948449,"about_ca_system_score_codex":0.0011780978,"about_ca_system_score_gemma":0.000937207,"threshold_uncertainty_score":0.023244858},"labels":[],"label_agreement":null},{"id":"W88699973","doi":"10.25596/jalc-2006-399","title":"Intervals of Partial Clones Containing Maximal Clones","year":2006,"lang":"en","type":"article","venue":"Justus-Liebig-Universität Gießen","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Combinatorics; clone (Java method); Mathematics; Bounded function; Permutation (music); Order (exchange); Equivalence relation; Discrete mathematics; Prime (order theory); Biology; Physics; Genetics; Gene; Mathematical analysis","score_opus":0.007721498035841037,"score_gpt":0.180193418547502,"score_spread":0.17247192051166096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88699973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91362035,0.00073790445,0.05701244,0.00015787235,0.00003689944,0.000063116706,0.0007126959,0.00032723128,0.027331514],"genre_scores_gemma":[0.97510004,0.00032253863,0.015602751,0.0000631018,0.000053084674,0.00014167285,0.0011163217,0.00008352889,0.007516919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990404,0.00011104359,0.00009483091,0.0003077548,0.00024251305,0.0002034143],"domain_scores_gemma":[0.9967849,0.0014953305,0.00047864925,0.00036781686,0.00050475466,0.0003685444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051599974,0.00047981925,0.00071685755,0.0018564739,0.001450588,0.002676671,0.00083572156,0.0005926475,0.0049888645],"category_scores_gemma":[0.004178627,0.0005015827,0.0008041239,0.0014905289,0.0014852476,0.0022728008,0.0014733888,0.000799869,0.00062359305],"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.00077039667,0.000086057014,0.01185269,0.00026973174,0.00008624886,0.0014044329,0.002603806,0.007458379,0.023742758,0.90814626,0.0015839158,0.041995276],"study_design_scores_gemma":[0.00018257735,0.00041985043,0.016949603,0.00018715925,0.00020088337,0.003928058,0.0021196993,0.047249954,0.0499701,0.83882135,0.03983154,0.0001392697],"about_ca_topic_score_codex":0.0013624325,"about_ca_topic_score_gemma":0.00074336136,"teacher_disagreement_score":0.0049888645,"about_ca_system_score_codex":0.001588262,"about_ca_system_score_gemma":0.0004816566,"threshold_uncertainty_score":0.01668948},"labels":[],"label_agreement":null}]}