{"meta":{"query_hash":"a1e3c11d4e83","filters":{"venue":"MBMV"},"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/a1e3c11d4e83","api":"https://metacan.xera.ac/api/v1/cohort?venue=MBMV"},"results":[{"id":"W2398409825","doi":"","title":"Equivalence Checking of Reversible Circuits.","year":2009,"lang":"en","type":"article","venue":"MBMV","topic":"Quantum Computing Algorithms and Architecture","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 Victoria","funders":"","keywords":"Formal equivalence checking; Electronic circuit; Equivalence (formal languages); Boolean function; Computer science; Boolean satisfiability problem; Logical equivalence; Boolean circuit; Arithmetic; Sequential logic; Logic gate; Mathematics; Algorithm; Theoretical computer science; Formal verification; Discrete mathematics; Electrical engineering; Engineering","score_opus":0.01579356377274699,"score_gpt":0.24397304191080402,"score_spread":0.22817947813805703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398409825","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.04356463,0.0004573755,0.94618124,0.00040122363,0.00012915382,0.00018546291,0.0003017802,0.0015609883,0.0072181425],"genre_scores_gemma":[0.7153337,0.00065852155,0.27730024,0.0004140126,0.00013691085,0.0002650598,0.0012634434,0.00036324328,0.004264939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933228,0.0024021794,0.00032727185,0.0010387851,0.0024051273,0.0005038983],"domain_scores_gemma":[0.98174804,0.01351772,0.0011878101,0.002339941,0.0010541284,0.00015237137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036030037,0.0006221763,0.0009357936,0.0016445466,0.00097105606,0.0019322709,0.0023356115,0.0012358957,0.0068229986],"category_scores_gemma":[0.02511197,0.00061772886,0.0020972565,0.0013537013,0.0029250933,0.0050134016,0.0023127252,0.0020678875,0.0006370182],"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.00045529366,0.000231184,0.0024633657,0.00063697994,0.00022092072,0.00052834034,0.00040198537,0.08097059,0.022348361,0.6924723,0.0033769854,0.19589372],"study_design_scores_gemma":[0.00013320104,0.00020099086,0.0006472133,0.00007519273,0.000098032964,0.0003471526,0.000117261974,0.29623976,0.049041804,0.6441349,0.008919077,0.00004536084],"about_ca_topic_score_codex":0.0020786696,"about_ca_topic_score_gemma":0.0022023376,"teacher_disagreement_score":0.0068229986,"about_ca_system_score_codex":0.0016757676,"about_ca_system_score_gemma":0.0020937696,"threshold_uncertainty_score":0.022825241},"labels":[],"label_agreement":null}]}