{"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":"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.00006346917,0.00026899448,0.8217499,0.0002519041,0.00056404184,0.00025112697,0.000003654663,0.00018153898,0.17666537],"genre_scores_gemma":[0.48054552,0.00015098255,0.472649,0.001961361,0.000678231,0.000041362095,0.00002003597,0.00008090731,0.043872587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996669,0.000075985634,0.00045297926,0.0013749193,0.00077592523,0.00065119425],"domain_scores_gemma":[0.9983494,0.00031564684,0.00014350614,0.0007600967,0.0001456557,0.00028566603],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007220143,0.00039194437,0.00042306609,0.00056421454,0.00037475993,0.0004738712,0.0018371647,0.00020023313,0.00003345945],"category_scores_gemma":[0.000031814136,0.00035016352,0.00007340513,0.0007224746,0.0029288563,0.0011080931,0.0014535408,0.00064020103,0.00011058991],"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.0000016891125,0.000032971493,0.0000012624342,0.000013619865,0.0000025342347,0.000028422226,0.00022543786,0.0041875322,0.0000018212559,0.866866,0.0006791281,0.1279596],"study_design_scores_gemma":[0.00011973611,0.000086337895,0.0000218834,0.000059882525,0.0000031306947,0.000049894126,0.0000011406295,0.48079604,0.0000024090903,0.51818967,0.0004345684,0.00023534658],"about_ca_topic_score_codex":7.703746e-7,"about_ca_topic_score_gemma":0.0000011882452,"teacher_disagreement_score":0.48048207,"about_ca_system_score_codex":0.00022100979,"about_ca_system_score_gemma":0.000204561,"threshold_uncertainty_score":0.99989504},"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":"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.0000036846943,0.0004238597,0.5886329,0.00017332601,0.0017565732,0.00066920416,0.0000018100898,0.00020375343,0.4081349],"genre_scores_gemma":[0.9205648,0.000028389546,0.02959723,0.00031106002,0.0011806496,0.00007822247,0.000007523233,0.00006620015,0.04816593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950374,0.00008994492,0.00073945493,0.0015728575,0.001694995,0.00086534885],"domain_scores_gemma":[0.9974939,0.00018394327,0.0002708477,0.0013925127,0.0003253367,0.00033342413],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017247936,0.00051978097,0.00060811173,0.00056202954,0.0003299992,0.0010482483,0.0040262844,0.0003378919,0.00015571836],"category_scores_gemma":[0.000036754358,0.00041558722,0.00015112429,0.0004172027,0.0031446067,0.0005576688,0.0014117209,0.00068940694,0.00061803876],"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.000002564905,0.00005915255,0.000005482942,0.000060057286,0.00000822716,0.0001399421,0.0001768622,0.00010584481,0.0000022296717,0.97727185,0.00025446125,0.021913296],"study_design_scores_gemma":[0.00021797644,0.0002971468,0.000016751317,0.00012171846,0.000007009319,0.00027186374,8.7852425e-7,0.21070601,0.000026663345,0.77229124,0.015433787,0.0006089698],"about_ca_topic_score_codex":0.000005159094,"about_ca_topic_score_gemma":9.576531e-7,"teacher_disagreement_score":0.92056113,"about_ca_system_score_codex":0.00029698113,"about_ca_system_score_gemma":0.0002599287,"threshold_uncertainty_score":0.99998873},"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":"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.000112710826,0.00018769791,0.57208365,0.0004166365,0.00014562141,0.0002639628,0.000009413289,0.000087899076,0.4266924],"genre_scores_gemma":[0.95679194,0.00008267192,0.016998736,0.0007751745,0.00014429352,0.000012392427,0.000003108616,0.000025527333,0.025166176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964685,0.0000377339,0.0006540495,0.0010729445,0.0014816227,0.00028514068],"domain_scores_gemma":[0.9976798,0.00076915225,0.00017390097,0.0009290795,0.0002569868,0.00019107475],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002381042,0.00024956526,0.00034332243,0.0006418134,0.00025702934,0.00042586715,0.001214927,0.00018731912,0.0017715198],"category_scores_gemma":[0.00012172127,0.00018771751,0.000075297496,0.00042193307,0.0028592614,0.00036108715,0.00069451495,0.0003722381,0.00024127492],"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.0000037182033,0.000010829902,0.000007769045,0.0000011001991,9.932104e-7,0.0000018100989,0.0000392514,0.00029215997,0.0000015182264,0.80893105,0.00022346154,0.19048631],"study_design_scores_gemma":[0.00006531703,0.000047264195,0.00007534753,0.000021378379,0.000003608033,0.000007036634,5.930583e-7,0.36801735,0.0000074037757,0.6240133,0.007602209,0.00013916918],"about_ca_topic_score_codex":0.0000019773363,"about_ca_topic_score_gemma":0.0000011935432,"teacher_disagreement_score":0.9566792,"about_ca_system_score_codex":0.000057653557,"about_ca_system_score_gemma":0.000040603943,"threshold_uncertainty_score":0.9998544},"labels":[],"label_agreement":null}]}