{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"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":"078f92b992ac","filters":{"venue":"Journal of Logical and Algebraic Methods in Programming"}},"results":[{"id":"W1968226057","doi":"10.1016/j.jlamp.2016.02.003","title":"Relational and algebraic methods in computer science","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"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":"Rotation formalisms in three dimensions; Algebraic number; Computer science; Categorical variable; Computation; Algebra over a field; Modal; Theoretical computer science; Mathematics; Programming language; Pure mathematics","authors":[{"name":"Peter Höfner","is_ca":false},{"name":"Peter Jipsen","is_ca":false},{"name":"Wolfram Kahl","is_ca":true},{"name":"Martin Müller","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06523853055516791,"gpt":0.3784879762966727,"spread":0.3132494457415048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007471891,0.000938281,0.001498977,0.003364775,0.002081023,0.008437741,0.001882132,0.001903619,0.01046221],"category_scores_gemma":[0.01883166,0.0007171083,0.001293018,0.004135635,0.01015584,0.01711509,0.003283403,0.006468642,0.001812383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002528855,"about_ca_system_score_gemma":0.002921832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002359111,"about_ca_topic_score_gemma":0.001745216,"domain_scores_codex":[0.9942842,0.002608794,0.0006089384,0.0006423815,0.001679654,0.0001759093],"domain_scores_gemma":[0.9840025,0.01178405,0.0005136281,0.001924814,0.001439813,0.0003350985],"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.000004979714,0.00001165589,0.00009522404,0.00008850617,0.00001093314,0.00001491385,0.0001429071,0.0002565071,0.00005035889,0.9860941,0.002518747,0.01071123],"study_design_scores_gemma":[0.000009645869,0.000006228363,0.00006768427,0.00005297139,0.000009487198,0.00004111747,0.00006197685,0.001667879,0.00007365425,0.975206,0.02279551,0.000007773591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007170788,0.08328664,0.8045093,0.02502408,0.004421042,0.0001003862,0.0003693824,0.0005311786,0.07458711],"genre_scores_gemma":[0.2852597,0.06799947,0.5963473,0.004244281,0.01261222,0.0005645092,0.0006758385,0.0004082297,0.03188841],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01046221,"threshold_uncertainty_score":0.03951561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2396862742","doi":"10.1016/j.jlamp.2016.04.001","title":"Declarative layout constraints for testing web applications","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Set (abstract data type); Web page; Window (computing); World Wide Web; Web application; Client-side scripting; Web browser; Information retrieval; Static web page; Programming language; Web navigation; The Internet","authors":[{"name":"Sylvain Hallé","is_ca":true},{"name":"Nicolas Bergeron","is_ca":true},{"name":"Francis Guérin","is_ca":true},{"name":"Gabriel Le Breton","is_ca":true},{"name":"Oussama Beroual","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1014790092479599,"gpt":0.3946221533810154,"spread":0.2931431441330555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007711368,0.00143094,0.001279663,0.001927603,0.0009294346,0.004074116,0.005768748,0.00231306,0.006144099],"category_scores_gemma":[0.04613811,0.001483851,0.002110026,0.001533087,0.003137996,0.008826293,0.004550261,0.004004884,0.001019193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001713526,"about_ca_system_score_gemma":0.003753452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005397942,"about_ca_topic_score_gemma":0.008609754,"domain_scores_codex":[0.9867049,0.004006924,0.001487075,0.001504023,0.005023659,0.001273365],"domain_scores_gemma":[0.9356266,0.04605351,0.003575815,0.007605414,0.005723243,0.001415518],"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.001058891,0.001346325,0.01422164,0.001169804,0.0003430894,0.001975272,0.001212971,0.2888007,0.02868554,0.4019953,0.01773149,0.241459],"study_design_scores_gemma":[0.0001851053,0.0002196979,0.0009945306,0.0001726387,0.000111819,0.0003743432,0.0003368621,0.6893964,0.02310122,0.2761807,0.008835131,0.00009159585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03602113,0.000219948,0.9501384,0.0008383026,0.0001361419,0.000299445,0.001123025,0.006839264,0.00438426],"genre_scores_gemma":[0.4367774,0.0001826344,0.5559183,0.0005583743,0.0001242984,0.0004222338,0.00199094,0.001173342,0.002852353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007711368,"threshold_uncertainty_score":0.04078209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205763999","doi":"10.1016/j.jlamp.2015.03.002","title":"Relational and algebraic methods in computer science","year":2015,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Cognitive Science and Mapping","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":"McMaster University","funders":"","keywords":"Algebraic number; Computer science; Mathematics education; Algebra over a field; Mathematics; Pure mathematics","authors":[{"name":"Wolfram Kahl","is_ca":true},{"name":"Timothy G. Griffin","is_ca":false},{"name":"Peter Höfner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1528972632299675,"gpt":0.4224186430106527,"spread":0.2695213797806852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00490133,0.0007777165,0.001369299,0.003145423,0.002167502,0.008144554,0.001478962,0.001742633,0.01130171],"category_scores_gemma":[0.01199769,0.0006474119,0.001176555,0.00431637,0.01049351,0.01855971,0.003095221,0.004754997,0.001342343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002629614,"about_ca_system_score_gemma":0.002427116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001980527,"about_ca_topic_score_gemma":0.001504135,"domain_scores_codex":[0.9963284,0.001746834,0.0003915945,0.0004219333,0.0009752152,0.0001359535],"domain_scores_gemma":[0.9909312,0.006695971,0.0003234773,0.001002799,0.0008125218,0.0002341494],"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.000001827549,0.000005211234,0.00003373775,0.00003737332,0.000003902431,0.000006469764,0.00009547701,0.000124359,0.00002423346,0.9950001,0.0008955349,0.003771717],"study_design_scores_gemma":[0.00000420767,0.000003313658,0.00003542391,0.0000234889,0.000005453491,0.00002316261,0.0000500207,0.0009603277,0.00004005382,0.9870908,0.01175953,0.000004115754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01307703,0.05310493,0.8002611,0.02356952,0.003710923,0.00008536486,0.0003058693,0.0004522926,0.1054331],"genre_scores_gemma":[0.4614795,0.03857411,0.444921,0.002847695,0.00766068,0.0004695751,0.0003535781,0.0003893783,0.04330454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01130171,"threshold_uncertainty_score":0.03780794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032028343","doi":"10.1016/j.jlap.2014.02.005","title":"Relational style laws and constructs of linear algebra","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"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","keywords":"Mathematics; Algebra over a field; Converse; Axiom; Relation (database); Context (archaeology); Domain (mathematical analysis); Symmetric algebra; Commutative property; Intersection (aeronautics); Pure mathematics; Algebra representation; Cellular algebra; Computer science","authors":[{"name":"Jules Desharnais","is_ca":true},{"name":"Anastasiya Grinenko","is_ca":true},{"name":"Bernhard Möller","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04890587353074712,"gpt":0.3410464175587398,"spread":0.2921405440279927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466176,0.000565034,0.0007173264,0.001932223,0.0021046,0.005071356,0.001562817,0.001137632,0.00710369],"category_scores_gemma":[0.006019669,0.0008651856,0.001325977,0.002291293,0.007035924,0.01411476,0.00272702,0.004118082,0.001004117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001458772,"about_ca_system_score_gemma":0.0008540672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002090883,"about_ca_topic_score_gemma":0.001622795,"domain_scores_codex":[0.9982646,0.0005711293,0.0001661244,0.0003447308,0.0005021252,0.0001513561],"domain_scores_gemma":[0.9971893,0.001537372,0.0002199759,0.0004495951,0.0004226827,0.0001810936],"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.000004255874,0.000006985543,0.00007043061,0.000009086785,0.000002159975,0.0000108474,0.000189424,0.0001030854,0.00007263459,0.9976929,0.0002371343,0.001601042],"study_design_scores_gemma":[0.000006269895,0.000005018534,0.00005620001,0.00000589815,0.000005495164,0.00002396877,0.00005252634,0.0009096682,0.0001457942,0.9962656,0.002518632,0.000004927261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07898381,0.002222146,0.8066866,0.004285636,0.0004615788,0.0001211188,0.0006254044,0.0008113144,0.1058024],"genre_scores_gemma":[0.8027222,0.001753138,0.166272,0.0012828,0.001016151,0.0002159674,0.0006120002,0.0003459694,0.02577975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00710369,"threshold_uncertainty_score":0.02376419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386879846","doi":"10.1016/j.jlamp.2023.100919","title":"Branching pomsets: Design, expressiveness and applications to choreographies","year":2023,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Electronic Components and Systems for European Leadership; Key Digital Technologies Joint Undertaking; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche; Ministério da Ciência, Tecnologia e Ensino Superior; European Commission; Canadian Institute of Steel Construction","keywords":"Branching (polymer chemistry); Computer science; Concurrency; Theoretical computer science; ENCODE; Programming language; Event structure; Set (abstract data type); Operational semantics; Automaton; Semantics (computer science); Mathematics","authors":[{"name":"Luc Edixhoven","is_ca":false},{"name":"Sung-Shik Jongmans","is_ca":false},{"name":"José Proença","is_ca":false},{"name":"Ilaria Castellani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06223679255921293,"gpt":0.3772277272417923,"spread":0.3149909346825794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00350643,0.00124738,0.0009024914,0.001710518,0.002027021,0.003869757,0.002020177,0.00152517,0.005843708],"category_scores_gemma":[0.009505509,0.001296315,0.0026875,0.002197122,0.00677377,0.006039344,0.00387204,0.00307193,0.0007866436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002316599,"about_ca_system_score_gemma":0.001879101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004341048,"about_ca_topic_score_gemma":0.003255589,"domain_scores_codex":[0.9969254,0.001080958,0.0004059114,0.0005137713,0.0008246665,0.0002491827],"domain_scores_gemma":[0.9941894,0.003295904,0.0005955909,0.001099539,0.0004675931,0.0003521478],"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.00005704262,0.00002833591,0.0004262306,0.0001648107,0.00003242639,0.0002786806,0.0008651637,0.03592726,0.003601071,0.9402695,0.0005970008,0.01775246],"study_design_scores_gemma":[0.00005626674,0.0000533915,0.0001755023,0.0001268107,0.00004654838,0.0002736632,0.0002534667,0.1295327,0.006202421,0.8384665,0.02475036,0.00006240098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006603912,0.0002120398,0.9877332,0.0002014764,0.00004574823,0.0001596618,0.0001464791,0.0006843566,0.004213046],"genre_scores_gemma":[0.2345549,0.0008033783,0.7571405,0.0001327152,0.00008540715,0.0009930052,0.0003271193,0.0003509739,0.005612053],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005843708,"threshold_uncertainty_score":0.01954913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982958309","doi":"10.1016/j.jlap.2014.02.006","title":"Discrete dualities for some algebras with relations","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"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":"Binary relation; Representation (politics); Scope (computer science); Syllogism; Existentialism; Algebra over a field; Mathematics; Field (mathematics); Binary number; Pure mathematics; Computer science; Discrete mathematics; Epistemology; Arithmetic; Programming language; Philosophy","authors":[{"name":"Ivo Düntsch","is_ca":true},{"name":"Ewa Orłowska","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03290005820379674,"gpt":0.3406227897451933,"spread":0.3077227315413966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127945,0.0006497155,0.0009360629,0.002203545,0.003277106,0.005811746,0.001428727,0.001146375,0.01066666],"category_scores_gemma":[0.003931146,0.0007947239,0.001723276,0.001968205,0.004220311,0.008446733,0.003330518,0.005440743,0.0009485006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002281995,"about_ca_system_score_gemma":0.001258494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001180828,"about_ca_topic_score_gemma":0.001386544,"domain_scores_codex":[0.9983317,0.0004205538,0.0001354102,0.0003168143,0.0005075006,0.0002880433],"domain_scores_gemma":[0.9976577,0.0009872467,0.0002200471,0.0002031496,0.0004231176,0.0005087133],"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.00001098696,0.00001403847,0.00003912179,0.000009029449,0.000003665759,0.00001864213,0.00006716407,0.0001127931,0.0001251388,0.9985769,0.0002100626,0.0008124324],"study_design_scores_gemma":[0.00001576485,0.000005936079,0.00003779037,0.000005225339,0.000005621818,0.00004773062,0.00005507693,0.001594901,0.00022075,0.9965255,0.001478274,0.000007357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2445962,0.001662265,0.5652032,0.005731234,0.0008117607,0.0002265609,0.001024766,0.0003359238,0.1804081],"genre_scores_gemma":[0.8709585,0.000665755,0.08497465,0.000850195,0.0005936028,0.0001912702,0.0006297497,0.0001232663,0.04101308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01066666,"threshold_uncertainty_score":0.03568357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996431919","doi":"10.1016/j.jlamp.2014.11.001","title":"Models of computation for partial functions on the reals","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"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":"Countable set; Computability; Mathematics; Disjoint sets; Computation; Disjoint union (topology); Domain (mathematical analysis); Discrete mathematics; Sequence (biology); Algorithm; Mathematical analysis","authors":[{"name":"Ming Quan Fu","is_ca":true},{"name":"J. I. Zucker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.108559188326226,"gpt":0.3797519651047765,"spread":0.2711927767785505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002171362,0.00118289,0.001200949,0.001497457,0.001758006,0.009034967,0.002066513,0.002097074,0.007561315],"category_scores_gemma":[0.005847432,0.0008210208,0.002269797,0.001828022,0.006169933,0.01428677,0.002433105,0.00354557,0.0009060049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002901735,"about_ca_system_score_gemma":0.001304855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00284538,"about_ca_topic_score_gemma":0.002957305,"domain_scores_codex":[0.9982476,0.000731389,0.0001193054,0.0002899985,0.0003982425,0.0002133194],"domain_scores_gemma":[0.9969548,0.001812943,0.0001887922,0.0005803966,0.0002688453,0.0001941757],"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.000006165645,0.000003907002,0.0000345761,0.000009262627,0.000003248602,0.00001160247,0.00006256923,0.001438899,0.00004712535,0.9975935,0.0001892125,0.0005999184],"study_design_scores_gemma":[0.000008064102,0.000004590574,0.00002229706,0.000007773564,0.00000415199,0.00001516853,0.00003257827,0.009419898,0.00004841111,0.9889967,0.001435592,0.000004755638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0682742,0.003060518,0.8261147,0.005965448,0.000287544,0.0001070366,0.0006792312,0.0005793655,0.09493206],"genre_scores_gemma":[0.8696052,0.001635678,0.1030807,0.0005034189,0.0004339152,0.0002635224,0.0006494319,0.0001731973,0.02365494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009034967,"threshold_uncertainty_score":0.02529514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2218924106","doi":"10.1016/j.jlamp.2015.08.004","title":"On the weaving process of aspect-oriented product family algebra","year":2015,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Weaving; Computer science; Product (mathematics); Rewriting; Feature (linguistics); Process (computing); Programming language; Separation of concerns; Software engineering; Software; Mathematics; Engineering","authors":[{"name":"Qinglei Zhang","is_ca":false},{"name":"Ridha Khédri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09725424835872291,"gpt":0.3840404181785746,"spread":0.2867861698198517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002032399,0.0004217029,0.0006320056,0.001203265,0.002024355,0.002303552,0.001059397,0.0007431074,0.003949293],"category_scores_gemma":[0.005623907,0.0005434629,0.002007198,0.001650695,0.002462765,0.00605786,0.002224463,0.001960999,0.0005330642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007122193,"about_ca_system_score_gemma":0.000956683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004555668,"about_ca_topic_score_gemma":0.002306517,"domain_scores_codex":[0.9983957,0.0004739137,0.0001186262,0.000328682,0.0004936624,0.000189261],"domain_scores_gemma":[0.9979503,0.00088447,0.0001686695,0.0005082519,0.0003449529,0.0001433219],"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.00005606751,0.00003489741,0.0008616685,0.00004802116,0.0000261454,0.0002976035,0.0008271122,0.007199743,0.002545905,0.960259,0.0004921793,0.02735165],"study_design_scores_gemma":[0.00001660438,0.00005087462,0.0004396762,0.00003705141,0.00005451286,0.0002942947,0.0002130188,0.08408336,0.003420911,0.9021816,0.009171039,0.00003706092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05869905,0.0004487952,0.9281051,0.0002597395,0.00006827615,0.00008359626,0.00004656988,0.000226903,0.01206207],"genre_scores_gemma":[0.7245636,0.001255662,0.2612514,0.0001342447,0.000123258,0.0001105861,0.0002790729,0.0002838239,0.01199836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004555668,"threshold_uncertainty_score":0.01321167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014332513","doi":"10.1016/j.jlap.2013.11.001","title":"Characterizations of semicomputable sets of real numbers","year":2013,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"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":"Disjoint sets; Mathematics; Class (philosophy); Algebraic number; Projection (relational algebra); Real number; Algebra over a field; Rational number; Algebraic operation; Discrete mathematics; Pure mathematics; Computer science; Algorithm","authors":[{"name":"Bo Xie","is_ca":true},{"name":"Ming Quan Fu","is_ca":true},{"name":"J. I. Zucker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03507238830327356,"gpt":0.3478299379551908,"spread":0.3127575496519172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792832,0.0005731557,0.001063052,0.004384018,0.003103446,0.008355577,0.002441282,0.001586998,0.008425266],"category_scores_gemma":[0.01761464,0.0009501803,0.001580015,0.003310581,0.005386723,0.01246317,0.00435075,0.003135687,0.0007476478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002185638,"about_ca_system_score_gemma":0.00128188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000656214,"about_ca_topic_score_gemma":0.0006200718,"domain_scores_codex":[0.9963009,0.0006289037,0.0004517679,0.0007653118,0.001374498,0.0004784679],"domain_scores_gemma":[0.9759859,0.01538278,0.002373654,0.002622057,0.002387058,0.001248411],"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.00005945893,0.00002588273,0.000693323,0.00004484584,0.000009374962,0.0001187114,0.0006739338,0.0006034769,0.000792472,0.9927527,0.0003708108,0.003855021],"study_design_scores_gemma":[0.00001629032,0.00002603375,0.0003990627,0.00002923209,0.00001229126,0.0002059033,0.0003345797,0.005700995,0.001524667,0.988545,0.00318063,0.00002539946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5224635,0.001444755,0.4199406,0.002091736,0.0003622487,0.00016483,0.001049192,0.0008087508,0.05167437],"genre_scores_gemma":[0.9514461,0.000316544,0.03910205,0.0002831673,0.0003086188,0.0001308045,0.0008196702,0.0001452579,0.007447846],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008425266,"threshold_uncertainty_score":0.02818531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790776996","doi":"10.1016/j.jlamp.2018.02.001","title":"Convergence: Integrating termination and abort-freedom","year":2018,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Abort; Heuristics; Convergence (economics); Computation; Computer science; Property (philosophy); Outcome (game theory); Mathematical optimization; Mathematics; Mathematical economics; Algorithm; Programming language","authors":[{"name":"Nafi Diallo","is_ca":false},{"name":"Wided Ghardallou","is_ca":false},{"name":"Jules Desharnais","is_ca":true},{"name":"Ali Mili","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04241309915636295,"gpt":0.3617428168297641,"spread":0.3193297176734012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03163921,0.001361975,0.003651064,0.003586476,0.004091544,0.01064724,0.005477815,0.004073295,0.007838114],"category_scores_gemma":[0.1308224,0.002280474,0.003576372,0.002681319,0.01664601,0.03038467,0.01906552,0.01266524,0.001700867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002944782,"about_ca_system_score_gemma":0.00537542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003041575,"about_ca_topic_score_gemma":0.00235952,"domain_scores_codex":[0.9664885,0.01553654,0.002300038,0.003777657,0.008684793,0.003212517],"domain_scores_gemma":[0.8383982,0.1046211,0.005876531,0.03017394,0.01669027,0.004239916],"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.0003524775,0.0001145718,0.00270755,0.0001518064,0.00003982923,0.0002120964,0.001982789,0.009161662,0.0008670188,0.955832,0.002430799,0.02614737],"study_design_scores_gemma":[0.00005575406,0.00004279568,0.0002306195,0.00008036873,0.00005942374,0.0001183807,0.0003059834,0.05934775,0.001695201,0.9350978,0.002917092,0.00004884531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.027887,0.0003522492,0.9501442,0.001377282,0.0002138884,0.0001515359,0.000138637,0.001726467,0.01800883],"genre_scores_gemma":[0.6685851,0.0005125698,0.3120881,0.0008803587,0.000538565,0.0004132933,0.0004808613,0.004179427,0.01232166],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03163921,"threshold_uncertainty_score":0.1673261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573726090","doi":"10.1016/j.jlamp.2016.12.002","title":"Solving computational tasks on finite topologies by means of relation algebra and the RelView tool","year":2017,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"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":"Network topology; Relation (database); Algebra over a field; Computer science; Algebraic number; Algebraic operation; Translation (biology); Simple (philosophy); Theoretical computer science; Mathematics; Pure mathematics","authors":[{"name":"Rudolf Berghammer","is_ca":false},{"name":"Michael Winter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05562391857438079,"gpt":0.3652962391740452,"spread":0.3096723205996644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002974041,0.0008808857,0.001792576,0.00122829,0.001382256,0.003763357,0.003308219,0.001078543,0.008045093],"category_scores_gemma":[0.00848471,0.001073249,0.003988278,0.001618693,0.00261036,0.01081787,0.004902793,0.003252045,0.001262817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008036033,"about_ca_system_score_gemma":0.001717368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002340881,"about_ca_topic_score_gemma":0.00578361,"domain_scores_codex":[0.9972149,0.001162982,0.0002236146,0.0005968101,0.0005986638,0.0002029504],"domain_scores_gemma":[0.9957063,0.003159223,0.0001330606,0.0006881671,0.000181924,0.0001313964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002629775,0.0002679084,0.00101494,0.0007223607,0.0002453802,0.0003003856,0.0009411284,0.09382986,0.00373416,0.67988,0.00454132,0.2142595],"study_design_scores_gemma":[0.00005860199,0.00004445824,0.0001229185,0.00005388063,0.00004991738,0.0001061291,0.0001928325,0.2786829,0.002306303,0.7117062,0.006647113,0.000028803],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007142209,0.0001056507,0.9895935,0.0001430532,0.00001992698,0.00004710236,0.00009555149,0.000865343,0.001987677],"genre_scores_gemma":[0.1081598,0.0002123021,0.8893337,0.00006602155,0.00003798823,0.000166375,0.0004120278,0.0002599513,0.001351902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008045093,"threshold_uncertainty_score":0.02691358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3044333037","doi":"10.1016/j.jlamp.2020.100581","title":"Calculational relation-algebraic proofs in the teaching tool","year":2020,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"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":"Mathematical proof; Relation (database); Rewriting; Algebraic number; Associative property; Computer science; Algebra over a field; Proof assistant; Calculus (dental); Mathematics; Programming language; Pure mathematics","authors":[{"name":"Wolfram Kahl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06795301837812634,"gpt":0.3526213937981721,"spread":0.2846683754200458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003311248,0.0005285736,0.0005168878,0.001055709,0.001454399,0.004548046,0.002223046,0.001205233,0.02846689],"category_scores_gemma":[0.01747582,0.0005808173,0.0006433413,0.001121532,0.003272158,0.01176627,0.003970219,0.003832165,0.004987409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00163911,"about_ca_system_score_gemma":0.002024499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006046451,"about_ca_topic_score_gemma":0.0009536407,"domain_scores_codex":[0.9976723,0.00128983,0.0001197976,0.0002665873,0.0005061356,0.0001454007],"domain_scores_gemma":[0.9877899,0.009290768,0.0002386398,0.001498905,0.0008176894,0.0003641257],"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.00003640599,0.00004274894,0.0001672998,0.00005663671,0.000004236155,0.00005395794,0.0004328196,0.0007726757,0.0006482158,0.9636105,0.004903399,0.02927112],"study_design_scores_gemma":[0.00004084145,0.00002655,0.00008164322,0.00006286077,0.00001045454,0.0001703523,0.0001715365,0.01513368,0.003261921,0.9408342,0.0401861,0.00001986653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01749718,0.0006565166,0.8756236,0.005496951,0.0004705144,0.00006010507,0.0001427128,0.003224641,0.09682778],"genre_scores_gemma":[0.5464113,0.0005951897,0.4199019,0.000808709,0.0003129938,0.0001231186,0.0001782965,0.001191129,0.03047739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02846689,"threshold_uncertainty_score":0.09523118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2279569925","doi":"10.1016/j.jlamp.2015.12.006","title":"Dependencies in relational models of databases","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"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":"Relational database; Computer science; Fuzzy logic; Set (abstract data type); Fuzzy set; Data mining; Relational model; Database; Binary number; Binary relation; Value (mathematics); Database model; Theoretical computer science; Mathematics; Artificial intelligence; Discrete mathematics; Programming language; Machine learning; Arithmetic","authors":[{"name":"Michael Winter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1362856637825906,"gpt":0.3716287206328223,"spread":0.2353430568502317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003902024,0.0007244001,0.0009812869,0.002252457,0.001688136,0.00512211,0.002102779,0.001548713,0.004866988],"category_scores_gemma":[0.01877744,0.001428147,0.001529971,0.003271,0.002659272,0.0147182,0.003322748,0.003232408,0.0008324994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001788594,"about_ca_system_score_gemma":0.001939883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004839081,"about_ca_topic_score_gemma":0.004230241,"domain_scores_codex":[0.9956759,0.0017391,0.0005009808,0.0006321028,0.001167508,0.0002844269],"domain_scores_gemma":[0.9869131,0.00856614,0.0009541876,0.002025197,0.001068752,0.0004726974],"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.00002745035,0.00002473373,0.0006066379,0.00006437652,0.00001942204,0.0001004931,0.0003326683,0.009076589,0.000220232,0.9793107,0.001378932,0.008837704],"study_design_scores_gemma":[0.000008519729,0.000009071904,0.00008811589,0.00002193705,0.00002349761,0.00005315992,0.00005911541,0.03286756,0.0002002591,0.9624515,0.00420725,0.000009992817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04675118,0.002383008,0.931437,0.002994609,0.0002007354,0.0000812151,0.0008713445,0.0005906972,0.01469021],"genre_scores_gemma":[0.7265599,0.004315971,0.2491912,0.0008332396,0.0006217746,0.0003236348,0.002157795,0.0003968704,0.01559961],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00512211,"threshold_uncertainty_score":0.02063608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991997530","doi":"10.1016/j.jlap.2014.02.010","title":"Towards “mouldable code” via nested code graph transformation","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Model-Driven Software Engineering Techniques","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":"Graph rewriting; Computer science; Programming language; Transformation (genetics); Abstract syntax tree; Theoretical computer science; Graph; Program transformation; Control flow graph; Code generation; Control flow; Parsing; Key (lock)","authors":[{"name":"Wolfram Kahl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03748765793481015,"gpt":0.3395141873912903,"spread":0.3020265294564801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004357535,0.0005496269,0.0004293578,0.0007184993,0.0005144765,0.0008187644,0.001171925,0.0007986272,0.004998737],"category_scores_gemma":[0.002286154,0.000449855,0.001207256,0.000456355,0.001588191,0.001412605,0.002070185,0.001491013,0.001260509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004074941,"about_ca_system_score_gemma":0.000660955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303692,"about_ca_topic_score_gemma":0.001943985,"domain_scores_codex":[0.9992414,0.0001521956,0.00003028894,0.0001423449,0.0003551579,0.00007864825],"domain_scores_gemma":[0.9989904,0.0002702629,0.00006284631,0.0004560567,0.000185222,0.00003519467],"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.0001067712,0.0001654916,0.0007144731,0.0002699939,0.00006275262,0.00036125,0.0006455102,0.09519735,0.06698109,0.6187397,0.006382192,0.2103734],"study_design_scores_gemma":[0.00003551617,0.00008657341,0.0002623995,0.00005807787,0.00005214105,0.0002452986,0.0001104443,0.5561334,0.06221371,0.3387906,0.04196983,0.00004190251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009589882,0.0000220571,0.9835133,0.00007978226,0.00003966634,0.00004076134,0.00002633317,0.003004968,0.003683225],"genre_scores_gemma":[0.2036981,0.00008094739,0.7874438,0.0001594959,0.00002135723,0.0001149398,0.0002289116,0.002567618,0.005684814],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004998737,"threshold_uncertainty_score":0.01672244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206823480","doi":"10.1016/j.jlap.2014.02.017","title":"Preface","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"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":"Psychology","authors":[{"name":"Rudolf Berghammer","is_ca":false},{"name":"Bernhard Möller","is_ca":false},{"name":"Michael Winter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03321505617706023,"gpt":0.3472563510243188,"spread":0.3140412948472586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001379164,0.0007955874,0.0006552378,0.003119617,0.002138396,0.003650875,0.001197235,0.001120558,0.4256148],"category_scores_gemma":[0.01042493,0.0002880248,0.0004793475,0.002063462,0.0006161571,0.002862647,0.001836339,0.00275741,0.2813116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001788252,"about_ca_system_score_gemma":0.001955812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003205684,"about_ca_topic_score_gemma":0.004905536,"domain_scores_codex":[0.9992635,0.0001095841,0.00005334728,0.000137034,0.0003752543,0.00006130059],"domain_scores_gemma":[0.9950305,0.0008053357,0.0001683434,0.0004839552,0.002810434,0.0007014811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002164284,0.00001810817,0.00008056949,0.00007914144,0.000001701408,0.00002561266,0.00005714845,0.00005128835,0.00009557293,0.007250155,0.9486873,0.04363184],"study_design_scores_gemma":[0.000003165925,0.000007801908,0.0001948845,0.00009151769,0.000001322485,0.0000323785,0.00004604481,0.0000258403,0.00006605579,0.003606654,0.9959205,0.000003749914],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001454894,0.016573,0.009880509,0.04412728,0.2389404,0.0004752295,0.01188839,0.001636776,0.6750237],"genre_scores_gemma":[0.005695743,0.005865245,0.003131681,0.006587413,0.02640845,0.0002044206,0.006757542,0.000774596,0.944575],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5743852,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2793721708","doi":"10.1016/j.jlamp.2018.02.002","title":"A theoretical framework for cardinality-based feature models: The semantics and computational aspects","year":2018,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"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":"Cardinality (data modeling); Computer science; Feature (linguistics); Semantics (computer science); Formal semantics (linguistics); Theoretical computer science; Programming language; Decidability; Software product line; Operational semantics; Denotational semantics; Computational semantics; Algorithm; Software; Software development; Data mining; Linguistics","authors":[{"name":"Aliakbar Safilian","is_ca":true},{"name":"Tom Maibaum","is_ca":true},{"name":"Zinovy Diskin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07762526643835502,"gpt":0.3969860829597516,"spread":0.3193608165213966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005615732,0.001102825,0.001195911,0.003474374,0.002970417,0.008067686,0.004940129,0.00378554,0.009810743],"category_scores_gemma":[0.01269623,0.001107974,0.003472123,0.003648711,0.01150676,0.02368922,0.005106963,0.005634856,0.001101688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003360329,"about_ca_system_score_gemma":0.002367559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00308175,"about_ca_topic_score_gemma":0.002970692,"domain_scores_codex":[0.9956891,0.001510094,0.00037829,0.0009026304,0.001134355,0.0003855098],"domain_scores_gemma":[0.9912816,0.004396118,0.0008402689,0.00182876,0.001146906,0.000506215],"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.000002701942,0.000006071079,0.00004514955,0.00001062035,0.000003239354,0.0000170193,0.00005395676,0.0007480613,0.00006563353,0.9980528,0.0001712503,0.0008234818],"study_design_scores_gemma":[0.000008394659,0.000007531126,0.00004042268,0.00001699055,0.00001018095,0.00005911849,0.00006697674,0.01099853,0.0001309346,0.9862019,0.002449978,0.00000897598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01026148,0.0003796212,0.9650638,0.003733797,0.0001125174,0.00008764074,0.0002532604,0.0002266193,0.01988118],"genre_scores_gemma":[0.5672851,0.0009282561,0.4201906,0.001008659,0.0006665895,0.0005715663,0.000660182,0.000217831,0.00847121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009810743,"threshold_uncertainty_score":0.03282022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2334804121","doi":"10.1016/j.jlamp.2016.02.005","title":"Logic programming approach to automata-based decision procedures","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Datalog; Successor cardinal; Computer science; Logic programming; Horn clause; Automaton; Decision problem; Programming language; Inductive logic programming; Focus (optics); Theoretical computer science; Mathematics","authors":[{"name":"Gülay Ünel","is_ca":false},{"name":"David Toman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06277961365753304,"gpt":0.3824389205900534,"spread":0.3196593069325204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002983535,0.0008039384,0.000828993,0.00165602,0.001063666,0.004322475,0.0029913,0.001577829,0.0113791],"category_scores_gemma":[0.009311996,0.0007291603,0.002373795,0.001129986,0.003582591,0.004767345,0.002119069,0.003906673,0.001676371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001853151,"about_ca_system_score_gemma":0.002461906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002535427,"about_ca_topic_score_gemma":0.002617873,"domain_scores_codex":[0.996446,0.001468642,0.0002954132,0.0005253179,0.0009948814,0.0002698611],"domain_scores_gemma":[0.9930219,0.005371356,0.0002241265,0.0004945034,0.0007298453,0.000158389],"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.00003902214,0.00006409956,0.0001318513,0.00008469611,0.00003028291,0.000078637,0.0001527745,0.02720427,0.000952477,0.9521734,0.0006918744,0.01839645],"study_design_scores_gemma":[0.00003879634,0.00003496854,0.00003661384,0.00003824147,0.00004690169,0.00005062193,0.00004353536,0.1972461,0.002030687,0.7956509,0.004763283,0.00001928406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002311855,0.00006201171,0.9916165,0.0002634202,0.00003924917,0.00005691246,0.00005573593,0.0002657976,0.00532854],"genre_scores_gemma":[0.2419901,0.0002826912,0.7470233,0.0004893837,0.0001593257,0.000384857,0.0002196699,0.0001724007,0.009278351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0113791,"threshold_uncertainty_score":0.03806686,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079634072","doi":"10.1016/j.jlap.2014.02.015","title":"Gunther Schmidt's life as a mathematician and computer scientist","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"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":"Period (music); Art history; Philosophy; Epistemology; History; Aesthetics","authors":[{"name":"Rudolf Berghammer","is_ca":false},{"name":"Michael Winter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02887920734177913,"gpt":0.3494686280760919,"spread":0.3205894207343127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002531801,0.0008044213,0.0007457635,0.001570701,0.003037247,0.003691209,0.0007013214,0.002326001,0.005552381],"category_scores_gemma":[0.01282015,0.0003776543,0.0003493252,0.001085973,0.01114045,0.006389632,0.0039988,0.009005917,0.002978764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002804788,"about_ca_system_score_gemma":0.00366049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002302733,"about_ca_topic_score_gemma":0.002072702,"domain_scores_codex":[0.9971641,0.0008450461,0.0001280483,0.00041576,0.001184831,0.0002622691],"domain_scores_gemma":[0.9954657,0.001757367,0.0002194049,0.0003508165,0.001235451,0.0009712281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004737052,0.00001900966,0.00012206,0.00008170401,0.00001691109,0.0001029411,0.0007466988,0.0003196076,0.0003096682,0.6776538,0.2947306,0.02584961],"study_design_scores_gemma":[0.00001639349,0.00002236625,0.0001415225,0.0001327307,0.00001039723,0.0002861851,0.0002749134,0.0005035906,0.0005774843,0.4602097,0.5377783,0.00004644314],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"other","genre_scores_codex":[0.005532676,0.04179068,0.03006675,0.7607765,0.05021667,0.00002856998,0.000291774,0.0003562959,0.1109401],"genre_scores_gemma":[0.339518,0.06750727,0.04271875,0.1807678,0.03729328,0.0001514466,0.0003119394,0.0009160215,0.3308156],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.005552381,"threshold_uncertainty_score":0.02035022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001814250","doi":"10.1016/j.jlamp.2020.100525","title":"Preface to the special issue on the 11th International Conference on Graph Transformation","year":2020,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Graph rewriting; Computer science; Clique-width; Wait-for graph; Theoretical computer science; Graph; Voltage graph; Graph property; Null graph; Line graph","authors":[{"name":"Leen Lambers","is_ca":false},{"name":"Jens Weber","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08747451457374354,"gpt":0.3570788104032485,"spread":0.2696042958295049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042467,0.001734775,0.001888946,0.003390808,0.001830559,0.004933262,0.001713598,0.00230667,0.1735336],"category_scores_gemma":[0.006895664,0.0005303811,0.001589095,0.002456435,0.0007176159,0.004399146,0.002464506,0.005205362,0.07654324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001943907,"about_ca_system_score_gemma":0.001889076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002111951,"about_ca_topic_score_gemma":0.003614059,"domain_scores_codex":[0.9986437,0.0002302449,0.0001012999,0.0002600159,0.000628361,0.0001364268],"domain_scores_gemma":[0.9939188,0.001209134,0.0002122431,0.0004758638,0.00299991,0.001184043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002003624,0.00001883308,0.00002334245,0.00006903659,0.00000456084,0.0000191627,0.000007827276,0.00007311882,0.0001589322,0.0008418601,0.9822236,0.01653975],"study_design_scores_gemma":[0.00001756514,0.00004273455,0.0002836869,0.0001383186,0.00001636875,0.00008506881,0.00002739718,0.0005078192,0.0002718129,0.003539244,0.9950553,0.00001452008],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0004184798,0.01112068,0.009078053,0.02958615,0.9070391,0.0001557208,0.0007769214,0.0006497729,0.04117515],"genre_scores_gemma":[0.005710721,0.01751505,0.007732185,0.01394194,0.5416051,0.0002533606,0.004384344,0.002657201,0.4062002],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1735336,"threshold_uncertainty_score":0.5805275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066238078","doi":"10.1016/j.jlap.2014.02.011","title":"Relational properties of sequential composition of coalgebras","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in 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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Composition (language); Bisimulation; Dedekind cut; Mathematics; Algebraic number; Process (computing); Algebra over a field; Process calculus; Iterative and incremental development; Computer science; Pure mathematics; Theoretical computer science; Discrete mathematics; Programming language; Mathematical analysis","authors":[{"name":"Michael Winter","is_ca":true},{"name":"Peter Kempf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0893667256257699,"gpt":0.3298400920710254,"spread":0.2404733664452555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003804156,0.0003993016,0.0007396886,0.001626925,0.001909312,0.004424432,0.001087988,0.0007527557,0.00652769],"category_scores_gemma":[0.01141855,0.0008944984,0.001545581,0.001455988,0.003326318,0.007658674,0.00180127,0.001356655,0.0006944702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001012569,"about_ca_system_score_gemma":0.001305002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001727062,"about_ca_topic_score_gemma":0.001613981,"domain_scores_codex":[0.9964783,0.0007688596,0.0004875689,0.0008116718,0.001105647,0.0003480568],"domain_scores_gemma":[0.9871767,0.006949753,0.00144558,0.00194619,0.001918374,0.0005633808],"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.0002583598,0.00009268925,0.003373848,0.0001075771,0.00006799428,0.0004604876,0.001216399,0.004071592,0.007939874,0.9656937,0.0005241822,0.01619329],"study_design_scores_gemma":[0.00005786784,0.0001041694,0.001639996,0.00003078621,0.0001373935,0.000559248,0.0003550643,0.02209325,0.01359972,0.9558355,0.005548266,0.00003887724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3483467,0.0005574831,0.6271674,0.000459018,0.0001503063,0.0001856591,0.000541592,0.000900573,0.02169129],"genre_scores_gemma":[0.9161264,0.0002389073,0.07643257,0.0001171372,0.0001628913,0.000125612,0.0005869589,0.0002217839,0.005987651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00652769,"threshold_uncertainty_score":0.02183729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2893802702","doi":"10.1016/j.jlamp.2018.09.004","title":"Cryptomorphic topological structures: A computational, relation-algebraic approach","year":2018,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","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":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relation (database); Closure (psychology); Topology (electrical circuits); Mathematics; Closed set; Algebraic number; Topological space; Algebraic topology; Irreducible component; Set (abstract data type); Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Combinatorics; Homotopy; Data mining","authors":[{"name":"Rudolf Berghammer","is_ca":false},{"name":"G. Schmidt","is_ca":false},{"name":"Michael Winter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05015518455874311,"gpt":0.3599268618012973,"spread":0.3097716772425542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387469,0.000608822,0.000948587,0.003293873,0.00210111,0.007969656,0.002230522,0.001504859,0.00811464],"category_scores_gemma":[0.008339327,0.0004509838,0.001175736,0.002732576,0.007424527,0.01604125,0.003560027,0.003039176,0.0007927524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0019387,"about_ca_system_score_gemma":0.001129672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009847056,"about_ca_topic_score_gemma":0.001040881,"domain_scores_codex":[0.998957,0.0004104513,0.00008841848,0.0001695291,0.0002825716,0.00009198872],"domain_scores_gemma":[0.9961458,0.00207326,0.0003874865,0.0007528781,0.0004324077,0.0002081582],"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.000004867533,0.000005965567,0.00005633021,0.00001336046,0.000001906914,0.00001951575,0.00005630395,0.0009024131,0.00005255117,0.9968772,0.0002075025,0.001802188],"study_design_scores_gemma":[0.00000537963,0.000006765351,0.00003143675,0.000008324033,0.00000366252,0.00005039067,0.00007973117,0.01000595,0.00009714,0.9878802,0.00182582,0.000005209453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07829195,0.001452767,0.840041,0.006881565,0.0002845453,0.0001438032,0.0004142649,0.0002500767,0.07224002],"genre_scores_gemma":[0.764312,0.001630814,0.2173748,0.0004316983,0.0005112631,0.000157042,0.0004231323,0.00009157565,0.01506776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00811464,"threshold_uncertainty_score":0.02714616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}