{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"a1e3c11d4e83","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Robert Wille","is_ca":false},{"name":"Daniel Große","is_ca":false},{"name":"D. Michael Miller","is_ca":true},{"name":"Rolf Drechsler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01579356377274699,"gpt":0.243973041910804,"spread":0.228179478138057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003603004,0.0006221763,0.0009357936,0.001644547,0.0009710561,0.001932271,0.002335611,0.001235896,0.006822999],"category_scores_gemma":[0.02511197,0.0006177289,0.002097256,0.001353701,0.002925093,0.005013402,0.002312725,0.002067887,0.0006370182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001675768,"about_ca_system_score_gemma":0.00209377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00207867,"about_ca_topic_score_gemma":0.002202338,"domain_scores_codex":[0.9933228,0.002402179,0.0003272718,0.001038785,0.002405127,0.0005038983],"domain_scores_gemma":[0.981748,0.01351772,0.00118781,0.002339941,0.001054128,0.0001523714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004552937,0.000231184,0.002463366,0.0006369799,0.0002209207,0.0005283403,0.0004019854,0.08097059,0.02234836,0.6924723,0.003376985,0.1958937],"study_design_scores_gemma":[0.000133201,0.0002009909,0.0006472133,0.00007519273,0.00009803296,0.0003471526,0.000117262,0.2962398,0.0490418,0.6441349,0.008919077,0.00004536084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04356463,0.0004573755,0.9461812,0.0004012236,0.0001291538,0.0001854629,0.0003017802,0.001560988,0.007218143],"genre_scores_gemma":[0.7153337,0.0006585215,0.2773002,0.0004140126,0.0001369109,0.0002650598,0.001263443,0.0003632433,0.004264939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006822999,"threshold_uncertainty_score":0.02282524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}