{"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":"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.8823341,0.00071057846,0.07548091,0.000608571,0.00003531199,0.000037347298,0.0003043399,0.0001158305,0.040372893],"genre_scores_gemma":[0.9910376,0.00041335385,0.004164348,0.000037860264,0.0000551749,0.000016149508,0.00012370096,0.000025180792,0.004126709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957925,0.00008999776,0.000008826147,0.000070538605,0.000104767576,0.00014665324],"domain_scores_gemma":[0.99747795,0.0016417931,0.0002490625,0.0001441195,0.0002332069,0.00025379416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383275,0.0003223025,0.00029301393,0.0015568295,0.0009665167,0.00093586504,0.0005375376,0.00030955806,0.0033278419],"category_scores_gemma":[0.004914669,0.00018896008,0.00040424537,0.0014973903,0.0014366249,0.0014972079,0.00088046276,0.00085593003,0.0003412672],"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.00026505388,0.00007109941,0.004957881,0.00013714249,0.000022865388,0.00044525875,0.0017249903,0.03667166,0.00861744,0.89686215,0.0027750467,0.04744936],"study_design_scores_gemma":[0.00004898465,0.0000842441,0.007820535,0.000054068834,0.00002761466,0.000748467,0.00054803025,0.14263207,0.00383129,0.8329584,0.011196707,0.000049668055],"about_ca_topic_score_codex":0.0043648225,"about_ca_topic_score_gemma":0.003358351,"teacher_disagreement_score":0.0043648225,"about_ca_system_score_codex":0.0013125445,"about_ca_system_score_gemma":0.00044173398,"threshold_uncertainty_score":0.011132777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26005995,0.0017794266,0.7230733,0.0007902184,0.00017515126,0.00016889315,0.00063787284,0.0011909875,0.012124167],"genre_scores_gemma":[0.9227216,0.0009726155,0.07273962,0.00014402543,0.000056818273,0.00007654694,0.0004557577,0.000091405585,0.00274156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00023290835,0.00005461646,0.00025866454,0.00015063529,0.0002346225],"domain_scores_gemma":[0.99686545,0.0013255479,0.00040096944,0.0010441391,0.00012954419,0.00023433764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006871229,0.0011081342,0.001030625,0.0006766846,0.0010862335,0.0013957961,0.0014507358,0.0010296543,0.0020820105],"category_scores_gemma":[0.0034490447,0.00043250178,0.0008764868,0.0008453111,0.0014436274,0.0033669919,0.0026924221,0.0011275981,0.00056468847],"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.0010558417,0.00022340118,0.0034182856,0.000939584,0.0002295424,0.0011238005,0.000873561,0.48330906,0.05563513,0.3004855,0.009408603,0.14329773],"study_design_scores_gemma":[0.00009221181,0.00047086176,0.0012097553,0.00012377996,0.0001438381,0.0014197191,0.0003928435,0.6631553,0.019673174,0.29794475,0.015319457,0.00005423272],"about_ca_topic_score_codex":0.0013495102,"about_ca_topic_score_gemma":0.0014142031,"teacher_disagreement_score":0.0020820105,"about_ca_system_score_codex":0.0010783632,"about_ca_system_score_gemma":0.00090066594,"threshold_uncertainty_score":0.007824123},"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":"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.615985,0.0066406215,0.19938059,0.008372726,0.0016541847,0.00010095962,0.0005416295,0.0003555145,0.16696882],"genre_scores_gemma":[0.94302326,0.0018742211,0.026305288,0.0004261716,0.0011999361,0.00007472002,0.0002334245,0.00015101043,0.02671188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926454,0.000127668,0.000054110544,0.0001455833,0.000303958,0.00010413263],"domain_scores_gemma":[0.998044,0.00048874546,0.0004221887,0.00026292444,0.000311739,0.00047033577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017927455,0.00057789776,0.00057221187,0.0030927276,0.0012493755,0.003648328,0.0006442171,0.0013946533,0.0054577007],"category_scores_gemma":[0.0062714084,0.00036178227,0.0006632585,0.001233614,0.0023453238,0.008164863,0.0029241045,0.002675346,0.0005024021],"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.000020259231,0.0000078317,0.000278414,0.000024941579,0.0000042277993,0.000055087054,0.00009377516,0.00060983317,0.0009855997,0.99432373,0.0005275985,0.0030686862],"study_design_scores_gemma":[0.000020994912,0.000082520586,0.0019610953,0.00006940949,0.000022237158,0.0008023909,0.00025697306,0.01893388,0.0016040221,0.9539895,0.022217976,0.00003892562],"about_ca_topic_score_codex":0.00026536765,"about_ca_topic_score_gemma":0.00024133586,"teacher_disagreement_score":0.0054577007,"about_ca_system_score_codex":0.0013877725,"about_ca_system_score_gemma":0.00038319206,"threshold_uncertainty_score":0.018257797},"labels":[],"label_agreement":null}]}