{"meta":{"query_hash":"9e598be96208","filters":{"venue":"Viaţa medicală; revistă de informare profesională şi ştiinţifică a cadrelor medii sanitare"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/9e598be96208","api":"https://metacan.xera.ac/api/v1/cohort?venue=Viat%CC%A7a+medicala%CC%86%3B+revista%CC%86+de+informare+profesionala%CC%86+s%CC%A7i+s%CC%A7tiint%CC%A7ifica%CC%86+a+cadrelor+medii+sanitare"},"results":[{"id":"W817481","doi":"","title":"Generating Random Dynamic Resource Scheduling Problems","year":2008,"lang":"en","type":"article","venue":"Viaţa medicală; revistă de informare profesională şi ştiinţifică a cadrelor medii sanitare","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dynamic priority scheduling; Computer science; Scheduling (production processes); Fair-share scheduling; Two-level scheduling; Earliest deadline first scheduling; Distributed computing; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Real-time computing; Mathematical optimization; Schedule; Operating system","score_opus":0.06270053567341327,"score_gpt":0.33956291189655335,"score_spread":0.2768623762231401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W817481","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.19526097,0.0003407987,0.79336196,0.00084226386,0.0001883856,0.0008356487,0.0017042276,0.001862355,0.00560334],"genre_scores_gemma":[0.55284137,0.0001894802,0.43968666,0.00022963734,0.00005701619,0.001354602,0.0024321224,0.00028132857,0.0029277464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851197,0.0006832146,0.00007290513,0.00030651822,0.00026452212,0.00016090155],"domain_scores_gemma":[0.9913523,0.0067190863,0.00043736878,0.00060228835,0.00065167696,0.00023729558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031339,0.0007527142,0.0007495818,0.00068782887,0.00036079995,0.00060885015,0.0014827274,0.0008200251,0.003080192],"category_scores_gemma":[0.012320017,0.0004319246,0.00078726455,0.0006428197,0.0006240065,0.00091279764,0.0009982132,0.001083311,0.00028142487],"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.0001566886,0.00011551455,0.0012224057,0.00013240046,0.000038006652,0.00013658441,0.000049935185,0.9635069,0.0012588975,0.014438673,0.002442163,0.016501816],"study_design_scores_gemma":[0.00007503677,0.00004206902,0.00012337058,0.0000055419237,0.000007623888,0.000017483238,0.000020163792,0.98703814,0.0007337457,0.011057875,0.0008731892,0.0000058800806],"about_ca_topic_score_codex":0.002109488,"about_ca_topic_score_gemma":0.0028955415,"teacher_disagreement_score":0.0031339,"about_ca_system_score_codex":0.0008785663,"about_ca_system_score_gemma":0.0018151868,"threshold_uncertainty_score":0.016573787},"labels":[],"label_agreement":null}]}