{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"87d4c8336af1","filters":{"venue":"LISP and Symbolic Computation"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Linguistics; Epistemology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.02211111425462539,"gpt":0.2477722689783965,"spread":0.2256611547237711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001386146,0.00007056689,0.0001270536,0.00004733393,0.00005312359,0.00007057326,0.000141939,0.00003978062,0.00001494546],"category_scores_gemma":[0.000002434035,0.00006154481,0.0000299736,0.0001279533,0.00002295178,0.0002886593,0.00002343745,0.00004504084,0.00001605782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006419645,"about_ca_system_score_gemma":0.00001692594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001389568,"about_ca_topic_score_gemma":0.000004468872,"domain_scores_codex":[0.9993822,0.0000247604,0.0001770626,0.0001699195,0.0001345672,0.0001114791],"domain_scores_gemma":[0.9996932,0.00003218818,0.0000597258,0.0001300862,0.00003793915,0.00004692547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004635677,0.00006096538,0.0002305589,0.00004628908,0.00001306681,0.000005184838,0.003734556,0.01124594,0.0001063415,0.2243058,0.0001612992,0.7600853],"study_design_scores_gemma":[0.0005020206,0.0001097949,0.02416269,0.00001027089,0.000006872654,0.00002321876,0.0000613813,0.8048131,0.0001431807,0.1670995,0.00285208,0.0002158175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3606696,0.0003411786,0.6206095,0.00006838431,0.0001547414,0.0001285809,5.58776e-7,0.00009421405,0.01793334],"genre_scores_gemma":[0.9980028,0.0000262469,0.001692339,0.00003690592,0.00004799782,0.000003209911,0.000003365986,0.00000350559,0.0001836546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7935672,"threshold_uncertainty_score":0.2509724,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01226304771391825,"gpt":0.27104388238119,"spread":0.2587808346672718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009860146,0.00006238419,0.0001093005,0.00006758419,0.00007943692,0.00001753639,0.00006915972,0.00002445758,0.000004260881],"category_scores_gemma":[0.0000181546,0.00005783168,0.00002051316,0.0001576169,0.00003265313,0.0005464058,0.0000657237,0.00004462414,0.00001843795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001133714,"about_ca_system_score_gemma":0.00001949584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000240536,"about_ca_topic_score_gemma":0.00001386626,"domain_scores_codex":[0.9994254,0.00003223535,0.0001944371,0.0001562255,0.0001053469,0.00008643208],"domain_scores_gemma":[0.9996108,0.00005199508,0.00009139429,0.0001403234,0.00006450343,0.00004096532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004503441,0.00003198198,0.0007989852,0.00001771552,0.00001019044,0.000001045751,0.002691489,0.002604186,0.0004028465,0.7846484,0.0005998646,0.2081888],"study_design_scores_gemma":[0.001628216,0.0002516441,0.09556142,0.0002229621,0.00002344814,0.0001065481,0.0005904368,0.7376926,0.002442605,0.02961494,0.1312249,0.0006402973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08065871,0.0001742468,0.9153633,0.0007127807,0.00008586214,0.00007821304,0.000007347263,0.00005448958,0.00286507],"genre_scores_gemma":[0.8366459,0.00001164271,0.1629895,0.00007179481,0.00006106985,0.000003252961,0.00001169419,0.000003080925,0.0002020516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7559872,"threshold_uncertainty_score":0.2358308,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01446104556126964,"gpt":0.2639002782903432,"spread":0.2494392327290735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003908286,0.000162368,0.0002961541,0.0001782409,0.0001536783,0.0002365402,0.0002761066,0.00008265163,6.410542e-7],"category_scores_gemma":[0.00001526798,0.0001539837,0.00008073828,0.0001918551,0.00002444678,0.0004289431,0.00004568594,0.00007307134,0.00001366853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009600079,"about_ca_system_score_gemma":0.00004440443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000348637,"about_ca_topic_score_gemma":0.000005660906,"domain_scores_codex":[0.998826,0.00008116302,0.0003389129,0.0003434635,0.0001631299,0.0002472786],"domain_scores_gemma":[0.9992294,0.0001898102,0.0001441587,0.0002283509,0.0001123321,0.00009596656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001925197,0.0003561975,0.002533974,0.001438319,0.0003740356,0.0000220855,0.01315402,0.004911689,0.09543225,0.4420194,0.04987057,0.3896949],"study_design_scores_gemma":[0.001440907,0.0001409769,0.001134756,0.0001433418,0.00001318028,0.00007915756,0.0001206974,0.9827495,0.005507709,0.001274557,0.007079342,0.0003158343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05771049,0.0003962116,0.9382672,0.0006467038,0.0001915973,0.0007597035,0.000004682397,0.0006513417,0.001372104],"genre_scores_gemma":[0.9105362,0.000005153296,0.08892948,0.0001806974,0.0001986152,0.00004611231,0.00000608894,0.0000123887,0.00008528818],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778379,"threshold_uncertainty_score":0.6279274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Programming language; Correctness; Computer science; Equivalence (formal languages); Linguistics; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.01092112397627551,"gpt":0.3389448896196716,"spread":0.328023765643396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000179835,0.0001835754,0.0002293648,0.00008933253,0.0001421921,0.0002736833,0.0003349628,0.00005657802,0.0002712013],"category_scores_gemma":[0.00001391336,0.0001860691,0.00004851473,0.00036827,0.00004281453,0.0003958505,0.0001477043,0.00008858589,0.0001198238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004849519,"about_ca_system_score_gemma":0.00004128509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106423,"about_ca_topic_score_gemma":0.00009685591,"domain_scores_codex":[0.998428,0.0001420427,0.0003227416,0.0005784351,0.0002473019,0.0002815182],"domain_scores_gemma":[0.9991965,0.0001816258,0.00006409212,0.0003046143,0.00007101217,0.000182142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006346283,0.00003584835,0.0006257517,0.00000445338,0.0000126944,0.000006109534,0.02008862,0.001448684,0.0003183201,0.001826153,0.0005138618,0.9751132],"study_design_scores_gemma":[0.003984424,0.0007497821,0.3256418,0.00006360262,0.00004750237,0.00005313449,0.004195723,0.5973332,0.003458885,0.04823986,0.01475044,0.001481692],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7540744,0.0001310139,0.2434273,0.0008177311,0.0002675774,0.0003207298,0.00001701904,0.0002013628,0.0007428489],"genre_scores_gemma":[0.9663894,0.00001405235,0.03219101,0.0009083012,0.000284986,0.00002287552,0.00006564948,0.000009964124,0.000113747],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9736314,"threshold_uncertainty_score":0.7587677,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Volume (thermodynamics); Art; History; Computer science; Advertising; Business; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01222945550472591,"gpt":0.2638016603207344,"spread":0.2515722048160085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002578377,0.00007417253,0.0001319506,0.0001014543,0.00007641129,0.0001055617,0.0001406024,0.00003452644,0.000001300884],"category_scores_gemma":[0.00001753628,0.00006613395,0.00001876013,0.0002473027,0.00001024462,0.0002616844,0.00002408341,0.0000444385,0.000005729212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001173424,"about_ca_system_score_gemma":0.00001236617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003947977,"about_ca_topic_score_gemma":0.000005674043,"domain_scores_codex":[0.9992607,0.00005446362,0.0001817427,0.0002419891,0.000132553,0.0001285713],"domain_scores_gemma":[0.9995933,0.00001801624,0.00007716191,0.0001634763,0.00007632408,0.00007176593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008521905,0.0001011826,0.001987596,0.00002467565,0.00000908581,0.000002342279,0.006164511,0.00127544,0.004125853,0.3487354,0.0009064592,0.636659],"study_design_scores_gemma":[0.002163627,0.004127834,0.2943793,0.0000340031,0.00004552808,0.0001727269,0.0007907471,0.4405216,0.009890244,0.213639,0.03302136,0.001214063],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2743134,0.00006329388,0.7224728,0.002033453,0.0003726604,0.0001556706,2.754796e-7,0.0001149465,0.0004734193],"genre_scores_gemma":[0.9918039,0.000002526765,0.007543978,0.0001870011,0.0004111932,0.000002449321,0.000007104695,0.000002767872,0.00003906509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7174905,"threshold_uncertainty_score":0.2696864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}