{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026886405,0.000016184806,0.9576966,0.0010569356,0.00034940554,0.00014728836,0.00000278791,0.00010146317,0.013742927],"genre_scores_gemma":[0.10898552,0.000005117488,0.89021224,0.00046468797,0.00017630172,0.0000042886004,0.0000021712012,0.0000069422513,0.00014276317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99776053,0.00033393112,0.00053350336,0.00040429056,0.00059040246,0.0003773231],"domain_scores_gemma":[0.9979431,0.000068470494,0.00023422833,0.0010029338,0.00020750343,0.00054374477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030097761,0.0001736317,0.00032140544,0.00042376394,0.00024111151,0.00039522766,0.0014799914,0.00010417688,0.000048407295],"category_scores_gemma":[0.00066157343,0.00015786977,0.00026296132,0.0020647377,0.000039452985,0.0007776289,0.00022758405,0.0005746518,0.00021200154],"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.00021618845,0.001100748,0.012651999,0.00006454796,0.0013113234,0.000056498713,0.027903127,0.1830676,0.0015707307,0.3882286,0.008702312,0.37512633],"study_design_scores_gemma":[0.005832961,0.0011704066,0.471309,0.000108816006,0.000776239,0.0019695563,0.00065570755,0.073924884,0.009743286,0.3285741,0.103255086,0.0026799582],"about_ca_topic_score_codex":0.0001849383,"about_ca_topic_score_gemma":0.000012969488,"teacher_disagreement_score":0.45865703,"about_ca_system_score_codex":0.00029616253,"about_ca_system_score_gemma":0.0004359755,"threshold_uncertainty_score":0.6437742},"labels":[],"label_agreement":null}]}