{"meta":{"query_hash":"d5ddb31203f1","filters":{"venue":"Zahnarztliche Welt"},"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/d5ddb31203f1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Zahnarztliche+Welt"},"results":[{"id":"W14931976","doi":"","title":"Partial-order verification in SPIN can be more efficient","year":2002,"lang":"en","type":"article","venue":"Zahnarztliche Welt","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"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 Ottawa","funders":"","keywords":"Partial order reduction; Model checking; Computer science; Reduction (mathematics); Concurrency; Set (abstract data type); Programming language; Formal verification; Linear temporal logic; Temporal logic; High-level verification; Algorithm; Theoretical computer science; Mathematics; Software","score_opus":0.04558110259136665,"score_gpt":0.30317534127052015,"score_spread":0.2575942386791535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14931976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46482503,0.0003820551,0.50804675,0.017489795,0.0011597553,0.0008509126,0.000007497654,0.000675869,0.006562342],"genre_scores_gemma":[0.8210975,0.000028536666,0.17723735,0.0010635374,0.00007145097,0.00009807137,0.0000063666157,0.000019512823,0.000377706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980993,0.00017235402,0.0003929296,0.0005318265,0.00039016645,0.0004133823],"domain_scores_gemma":[0.9985185,0.000048263013,0.00014068281,0.0010932402,0.00008909224,0.00011021089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063340046,0.00018144153,0.00017720214,0.00019557573,0.00010666354,0.00010309733,0.0008884546,0.000121798235,0.00008550598],"category_scores_gemma":[0.00026676248,0.00018428259,0.00004919784,0.0011868675,0.00008040979,0.00023673479,0.00013748049,0.00022368925,0.00019081852],"study_design_candidate":"simulation_or_modeling","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.00007027237,0.0024769127,0.007899798,0.00019390638,0.00006500463,0.00008985132,0.058088336,0.058175523,0.03654915,0.55424994,0.015065617,0.26707572],"study_design_scores_gemma":[0.00041942377,0.00006180466,0.015385006,0.000021418135,0.000004615452,0.000012340053,0.00013091163,0.94741803,0.016769115,0.00013111309,0.019345844,0.0003003834],"about_ca_topic_score_codex":0.00014933788,"about_ca_topic_score_gemma":0.000021117192,"teacher_disagreement_score":0.88924253,"about_ca_system_score_codex":0.00015353913,"about_ca_system_score_gemma":0.000032048294,"threshold_uncertainty_score":0.7514826},"labels":[],"label_agreement":null}]}