{"meta":{"query_hash":"a64fad3cfbdd","filters":{"venue":"Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/a64fad3cfbdd","api":"https://metacan.xera.ac/api/v1/cohort?venue=Digital+Object+Identifier+%28DOI%29+Repository+Serbia+%28National+Library+of+Serbia%29"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Limiting; Friendship graph; Voltage graph; Line graph","score_opus":0.014640895675848038,"score_gpt":0.24170945655783918,"score_spread":0.22706856088199115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963356118","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.86691344,0.00021786122,0.0065222583,0.0025130252,0.0010087297,0.00077873166,0.000196378,0.00026965956,0.12157989],"genre_scores_gemma":[0.99289,0.000012318371,0.0005624884,0.00015429906,0.00010398024,0.000041375697,0.000020760359,0.000037181217,0.006177619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960738,0.0002824404,0.0008639103,0.00067815336,0.001704162,0.00039752523],"domain_scores_gemma":[0.99544764,0.002552168,0.00059873395,0.0008217976,0.0004275973,0.00015208608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006210102,0.00029093103,0.00036098776,0.00060632906,0.00024408556,0.00045732426,0.0019750574,0.0001319835,0.0000850483],"category_scores_gemma":[0.00051943713,0.00020259232,0.0003433444,0.0010722594,0.00050291687,0.0069945618,0.0005117785,0.00020714886,0.00006499234],"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.00021904612,0.00028608847,0.0041091796,0.000061942636,0.00013745562,0.000022054273,0.00023099527,0.000047293826,0.054248482,0.93312705,0.0030358916,0.0044745356],"study_design_scores_gemma":[0.0006274932,0.0002403678,0.029332567,0.00024625025,0.000009304962,0.00003055194,0.000059029786,0.00016013211,0.41661304,0.5515205,0.0008223003,0.00033843244],"about_ca_topic_score_codex":0.0000042526585,"about_ca_topic_score_gemma":7.444478e-7,"teacher_disagreement_score":0.3816065,"about_ca_system_score_codex":0.00006310719,"about_ca_system_score_gemma":0.00031001127,"threshold_uncertainty_score":0.8261475},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009525591607780442,"score_gpt":0.2344880124442836,"score_spread":0.22496242083650317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963436343","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.84480804,0.00048970984,0.05949846,0.00070876,0.00082830625,0.0020635074,0.00014989967,0.0012563481,0.09019697],"genre_scores_gemma":[0.97968274,0.000009580501,0.0054512075,0.00007256574,0.00019183208,0.00021479947,0.000019708354,0.000069746115,0.014287821],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9955165,0.00020448538,0.00074207754,0.0010399785,0.0018797088,0.0006172903],"domain_scores_gemma":[0.99726695,0.00067689165,0.00045350735,0.00081641326,0.00052012625,0.00026612537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004393994,0.0003887338,0.00040978286,0.0006349625,0.00041145438,0.0009742227,0.001762732,0.0001412428,0.000052272793],"category_scores_gemma":[0.0001602256,0.00029910967,0.00026984527,0.001447887,0.00043190105,0.0132057825,0.00069592416,0.00034994903,0.000072124036],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0027516624,0.0035658677,0.13753653,0.0016997155,0.0025079823,0.0023414462,0.0043197908,0.0027006818,0.39846516,0.30686483,0.009635773,0.12761056],"study_design_scores_gemma":[0.0033951781,0.0019356245,0.04327162,0.0015344087,0.000040189232,0.0012195875,0.00044336147,0.0008503542,0.6941209,0.24181047,0.009097726,0.0022805731],"about_ca_topic_score_codex":0.0000065418794,"about_ca_topic_score_gemma":0.0000016285941,"teacher_disagreement_score":0.29565576,"about_ca_system_score_codex":0.00008709639,"about_ca_system_score_gemma":0.0005368089,"threshold_uncertainty_score":0.9999461},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Moduli; Smoothness; Mathematics; Combinatorics; Modulus; Physics; Mathematical analysis; Crystallography; Geometry; Chemistry; Quantum mechanics","score_opus":0.01880580416926599,"score_gpt":0.255462543730072,"score_spread":0.236656739560806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963923335","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.74653846,0.00013506995,0.006973837,0.00033282436,0.00072532584,0.00047654912,0.0001007128,0.00029526246,0.24442194],"genre_scores_gemma":[0.9589823,0.000004556212,0.005261018,0.00007964233,0.00035708063,0.000014157701,0.00010659257,0.000065473585,0.035129193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686164,0.00014934034,0.0010913468,0.0004807866,0.001125922,0.00029094506],"domain_scores_gemma":[0.9974652,0.00075136515,0.0008267045,0.00046245015,0.00030011393,0.00019417173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037974038,0.00032360997,0.00057554984,0.00029097003,0.00015340513,0.0003011366,0.00066327216,0.00020002996,0.00027288863],"category_scores_gemma":[0.0004216965,0.00033020953,0.00032140242,0.00047177856,0.00024521395,0.0043891836,0.0001844632,0.0002096201,0.000043414366],"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.00034928814,0.0006898173,0.011055717,0.0014081266,0.00044105205,0.000020440655,0.0018860141,0.0003977631,0.023887973,0.93355525,0.022627166,0.003681417],"study_design_scores_gemma":[0.0006878124,0.00014859339,0.0075603123,0.0003244268,0.000058278685,0.000044920547,0.00036861817,0.0007431948,0.21942729,0.76763636,0.0024957054,0.000504485],"about_ca_topic_score_codex":0.000015187595,"about_ca_topic_score_gemma":0.0000018407314,"teacher_disagreement_score":0.21244381,"about_ca_system_score_codex":0.000036303692,"about_ca_system_score_gemma":0.00033069545,"threshold_uncertainty_score":0.999915},"labels":[],"label_agreement":null}]}