{"meta":{"query_hash":"9aed6a728523","filters":{"venue":"Theorem Proving in Higher Order Logics"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/9aed6a728523","api":"https://metacan.xera.ac/api/v1/cohort?venue=Theorem+Proving+in+Higher+Order+Logics"},"results":[{"id":"W2913147510","doi":"","title":"Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics","year":2008,"lang":"en","type":"article","venue":"Theorem Proving in Higher Order Logics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Order (exchange); Automated theorem proving; Computer science; Calculus (dental); Mathematical economics; Mathematics; Discrete mathematics; Theoretical computer science; Business; Medicine","score_opus":0.056843874740344816,"score_gpt":0.25342045705631266,"score_spread":0.19657658231596786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913147510","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020300653,0.07539285,0.63546425,0.024203205,0.049659457,0.0005486801,0.0012767765,0.0030156851,0.19013844],"genre_scores_gemma":[0.16636431,0.061794907,0.47455302,0.0073288223,0.032090437,0.00066974945,0.008558013,0.002872552,0.24576823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99477684,0.0019251889,0.00047667834,0.00086530455,0.0014848494,0.00047112646],"domain_scores_gemma":[0.9884115,0.0063470122,0.00023300848,0.0018879701,0.0023437098,0.0007767791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011100207,0.0014894841,0.002771539,0.0022126662,0.0018795559,0.0100367125,0.0031232433,0.0020296392,0.04816966],"category_scores_gemma":[0.010647211,0.0011647614,0.0024551677,0.0028414084,0.0038659007,0.010029702,0.0038750945,0.006509716,0.0070613143],"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.0011636963,0.000829126,0.0014630583,0.0011837026,0.00042469185,0.0004861152,0.0013121162,0.0059772837,0.005078945,0.24695884,0.30086005,0.43426242],"study_design_scores_gemma":[0.0002660047,0.00018710291,0.0013559527,0.0005886171,0.00022806705,0.00070054975,0.0002968832,0.031698722,0.0041384483,0.24592872,0.71452,0.00009098272],"about_ca_topic_score_codex":0.005493738,"about_ca_topic_score_gemma":0.0056158146,"teacher_disagreement_score":0.04816966,"about_ca_system_score_codex":0.004125696,"about_ca_system_score_gemma":0.004646645,"threshold_uncertainty_score":0.1611436},"labels":[],"label_agreement":null}]}