{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"cd61460a4cf7","filters":{"venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic"}},"results":[{"id":"W2130753923","doi":"10.1109/ismvl.2008.43","title":"RevLib: An Online Resource for Reversible Functions and Reversible Circuits","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":497,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Resource (disambiguation); Electronic circuit; Set (abstract data type); Logic gate; Theoretical computer science; Computer engineering; Distributed computing; Computer architecture; Algorithm; Electrical engineering; Computer network; Engineering; Programming language","authors":[{"name":"Robert Wille","is_ca":false},{"name":"Daniel Gro","is_ca":false},{"name":"Gerhard W. Dueck","is_ca":true},{"name":"Rolf Drechsler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04121908588327169,"gpt":0.2621976276266793,"spread":0.2209785417434076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003238959,0.002650042,0.002936544,0.004763471,0.0008025358,0.004205006,0.008232994,0.002616602,0.1281551],"category_scores_gemma":[0.01494015,0.002078359,0.002374921,0.005189218,0.000955086,0.00909526,0.004406926,0.003057519,0.08398505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002342207,"about_ca_system_score_gemma":0.002903355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001509709,"about_ca_topic_score_gemma":0.001995747,"domain_scores_codex":[0.9972289,0.000549485,0.0003672928,0.0003506501,0.001194515,0.0003091524],"domain_scores_gemma":[0.9922734,0.003344354,0.0005371867,0.002440992,0.001118817,0.000285356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001145854,0.0002727271,0.0006321032,0.003092486,0.0001091955,0.0005351149,0.0001148002,0.01290138,0.0078673,0.06939674,0.6293535,0.2745789],"study_design_scores_gemma":[0.0006562932,0.0001690364,0.0004883992,0.0005049001,0.00008185508,0.0007414633,0.00004057131,0.04783189,0.03434527,0.08541958,0.8294463,0.0002746561],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.003137247,0.00309042,0.3736192,0.0006922128,0.0004445292,0.000453815,0.05620716,0.5191721,0.04318319],"genre_scores_gemma":[0.07161728,0.00497727,0.4492694,0.00237722,0.0006940402,0.002697529,0.2055156,0.2112681,0.05158363],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.1281551,"threshold_uncertainty_score":0.4287215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170320990","doi":"10.1109/ismvl.2007.53","title":"Survey of Stochastic Computation on Factor Graphs","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Factor graph; Computation; Computer science; Decoding methods; Low-density parity-check code; Theoretical computer science; Graph; Representation (politics); Algorithm; Digital electronics; Factor (programming language); Electronic circuit","authors":[{"name":"Saeed Sharifi Tehrani","is_ca":true},{"name":"Shie Mannor","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04524962904147683,"gpt":0.313820816102313,"spread":0.2685711870608362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007451944,0.0007981148,0.001341619,0.001896391,0.0005480949,0.001542805,0.0009955931,0.0009314349,0.00349336],"category_scores_gemma":[0.002958989,0.0005413606,0.000978626,0.003881977,0.001158875,0.002479155,0.0009714512,0.001151555,0.001043962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100306,"about_ca_system_score_gemma":0.001233727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001776831,"about_ca_topic_score_gemma":0.001177136,"domain_scores_codex":[0.9992091,0.0002283836,0.0000667248,0.0001464695,0.0002873497,0.00006210374],"domain_scores_gemma":[0.9987457,0.0007969451,0.00005727142,0.000158177,0.0002050806,0.00003676591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004785366,0.00004336825,0.0004975451,0.001304695,0.0000598342,0.00008692651,0.0001254062,0.06054907,0.001621467,0.733826,0.007593069,0.1942446],"study_design_scores_gemma":[0.00001975412,0.00008481753,0.000431872,0.0003246265,0.00003914127,0.0003350253,0.00004518264,0.2440656,0.002168465,0.6390372,0.1133841,0.00006422471],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.009483472,0.07332153,0.8760004,0.001237524,0.0004947172,0.00006951105,0.0003474442,0.0005155054,0.03852994],"genre_scores_gemma":[0.340999,0.2405662,0.3946277,0.001181926,0.002818031,0.0003512494,0.001158226,0.0006131714,0.01768458],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.00349336,"threshold_uncertainty_score":0.0116865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169019194","doi":"10.1109/ismvl.2007.59","title":"Variable Reordering and Sifting for QMDD","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable (mathematics); Computer science; Quantum; Electronic circuit; Algorithm; Mathematics; Engineering; Electrical engineering; Physics","authors":[{"name":"D. Michael Miller","is_ca":true},{"name":"David Y. Feinstein","is_ca":false},{"name":"Mitchell A. Thornton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03196247815666418,"gpt":0.3046107170511642,"spread":0.2726482388945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008981585,0.0004786503,0.0005452202,0.0008266069,0.000446666,0.0007976423,0.000749409,0.0003654139,0.00240707],"category_scores_gemma":[0.00157223,0.0002387818,0.0005988505,0.0008528368,0.0009197219,0.001681651,0.0005516962,0.0006865472,0.000373971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005938233,"about_ca_system_score_gemma":0.0005978955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006303483,"about_ca_topic_score_gemma":0.0008850258,"domain_scores_codex":[0.9991189,0.000281663,0.00008565072,0.0001673724,0.000254091,0.00009238919],"domain_scores_gemma":[0.9990144,0.0004127857,0.0001077946,0.0003428311,0.0001020495,0.00002013284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002612934,0.00004330732,0.0006703,0.0003991413,0.00003740548,0.0004429308,0.000326955,0.05679938,0.05873174,0.4261512,0.001720708,0.4544156],"study_design_scores_gemma":[0.00009642038,0.0005091826,0.0004819479,0.0001600435,0.0001124417,0.001078429,0.0001870832,0.3776986,0.2132278,0.339775,0.06655746,0.0001155846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01524506,0.0004080743,0.9818979,0.00005937986,0.00005117029,0.00004242203,0.00004081643,0.000561084,0.001694081],"genre_scores_gemma":[0.3856291,0.000650475,0.610052,0.0001204958,0.00006789654,0.00007061961,0.0002192925,0.0002131366,0.002977091],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00240707,"threshold_uncertainty_score":0.008052468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137983774","doi":"10.1109/ismvl.2007.35","title":"Monoidal Intervals of Partial Clones","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Unary operation; Monoid; Symmetric monoidal category; Mathematics; Interval (graph theory); Cardinality (data modeling); Discrete mathematics; Monoidal category; Combinatorics; Pure mathematics; Computer science; Functor","authors":[{"name":"Lucien Haddad","is_ca":true},{"name":"Hajime Machida","is_ca":false},{"name":"Ivo G. Rosenberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02290438803097972,"gpt":0.2832383008233843,"spread":0.2603339127924046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009780085,0.000347171,0.0004426963,0.002451369,0.00151845,0.00256812,0.000550577,0.0005423095,0.002509068],"category_scores_gemma":[0.003508871,0.0003798346,0.000679017,0.00138633,0.001303066,0.002306488,0.001558425,0.0007057075,0.000279038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00156462,"about_ca_system_score_gemma":0.0005279729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073447,"about_ca_topic_score_gemma":0.0006248329,"domain_scores_codex":[0.9987563,0.0001736329,0.0001373448,0.0003730332,0.0003571791,0.0002025113],"domain_scores_gemma":[0.99713,0.0008685537,0.0006173776,0.0003551772,0.0005647379,0.0004641776],"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.0002523093,0.00004329353,0.005946185,0.00008030336,0.00003844573,0.0005194991,0.002095785,0.001870538,0.01422296,0.9471485,0.0006049211,0.02717732],"study_design_scores_gemma":[0.0001223198,0.0004447648,0.02420413,0.0001669841,0.0001671498,0.002779434,0.002214271,0.02694248,0.0324855,0.8598844,0.05045341,0.000135179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8984417,0.0008988739,0.07835054,0.0001406809,0.00004461942,0.00006148414,0.0004548551,0.0002291845,0.02137805],"genre_scores_gemma":[0.9681095,0.0002432239,0.02574087,0.00004776009,0.00006667648,0.0001220465,0.0004117061,0.00003034629,0.005227815],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00256812,"threshold_uncertainty_score":0.01135218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}