{"meta":{"query_hash":"91d39c72941e","filters":{"venue":"Innovations in Graph Theory"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/91d39c72941e","api":"https://metacan.xera.ac/api/v1/cohort?venue=Innovations+in+Graph+Theory"},"results":[{"id":"W4407532593","doi":"10.5802/igt.6","title":"Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs","year":2025,"lang":"en","type":"article","venue":"Innovations in Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Combinatorics; Grid; Mathematics; Tree (set theory); Discrete mathematics; Geometry","score_opus":0.022705901374081027,"score_gpt":0.3215805210370834,"score_spread":0.2988746196630024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407532593","genre_codex":"methods","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.26877445,0.0025962014,0.63923264,0.0017992816,0.00025639625,0.00025941833,0.0027198787,0.0017090696,0.0826526],"genre_scores_gemma":[0.8046446,0.0020704847,0.15569453,0.00081736955,0.00020014375,0.00032717083,0.0054825405,0.00043276054,0.03033035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.00011955067,0.000049115977,0.00023401284,0.00021936935,0.00015433384],"domain_scores_gemma":[0.9985043,0.0005783378,0.00027675848,0.00030953388,0.00017955924,0.0001515323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055567134,0.00054384954,0.0005847171,0.0017336946,0.001047928,0.002394731,0.0010492946,0.00069711695,0.008302223],"category_scores_gemma":[0.0025156587,0.00069719274,0.0012933237,0.0021230187,0.0013783198,0.003538071,0.002086696,0.0015488215,0.0015679462],"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.00013573772,0.00006539685,0.0019232399,0.0002157375,0.000051336698,0.00041982208,0.00045533202,0.015147346,0.0039612805,0.9232997,0.0096172355,0.044707883],"study_design_scores_gemma":[0.000035616857,0.000036223486,0.0014259467,0.000057802823,0.000032683587,0.0003994413,0.00026192603,0.037026465,0.0020312183,0.94403434,0.01464001,0.000018348157],"about_ca_topic_score_codex":0.0037605928,"about_ca_topic_score_gemma":0.0034618226,"teacher_disagreement_score":0.008302223,"about_ca_system_score_codex":0.0013010919,"about_ca_system_score_gemma":0.0005351739,"threshold_uncertainty_score":0.027773678},"labels":[],"label_agreement":null},{"id":"W4414243250","doi":"10.5802/igt.10","title":"Product Structure of Graph Classes with Strongly Sublinear Separators","year":2025,"lang":"lv","type":"article","venue":"Innovations in Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford; Grantová Agentura České Republiky; Merton College, University of Oxford","keywords":"Sublinear function; Treewidth; Graph; Bounded function; Line graph; Voltage graph; Graph property; Graph factorization; Clique-width; Distance-hereditary graph","score_opus":0.015296409847241087,"score_gpt":0.3071461678948458,"score_spread":0.2918497580476047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414243250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8165065,0.00016233724,0.16640364,0.0003699129,0.000024159048,0.000059919974,0.00079019915,0.0005995413,0.015083831],"genre_scores_gemma":[0.969068,0.00011955976,0.020486347,0.000083470855,0.000040944884,0.00008553274,0.0014779549,0.0001798725,0.00845844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986935,0.00016688225,0.00007580173,0.00052535045,0.00029874052,0.00023976789],"domain_scores_gemma":[0.9949201,0.0016998436,0.0010479761,0.00083673216,0.0007163365,0.00077898655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007212692,0.00050594314,0.0005929673,0.0014008752,0.0012772547,0.0022290524,0.0010023009,0.00063754385,0.009617088],"category_scores_gemma":[0.0029435458,0.0006506376,0.0009942799,0.0012589266,0.0024274983,0.0053454386,0.0019489615,0.0012225086,0.000912862],"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.000262592,0.00011348324,0.009975062,0.00014065472,0.00006687401,0.00045349184,0.0013173115,0.0072584166,0.009107008,0.9544336,0.001888193,0.014983354],"study_design_scores_gemma":[0.00008235178,0.00021318441,0.0062969164,0.000045129953,0.00011106697,0.0009116366,0.0007552766,0.07141559,0.017246798,0.8898596,0.013006336,0.000055938166],"about_ca_topic_score_codex":0.0013511028,"about_ca_topic_score_gemma":0.0014335348,"teacher_disagreement_score":0.009617088,"about_ca_system_score_codex":0.0014084821,"about_ca_system_score_gemma":0.0005327074,"threshold_uncertainty_score":0.032172382},"labels":[],"label_agreement":null}]}