{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"bd7f4e87695f","filters":{"venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)"}},"results":[{"id":"W100039866","doi":"","title":"The Online Loop-free Stochastic Shortest-Path Problem.","year":2010,"lang":"en","type":"article","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Shortest path problem; Regret; Mathematics; Asymptotically optimal algorithm; Path (computing); Graph; Action (physics); State (computer science); Combinatorics; Mathematical optimization; Hindsight bias; Discrete mathematics; Computer science; Algorithm","authors":[{"name":"Gergely Neu","is_ca":false},{"name":"András György","is_ca":false},{"name":"Csaba Szepesvári","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07004419195070641,"gpt":0.3992770809796929,"spread":0.3292328890289865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752107,0.001044858,0.001590209,0.0006388507,0.0006682395,0.001194783,0.001853613,0.001943236,0.00311599],"category_scores_gemma":[0.006062218,0.0005614809,0.0007706331,0.001045596,0.001302386,0.00274742,0.00146822,0.001554415,0.000443048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001495376,"about_ca_system_score_gemma":0.002026452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004395472,"about_ca_topic_score_gemma":0.004051424,"domain_scores_codex":[0.9985195,0.000618493,0.00007263267,0.0003751174,0.0001866412,0.0002277024],"domain_scores_gemma":[0.9957305,0.003090039,0.0005017905,0.0002450689,0.0001719369,0.0002607616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001632334,0.0001201551,0.0006065174,0.0001301119,0.00008310702,0.0001273686,0.0000623696,0.9405791,0.0004155137,0.03676379,0.001960418,0.01898849],"study_design_scores_gemma":[0.0000450342,0.00005185184,0.0001307697,0.00001143788,0.00001531927,0.0000443402,0.00001649836,0.9418942,0.0002414482,0.05643965,0.001100873,0.000008539053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04632883,0.0007641818,0.9455823,0.001034567,0.000111451,0.0002076393,0.0005381476,0.0003606684,0.005072156],"genre_scores_gemma":[0.7866092,0.0008222404,0.2038353,0.000303734,0.0001790603,0.0004003323,0.001095633,0.0001364468,0.006617993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004395472,"threshold_uncertainty_score":0.01084977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3114660220","doi":"10.4230/lipics.icalp.2016.27","title":"The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems","year":2016,"lang":"en","type":"article","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Hungarian Scientific Research Fund; Grantová Agentura České Republiky","keywords":"Steiner tree problem; Combinatorics; Parameterized complexity; Mathematics; Bounded function; Discrete mathematics; Path (computing); Directed graph; Computer science","authors":[{"name":"Andreas Emil Feldmann","is_ca":true},{"name":"Dániel Marx","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0437889203206143,"gpt":0.294142494946102,"spread":0.2503535746254876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002824674,0.002095691,0.003021044,0.001531515,0.001851922,0.00681919,0.004538604,0.003933516,0.01043125],"category_scores_gemma":[0.02454952,0.001203692,0.00217413,0.003363814,0.002421817,0.01150834,0.002984979,0.005071792,0.001300805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005982587,"about_ca_system_score_gemma":0.002585407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004939768,"about_ca_topic_score_gemma":0.003968877,"domain_scores_codex":[0.9957539,0.001258079,0.000188622,0.001195162,0.0008344232,0.000769901],"domain_scores_gemma":[0.9791433,0.01610065,0.001271694,0.001853423,0.000782166,0.0008488671],"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.0009868369,0.0005307956,0.005408418,0.00149681,0.0003385552,0.0006614183,0.000706231,0.5698988,0.004262666,0.2916971,0.05481254,0.06919991],"study_design_scores_gemma":[0.0001932528,0.00007666525,0.001091809,0.0001052393,0.00008136649,0.0003860498,0.0002431875,0.5606726,0.000987153,0.4277631,0.008352056,0.0000473967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4859302,0.008869118,0.3837472,0.02941759,0.0003727529,0.0006790381,0.01702439,0.002861241,0.07109844],"genre_scores_gemma":[0.8769765,0.004726423,0.09123059,0.002398574,0.0005541359,0.001023696,0.01018951,0.0009422631,0.01195825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01043125,"threshold_uncertainty_score":0.04340696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7067803471","doi":"","title":"Nagy a lebukás veszélye: nem kamuzhatnak a diplomázók","year":2007,"lang":"hu","type":"other","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Prenatal Screening and Diagnostics","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Context (archaeology); Quarter (Canadian coin); Order (exchange); Technical progress","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03292612850245982,"gpt":0.3194490332691104,"spread":0.2865229047666505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001417508,0.0004626574,0.0003774401,0.0008839445,0.004104229,0.01018361,0.0007316289,0.002271222,0.1180756],"category_scores_gemma":[0.003671609,0.0002911246,0.0003554044,0.001030864,0.002216645,0.006013392,0.005611657,0.003692293,0.03387559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003533741,"about_ca_system_score_gemma":0.00491987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006471257,"about_ca_topic_score_gemma":0.01090599,"domain_scores_codex":[0.9982371,0.0003381378,0.00007011923,0.0003427007,0.000567325,0.0004446166],"domain_scores_gemma":[0.9977442,0.000316559,0.0001637473,0.0001987512,0.0005976151,0.0009792063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005352332,0.0005440139,0.01114657,0.0008858982,0.00004842104,0.001539828,0.02494162,0.0003421181,0.007426525,0.2619714,0.3774198,0.3131987],"study_design_scores_gemma":[0.00001000648,0.00004390063,0.004398705,0.0001780088,0.00001143609,0.000230212,0.005349373,0.00009859243,0.0008383217,0.005041935,0.9837811,0.00001839045],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.06472766,0.005874068,0.008305664,0.06871394,0.005163061,0.000183027,0.0008026729,0.0008833121,0.8453466],"genre_scores_gemma":[0.1394297,0.003398842,0.003504961,0.007400211,0.0007017232,0.0001191169,0.0004341204,0.0005182704,0.8444931],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8819243,"threshold_uncertainty_score":0.3950024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7052814577","doi":"","title":"Számítógépes program ellenőrzi az összeollózott dolgozatokat","year":2007,"lang":"hu","type":"other","venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","topic":"Particle Detector Development and Performance","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Economic analysis; Quarter (Canadian coin); Order (exchange)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02577687448255245,"gpt":0.3052403330795618,"spread":0.2794634585970094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001424503,0.0005063105,0.0003228456,0.00106673,0.003259599,0.006388898,0.001014176,0.001840638,0.1386807],"category_scores_gemma":[0.003451853,0.0002899703,0.0004541089,0.001165223,0.001428538,0.003563376,0.005249145,0.002798818,0.0316513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004440565,"about_ca_system_score_gemma":0.01011558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01376045,"about_ca_topic_score_gemma":0.02274717,"domain_scores_codex":[0.9979512,0.0003926583,0.00006820742,0.0003219054,0.0006964227,0.0005697077],"domain_scores_gemma":[0.9972503,0.000357935,0.0001735517,0.0002237027,0.000803449,0.001191075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004536592,0.001199705,0.01216206,0.00104402,0.00005488855,0.0008660984,0.01126841,0.0007699225,0.005353339,0.1343996,0.3563742,0.476054],"study_design_scores_gemma":[0.00001736396,0.00008437234,0.006554655,0.0002021736,0.00001559254,0.0001423294,0.003112631,0.0001770597,0.0007900612,0.002987027,0.9859002,0.00001644576],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.05144641,0.002823343,0.01229012,0.03990347,0.002134969,0.0005202496,0.001414547,0.001895537,0.8875715],"genre_scores_gemma":[0.1452789,0.003085934,0.00722971,0.006795499,0.0003730488,0.0003583332,0.001204276,0.0006905828,0.8349837],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1386807,"threshold_uncertainty_score":0.4639333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}