{"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":"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.7031816,0.0028223975,0.2108268,0.009426309,0.001713494,0.0006622043,0.000029166578,0.0013526411,0.0699854],"genre_scores_gemma":[0.97788006,0.00020993278,0.017241811,0.0004580977,0.00021593715,0.0000032187866,0.0000031974648,0.00001531428,0.0039724144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983142,0.000059775644,0.00018286826,0.0006117138,0.00030144438,0.0005300038],"domain_scores_gemma":[0.9990583,0.00006935123,0.00008950248,0.0004891623,0.000057365123,0.00023633447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009305716,0.0002454194,0.00025424568,0.00014441209,0.00034097806,0.0001179944,0.0007851856,0.00011963762,0.0002069868],"category_scores_gemma":[0.000023692095,0.00024002531,0.00009161516,0.00036928724,0.00016047592,0.0019800323,0.000601933,0.00020310112,0.00039126904],"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.00016478555,0.0007178052,0.005457971,0.000119053926,0.00024425058,0.0022302857,0.01145523,0.00030889196,0.0037281571,0.60122603,0.022540616,0.3518069],"study_design_scores_gemma":[0.010027735,0.0024880453,0.04386573,0.00014225894,0.00037847742,0.00093465927,0.005425989,0.158062,0.0043824054,0.027964912,0.7418551,0.004472685],"about_ca_topic_score_codex":0.000020581454,"about_ca_topic_score_gemma":0.000007922168,"teacher_disagreement_score":0.7193145,"about_ca_system_score_codex":0.00006606345,"about_ca_system_score_gemma":0.00002758302,"threshold_uncertainty_score":0.9787949},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23766945,0.0062662954,0.47437057,0.063727856,0.0029034372,0.005206567,0.00014059202,0.0036489475,0.20606631],"genre_scores_gemma":[0.76192373,0.00096536276,0.19759889,0.002523004,0.0004937344,0.000021060467,0.00006685561,0.0000916137,0.03631575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979772,0.000081535174,0.00028117094,0.00082918745,0.00035338392,0.00047753064],"domain_scores_gemma":[0.9981808,0.00007707997,0.00016876619,0.0011385526,0.00006700491,0.000367804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041814367,0.00026881363,0.0003143267,0.00017422174,0.0004184904,0.00048802627,0.002760198,0.00014724245,0.000027103042],"category_scores_gemma":[0.000054115055,0.00024846217,0.000075031225,0.00051184156,0.00010581186,0.0038771932,0.002794545,0.0002178258,0.00014036405],"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.0002747681,0.00047943005,0.000087159875,0.00011021095,0.00022132622,0.00066058454,0.022385487,0.0018467337,0.015673108,0.77628803,0.059519745,0.12245343],"study_design_scores_gemma":[0.024850622,0.00126206,0.004801169,0.0017956165,0.00019988687,0.00035985353,0.007183351,0.0047097383,0.010646768,0.3851541,0.55618274,0.0028540592],"about_ca_topic_score_codex":0.00084498397,"about_ca_topic_score_gemma":0.000044261742,"teacher_disagreement_score":0.52425426,"about_ca_system_score_codex":0.00015621218,"about_ca_system_score_gemma":0.00036537924,"threshold_uncertainty_score":0.9999968},"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":"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.8914729,0.000536816,0.08890583,0.005674516,0.0011222197,0.00043015162,0.000036077494,0.0016736462,0.010147888],"genre_scores_gemma":[0.9695046,0.00011338094,0.02874632,0.00069200026,0.00011119532,0.0000019467823,0.000014331005,0.000022719985,0.0007935086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817383,0.00006138221,0.00021105117,0.0006513809,0.0003667631,0.00053561275],"domain_scores_gemma":[0.99868983,0.0000657843,0.000120856006,0.0008250356,0.00006871207,0.00022977167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022094618,0.00031076447,0.00030295897,0.00024056903,0.0004086682,0.00022636718,0.0013512056,0.00012920072,0.00005011095],"category_scores_gemma":[0.000029626828,0.00028545718,0.00010659471,0.00049869705,0.0001580615,0.0032239698,0.00100927,0.00021657164,0.0001441594],"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.00006277844,0.00020453743,0.0007845218,0.00012397057,0.00022605347,0.0006279461,0.0057284725,0.0006760379,0.010021386,0.84902304,0.0022233867,0.13029788],"study_design_scores_gemma":[0.037214153,0.00228742,0.27079013,0.0008904908,0.0007913474,0.0022196206,0.011557623,0.099544756,0.012935437,0.43784922,0.11542746,0.008492362],"about_ca_topic_score_codex":0.00026179777,"about_ca_topic_score_gemma":0.000025235971,"teacher_disagreement_score":0.41117382,"about_ca_system_score_codex":0.00016485924,"about_ca_system_score_gemma":0.00015143452,"threshold_uncertainty_score":0.99995977},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56563145,0.00028361066,0.3955409,0.0038493527,0.0011929222,0.00034740235,0.000007857089,0.0004862906,0.032660227],"genre_scores_gemma":[0.9770265,0.000027488068,0.02028751,0.0008651865,0.00018592435,0.0000025824172,0.0000034605657,0.000017077571,0.001584254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998382,0.00018905396,0.00024133614,0.00041174496,0.00038485258,0.00039102783],"domain_scores_gemma":[0.99833655,0.0002476554,0.00019691569,0.0010156177,0.000097338554,0.00010592668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480786,0.00020178834,0.00025505194,0.0001306226,0.00033447088,0.0001057572,0.0019362156,0.000088764216,0.00005523243],"category_scores_gemma":[0.00006959236,0.00015508619,0.00015538494,0.0005299656,0.00015303656,0.00092597574,0.0006714094,0.00020022126,0.00010026616],"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.00004286249,0.0001942426,0.0006146507,0.0000865975,0.00022657395,0.000052297848,0.013004485,0.0031305556,0.026959997,0.65860516,0.01707318,0.2800094],"study_design_scores_gemma":[0.00363019,0.0007188416,0.006215355,0.00028901186,0.00026627537,0.00011509009,0.01111188,0.7976811,0.011363074,0.019749349,0.1469983,0.0018615274],"about_ca_topic_score_codex":0.00010298723,"about_ca_topic_score_gemma":0.000015360629,"teacher_disagreement_score":0.79455054,"about_ca_system_score_codex":0.00006833751,"about_ca_system_score_gemma":0.00009030953,"threshold_uncertainty_score":0.63242316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8567443,0.00059355807,0.115849145,0.0009637861,0.00039388053,0.00030672902,0.00017865919,0.00022361864,0.024746345],"genre_scores_gemma":[0.9897357,0.000055509616,0.0084291315,0.00003673425,0.00003081485,9.682024e-7,0.000007858388,0.0000118127455,0.0016914345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985763,0.00007615747,0.00025587901,0.00038779437,0.0003853172,0.0003185918],"domain_scores_gemma":[0.99742067,0.00006271542,0.00050218625,0.001762219,0.00014819148,0.00010400061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030407697,0.00018849102,0.00038837493,0.00010847446,0.0002897327,0.00008223995,0.0026758902,0.000067822126,0.000042769712],"category_scores_gemma":[0.000047716065,0.00018277783,0.00014461331,0.00014606725,0.00063078466,0.0015868187,0.00097158254,0.00012131443,0.000023121123],"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.00015357681,0.00044369014,0.007628063,0.00047656742,0.00029629364,0.00021819124,0.007892828,0.0001425348,0.020055134,0.90372384,0.0026717447,0.056297533],"study_design_scores_gemma":[0.008358226,0.0012326632,0.58509016,0.0011570816,0.0003741184,0.00006468692,0.0091277,0.038366597,0.16957872,0.15282515,0.030974105,0.0028508194],"about_ca_topic_score_codex":0.0005048505,"about_ca_topic_score_gemma":0.00008908303,"teacher_disagreement_score":0.7508987,"about_ca_system_score_codex":0.0000614176,"about_ca_system_score_gemma":0.00009286319,"threshold_uncertainty_score":0.74534637},"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":"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.82851917,0.000764912,0.15327172,0.005530368,0.0005639314,0.00045455704,0.00003110487,0.0006572522,0.010206986],"genre_scores_gemma":[0.9925663,0.00008503494,0.0052999584,0.0015052913,0.000062575455,0.0000037099626,0.000016810636,0.000017854554,0.0004424534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983641,0.000042949792,0.00023638312,0.0005241247,0.00035349195,0.00047895464],"domain_scores_gemma":[0.99861866,0.00007896841,0.00014304977,0.0008449782,0.00010565625,0.00020869225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024818638,0.00026592996,0.0002765723,0.00019376997,0.0003791231,0.00019786393,0.0013376974,0.00014690435,0.000037512913],"category_scores_gemma":[0.000050619277,0.00025546845,0.000097819626,0.00036042082,0.00015183011,0.0035426456,0.0009588839,0.00020296761,0.00013027589],"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.00006601556,0.00013889733,0.00058287045,0.000054575034,0.000105576575,0.00019076008,0.0070345253,0.00011119766,0.0018266937,0.7679653,0.0029064454,0.2190171],"study_design_scores_gemma":[0.052073617,0.003563057,0.096178375,0.0010883498,0.00055852975,0.0013868021,0.057062503,0.032310776,0.036239263,0.5178758,0.19459225,0.00707065],"about_ca_topic_score_codex":0.00031929702,"about_ca_topic_score_gemma":0.00019053087,"teacher_disagreement_score":0.25008953,"about_ca_system_score_codex":0.00021467196,"about_ca_system_score_gemma":0.00014833511,"threshold_uncertainty_score":0.99998975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95900697,0.00067367085,0.0027631603,0.00006128537,0.0009600425,0.00022897226,0.000046336496,0.00043395697,0.03582559],"genre_scores_gemma":[0.9985528,0.000030062778,0.00022501104,0.0000164767,0.00028538945,0.000005554717,0.000031268733,0.00004478171,0.0008086746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850875,0.0000893494,0.0004239383,0.00027002455,0.00025489077,0.00045303354],"domain_scores_gemma":[0.9992814,0.000077079094,0.000111998255,0.00035071757,0.000081209255,0.00009757628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025767708,0.0002881774,0.00047203424,0.00022931492,0.00012384001,0.00003327451,0.0003776388,0.00017897223,0.0001678187],"category_scores_gemma":[0.000012268755,0.0003086001,0.00023517809,0.0003068899,0.00012841917,0.0005952317,0.000097130614,0.00019768445,0.00011088826],"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.002268787,0.0009422939,0.058865834,0.0030090646,0.002674122,0.0012722625,0.017250765,0.07276312,0.17320251,0.6180552,0.026534205,0.023161832],"study_design_scores_gemma":[0.022889255,0.003111923,0.10358403,0.002740527,0.002939593,0.00053517474,0.08664183,0.04825369,0.26300985,0.027321013,0.43008387,0.008889251],"about_ca_topic_score_codex":0.00033816736,"about_ca_topic_score_gemma":0.00006987939,"teacher_disagreement_score":0.5907342,"about_ca_system_score_codex":0.00009216586,"about_ca_system_score_gemma":0.000028355798,"threshold_uncertainty_score":0.9999366},"labels":[],"label_agreement":null}]}