{"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":"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.12231682,0.00012327376,0.871603,0.00031187126,0.000043619704,0.00009234758,0.00015685635,0.0004736638,0.004878597],"genre_scores_gemma":[0.93674463,0.00014949647,0.060155846,0.00021182442,0.00009071051,0.00020257158,0.0003048169,0.0001838829,0.001956368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99276406,0.0016973518,0.0005931239,0.0017865336,0.0020096377,0.001149326],"domain_scores_gemma":[0.9554441,0.02957427,0.005953718,0.0027575206,0.004080769,0.0021897242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058091073,0.0012410394,0.0015350239,0.0030269672,0.0017791044,0.006022177,0.0028247933,0.0019879974,0.0031694933],"category_scores_gemma":[0.030922487,0.0013264031,0.0034523834,0.0018212828,0.00514541,0.008285371,0.00411228,0.004127009,0.00049019064],"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.00023297903,0.0001272008,0.0018491895,0.000081904866,0.00010018956,0.00029107442,0.0005373822,0.048936818,0.0036386754,0.9379146,0.00024601625,0.0060439794],"study_design_scores_gemma":[0.000050741535,0.00007169098,0.00032820628,0.000022982334,0.000056965535,0.00010325746,0.00008586417,0.33343652,0.0027781844,0.6625801,0.00044863776,0.000036925638],"about_ca_topic_score_codex":0.0034596126,"about_ca_topic_score_gemma":0.0026862156,"teacher_disagreement_score":0.006022177,"about_ca_system_score_codex":0.0038922522,"about_ca_system_score_gemma":0.0032617315,"threshold_uncertainty_score":0.030721903},"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":"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.35324308,0.0016825788,0.47452128,0.007877625,0.0009135368,0.00014389539,0.001351836,0.0011214373,0.15914477],"genre_scores_gemma":[0.91045153,0.0009891384,0.05548764,0.00055173476,0.00053514994,0.00016750554,0.000706846,0.000474568,0.030635815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963362,0.0012560675,0.00034993133,0.00071105646,0.000692299,0.00065438007],"domain_scores_gemma":[0.9904144,0.0060871914,0.0006241974,0.0015236558,0.0007246557,0.00062583387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00356645,0.00077286,0.0014797358,0.00414075,0.0051690354,0.00853672,0.0020762873,0.0023548915,0.011832001],"category_scores_gemma":[0.014067999,0.0014368492,0.0018982268,0.0053181346,0.008097935,0.032372236,0.0065148654,0.0063754637,0.0015741821],"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.000013484831,0.000008542004,0.0002310393,0.000012549002,0.0000031013392,0.000023471199,0.00026715794,0.0002357364,0.00009062137,0.99576735,0.0004319228,0.0029149244],"study_design_scores_gemma":[0.0000064937576,0.0000047651506,0.00017172926,0.000016222793,0.000010438654,0.000069914415,0.0001630252,0.0011617844,0.00022157897,0.9938455,0.004317436,0.000011084074],"about_ca_topic_score_codex":0.0016495694,"about_ca_topic_score_gemma":0.0017007686,"teacher_disagreement_score":0.011832001,"about_ca_system_score_codex":0.002798842,"about_ca_system_score_gemma":0.0011795475,"threshold_uncertainty_score":0.039581954},"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":"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.11023614,0.00045550798,0.8696911,0.0009600027,0.00016835057,0.00016680866,0.00040882258,0.0024570667,0.015456262],"genre_scores_gemma":[0.8260957,0.00040977323,0.16371424,0.00039230124,0.00035881062,0.00017869871,0.0006047799,0.000557011,0.0076885954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997426,0.0007232381,0.00024829464,0.00039671376,0.0007445768,0.00046125427],"domain_scores_gemma":[0.9905912,0.006758585,0.00042258546,0.0011538876,0.00070856523,0.00036514222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046323314,0.0007955904,0.001097055,0.0023420434,0.0019394683,0.0052240617,0.0020144524,0.001406053,0.0057476354],"category_scores_gemma":[0.010669782,0.0010037548,0.0020580324,0.0021969248,0.0037985314,0.012463244,0.0033730986,0.0038843602,0.0010757098],"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.00011374875,0.000042680887,0.00080166955,0.00008756431,0.000022279475,0.00016619543,0.0005906258,0.0012106799,0.0021514057,0.97285855,0.0011622517,0.020792294],"study_design_scores_gemma":[0.000038386264,0.000026355106,0.00032427307,0.000032192987,0.00007097892,0.00017706685,0.00015374036,0.01982721,0.0038967289,0.9717485,0.00366638,0.000038146136],"about_ca_topic_score_codex":0.0009734214,"about_ca_topic_score_gemma":0.0013683387,"teacher_disagreement_score":0.0057476354,"about_ca_system_score_codex":0.0016757813,"about_ca_system_score_gemma":0.001431719,"threshold_uncertainty_score":0.024498463},"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":"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.0059636743,0.00015296414,0.982701,0.0003687573,0.00007482798,0.000085862564,0.00026106252,0.004198254,0.0061935154],"genre_scores_gemma":[0.22481768,0.00046718135,0.7651085,0.0004109373,0.00011099843,0.00015625457,0.0013187394,0.0020708335,0.0055387653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660385,0.0010387185,0.00034443525,0.0007609406,0.0009783874,0.00027369344],"domain_scores_gemma":[0.994595,0.0031086216,0.00018986908,0.0015302273,0.0004396799,0.00013670164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035161017,0.0013633637,0.0014010746,0.002365647,0.0023048269,0.00626578,0.0042028045,0.0024347375,0.016949011],"category_scores_gemma":[0.012885709,0.0017212639,0.004859338,0.002442075,0.0048467224,0.018053276,0.0080370335,0.0052496246,0.0028123013],"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.00010757056,0.0000604046,0.00055407576,0.0002766842,0.00006343051,0.00026656184,0.00075153745,0.006092431,0.0022604489,0.9306955,0.005856701,0.05301472],"study_design_scores_gemma":[0.00003952704,0.000018992538,0.00010846177,0.000077198674,0.00007894253,0.00013952624,0.00023827127,0.05133188,0.0045966357,0.92571133,0.01761615,0.000043178385],"about_ca_topic_score_codex":0.0034459895,"about_ca_topic_score_gemma":0.004531468,"teacher_disagreement_score":0.016949011,"about_ca_system_score_codex":0.0017193068,"about_ca_system_score_gemma":0.0011818497,"threshold_uncertainty_score":0.05670005},"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":"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.0120008765,0.0003454804,0.64453703,0.00038118215,0.00022903222,0.00042682153,0.0032662358,0.32398492,0.014828365],"genre_scores_gemma":[0.28116757,0.00082621706,0.57384866,0.000614718,0.00021579258,0.0008144183,0.020770812,0.09949165,0.022250116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.992849,0.0016204952,0.0008813556,0.0011170987,0.0024817137,0.0010503363],"domain_scores_gemma":[0.98370034,0.004989545,0.0014053325,0.0060349233,0.0033824954,0.0004873697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065372796,0.0017381345,0.0014320285,0.0076388116,0.002215014,0.0066778013,0.0034978646,0.0021636093,0.045578208],"category_scores_gemma":[0.02456619,0.0026866475,0.0023635456,0.0035272108,0.0020103718,0.011061811,0.0060793944,0.0038034713,0.016120486],"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.0017444398,0.0006252664,0.0110726375,0.003382354,0.00022255325,0.0013870593,0.0023963791,0.010327079,0.033297513,0.1686374,0.19142976,0.57547754],"study_design_scores_gemma":[0.0007714725,0.000253278,0.005605385,0.0017480865,0.00031437256,0.0019211852,0.0009911177,0.14395471,0.12804283,0.16350488,0.5522689,0.00062379875],"about_ca_topic_score_codex":0.011646352,"about_ca_topic_score_gemma":0.013656123,"teacher_disagreement_score":0.045578208,"about_ca_system_score_codex":0.0028179835,"about_ca_system_score_gemma":0.0062280735,"threshold_uncertainty_score":0.15247428},"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":"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.24633135,0.0014290649,0.7094333,0.0023428036,0.0005787255,0.00017179298,0.0004329597,0.0018470279,0.037433006],"genre_scores_gemma":[0.9018139,0.0004323862,0.08367602,0.0005246108,0.00028822917,0.000121461715,0.00039047605,0.00052703236,0.012226007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918475,0.0022350699,0.0007923156,0.001790367,0.0020214068,0.0013132928],"domain_scores_gemma":[0.9826788,0.01114682,0.0008559243,0.0028342723,0.0017881049,0.00069604145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057796985,0.000521683,0.0016454746,0.0023189983,0.003608054,0.0071786013,0.002629082,0.0025637895,0.0053586382],"category_scores_gemma":[0.016352672,0.0019605993,0.003266448,0.0020038194,0.0072783027,0.0143045075,0.0066453954,0.005653423,0.000994993],"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.000107028085,0.00003547783,0.0005463104,0.000052973446,0.000021621268,0.00013273563,0.0006829753,0.0015496333,0.0011587841,0.9882287,0.0005040691,0.006979634],"study_design_scores_gemma":[0.000023483466,0.000016703136,0.0001626518,0.000018791647,0.000025788739,0.00011377049,0.00017666364,0.006226052,0.0022942286,0.9886458,0.0022644692,0.00003163239],"about_ca_topic_score_codex":0.0022477563,"about_ca_topic_score_gemma":0.0026657942,"teacher_disagreement_score":0.0071786013,"about_ca_system_score_codex":0.0031423701,"about_ca_system_score_gemma":0.0028532515,"threshold_uncertainty_score":0.030566335},"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":"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.29090726,0.0012804919,0.570155,0.0029733784,0.00048444592,0.00013350103,0.0007641192,0.0011266089,0.13217522],"genre_scores_gemma":[0.9490635,0.0005142692,0.030418105,0.0002565902,0.0003475421,0.00011101612,0.0004185084,0.00016592369,0.018704543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901545,0.00025908332,0.00005558544,0.00020831375,0.00030903146,0.0001524703],"domain_scores_gemma":[0.9972314,0.0011576251,0.00036826334,0.00038861786,0.00032468414,0.0005293859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011408667,0.0005458388,0.00069392443,0.002273214,0.0022602817,0.0072153667,0.0012594975,0.0013153413,0.012019558],"category_scores_gemma":[0.0033767328,0.0005507061,0.00060048397,0.0028866383,0.0046193996,0.011173458,0.0027591966,0.0026100334,0.0012712186],"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.000019023173,0.000013801641,0.00006246013,0.000009346953,0.0000012736738,0.00003388635,0.000145653,0.00021089966,0.00015899014,0.996999,0.00040647495,0.0019391789],"study_design_scores_gemma":[0.000016818545,0.000009526596,0.00005698144,0.000005304676,0.0000039928614,0.00007184681,0.00017978951,0.0031721606,0.0003237699,0.993361,0.0027926408,0.000006211691],"about_ca_topic_score_codex":0.00047393382,"about_ca_topic_score_gemma":0.0005649194,"teacher_disagreement_score":0.012019558,"about_ca_system_score_codex":0.0013622099,"about_ca_system_score_gemma":0.00078902196,"threshold_uncertainty_score":0.040209413},"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":"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.13960621,0.026492614,0.4977564,0.010038819,0.0021487493,0.00016234072,0.0015399675,0.0014469547,0.32080793],"genre_scores_gemma":[0.8496438,0.0061444384,0.09190108,0.0014634823,0.0015487231,0.00024106582,0.0011947002,0.0005533186,0.047309328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703765,0.0010570291,0.00023186966,0.0006502344,0.0007869548,0.00023629345],"domain_scores_gemma":[0.99692637,0.0015480719,0.00022655456,0.0005187568,0.00052980677,0.000250486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025877368,0.0007993718,0.0013760083,0.0036886695,0.003570348,0.008175393,0.0014274095,0.0017816739,0.00899067],"category_scores_gemma":[0.004368693,0.001185578,0.0013084629,0.005066571,0.0076836436,0.015459692,0.005100525,0.0035909365,0.0015506624],"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.0000054371953,0.0000031292464,0.00007718728,0.000016357832,0.0000030014332,0.000016703909,0.0002732779,0.000062587795,0.00006367188,0.99650675,0.0005362746,0.0024355482],"study_design_scores_gemma":[0.0000042684187,0.0000054799216,0.00006881013,0.000007711363,0.000005571922,0.00005734232,0.0000901699,0.0002618855,0.00008102334,0.9912157,0.008197545,0.000004584632],"about_ca_topic_score_codex":0.0017507293,"about_ca_topic_score_gemma":0.0013654832,"teacher_disagreement_score":0.00899067,"about_ca_system_score_codex":0.001887838,"about_ca_system_score_gemma":0.00095527124,"threshold_uncertainty_score":0.030076802},"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":"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.03316987,0.0008045043,0.8563591,0.0020488289,0.00046620236,0.00013845728,0.00073294766,0.001097921,0.105182186],"genre_scores_gemma":[0.7031974,0.001342886,0.22920558,0.0018670389,0.0006549527,0.000381013,0.002172408,0.0006793788,0.06049926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981054,0.00048164837,0.0001800579,0.00036014486,0.0005781194,0.00029457195],"domain_scores_gemma":[0.9970709,0.0011600262,0.00021248721,0.0006633975,0.000708446,0.00018467267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028970577,0.00091712736,0.00086539413,0.0022845285,0.0020094689,0.0041571674,0.002274919,0.0013166575,0.016415054],"category_scores_gemma":[0.005425639,0.0007127621,0.0025054049,0.0024401217,0.003522874,0.011232087,0.003746442,0.0047611115,0.0021988363],"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.000008889928,0.000006537947,0.000034273122,0.00001245811,0.0000040424197,0.00001220718,0.000095908545,0.00020238788,0.0001325611,0.99619627,0.0006784348,0.002616052],"study_design_scores_gemma":[0.000010678153,0.0000042944257,0.00002726715,0.000009100581,0.00000793489,0.00002049649,0.000044089054,0.0019509994,0.00033671272,0.99427706,0.0033051642,0.0000062132935],"about_ca_topic_score_codex":0.0026971113,"about_ca_topic_score_gemma":0.0021778615,"teacher_disagreement_score":0.016415054,"about_ca_system_score_codex":0.0023308296,"about_ca_system_score_gemma":0.0010401496,"threshold_uncertainty_score":0.05491382},"labels":[],"label_agreement":null}]}