{"meta":{"query_hash":"cd61460a4cf7","filters":{"venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic"},"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/cd61460a4cf7","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings%2FProceedings+-+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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04121908588327169,"score_gpt":0.26219762762667925,"score_spread":0.22097854174340756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130753923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9566867,0.0001477936,0.015830452,0.010261344,0.00152325,0.0014362463,0.00013509762,0.0015661457,0.012412997],"genre_scores_gemma":[0.9285624,0.000095892145,0.06460031,0.0022223324,0.001583569,0.000121034056,0.0000946291,0.00009075053,0.002629059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960447,0.000014419,0.0006481357,0.0016343284,0.0008900669,0.0007683732],"domain_scores_gemma":[0.9975913,0.00025986004,0.00045937236,0.0002471708,0.0010317037,0.00041055414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067084696,0.0005667546,0.0004752467,0.0004976041,0.0011501875,0.0004780664,0.001715025,0.00025971016,0.0000129753425],"category_scores_gemma":[0.00073864363,0.00053787325,0.0002225919,0.00072237715,0.00020100272,0.0013015169,0.0005263051,0.0006174512,0.000021806494],"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.0016378431,0.0071698534,0.094859205,0.0014484496,0.0014096415,0.000120714016,0.026090845,0.0092957225,0.24350683,0.42965105,0.13323486,0.05157499],"study_design_scores_gemma":[0.004730248,0.0024578448,0.009362539,0.00041762166,0.000078560566,0.0010964945,0.0010097641,0.9036392,0.0042734873,0.005627443,0.06568717,0.0016196019],"about_ca_topic_score_codex":0.000029496443,"about_ca_topic_score_gemma":0.0000020028206,"teacher_disagreement_score":0.8943435,"about_ca_system_score_codex":0.00021875635,"about_ca_system_score_gemma":0.00006733297,"threshold_uncertainty_score":0.9997073},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022904388030979717,"score_gpt":0.2832383008233843,"score_spread":0.2603339127924046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137983774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8701322,0.00011384828,0.06407922,0.0032609506,0.0028937603,0.00095902244,0.00002109884,0.0010078576,0.05753203],"genre_scores_gemma":[0.96957576,0.00004473854,0.028077178,0.0009932631,0.00083652756,0.00007135261,0.00001024158,0.000051756484,0.0003391975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949063,0.000010407605,0.0013220143,0.00134436,0.0014352119,0.0009817074],"domain_scores_gemma":[0.9967313,0.00030961016,0.0009676784,0.00023959613,0.0014025074,0.00034930222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014274886,0.00064699777,0.000641702,0.00055772933,0.00026295835,0.0003530612,0.0027990867,0.000310762,0.000060359624],"category_scores_gemma":[0.001079411,0.00057571405,0.00037467925,0.0008285935,0.00024698453,0.0017559174,0.0007452405,0.00058968324,0.00010487046],"study_design_candidate":"bench_or_experimental","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.0005986651,0.0007082539,0.033283554,0.000107711356,0.00016886256,0.00001964325,0.0019229354,0.00016558115,0.20999008,0.74760133,0.0006958167,0.004737586],"study_design_scores_gemma":[0.006609132,0.002992654,0.030734235,0.00059191685,0.0001093709,0.00035439528,0.001747323,0.09773306,0.7808942,0.061535966,0.013963692,0.0027340169],"about_ca_topic_score_codex":0.000024685873,"about_ca_topic_score_gemma":0.0000018949622,"teacher_disagreement_score":0.6860653,"about_ca_system_score_codex":0.00029311512,"about_ca_system_score_gemma":0.000040074647,"threshold_uncertainty_score":0.99966943},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031962478156664184,"score_gpt":0.3046107170511642,"score_spread":0.2726482388945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169019194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15410344,0.00008792926,0.7576938,0.0021340265,0.0026867606,0.0017404691,0.00001642026,0.0012542496,0.080282904],"genre_scores_gemma":[0.4145735,0.000020191706,0.583761,0.0006821907,0.00052729825,0.00014022113,0.0000070290416,0.000043836917,0.00024476077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960976,0.00000757906,0.0008748962,0.0012848885,0.000867631,0.00086737354],"domain_scores_gemma":[0.9971079,0.00045349775,0.0006256547,0.00017898975,0.0013677701,0.00026615118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036108121,0.00048596977,0.0003831925,0.00044305623,0.00053768896,0.0008461815,0.0016139632,0.00027738354,0.00001152919],"category_scores_gemma":[0.0034833287,0.0004819559,0.00012848886,0.00067415874,0.00012343122,0.0019699153,0.00051759795,0.00044811307,0.000018810786],"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.0002247606,0.00013053864,0.005290722,0.00013626138,0.00006114885,0.0000013818274,0.0009757932,0.000050011102,0.12379984,0.86362886,0.0002634706,0.005437199],"study_design_scores_gemma":[0.0043225633,0.0012363625,0.008814076,0.0005020128,0.00007103581,0.00027204375,0.001161906,0.73794913,0.15603384,0.05529516,0.03247577,0.0018660823],"about_ca_topic_score_codex":0.000020412685,"about_ca_topic_score_gemma":8.280622e-7,"teacher_disagreement_score":0.8083337,"about_ca_system_score_codex":0.00036561387,"about_ca_system_score_gemma":0.000033395892,"threshold_uncertainty_score":0.9997632},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04524962904147683,"score_gpt":0.31382081610231305,"score_spread":0.2685711870608362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170320990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82862884,0.000024546094,0.14768603,0.0006893526,0.0021744743,0.0010980333,0.000044538247,0.0014687806,0.018185422],"genre_scores_gemma":[0.98192674,0.0000069707103,0.01713269,0.0005175476,0.00017299085,0.00005310397,0.000026740485,0.000065663626,0.00009755319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9948507,0.000022268963,0.0011714153,0.0013429249,0.0018431961,0.0007694959],"domain_scores_gemma":[0.99443436,0.001050249,0.0011416653,0.0002140856,0.002893908,0.00026571561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023068811,0.00064360345,0.0005792272,0.0010586714,0.0002572882,0.00036160238,0.0023062306,0.00031719691,0.000017941937],"category_scores_gemma":[0.003123745,0.00061633554,0.0002387754,0.0013503309,0.000165511,0.0009596786,0.0004311172,0.00071852596,0.000056601857],"study_design_candidate":"observational","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.0023031686,0.0029539214,0.25913775,0.0003262857,0.0005327722,0.000022448552,0.006761599,0.0018885181,0.24258667,0.46142745,0.003651715,0.018407686],"study_design_scores_gemma":[0.00376082,0.004047873,0.4893568,0.00095132936,0.000055623936,0.000117412485,0.00044574318,0.34212723,0.140367,0.016241128,0.00016417836,0.0023648562],"about_ca_topic_score_codex":0.00021883308,"about_ca_topic_score_gemma":0.000023776376,"teacher_disagreement_score":0.44518635,"about_ca_system_score_codex":0.00049371785,"about_ca_system_score_gemma":0.000053849635,"threshold_uncertainty_score":0.9996288},"labels":[],"label_agreement":null}]}