{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Claude Marché","is_ca":true},{"name":"Christine Paulin-Mohring","is_ca":true},{"name":"Xavier Urbain","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00653728,0.001738135,0.001432028,0.007638812,0.002215014,0.006677801,0.003497865,0.002163609,0.04557821],"category_scores_gemma":[0.02456619,0.002686647,0.002363546,0.003527211,0.002010372,0.01106181,0.006079394,0.003803471,0.01612049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002817984,"about_ca_system_score_gemma":0.006228074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01164635,"about_ca_topic_score_gemma":0.01365612,"domain_scores_codex":[0.992849,0.001620495,0.0008813556,0.001117099,0.002481714,0.001050336],"domain_scores_gemma":[0.9837003,0.004989545,0.001405332,0.006034923,0.003382495,0.0004873697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00174444,0.0006252664,0.01107264,0.003382354,0.0002225533,0.001387059,0.002396379,0.01032708,0.03329751,0.1686374,0.1914298,0.5754775],"study_design_scores_gemma":[0.0007714725,0.000253278,0.005605385,0.001748087,0.0003143726,0.001921185,0.0009911177,0.1439547,0.1280428,0.1635049,0.5522689,0.0006237988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200088,0.0003454804,0.644537,0.0003811822,0.0002290322,0.0004268215,0.003266236,0.3239849,0.01482837],"genre_scores_gemma":[0.2811676,0.0008262171,0.5738487,0.000614718,0.0002157926,0.0008144183,0.02077081,0.09949165,0.02225012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04557821,"threshold_uncertainty_score":0.1524743,"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","authors":[{"name":"Josée Desharnais","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005809107,0.001241039,0.001535024,0.003026967,0.001779104,0.006022177,0.002824793,0.001987997,0.003169493],"category_scores_gemma":[0.03092249,0.001326403,0.003452383,0.001821283,0.00514541,0.008285371,0.00411228,0.004127009,0.0004901906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003892252,"about_ca_system_score_gemma":0.003261731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003459613,"about_ca_topic_score_gemma":0.002686216,"domain_scores_codex":[0.9927641,0.001697352,0.0005931239,0.001786534,0.002009638,0.001149326],"domain_scores_gemma":[0.9554441,0.02957427,0.005953718,0.002757521,0.004080769,0.002189724],"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.000232979,0.0001272008,0.00184919,0.00008190487,0.0001001896,0.0002910744,0.0005373822,0.04893682,0.003638675,0.9379146,0.0002460163,0.006043979],"study_design_scores_gemma":[0.00005074154,0.00007169098,0.0003282063,0.00002298233,0.00005696553,0.0001032575,0.00008586417,0.3334365,0.002778184,0.6625801,0.0004486378,0.00003692564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223168,0.0001232738,0.871603,0.0003118713,0.0000436197,0.00009234758,0.0001568563,0.0004736638,0.004878597],"genre_scores_gemma":[0.9367446,0.0001494965,0.06015585,0.0002118244,0.00009071051,0.0002025716,0.0003048169,0.0001838829,0.001956368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006022177,"threshold_uncertainty_score":0.0307219,"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","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Wendy MacCaull","is_ca":true},{"name":"Dimiter Vakarelov","is_ca":false},{"name":"Michael Winter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140867,0.0005458388,0.0006939244,0.002273214,0.002260282,0.007215367,0.001259497,0.001315341,0.01201956],"category_scores_gemma":[0.003376733,0.0005507061,0.000600484,0.002886638,0.0046194,0.01117346,0.002759197,0.002610033,0.001271219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00136221,"about_ca_system_score_gemma":0.000789022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004739338,"about_ca_topic_score_gemma":0.0005649194,"domain_scores_codex":[0.9990155,0.0002590833,0.00005558544,0.0002083138,0.0003090315,0.0001524703],"domain_scores_gemma":[0.9972314,0.001157625,0.0003682633,0.0003886179,0.0003246841,0.0005293859],"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.00001902317,0.00001380164,0.00006246013,0.000009346953,0.000001273674,0.00003388635,0.000145653,0.0002108997,0.0001589901,0.996999,0.000406475,0.001939179],"study_design_scores_gemma":[0.00001681855,0.000009526596,0.00005698144,0.000005304676,0.000003992861,0.00007184681,0.0001797895,0.003172161,0.0003237699,0.993361,0.002792641,0.000006211691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2909073,0.001280492,0.570155,0.002973378,0.0004844459,0.000133501,0.0007641192,0.001126609,0.1321752],"genre_scores_gemma":[0.9490635,0.0005142692,0.03041811,0.0002565902,0.0003475421,0.0001110161,0.0004185084,0.0001659237,0.01870454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01201956,"threshold_uncertainty_score":0.04020941,"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","authors":[{"name":"Wolfram Kahl","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003516102,0.001363364,0.001401075,0.002365647,0.002304827,0.00626578,0.004202805,0.002434738,0.01694901],"category_scores_gemma":[0.01288571,0.001721264,0.004859338,0.002442075,0.004846722,0.01805328,0.008037033,0.005249625,0.002812301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001719307,"about_ca_system_score_gemma":0.00118185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003445989,"about_ca_topic_score_gemma":0.004531468,"domain_scores_codex":[0.9966038,0.001038719,0.0003444352,0.0007609406,0.0009783874,0.0002736934],"domain_scores_gemma":[0.994595,0.003108622,0.0001898691,0.001530227,0.0004396799,0.0001367016],"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.0001075706,0.0000604046,0.0005540758,0.0002766842,0.00006343051,0.0002665618,0.0007515374,0.006092431,0.002260449,0.9306955,0.005856701,0.05301472],"study_design_scores_gemma":[0.00003952704,0.00001899254,0.0001084618,0.00007719867,0.00007894253,0.0001395262,0.0002382713,0.05133188,0.004596636,0.9257113,0.01761615,0.00004317838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005963674,0.0001529641,0.982701,0.0003687573,0.00007482798,0.00008586256,0.0002610625,0.004198254,0.006193515],"genre_scores_gemma":[0.2248177,0.0004671814,0.7651085,0.0004109373,0.0001109984,0.0001562546,0.001318739,0.002070833,0.005538765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01694901,"threshold_uncertainty_score":0.05670005,"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","authors":[{"name":"Michael Winter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002587737,0.0007993718,0.001376008,0.00368867,0.003570348,0.008175393,0.001427409,0.001781674,0.00899067],"category_scores_gemma":[0.004368693,0.001185578,0.001308463,0.005066571,0.007683644,0.01545969,0.005100525,0.003590937,0.001550662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001887838,"about_ca_system_score_gemma":0.0009552712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001750729,"about_ca_topic_score_gemma":0.001365483,"domain_scores_codex":[0.9970376,0.001057029,0.0002318697,0.0006502344,0.0007869548,0.0002362934],"domain_scores_gemma":[0.9969264,0.001548072,0.0002265546,0.0005187568,0.0005298068,0.000250486],"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.000005437195,0.000003129246,0.00007718728,0.00001635783,0.000003001433,0.00001670391,0.0002732779,0.00006258779,0.00006367188,0.9965068,0.0005362746,0.002435548],"study_design_scores_gemma":[0.000004268419,0.000005479922,0.00006881013,0.000007711363,0.000005571922,0.00005734232,0.0000901699,0.0002618855,0.00008102334,0.9912157,0.008197545,0.000004584632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1396062,0.02649261,0.4977564,0.01003882,0.002148749,0.0001623407,0.001539967,0.001446955,0.3208079],"genre_scores_gemma":[0.8496438,0.006144438,0.09190108,0.001463482,0.001548723,0.0002410658,0.0011947,0.0005533186,0.04730933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00899067,"threshold_uncertainty_score":0.0300768,"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","authors":[{"name":"Thomas Strahm","is_ca":false},{"name":"J. I. Zucker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004632331,0.0007955904,0.001097055,0.002342043,0.001939468,0.005224062,0.002014452,0.001406053,0.005747635],"category_scores_gemma":[0.01066978,0.001003755,0.002058032,0.002196925,0.003798531,0.01246324,0.003373099,0.00388436,0.00107571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001675781,"about_ca_system_score_gemma":0.001431719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009734214,"about_ca_topic_score_gemma":0.001368339,"domain_scores_codex":[0.997426,0.0007232381,0.0002482946,0.0003967138,0.0007445768,0.0004612543],"domain_scores_gemma":[0.9905912,0.006758585,0.0004225855,0.001153888,0.0007085652,0.0003651422],"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.0001137487,0.00004268089,0.0008016696,0.00008756431,0.00002227948,0.0001661954,0.0005906258,0.00121068,0.002151406,0.9728585,0.001162252,0.02079229],"study_design_scores_gemma":[0.00003838626,0.00002635511,0.0003242731,0.00003219299,0.00007097892,0.0001770668,0.0001537404,0.01982721,0.003896729,0.9717485,0.00366638,0.00003814614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1102361,0.000455508,0.8696911,0.0009600027,0.0001683506,0.0001668087,0.0004088226,0.002457067,0.01545626],"genre_scores_gemma":[0.8260957,0.0004097732,0.1637142,0.0003923012,0.0003588106,0.0001786987,0.0006047799,0.000557011,0.007688595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005747635,"threshold_uncertainty_score":0.02449846,"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","authors":[{"name":"Yasuo Kawahara","is_ca":false},{"name":"Michael Winter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00356645,0.00077286,0.001479736,0.00414075,0.005169035,0.00853672,0.002076287,0.002354892,0.011832],"category_scores_gemma":[0.014068,0.001436849,0.001898227,0.005318135,0.008097935,0.03237224,0.006514865,0.006375464,0.001574182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002798842,"about_ca_system_score_gemma":0.001179548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001649569,"about_ca_topic_score_gemma":0.001700769,"domain_scores_codex":[0.9963362,0.001256068,0.0003499313,0.0007110565,0.000692299,0.0006543801],"domain_scores_gemma":[0.9904144,0.006087191,0.0006241974,0.001523656,0.0007246557,0.0006258339],"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.00001348483,0.000008542004,0.0002310393,0.000012549,0.000003101339,0.0000234712,0.0002671579,0.0002357364,0.00009062137,0.9957674,0.0004319228,0.002914924],"study_design_scores_gemma":[0.000006493758,0.000004765151,0.0001717293,0.00001622279,0.00001043865,0.00006991441,0.0001630252,0.001161784,0.000221579,0.9938455,0.004317436,0.00001108407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3532431,0.001682579,0.4745213,0.007877625,0.0009135368,0.0001438954,0.001351836,0.001121437,0.1591448],"genre_scores_gemma":[0.9104515,0.0009891384,0.05548764,0.0005517348,0.0005351499,0.0001675055,0.000706846,0.000474568,0.03063582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.011832,"threshold_uncertainty_score":0.03958195,"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","authors":[{"name":"Wolfram Kahl","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005779698,0.000521683,0.001645475,0.002318998,0.003608054,0.007178601,0.002629082,0.002563789,0.005358638],"category_scores_gemma":[0.01635267,0.001960599,0.003266448,0.002003819,0.007278303,0.01430451,0.006645395,0.005653423,0.000994993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00314237,"about_ca_system_score_gemma":0.002853252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002247756,"about_ca_topic_score_gemma":0.002665794,"domain_scores_codex":[0.9918475,0.00223507,0.0007923156,0.001790367,0.002021407,0.001313293],"domain_scores_gemma":[0.9826788,0.01114682,0.0008559243,0.002834272,0.001788105,0.0006960414],"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.0001070281,0.00003547783,0.0005463104,0.00005297345,0.00002162127,0.0001327356,0.0006829753,0.001549633,0.001158784,0.9882287,0.0005040691,0.006979634],"study_design_scores_gemma":[0.00002348347,0.00001670314,0.0001626518,0.00001879165,0.00002578874,0.0001137705,0.0001766636,0.006226052,0.002294229,0.9886458,0.002264469,0.00003163239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2463313,0.001429065,0.7094333,0.002342804,0.0005787255,0.000171793,0.0004329597,0.001847028,0.03743301],"genre_scores_gemma":[0.9018139,0.0004323862,0.08367602,0.0005246108,0.0002882292,0.0001214617,0.0003904761,0.0005270324,0.01222601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007178601,"threshold_uncertainty_score":0.03056633,"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","authors":[{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Jules Desharnais","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002897058,0.0009171274,0.0008653941,0.002284528,0.002009469,0.004157167,0.002274919,0.001316658,0.01641505],"category_scores_gemma":[0.005425639,0.0007127621,0.002505405,0.002440122,0.003522874,0.01123209,0.003746442,0.004761111,0.002198836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00233083,"about_ca_system_score_gemma":0.00104015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002697111,"about_ca_topic_score_gemma":0.002177862,"domain_scores_codex":[0.9981054,0.0004816484,0.0001800579,0.0003601449,0.0005781194,0.0002945719],"domain_scores_gemma":[0.9970709,0.001160026,0.0002124872,0.0006633975,0.000708446,0.0001846727],"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.000008889928,0.000006537947,0.00003427312,0.00001245811,0.00000404242,0.00001220718,0.00009590854,0.0002023879,0.0001325611,0.9961963,0.0006784348,0.002616052],"study_design_scores_gemma":[0.00001067815,0.000004294426,0.00002726715,0.000009100581,0.00000793489,0.00002049649,0.00004408905,0.001950999,0.0003367127,0.9942771,0.003305164,0.000006213294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03316987,0.0008045043,0.8563591,0.002048829,0.0004662024,0.0001384573,0.0007329477,0.001097921,0.1051822],"genre_scores_gemma":[0.7031974,0.001342886,0.2292056,0.001867039,0.0006549527,0.000381013,0.002172408,0.0006793788,0.06049926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01641505,"threshold_uncertainty_score":0.05491382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}