{"meta":{"query_hash":"ae37a8753028","filters":{"venue":"Texts in theoretical computer science"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/ae37a8753028","api":"https://metacan.xera.ac/api/v1/cohort?venue=Texts+in+theoretical+computer+science"},"results":[{"id":"W1520950860","doi":"10.1007/978-3-662-04943-3","title":"Boolean Functions and Computation Models","year":2002,"lang":"en","type":"book","venue":"Texts in theoretical computer science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computation; Boolean function; Theoretical computer science; Algorithm","score_opus":0.01847183979169236,"score_gpt":0.24875104320273997,"score_spread":0.2302792034110476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520950860","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004789965,0.03544634,0.091551386,0.008056113,0.001438644,0.00006737935,0.0005566136,0.00045918985,0.8576343],"genre_scores_gemma":[0.21715206,0.042684026,0.038323373,0.0027723801,0.0033637711,0.0005200511,0.0017351403,0.0005083666,0.69294083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997253,0.000057200345,0.000012102853,0.000055220382,0.00012224964,0.000027872862],"domain_scores_gemma":[0.99969363,0.00017204073,0.000013597028,0.00005468582,0.000045508674,0.000020614874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003440708,0.0012993723,0.0009838571,0.001276826,0.001180793,0.003784638,0.0010226639,0.0009259414,0.024547797],"category_scores_gemma":[0.0010774513,0.0005127784,0.00070406037,0.0027896704,0.002829513,0.0073591345,0.00077716156,0.0025743516,0.0053855944],"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.0000035161675,0.0000077999175,0.000011272411,0.000036605674,0.0000021388125,0.000007942811,0.000057922647,0.0004212793,0.000078215526,0.9724478,0.015856782,0.011068778],"study_design_scores_gemma":[0.0000039157603,0.0000037829557,0.000029385099,0.00003285879,0.000003989505,0.000025296897,0.000026202806,0.0010057974,0.000083341394,0.9246606,0.07412153,0.0000033375586],"about_ca_topic_score_codex":0.002359113,"about_ca_topic_score_gemma":0.0024123036,"teacher_disagreement_score":0.024547797,"about_ca_system_score_codex":0.0026802334,"about_ca_system_score_gemma":0.0012423369,"threshold_uncertainty_score":0.08212054},"labels":[],"label_agreement":null},{"id":"W2277411487","doi":"10.1007/978-3-662-04943-3_5","title":"Propositional Proof Systems","year":2002,"lang":"en","type":"book-chapter","venue":"Texts in theoretical computer science","topic":"Logic, programming, and type systems","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":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.017701094077095997,"score_gpt":0.23723393093416137,"score_spread":0.21953283685706537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277411487","genre_codex":"other","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.0029791188,0.012338282,0.24785353,0.0055497363,0.00094986043,0.000105566876,0.0011543958,0.0019284809,0.7271411],"genre_scores_gemma":[0.24316436,0.01724718,0.16191825,0.0030985249,0.0016787951,0.0004108123,0.0039377958,0.0013087324,0.5672355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926406,0.00021289366,0.000044638557,0.00013779914,0.00028484248,0.00005572896],"domain_scores_gemma":[0.9990289,0.0005094502,0.000035760986,0.00018954094,0.00019551994,0.00004085895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725736,0.0008129075,0.0005549129,0.0013841592,0.0013095072,0.004748128,0.0011476913,0.0009766909,0.046072822],"category_scores_gemma":[0.0028238788,0.0006765282,0.0005549703,0.0015109759,0.0021290781,0.0052692383,0.0015015483,0.0032981467,0.011935873],"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.0000071822506,0.000013228624,0.00003331415,0.000068402696,0.0000055814517,0.000014326229,0.00012693636,0.0002559128,0.00019404407,0.93875134,0.02664852,0.033881225],"study_design_scores_gemma":[0.000011644656,0.000005570695,0.00006240908,0.000069359274,0.0000075492635,0.000053124702,0.00003646624,0.0010223612,0.00046904967,0.809259,0.18899828,0.00000519829],"about_ca_topic_score_codex":0.0008472783,"about_ca_topic_score_gemma":0.0009863798,"teacher_disagreement_score":0.046072822,"about_ca_system_score_codex":0.0019623758,"about_ca_system_score_gemma":0.0011188351,"threshold_uncertainty_score":0.15412891},"labels":[],"label_agreement":null},{"id":"W645248096","doi":"10.1007/978-3-662-04943-3_6","title":"Machine Models and Function Algebras","year":2002,"lang":"en","type":"book-chapter","venue":"Texts in theoretical computer science","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"Function (biology); Computer science; Biology","score_opus":0.06804399895383646,"score_gpt":0.33925546194736167,"score_spread":0.2712114629935252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W645248096","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061734924,0.033782516,0.32039967,0.007052394,0.0016897747,0.000049258582,0.0005479275,0.0009277082,0.6293772],"genre_scores_gemma":[0.24133873,0.027631972,0.068033226,0.0022145424,0.002963292,0.00030364413,0.0012245135,0.0006181767,0.65567195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974984,0.00006810214,0.00000991341,0.000048906022,0.000101502665,0.000021722954],"domain_scores_gemma":[0.99971396,0.00016219004,0.000013261705,0.000055964312,0.00004192345,0.000012631414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038932357,0.001186658,0.00103197,0.0011119689,0.0008636062,0.0023799469,0.0008139668,0.0010904549,0.022047732],"category_scores_gemma":[0.0010837534,0.00045029586,0.0005990606,0.0018939873,0.0018765857,0.0050291154,0.0006968845,0.002212445,0.0059024733],"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.0000025629993,0.000007301473,0.000015600157,0.000036942776,0.0000032431,0.000009668416,0.00006307053,0.0010509324,0.0001084517,0.9678534,0.014411375,0.01643743],"study_design_scores_gemma":[0.0000019307731,0.000003998771,0.00003107871,0.000025399424,0.0000029507391,0.000029911973,0.000015999154,0.0024687725,0.00013311037,0.9289184,0.06836451,0.0000039382808],"about_ca_topic_score_codex":0.0010213602,"about_ca_topic_score_gemma":0.0010858678,"teacher_disagreement_score":0.022047732,"about_ca_system_score_codex":0.0013698838,"about_ca_system_score_gemma":0.0006416081,"threshold_uncertainty_score":0.07375699},"labels":[],"label_agreement":null}]}