{"meta":{"query_hash":"1f68cbe46a6b","filters":{"venue":"The Journal of Logic and Algebraic Programming"},"cohort_total":9,"direct_labels_cover":0,"predictions_cover":9,"exported":9,"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/1f68cbe46a6b","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Journal+of+Logic+and+Algebraic+Programming"},"results":[{"id":"W1969553191","doi":"10.1016/s1567-8326(02)00068-1","title":"Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes","year":2003,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Bisimulation; Converse; Mathematics; Markov chain; Discrete mathematics; Bounded function; Markov process; Transition system; Calculus (dental); Algorithm","score_opus":0.0201040403771851,"score_gpt":0.2657216902340813,"score_spread":0.24561764985689621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969553191","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.2245869,0.0013356415,0.7732167,0.00023465749,0.00016662104,0.00026020646,5.7001165e-7,0.000032589032,0.00016607408],"genre_scores_gemma":[0.8257985,0.00006187192,0.17394984,0.00010011153,0.000038152582,0.0000032429712,4.424555e-7,0.0000064291985,0.00004140855],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984236,0.0003372275,0.0005834204,0.00013365716,0.00029126072,0.00023088735],"domain_scores_gemma":[0.99789566,0.00045161505,0.0010019182,0.0002202339,0.0003641271,0.00006644153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002505344,0.00014548647,0.00033992913,0.000110126755,0.0001291939,0.00009132849,0.0005061109,0.000054949498,0.000008008596],"category_scores_gemma":[0.0012611169,0.00008950767,0.00005729601,0.00036114253,0.00017078967,0.0005046295,0.0000661115,0.00018695234,0.0000025254428],"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.0003391576,0.00056754606,0.0017741452,0.00044260922,0.00023251862,0.000027708858,0.006136236,0.00061741547,0.028534885,0.13239448,0.000060899012,0.8288724],"study_design_scores_gemma":[0.013601861,0.020616442,0.048662797,0.0035845847,0.0015459394,0.01197898,0.0074499506,0.07452143,0.0658498,0.7367281,0.0112092,0.004250919],"about_ca_topic_score_codex":0.0000018278092,"about_ca_topic_score_gemma":1.8845043e-7,"teacher_disagreement_score":0.8246215,"about_ca_system_score_codex":0.00001735776,"about_ca_system_score_gemma":0.00008303843,"threshold_uncertainty_score":0.36500168},"labels":[],"label_agreement":null},{"id":"W1971739409","doi":"10.1016/j.jlap.2010.07.018","title":"Cardinality functions in allegories","year":2010,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Advanced Algebra and Logic","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":"Brock University","funders":"","keywords":"Cardinality (data modeling); Allegory; Injective function; Mathematics; Axiom; Surjective function; Context (archaeology); Uniqueness; Function (biology); Discrete mathematics; Computer science","score_opus":0.01280502869069286,"score_gpt":0.24862872365524233,"score_spread":0.23582369496454947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971739409","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.66655666,0.0013373839,0.32681224,0.0037957919,0.0006866248,0.00013009676,2.773674e-7,0.000041461757,0.0006394501],"genre_scores_gemma":[0.98123866,0.00004874323,0.018344687,0.00018799116,0.00012797535,0.000002198539,1.4017895e-7,0.0000030578067,0.000046551424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913,0.00008874187,0.0002862844,0.000104324696,0.0001732179,0.0002174302],"domain_scores_gemma":[0.9992573,0.00019935869,0.00019097952,0.00020502684,0.00007249409,0.000074843534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012015571,0.00009804357,0.00017648247,0.00007282787,0.00016896673,0.000077494886,0.00048365805,0.000045960882,0.0000064508695],"category_scores_gemma":[0.00013079708,0.000054947428,0.000058585778,0.00027785476,0.00015782105,0.00040643185,0.00013502037,0.0005206804,0.0000024617646],"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.00003949652,0.00013835468,0.013201291,0.000018476872,0.000045749122,0.000086819,0.0025074726,0.00007380333,0.0019218179,0.44386122,0.00014279799,0.53796273],"study_design_scores_gemma":[0.0013972976,0.0008981025,0.06738612,0.000058495527,0.00006845752,0.0032736796,0.0029412515,0.000900199,0.00048413782,0.8816898,0.040405348,0.0004971106],"about_ca_topic_score_codex":0.000010254939,"about_ca_topic_score_gemma":0.00003316284,"teacher_disagreement_score":0.5374656,"about_ca_system_score_codex":0.000008957809,"about_ca_system_score_gemma":0.000042426713,"threshold_uncertainty_score":0.22621262},"labels":[],"label_agreement":null},{"id":"W1974374936","doi":"10.1016/j.jlap.2008.02.002","title":"Primitive recursive selection functions for existential assertions over abstract algebras","year":2008,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Existentialism; Selection (genetic algorithm); Primitive recursive function; Mathematics; Algebra over a field; Computer science; Pure mathematics; Discrete mathematics; Epistemology; Philosophy; Artificial intelligence","score_opus":0.03612114453709036,"score_gpt":0.27456630116533814,"score_spread":0.23844515662824778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974374936","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.29717773,0.00048472302,0.7000747,0.0011396148,0.0005043621,0.00039630287,0.0000016445233,0.00006406704,0.00015687653],"genre_scores_gemma":[0.93437725,0.00007548143,0.06487582,0.00016852231,0.0003742716,0.000016968834,0.000001680574,0.000009913255,0.00010010783],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985022,0.00012516245,0.00048214744,0.00023038356,0.00031919,0.00034092832],"domain_scores_gemma":[0.9981894,0.0005913042,0.00047164032,0.00019704197,0.0004236234,0.00012701092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010300544,0.00017786685,0.00025963917,0.00012993613,0.00077155756,0.00011566502,0.00047407957,0.00008021676,0.000012225212],"category_scores_gemma":[0.00024384474,0.00011873843,0.00019671206,0.00038881705,0.0002050608,0.00057945907,0.00013061137,0.00035361364,0.000002972701],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057802367,0.002233071,0.008005426,0.00013841178,0.0010388705,0.00012186897,0.011650361,0.0012775551,0.004818983,0.12962899,0.005257166,0.8352513],"study_design_scores_gemma":[0.007137054,0.010831233,0.5276397,0.00030969246,0.0008907156,0.018039746,0.0035347806,0.026124902,0.0035564236,0.37057713,0.029390791,0.001967824],"about_ca_topic_score_codex":0.000016998478,"about_ca_topic_score_gemma":0.000012699903,"teacher_disagreement_score":0.8332834,"about_ca_system_score_codex":0.000083654246,"about_ca_system_score_gemma":0.00015744471,"threshold_uncertainty_score":0.5934275},"labels":[],"label_agreement":null},{"id":"W1994967437","doi":"10.1016/j.jlap.2011.04.006","title":"Collagories: Relation-algebraic reasoning for gluing constructions","year":2011,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":9,"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":"Mathematics; Distributive property; Unary operation; Morphism; Algebraic number; Graph; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.027384334930848648,"score_gpt":0.24018974101765767,"score_spread":0.212805406086809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994967437","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026249284,0.0007105496,0.9721449,0.00021239003,0.00021882294,0.00022201486,5.332874e-7,0.00016091765,0.000080608086],"genre_scores_gemma":[0.41617906,0.000047496764,0.5836476,0.00003943107,0.00005662533,0.000009039888,2.298394e-7,0.0000071660515,0.000013343891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902207,0.00006035015,0.0003832402,0.00012756475,0.00017057576,0.0002361962],"domain_scores_gemma":[0.998933,0.00022259174,0.00034732267,0.00022454621,0.00018818154,0.00008432003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011191805,0.00013087214,0.00019956488,0.00011361967,0.00029080844,0.00008090554,0.0005151956,0.000064816224,0.0000032990686],"category_scores_gemma":[0.00008623374,0.00008972308,0.00007964455,0.000263028,0.00012602033,0.00045058428,0.000114495786,0.00021775751,5.5116243e-7],"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.000017903598,0.000023330556,0.00092621916,0.000022033275,0.00005538571,0.0000065445047,0.004403471,0.000042045212,0.00011249274,0.8008308,0.000078427656,0.19348137],"study_design_scores_gemma":[0.0027804333,0.0034015651,0.009304793,0.0012305395,0.00048302815,0.007576793,0.0019745647,0.0454355,0.00477629,0.8670083,0.054519776,0.0015084184],"about_ca_topic_score_codex":0.000006573629,"about_ca_topic_score_gemma":0.0000010779708,"teacher_disagreement_score":0.38992977,"about_ca_system_score_codex":0.000031497482,"about_ca_system_score_gemma":0.00006129862,"threshold_uncertainty_score":0.3658801},"labels":[],"label_agreement":null},{"id":"W1996228525","doi":"10.1016/j.jlap.2003.07.006","title":"The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML","year":2003,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Programming language; Computer science; Java Modeling Language; Java; Java annotation; Generics in Java; Java applet; Java API for XML-based RPC; Mathematical proof; Semantics (computer science); Real time Java; Proof assistant; Mathematics","score_opus":0.03373960461384942,"score_gpt":0.2609795963231573,"score_spread":0.2272399917093079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996228525","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.12558116,0.022794532,0.83562046,0.008777697,0.0018192847,0.0040958864,7.490834e-7,0.00021561723,0.0010946342],"genre_scores_gemma":[0.9910818,0.00019988265,0.008265569,0.00012220108,0.00009273435,0.00006359004,9.034815e-7,0.000011220145,0.00016210895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788946,0.0003651469,0.0007290572,0.00020911053,0.0003073462,0.0004999006],"domain_scores_gemma":[0.9982465,0.0004720845,0.0005792309,0.00036558294,0.0002456154,0.000091016525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046953177,0.00018755578,0.0002843172,0.00008161558,0.00046281246,0.0004835768,0.0008696632,0.00008045962,0.0000010901052],"category_scores_gemma":[0.00033095758,0.00009325821,0.00013275763,0.00048257067,0.00020489414,0.0003400522,0.000074603384,0.00027480326,0.0000033200984],"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.000040617626,0.00012124305,0.002416243,0.000031208278,0.000056212033,0.000009822442,0.0015474255,0.000011233265,0.0001067251,0.3851786,0.00019679272,0.6102839],"study_design_scores_gemma":[0.003211908,0.0026891886,0.004153909,0.0000862315,0.00012671629,0.0015303119,0.0035290055,0.0023870813,0.0008801055,0.4454326,0.5352241,0.0007488718],"about_ca_topic_score_codex":0.000013183659,"about_ca_topic_score_gemma":0.00001872706,"teacher_disagreement_score":0.8655006,"about_ca_system_score_codex":0.00004171602,"about_ca_system_score_gemma":0.000107659886,"threshold_uncertainty_score":0.4663142},"labels":[],"label_agreement":null},{"id":"W2014657676","doi":"10.1016/j.jlap.2010.07.017","title":"Determinisation of relational substitutions in ordered categories with domain","year":2010,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Logic, programming, and type systems","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":"Converse; Unification; Substitution (logic); Mathematics; Domain (mathematical analysis); Quotient; Equivalence (formal languages); Determinacy; Context (archaeology); Pure mathematics; Equivalence class (music); Arrow; Algebra over a field; Computer science","score_opus":0.018950914013672087,"score_gpt":0.23861589300236488,"score_spread":0.2196649789886928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014657676","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.59756494,0.00037483164,0.40083155,0.00059274666,0.00018619218,0.00016247194,1.2658761e-7,0.00001515631,0.00027195012],"genre_scores_gemma":[0.9713807,0.000014342908,0.028505826,0.000022104883,0.000055659573,0.0000035938212,5.5628436e-7,0.0000030495573,0.000014168137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908423,0.000087376444,0.00036055123,0.00008806344,0.00022614484,0.00015361735],"domain_scores_gemma":[0.9991192,0.0001552566,0.00040145539,0.00014951071,0.00012750877,0.000047032587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011940955,0.000087843066,0.00016845907,0.00010250768,0.00012772974,0.000054777865,0.00030181152,0.000053910902,0.0000028664954],"category_scores_gemma":[0.00006844823,0.00004744955,0.000032764172,0.0002871167,0.00024002593,0.00032000677,0.00004809794,0.000258148,7.46852e-7],"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.000029803896,0.00006794045,0.014685087,0.000017916373,0.00002136857,0.000017724222,0.0035905142,0.000028108094,0.0006257928,0.9466055,0.0000061046344,0.034304116],"study_design_scores_gemma":[0.0029001248,0.0017907898,0.09308285,0.00006590222,0.00008265572,0.0036198888,0.0034832275,0.0013097026,0.0009376711,0.8839134,0.008342486,0.00047131476],"about_ca_topic_score_codex":0.000037222086,"about_ca_topic_score_gemma":0.0001067666,"teacher_disagreement_score":0.37381575,"about_ca_system_score_codex":0.000010738652,"about_ca_system_score_gemma":0.00011721927,"threshold_uncertainty_score":0.19349365},"labels":[],"label_agreement":null},{"id":"W2017672011","doi":"10.1016/j.jlap.2007.10.002","title":"Distributive contact lattices: Topological representations","year":2007,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Brock University","funders":"","keywords":"Mathematics; Axiom; Topological space; Algebraic structure; Complement (music); Distributive property; Generalization; Distributive lattice; Relation algebra; Complete Boolean algebra; Lattice (music); Algebra over a field; Pure mathematics; Two-element Boolean algebra; Algebra representation","score_opus":0.025402097568723185,"score_gpt":0.3030405959196174,"score_spread":0.2776384983508942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017672011","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.14691538,0.0015171223,0.8484676,0.0021099858,0.00017192742,0.00012311993,5.2139563e-7,0.000039944003,0.000654414],"genre_scores_gemma":[0.9741975,0.000109972796,0.0251186,0.0004106796,0.000121861405,0.000001092844,5.508947e-7,0.0000030705407,0.00003669141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988123,0.00011157265,0.00039394436,0.00013386707,0.0002326323,0.0003156485],"domain_scores_gemma":[0.99838334,0.0008108038,0.0003674215,0.00019166467,0.000118436255,0.00012835464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015946396,0.00011699642,0.00019857512,0.000056206278,0.00027842817,0.000086705375,0.0005795786,0.000051580337,0.000008739283],"category_scores_gemma":[0.00025598062,0.00006174485,0.00007757584,0.00028816427,0.00017274312,0.0003996061,0.0001687607,0.00030520768,0.0000031204888],"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.00006306236,0.00011118838,0.0033964622,0.000008306827,0.000057974314,0.00018326679,0.0015807496,0.000015949621,0.0005159654,0.7647047,0.00006104192,0.22930132],"study_design_scores_gemma":[0.0017157012,0.0023929426,0.08715095,0.00009753745,0.00014254285,0.0035025694,0.007097828,0.00050461164,0.001971777,0.8836022,0.011293492,0.00052786816],"about_ca_topic_score_codex":0.0000051535008,"about_ca_topic_score_gemma":0.000004010794,"teacher_disagreement_score":0.82728213,"about_ca_system_score_codex":0.000024832667,"about_ca_system_score_gemma":0.000028426879,"threshold_uncertainty_score":0.2517882},"labels":[],"label_agreement":null},{"id":"W2060444148","doi":"10.1016/j.jlap.2007.10.003","title":"Products in categories of relations","year":2007,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Categorical variable; Product category; Cartesian closed category; Product (mathematics); Relational theory; Mathematics; Category theory; Computer science; Algebra over a field; Theoretical computer science; Pure mathematics; Discrete mathematics; Statistics; Geometry","score_opus":0.024871047646799253,"score_gpt":0.25353834991651125,"score_spread":0.228667302269712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060444148","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.22000298,0.008695575,0.7663547,0.0023190302,0.0005971627,0.0004252926,1.0024886e-7,0.000045028653,0.0015601746],"genre_scores_gemma":[0.9887213,0.00005027622,0.011014223,0.00003526818,0.0000900602,0.0000010332113,1.7709822e-7,0.000003623918,0.000084045394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883914,0.00009137252,0.0005124362,0.00009815692,0.00022658307,0.00023229641],"domain_scores_gemma":[0.9989619,0.00019976293,0.00044532743,0.00018202241,0.00015865568,0.000052323005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032842874,0.00009024821,0.000202449,0.00013836302,0.00009288447,0.000046414534,0.00042667091,0.000047376318,0.0000014131581],"category_scores_gemma":[0.00019018442,0.000051356397,0.000040072646,0.0005212979,0.0001394112,0.0002803232,0.00009158569,0.00020987516,0.000001587955],"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.000029850224,0.00012930673,0.014308075,0.00005631348,0.00003515506,0.000047299305,0.008150668,0.00001920093,0.0005358293,0.7284492,0.00006453555,0.24817452],"study_design_scores_gemma":[0.0025082575,0.0027013656,0.07268246,0.00013296449,0.00013389968,0.0029354815,0.009355675,0.0005130971,0.007698651,0.8661577,0.034450576,0.0007298397],"about_ca_topic_score_codex":0.00004357155,"about_ca_topic_score_gemma":0.000028149156,"teacher_disagreement_score":0.7687183,"about_ca_system_score_codex":0.000019603889,"about_ca_system_score_gemma":0.000067496236,"threshold_uncertainty_score":0.20942532},"labels":[],"label_agreement":null},{"id":"W2083577794","doi":"10.1016/j.jlap.2010.07.014","title":"Abstract representation theorems for demonic refinement algebras","year":2010,"lang":"en","type":"article","venue":"The Journal of Logic and Algebraic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Gemeinsame Bundesausschuss; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Divergence (linguistics); Mathematics; Algebra over a field; Kleene algebra; Operator (biology); Algebra representation; Pure mathematics; Set (abstract data type); Cellular algebra; Discrete mathematics; Computer science","score_opus":0.02857482337820102,"score_gpt":0.28472167668815596,"score_spread":0.25614685330995496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083577794","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.23481925,0.0020198284,0.75566065,0.0038599134,0.0016561451,0.00088314846,4.3964138e-7,0.00010807833,0.0009925358],"genre_scores_gemma":[0.98031896,0.00007157294,0.018999489,0.00017077834,0.00034856363,0.000015215291,0.000001061829,0.000009275041,0.000065081935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985996,0.00007610401,0.0005160925,0.00018303607,0.00029977382,0.0003254047],"domain_scores_gemma":[0.9983841,0.00037111592,0.0006121632,0.00033289386,0.00018594976,0.00011373013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026716865,0.0001544147,0.00023943456,0.00008155003,0.00029520752,0.00024470384,0.00074546586,0.00008248908,0.0000092275895],"category_scores_gemma":[0.00021515289,0.0000856692,0.00012998951,0.00019235787,0.00013775885,0.00034327383,0.00011814143,0.00034277944,0.0000041396324],"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.00003097602,0.00007176063,0.0006613884,0.000029977924,0.000057920242,0.000009622858,0.0009878606,0.0000044295293,0.00343076,0.5369565,0.00020889958,0.45754993],"study_design_scores_gemma":[0.001769687,0.0011900704,0.0068554967,0.000029281828,0.00012300695,0.0010969343,0.0011667261,0.0009988182,0.004156925,0.938889,0.043294776,0.00042923682],"about_ca_topic_score_codex":0.000019932799,"about_ca_topic_score_gemma":0.00001881806,"teacher_disagreement_score":0.74549973,"about_ca_system_score_codex":0.000014443596,"about_ca_system_score_gemma":0.00006243861,"threshold_uncertainty_score":0.34934884},"labels":[],"label_agreement":null}]}