{"meta":{"query_hash":"87d4c8336af1","filters":{"venue":"LISP and Symbolic Computation"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/87d4c8336af1","api":"https://metacan.xera.ac/api/v1/cohort?venue=LISP+and+Symbolic+Computation"},"results":[{"id":"W1482787054","doi":"10.1023/a:1010010009897","title":"From Language Concepts to Implementation Concepts","year":2000,"lang":"en","type":"article","venue":"LISP and Symbolic Computation","topic":"Computability, Logic, AI Algorithms","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":"Nortel (Canada)","funders":"","keywords":"Programming language; Correctness; Computer science; Equivalence (formal languages); Linguistics; Philosophy","score_opus":0.010921123976275511,"score_gpt":0.33894488961967156,"score_spread":0.328023765643396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482787054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7540744,0.00013101389,0.24342732,0.00081773114,0.0002675774,0.00032072977,0.000017019043,0.00020136283,0.0007428489],"genre_scores_gemma":[0.9663894,0.000014052351,0.032191012,0.0009083012,0.00028498602,0.000022875518,0.00006564948,0.000009964124,0.00011374704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998428,0.00014204274,0.00032274163,0.0005784351,0.00024730194,0.00028151824],"domain_scores_gemma":[0.9991965,0.00018162583,0.00006409212,0.00030461425,0.00007101217,0.00018214199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017983501,0.00018357535,0.00022936484,0.000089332534,0.0001421921,0.00027368334,0.00033496277,0.000056578017,0.00027120134],"category_scores_gemma":[0.000013913358,0.0001860691,0.00004851473,0.00036827,0.00004281453,0.00039585048,0.00014770425,0.00008858589,0.000119823766],"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.0000063462835,0.00003584835,0.0006257517,0.0000044533804,0.000012694397,0.000006109534,0.020088617,0.0014486839,0.00031832015,0.0018261529,0.0005138618,0.97511315],"study_design_scores_gemma":[0.0039844243,0.0007497821,0.32564178,0.000063602616,0.00004750237,0.000053134492,0.004195723,0.5973332,0.0034588845,0.048239864,0.014750436,0.0014816916],"about_ca_topic_score_codex":0.0010642301,"about_ca_topic_score_gemma":0.00009685591,"teacher_disagreement_score":0.97363144,"about_ca_system_score_codex":0.00004849519,"about_ca_system_score_gemma":0.000041285093,"threshold_uncertainty_score":0.7587677},"labels":[],"label_agreement":null},{"id":"W1931248855","doi":"10.1023/a:1010022312623","title":"Abstract Models of Storage","year":2000,"lang":"en","type":"article","venue":"LISP and Symbolic Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Linguistics; Epistemology; Philosophy","score_opus":0.02211111425462539,"score_gpt":0.24777226897839646,"score_spread":0.22566115472377107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931248855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36066955,0.00034117862,0.62060946,0.00006838431,0.00015474144,0.00012858091,5.58776e-7,0.00009421405,0.017933339],"genre_scores_gemma":[0.99800277,0.000026246897,0.0016923392,0.000036905916,0.000047997815,0.0000032099113,0.0000033659862,0.00000350559,0.00018365456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993822,0.0000247604,0.0001770626,0.00016991954,0.0001345672,0.00011147906],"domain_scores_gemma":[0.99969316,0.000032188178,0.000059725797,0.00013008624,0.000037939146,0.000046925474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013861456,0.000070566886,0.00012705364,0.000047333928,0.000053123586,0.00007057326,0.00014193905,0.000039780618,0.000014945455],"category_scores_gemma":[0.0000024340352,0.00006154481,0.0000299736,0.00012795326,0.000022951775,0.00028865933,0.000023437447,0.00004504084,0.000016057818],"study_design_candidate":"simulation_or_modeling","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.000004635677,0.00006096538,0.00023055887,0.00004628908,0.000013066814,0.0000051848383,0.003734556,0.011245936,0.00010634149,0.2243058,0.00016129923,0.76008534],"study_design_scores_gemma":[0.0005020206,0.00010979489,0.024162687,0.000010270888,0.0000068726536,0.000023218756,0.000061381295,0.80481315,0.00014318066,0.1670995,0.0028520797,0.00021581752],"about_ca_topic_score_codex":0.00013895679,"about_ca_topic_score_gemma":0.0000044688722,"teacher_disagreement_score":0.79356724,"about_ca_system_score_codex":0.0000064196447,"about_ca_system_score_gemma":0.000016925942,"threshold_uncertainty_score":0.25097245},"labels":[],"label_agreement":null},{"id":"W2010112143","doi":"10.1007/s10990-005-4877-4","title":"BIT: A Very Compact Scheme System for Microcontrollers","year":2005,"lang":"en","type":"article","venue":"LISP and Symbolic Computation","topic":"Embedded Systems Design Techniques","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":"Université de Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Université Laval","keywords":"Microcontroller; Scheme (mathematics); Bit (key); Computer science; Arithmetic; Computer hardware; Embedded system; Mathematics; Computer network","score_opus":0.014461045561269639,"score_gpt":0.2639002782903432,"score_spread":0.24943923272907353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010112143","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.057710487,0.00039621157,0.9382672,0.0006467038,0.00019159728,0.00075970346,0.0000046823966,0.0006513417,0.0013721036],"genre_scores_gemma":[0.91053617,0.000005153296,0.08892948,0.0001806974,0.00019861519,0.000046112313,0.00000608894,0.000012388704,0.00008528818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998826,0.000081163016,0.00033891285,0.0003434635,0.00016312988,0.00024727857],"domain_scores_gemma":[0.9992294,0.0001898102,0.00014415868,0.00022835091,0.00011233212,0.00009596656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039082862,0.00016236803,0.00029615406,0.0001782409,0.0001536783,0.00023654019,0.00027610656,0.00008265163,6.410542e-7],"category_scores_gemma":[0.000015267984,0.00015398372,0.00008073828,0.00019185511,0.000024446781,0.00042894314,0.000045685938,0.00007307134,0.000013668534],"study_design_candidate":"simulation_or_modeling","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.00019251967,0.0003561975,0.0025339744,0.0014383186,0.00037403562,0.000022085498,0.013154017,0.0049116886,0.09543225,0.44201943,0.049870566,0.3896949],"study_design_scores_gemma":[0.0014409072,0.00014097686,0.0011347564,0.00014334184,0.000013180284,0.00007915756,0.00012069741,0.9827495,0.0055077095,0.0012745566,0.0070793424,0.0003158343],"about_ca_topic_score_codex":0.0000348637,"about_ca_topic_score_gemma":0.0000056609056,"teacher_disagreement_score":0.97783786,"about_ca_system_score_codex":0.00009600079,"about_ca_system_score_gemma":0.000044404434,"threshold_uncertainty_score":0.6279274},"labels":[],"label_agreement":null},{"id":"W2053771722","doi":"10.1007/s10990-005-7006-5","title":"Least Reflexive Points of Relations","year":2005,"lang":"en","type":"article","venue":"LISP and Symbolic Computation","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":6,"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":"","keywords":"Mathematics; Nondeterministic algorithm; Reflexivity; Generalization; Complete lattice; Algebraic number; Partially ordered set; Binary relation; Pure mathematics; Lattice (music); Fixed point; Discrete mathematics; Combinatorics; Mathematical analysis; Universality (dynamical systems)","score_opus":0.01226304771391825,"score_gpt":0.27104388238119,"score_spread":0.25878083466727175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053771722","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.08065871,0.00017424679,0.91536325,0.00071278075,0.000085862135,0.00007821304,0.0000073472634,0.000054489585,0.0028650705],"genre_scores_gemma":[0.8366459,0.000011642709,0.16298954,0.000071794806,0.00006106985,0.0000032529608,0.000011694186,0.0000030809254,0.00020205158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942535,0.00003223535,0.00019443715,0.00015622555,0.00010534687,0.00008643208],"domain_scores_gemma":[0.99961084,0.000051995077,0.00009139429,0.00014032342,0.00006450343,0.000040965322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098601464,0.00006238419,0.00010930046,0.000067584195,0.00007943692,0.000017536393,0.000069159716,0.00002445758,0.0000042608813],"category_scores_gemma":[0.000018154597,0.000057831683,0.000020513158,0.00015761689,0.000032653126,0.00054640585,0.0000657237,0.00004462414,0.000018437948],"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.0000045034412,0.000031981977,0.0007989852,0.000017715518,0.000010190444,0.0000010457505,0.002691489,0.0026041858,0.0004028465,0.78464836,0.00059986464,0.20818883],"study_design_scores_gemma":[0.0016282164,0.00025164406,0.09556142,0.00022296215,0.00002344814,0.00010654815,0.0005904368,0.7376926,0.0024426049,0.029614937,0.13122492,0.00064029725],"about_ca_topic_score_codex":0.000024053605,"about_ca_topic_score_gemma":0.000013866256,"teacher_disagreement_score":0.75598717,"about_ca_system_score_codex":0.000011337144,"about_ca_system_score_gemma":0.000019495841,"threshold_uncertainty_score":0.23583077},"labels":[],"label_agreement":null},{"id":"W2086737876","doi":"10.1007/s10990-010-9056-6","title":"An introduction to Landin’s “Getting Rid of Labels”","year":2009,"lang":"en","type":"article","venue":"LISP and Symbolic Computation","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":"Queen's University","funders":"","keywords":"Volume (thermodynamics); Art; History; Computer science; Advertising; Business; Physics","score_opus":0.01222945550472591,"score_gpt":0.26380166032073443,"score_spread":0.2515722048160085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086737876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27431342,0.00006329388,0.72247285,0.0020334525,0.00037266043,0.00015567063,2.754796e-7,0.00011494645,0.00047341935],"genre_scores_gemma":[0.9918039,0.0000025267648,0.0075439783,0.00018700112,0.00041119324,0.0000024493206,0.0000071046948,0.000002767872,0.000039065093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926066,0.000054463617,0.0001817427,0.00024198912,0.00013255296,0.00012857132],"domain_scores_gemma":[0.99959326,0.000018016239,0.00007716191,0.00016347635,0.00007632408,0.00007176593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002578377,0.00007417253,0.00013195055,0.00010145431,0.00007641129,0.00010556172,0.00014060241,0.00003452644,0.0000013008837],"category_scores_gemma":[0.000017536282,0.00006613395,0.00001876013,0.00024730273,0.000010244625,0.0002616844,0.000024083412,0.0000444385,0.0000057292123],"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.000008521905,0.00010118256,0.0019875958,0.000024675646,0.00000908581,0.000002342279,0.006164511,0.0012754401,0.004125853,0.3487354,0.0009064592,0.63665897],"study_design_scores_gemma":[0.0021636272,0.0041278335,0.29437932,0.000034003104,0.000045528075,0.00017272685,0.0007907471,0.44052157,0.009890244,0.21363898,0.033021357,0.0012140634],"about_ca_topic_score_codex":0.000039479768,"about_ca_topic_score_gemma":0.0000056740428,"teacher_disagreement_score":0.7174905,"about_ca_system_score_codex":0.000011734236,"about_ca_system_score_gemma":0.0000123661675,"threshold_uncertainty_score":0.26968643},"labels":[],"label_agreement":null}]}