{"meta":{"query_hash":"bd7f4e87695f","filters":{"venue":"SZTAKI Publication Repository (Hungarian Academy of Sciences)"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/bd7f4e87695f","api":"https://metacan.xera.ac/api/v1/cohort?venue=SZTAKI+Publication+Repository+%28Hungarian+Academy+of+Sciences%29"},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07004419195070641,"score_gpt":0.3992770809796929,"score_spread":0.3292328890289865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100039866","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.046328828,0.00076418184,0.94558233,0.0010345672,0.00011145102,0.0002076393,0.00053814764,0.00036066837,0.005072156],"genre_scores_gemma":[0.7866092,0.0008222404,0.20383532,0.00030373398,0.00017906031,0.00040033227,0.0010956328,0.00013644683,0.0066179927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985195,0.00061849295,0.00007263267,0.00037511738,0.0001866412,0.00022770243],"domain_scores_gemma":[0.99573046,0.0030900387,0.0005017905,0.0002450689,0.00017193686,0.00026076156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017521074,0.0010448581,0.0015902088,0.0006388507,0.0006682395,0.0011947829,0.0018536132,0.001943236,0.0031159902],"category_scores_gemma":[0.006062218,0.0005614809,0.0007706331,0.0010455955,0.0013023863,0.0027474195,0.0014682197,0.0015544151,0.000443048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00016323336,0.00012015511,0.00060651737,0.00013011193,0.00008310702,0.0001273686,0.000062369596,0.94057906,0.00041551373,0.036763787,0.001960418,0.01898849],"study_design_scores_gemma":[0.0000450342,0.000051851843,0.00013076967,0.000011437875,0.000015319265,0.0000443402,0.000016498365,0.94189423,0.00024144817,0.056439646,0.0011008728,0.000008539053],"about_ca_topic_score_codex":0.004395472,"about_ca_topic_score_gemma":0.004051424,"teacher_disagreement_score":0.004395472,"about_ca_system_score_codex":0.0014953755,"about_ca_system_score_gemma":0.0020264515,"threshold_uncertainty_score":0.010849774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0437889203206143,"score_gpt":0.29414249494610195,"score_spread":0.25035357462548763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114660220","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.48593017,0.008869118,0.38374716,0.029417586,0.00037275287,0.00067903806,0.017024394,0.0028612406,0.07109844],"genre_scores_gemma":[0.87697655,0.0047264234,0.091230586,0.0023985745,0.0005541359,0.0010236963,0.010189514,0.00094226305,0.01195825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957539,0.0012580791,0.000188622,0.0011951621,0.0008344232,0.00076990103],"domain_scores_gemma":[0.97914326,0.016100653,0.0012716941,0.0018534228,0.00078216597,0.0008488671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028246737,0.0020956914,0.0030210442,0.0015315149,0.001851922,0.0068191895,0.004538604,0.003933516,0.010431246],"category_scores_gemma":[0.024549518,0.0012036918,0.0021741302,0.0033638137,0.0024218168,0.011508345,0.0029849794,0.005071792,0.001300805],"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.0009868369,0.0005307956,0.005408418,0.0014968103,0.0003385552,0.0006614183,0.000706231,0.56989884,0.0042626658,0.29169706,0.054812536,0.06919991],"study_design_scores_gemma":[0.00019325278,0.00007666525,0.001091809,0.00010523934,0.00008136649,0.00038604983,0.00024318747,0.5606726,0.000987153,0.42776313,0.008352056,0.000047396697],"about_ca_topic_score_codex":0.0049397685,"about_ca_topic_score_gemma":0.0039688773,"teacher_disagreement_score":0.010431246,"about_ca_system_score_codex":0.005982587,"about_ca_system_score_gemma":0.0025854069,"threshold_uncertainty_score":0.043406963},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Economic analysis; Quarter (Canadian coin); Order (exchange)","score_opus":0.02577687448255245,"score_gpt":0.30524033307956183,"score_spread":0.2794634585970094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7052814577","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051446408,0.0028233428,0.0122901155,0.039903466,0.0021349688,0.0005202496,0.0014145465,0.0018955368,0.88757145],"genre_scores_gemma":[0.14527889,0.0030859339,0.00722971,0.0067954995,0.00037304882,0.00035833323,0.0012042761,0.00069058285,0.8349837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979512,0.0003926583,0.000068207424,0.00032190545,0.0006964227,0.0005697077],"domain_scores_gemma":[0.99725026,0.000357935,0.00017355169,0.00022370266,0.000803449,0.001191075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014245028,0.00050631055,0.00032284562,0.0010667299,0.0032595992,0.0063888985,0.0010141762,0.0018406379,0.13868074],"category_scores_gemma":[0.003451853,0.0002899703,0.00045410893,0.001165223,0.0014285375,0.003563376,0.0052491445,0.002798818,0.0316513],"study_design_candidate":"not_applicable","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.00045365922,0.0011997048,0.012162064,0.0010440199,0.000054888547,0.0008660984,0.011268414,0.00076992245,0.0053533395,0.13439961,0.35637417,0.476054],"study_design_scores_gemma":[0.000017363958,0.00008437234,0.006554655,0.00020217359,0.000015592539,0.00014232939,0.003112631,0.00017705966,0.0007900612,0.0029870274,0.9859002,0.000016445762],"about_ca_topic_score_codex":0.013760447,"about_ca_topic_score_gemma":0.02274717,"teacher_disagreement_score":0.13868074,"about_ca_system_score_codex":0.0044405647,"about_ca_system_score_gemma":0.010115575,"threshold_uncertainty_score":0.4639333},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Quarter (Canadian coin); Order (exchange); Technical progress","score_opus":0.03292612850245982,"score_gpt":0.3194490332691104,"score_spread":0.28652290476665054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067803471","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064727664,0.005874068,0.008305664,0.06871394,0.005163061,0.00018302702,0.0008026729,0.0008833121,0.8453466],"genre_scores_gemma":[0.13942973,0.0033988417,0.0035049606,0.0074002114,0.0007017232,0.00011911691,0.00043412045,0.00051827036,0.8444931],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823713,0.0003381378,0.000070119226,0.00034270066,0.00056732504,0.0004446166],"domain_scores_gemma":[0.9977442,0.00031655905,0.00016374732,0.00019875121,0.0005976151,0.0009792063],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014175079,0.00046265736,0.00037744013,0.0008839445,0.0041042287,0.010183612,0.00073162885,0.0022712217,0.11807565],"category_scores_gemma":[0.0036716089,0.0002911246,0.0003554044,0.001030864,0.002216645,0.0060133925,0.0056116567,0.0036922933,0.033875592],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00053523324,0.00054401386,0.011146574,0.00088589825,0.00004842104,0.0015398283,0.024941618,0.00034211815,0.0074265255,0.26197135,0.3774198,0.31319866],"study_design_scores_gemma":[0.000010006478,0.000043900625,0.0043987045,0.00017800878,0.000011436086,0.000230212,0.0053493725,0.00009859243,0.0008383217,0.0050419345,0.9837811,0.000018390447],"about_ca_topic_score_codex":0.006471257,"about_ca_topic_score_gemma":0.010905994,"teacher_disagreement_score":0.88192433,"about_ca_system_score_codex":0.0035337415,"about_ca_system_score_gemma":0.00491987,"threshold_uncertainty_score":0.39500237},"labels":[],"label_agreement":null}]}