{"meta":{"query_hash":"5983d60455cc","filters":{"venue":"Formal Methods in Computer-Aided Design"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/5983d60455cc","api":"https://metacan.xera.ac/api/v1/cohort?venue=Formal+Methods+in+Computer-Aided+Design"},"results":[{"id":"W1519061151","doi":"","title":"Oscillator verification with probability one","year":2012,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"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":"Soundness; Generalization; Computer science; Differential (mechanical device); Formal verification; Ring oscillator; Runtime verification; Task (project management); Ring (chemistry); Control theory (sociology); Theoretical computer science; Algorithm; Electronic engineering; Mathematics; Engineering; Programming language; Artificial intelligence","score_opus":0.1107677508075074,"score_gpt":0.356863359922196,"score_spread":0.24609560911468858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519061151","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.0016573439,0.00011682788,0.9960882,0.00016560504,0.00083016744,0.0006672789,9.44557e-7,0.0002551969,0.0002184262],"genre_scores_gemma":[0.008825759,0.000006679068,0.990506,0.00023375615,0.00029225348,0.000100796045,9.944323e-7,0.00002059013,0.000013152192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953536,0.0021732727,0.00057089,0.00058951107,0.0003999342,0.0009128076],"domain_scores_gemma":[0.99711186,0.0012581117,0.00022137692,0.0009830992,0.00011717835,0.00030838026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072674183,0.00029451321,0.00047644085,0.0001843221,0.00015081913,0.00014916009,0.0009257155,0.00012940654,0.000012447171],"category_scores_gemma":[0.0001873039,0.00023684005,0.00008232517,0.0011444433,0.000098344535,0.0019252201,0.00034216527,0.00034870833,0.000027861053],"study_design_candidate":"design_other","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.000041356063,0.00034302787,0.0009496202,0.000031423504,0.000017532582,0.000002494029,0.00044048348,0.0010485211,0.0010558979,0.021646172,0.000023452127,0.97440004],"study_design_scores_gemma":[0.0016497823,0.0018020079,0.039951887,0.00014416815,0.000028217519,0.00008616716,0.000018845818,0.83671665,0.040266346,0.07375305,0.004310474,0.0012723968],"about_ca_topic_score_codex":0.000019432178,"about_ca_topic_score_gemma":2.9235613e-7,"teacher_disagreement_score":0.9731276,"about_ca_system_score_codex":0.00014538104,"about_ca_system_score_gemma":0.00009069856,"threshold_uncertainty_score":0.96580565},"labels":[],"label_agreement":null},{"id":"W1973614029","doi":"10.1109/fmcad.2007.20","title":"Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC","year":2007,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"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 Toronto","funders":"","keywords":"Mathematical proof; Model checking; Computer science; Bounded function; Resolution (logic); Property (philosophy); Variable (mathematics); Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.1730657762546369,"score_gpt":0.41963682545035175,"score_spread":0.24657104919571485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973614029","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.00519985,0.000035960376,0.9876089,0.000041123454,0.003927526,0.0024559228,0.0000021202254,0.00056023046,0.00016835805],"genre_scores_gemma":[0.019484174,0.000002438093,0.97943467,0.0002606835,0.00054130936,0.00018405102,0.0000031581556,0.0000446798,0.00004485236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940227,0.0017116161,0.0013531515,0.0010563156,0.00051955186,0.0013366375],"domain_scores_gemma":[0.9950934,0.0026701682,0.00047356632,0.0010986676,0.00036368857,0.00030048977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.027620165,0.00042560886,0.00052892294,0.0009336836,0.0004322851,0.00027033116,0.0014545219,0.00030322684,0.000003169555],"category_scores_gemma":[0.0019509218,0.00045248008,0.0001994581,0.0018487509,0.000055912747,0.0023031675,0.0005576862,0.00044724805,0.000024791141],"study_design_candidate":"design_other","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.00038541522,0.00009011936,0.00007138011,0.000091528724,0.00001296462,0.0000035827786,0.001226127,0.018008888,0.020269522,0.015870808,0.000058780137,0.9439109],"study_design_scores_gemma":[0.0007836507,0.0008085966,0.0028422435,0.00007416838,0.000008887981,0.00003349115,0.000043126587,0.71869045,0.2628374,0.012838086,0.00060653116,0.00043336154],"about_ca_topic_score_codex":0.000031459727,"about_ca_topic_score_gemma":0.000017311124,"teacher_disagreement_score":0.9434775,"about_ca_system_score_codex":0.00059291313,"about_ca_system_score_gemma":0.00013108851,"threshold_uncertainty_score":0.9997927},"labels":[],"label_agreement":null},{"id":"W2040233837","doi":"10.5555/2682923.2682960","title":"Reducing CTL-live Model Checking to First-Order Logic Validity Checking","year":2014,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Model checking; Computation tree logic; Kripke structure; CTL*; Computer science; Temporal logic; Modal μ-calculus; Abstraction model checking; Theoretical computer science; Partial order reduction; Liveness; Linear temporal logic; Abstraction; Algorithm; Description logic; Multimodal logic; Zeroth-order logic","score_opus":0.18076606694857703,"score_gpt":0.39245590140487885,"score_spread":0.21168983445630182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040233837","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.0026879204,0.000035982423,0.992544,0.0002843553,0.0020216692,0.0010149188,0.0000013850477,0.000589186,0.0008205602],"genre_scores_gemma":[0.029210929,0.000011831888,0.9690157,0.0010987332,0.00038273234,0.0001766284,0.000002633331,0.000060282826,0.00004051914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919407,0.0031011717,0.0013539369,0.0014639399,0.0006976757,0.0014425894],"domain_scores_gemma":[0.9947077,0.0020883097,0.00053218676,0.0019325723,0.0003658403,0.000373412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.018568262,0.0006345742,0.000861575,0.00074564805,0.00057699595,0.00048284864,0.0028593957,0.0003563149,0.000013575203],"category_scores_gemma":[0.0022935413,0.00064609747,0.00020418175,0.001914028,0.00009384226,0.0024180803,0.001555224,0.00080610445,0.00008422713],"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.000041157924,0.00009761218,0.00006723455,0.00007059043,0.00001508937,0.0000058828414,0.002997269,0.6386933,0.0018018127,0.037927475,0.000119489276,0.31816313],"study_design_scores_gemma":[0.0005240504,0.0004731123,0.000622262,0.00021415441,0.000013594159,0.00003621682,0.000020278916,0.9366686,0.019269438,0.041079212,0.0003389532,0.0007401565],"about_ca_topic_score_codex":0.00007185688,"about_ca_topic_score_gemma":0.000004022137,"teacher_disagreement_score":0.317423,"about_ca_system_score_codex":0.00044415242,"about_ca_system_score_gemma":0.00017555866,"threshold_uncertainty_score":0.99959904},"labels":[],"label_agreement":null},{"id":"W2063945695","doi":"10.5555/2682923.2682934","title":"Response property checking via distributed state space exploration","year":2014,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"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":"Liveness; Model checking; Scalability; Computer science; Property (philosophy); State space; State (computer science); Simple (philosophy); Theoretical computer science; Abstraction model checking; Distributed computing; Algorithm; Mathematics","score_opus":0.09403069893817297,"score_gpt":0.3573658922481209,"score_spread":0.2633351933099479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063945695","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.0018270345,0.00002440121,0.9946896,0.00050721935,0.0013919903,0.0008905314,0.000002767,0.00056925317,0.00009720448],"genre_scores_gemma":[0.016880749,0.000009557834,0.9824088,0.00030022932,0.0001289677,0.00016138249,0.000008851449,0.000040573806,0.000060854985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98642296,0.010059482,0.001073944,0.0009332562,0.00055781327,0.0009525205],"domain_scores_gemma":[0.9954282,0.002091073,0.0005082159,0.0014870382,0.00026332735,0.00022211896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.023978475,0.00045374024,0.0005678981,0.00051170355,0.0003015065,0.00040928225,0.0016780614,0.00020586124,0.0000058742485],"category_scores_gemma":[0.0016606728,0.0003700903,0.00012663977,0.00158624,0.00010913976,0.0042594424,0.00067337026,0.0005340544,0.0000559801],"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.00057675684,0.0001306547,0.000057051504,0.0000414591,0.000017567543,0.000012122746,0.001941233,0.06115547,0.013921918,0.0077165994,0.00015674022,0.9142724],"study_design_scores_gemma":[0.0007267661,0.00070312317,0.0016692178,0.00007861085,0.0000058187734,0.000032338223,0.000011483797,0.87999636,0.089866936,0.022878777,0.0035472435,0.0004833076],"about_ca_topic_score_codex":0.000033263943,"about_ca_topic_score_gemma":0.0000017792935,"teacher_disagreement_score":0.9137891,"about_ca_system_score_codex":0.00032087867,"about_ca_system_score_gemma":0.00013099436,"threshold_uncertainty_score":0.9998751},"labels":[],"label_agreement":null}]}