{"meta":{"query_hash":"fc6a29a80e19","filters":{"venue":"ISAIM"},"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/fc6a29a80e19","api":"https://metacan.xera.ac/api/v1/cohort?venue=ISAIM"},"results":[{"id":"W2399132844","doi":"","title":"On Resolution Like Proofs of Monotone Self-Dual Functions.","year":2014,"lang":"en","type":"article","venue":"ISAIM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematical proof; Monotone polygon; Mathematics; Resolution (logic); Discrete mathematics; Boolean function; Class (philosophy); Duality (order theory); Dual (grammatical number); Combinatorics; Computer science","score_opus":0.012318350108671175,"score_gpt":0.22259884430323376,"score_spread":0.21028049419456257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399132844","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.043673385,0.00004596715,0.9466968,0.00052262936,0.0016163405,0.00016049776,0.0000033012898,0.00032162448,0.0069594295],"genre_scores_gemma":[0.9032305,0.0000030535691,0.09568059,0.00032047086,0.00023146263,0.000016879498,0.0000031058162,0.000007269397,0.00050671183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916,0.00006099354,0.00015403835,0.00023859732,0.00022876418,0.00015758947],"domain_scores_gemma":[0.99925303,0.00009480472,0.00006440649,0.00048306593,0.000058215643,0.000046481044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025718528,0.00008143891,0.000105618616,0.00010229282,0.00010567447,0.000031861666,0.00030450334,0.000043766697,0.000015142606],"category_scores_gemma":[0.000028178456,0.00007682771,0.000057647107,0.000300829,0.000044427183,0.00014333638,0.00011093013,0.000105252104,0.000089313595],"study_design_candidate":"theoretical_or_conceptual","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.00003072747,0.0006692226,0.00020269104,0.00004102696,0.00004022142,0.0000039799743,0.0011313771,0.0016547046,0.00046480677,0.83563596,0.023950556,0.13617474],"study_design_scores_gemma":[0.0007508508,0.00090393104,0.0051566395,0.00005273164,0.000014072722,0.00001831438,0.00002011533,0.7625808,0.0018291643,0.11751277,0.11084535,0.00031522926],"about_ca_topic_score_codex":0.00002432824,"about_ca_topic_score_gemma":0.0000071584855,"teacher_disagreement_score":0.8595571,"about_ca_system_score_codex":0.000020672482,"about_ca_system_score_gemma":0.000022427983,"threshold_uncertainty_score":0.31329432},"labels":[],"label_agreement":null}]}