{"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031372472,0.0030904196,0.3736192,0.00069221284,0.0004445292,0.00045381495,0.05620716,0.51917213,0.043183185],"genre_scores_gemma":[0.07161728,0.0049772705,0.44926935,0.0023772204,0.0006940402,0.002697529,0.20551561,0.21126813,0.051583625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972289,0.000549485,0.0003672928,0.00035065014,0.0011945154,0.00030915235],"domain_scores_gemma":[0.9922734,0.0033443535,0.0005371867,0.002440992,0.0011188169,0.00028535599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003238959,0.0026500418,0.0029365444,0.004763471,0.0008025358,0.004205006,0.008232994,0.0026166018,0.12815511],"category_scores_gemma":[0.01494015,0.002078359,0.002374921,0.005189218,0.000955086,0.00909526,0.0044069258,0.0030575187,0.08398505],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0011458535,0.0002727271,0.0006321032,0.0030924857,0.0001091955,0.0005351149,0.00011480022,0.012901377,0.0078673,0.06939674,0.62935346,0.27457887],"study_design_scores_gemma":[0.00065629324,0.00016903636,0.0004883992,0.0005049001,0.000081855076,0.0007414633,0.000040571314,0.04783189,0.034345273,0.08541958,0.82944626,0.00027465608],"about_ca_topic_score_codex":0.0015097088,"about_ca_topic_score_gemma":0.0019957465,"teacher_disagreement_score":0.12815511,"about_ca_system_score_codex":0.0023422074,"about_ca_system_score_gemma":0.002903355,"threshold_uncertainty_score":0.42872155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8984417,0.0008988739,0.07835054,0.00014068089,0.000044619417,0.00006148414,0.0004548551,0.00022918452,0.021378053],"genre_scores_gemma":[0.96810955,0.00024322394,0.02574087,0.000047760088,0.00006667648,0.000122046455,0.0004117061,0.000030346291,0.0052278154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987563,0.00017363288,0.00013734482,0.00037303317,0.00035717915,0.00020251128],"domain_scores_gemma":[0.99713,0.0008685537,0.0006173776,0.00035517718,0.00056473794,0.0004641776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009780085,0.000347171,0.00044269633,0.0024513693,0.0015184495,0.0025681197,0.00055057695,0.0005423095,0.0025090682],"category_scores_gemma":[0.0035088714,0.00037983456,0.000679017,0.0013863299,0.0013030662,0.0023064876,0.0015584246,0.00070570747,0.00027903795],"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.00025230928,0.000043293527,0.0059461854,0.00008030336,0.000038445734,0.00051949907,0.0020957848,0.0018705383,0.014222965,0.9471485,0.00060492114,0.027177317],"study_design_scores_gemma":[0.00012231982,0.00044476477,0.024204135,0.00016698407,0.00016714977,0.0027794342,0.0022142713,0.026942478,0.032485504,0.8598844,0.050453413,0.00013517895],"about_ca_topic_score_codex":0.0010734469,"about_ca_topic_score_gemma":0.0006248329,"teacher_disagreement_score":0.0025681197,"about_ca_system_score_codex":0.0015646203,"about_ca_system_score_gemma":0.0005279729,"threshold_uncertainty_score":0.011352181},"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":"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.01524506,0.00040807427,0.9818979,0.00005937986,0.000051170286,0.000042422027,0.000040816434,0.000561084,0.0016940812],"genre_scores_gemma":[0.38562906,0.00065047503,0.610052,0.000120495846,0.00006789654,0.00007061961,0.00021929249,0.00021313656,0.002977091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911886,0.00028166297,0.00008565072,0.00016737242,0.00025409096,0.000092389186],"domain_scores_gemma":[0.9990144,0.00041278565,0.000107794636,0.00034283113,0.00010204954,0.000020132842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089815847,0.00047865027,0.0005452202,0.0008266069,0.00044666603,0.0007976423,0.00074940897,0.00036541387,0.0024070698],"category_scores_gemma":[0.0015722301,0.00023878178,0.00059885054,0.0008528368,0.0009197219,0.0016816509,0.00055169617,0.0006865472,0.00037397095],"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.00026129337,0.00004330732,0.0006703,0.00039914134,0.000037405483,0.00044293076,0.00032695502,0.056799382,0.058731742,0.42615125,0.001720708,0.4544156],"study_design_scores_gemma":[0.00009642038,0.00050918263,0.00048194788,0.00016004352,0.000112441674,0.001078429,0.00018708323,0.37769863,0.21322782,0.33977497,0.06655746,0.00011558457],"about_ca_topic_score_codex":0.0006303483,"about_ca_topic_score_gemma":0.00088502583,"teacher_disagreement_score":0.0024070698,"about_ca_system_score_codex":0.0005938233,"about_ca_system_score_gemma":0.00059789553,"threshold_uncertainty_score":0.008052468},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094834715,0.07332153,0.8760004,0.0012375244,0.0004947172,0.00006951105,0.0003474442,0.0005155054,0.038529936],"genre_scores_gemma":[0.34099898,0.24056618,0.39462766,0.0011819255,0.0028180312,0.00035124941,0.0011582264,0.0006131714,0.017684583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992091,0.00022838356,0.0000667248,0.00014646952,0.00028734969,0.00006210374],"domain_scores_gemma":[0.9987457,0.0007969451,0.000057271416,0.000158177,0.00020508059,0.00003676591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074519444,0.00079811475,0.0013416186,0.0018963912,0.00054809486,0.001542805,0.0009955931,0.0009314349,0.00349336],"category_scores_gemma":[0.0029589885,0.0005413606,0.000978626,0.0038819774,0.0011588753,0.0024791546,0.00097145117,0.0011515552,0.0010439616],"study_design_candidate":"not_applicable","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.00004785366,0.00004336825,0.0004975451,0.0013046955,0.000059834198,0.000086926506,0.00012540621,0.060549065,0.001621467,0.733826,0.007593069,0.19424464],"study_design_scores_gemma":[0.000019754125,0.00008481753,0.000431872,0.0003246265,0.000039141265,0.00033502534,0.00004518264,0.24406558,0.0021684647,0.6390372,0.11338408,0.00006422471],"about_ca_topic_score_codex":0.0017768313,"about_ca_topic_score_gemma":0.0011771355,"teacher_disagreement_score":0.00349336,"about_ca_system_score_codex":0.0011003058,"about_ca_system_score_gemma":0.0012337269,"threshold_uncertainty_score":0.011686504},"labels":[],"label_agreement":null}]}