{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000670847,0.0005667546,0.0004752467,0.0004976041,0.001150187,0.0004780664,0.001715025,0.0002597102,0.00001297534],"category_scores_gemma":[0.0007386436,0.0005378732,0.0002225919,0.0007223772,0.0002010027,0.001301517,0.0005263051,0.0006174512,0.00002180649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002187564,"about_ca_system_score_gemma":0.00006733297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002949644,"about_ca_topic_score_gemma":0.000002002821,"domain_scores_codex":[0.9960447,0.000014419,0.0006481357,0.001634328,0.0008900669,0.0007683732],"domain_scores_gemma":[0.9975913,0.00025986,0.0004593724,0.0002471708,0.001031704,0.0004105541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001637843,0.007169853,0.09485921,0.00144845,0.001409641,0.000120714,0.02609085,0.009295722,0.2435068,0.4296511,0.1332349,0.05157499],"study_design_scores_gemma":[0.004730248,0.002457845,0.009362539,0.0004176217,0.00007856057,0.001096494,0.001009764,0.9036392,0.004273487,0.005627443,0.06568717,0.001619602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9566867,0.0001477936,0.01583045,0.01026134,0.00152325,0.001436246,0.0001350976,0.001566146,0.012413],"genre_scores_gemma":[0.9285624,0.00009589214,0.06460031,0.002222332,0.001583569,0.0001210341,0.0000946291,0.00009075053,0.002629059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8943435,"threshold_uncertainty_score":0.9997073,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002306881,0.0006436034,0.0005792272,0.001058671,0.0002572882,0.0003616024,0.002306231,0.0003171969,0.00001794194],"category_scores_gemma":[0.003123745,0.0006163355,0.0002387754,0.001350331,0.000165511,0.0009596786,0.0004311172,0.000718526,0.00005660186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004937178,"about_ca_system_score_gemma":0.00005384964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002188331,"about_ca_topic_score_gemma":0.00002377638,"domain_scores_codex":[0.9948507,0.00002226896,0.001171415,0.001342925,0.001843196,0.0007694959],"domain_scores_gemma":[0.9944344,0.001050249,0.001141665,0.0002140856,0.002893908,0.0002657156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.002303169,0.002953921,0.2591377,0.0003262857,0.0005327722,0.00002244855,0.006761599,0.001888518,0.2425867,0.4614275,0.003651715,0.01840769],"study_design_scores_gemma":[0.00376082,0.004047873,0.4893568,0.0009513294,0.00005562394,0.0001174125,0.0004457432,0.3421272,0.140367,0.01624113,0.0001641784,0.002364856],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8286288,0.00002454609,0.147686,0.0006893526,0.002174474,0.001098033,0.00004453825,0.001468781,0.01818542],"genre_scores_gemma":[0.9819267,0.00000697071,0.01713269,0.0005175476,0.0001729909,0.00005310397,0.00002674048,0.00006566363,0.00009755319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4451863,"threshold_uncertainty_score":0.9996288,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003610812,0.0004859698,0.0003831925,0.0004430562,0.000537689,0.0008461815,0.001613963,0.0002773835,0.00001152919],"category_scores_gemma":[0.003483329,0.0004819559,0.0001284889,0.0006741587,0.0001234312,0.001969915,0.0005175979,0.0004481131,0.00001881079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003656139,"about_ca_system_score_gemma":0.00003339589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002041268,"about_ca_topic_score_gemma":8.280622e-7,"domain_scores_codex":[0.9960976,0.00000757906,0.0008748962,0.001284888,0.000867631,0.0008673735],"domain_scores_gemma":[0.9971079,0.0004534977,0.0006256547,0.0001789898,0.00136777,0.0002661512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002247606,0.0001305386,0.005290722,0.0001362614,0.00006114885,0.000001381827,0.0009757932,0.0000500111,0.1237998,0.8636289,0.0002634706,0.005437199],"study_design_scores_gemma":[0.004322563,0.001236362,0.008814076,0.0005020128,0.00007103581,0.0002720437,0.001161906,0.7379491,0.1560338,0.05529516,0.03247577,0.001866082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1541034,0.00008792926,0.7576938,0.002134026,0.002686761,0.001740469,0.00001642026,0.00125425,0.0802829],"genre_scores_gemma":[0.4145735,0.00002019171,0.583761,0.0006821907,0.0005272983,0.0001402211,0.000007029042,0.00004383692,0.0002447608],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8083337,"threshold_uncertainty_score":0.9997632,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001427489,0.0006469978,0.000641702,0.0005577293,0.0002629583,0.0003530612,0.002799087,0.000310762,0.00006035962],"category_scores_gemma":[0.001079411,0.000575714,0.0003746792,0.0008285935,0.0002469845,0.001755917,0.0007452405,0.0005896832,0.0001048705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002931151,"about_ca_system_score_gemma":0.00004007465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002468587,"about_ca_topic_score_gemma":0.000001894962,"domain_scores_codex":[0.9949063,0.00001040761,0.001322014,0.00134436,0.001435212,0.0009817074],"domain_scores_gemma":[0.9967313,0.0003096102,0.0009676784,0.0002395961,0.001402507,0.0003493022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005986651,0.0007082539,0.03328355,0.0001077114,0.0001688626,0.00001964325,0.001922935,0.0001655812,0.2099901,0.7476013,0.0006958167,0.004737586],"study_design_scores_gemma":[0.006609132,0.002992654,0.03073424,0.0005919168,0.0001093709,0.0003543953,0.001747323,0.09773306,0.7808942,0.06153597,0.01396369,0.002734017],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8701322,0.0001138483,0.06407922,0.003260951,0.00289376,0.0009590224,0.00002109884,0.001007858,0.05753203],"genre_scores_gemma":[0.9695758,0.00004473854,0.02807718,0.0009932631,0.0008365276,0.00007135261,0.00001024158,0.00005175648,0.0003391975],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6860653,"threshold_uncertainty_score":0.9996694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}