{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"e69270202e72","filters":{"venue":"Theory and Applications of Graphs"}},"results":[{"id":"W2583569053","doi":"10.20429/tag.2017.040102","title":"An Eternal Domination Problem in Grids","year":2017,"lang":"en","type":"article","venue":"Theory and Applications of Graphs","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mount Allison University","keywords":"Combinatorics; Vertex (graph theory); Guard (computer science); Graph; Eviction; Mathematics; Sequence (biology); Discrete mathematics; Upper and lower bounds; Computer science; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.01024561052285711,"gpt":0.2946877334736078,"spread":0.2844421229507507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007576186,0.00004429792,0.0000631046,0.0001081831,0.000203244,0.00010448,0.0006058008,0.00002575198,0.000006140773],"category_scores_gemma":[0.00001134596,0.00004066408,0.00001457704,0.0001015876,0.0001302178,0.0005010501,0.00007037477,0.00005266275,0.00000230152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003182567,"about_ca_system_score_gemma":0.00001334165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001433094,"about_ca_topic_score_gemma":0.000006737117,"domain_scores_codex":[0.999508,0.00006919441,0.0001210874,0.0001491746,0.00007462151,0.0000778738],"domain_scores_gemma":[0.9992697,0.00004284795,0.00009188773,0.0005045841,0.00004917647,0.0000418097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004958884,0.00006613634,0.0009890167,0.000007358004,0.000001687103,1.161433e-7,0.0002335309,0.00006107076,0.0007552363,0.9234595,0.000003538429,0.07441779],"study_design_scores_gemma":[0.0002861509,0.00004666231,0.01186489,0.00001295717,0.000001732809,0.00000196158,0.00003705063,0.007537031,0.001753765,0.9780853,0.000299868,0.00007262208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05357304,0.00004682157,0.9374649,0.0003495816,0.00001427801,0.000381681,0.00000329332,0.00003734601,0.008129039],"genre_scores_gemma":[0.9790441,0.00005817192,0.02069115,0.00002968619,0.000007759455,0.00008554532,0.000002383235,0.00000243364,0.00007877694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9254711,"threshold_uncertainty_score":0.1658233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2894691817","doi":"10.20429/tag.2018.050203","title":"Integer-antimagic spectra of disjoint unions of cycles","year":2018,"lang":"en","type":"article","venue":"Theory and Applications of Graphs","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Integer (computer science); Disjoint sets; Injective function; Simple graph; Abelian group; Vertex (graph theory); Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007929184231454549,"gpt":0.2443900958481254,"spread":0.2364609116166708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949396,0.00006731082,0.0001485102,0.000169815,0.00007200429,0.000006378019,0.0003451172,0.00002660833,0.00001108699],"category_scores_gemma":[0.00001693015,0.00005549055,0.00005661249,0.0005345831,0.0007640695,0.00007401325,0.00009525404,0.00004537618,0.000003030181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001141726,"about_ca_system_score_gemma":0.00001668572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001857812,"about_ca_topic_score_gemma":0.000001704775,"domain_scores_codex":[0.999346,0.00005591089,0.0002611088,0.0001637527,0.00008818704,0.00008504835],"domain_scores_gemma":[0.9989959,0.000141302,0.0001631442,0.0005128945,0.0001476277,0.00003912714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006551735,0.0001184361,0.0002182535,0.00001939116,0.00001399744,3.294169e-8,0.0002690725,0.000002369492,0.02584802,0.9659815,0.000027473,0.007494858],"study_design_scores_gemma":[0.00009262134,0.00007531595,0.0008156845,0.00002884775,0.0000124813,0.000002477799,0.00008881582,0.0002072889,0.1180265,0.8805228,0.00007540786,0.00005170725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5117313,0.0006819954,0.4816507,0.0002766317,0.00004013811,0.000249902,0.0000206512,0.00006251851,0.005286174],"genre_scores_gemma":[0.9894386,0.00006843683,0.01042234,0.00002709483,0.000003178315,0.00001103696,0.000001639494,0.000003314478,0.00002436436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4777073,"threshold_uncertainty_score":0.2815246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}