{"meta":{"query_hash":"f9bc267a2745","filters":{"venue":"Infinity Journal"},"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/f9bc267a2745","api":"https://metacan.xera.ac/api/v1/cohort?venue=Infinity+Journal"},"results":[{"id":"W3006339109","doi":"","title":"A New Approach to Upward-Closed Set Backward Reachability Analysis.","year":2004,"lang":"en","type":"article","venue":"Infinity Journal","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"","keywords":"Reachability; Parameterized complexity; Petri net; Binary decision diagram; Intersection (aeronautics); Model checking; Fixed point; Set (abstract data type); Computation; Class (philosophy); Computer science; Theoretical computer science; Convergence (economics); Algorithm; Mathematics; State (computer science); Programming language","score_opus":0.0704019921991426,"score_gpt":0.3305189717620785,"score_spread":0.2601169795629359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006339109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070346874,0.000049932638,0.99806505,0.000041258376,0.000023178574,0.000032491385,0.000025013282,0.00033741823,0.0007223035],"genre_scores_gemma":[0.045696244,0.00019450836,0.9511322,0.000118995406,0.000047543967,0.00018186159,0.00020356383,0.0001806626,0.0022445922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997888,0.00030615117,0.00014404915,0.00052368146,0.001010466,0.00012762206],"domain_scores_gemma":[0.9983152,0.00065049477,0.00012799929,0.0005121617,0.00032942183,0.00006472383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020938623,0.0010022264,0.00086307194,0.0023415266,0.0010850913,0.0019033254,0.0022421917,0.0011035528,0.0043597403],"category_scores_gemma":[0.0046527423,0.00073451374,0.002400512,0.0010492491,0.0024293142,0.003801748,0.0029731903,0.00340461,0.0014228473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00009951485,0.00017774192,0.0010332362,0.00037142867,0.00017340228,0.00027424286,0.00053562503,0.06252253,0.03186741,0.7098198,0.002923811,0.19020118],"study_design_scores_gemma":[0.000060511793,0.00012013841,0.0003141322,0.00012660667,0.00014168271,0.0005175762,0.00008605267,0.46700895,0.023556476,0.45140615,0.056586627,0.00007512014],"about_ca_topic_score_codex":0.0026153019,"about_ca_topic_score_gemma":0.0025221067,"teacher_disagreement_score":0.0043597403,"about_ca_system_score_codex":0.0013656319,"about_ca_system_score_gemma":0.002406731,"threshold_uncertainty_score":0.014584839},"labels":[],"label_agreement":null}]}