{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004393994,0.0003887338,0.0004097829,0.0006349625,0.0004114544,0.0009742227,0.001762732,0.0001412428,0.00005227279],"category_scores_gemma":[0.0001602256,0.0002991097,0.0002698453,0.001447887,0.000431901,0.01320578,0.0006959242,0.000349949,0.00007212404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008709639,"about_ca_system_score_gemma":0.0005368089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006541879,"about_ca_topic_score_gemma":0.000001628594,"domain_scores_codex":[0.9955165,0.0002044854,0.0007420775,0.001039978,0.001879709,0.0006172903],"domain_scores_gemma":[0.9972669,0.0006768917,0.0004535074,0.0008164133,0.0005201263,0.0002661254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002751662,0.003565868,0.1375365,0.001699716,0.002507982,0.002341446,0.004319791,0.002700682,0.3984652,0.3068648,0.009635773,0.1276106],"study_design_scores_gemma":[0.003395178,0.001935625,0.04327162,0.001534409,0.00004018923,0.001219588,0.0004433615,0.0008503542,0.6941209,0.2418105,0.009097726,0.002280573],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.844808,0.0004897098,0.05949846,0.00070876,0.0008283062,0.002063507,0.0001498997,0.001256348,0.09019697],"genre_scores_gemma":[0.9796827,0.000009580501,0.005451208,0.00007256574,0.0001918321,0.0002147995,0.00001970835,0.00006974611,0.01428782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2956558,"threshold_uncertainty_score":0.9999461,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006210102,0.000290931,0.0003609878,0.0006063291,0.0002440856,0.0004573243,0.001975057,0.0001319835,0.0000850483],"category_scores_gemma":[0.0005194371,0.0002025923,0.0003433444,0.001072259,0.0005029169,0.006994562,0.0005117785,0.0002071489,0.00006499234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006310719,"about_ca_system_score_gemma":0.0003100113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004252659,"about_ca_topic_score_gemma":7.444478e-7,"domain_scores_codex":[0.9960738,0.0002824404,0.0008639103,0.0006781534,0.001704162,0.0003975252],"domain_scores_gemma":[0.9954476,0.002552168,0.000598734,0.0008217976,0.0004275973,0.0001520861],"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.0002190461,0.0002860885,0.00410918,0.00006194264,0.0001374556,0.00002205427,0.0002309953,0.00004729383,0.05424848,0.933127,0.003035892,0.004474536],"study_design_scores_gemma":[0.0006274932,0.0002403678,0.02933257,0.0002462502,0.000009304962,0.00003055194,0.00005902979,0.0001601321,0.416613,0.5515205,0.0008223003,0.0003384324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8669134,0.0002178612,0.006522258,0.002513025,0.00100873,0.0007787317,0.000196378,0.0002696596,0.1215799],"genre_scores_gemma":[0.99289,0.00001231837,0.0005624884,0.0001542991,0.0001039802,0.0000413757,0.00002076036,0.00003718122,0.006177619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3816065,"threshold_uncertainty_score":0.8261475,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003797404,0.00032361,0.0005755498,0.00029097,0.0001534051,0.0003011366,0.0006632722,0.00020003,0.0002728886],"category_scores_gemma":[0.0004216965,0.0003302095,0.0003214024,0.0004717786,0.0002452139,0.004389184,0.0001844632,0.0002096201,0.00004341437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003630369,"about_ca_system_score_gemma":0.0003306954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001518759,"about_ca_topic_score_gemma":0.000001840731,"domain_scores_codex":[0.9968616,0.0001493403,0.001091347,0.0004807866,0.001125922,0.0002909451],"domain_scores_gemma":[0.9974652,0.0007513652,0.0008267045,0.0004624501,0.0003001139,0.0001941717],"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.0003492881,0.0006898173,0.01105572,0.001408127,0.000441052,0.00002044066,0.001886014,0.0003977631,0.02388797,0.9335552,0.02262717,0.003681417],"study_design_scores_gemma":[0.0006878124,0.0001485934,0.007560312,0.0003244268,0.00005827869,0.00004492055,0.0003686182,0.0007431948,0.2194273,0.7676364,0.002495705,0.000504485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7465385,0.0001350699,0.006973837,0.0003328244,0.0007253258,0.0004765491,0.0001007128,0.0002952625,0.2444219],"genre_scores_gemma":[0.9589823,0.000004556212,0.005261018,0.00007964233,0.0003570806,0.0000141577,0.0001065926,0.00006547358,0.03512919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2124438,"threshold_uncertainty_score":0.999915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}