{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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","author_layer_release":"2026-06-26"},"query_hash":"a64fad3cfbdd","filters":{"venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)"}},"results":[{"id":"W2963436343","doi":"10.2298/aadm151109021k","title":"Protecting a graph with mobile guards","year":2016,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Dominating set; Theoretical computer science; Discrete mathematics; Computer science; Computer security","authors":[{"name":"William F. Klostermeyer","is_ca":false},{"name":"Christina M. Mynhardt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009525591607780442,"gpt":0.2344880124442836,"spread":0.2249624208365032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871229,0.001108134,0.001030625,0.0006766846,0.001086234,0.001395796,0.001450736,0.001029654,0.00208201],"category_scores_gemma":[0.003449045,0.0004325018,0.0008764868,0.0008453111,0.001443627,0.003366992,0.002692422,0.001127598,0.0005646885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078363,"about_ca_system_score_gemma":0.0009006659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00134951,"about_ca_topic_score_gemma":0.001414203,"domain_scores_codex":[0.9990686,0.0002329084,0.00005461646,0.0002586645,0.0001506353,0.0002346225],"domain_scores_gemma":[0.9968655,0.001325548,0.0004009694,0.001044139,0.0001295442,0.0002343376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001055842,0.0002234012,0.003418286,0.000939584,0.0002295424,0.001123801,0.000873561,0.4833091,0.05563513,0.3004855,0.009408603,0.1432977],"study_design_scores_gemma":[0.00009221181,0.0004708618,0.001209755,0.00012378,0.0001438381,0.001419719,0.0003928435,0.6631553,0.01967317,0.2979448,0.01531946,0.00005423272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.26006,0.001779427,0.7230733,0.0007902184,0.0001751513,0.0001688932,0.0006378728,0.001190988,0.01212417],"genre_scores_gemma":[0.9227216,0.0009726155,0.07273962,0.0001440254,0.00005681827,0.00007654694,0.0004557577,0.00009140559,0.00274156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00208201,"threshold_uncertainty_score":0.007824123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963356118","doi":"10.2298/fil1601169a","title":"On the domination polynomials of friendship graphs","year":2016,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Limiting; Friendship graph; Voltage graph; Line graph","authors":[{"name":"‎Saeid Alikhani","is_ca":false},{"name":"Jason I. Brown","is_ca":true},{"name":"Somayeh Jahari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01464089567584804,"gpt":0.2417094565578392,"spread":0.2270685608819911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383275,0.0003223025,0.0002930139,0.00155683,0.0009665167,0.000935865,0.0005375376,0.0003095581,0.003327842],"category_scores_gemma":[0.004914669,0.0001889601,0.0004042454,0.00149739,0.001436625,0.001497208,0.0008804628,0.00085593,0.0003412672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001312544,"about_ca_system_score_gemma":0.000441734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004364823,"about_ca_topic_score_gemma":0.003358351,"domain_scores_codex":[0.9995793,0.00008999776,0.000008826147,0.0000705386,0.0001047676,0.0001466532],"domain_scores_gemma":[0.9974779,0.001641793,0.0002490625,0.0001441195,0.0002332069,0.0002537942],"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.0002650539,0.00007109941,0.004957881,0.0001371425,0.00002286539,0.0004452587,0.00172499,0.03667166,0.00861744,0.8968621,0.002775047,0.04744936],"study_design_scores_gemma":[0.00004898465,0.0000842441,0.007820535,0.00005406883,0.00002761466,0.000748467,0.0005480302,0.1426321,0.00383129,0.8329584,0.01119671,0.00004966805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8823341,0.0007105785,0.07548091,0.000608571,0.00003531199,0.0000373473,0.0003043399,0.0001158305,0.04037289],"genre_scores_gemma":[0.9910376,0.0004133538,0.004164348,0.00003786026,0.0000551749,0.00001614951,0.000123701,0.00002518079,0.004126709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004364823,"threshold_uncertainty_score":0.01113278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963923335","doi":"10.2298/pim1410169k","title":"New moduli of smoothness","year":2014,"lang":"en","type":"article","venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Moduli; Smoothness; Mathematics; Combinatorics; Modulus; Physics; Mathematical analysis; Crystallography; Geometry; Chemistry; Quantum mechanics","authors":[{"name":"Kirill A. Kopotun","is_ca":true},{"name":"D. Leviatan","is_ca":false},{"name":"I. A. Shevchuk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01880580416926599,"gpt":0.255462543730072,"spread":0.236656739560806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001792746,0.0005778978,0.0005722119,0.003092728,0.001249376,0.003648328,0.0006442171,0.001394653,0.005457701],"category_scores_gemma":[0.006271408,0.0003617823,0.0006632585,0.001233614,0.002345324,0.008164863,0.002924104,0.002675346,0.0005024021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387772,"about_ca_system_score_gemma":0.0003831921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002653676,"about_ca_topic_score_gemma":0.0002413359,"domain_scores_codex":[0.9992645,0.000127668,0.00005411054,0.0001455833,0.000303958,0.0001041326],"domain_scores_gemma":[0.998044,0.0004887455,0.0004221887,0.0002629244,0.000311739,0.0004703358],"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.00002025923,0.0000078317,0.000278414,0.00002494158,0.000004227799,0.00005508705,0.00009377516,0.0006098332,0.0009855997,0.9943237,0.0005275985,0.003068686],"study_design_scores_gemma":[0.00002099491,0.00008252059,0.001961095,0.00006940949,0.00002223716,0.0008023909,0.0002569731,0.01893388,0.001604022,0.9539895,0.02221798,0.00003892562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.615985,0.006640621,0.1993806,0.008372726,0.001654185,0.0001009596,0.0005416295,0.0003555145,0.1669688],"genre_scores_gemma":[0.9430233,0.001874221,0.02630529,0.0004261716,0.001199936,0.00007472002,0.0002334245,0.0001510104,0.02671188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005457701,"threshold_uncertainty_score":0.0182578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}