{"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":"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.49056146,0.0009771235,0.4835359,0.0018946783,0.00013601712,0.00018712791,0.00084953924,0.0003659408,0.02149215],"genre_scores_gemma":[0.93196356,0.00040716233,0.055885248,0.00019516329,0.00007237422,0.00011071751,0.00044465132,0.00006949277,0.010851591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991855,0.00025492886,0.00004550368,0.0002034737,0.00011109001,0.00019949363],"domain_scores_gemma":[0.9971641,0.0017784898,0.0003118612,0.00029377424,0.00016888561,0.00028279462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095683476,0.00058455823,0.0007021222,0.00046000764,0.001014875,0.0012912226,0.0012841278,0.00077147037,0.0031868627],"category_scores_gemma":[0.0035787926,0.00028422757,0.00050969137,0.00082514435,0.0012189205,0.0024784787,0.0013068962,0.00086152356,0.00021934268],"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.00097218016,0.00022882792,0.0046134586,0.00032031396,0.00014187931,0.00074722484,0.00068910525,0.5912291,0.009802051,0.31650615,0.0093731,0.065376654],"study_design_scores_gemma":[0.0001317828,0.00012557175,0.001106587,0.000025066613,0.000029401634,0.0003897196,0.00027209782,0.72277725,0.002626118,0.26351556,0.00897497,0.000025822732],"about_ca_topic_score_codex":0.003861584,"about_ca_topic_score_gemma":0.0030890852,"teacher_disagreement_score":0.003861584,"about_ca_system_score_codex":0.0010989164,"about_ca_system_score_gemma":0.00060366595,"threshold_uncertainty_score":0.010661066},"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":"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.8995357,0.0007396573,0.057845075,0.00042381175,0.00008244885,0.00003423244,0.00033258117,0.00018536509,0.040821046],"genre_scores_gemma":[0.98497576,0.00029554692,0.0112578105,0.000074901836,0.000083741164,0.000043748474,0.00020599646,0.000042016363,0.0030205613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993622,0.00010713749,0.00005415625,0.0001830294,0.00016745568,0.00012600199],"domain_scores_gemma":[0.99857354,0.0006332478,0.00027188493,0.00009753316,0.00013390223,0.00028982275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041159004,0.00048283086,0.00045976212,0.003227814,0.0017672629,0.0025425425,0.0007419184,0.0006872542,0.0049413764],"category_scores_gemma":[0.0018990068,0.00041198925,0.0004535446,0.0012627862,0.0020589493,0.003188996,0.0017883868,0.0007905832,0.00046776413],"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.00006647747,0.000029292725,0.001200602,0.00005481852,0.000011476174,0.00014221433,0.00052608666,0.0019340456,0.003541967,0.98353934,0.0008842732,0.008069352],"study_design_scores_gemma":[0.000018596986,0.000029424098,0.0010561164,0.000032394364,0.000014230573,0.00037991992,0.00058087707,0.013022674,0.003474936,0.9773702,0.003999417,0.000021115107],"about_ca_topic_score_codex":0.00057396386,"about_ca_topic_score_gemma":0.0005671078,"teacher_disagreement_score":0.0049413764,"about_ca_system_score_codex":0.001121772,"about_ca_system_score_gemma":0.00036741857,"threshold_uncertainty_score":0.016530514},"labels":[],"label_agreement":null}]}