{"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":"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.012920814,0.012372796,0.8711405,0.016811727,0.0010153527,0.000061611536,0.00018904333,0.00067075714,0.08481753],"genre_scores_gemma":[0.5618748,0.013605995,0.39087024,0.00505727,0.0026411277,0.00071679277,0.0003969726,0.0009850798,0.023851667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974239,0.0013297829,0.00018199679,0.00036891925,0.00045394592,0.00024143673],"domain_scores_gemma":[0.9954418,0.0031463674,0.00022913406,0.0005068329,0.0004675275,0.00020832852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030362858,0.0012696553,0.00096879574,0.0029382661,0.0018437075,0.008479187,0.0024684442,0.0032700282,0.007980437],"category_scores_gemma":[0.00759029,0.0012788696,0.0012109218,0.0028390219,0.02077787,0.024334922,0.0034062008,0.008459159,0.0015314529],"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.0000029235023,0.0000035659102,0.000018709175,0.000039913433,0.0000021914927,0.000016033173,0.0002488858,0.00021656534,0.00007213307,0.99653566,0.00049077935,0.0023526032],"study_design_scores_gemma":[0.0000057552716,0.000005336917,0.000024376757,0.000041310348,0.0000043140935,0.00003156874,0.0001338661,0.0010698288,0.0001902902,0.9877835,0.010704198,0.0000057033267],"about_ca_topic_score_codex":0.0019360174,"about_ca_topic_score_gemma":0.0010549271,"teacher_disagreement_score":0.008479187,"about_ca_system_score_codex":0.0030111207,"about_ca_system_score_gemma":0.0018632928,"threshold_uncertainty_score":0.026697218},"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":"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.08238481,0.0031986078,0.55703646,0.012512082,0.0004457296,0.00009749599,0.0016773633,0.0027826822,0.3398648],"genre_scores_gemma":[0.89772785,0.0016282,0.03939025,0.00060866197,0.00033306156,0.00020799093,0.00088891486,0.00031075496,0.0589044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990225,0.00030939485,0.000060427796,0.00019305717,0.00025012565,0.00016458296],"domain_scores_gemma":[0.9979798,0.00068801286,0.00014827256,0.0006803459,0.00031589455,0.00018768989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008797164,0.00079910754,0.0008442743,0.0010966659,0.0018454012,0.008805705,0.0017683416,0.0020410419,0.01992787],"category_scores_gemma":[0.003028834,0.0005762604,0.0009079644,0.0020804934,0.004998351,0.012689748,0.0023015037,0.0024849381,0.002381939],"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.000008179278,0.0000032193984,0.000025080368,0.000009175273,0.0000020691973,0.000016678503,0.000056006633,0.0015059548,0.00008317187,0.99688125,0.00062954193,0.00077974604],"study_design_scores_gemma":[0.00000882521,0.0000039781453,0.000015688815,0.0000090071535,0.00000405143,0.000022950944,0.00004787568,0.007968578,0.00017771813,0.9863284,0.0054087993,0.0000040442537],"about_ca_topic_score_codex":0.0028236317,"about_ca_topic_score_gemma":0.002456989,"teacher_disagreement_score":0.01992787,"about_ca_system_score_codex":0.0030743114,"about_ca_system_score_gemma":0.0016121739,"threshold_uncertainty_score":0.06666535},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020240368,0.0012235323,0.9216663,0.00031049625,0.00042683547,0.00023106865,0.0012970457,0.03894386,0.015660549],"genre_scores_gemma":[0.37332422,0.0013113327,0.5552245,0.00066562044,0.00025529202,0.0008142487,0.0037826507,0.007884094,0.056738112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930716,0.00015017563,0.00006689135,0.00006086021,0.0003414888,0.00007335915],"domain_scores_gemma":[0.9989736,0.00025484682,0.00006958804,0.00032755078,0.0002850107,0.00008946904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264791,0.00074425695,0.0008246719,0.00093483966,0.00058276724,0.0014004442,0.001796905,0.00068875804,0.029270971],"category_scores_gemma":[0.0025330477,0.0005403506,0.000302961,0.0011610703,0.000508725,0.0029921958,0.0015318394,0.0010969051,0.010039645],"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.003659932,0.00013049795,0.0014700944,0.0013599121,0.0001182844,0.00029277874,0.0005995817,0.009389915,0.14331985,0.15055113,0.097583026,0.5915251],"study_design_scores_gemma":[0.00089580513,0.0016574326,0.0017535485,0.00033271487,0.0003715783,0.0017314669,0.0001987456,0.13429603,0.2669429,0.09108543,0.50045127,0.00028307695],"about_ca_topic_score_codex":0.00043098436,"about_ca_topic_score_gemma":0.0005608783,"teacher_disagreement_score":0.029270971,"about_ca_system_score_codex":0.00051931775,"about_ca_system_score_gemma":0.0006764579,"threshold_uncertainty_score":0.09792119},"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":"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.15416467,0.0016818733,0.6230549,0.002036965,0.0004353427,0.00018397864,0.0013528218,0.002915124,0.21417418],"genre_scores_gemma":[0.7730012,0.0012202831,0.15085125,0.0005441541,0.00059655897,0.00022838157,0.0015954486,0.0010045321,0.070958264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793917,0.00043746515,0.00016515549,0.0004738099,0.000687256,0.00029712284],"domain_scores_gemma":[0.9958264,0.0020591922,0.00026026095,0.00082557095,0.0007644354,0.00026419817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015785889,0.0008925156,0.0012116567,0.0024046036,0.002702763,0.0048266468,0.0014845027,0.0015829742,0.015739465],"category_scores_gemma":[0.00550343,0.0011884017,0.0011126153,0.0019489708,0.004205234,0.0095104715,0.003045034,0.0052178977,0.0053798836],"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.00012833854,0.000022883583,0.00014050324,0.000067232686,0.000016371434,0.00011467496,0.0006476022,0.0002656858,0.002845435,0.9823387,0.0013170209,0.012095526],"study_design_scores_gemma":[0.000049037124,0.000033467564,0.00013802061,0.000030395302,0.00002685701,0.00021363334,0.00020777243,0.0008492117,0.0065148682,0.9815694,0.010348382,0.00001889926],"about_ca_topic_score_codex":0.00059717626,"about_ca_topic_score_gemma":0.00078437326,"teacher_disagreement_score":0.015739465,"about_ca_system_score_codex":0.0010880107,"about_ca_system_score_gemma":0.000814896,"threshold_uncertainty_score":0.05265379},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002046433,0.04990285,0.5800869,0.10125713,0.016622638,0.000106175896,0.000636878,0.0027436505,0.24659738],"genre_scores_gemma":[0.11782016,0.060424954,0.5132513,0.057832163,0.023388077,0.0006564965,0.0008238316,0.0039111725,0.22189178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756765,0.001099211,0.0001633157,0.00041807556,0.0005861207,0.00016567507],"domain_scores_gemma":[0.9958104,0.0029046081,0.00012510858,0.0005114841,0.00051026023,0.00013822726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002651378,0.0011920779,0.0013301426,0.003096295,0.003637737,0.00572118,0.002153986,0.0031726437,0.015734954],"category_scores_gemma":[0.00961095,0.00096180465,0.0013263603,0.0039103967,0.016018193,0.016764892,0.003785003,0.009948899,0.008251236],"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.000010599884,0.000010826817,0.000058140904,0.00010023081,0.000004880117,0.000026914082,0.00044264164,0.0002144083,0.00009904562,0.92602676,0.04922432,0.023781206],"study_design_scores_gemma":[0.000005765742,0.000006529866,0.000042527154,0.00010793846,0.0000049950613,0.000057783283,0.000090545764,0.0006305612,0.0002356661,0.6544584,0.34433782,0.000021397442],"about_ca_topic_score_codex":0.0054709115,"about_ca_topic_score_gemma":0.0075634667,"teacher_disagreement_score":0.015734954,"about_ca_system_score_codex":0.0042747427,"about_ca_system_score_gemma":0.0025389763,"threshold_uncertainty_score":0.05263865},"labels":[],"label_agreement":null}]}