{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"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":"9e598be96208","filters":{"venue":"Viaţa medicală; revistă de informare profesională şi ştiinţifică 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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wolfgang Haas","is_ca":false},{"name":"William S. Havens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06270053567341327,"gpt":0.3395629118965534,"spread":0.2768623762231401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031339,0.0007527142,0.0007495818,0.0006878289,0.0003608,0.0006088502,0.001482727,0.0008200251,0.003080192],"category_scores_gemma":[0.01232002,0.0004319246,0.0007872646,0.0006428197,0.0006240065,0.0009127976,0.0009982132,0.001083311,0.0002814249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008785663,"about_ca_system_score_gemma":0.001815187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002109488,"about_ca_topic_score_gemma":0.002895541,"domain_scores_codex":[0.998512,0.0006832146,0.00007290513,0.0003065182,0.0002645221,0.0001609015],"domain_scores_gemma":[0.9913523,0.006719086,0.0004373688,0.0006022883,0.000651677,0.0002372956],"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.0001566886,0.0001155146,0.001222406,0.0001324005,0.00003800665,0.0001365844,0.00004993518,0.9635069,0.001258897,0.01443867,0.002442163,0.01650182],"study_design_scores_gemma":[0.00007503677,0.00004206902,0.0001233706,0.000005541924,0.000007623888,0.00001748324,0.00002016379,0.9870381,0.0007337457,0.01105788,0.0008731892,0.000005880081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.195261,0.0003407987,0.793362,0.0008422639,0.0001883856,0.0008356487,0.001704228,0.001862355,0.00560334],"genre_scores_gemma":[0.5528414,0.0001894802,0.4396867,0.0002296373,0.00005701619,0.001354602,0.002432122,0.0002813286,0.002927746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0031339,"threshold_uncertainty_score":0.01657379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}