{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008714426,0.00012328592,0.9835984,0.00061735336,0.00012409064,0.00007593296,0.00012103588,0.0013882638,0.0052372366],"genre_scores_gemma":[0.71713424,0.00034737075,0.27429458,0.0008113808,0.00029400532,0.00033732798,0.0003596681,0.0006422518,0.00577915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9860453,0.0034228296,0.0007772157,0.0026224179,0.0060516493,0.0010806385],"domain_scores_gemma":[0.95654655,0.03162896,0.0014665219,0.0063847923,0.003489885,0.00048336986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076176194,0.0010781547,0.0013207394,0.0012450123,0.0012194308,0.0030382553,0.0022274314,0.0014658532,0.007384571],"category_scores_gemma":[0.04491127,0.00074310286,0.0030732097,0.0007175998,0.005658237,0.006288504,0.0046379305,0.0045216465,0.0018622075],"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.00045339044,0.0001329038,0.0014603346,0.00032701864,0.00009928873,0.0005230305,0.00035058294,0.063085005,0.0064003547,0.87537324,0.0030179813,0.048776817],"study_design_scores_gemma":[0.0001676513,0.00012141697,0.00013404073,0.00006319752,0.00006268454,0.00017608202,0.000033438482,0.30159414,0.014839085,0.6772751,0.005477433,0.00005568594],"about_ca_topic_score_codex":0.0014317163,"about_ca_topic_score_gemma":0.0010727446,"teacher_disagreement_score":0.0076176194,"about_ca_system_score_codex":0.0017999336,"about_ca_system_score_gemma":0.003610791,"threshold_uncertainty_score":0.040286303},"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":"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.0070543624,0.00012796801,0.9865724,0.00013774565,0.000016713566,0.0000651361,0.000034190263,0.0053251786,0.0006662339],"genre_scores_gemma":[0.14190894,0.00014432304,0.85592216,0.00013281607,0.00002887408,0.00012849807,0.00012263065,0.00096336566,0.00064843445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99332196,0.0033325413,0.0004488547,0.000656323,0.0019069586,0.00033330484],"domain_scores_gemma":[0.9536895,0.034969885,0.002291989,0.006589267,0.0021607066,0.00029871726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005879229,0.0010668992,0.00092330325,0.0021563363,0.0009917241,0.0019488705,0.0025375772,0.0013065309,0.005158101],"category_scores_gemma":[0.04073914,0.0011751535,0.001510886,0.0011846054,0.0026330762,0.0045039905,0.0037380366,0.0027778812,0.0011533716],"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.00078174117,0.0003064747,0.0044096806,0.0013679992,0.00025009253,0.0011136322,0.0017091251,0.1388243,0.09112188,0.2189869,0.006086624,0.5350416],"study_design_scores_gemma":[0.00022382908,0.00016592894,0.00040672353,0.00015945699,0.00011317854,0.0007432683,0.000109323555,0.7734081,0.121676855,0.09226739,0.010629631,0.00009632343],"about_ca_topic_score_codex":0.0013579173,"about_ca_topic_score_gemma":0.0021613745,"teacher_disagreement_score":0.005879229,"about_ca_system_score_codex":0.0010057675,"about_ca_system_score_gemma":0.0019800202,"threshold_uncertainty_score":0.031092703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022161733,0.00005119733,0.9736139,0.0002716386,0.000042661024,0.00008894535,0.000087091415,0.0013658996,0.0023170277],"genre_scores_gemma":[0.6012533,0.00017420715,0.39445338,0.00033711022,0.000056670273,0.00028401444,0.0005108418,0.00040977923,0.0025206576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952382,0.0012828629,0.00021137414,0.00044401706,0.0021188296,0.00070466916],"domain_scores_gemma":[0.98621964,0.00881096,0.0005523812,0.002638816,0.001582076,0.00019609483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003388812,0.00065074617,0.00084867334,0.0011041478,0.0010414569,0.0021689362,0.0024635342,0.00090358796,0.0019819895],"category_scores_gemma":[0.014204606,0.00050516514,0.0028137942,0.00063145434,0.0028123562,0.0031954492,0.0034535187,0.0039624134,0.00038220664],"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.0002591927,0.00034874846,0.0022829326,0.00034077498,0.0001885461,0.00078109355,0.0007824131,0.48671737,0.021252431,0.40083632,0.0022736331,0.08393649],"study_design_scores_gemma":[0.000046477562,0.000043138967,0.00014818962,0.000029530203,0.00006235622,0.00007574981,0.00008927279,0.7664654,0.024758026,0.20641927,0.0018424462,0.0000200607],"about_ca_topic_score_codex":0.007752602,"about_ca_topic_score_gemma":0.008171705,"teacher_disagreement_score":0.007752602,"about_ca_system_score_codex":0.0021367802,"about_ca_system_score_gemma":0.00404966,"threshold_uncertainty_score":0.017921925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044285294,0.00006363417,0.9480127,0.00016297075,0.000017522407,0.000096130825,0.00013859813,0.0059713754,0.00125182],"genre_scores_gemma":[0.7368943,0.000063631385,0.26054487,0.00008771506,0.000013963783,0.00031027183,0.0002975007,0.0003667131,0.0014209908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949469,0.0020347214,0.0002676031,0.000993739,0.0013267272,0.00043030604],"domain_scores_gemma":[0.98736763,0.008307192,0.00088256295,0.0026162784,0.0006480068,0.00017838704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038421915,0.0010988107,0.0012617206,0.001108661,0.00097467325,0.0019360846,0.0027043857,0.0010606388,0.002908751],"category_scores_gemma":[0.013771532,0.0007878622,0.0017532728,0.0009734139,0.0025086424,0.005056862,0.0041831955,0.0018028986,0.00039999324],"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.0006616762,0.00021855066,0.004962025,0.00026964353,0.00013031949,0.00033081145,0.0004813136,0.8218365,0.015305178,0.058525864,0.0014403244,0.09583783],"study_design_scores_gemma":[0.000050982635,0.000039975537,0.000117276,0.000009898868,0.000019189676,0.000029390892,0.000033606484,0.96634555,0.0067556035,0.02599287,0.00059293717,0.000012650345],"about_ca_topic_score_codex":0.0056322166,"about_ca_topic_score_gemma":0.008920793,"teacher_disagreement_score":0.0056322166,"about_ca_system_score_codex":0.0015432715,"about_ca_system_score_gemma":0.0032316197,"threshold_uncertainty_score":0.0203197},"labels":[],"label_agreement":null}]}