{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05680574,0.0016620222,0.9397311,0.0009705273,0.00041977383,0.00012616735,1.4719691e-7,0.000023321565,0.00026120114],"genre_scores_gemma":[0.12622912,0.00013360631,0.8732972,0.00015552058,0.0001433118,0.0000052099867,6.3472385e-8,0.0000057690895,0.000030203373],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967047,0.0010456577,0.00083337154,0.0005147398,0.00038646904,0.00051504053],"domain_scores_gemma":[0.99650365,0.0024418915,0.00038352062,0.00020789352,0.00017268576,0.0002903772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012379769,0.00021227224,0.00051153306,0.00050433475,0.00015440368,0.00022134074,0.00066536374,0.00013899786,0.000018591803],"category_scores_gemma":[0.0017947567,0.000118773845,0.0000951042,0.0009984407,0.0006067276,0.00094107015,0.0005665276,0.00043488992,0.0000016430706],"study_design_candidate":"design_other","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.000012475939,0.00008271385,0.010716364,0.000012193584,0.000007738572,0.000052377025,0.00045163013,0.0000035378184,0.0025559682,0.103841856,0.0000050450076,0.8822581],"study_design_scores_gemma":[0.0031627733,0.0013323389,0.18779172,0.00060905854,0.00002495535,0.0017240781,0.00008475939,0.018081311,0.0032801076,0.77576256,0.0074136704,0.0007326651],"about_ca_topic_score_codex":0.0000033342062,"about_ca_topic_score_gemma":0.0000025220309,"teacher_disagreement_score":0.88152546,"about_ca_system_score_codex":0.00007980516,"about_ca_system_score_gemma":0.00014344114,"threshold_uncertainty_score":0.48434567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008696669,0.00014898868,0.98888236,0.0018486162,0.0001281766,0.00012430335,2.4591085e-7,0.000020862237,0.00014978675],"genre_scores_gemma":[0.1295263,0.0000172005,0.8701483,0.00017490883,0.00006645311,0.000008480481,4.3719885e-7,0.0000037176512,0.00005421892],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988854,0.0002755135,0.00039390646,0.00014472395,0.00013892289,0.00016153583],"domain_scores_gemma":[0.998597,0.0009018434,0.00024463006,0.00008744814,0.0000786566,0.000090409245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891238,0.00009097613,0.00021991183,0.00013212301,0.00009807443,0.000136736,0.00014627095,0.00004602541,0.000009961921],"category_scores_gemma":[0.000523919,0.00005799587,0.000060080096,0.00019163867,0.00008635604,0.0004932709,0.00004075124,0.00017053467,2.8131518e-7],"study_design_candidate":"theoretical_or_conceptual","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.0000128977035,0.00001787002,0.0015445651,0.000011064681,0.000010729798,0.0000026343976,0.00023654192,0.0001454868,0.000044900244,0.37126407,0.0000071295517,0.62670213],"study_design_scores_gemma":[0.0027761164,0.001958326,0.020616272,0.00024270966,0.000057846697,0.0006294305,0.0006272101,0.0683379,0.0006604126,0.8798345,0.023754401,0.0005048933],"about_ca_topic_score_codex":0.00000128907,"about_ca_topic_score_gemma":0.000002428993,"teacher_disagreement_score":0.6261972,"about_ca_system_score_codex":0.00001517812,"about_ca_system_score_gemma":0.000030901992,"threshold_uncertainty_score":0.2365003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069222515,0.0002587409,0.99174774,0.00052793743,0.00017929063,0.00014601408,2.6663065e-7,0.00014285863,0.00007487531],"genre_scores_gemma":[0.106443316,0.00005346676,0.89332026,0.00011146856,0.00004790121,0.000010547222,4.1582612e-7,0.0000076010747,0.0000050116228],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980916,0.00043906632,0.0006870915,0.00020282986,0.00029127006,0.0002881771],"domain_scores_gemma":[0.9990487,0.00025166204,0.00024690237,0.00018466811,0.000115058254,0.00015301527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144186,0.00016666895,0.00040270004,0.00024840096,0.00006246179,0.00013156135,0.0005167808,0.00014022406,0.0000041492276],"category_scores_gemma":[0.00011578735,0.00012077435,0.000115055846,0.00047039412,0.000060273047,0.0005421585,0.00008813233,0.00044551355,4.0790073e-7],"study_design_candidate":"design_other","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.000007868171,0.000048914888,0.00016503554,0.000035801437,0.00000901674,0.000010333896,0.00035938979,0.00019674007,0.0010403289,0.09152285,0.0000062974264,0.90659744],"study_design_scores_gemma":[0.0015893737,0.001802221,0.004200289,0.0004280981,0.000047412974,0.0010715115,0.000030994277,0.32585248,0.01620389,0.542282,0.10572917,0.00076261436],"about_ca_topic_score_codex":0.0000066664643,"about_ca_topic_score_gemma":0.000001591158,"teacher_disagreement_score":0.9058348,"about_ca_system_score_codex":0.000030617943,"about_ca_system_score_gemma":0.000022867554,"threshold_uncertainty_score":0.4925035},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02594917,0.00010420599,0.9715787,0.0016564892,0.00031045085,0.00025299337,4.0075437e-7,0.000015542844,0.00013201247],"genre_scores_gemma":[0.34447396,0.0000050751937,0.6552915,0.00011318306,0.00009955282,0.000008841982,1.9554356e-7,0.0000029840987,0.000004694992],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977444,0.00087441533,0.00070657354,0.00021610802,0.0002492279,0.00020931463],"domain_scores_gemma":[0.9946633,0.0044726613,0.00042253797,0.00016934426,0.00019056245,0.00008157715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006859328,0.000116667834,0.00035705286,0.00011053569,0.00009400481,0.00008823258,0.00037940382,0.00007022972,0.0000029064263],"category_scores_gemma":[0.0012165171,0.000065935266,0.00014773938,0.00031102265,0.000114510694,0.00018428994,0.00012730311,0.0002482125,2.5454352e-7],"study_design_candidate":"design_other","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.000026069461,0.00014792013,0.000102739396,0.00001845612,0.000013016919,0.0000011759441,0.00023270026,0.004664988,0.00017013725,0.13690577,0.000018300976,0.85769874],"study_design_scores_gemma":[0.00036032771,0.0009940782,0.0006697705,0.00003770239,0.000011415517,0.000029449864,0.00005351912,0.46009997,0.00036871573,0.5364043,0.00089348975,0.00007724924],"about_ca_topic_score_codex":0.0000032953922,"about_ca_topic_score_gemma":8.6431066e-7,"teacher_disagreement_score":0.8576215,"about_ca_system_score_codex":0.000020503361,"about_ca_system_score_gemma":0.00002862879,"threshold_uncertainty_score":0.2688762},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.400507,0.00016881377,0.5985196,0.00027865282,0.0001971691,0.00016716275,4.8217584e-7,0.000015025916,0.00014605337],"genre_scores_gemma":[0.29291692,0.00005411333,0.70694566,0.000031471856,0.000035399655,0.0000040973628,3.7620933e-7,0.000004211473,0.0000077816685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974814,0.0005664032,0.0011233122,0.00024328199,0.0003047121,0.00028091096],"domain_scores_gemma":[0.997672,0.0009066501,0.000754534,0.00022964505,0.00030758017,0.0001295724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023893125,0.00015286819,0.0006191094,0.00020530076,0.000042600634,0.00007708528,0.000601646,0.000107280735,0.000034292196],"category_scores_gemma":[0.000425271,0.00011039031,0.00014146758,0.0006732165,0.00017148071,0.00047392698,0.00036296409,0.00030672702,6.464662e-7],"study_design_candidate":"design_other","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.0000074968057,0.00033169662,0.012181497,0.00008179406,0.000029746308,0.000011942346,0.00069458026,0.00009866418,0.01015809,0.009393476,0.000009049287,0.967002],"study_design_scores_gemma":[0.0024908092,0.0026577287,0.27486894,0.0006013165,0.000074689044,0.0009503894,0.00060042494,0.12298619,0.0145126395,0.5779412,0.001446348,0.00086933596],"about_ca_topic_score_codex":0.000051652933,"about_ca_topic_score_gemma":0.0000012919744,"teacher_disagreement_score":0.96613264,"about_ca_system_score_codex":0.000028610575,"about_ca_system_score_gemma":0.000064061365,"threshold_uncertainty_score":0.45015863},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16776201,0.000967823,0.83045524,0.0003648223,0.00013145838,0.00007275544,2.1891519e-7,0.000012981558,0.00023267677],"genre_scores_gemma":[0.34047845,0.00005235699,0.6592976,0.00010091733,0.000057029396,0.0000012209417,1.6153271e-7,0.000003074855,0.000009199147],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998194,0.00046146492,0.0006710013,0.00022101909,0.00023436919,0.00021814073],"domain_scores_gemma":[0.99792767,0.0012307707,0.00045488664,0.00013017117,0.00011081883,0.000145705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024815153,0.00013442896,0.00042878557,0.00014851216,0.00007379947,0.000040904393,0.00025989718,0.00010217896,0.000010151309],"category_scores_gemma":[0.0010114054,0.000092076254,0.0000710078,0.00030891338,0.00024244454,0.00034716728,0.00018369782,0.00035064926,3.731905e-7],"study_design_candidate":"theoretical_or_conceptual","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.00001219985,0.000052026815,0.003274667,0.000023250219,0.000010512396,0.00001212394,0.00017901536,0.000015929169,0.00074716954,0.36311066,0.0000018795589,0.63256055],"study_design_scores_gemma":[0.002105927,0.0012824979,0.020516347,0.00019710352,0.000027905813,0.0009166683,0.00018673105,0.01379529,0.0022112718,0.94943273,0.008979052,0.00034849852],"about_ca_topic_score_codex":0.0000012247892,"about_ca_topic_score_gemma":5.6147684e-7,"teacher_disagreement_score":0.63221204,"about_ca_system_score_codex":0.000009668355,"about_ca_system_score_gemma":0.000028293056,"threshold_uncertainty_score":0.37547606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12811536,0.0009454957,0.8701864,0.000150369,0.00025931894,0.0001281097,9.55211e-8,0.000012385213,0.00020248553],"genre_scores_gemma":[0.6274922,0.00001260119,0.37240058,0.000019122841,0.00006296008,0.000002396693,2.822918e-7,0.000002897742,0.0000069672537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754393,0.00079061644,0.0009515612,0.0001731608,0.00035164013,0.00018911832],"domain_scores_gemma":[0.9984684,0.00031650966,0.00077459455,0.00013607595,0.00021924992,0.0000851488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038420693,0.00012212574,0.00047928232,0.00017622321,0.000051336785,0.00004855839,0.00032815666,0.00010965751,0.0000058785195],"category_scores_gemma":[0.00034570543,0.00007932794,0.00013262835,0.0002909484,0.00019909698,0.00028446925,0.00012952006,0.00024202069,4.24778e-7],"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.000045146775,0.00020226916,0.0047901976,0.00016098292,0.000038162718,0.00000804791,0.0006657007,0.00003812556,0.026009936,0.5726974,0.000003636627,0.3953404],"study_design_scores_gemma":[0.0042378274,0.004874457,0.020086104,0.0006191431,0.00013563622,0.0012344408,0.0005035822,0.018961366,0.1313309,0.8087885,0.008403964,0.0008241125],"about_ca_topic_score_codex":0.000011561504,"about_ca_topic_score_gemma":0.0000010457152,"teacher_disagreement_score":0.49937683,"about_ca_system_score_codex":0.000017249557,"about_ca_system_score_gemma":0.000044257537,"threshold_uncertainty_score":0.32348993},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031712335,0.0007924479,0.9665483,0.00042261148,0.00023566029,0.000090046895,1.6979374e-7,0.000016958806,0.00018142154],"genre_scores_gemma":[0.0293642,0.000033183915,0.96994877,0.0004591628,0.00015949388,0.000003294355,1.1958298e-7,0.0000048733937,0.000026924254],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839294,0.00039654394,0.0005291196,0.00023054675,0.0002175067,0.00023332196],"domain_scores_gemma":[0.9986848,0.00051933876,0.00030768695,0.00016322276,0.00006480629,0.00026014776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034286994,0.00012886632,0.000386763,0.00013248176,0.00010626056,0.00018343875,0.00023445746,0.000055099106,0.000011287967],"category_scores_gemma":[0.0009165626,0.00008150549,0.000053704967,0.00024386602,0.00016750886,0.0004594575,0.00027390587,0.00022089598,0.0000023804255],"study_design_candidate":"theoretical_or_conceptual","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.0000052841588,0.000040526753,0.00045422246,0.000045688616,0.000008711968,0.00002483806,0.00026538887,0.0000030799354,0.00020181815,0.32490593,0.000018432409,0.6740261],"study_design_scores_gemma":[0.003336261,0.0029462131,0.012463844,0.0018136497,0.00005705203,0.0036088608,0.00054914964,0.06202302,0.0013804873,0.45387718,0.45674193,0.0012023456],"about_ca_topic_score_codex":0.0000029279233,"about_ca_topic_score_gemma":9.1279475e-7,"teacher_disagreement_score":0.6728237,"about_ca_system_score_codex":0.000008950946,"about_ca_system_score_gemma":0.000028935976,"threshold_uncertainty_score":0.33236974},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12561542,0.0014728517,0.87172323,0.00052280107,0.00038916228,0.00016091976,1.2164213e-7,0.000045852255,0.00006962654],"genre_scores_gemma":[0.19000971,0.000024053536,0.8097946,0.000084328734,0.0000645281,0.000008136043,6.197706e-8,0.000007229959,0.0000073698056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974094,0.0009122278,0.00067524775,0.00027084982,0.00043447083,0.00029777302],"domain_scores_gemma":[0.9955758,0.0032888842,0.00046832964,0.00027679704,0.00026065527,0.00012953482],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0081935795,0.0001791304,0.00046516908,0.00018100538,0.000051570343,0.00005680113,0.0007125727,0.00006691972,0.0000014354172],"category_scores_gemma":[0.014816731,0.0000992604,0.00008611814,0.00078699173,0.00015962432,0.00031199955,0.00020464127,0.00059158175,3.3714673e-7],"study_design_candidate":"theoretical_or_conceptual","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.00006902284,0.0001777084,0.0007061804,0.00006585704,0.000038600527,0.0000727706,0.0022175764,0.003213119,0.0023123128,0.116210766,0.000023133556,0.87489295],"study_design_scores_gemma":[0.00092339417,0.0017167166,0.003504958,0.00042779837,0.00002397393,0.0003162339,0.0015156759,0.002113886,0.017381169,0.97052944,0.0011611151,0.00038566778],"about_ca_topic_score_codex":0.0000014246142,"about_ca_topic_score_gemma":1.6018934e-7,"teacher_disagreement_score":0.8745073,"about_ca_system_score_codex":0.000037968748,"about_ca_system_score_gemma":0.00008038363,"threshold_uncertainty_score":0.9934819},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022637298,0.00059133925,0.97591174,0.0005283365,0.00009461141,0.00005822662,0.0000010014272,0.000006043002,0.00017138585],"genre_scores_gemma":[0.123036236,0.00015972686,0.876713,0.00003149652,0.000027327265,0.0000019229658,3.1655702e-7,0.000001923789,0.00002808541],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986557,0.00024137762,0.0005398721,0.0001567492,0.00024442986,0.00016190627],"domain_scores_gemma":[0.99879974,0.00072266033,0.00025060982,0.00012633228,0.000047784684,0.000052847634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030004845,0.00007825052,0.00023478671,0.00022284473,0.000019557963,0.000032953307,0.00037099878,0.000030703646,0.000010818451],"category_scores_gemma":[0.0004405981,0.00004310924,0.000046298668,0.00029906328,0.00007353661,0.0012304928,0.00029380785,0.0001286087,3.0887188e-7],"study_design_candidate":"theoretical_or_conceptual","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.000008293286,0.00006588216,0.0040139733,0.000011371345,0.0000067183482,0.000036586345,0.00006657034,0.000018138857,0.00037887477,0.21937506,0.0000071868444,0.77601135],"study_design_scores_gemma":[0.0021689015,0.0004900797,0.03054842,0.0007053323,0.00001920635,0.00016872596,0.00021551254,0.021423222,0.0018294362,0.9364905,0.0055946475,0.00034604906],"about_ca_topic_score_codex":0.0000048551065,"about_ca_topic_score_gemma":0.0000032388966,"teacher_disagreement_score":0.7756653,"about_ca_system_score_codex":0.000013947913,"about_ca_system_score_gemma":0.000023340419,"threshold_uncertainty_score":0.17579438},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011818811,0.0003595595,0.9860281,0.0008196427,0.0002887009,0.00043264832,2.4526378e-7,0.00008999057,0.00016231144],"genre_scores_gemma":[0.058693152,0.000025564235,0.9408035,0.0003099978,0.000089666515,0.00005316322,1.65181e-7,0.000011999783,0.000012782691],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965235,0.0008301851,0.0010633579,0.00050272956,0.00055689976,0.00052333815],"domain_scores_gemma":[0.9973257,0.0012286686,0.0005246761,0.00037758984,0.00021468093,0.00032867552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084210625,0.00025327082,0.0005223605,0.00045826187,0.00011514613,0.000248533,0.0010650689,0.00017272845,0.000004720453],"category_scores_gemma":[0.005776113,0.00013706126,0.00014592668,0.0010117011,0.00013958625,0.000636303,0.00028893066,0.0003265143,0.0000029268804],"study_design_candidate":"design_other","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.00006477076,0.0002725716,0.00053961924,0.00005195438,0.000008969956,0.000018008992,0.00016720576,0.00003800623,0.0016950584,0.04910831,0.00001332546,0.9480222],"study_design_scores_gemma":[0.01100543,0.011061075,0.048127744,0.0044241613,0.00014796742,0.0033810528,0.0007378392,0.072152525,0.037253767,0.72089815,0.08743108,0.0033792192],"about_ca_topic_score_codex":0.0000014035952,"about_ca_topic_score_gemma":5.3529493e-7,"teacher_disagreement_score":0.94464296,"about_ca_system_score_codex":0.000088780514,"about_ca_system_score_gemma":0.00011644305,"threshold_uncertainty_score":0.6914964},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063186768,0.00027181828,0.99224985,0.00085133413,0.000045323293,0.000122024234,0.000002269172,0.000018048931,0.000120667995],"genre_scores_gemma":[0.13614304,0.00001577031,0.86363494,0.0000761593,0.000079308076,0.000024491954,2.3588849e-7,0.0000030001497,0.000023068274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871397,0.00023124438,0.0004891504,0.00021820492,0.00012884657,0.00021858848],"domain_scores_gemma":[0.9966471,0.0026184674,0.00032377912,0.00013394802,0.00015826494,0.000118431904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028266564,0.000099633166,0.00028699648,0.00013798817,0.00009283266,0.00010711803,0.00038765217,0.00005853058,0.0000053161984],"category_scores_gemma":[0.0017336934,0.000054202334,0.00008682851,0.00039839547,0.0001566082,0.00027544735,0.000107806074,0.0001336736,7.713411e-7],"study_design_candidate":"design_other","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.0000037022398,0.000042387666,0.0019000788,0.000008006028,0.000019718456,0.00000715974,0.00007388221,0.0000013077535,0.0040893764,0.018289622,0.00000968249,0.97555506],"study_design_scores_gemma":[0.007771206,0.0032732734,0.008959414,0.0016382455,0.0003140176,0.0018185882,0.0016584116,0.0337302,0.009577898,0.80134654,0.12824513,0.0016671024],"about_ca_topic_score_codex":6.426982e-7,"about_ca_topic_score_gemma":6.84078e-7,"teacher_disagreement_score":0.973888,"about_ca_system_score_codex":0.000017675504,"about_ca_system_score_gemma":0.00006654405,"threshold_uncertainty_score":0.2210307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08682987,0.00353785,0.90324986,0.0056503783,0.00023344939,0.00016020083,4.3176087e-7,0.000015478245,0.00032245682],"genre_scores_gemma":[0.45511886,0.00030596065,0.544388,0.0001465917,0.000024582214,0.0000026355342,1.726535e-7,0.0000020926582,0.000011104596],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832714,0.0005212644,0.00057239033,0.0001775187,0.00023364111,0.00016804851],"domain_scores_gemma":[0.9952468,0.003719131,0.00070767634,0.00020741914,0.0000791891,0.00003978388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004070892,0.0001154404,0.00039920263,0.00007202036,0.00025702908,0.00024012642,0.0005320741,0.00008529008,0.0000031635739],"category_scores_gemma":[0.004232632,0.0000617602,0.000084579704,0.000081858285,0.0005199262,0.00034418123,0.00024728448,0.00031482536,1.805516e-7],"study_design_candidate":"theoretical_or_conceptual","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.000053151096,0.00004462626,0.0038532892,0.00002882033,0.000026295902,0.000015447764,0.00059296185,0.00010056188,0.00008093045,0.2127194,0.000030163654,0.7824544],"study_design_scores_gemma":[0.0023061298,0.0006887052,0.074924774,0.0003703859,0.00004241677,0.00016887477,0.00040634687,0.029872749,0.00046947316,0.8889725,0.0015509225,0.00022670631],"about_ca_topic_score_codex":0.000010106008,"about_ca_topic_score_gemma":0.0000015191845,"teacher_disagreement_score":0.78222764,"about_ca_system_score_codex":0.000010285372,"about_ca_system_score_gemma":0.000023811888,"threshold_uncertainty_score":0.50671613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046551336,0.001195316,0.95061255,0.0003012205,0.0007312664,0.00014813771,5.876897e-8,0.000030005654,0.0004300894],"genre_scores_gemma":[0.5001687,0.000046887297,0.4994933,0.00005678965,0.00020079559,0.0000037079253,1.1155422e-7,0.0000033195308,0.000026419388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807256,0.00045149072,0.00067426503,0.00027107,0.00024382553,0.00028680245],"domain_scores_gemma":[0.9986535,0.0003926747,0.00043790872,0.00014928632,0.00021263571,0.0001540499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004151659,0.00015505147,0.00036246516,0.00017617039,0.00013370473,0.00027004277,0.00039083412,0.0001211071,0.000011496615],"category_scores_gemma":[0.0008312339,0.00009989645,0.00006540925,0.0004081258,0.0002677801,0.00045585202,0.00020112266,0.0003241746,0.0000012806361],"study_design_candidate":"theoretical_or_conceptual","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.000008020382,0.000044815035,0.009174979,0.00002660877,0.0000115644225,0.000041484738,0.0011176426,2.5257614e-7,0.0007499067,0.15516385,0.000011942457,0.8336489],"study_design_scores_gemma":[0.0026401572,0.0051149353,0.04364029,0.00024616593,0.00006654923,0.0031262615,0.0024454787,0.02637526,0.0040584896,0.8592572,0.052040584,0.0009886215],"about_ca_topic_score_codex":0.000015609357,"about_ca_topic_score_gemma":0.000006723766,"teacher_disagreement_score":0.8326603,"about_ca_system_score_codex":0.000022627955,"about_ca_system_score_gemma":0.00003913153,"threshold_uncertainty_score":0.40736592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025445106,0.0010362667,0.99266446,0.0033110152,0.00023323568,0.00016256174,4.7064222e-7,0.000035423516,0.000012082935],"genre_scores_gemma":[0.1601232,0.000014441778,0.8394173,0.0002835427,0.00014730317,0.000007400782,1.409014e-7,0.000005802868,8.96268e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984156,0.00060245546,0.00031460193,0.00021519352,0.00020761775,0.00024454598],"domain_scores_gemma":[0.98999554,0.009424567,0.0001727836,0.00014284517,0.00017637783,0.00008786264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004526219,0.00013735949,0.00032960248,0.00007894653,0.00013222844,0.00013699093,0.00035474973,0.00012570272,0.000001206667],"category_scores_gemma":[0.004296508,0.00007816516,0.000086804816,0.00026873412,0.0005078809,0.00016101898,0.00014314105,0.0004789719,5.1146895e-8],"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.000025868872,0.000019696477,0.000055371045,0.000026660517,0.000015112591,0.000010295752,0.00028474472,0.0048062718,0.000016769874,0.78080714,0.0000031474995,0.21392894],"study_design_scores_gemma":[0.00022580953,0.00035208423,0.00033042594,0.00007731609,0.000013506299,0.000117597374,0.000059467562,0.12187665,0.00012465521,0.87649393,0.00023668859,0.000091854876],"about_ca_topic_score_codex":2.1606822e-7,"about_ca_topic_score_gemma":1.2165988e-7,"teacher_disagreement_score":0.21383709,"about_ca_system_score_codex":0.000017796085,"about_ca_system_score_gemma":0.000040103903,"threshold_uncertainty_score":0.51436317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07462881,0.0012944764,0.9214539,0.0004246056,0.00038016142,0.00016596672,2.385526e-7,0.000051004874,0.0016008461],"genre_scores_gemma":[0.39324504,0.00002414659,0.6062609,0.00019460652,0.0002472969,0.0000046362206,7.1299e-7,0.000005194497,0.000017501958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713343,0.00074539793,0.0008645142,0.0004307782,0.0004000336,0.0004258363],"domain_scores_gemma":[0.99769384,0.0010664752,0.00049855234,0.00020618076,0.00028934033,0.00024558912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031856534,0.00024092148,0.00054422615,0.00026392858,0.00023949305,0.00025733322,0.0007234708,0.00023297236,0.00006184648],"category_scores_gemma":[0.0012783529,0.00015445439,0.00016466151,0.00075004797,0.00048104004,0.00041647427,0.0002965563,0.00064126996,0.0000044291683],"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.000034485645,0.00021063151,0.004319536,0.000026959591,0.00003154152,0.000047636724,0.0012512741,0.000078714205,0.00010103354,0.6769594,0.00005076862,0.31688806],"study_design_scores_gemma":[0.0009636687,0.0010705553,0.042548306,0.00005376089,0.00002226106,0.0011021441,0.00020188028,0.015472012,0.00010992657,0.93523055,0.0029156418,0.00030929263],"about_ca_topic_score_codex":0.000002840227,"about_ca_topic_score_gemma":9.859745e-7,"teacher_disagreement_score":0.3186162,"about_ca_system_score_codex":0.0000470253,"about_ca_system_score_gemma":0.00009177882,"threshold_uncertainty_score":0.6298467},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024544976,0.000023312947,0.9552067,0.041450966,0.00024614952,0.00019931774,4.1223274e-7,0.00003606732,0.00038256688],"genre_scores_gemma":[0.068955645,0.000052181837,0.9285273,0.0017325229,0.0007081581,0.000013394634,1.7154308e-7,0.0000040210875,0.0000065817535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879533,0.00027581234,0.0003353892,0.00014499608,0.00031247054,0.00013598177],"domain_scores_gemma":[0.99932367,0.00029186354,0.00011868756,0.00011299629,0.00006373988,0.0000890297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015939717,0.000105482126,0.00016029527,0.00007080757,0.000059821978,0.00015963549,0.0007692061,0.000045056197,0.00002693652],"category_scores_gemma":[0.00015556903,0.00005170144,0.000066099004,0.00027215693,0.000034355442,0.00015622689,0.00008922313,0.00044292648,0.0000023696334],"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.000021205686,0.00002286063,0.000012633674,0.000004039387,0.000007543013,0.000005896292,0.0017530381,0.000330103,0.0001199757,0.28181744,0.00016797594,0.7157373],"study_design_scores_gemma":[0.00061379693,0.0027324932,0.001254035,0.0003548521,0.00001611171,0.000103149934,0.00025161856,0.078720234,0.0068914895,0.09294275,0.81572276,0.00039670008],"about_ca_topic_score_codex":8.569957e-7,"about_ca_topic_score_gemma":3.8231724e-7,"teacher_disagreement_score":0.8155548,"about_ca_system_score_codex":0.000019502231,"about_ca_system_score_gemma":0.000014832271,"threshold_uncertainty_score":0.21083236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03551579,0.0012254174,0.9572972,0.0048699277,0.0002134936,0.00035671645,8.78316e-8,0.000031378688,0.000489993],"genre_scores_gemma":[0.6265491,0.000009856384,0.37265152,0.0005737597,0.00019168085,0.000011331097,4.6881627e-7,0.0000045242723,0.000007760171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644035,0.0015133854,0.00093395676,0.0003118248,0.0004742958,0.00032617972],"domain_scores_gemma":[0.99814767,0.0010876893,0.00041509516,0.00016289136,0.00006733345,0.00011929901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007091773,0.00017480252,0.00038733188,0.00013836082,0.00014376672,0.00031601533,0.0007093604,0.00012681492,0.000008190311],"category_scores_gemma":[0.0017725604,0.000100697085,0.00013488102,0.00060038717,0.000079172474,0.0005167875,0.00015984644,0.00093795167,0.0000022397676],"study_design_candidate":"theoretical_or_conceptual","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.000013471987,0.00010965366,0.010975041,0.000028355578,0.000012507534,0.00010469656,0.003341284,0.000048581354,0.0001276573,0.44320306,0.000018764049,0.5420169],"study_design_scores_gemma":[0.0030514798,0.0016948194,0.10463503,0.000110543886,0.000044137247,0.0012230407,0.0014984657,0.03632616,0.00011890883,0.77937573,0.07115958,0.0007620825],"about_ca_topic_score_codex":0.0000081505505,"about_ca_topic_score_gemma":0.0000024688093,"teacher_disagreement_score":0.59103334,"about_ca_system_score_codex":0.000032773543,"about_ca_system_score_gemma":0.00006440552,"threshold_uncertainty_score":0.41063082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06923668,0.0009817192,0.9280561,0.0010136239,0.0003708644,0.00012315673,8.9985825e-8,0.000015163707,0.00020257683],"genre_scores_gemma":[0.09400542,0.000039271235,0.90549886,0.0003487417,0.000091545495,0.0000039528536,9.3895736e-8,0.0000033513488,0.00000878174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970873,0.0008197289,0.00069761777,0.00044809913,0.0005093501,0.00043789909],"domain_scores_gemma":[0.99779797,0.0011413803,0.00029563258,0.00014403106,0.00026612112,0.00035487657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018817024,0.00016023646,0.00039378324,0.00061337743,0.00012550817,0.00030673805,0.00056427764,0.00008251202,0.0000043323666],"category_scores_gemma":[0.0020583519,0.00011506623,0.000058703223,0.0016274389,0.00056773407,0.0012971101,0.00060507585,0.00050203974,7.900753e-7],"study_design_candidate":"design_other","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.000009120656,0.00005911308,0.0055288086,0.00000825214,0.0000039964525,0.000057266698,0.0010103927,0.000028511351,0.0010874927,0.028494138,0.0000040495934,0.9637089],"study_design_scores_gemma":[0.002605633,0.0013522638,0.11138735,0.0004305545,0.000019762101,0.00177025,0.00068651914,0.11837744,0.0016726492,0.75550926,0.005514371,0.0006739615],"about_ca_topic_score_codex":0.000006688608,"about_ca_topic_score_gemma":0.0000023187984,"teacher_disagreement_score":0.96303487,"about_ca_system_score_codex":0.00006696686,"about_ca_system_score_gemma":0.00023741319,"threshold_uncertainty_score":0.6521643},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026036143,0.0013608688,0.9692056,0.00043942238,0.00035040308,0.00007175552,2.8266406e-8,0.000028233751,0.0025075441],"genre_scores_gemma":[0.23893434,0.000050974908,0.7606496,0.00014318289,0.00014246232,0.0000024295073,4.7583754e-8,0.0000035875257,0.00007334608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981196,0.00067924516,0.00048879295,0.00022001375,0.00019818329,0.00029414965],"domain_scores_gemma":[0.9984996,0.0007933518,0.00027908068,0.0001622826,0.00008711881,0.00017861927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004604059,0.0001314896,0.0003638126,0.00011926854,0.00007233081,0.00016148189,0.00054839026,0.000096147916,0.000011647911],"category_scores_gemma":[0.0013021778,0.00008143659,0.00010595977,0.00031915924,0.0000826917,0.00028380245,0.00021742412,0.00037574972,0.0000025448057],"study_design_candidate":"design_other","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.0000062850063,0.00007470679,0.002050502,0.000015509771,0.000008036331,0.000020359732,0.00036488223,0.000004079271,0.0003741778,0.11278724,0.000020213867,0.884274],"study_design_scores_gemma":[0.002136535,0.0023442751,0.024747292,0.0002597253,0.000036988647,0.0012220778,0.00019730945,0.016825879,0.0032369914,0.7677131,0.18062265,0.000657158],"about_ca_topic_score_codex":0.0000017665201,"about_ca_topic_score_gemma":0.0000010933875,"teacher_disagreement_score":0.88361686,"about_ca_system_score_codex":0.000017960265,"about_ca_system_score_gemma":0.000026954423,"threshold_uncertainty_score":0.33208877},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022996062,0.0021625315,0.9738502,0.000447863,0.00012817522,0.0002514274,1.9992503e-7,0.000058864218,0.00010469205],"genre_scores_gemma":[0.12980303,0.0003695154,0.86947703,0.000128654,0.00013709805,0.000056248344,2.329615e-7,0.00000671896,0.000021475986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831563,0.0004626008,0.00043905003,0.00028777026,0.000181235,0.00031373996],"domain_scores_gemma":[0.99825627,0.0010914691,0.00019231289,0.00015139197,0.000084518826,0.00022405085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032260865,0.00014448784,0.00034109782,0.0004130732,0.00017188542,0.00024713544,0.00044402026,0.00008045086,0.0000025738634],"category_scores_gemma":[0.0005386663,0.00009848414,0.00007338986,0.0012870969,0.00009828621,0.0002915507,0.0003111737,0.00026972487,0.0000016759873],"study_design_candidate":"design_other","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.000011629973,0.000048745766,0.0022027856,0.000031700092,0.000014794267,0.000050569557,0.0010186892,0.000037264857,0.0016481546,0.025017772,0.00002529014,0.9698926],"study_design_scores_gemma":[0.0021176683,0.0016633553,0.06631757,0.0007033553,0.00006528342,0.0012598104,0.0015093208,0.0064044297,0.005006077,0.8461437,0.06769445,0.0011149339],"about_ca_topic_score_codex":0.0000023525029,"about_ca_topic_score_gemma":0.000001014552,"teacher_disagreement_score":0.96877766,"about_ca_system_score_codex":0.000011155712,"about_ca_system_score_gemma":0.000024124314,"threshold_uncertainty_score":0.40160665},"labels":[],"label_agreement":null}]}