{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"1f68cbe46a6b","filters":{"venue":"The Journal of Logic and Algebraic Programming"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03373960461384942,"gpt":0.2609795963231573,"spread":0.2272399917093079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004695318,0.0001875558,0.0002843172,0.00008161558,0.0004628125,0.0004835768,0.0008696632,0.00008045962,0.000001090105],"category_scores_gemma":[0.0003309576,0.00009325821,0.0001327576,0.0004825707,0.0002048941,0.0003400522,0.00007460338,0.0002748033,0.000003320098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004171602,"about_ca_system_score_gemma":0.0001076599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001318366,"about_ca_topic_score_gemma":0.00001872706,"domain_scores_codex":[0.9978895,0.0003651469,0.0007290572,0.0002091105,0.0003073462,0.0004999006],"domain_scores_gemma":[0.9982465,0.0004720845,0.0005792309,0.0003655829,0.0002456154,0.00009101653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004061763,0.0001212431,0.002416243,0.00003120828,0.00005621203,0.000009822442,0.001547426,0.00001123326,0.0001067251,0.3851786,0.0001967927,0.6102839],"study_design_scores_gemma":[0.003211908,0.002689189,0.004153909,0.0000862315,0.0001267163,0.001530312,0.003529005,0.002387081,0.0008801055,0.4454326,0.5352241,0.0007488718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1255812,0.02279453,0.8356205,0.008777697,0.001819285,0.004095886,7.490834e-7,0.0002156172,0.001094634],"genre_scores_gemma":[0.9910818,0.0001998826,0.008265569,0.0001222011,0.00009273435,0.00006359004,9.034815e-7,0.00001122015,0.0001621089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8655006,"threshold_uncertainty_score":0.4663142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0201040403771851,"gpt":0.2657216902340813,"spread":0.2456176498568962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002505344,0.0001454865,0.0003399291,0.0001101268,0.0001291939,0.00009132849,0.0005061109,0.0000549495,0.000008008596],"category_scores_gemma":[0.001261117,0.00008950767,0.00005729601,0.0003611425,0.0001707897,0.0005046295,0.0000661115,0.0001869523,0.000002525443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001735776,"about_ca_system_score_gemma":0.00008303843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001827809,"about_ca_topic_score_gemma":1.884504e-7,"domain_scores_codex":[0.9984236,0.0003372275,0.0005834204,0.0001336572,0.0002912607,0.0002308874],"domain_scores_gemma":[0.9978957,0.0004516151,0.001001918,0.0002202339,0.0003641271,0.00006644153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003391576,0.0005675461,0.001774145,0.0004426092,0.0002325186,0.00002770886,0.006136236,0.0006174155,0.02853489,0.1323945,0.00006089901,0.8288724],"study_design_scores_gemma":[0.01360186,0.02061644,0.0486628,0.003584585,0.001545939,0.01197898,0.007449951,0.07452143,0.0658498,0.7367281,0.0112092,0.004250919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2245869,0.001335641,0.7732167,0.0002346575,0.000166621,0.0002602065,5.700117e-7,0.00003258903,0.0001660741],"genre_scores_gemma":[0.8257985,0.00006187192,0.1739498,0.0001001115,0.00003815258,0.000003242971,4.424555e-7,0.000006429198,0.00004140855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8246215,"threshold_uncertainty_score":0.3650017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02540209756872319,"gpt":0.3030405959196174,"spread":0.2776384983508942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159464,0.0001169964,0.0001985751,0.00005620628,0.0002784282,0.00008670537,0.0005795786,0.00005158034,0.000008739283],"category_scores_gemma":[0.0002559806,0.00006174485,0.00007757584,0.0002881643,0.0001727431,0.0003996061,0.0001687607,0.0003052077,0.000003120489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002483267,"about_ca_system_score_gemma":0.00002842688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005153501,"about_ca_topic_score_gemma":0.000004010794,"domain_scores_codex":[0.9988123,0.0001115726,0.0003939444,0.0001338671,0.0002326323,0.0003156485],"domain_scores_gemma":[0.9983833,0.0008108038,0.0003674215,0.0001916647,0.0001184363,0.0001283546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006306236,0.0001111884,0.003396462,0.000008306827,0.00005797431,0.0001832668,0.00158075,0.00001594962,0.0005159654,0.7647047,0.00006104192,0.2293013],"study_design_scores_gemma":[0.001715701,0.002392943,0.08715095,0.00009753745,0.0001425428,0.003502569,0.007097828,0.0005046116,0.001971777,0.8836022,0.01129349,0.0005278682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1469154,0.001517122,0.8484676,0.002109986,0.0001719274,0.0001231199,5.213956e-7,0.000039944,0.000654414],"genre_scores_gemma":[0.9741975,0.0001099728,0.0251186,0.0004106796,0.0001218614,0.000001092844,5.508947e-7,0.000003070541,0.00003669141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8272821,"threshold_uncertainty_score":0.2517882,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02738433493084865,"gpt":0.2401897410176577,"spread":0.212805406086809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111918,0.0001308721,0.0001995649,0.0001136197,0.0002908084,0.00008090554,0.0005151956,0.00006481622,0.000003299069],"category_scores_gemma":[0.00008623374,0.00008972308,0.00007964455,0.000263028,0.0001260203,0.0004505843,0.0001144958,0.0002177575,5.511624e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003149748,"about_ca_system_score_gemma":0.00006129862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006573629,"about_ca_topic_score_gemma":0.000001077971,"domain_scores_codex":[0.9990221,0.00006035015,0.0003832402,0.0001275648,0.0001705758,0.0002361962],"domain_scores_gemma":[0.998933,0.0002225917,0.0003473227,0.0002245462,0.0001881815,0.00008432003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000179036,0.00002333056,0.0009262192,0.00002203327,0.00005538571,0.000006544505,0.004403471,0.00004204521,0.0001124927,0.8008308,0.00007842766,0.1934814],"study_design_scores_gemma":[0.002780433,0.003401565,0.009304793,0.00123054,0.0004830282,0.007576793,0.001974565,0.0454355,0.00477629,0.8670083,0.05451978,0.001508418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02624928,0.0007105496,0.9721449,0.00021239,0.0002188229,0.0002220149,5.332874e-7,0.0001609177,0.00008060809],"genre_scores_gemma":[0.4161791,0.00004749676,0.5836476,0.00003943107,0.00005662533,0.000009039888,2.298394e-7,0.000007166052,0.00001334389],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3899298,"threshold_uncertainty_score":0.3658801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02487104764679925,"gpt":0.2535383499165113,"spread":0.228667302269712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003284287,0.00009024821,0.000202449,0.000138363,0.00009288447,0.00004641453,0.0004266709,0.00004737632,0.000001413158],"category_scores_gemma":[0.0001901844,0.0000513564,0.00004007265,0.0005212979,0.0001394112,0.0002803232,0.00009158569,0.0002098752,0.000001587955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001960389,"about_ca_system_score_gemma":0.00006749624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004357155,"about_ca_topic_score_gemma":0.00002814916,"domain_scores_codex":[0.9988391,0.00009137252,0.0005124362,0.00009815692,0.0002265831,0.0002322964],"domain_scores_gemma":[0.9989619,0.0001997629,0.0004453274,0.0001820224,0.0001586557,0.000052323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002985022,0.0001293067,0.01430808,0.00005631348,0.00003515506,0.00004729931,0.008150668,0.00001920093,0.0005358293,0.7284492,0.00006453555,0.2481745],"study_design_scores_gemma":[0.002508258,0.002701366,0.07268246,0.0001329645,0.0001338997,0.002935481,0.009355675,0.0005130971,0.007698651,0.8661577,0.03445058,0.0007298397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.220003,0.008695575,0.7663547,0.00231903,0.0005971627,0.0004252926,1.002489e-7,0.00004502865,0.001560175],"genre_scores_gemma":[0.9887213,0.00005027622,0.01101422,0.00003526818,0.0000900602,0.000001033211,1.770982e-7,0.000003623918,0.00008404539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7687183,"threshold_uncertainty_score":0.2094253,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03612114453709036,"gpt":0.2745663011653381,"spread":0.2384451566282478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030054,0.0001778669,0.0002596392,0.0001299361,0.0007715576,0.000115665,0.0004740796,0.00008021676,0.00001222521],"category_scores_gemma":[0.0002438447,0.0001187384,0.0001967121,0.000388817,0.0002050608,0.0005794591,0.0001306114,0.0003536136,0.000002972701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008365425,"about_ca_system_score_gemma":0.0001574447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001699848,"about_ca_topic_score_gemma":0.0000126999,"domain_scores_codex":[0.9985022,0.0001251624,0.0004821474,0.0002303836,0.00031919,0.0003409283],"domain_scores_gemma":[0.9981894,0.0005913042,0.0004716403,0.000197042,0.0004236234,0.0001270109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0005780237,0.002233071,0.008005426,0.0001384118,0.001038871,0.000121869,0.01165036,0.001277555,0.004818983,0.129629,0.005257166,0.8352513],"study_design_scores_gemma":[0.007137054,0.01083123,0.5276397,0.0003096925,0.0008907156,0.01803975,0.003534781,0.0261249,0.003556424,0.3705771,0.02939079,0.001967824],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2971777,0.000484723,0.7000747,0.001139615,0.0005043621,0.0003963029,0.000001644523,0.00006406704,0.0001568765],"genre_scores_gemma":[0.9343773,0.00007548143,0.06487582,0.0001685223,0.0003742716,0.00001696883,0.000001680574,0.000009913255,0.0001001078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8332834,"threshold_uncertainty_score":0.5934275,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01280502869069286,"gpt":0.2486287236552423,"spread":0.2358236949645495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201557,0.00009804357,0.0001764825,0.00007282787,0.0001689667,0.00007749489,0.000483658,0.00004596088,0.000006450869],"category_scores_gemma":[0.0001307971,0.00005494743,0.00005858578,0.0002778548,0.0001578211,0.0004064318,0.0001350204,0.0005206804,0.000002461765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008957809,"about_ca_system_score_gemma":0.00004242671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001025494,"about_ca_topic_score_gemma":0.00003316284,"domain_scores_codex":[0.99913,0.00008874187,0.0002862844,0.0001043247,0.0001732179,0.0002174302],"domain_scores_gemma":[0.9992573,0.0001993587,0.0001909795,0.0002050268,0.00007249409,0.00007484353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003949652,0.0001383547,0.01320129,0.00001847687,0.00004574912,0.000086819,0.002507473,0.00007380333,0.001921818,0.4438612,0.000142798,0.5379627],"study_design_scores_gemma":[0.001397298,0.0008981025,0.06738612,0.00005849553,0.00006845752,0.00327368,0.002941251,0.000900199,0.0004841378,0.8816898,0.04040535,0.0004971106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6665567,0.001337384,0.3268122,0.003795792,0.0006866248,0.0001300968,2.773674e-7,0.00004146176,0.0006394501],"genre_scores_gemma":[0.9812387,0.00004874323,0.01834469,0.0001879912,0.0001279753,0.000002198539,1.40179e-7,0.000003057807,0.00004655142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5374656,"threshold_uncertainty_score":0.2262126,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01895091401367209,"gpt":0.2386158930023649,"spread":0.2196649789886928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001194095,0.00008784307,0.0001684591,0.0001025077,0.0001277297,0.00005477787,0.0003018115,0.0000539109,0.000002866495],"category_scores_gemma":[0.00006844823,0.00004744955,0.00003276417,0.0002871167,0.0002400259,0.0003200068,0.00004809794,0.000258148,7.46852e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001073865,"about_ca_system_score_gemma":0.0001172193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003722209,"about_ca_topic_score_gemma":0.0001067666,"domain_scores_codex":[0.9990842,0.00008737644,0.0003605512,0.00008806344,0.0002261448,0.0001536174],"domain_scores_gemma":[0.9991192,0.0001552566,0.0004014554,0.0001495107,0.0001275088,0.00004703259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000298039,0.00006794045,0.01468509,0.00001791637,0.00002136857,0.00001772422,0.003590514,0.00002810809,0.0006257928,0.9466055,0.000006104634,0.03430412],"study_design_scores_gemma":[0.002900125,0.00179079,0.09308285,0.00006590222,0.00008265572,0.003619889,0.003483227,0.001309703,0.0009376711,0.8839134,0.008342486,0.0004713148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5975649,0.0003748316,0.4008316,0.0005927467,0.0001861922,0.0001624719,1.265876e-7,0.00001515631,0.0002719501],"genre_scores_gemma":[0.9713807,0.00001434291,0.02850583,0.00002210488,0.00005565957,0.000003593821,5.562844e-7,0.000003049557,0.00001416814],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3738157,"threshold_uncertainty_score":0.1934936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02857482337820102,"gpt":0.284721676688156,"spread":0.256146853309955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671686,0.0001544147,0.0002394346,0.00008155003,0.0002952075,0.0002447038,0.0007454659,0.00008248908,0.00000922759],"category_scores_gemma":[0.0002151529,0.0000856692,0.0001299895,0.0001923579,0.0001377588,0.0003432738,0.0001181414,0.0003427794,0.000004139632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000144436,"about_ca_system_score_gemma":0.00006243861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000199328,"about_ca_topic_score_gemma":0.00001881806,"domain_scores_codex":[0.9985996,0.00007610401,0.0005160925,0.0001830361,0.0002997738,0.0003254047],"domain_scores_gemma":[0.9983841,0.0003711159,0.0006121632,0.0003328939,0.0001859498,0.0001137301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003097602,0.00007176063,0.0006613884,0.00002997792,0.00005792024,0.000009622858,0.0009878606,0.000004429529,0.00343076,0.5369565,0.0002088996,0.4575499],"study_design_scores_gemma":[0.001769687,0.00119007,0.006855497,0.00002928183,0.0001230069,0.001096934,0.001166726,0.0009988182,0.004156925,0.938889,0.04329478,0.0004292368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2348192,0.002019828,0.7556607,0.003859913,0.001656145,0.0008831485,4.396414e-7,0.0001080783,0.0009925358],"genre_scores_gemma":[0.980319,0.00007157294,0.01899949,0.0001707783,0.0003485636,0.00001521529,0.000001061829,0.000009275041,0.00006508193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7454997,"threshold_uncertainty_score":0.3493488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}