{"meta":{"query_hash":"e69270202e72","filters":{"venue":"Theory and Applications of Graphs"},"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/e69270202e72","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010245610522857105,"score_gpt":0.29468773347360777,"score_spread":0.28444212295075066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583569053","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.05357304,0.00004682157,0.9374649,0.00034958165,0.000014278009,0.00038168105,0.0000032933197,0.000037346013,0.008129039],"genre_scores_gemma":[0.9790441,0.000058171918,0.020691155,0.00002968619,0.000007759455,0.00008554532,0.0000023832354,0.0000024336405,0.00007877694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999508,0.00006919441,0.000121087374,0.00014917464,0.00007462151,0.0000778738],"domain_scores_gemma":[0.99926966,0.000042847947,0.00009188773,0.0005045841,0.000049176473,0.0000418097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075761863,0.000044297918,0.0000631046,0.000108183136,0.00020324398,0.000104480045,0.0006058008,0.000025751984,0.000006140773],"category_scores_gemma":[0.000011345965,0.000040664083,0.000014577041,0.000101587626,0.00013021783,0.0005010501,0.00007037477,0.00005266275,0.0000023015195],"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.000004958884,0.00006613634,0.0009890167,0.0000073580036,0.0000016871027,1.1614334e-7,0.00023353088,0.00006107076,0.00075523625,0.92345953,0.0000035384287,0.07441779],"study_design_scores_gemma":[0.00028615093,0.000046662306,0.011864894,0.000012957166,0.0000017328086,0.0000019615798,0.000037050628,0.007537031,0.0017537646,0.9780853,0.00029986803,0.000072622075],"about_ca_topic_score_codex":0.000014330936,"about_ca_topic_score_gemma":0.000006737117,"teacher_disagreement_score":0.92547107,"about_ca_system_score_codex":0.000003182567,"about_ca_system_score_gemma":0.000013341647,"threshold_uncertainty_score":0.16582331},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007929184231454549,"score_gpt":0.24439009584812538,"score_spread":0.23646091161667082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894691817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51173127,0.00068199536,0.4816507,0.0002766317,0.000040138108,0.000249902,0.0000206512,0.00006251851,0.005286174],"genre_scores_gemma":[0.9894386,0.00006843683,0.010422342,0.000027094826,0.0000031783154,0.000011036965,0.0000016394941,0.000003314478,0.000024364363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999346,0.000055910892,0.0002611088,0.00016375272,0.000088187044,0.00008504835],"domain_scores_gemma":[0.9989959,0.00014130196,0.00016314417,0.0005128945,0.00014762771,0.00003912714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049493957,0.00006731082,0.00014851024,0.00016981499,0.00007200429,0.000006378019,0.00034511718,0.000026608333,0.000011086989],"category_scores_gemma":[0.00001693015,0.000055490545,0.000056612495,0.0005345831,0.0007640695,0.00007401325,0.000095254036,0.000045376182,0.000003030181],"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.000006551735,0.000118436066,0.00021825345,0.000019391158,0.000013997438,3.2941692e-8,0.0002690725,0.0000023694915,0.02584802,0.96598154,0.000027473,0.007494858],"study_design_scores_gemma":[0.00009262134,0.000075315955,0.0008156845,0.00002884775,0.000012481298,0.0000024777994,0.00008881582,0.00020728889,0.1180265,0.88052285,0.000075407865,0.00005170725],"about_ca_topic_score_codex":0.00001857812,"about_ca_topic_score_gemma":0.0000017047753,"teacher_disagreement_score":0.47770733,"about_ca_system_score_codex":0.0000011417264,"about_ca_system_score_gemma":0.00001668572,"threshold_uncertainty_score":0.28152457},"labels":[],"label_agreement":null}]}