{"meta":{"query_hash":"078f92b992ac","filters":{"venue":"Journal of Logical and Algebraic Methods in Programming"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/078f92b992ac","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06523853055516791,"score_gpt":0.37848797629667275,"score_spread":0.3132494457415048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968226057","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071707885,0.083286636,0.8045093,0.025024084,0.004421042,0.00010038618,0.00036938238,0.0005311786,0.074587114],"genre_scores_gemma":[0.28525966,0.067999475,0.5963473,0.0042442814,0.012612215,0.0005645092,0.0006758385,0.00040822968,0.031888414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942842,0.0026087943,0.0006089384,0.0006423815,0.0016796539,0.00017590933],"domain_scores_gemma":[0.98400253,0.01178405,0.00051362807,0.0019248136,0.0014398134,0.00033509848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007471891,0.000938281,0.0014989768,0.0033647746,0.002081023,0.008437741,0.0018821321,0.001903619,0.010462212],"category_scores_gemma":[0.01883166,0.0007171083,0.0012930182,0.004135635,0.010155838,0.017115092,0.0032834026,0.006468642,0.0018123826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049797136,0.000011655889,0.00009522404,0.000088506175,0.000010933145,0.000014913853,0.00014290705,0.0002565071,0.000050358893,0.9860941,0.0025187468,0.010711229],"study_design_scores_gemma":[0.000009645869,0.000006228363,0.00006768427,0.00005297139,0.0000094871975,0.000041117473,0.000061976854,0.0016678794,0.00007365425,0.975206,0.022795508,0.000007773591],"about_ca_topic_score_codex":0.0023591106,"about_ca_topic_score_gemma":0.0017452161,"teacher_disagreement_score":0.010462212,"about_ca_system_score_codex":0.0025288549,"about_ca_system_score_gemma":0.0029218325,"threshold_uncertainty_score":0.039515615},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03290005820379674,"score_gpt":0.34062278974519333,"score_spread":0.3077227315413966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982958309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2445962,0.0016622647,0.5652032,0.0057312343,0.0008117607,0.00022656092,0.0010247657,0.00033592377,0.18040815],"genre_scores_gemma":[0.8709585,0.00066575495,0.084974654,0.000850195,0.0005936028,0.00019127024,0.00062974973,0.00012326628,0.04101308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983317,0.00042055384,0.00013541023,0.00031681434,0.0005075006,0.00028804326],"domain_scores_gemma":[0.99765766,0.0009872467,0.00022004706,0.00020314958,0.00042311757,0.0005087133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127945,0.00064971554,0.00093606295,0.002203545,0.0032771057,0.005811746,0.0014287274,0.0011463746,0.010666662],"category_scores_gemma":[0.003931146,0.0007947239,0.0017232759,0.0019682054,0.0042203106,0.008446733,0.0033305176,0.005440743,0.00094850064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010986957,0.000014038467,0.000039121795,0.000009029449,0.000003665759,0.00001864213,0.000067164074,0.00011279307,0.00012513876,0.9985769,0.00021006264,0.0008124324],"study_design_scores_gemma":[0.000015764854,0.000005936079,0.000037790374,0.000005225339,0.0000056218178,0.000047730617,0.000055076933,0.0015949013,0.00022075001,0.99652547,0.0014782738,0.000007357],"about_ca_topic_score_codex":0.0011808284,"about_ca_topic_score_gemma":0.0013865444,"teacher_disagreement_score":0.010666662,"about_ca_system_score_codex":0.0022819955,"about_ca_system_score_gemma":0.0012584943,"threshold_uncertainty_score":0.035683572},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.037487657934810154,"score_gpt":0.3395141873912903,"score_spread":0.3020265294564801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991997530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009589882,0.000022057104,0.9835133,0.00007978226,0.00003966634,0.000040761344,0.000026333168,0.0030049684,0.0036832253],"genre_scores_gemma":[0.20369807,0.000080947386,0.7874438,0.0001594959,0.000021357233,0.00011493976,0.00022891157,0.0025676177,0.005684814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924135,0.00015219557,0.000030288944,0.00014234487,0.00035515786,0.00007864825],"domain_scores_gemma":[0.99899036,0.0002702629,0.00006284631,0.00045605673,0.00018522203,0.000035194666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043575352,0.0005496269,0.00042935784,0.0007184993,0.0005144765,0.00081876444,0.0011719251,0.0007986272,0.0049987375],"category_scores_gemma":[0.0022861538,0.000449855,0.0012072559,0.00045635505,0.0015881909,0.0014126047,0.0020701855,0.0014910131,0.0012605086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010677116,0.00016549157,0.0007144731,0.0002699939,0.000062752624,0.00036125004,0.0006455102,0.09519735,0.06698109,0.6187397,0.0063821925,0.21037337],"study_design_scores_gemma":[0.000035516172,0.00008657341,0.00026239947,0.000058077865,0.000052141055,0.00024529858,0.00011044432,0.55613345,0.06221371,0.3387906,0.041969832,0.00004190251],"about_ca_topic_score_codex":0.0013036919,"about_ca_topic_score_gemma":0.0019439851,"teacher_disagreement_score":0.0049987375,"about_ca_system_score_codex":0.00040749408,"about_ca_system_score_gemma":0.000660955,"threshold_uncertainty_score":0.01672244},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Countable set; Computability; Mathematics; Disjoint sets; Computation; Disjoint union (topology); Domain (mathematical analysis); Discrete mathematics; Sequence (biology); Algorithm; Mathematical analysis","score_opus":0.10855918832622603,"score_gpt":0.37975196510477655,"score_spread":0.2711927767785505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996431919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0682742,0.003060518,0.82611465,0.0059654475,0.000287544,0.00010703661,0.00067923125,0.00057936553,0.09493206],"genre_scores_gemma":[0.86960524,0.001635678,0.103080705,0.00050341885,0.0004339152,0.00026352244,0.0006494319,0.00017319729,0.023654943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982476,0.000731389,0.000119305376,0.00028999848,0.00039824247,0.00021331942],"domain_scores_gemma":[0.9969548,0.0018129429,0.00018879223,0.00058039656,0.00026884527,0.00019417568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021713618,0.0011828904,0.0012009494,0.0014974574,0.0017580062,0.009034967,0.0020665133,0.002097074,0.0075613153],"category_scores_gemma":[0.005847432,0.0008210208,0.0022697968,0.001828022,0.0061699334,0.014286769,0.002433105,0.0035455702,0.00090600486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006165645,0.000003907002,0.000034576096,0.000009262627,0.0000032486023,0.0000116024685,0.00006256923,0.0014388987,0.000047125348,0.99759346,0.00018921247,0.00059991836],"study_design_scores_gemma":[0.000008064102,0.0000045905736,0.000022297063,0.000007773564,0.00000415199,0.000015168533,0.000032578268,0.009419898,0.000048411108,0.98899674,0.0014355924,0.000004755638],"about_ca_topic_score_codex":0.0028453805,"about_ca_topic_score_gemma":0.0029573052,"teacher_disagreement_score":0.009034967,"about_ca_system_score_codex":0.002901735,"about_ca_system_score_gemma":0.0013048551,"threshold_uncertainty_score":0.025295138},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.03507238830327356,"score_gpt":0.3478299379551908,"score_spread":0.3127575496519172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014332513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5224635,0.0014447548,0.41994062,0.002091736,0.00036224874,0.00016483001,0.0010491922,0.0008087508,0.051674366],"genre_scores_gemma":[0.95144606,0.00031654397,0.03910205,0.00028316726,0.00030861876,0.00013080447,0.00081967015,0.00014525787,0.0074478462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630094,0.0006289037,0.00045176788,0.0007653118,0.0013744985,0.00047846793],"domain_scores_gemma":[0.97598594,0.015382781,0.0023736537,0.0026220572,0.0023870585,0.0012484113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027928315,0.0005731557,0.001063052,0.004384018,0.0031034462,0.0083555775,0.0024412817,0.0015869976,0.0084252665],"category_scores_gemma":[0.017614642,0.0009501803,0.0015800152,0.0033105812,0.005386723,0.012463174,0.0043507502,0.0031356865,0.0007476478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005945893,0.00002588273,0.000693323,0.000044845845,0.000009374962,0.00011871135,0.00067393377,0.0006034769,0.000792472,0.9927527,0.00037081083,0.003855021],"study_design_scores_gemma":[0.000016290323,0.000026033746,0.0003990627,0.000029232086,0.000012291257,0.00020590334,0.00033457973,0.0057009947,0.0015246667,0.988545,0.0031806298,0.000025399459],"about_ca_topic_score_codex":0.00065621396,"about_ca_topic_score_gemma":0.0006200718,"teacher_disagreement_score":0.0084252665,"about_ca_system_score_codex":0.0021856376,"about_ca_system_score_gemma":0.0012818804,"threshold_uncertainty_score":0.028185308},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.048905873530747115,"score_gpt":0.3410464175587398,"score_spread":0.2921405440279927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032028343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078983806,0.0022221461,0.8066866,0.004285636,0.00046157878,0.00012111876,0.00062540435,0.00081131444,0.10580245],"genre_scores_gemma":[0.8027222,0.0017531381,0.166272,0.0012827995,0.001016151,0.0002159674,0.0006120002,0.00034596943,0.02577975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982646,0.0005711293,0.00016612443,0.00034473083,0.00050212524,0.00015135614],"domain_scores_gemma":[0.99718934,0.0015373715,0.00021997587,0.00044959507,0.00042268267,0.00018109361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466176,0.00056503405,0.00071732636,0.0019322231,0.0021046004,0.005071356,0.0015628166,0.0011376321,0.00710369],"category_scores_gemma":[0.0060196687,0.0008651856,0.0013259774,0.0022912933,0.0070359237,0.014114761,0.0027270203,0.004118082,0.0010041173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004255874,0.0000069855428,0.00007043061,0.000009086785,0.0000021599749,0.000010847398,0.00018942398,0.00010308542,0.00007263459,0.99769294,0.00023713433,0.0016010423],"study_design_scores_gemma":[0.0000062698955,0.0000050185336,0.000056200006,0.0000058981504,0.0000054951643,0.000023968767,0.00005252634,0.00090966816,0.00014579424,0.9962656,0.0025186318,0.000004927261],"about_ca_topic_score_codex":0.0020908825,"about_ca_topic_score_gemma":0.0016227955,"teacher_disagreement_score":0.00710369,"about_ca_system_score_codex":0.0014587715,"about_ca_system_score_gemma":0.0008540672,"threshold_uncertainty_score":0.023764193},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0893667256257699,"score_gpt":0.32984009207102544,"score_spread":0.24047336644525552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066238078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34834665,0.0005574831,0.6271674,0.00045901805,0.00015030634,0.00018565914,0.00054159196,0.000900573,0.021691294],"genre_scores_gemma":[0.91612643,0.0002389073,0.07643257,0.00011713724,0.00016289127,0.00012561203,0.0005869589,0.00022178388,0.0059876507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647826,0.0007688596,0.00048756888,0.00081167184,0.0011056467,0.00034805684],"domain_scores_gemma":[0.9871767,0.006949753,0.0014455797,0.0019461901,0.001918374,0.00056338083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003804156,0.0003993016,0.0007396886,0.0016269246,0.0019093116,0.004424432,0.0010879879,0.00075275573,0.0065276898],"category_scores_gemma":[0.011418549,0.00089449843,0.001545581,0.0014559882,0.0033263175,0.007658674,0.0018012697,0.001356655,0.00069447025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002583598,0.000092689246,0.0033738478,0.0001075771,0.00006799428,0.00046048762,0.0012163994,0.004071592,0.007939874,0.96569365,0.00052418216,0.016193287],"study_design_scores_gemma":[0.000057867837,0.00010416936,0.0016399963,0.00003078621,0.00013739345,0.000559248,0.00035506426,0.022093246,0.013599723,0.95583546,0.0055482658,0.000038877242],"about_ca_topic_score_codex":0.0017270624,"about_ca_topic_score_gemma":0.0016139807,"teacher_disagreement_score":0.0065276898,"about_ca_system_score_codex":0.0010125687,"about_ca_system_score_gemma":0.0013050025,"threshold_uncertainty_score":0.021837294},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Period (music); Art history; Philosophy; Epistemology; History; Aesthetics","score_opus":0.028879207341779133,"score_gpt":0.34946862807609186,"score_spread":0.32058942073431274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079634072","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005532676,0.041790675,0.03006675,0.76077646,0.050216675,0.00002856998,0.00029177405,0.0003562959,0.110940054],"genre_scores_gemma":[0.33951798,0.06750727,0.042718753,0.18076782,0.037293278,0.00015144664,0.00031193942,0.0009160215,0.33081555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971641,0.0008450461,0.00012804827,0.00041576003,0.0011848308,0.00026226908],"domain_scores_gemma":[0.9954657,0.0017573667,0.00021940494,0.00035081647,0.0012354512,0.00097122806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025318014,0.00080442126,0.0007457635,0.0015707009,0.0030372473,0.0036912095,0.0007013214,0.0023260012,0.005552381],"category_scores_gemma":[0.012820152,0.0003776543,0.0003493252,0.0010859728,0.011140446,0.006389632,0.0039988,0.009005917,0.0029787645],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004737052,0.000019009663,0.000122060046,0.000081704005,0.000016911092,0.00010294114,0.0007466988,0.00031960756,0.00030966822,0.67765385,0.2947306,0.02584961],"study_design_scores_gemma":[0.000016393487,0.00002236625,0.00014152253,0.00013273073,0.000010397226,0.00028618507,0.0002749134,0.0005035906,0.0005774843,0.46020967,0.53777826,0.00004644314],"about_ca_topic_score_codex":0.0023027326,"about_ca_topic_score_gemma":0.0020727017,"teacher_disagreement_score":0.005552381,"about_ca_system_score_codex":0.0028047878,"about_ca_system_score_gemma":0.00366049,"threshold_uncertainty_score":0.020350218},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09725424835872291,"score_gpt":0.38404041817857465,"score_spread":0.2867861698198517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218924106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058699053,0.00044879515,0.92810506,0.00025973946,0.000068276146,0.00008359626,0.00004656988,0.00022690296,0.012062069],"genre_scores_gemma":[0.7245636,0.0012556617,0.26125136,0.00013424472,0.00012325804,0.00011058614,0.0002790729,0.0002838239,0.011998364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839574,0.0004739137,0.00011862619,0.000328682,0.00049366243,0.00018926102],"domain_scores_gemma":[0.99795026,0.00088447,0.00016866953,0.0005082519,0.0003449529,0.00014332187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020323987,0.00042170292,0.00063200557,0.0012032647,0.0020243553,0.002303552,0.0010593972,0.0007431074,0.0039492934],"category_scores_gemma":[0.005623907,0.0005434629,0.002007198,0.001650695,0.0024627645,0.0060578603,0.002224463,0.0019609989,0.0005330642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056067507,0.00003489741,0.0008616685,0.000048021157,0.0000261454,0.00029760355,0.00082711224,0.0071997433,0.0025459046,0.96025896,0.0004921793,0.027351653],"study_design_scores_gemma":[0.000016604377,0.000050874616,0.00043967617,0.000037051414,0.000054512864,0.00029429467,0.0002130188,0.084083356,0.0034209115,0.90218157,0.009171039,0.000037060916],"about_ca_topic_score_codex":0.004555668,"about_ca_topic_score_gemma":0.0023065172,"teacher_disagreement_score":0.004555668,"about_ca_system_score_codex":0.0007122193,"about_ca_system_score_gemma":0.000956683,"threshold_uncertainty_score":0.013211668},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.13628566378259063,"score_gpt":0.3716287206328223,"score_spread":0.23534305685023169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279569925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046751175,0.0023830084,0.93143696,0.0029946086,0.00020073536,0.0000812151,0.00087134447,0.0005906972,0.014690211],"genre_scores_gemma":[0.7265599,0.004315971,0.24919118,0.0008332396,0.0006217746,0.00032363483,0.002157795,0.00039687037,0.015599613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567586,0.0017391003,0.00050098076,0.0006321028,0.0011675077,0.00028442687],"domain_scores_gemma":[0.9869131,0.00856614,0.00095418765,0.0020251973,0.0010687525,0.00047269737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039020237,0.0007244001,0.0009812869,0.002252457,0.0016881364,0.0051221102,0.0021027795,0.0015487131,0.004866988],"category_scores_gemma":[0.018777436,0.0014281472,0.0015299713,0.0032709995,0.0026592722,0.014718196,0.0033227482,0.0032324076,0.00083249935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027450345,0.00002473373,0.0006066379,0.000064376516,0.00001942204,0.000100493104,0.0003326683,0.009076589,0.00022023205,0.9793107,0.0013789316,0.008837704],"study_design_scores_gemma":[0.000008519729,0.000009071904,0.00008811589,0.000021937047,0.000023497605,0.00005315992,0.000059115413,0.03286756,0.00020025912,0.9624515,0.0042072497,0.0000099928175],"about_ca_topic_score_codex":0.0048390813,"about_ca_topic_score_gemma":0.0042302413,"teacher_disagreement_score":0.0051221102,"about_ca_system_score_codex":0.0017885937,"about_ca_system_score_gemma":0.0019398835,"threshold_uncertainty_score":0.020636082},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06277961365753304,"score_gpt":0.3824389205900534,"score_spread":0.31965930693252037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334804121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023118553,0.000062011706,0.99161655,0.0002634202,0.000039249175,0.000056912464,0.000055735934,0.0002657976,0.0053285398],"genre_scores_gemma":[0.24199006,0.00028269115,0.7470233,0.0004893837,0.00015932572,0.00038485703,0.00021966995,0.0001724007,0.009278351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644595,0.0014686423,0.00029541316,0.0005253179,0.0009948814,0.0002698611],"domain_scores_gemma":[0.9930219,0.0053713564,0.00022412646,0.0004945034,0.00072984525,0.000158389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029835352,0.0008039384,0.000828993,0.0016560197,0.0010636658,0.0043224753,0.0029912998,0.0015778294,0.011379098],"category_scores_gemma":[0.009311996,0.0007291603,0.0023737948,0.0011299864,0.003582591,0.004767345,0.0021190695,0.003906673,0.001676371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039022143,0.000064099564,0.0001318513,0.00008469611,0.000030282907,0.000078637,0.00015277452,0.027204268,0.00095247704,0.9521734,0.00069187436,0.018396452],"study_design_scores_gemma":[0.00003879634,0.00003496854,0.000036613845,0.000038241473,0.00004690169,0.000050621926,0.000043535365,0.19724612,0.0020306874,0.7956509,0.0047632833,0.000019284058],"about_ca_topic_score_codex":0.0025354275,"about_ca_topic_score_gemma":0.0026178728,"teacher_disagreement_score":0.011379098,"about_ca_system_score_codex":0.0018531511,"about_ca_system_score_gemma":0.0024619058,"threshold_uncertainty_score":0.038066864},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10147900924795987,"score_gpt":0.3946221533810154,"score_spread":0.29314314413305553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396862742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036021132,0.00021994801,0.95013845,0.0008383026,0.00013614191,0.00029944498,0.0011230252,0.0068392637,0.00438426],"genre_scores_gemma":[0.43677744,0.0001826344,0.55591834,0.00055837433,0.00012429844,0.0004222338,0.0019909404,0.0011733415,0.0028523528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867049,0.0040069236,0.0014870754,0.0015040229,0.005023659,0.0012733649],"domain_scores_gemma":[0.93562657,0.04605351,0.003575815,0.0076054144,0.005723243,0.0014155178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077113677,0.00143094,0.0012796627,0.0019276034,0.00092943455,0.004074116,0.0057687485,0.0023130598,0.006144099],"category_scores_gemma":[0.046138108,0.001483851,0.002110026,0.001533087,0.0031379964,0.008826293,0.004550261,0.004004884,0.0010191931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010588906,0.0013463253,0.014221644,0.0011698037,0.0003430894,0.0019752716,0.0012129709,0.28880075,0.028685544,0.4019953,0.017731491,0.24145898],"study_design_scores_gemma":[0.00018510532,0.00021969792,0.0009945306,0.00017263868,0.00011181899,0.00037434316,0.00033686208,0.68939644,0.02310122,0.27618068,0.008835131,0.00009159585],"about_ca_topic_score_codex":0.0053979424,"about_ca_topic_score_gemma":0.008609754,"teacher_disagreement_score":0.0077113677,"about_ca_system_score_codex":0.0017135263,"about_ca_system_score_gemma":0.003753452,"threshold_uncertainty_score":0.040782094},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05562391857438079,"score_gpt":0.36529623917404525,"score_spread":0.30967232059966443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573726090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007142209,0.000105650724,0.9895935,0.00014305316,0.000019926978,0.00004710236,0.00009555149,0.00086534297,0.0019876768],"genre_scores_gemma":[0.10815976,0.00021230207,0.88933367,0.00006602155,0.00003798823,0.000166375,0.0004120278,0.00025995125,0.0013519016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972149,0.0011629821,0.00022361455,0.0005968101,0.0005986638,0.00020295044],"domain_scores_gemma":[0.99570626,0.003159223,0.00013306063,0.00068816706,0.00018192401,0.00013139636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002974041,0.0008808857,0.0017925764,0.0012282904,0.0013822563,0.0037633574,0.003308219,0.0010785434,0.008045093],"category_scores_gemma":[0.00848471,0.0010732495,0.0039882776,0.0016186929,0.00261036,0.010817867,0.0049027926,0.0032520446,0.001262817],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002629775,0.00026790838,0.0010149404,0.0007223607,0.0002453802,0.00030038558,0.00094112835,0.093829855,0.00373416,0.67988,0.0045413203,0.21425949],"study_design_scores_gemma":[0.000058601985,0.000044458237,0.00012291854,0.000053880627,0.000049917377,0.00010612907,0.00019283252,0.27868286,0.0023063025,0.71170616,0.0066471132,0.000028803004],"about_ca_topic_score_codex":0.0023408807,"about_ca_topic_score_gemma":0.00578361,"teacher_disagreement_score":0.008045093,"about_ca_system_score_codex":0.0008036033,"about_ca_system_score_gemma":0.0017173681,"threshold_uncertainty_score":0.026913583},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04241309915636295,"score_gpt":0.3617428168297641,"score_spread":0.3193297176734012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790776996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027887003,0.00035224916,0.9501442,0.0013772823,0.00021388844,0.00015153587,0.00013863698,0.0017264673,0.01800883],"genre_scores_gemma":[0.66858506,0.0005125698,0.3120881,0.00088035874,0.00053856504,0.00041329325,0.0004808613,0.0041794274,0.012321661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9664885,0.01553654,0.0023000375,0.0037776572,0.008684793,0.0032125171],"domain_scores_gemma":[0.83839816,0.104621135,0.005876531,0.03017394,0.016690271,0.004239916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031639207,0.0013619751,0.003651064,0.003586476,0.004091544,0.010647235,0.005477815,0.0040732953,0.007838114],"category_scores_gemma":[0.13082242,0.0022804737,0.0035763716,0.0026813187,0.016646007,0.030384673,0.019065518,0.012665235,0.0017008674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035247748,0.00011457179,0.0027075498,0.00015180642,0.00003982923,0.00021209636,0.0019827888,0.009161662,0.0008670188,0.955832,0.0024307994,0.026147367],"study_design_scores_gemma":[0.00005575406,0.000042795684,0.0002306195,0.00008036873,0.000059423743,0.00011838069,0.00030598335,0.059347752,0.0016952015,0.9350978,0.0029170918,0.00004884531],"about_ca_topic_score_codex":0.003041575,"about_ca_topic_score_gemma":0.0023595204,"teacher_disagreement_score":0.031639207,"about_ca_system_score_codex":0.0029447817,"about_ca_system_score_gemma":0.00537542,"threshold_uncertainty_score":0.1673261},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07762526643835502,"score_gpt":0.39698608295975163,"score_spread":0.3193608165213966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793721708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010261481,0.00037962123,0.9650638,0.0037337968,0.000112517366,0.000087640736,0.00025326043,0.00022661928,0.019881181],"genre_scores_gemma":[0.56728506,0.00092825614,0.42019057,0.0010086586,0.0006665895,0.0005715663,0.000660182,0.00021783097,0.0084712105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956891,0.0015100943,0.00037828996,0.00090263045,0.0011343553,0.00038550977],"domain_scores_gemma":[0.9912816,0.0043961178,0.0008402689,0.0018287598,0.0011469058,0.000506215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056157317,0.0011028254,0.0011959113,0.0034743738,0.002970417,0.008067686,0.0049401294,0.0037855403,0.009810743],"category_scores_gemma":[0.012696226,0.0011079736,0.0034721226,0.003648711,0.011506761,0.023689218,0.0051069628,0.005634856,0.0011016882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002701942,0.0000060710795,0.00004514955,0.00001062035,0.0000032393543,0.000017019296,0.00005395676,0.00074806134,0.00006563353,0.99805284,0.00017125034,0.0008234818],"study_design_scores_gemma":[0.000008394659,0.0000075311264,0.00004042268,0.000016990554,0.000010180949,0.00005911849,0.00006697674,0.01099853,0.00013093464,0.98620194,0.0024499784,0.00000897598],"about_ca_topic_score_codex":0.0030817504,"about_ca_topic_score_gemma":0.0029706922,"teacher_disagreement_score":0.009810743,"about_ca_system_score_codex":0.0033603294,"about_ca_system_score_gemma":0.0023675594,"threshold_uncertainty_score":0.032820225},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.050155184558743106,"score_gpt":0.3599268618012973,"score_spread":0.30977167724255417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893802702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078291945,0.001452767,0.84004104,0.0068815653,0.0002845453,0.00014380322,0.00041426488,0.00025007673,0.07224002],"genre_scores_gemma":[0.76431197,0.001630814,0.21737476,0.00043169825,0.0005112631,0.00015704197,0.0004231323,0.000091575654,0.015067761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895704,0.0004104513,0.00008841848,0.00016952911,0.00028257156,0.000091988724],"domain_scores_gemma":[0.99614584,0.00207326,0.0003874865,0.0007528781,0.0004324077,0.00020815819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013874691,0.000608822,0.00094858697,0.003293873,0.0021011103,0.007969656,0.0022305215,0.0015048591,0.00811464],"category_scores_gemma":[0.008339327,0.00045098382,0.0011757363,0.0027325763,0.0074245273,0.016041245,0.0035600269,0.0030391756,0.0007927524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004867533,0.000005965567,0.000056330213,0.000013360459,0.0000019069137,0.000019515754,0.00005630395,0.0009024131,0.000052551168,0.9968772,0.00020750245,0.0018021878],"study_design_scores_gemma":[0.00000537963,0.0000067653514,0.000031436746,0.000008324033,0.0000036625202,0.000050390667,0.00007973117,0.010005949,0.00009714,0.9878802,0.0018258203,0.0000052094533],"about_ca_topic_score_codex":0.0009847056,"about_ca_topic_score_gemma":0.001040881,"teacher_disagreement_score":0.00811464,"about_ca_system_score_codex":0.0019386995,"about_ca_system_score_gemma":0.0011296716,"threshold_uncertainty_score":0.02714616},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08747451457374354,"score_gpt":0.35707881040324846,"score_spread":0.2696042958295049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001814250","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041847982,0.011120684,0.009078053,0.029586153,0.9070391,0.00015572079,0.0007769214,0.00064977293,0.041175153],"genre_scores_gemma":[0.0057107206,0.017515048,0.0077321846,0.013941938,0.54160506,0.00025336057,0.0043843444,0.0026572011,0.40620017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986437,0.00023024494,0.0001012999,0.00026001592,0.000628361,0.0001364268],"domain_scores_gemma":[0.9939188,0.0012091341,0.00021224312,0.0004758638,0.0029999104,0.0011840432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020424672,0.0017347753,0.001888946,0.0033908081,0.0018305585,0.004933262,0.001713598,0.0023066697,0.17353356],"category_scores_gemma":[0.0068956637,0.0005303811,0.0015890949,0.0024564352,0.0007176159,0.004399146,0.0024645058,0.0052053616,0.07654324],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002003624,0.000018833078,0.000023342447,0.000069036585,0.00000456084,0.000019162704,0.000007827276,0.00007311882,0.0001589322,0.00084186014,0.98222363,0.016539754],"study_design_scores_gemma":[0.000017565138,0.000042734548,0.00028368685,0.00013831859,0.00001636875,0.00008506881,0.000027397178,0.0005078192,0.0002718129,0.0035392444,0.9950553,0.0000145200775],"about_ca_topic_score_codex":0.0021119507,"about_ca_topic_score_gemma":0.003614059,"teacher_disagreement_score":0.17353356,"about_ca_system_score_codex":0.0019439074,"about_ca_system_score_gemma":0.0018890756,"threshold_uncertainty_score":0.58052754},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Relation (database); Rewriting; Algebraic number; Associative property; Computer science; Algebra over a field; Proof assistant; Calculus (dental); Mathematics; Programming language; Pure mathematics","score_opus":0.06795301837812634,"score_gpt":0.35262139379817214,"score_spread":0.2846683754200458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044333037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017497182,0.0006565166,0.8756236,0.0054969513,0.0004705144,0.000060105067,0.00014271283,0.0032246413,0.09682778],"genre_scores_gemma":[0.5464113,0.0005951897,0.4199019,0.000808709,0.00031299377,0.00012311862,0.00017829645,0.0011911287,0.030477393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767226,0.0012898301,0.00011979762,0.00026658733,0.00050613564,0.00014540066],"domain_scores_gemma":[0.98778987,0.009290768,0.00023863977,0.001498905,0.0008176894,0.0003641257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033112485,0.0005285736,0.0005168878,0.0010557089,0.0014543994,0.004548046,0.0022230463,0.0012052326,0.028466888],"category_scores_gemma":[0.017475825,0.0005808173,0.0006433413,0.0011215322,0.003272158,0.011766271,0.0039702193,0.003832165,0.004987409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036405985,0.000042748936,0.00016729976,0.000056636705,0.000004236155,0.00005395794,0.0004328196,0.0007726757,0.00064821576,0.9636105,0.004903399,0.029271124],"study_design_scores_gemma":[0.00004084145,0.000026549997,0.00008164322,0.00006286077,0.000010454537,0.00017035229,0.0001715365,0.0151336845,0.0032619205,0.94083416,0.040186096,0.000019866528],"about_ca_topic_score_codex":0.0006046451,"about_ca_topic_score_gemma":0.00095364073,"teacher_disagreement_score":0.028466888,"about_ca_system_score_codex":0.0016391097,"about_ca_system_score_gemma":0.0020244988,"threshold_uncertainty_score":0.095231175},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algebraic number; Computer science; Mathematics education; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.15289726322996747,"score_gpt":0.4224186430106527,"score_spread":0.26952137978068524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205763999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013077027,0.05310493,0.8002611,0.023569519,0.003710923,0.00008536486,0.00030586927,0.00045229256,0.10543308],"genre_scores_gemma":[0.46147954,0.03857411,0.444921,0.0028476948,0.0076606805,0.00046957508,0.0003535781,0.0003893783,0.04330454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963284,0.0017468338,0.0003915945,0.00042193328,0.00097521517,0.00013595354],"domain_scores_gemma":[0.99093115,0.006695971,0.00032347732,0.0010027991,0.00081252184,0.00023414937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049013295,0.00077771646,0.0013692987,0.003145423,0.0021675022,0.008144554,0.0014789616,0.0017426328,0.011301707],"category_scores_gemma":[0.011997692,0.00064741186,0.0011765547,0.00431637,0.010493511,0.01855971,0.0030952208,0.004754997,0.0013423433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018275489,0.000005211234,0.000033737753,0.000037373324,0.000003902431,0.0000064697642,0.00009547701,0.00012435898,0.00002423346,0.9950001,0.00089553493,0.0037717167],"study_design_scores_gemma":[0.00000420767,0.000003313658,0.000035423906,0.000023488898,0.000005453491,0.000023162609,0.000050020695,0.0009603277,0.000040053816,0.9870908,0.0117595345,0.0000041157537],"about_ca_topic_score_codex":0.001980527,"about_ca_topic_score_gemma":0.0015041347,"teacher_disagreement_score":0.011301707,"about_ca_system_score_codex":0.0026296135,"about_ca_system_score_gemma":0.002427116,"threshold_uncertainty_score":0.03780794},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Psychology","score_opus":0.033215056177060234,"score_gpt":0.34725635102431884,"score_spread":0.3140412948472586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206823480","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014548944,0.016572995,0.009880509,0.044127278,0.23894036,0.0004752295,0.011888393,0.0016367758,0.6750237],"genre_scores_gemma":[0.0056957435,0.0058652447,0.003131681,0.006587413,0.02640845,0.0002044206,0.0067575416,0.000774596,0.944575],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926347,0.000109584136,0.000053347278,0.000137034,0.00037525425,0.00006130059],"domain_scores_gemma":[0.9950305,0.0008053357,0.00016834341,0.00048395523,0.002810434,0.00070148107],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013791642,0.0007955874,0.0006552378,0.0031196168,0.0021383956,0.0036508748,0.0011972346,0.0011205582,0.42561483],"category_scores_gemma":[0.010424928,0.0002880248,0.0004793475,0.0020634623,0.0006161571,0.0028626472,0.0018363388,0.00275741,0.28131163],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021642836,0.000018108169,0.000080569494,0.00007914144,0.0000017014077,0.000025612659,0.00005714845,0.00005128835,0.000095572934,0.007250155,0.9486873,0.043631837],"study_design_scores_gemma":[0.0000031659247,0.000007801908,0.00019488446,0.000091517686,0.0000013224852,0.0000323785,0.000046044806,0.0000258403,0.000066055785,0.0036066542,0.99592054,0.0000037499137],"about_ca_topic_score_codex":0.0032056845,"about_ca_topic_score_gemma":0.004905536,"teacher_disagreement_score":0.57438517,"about_ca_system_score_codex":0.0017882524,"about_ca_system_score_gemma":0.001955812,"threshold_uncertainty_score":0},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06223679255921293,"score_gpt":0.3772277272417923,"score_spread":0.3149909346825794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386879846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066039115,0.00021203977,0.98773324,0.00020147639,0.000045748227,0.00015966177,0.00014647908,0.0006843566,0.004213046],"genre_scores_gemma":[0.23455487,0.0008033783,0.7571405,0.00013271523,0.00008540715,0.0009930052,0.00032711925,0.00035097386,0.0056120534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969254,0.001080958,0.00040591136,0.00051377126,0.00082466647,0.00024918272],"domain_scores_gemma":[0.9941894,0.003295904,0.0005955909,0.0010995392,0.00046759305,0.00035214776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035064297,0.0012473803,0.0009024914,0.0017105181,0.0020270215,0.0038697566,0.0020201767,0.0015251704,0.0058437083],"category_scores_gemma":[0.009505509,0.0012963149,0.0026874996,0.0021971222,0.00677377,0.0060393442,0.0038720402,0.0030719303,0.0007866436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005704262,0.000028335908,0.0004262306,0.0001648107,0.000032426393,0.00027868056,0.0008651637,0.035927262,0.0036010707,0.94026953,0.00059700076,0.01775246],"study_design_scores_gemma":[0.000056266737,0.000053391497,0.00017550228,0.00012681066,0.00004654838,0.00027366323,0.0002534667,0.1295327,0.0062024207,0.83846647,0.024750356,0.000062400984],"about_ca_topic_score_codex":0.004341048,"about_ca_topic_score_gemma":0.0032555892,"teacher_disagreement_score":0.0058437083,"about_ca_system_score_codex":0.002316599,"about_ca_system_score_gemma":0.0018791014,"threshold_uncertainty_score":0.019549131},"labels":[],"label_agreement":null}]}