{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":40,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":40,"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":"5f1b5b4f0626","filters":{"venue":"Order"}},"results":[{"id":"W1965001312","doi":"10.1007/s11083-011-9234-0","title":"MV-semirings and their Sheaf Representations","year":2011,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Semiring; Sheaf; Commutative property; Equivalence (formal languages); Representation (politics); Pure mathematics; Idempotence; Algebra over a field; Prime (order theory); Categorical variable; Kleene algebra; Class (philosophy); Discrete mathematics; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02919570014018854,"gpt":0.2387230834537752,"spread":0.2095273833135867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003679817,0.00004931607,0.00004669483,0.00002287999,0.0000656261,0.00002266286,0.0001785351,0.00001752024,0.00006866358],"category_scores_gemma":[0.00001716995,0.00003617489,0.00001126255,0.0001411248,0.00003095857,0.0002544839,0.0001103356,0.00004326399,0.00004611561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002749531,"about_ca_system_score_gemma":0.000008274113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001332702,"about_ca_topic_score_gemma":0.00000397798,"domain_scores_codex":[0.99963,0.000009712917,0.00005516044,0.0001680451,0.0000348207,0.0001022875],"domain_scores_gemma":[0.9996617,0.00002286812,0.0000180304,0.0002343893,0.00002598324,0.00003703626],"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.000005439517,0.0001051223,0.01302215,0.0000106769,0.00002235585,0.00001848738,0.01685938,0.00001798198,0.002123571,0.7820012,0.002203208,0.1836105],"study_design_scores_gemma":[0.0007534077,0.00016292,0.1575336,0.00002152557,0.000007361484,0.0001048199,0.000730181,0.01006966,0.01437464,0.7732766,0.04234521,0.0006200824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07969365,0.0001892953,0.8711616,0.0005878744,0.0001414158,0.00007551722,4.950912e-7,0.0001485144,0.04800167],"genre_scores_gemma":[0.9407535,0.00001933679,0.05770281,0.0004532785,0.000020419,0.00000821565,4.172637e-7,0.000003838772,0.00103814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8610599,"threshold_uncertainty_score":0.1475169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963598054","doi":"10.1007/s11083-012-9281-1","title":"Notes on Planar Semimodular Lattices. VII. Resections of Planar Semimodular Lattices","year":2012,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Planar; Combinatorics; Mathematics; Distributive lattice; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02726602632467901,"gpt":0.2746508667821295,"spread":0.2473848404574505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757596,0.000207658,0.0002495956,0.0001486688,0.0001887151,0.0000444487,0.0006080627,0.0001214368,0.00008983003],"category_scores_gemma":[0.0001499544,0.0001705975,0.00007410537,0.0005624507,0.00007695486,0.0007151967,0.00008563826,0.0002339737,0.0002361554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002988025,"about_ca_system_score_gemma":0.00003444629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005324796,"about_ca_topic_score_gemma":0.00002638967,"domain_scores_codex":[0.998466,0.00008226647,0.0002524407,0.0003599568,0.0003526976,0.0004866626],"domain_scores_gemma":[0.9985669,0.000309027,0.0001505099,0.0007249483,0.00009504997,0.0001535994],"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.00008854272,0.001608813,0.0547708,0.00026323,0.0003520294,0.00006981719,0.005671402,0.005295278,0.0191228,0.8674049,0.006987042,0.03836528],"study_design_scores_gemma":[0.004614715,0.00224722,0.1614975,0.0007156759,0.0003062643,0.0002464449,0.0009260192,0.0325875,0.1168948,0.1330758,0.5425383,0.004349744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4316029,0.003030782,0.5310137,0.004312546,0.002190883,0.000588735,0.00004574224,0.0006488899,0.02656581],"genre_scores_gemma":[0.9676263,0.0000498157,0.03098469,0.0005934353,0.0002496828,0.0000148994,0.00000999614,0.00001975193,0.0004513886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7343292,"threshold_uncertainty_score":0.6956766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981167177","doi":"10.1007/s11083-010-9175-z","title":"Join-Irreducible Boolean Functions","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Join (topology); Irreducibility; Discrete mathematics; Order (exchange); Omega; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01812048192973254,"gpt":0.2922381663705092,"spread":0.2741176844407767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002194864,0.00007325292,0.00006421045,0.000110128,0.0001733393,0.00009111079,0.0005973072,0.00004156199,0.0005403165],"category_scores_gemma":[0.0000968605,0.00006604198,0.00003343737,0.0006272435,0.00008229825,0.0003982503,0.0001940939,0.0003244918,0.001546898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007095411,"about_ca_system_score_gemma":0.00006795717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000614409,"about_ca_topic_score_gemma":0.00002600144,"domain_scores_codex":[0.9991497,0.00002295413,0.00008199871,0.0002825604,0.0001884659,0.000274366],"domain_scores_gemma":[0.9989213,0.00004766414,0.00002035214,0.0007911901,0.0001139586,0.0001055011],"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.000008672015,0.0001598194,0.001352886,0.000007446429,0.00002114254,0.00001600608,0.0003728291,0.0001113526,0.05851444,0.766354,0.02243682,0.1506446],"study_design_scores_gemma":[0.0004588247,0.00009306382,0.003839717,0.00000582287,0.000003658633,0.00005782142,0.00005762572,0.006548556,0.008274845,0.15128,0.8290226,0.0003574447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07011689,0.00005264302,0.8443637,0.003189604,0.00176904,0.0001806093,0.000003437412,0.0003506622,0.07997338],"genre_scores_gemma":[0.8403274,0.000005537663,0.1174744,0.0004997146,0.0002246248,0.00004173987,0.000003962229,0.00002416815,0.04139845],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8065858,"threshold_uncertainty_score":0.9992305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096032355","doi":"10.1007/s11083-010-9142-8","title":"Small Semigroups Generating Varieties with Continuum Many Subvarieties","year":2010,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Mount Saint Vincent University","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Semigroup; Variety (cybernetics); Monoid; Pure mathematics; Order (exchange); Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.008059683917308876,"gpt":0.1874648852515281,"spread":0.1794052013342192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003442422,0.0001930183,0.0001774609,0.00005731739,0.0002304,0.0004443644,0.000719004,0.0001017564,0.0001472836],"category_scores_gemma":[0.00004276842,0.0001466073,0.00003754556,0.0002708211,0.0001259793,0.0003693718,0.0002247434,0.0003291535,0.00007865522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007278597,"about_ca_system_score_gemma":0.00006909901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006399545,"about_ca_topic_score_gemma":0.0003141172,"domain_scores_codex":[0.9988359,0.00004005005,0.000176231,0.0003818448,0.0002072768,0.0003586755],"domain_scores_gemma":[0.998925,0.00009787528,0.00008646578,0.0006670134,0.000140178,0.00008341426],"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.0000206786,0.0001328235,0.006210453,0.0000416566,0.00007279451,0.00006977173,0.004292808,0.00007244969,0.07916385,0.8729131,0.005901909,0.03110766],"study_design_scores_gemma":[0.005502611,0.001209808,0.03554657,0.0001963869,0.000137464,0.00126075,0.002295696,0.3641842,0.1666032,0.1140161,0.3035894,0.005457829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4890407,0.00009293026,0.5025849,0.0006838989,0.0006229614,0.00010433,0.000001505308,0.0003977029,0.006471109],"genre_scores_gemma":[0.7921987,0.000005144416,0.2018666,0.00105894,0.0002723532,0.00002745091,0.00000467034,0.00002664618,0.004539511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.758897,"threshold_uncertainty_score":0.5978471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969798688","doi":"10.1007/s11083-006-9028-y","title":"Upward Three-Dimensional Grid Drawings of Graphs","year":2006,"lang":"en","type":"article","venue":"Order","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Grid; Graph drawing; Upper and lower bounds; Vertex (graph theory); Bounded function; Degeneracy (biology); Directed acyclic graph; Graph; Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.007018406646354243,"gpt":0.2113288240303752,"spread":0.2043104173840209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001052922,0.00006036638,0.00007278741,0.00009411344,0.00005993182,0.00002595683,0.0001696371,0.0000266108,0.00004674072],"category_scores_gemma":[0.00001078777,0.00005588121,0.00003856762,0.00051252,0.00002283696,0.0001804797,0.00006319409,0.00003883699,0.00003747275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006534787,"about_ca_system_score_gemma":0.00005296208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006315525,"about_ca_topic_score_gemma":0.00002460663,"domain_scores_codex":[0.9993625,0.00001315502,0.0001404293,0.0001606491,0.0002233322,0.00009997968],"domain_scores_gemma":[0.999582,0.00004005849,0.00005128865,0.0001482621,0.0001565898,0.00002178515],"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.00001478379,0.00030688,0.007245297,0.00002444891,0.00003143166,0.00001112214,0.0001083105,0.1072263,0.01390428,0.7863723,0.04188268,0.04287214],"study_design_scores_gemma":[0.001354754,0.0002120006,0.1910352,0.00003981524,0.00001902968,0.00005401565,0.000004006243,0.3237518,0.03174062,0.3967515,0.05443053,0.0006067496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3513657,0.0001868385,0.644554,0.0008166002,0.0006070602,0.00007510189,0.000002487735,0.00006455653,0.002327641],"genre_scores_gemma":[0.9183439,7.60372e-7,0.08083485,0.0002046324,0.0001208707,0.000003765989,0.00001717634,0.000003851892,0.0004702064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5669782,"threshold_uncertainty_score":0.227877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062832600","doi":"10.1007/s11083-005-9026-5","title":"Supermodular Functions on Finite Lattices","year":2005,"lang":"en","type":"article","venue":"Order","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"York University","keywords":"Mathematics; Modulo; Cone (formal languages); Modular design; Focus (optics); Multivariate statistics; Pure mathematics; Discrete mathematics; Algebra over a field; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03630029057446595,"gpt":0.2807656256942987,"spread":0.2444653351198327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008585094,0.0000651903,0.00007683761,0.00003886445,0.00007344026,0.00002501557,0.00004407118,0.00004713899,0.0008299325],"category_scores_gemma":[0.0001388718,0.00005364963,0.00002642024,0.0001110645,0.000009194318,0.00008425058,0.000009165427,0.00005378693,0.0005514387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001612918,"about_ca_system_score_gemma":0.00001015362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006092898,"about_ca_topic_score_gemma":0.00003316225,"domain_scores_codex":[0.9995552,0.00001866117,0.0001180976,0.0001030896,0.0001060428,0.00009887021],"domain_scores_gemma":[0.9995989,0.0001082543,0.00002941992,0.000180707,0.00005520784,0.00002755663],"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.00008368486,0.001614126,0.003503638,0.0003575423,0.0002635196,0.00001443894,0.004848746,0.1047139,0.0006984959,0.3428333,0.5025749,0.03849364],"study_design_scores_gemma":[0.0009329138,0.0001298576,0.0006522866,0.00008993543,0.00005963998,0.000006089708,0.0002871256,0.06392241,0.0003222694,0.007997777,0.9252211,0.0003785464],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4672443,0.0003059396,0.07195425,0.007878439,0.001216423,0.000796825,0.00005906001,0.0006434645,0.4499013],"genre_scores_gemma":[0.9187936,0.00001261967,0.0213129,0.0005297009,0.0005856879,0.00002792816,0.00002170872,0.00003864419,0.05867722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4515493,"threshold_uncertainty_score":0.9087179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022730759","doi":"10.1007/s11083-009-9131-y","title":"On Minimal Prime Graphs and Posets","year":2009,"lang":"en","type":"article","venue":"Order","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Antichain; Combinatorics; Prime (order theory); Discrete mathematics; Partially ordered set","retraction":null,"screen_n_in":null,"score":{"opus":0.0153064504103027,"gpt":0.2857848151741034,"spread":0.2704783647638007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008260911,0.00008760174,0.0001009331,0.00004567713,0.00009326691,0.00001497645,0.00006702267,0.00005635692,0.0001387958],"category_scores_gemma":[0.0001001182,0.00006372671,0.00002805882,0.00007092264,0.00003975774,0.0000286778,0.00001848988,0.0000805501,0.000006742525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003345049,"about_ca_system_score_gemma":0.000005145139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.66508e-7,"about_ca_topic_score_gemma":6.069058e-7,"domain_scores_codex":[0.9995433,0.00001970931,0.0000881096,0.0001263674,0.00009573141,0.0001267465],"domain_scores_gemma":[0.9996272,0.0001053097,0.0000284124,0.0001784703,0.00002122786,0.00003943665],"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.00002814859,0.00003728385,0.0001383875,0.000005386165,0.00001032589,0.000004576245,0.0003887615,1.06023e-7,0.0002156965,0.9869093,0.003274789,0.008987212],"study_design_scores_gemma":[0.0002412916,0.0001388512,0.007259924,0.00001044151,0.00001076448,0.00001019344,0.00001640366,0.000009075246,0.0004368712,0.9905871,0.001186281,0.00009287018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9680929,0.00007766158,0.00004907909,0.0002804156,0.00008876368,0.00007972082,0.000002502677,0.00005134424,0.0312776],"genre_scores_gemma":[0.994512,0.000009370099,0.003947598,0.0007060345,0.00002168182,0.000001049225,9.085809e-7,0.000008318208,0.0007930151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03048459,"threshold_uncertainty_score":0.25987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075190915","doi":"10.1007/s11083-007-9068-y","title":"Flippable Pairs and Subset Comparisons in Comparative Probability Orderings","year":2007,"lang":"en","type":"article","venue":"Order","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Polytope; Combinatorics; Hyperplane; Lexicographical order; Order (exchange); Relation (database); Discrete mathematics; Set (abstract data type); Total order; Partially ordered set; Class (philosophy); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04674183296938238,"gpt":0.2794733787152089,"spread":0.2327315457458266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565242,0.0001159447,0.0001992779,0.00006452789,0.00008342501,0.00008312325,0.00028073,0.00005240661,0.00002473375],"category_scores_gemma":[0.00002253798,0.00009751999,0.00001744328,0.0005362699,0.00008741995,0.0002501775,0.0001658323,0.0001479037,0.00003076383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003052679,"about_ca_system_score_gemma":0.00003253844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001936955,"about_ca_topic_score_gemma":0.0009251119,"domain_scores_codex":[0.9989622,0.00003889756,0.0002069331,0.0003356318,0.0001328761,0.0003234662],"domain_scores_gemma":[0.9994309,0.00009767644,0.00004461833,0.0002921236,0.00005472874,0.00007996726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001067441,0.001379908,0.7415693,0.000126366,0.00005094344,0.00010128,0.01989045,0.001958471,0.0003804498,0.1709296,0.01866943,0.04483697],"study_design_scores_gemma":[0.001411197,0.0002429979,0.8320019,0.00003517494,0.000005385106,0.00002796512,0.0006004388,0.0716064,0.0003808836,0.01781978,0.07523236,0.0006355247],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7358492,0.0002746266,0.2313195,0.001200143,0.0001729287,0.0003923361,0.000002052364,0.0001389572,0.03065022],"genre_scores_gemma":[0.9063536,0.00000645449,0.09334882,0.000199619,0.00001366628,0.000007065907,0.000001827646,0.000003327036,0.00006564139],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1705044,"threshold_uncertainty_score":0.397675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033288181","doi":"10.1007/s11083-009-9132-x","title":"Pointwise Debreu Lexicographic Powers","year":2009,"lang":"en","type":"article","venue":"Order","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Lexicographical order; Pointwise; Injective function; Uncountable set; Converse; Discrete mathematics; Countable set; Combinatorics; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01689841924082072,"gpt":0.2002198690491297,"spread":0.1833214498083089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002060327,0.0001185277,0.0002317678,0.0001435418,0.00007045946,0.00005267723,0.0001708447,0.0000773666,0.001655559],"category_scores_gemma":[0.00002956886,0.0001379311,0.0001002583,0.0001792438,0.00003906837,0.0001847259,0.00001961634,0.00009388166,0.001443977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002823851,"about_ca_system_score_gemma":0.00000993406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000476595,"about_ca_topic_score_gemma":0.00001070131,"domain_scores_codex":[0.999099,0.000004169166,0.0003188176,0.0002940417,0.00001214116,0.0002718409],"domain_scores_gemma":[0.9994586,0.0000124802,0.0001171748,0.0003148977,0.00001692663,0.00007991544],"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.00001172194,0.00004716414,0.004184639,0.000002268168,0.00001823873,0.0000018892,0.0001726589,0.00006789868,0.000008829357,0.9902554,0.002459946,0.002769408],"study_design_scores_gemma":[0.0006342464,0.000102532,0.01365046,0.000005706685,0.000003793545,0.000006234279,0.00005676268,0.0005961759,0.00003342421,0.7135451,0.2710284,0.0003371559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5295881,0.002679709,0.009139681,0.005344771,0.0007722367,0.0001931562,0.00005527195,0.0001285906,0.4520985],"genre_scores_gemma":[0.9922327,0.0001669691,0.0009861705,0.002144682,0.000086617,0.000004403556,0.000007857309,0.00001567673,0.00435496],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4626445,"threshold_uncertainty_score":0.9993335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027053128","doi":"10.1007/s11083-010-9176-y","title":"The Order on the Rationals has an Orthogonal Order with the Same Order Type","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"","keywords":"Rational number; Mathematics; Order (exchange); Order type; Constant (computer programming); Identity (music); Combinatorics; Set (abstract data type); Identity function; Type (biology); Algebra over a field; Discrete mathematics; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.09220822558538179,"gpt":0.348773892274057,"spread":0.2565656666886753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002696107,0.0003492821,0.0002409998,0.00006704442,0.00158779,0.0005406335,0.001129011,0.0001809288,0.007097584],"category_scores_gemma":[0.003792942,0.0001403635,0.00005550944,0.00140798,0.0009678063,0.0001867756,0.0001830074,0.001334228,0.0009937178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002520271,"about_ca_system_score_gemma":0.0006423561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003363468,"about_ca_topic_score_gemma":0.003281284,"domain_scores_codex":[0.9969171,0.0005622197,0.0003234251,0.0004347822,0.001108615,0.0006538439],"domain_scores_gemma":[0.9915883,0.004709424,0.000159021,0.001671357,0.001753297,0.0001185834],"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.0006336263,0.0003972719,0.0006699609,0.00001897049,0.0002273368,0.000009537476,0.001640625,0.00009112988,0.001196555,0.9281275,0.06433275,0.002654786],"study_design_scores_gemma":[0.001686525,0.0009618569,0.003118872,0.00004849445,0.0001210367,0.00009522015,0.002519452,0.003161431,0.0005304308,0.2325744,0.7543052,0.0008770474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8637155,0.00007526844,0.001765063,0.09989485,0.0006109955,0.001829998,0.0000325764,0.0001970457,0.03187874],"genre_scores_gemma":[0.8972721,0.00005285916,0.01354008,0.01040758,0.001558369,0.0006306728,0.00008982244,0.0004314643,0.07601702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6955531,"threshold_uncertainty_score":0.9997841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161458631","doi":"10.1007/s11083-007-9063-3","title":"Domain Closedness Conditions and Rational Choice","year":2007,"lang":"en","type":"article","venue":"Order","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Japan Society for the Promotion of Science","keywords":"Rationalizability; Mathematics; Domain (mathematical analysis); Intersection (aeronautics); Rational function; Pure mathematics; Function (biology); Contrast (vision); Coherence (philosophical gambling strategy); Algebra over a field; Mathematical economics; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02379298697490722,"gpt":0.2500888003429157,"spread":0.2262958133680085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238248,0.00005299991,0.0001051699,0.00006833443,0.0001009374,0.00002852015,0.00004661325,0.00004574654,0.0006273821],"category_scores_gemma":[0.00005322046,0.00006085861,0.00001811466,0.000108145,0.00004487481,0.0000870659,0.00001196187,0.00005466838,0.000461584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001394974,"about_ca_system_score_gemma":0.000005169869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003329055,"about_ca_topic_score_gemma":0.00003059771,"domain_scores_codex":[0.9995068,0.000007582271,0.0002085516,0.000138621,0.00001388774,0.0001246003],"domain_scores_gemma":[0.9996743,0.00009610702,0.00008043457,0.00009199016,0.0000174582,0.0000397095],"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.000003060317,0.00001975996,0.05190329,0.000007228253,0.00000989245,9.63004e-7,0.0002075483,0.000005509603,0.00005346963,0.9472054,0.0004998806,0.000084055],"study_design_scores_gemma":[0.0007424681,0.00002804188,0.2913568,0.00001188227,0.000002639325,0.0000154065,0.0002133784,0.00008477427,0.0000663251,0.2471511,0.4601055,0.0002216295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9032721,0.0002693801,0.01603121,0.0003556304,0.0003505214,0.00008245108,0.00004540856,0.00002566199,0.07956766],"genre_scores_gemma":[0.9954236,0.00000317456,0.0005167749,0.0002294095,0.0001612376,0.000004750765,0.0000157343,0.00000761323,0.003637701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7000542,"threshold_uncertainty_score":0.6869394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049256457","doi":"10.1007/s11083-012-9256-2","title":"A Hierarchy of Chains Embeddable into the Lexicographic Power $\\boldsymbol{({\\mathbb{R}}^\\omega,\\prec_{\\rm lex})}$","year":2012,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Lexicographical order; Combinatorics; Mathematics; Hierarchy; Omega; Tree (set theory); Order (exchange); Transfinite number; Sequence (biology); Branching (polymer chemistry); Chain (unit); Discrete mathematics; Binary tree; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008076845308624325,"gpt":0.2337108679808694,"spread":0.2256340226722451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700066,0.0002322908,0.0002674984,0.000188778,0.000213286,0.0001147699,0.001389998,0.0001100563,0.0001424495],"category_scores_gemma":[0.00007220374,0.0001560698,0.0001499695,0.001215802,0.0002212986,0.0008010779,0.000360346,0.0002352505,0.0001386252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002309226,"about_ca_system_score_gemma":0.00006786895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008955581,"about_ca_topic_score_gemma":0.000008207468,"domain_scores_codex":[0.9981568,0.0001446633,0.0003216284,0.0003307249,0.0004142279,0.0006319431],"domain_scores_gemma":[0.9982178,0.0001973907,0.0001447336,0.001195613,0.00008733278,0.0001570942],"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.00002192864,0.0006612376,0.005768611,0.00005997877,0.0001519995,0.000006783841,0.028483,0.00003212883,0.006676928,0.877507,0.007303854,0.07332656],"study_design_scores_gemma":[0.004545553,0.001099227,0.1191267,0.0005428544,0.0001735341,0.0002822153,0.005070451,0.0540286,0.03582866,0.1972248,0.5781327,0.003944732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7722297,0.00644842,0.1754568,0.00365054,0.001954273,0.0005671481,0.000006730276,0.0005555956,0.03913083],"genre_scores_gemma":[0.9893855,0.00005611066,0.0082307,0.0008632909,0.000123032,0.00003665626,0.000002142455,0.0000214462,0.001281065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6802822,"threshold_uncertainty_score":0.6364343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W69796697","doi":"10.1023/a:1006445124778","title":"Epimorphisms in Certain Varieties of Algebras","year":2000,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Lemma (botany); Surjective function; Bounded function; Pure mathematics; Combinatorics; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009129982892657219,"gpt":0.2243608391060097,"spread":0.2152308562133524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007982373,0.00006761141,0.0001088962,0.00004933439,0.00002267824,0.00001305898,0.0003370004,0.00003602518,0.0007983891],"category_scores_gemma":[0.00001567901,0.0000581755,0.00002175477,0.0004035028,0.00004192064,0.0002056377,0.00004235846,0.00006847527,0.000122759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008789401,"about_ca_system_score_gemma":0.00002601364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003433988,"about_ca_topic_score_gemma":0.00001602185,"domain_scores_codex":[0.999402,0.00002782253,0.0001368064,0.0001668234,0.0001054936,0.0001610747],"domain_scores_gemma":[0.9996235,0.00003904777,0.00002544162,0.0002632899,0.0000223683,0.00002629893],"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.0000119613,0.0001451396,0.003656572,0.00001286075,0.000007477636,0.00002998118,0.001570603,0.002372633,0.0005627864,0.7112455,0.0005514883,0.279833],"study_design_scores_gemma":[0.001028421,0.0002003455,0.05268491,0.00003065759,0.000004072826,0.00002060393,0.00007785839,0.01297422,0.003597588,0.8837689,0.04513386,0.0004785733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6899004,0.0006155902,0.2506917,0.002409077,0.0002249265,0.0001978369,0.000001344589,0.0001575839,0.05580155],"genre_scores_gemma":[0.9744285,0.00002840501,0.02304054,0.0003758493,0.00001505879,0.000005644602,7.294641e-7,0.000004297756,0.002100918],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2845281,"threshold_uncertainty_score":0.87418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974524636","doi":"10.1007/s11083-008-9103-7","title":"Abelian ℓ-Groups with Strong Unit and Perfect MV-Algebras","year":2008,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Abelian group; Mathematics; Rank of an abelian group; Unit (ring theory); Functor; Rank (graph theory); Elementary abelian group; Pure mathematics; Class (philosophy); Unit interval; Group (periodic table); Algebra over a field; Combinatorics; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0173793824275137,"gpt":0.2230614082412054,"spread":0.2056820258136917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004624562,0.000115539,0.0001081774,0.00004766499,0.0002021376,0.00003877049,0.0002410913,0.0000330932,0.0000448085],"category_scores_gemma":[0.00001001742,0.00008366605,0.00001363243,0.0003386737,0.00009443766,0.000359995,0.00009473447,0.0001111608,0.00006101905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007851086,"about_ca_system_score_gemma":0.00004160645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001010827,"about_ca_topic_score_gemma":0.00001744135,"domain_scores_codex":[0.999254,0.00002367051,0.00007509113,0.0002776799,0.0001368485,0.0002327258],"domain_scores_gemma":[0.9995168,0.00003363396,0.00003059983,0.0002893596,0.00004596591,0.00008361477],"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.00005930688,0.0003069697,0.2073891,0.00005598244,0.0001083234,0.000718068,0.005335623,0.000986754,0.001213411,0.6630412,0.001548716,0.1192366],"study_design_scores_gemma":[0.00767207,0.003458342,0.8092408,0.0001598712,0.00006346704,0.003231475,0.0007933296,0.03271912,0.003643137,0.04574913,0.08991307,0.003356181],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7251464,0.0002683602,0.2693354,0.0004126984,0.00006187957,0.00008557668,5.020519e-7,0.000135933,0.004553224],"genre_scores_gemma":[0.9731625,0.00003838241,0.02555374,0.0003146932,0.00003857586,0.00000596129,0.00000112743,0.000008821231,0.0008762227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.617292,"threshold_uncertainty_score":0.3411802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106316671","doi":"10.1023/a:1006436305188","title":"First Alexandroff Decomposition Theorem for Topological Lattice Group Valued Measures","year":2000,"lang":"en","type":"article","venue":"Order","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Hausdorff space; Commutative property; Combinatorics; Bounded function; Subalgebra; Discrete mathematics; Pure mathematics; Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.02303008037345542,"gpt":0.2766309605178506,"spread":0.2536008801443951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756242,0.0001935554,0.0002243676,0.00004854851,0.00030462,0.0001750443,0.0007971204,0.0001208119,0.0006569055],"category_scores_gemma":[0.00008901691,0.0001596372,0.0001200954,0.0003340625,0.0001073892,0.0002947694,0.0001408105,0.000128609,0.0001570435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006217171,"about_ca_system_score_gemma":0.00002863918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003226756,"about_ca_topic_score_gemma":0.0000405263,"domain_scores_codex":[0.998327,0.0001373939,0.0002564321,0.0005861971,0.0002897162,0.0004033288],"domain_scores_gemma":[0.9987272,0.0003952985,0.00004868341,0.0005799955,0.000141364,0.000107472],"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.0001921842,0.001274606,0.001503272,0.0000731782,0.00009653226,0.00003240426,0.001460584,0.004363213,0.0002271945,0.4688329,0.003190538,0.5187533],"study_design_scores_gemma":[0.002122974,0.0009215108,0.02692727,0.00003507121,0.00004367344,0.0001260672,0.00002753521,0.5802171,0.0004165835,0.3113719,0.07692765,0.0008626928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05373577,0.0001733255,0.9369405,0.002713631,0.000407065,0.0005046113,0.000004788454,0.0003710042,0.005149308],"genre_scores_gemma":[0.6285616,0.00002003061,0.3694272,0.001040496,0.0002682238,0.00009310713,0.000009685446,0.00001714617,0.0005625588],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5758539,"threshold_uncertainty_score":0.7192655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041674345","doi":"10.1007/s11083-011-9198-0","title":"Lattices of Games","year":2011,"lang":"en","type":"article","venue":"Order","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Distributive lattice; Mathematics; Distributive property; Lattice (music); Combinatorial game theory; Combinatorics; Complete lattice; Congruence lattice problem; Set (abstract data type); Map of lattices; Partially ordered set; Discrete mathematics; Algebra over a field; Mathematical economics; Game theory; Pure mathematics; Sequential game; Computer science; Universality (dynamical systems)","retraction":null,"screen_n_in":null,"score":{"opus":0.06924299315783805,"gpt":0.2901136555825268,"spread":0.2208706624246887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008712395,0.00004493773,0.00006555993,0.00003622208,0.00001841094,0.00001309145,0.0004966007,0.0000238758,0.0003469932],"category_scores_gemma":[0.00004531469,0.00003781791,0.00002108038,0.0001962685,0.0000617702,0.0002291819,0.0001001937,0.0000340692,0.000272215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002897622,"about_ca_system_score_gemma":0.0000209894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007641377,"about_ca_topic_score_gemma":0.00001452233,"domain_scores_codex":[0.9995449,0.00001493939,0.0001180237,0.0001204024,0.0000967426,0.000104997],"domain_scores_gemma":[0.9995121,0.00003314979,0.00004989604,0.0002969548,0.00008341025,0.00002452363],"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.000007141858,0.0001917389,0.01996425,0.00001953375,0.000028444,0.00001100042,0.01614445,0.00002412393,0.00216231,0.5952669,0.001735007,0.3644451],"study_design_scores_gemma":[0.0001112013,0.0002939429,0.0283197,0.00005473363,0.00001548024,0.00001221181,0.0007540675,0.02218007,0.7263276,0.1840956,0.03731728,0.0005181343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2027669,0.0002673879,0.6434125,0.0003857657,0.0005937319,0.0001022594,6.773657e-7,0.0001681438,0.1523027],"genre_scores_gemma":[0.9192606,0.000007840383,0.07994282,0.00009846815,0.00001564123,0.000002421465,6.313161e-8,0.000003130801,0.0006689632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7241653,"threshold_uncertainty_score":0.3799332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005947941","doi":"10.1007/s11083-010-9163-3","title":"Dualities and Dual Pairs in Heyting Algebras","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heyting algebra; Mathematics; Homomorphism; Dual (grammatical number); Core (optical fiber); Algebra over a field; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01628894489813829,"gpt":0.2882060357094795,"spread":0.2719170908113412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004378458,0.0000624174,0.00007138238,0.00009883173,0.00006491232,0.00007570595,0.0002165701,0.00003651355,0.00004534725],"category_scores_gemma":[0.0001801595,0.00005703353,0.00001020186,0.0003159751,0.0001019268,0.0003394633,0.0002403859,0.0002426029,0.00002588604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004718603,"about_ca_system_score_gemma":0.0000288891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002088812,"about_ca_topic_score_gemma":0.0001298491,"domain_scores_codex":[0.9992771,0.00004841236,0.00009093288,0.0002062303,0.0001412286,0.0002360753],"domain_scores_gemma":[0.9994738,0.0001641216,0.00001744336,0.0002533672,0.00003908232,0.00005225684],"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.000004878421,0.00002735491,0.02104364,0.00001275767,0.000004199519,0.00003622567,0.002133961,0.00001110063,0.004640423,0.9240915,0.0001341927,0.04785974],"study_design_scores_gemma":[0.00141175,0.0001301849,0.06475641,0.00003909018,0.000002177747,0.0001428882,0.001299398,0.01477979,0.007213717,0.8873935,0.02213977,0.0006912713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9804458,0.00006396024,0.01392377,0.00107857,0.0001564438,0.00007635775,6.043653e-7,0.00007311443,0.004181372],"genre_scores_gemma":[0.9723953,0.000005319954,0.02658592,0.0001455745,0.0000329411,0.000008901993,3.644637e-7,0.000006401521,0.0008193071],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04716847,"threshold_uncertainty_score":0.232576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393861209","doi":"10.1007/s11083-024-09664-y","title":"Well-quasi-ordering and Embeddability of Relational Structures","year":2024,"lang":"en","type":"article","venue":"Order","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Partially ordered set; Pure mathematics; Combinatorics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02469558320899802,"gpt":0.3273396079372843,"spread":0.3026440247282863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001323023,0.00005534648,0.00009112522,0.00002704895,0.00003411567,0.000003987251,0.0000288622,0.0000596162,0.0008295811],"category_scores_gemma":[0.000200594,0.00004507896,0.00001902206,0.0000614744,0.0001177513,0.00005647519,0.00002695478,0.0001016868,0.000008832247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006241239,"about_ca_system_score_gemma":0.00001701643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001737842,"about_ca_topic_score_gemma":0.000005526766,"domain_scores_codex":[0.9996246,0.00002760622,0.0001140083,0.0001116484,0.00005358386,0.00006860993],"domain_scores_gemma":[0.9994424,0.0003977437,0.00001910874,0.0001015911,0.00002348547,0.00001565933],"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.00001057982,0.00001383558,0.0006697911,0.0001327734,0.00002194669,0.000002150832,0.0004495886,0.00002675355,0.000139723,0.996749,0.0001455577,0.001638278],"study_design_scores_gemma":[0.00006798525,0.00001497089,0.0008890775,0.00001536899,0.00001254523,0.00001089424,0.00007538386,0.001044695,0.000367788,0.9939089,0.003542779,0.00004957002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9481273,0.0008833531,0.039775,0.0003187397,0.0002118499,0.00008973897,0.000008871564,0.00007886543,0.01050634],"genre_scores_gemma":[0.9743189,0.00001469142,0.02452147,0.00002124005,0.00003450962,0.000002397386,0.000002227846,0.000009184293,0.001075334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0261917,"threshold_uncertainty_score":0.9083332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2810888652","doi":"10.1007/s11083-018-9462-7","title":"A Syntactic Approach to the MacNeille Completion of Λ∗, the Free Monoid Over an Ordered Alphabet Λ","year":2018,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Closure (psychology); Monoid; Alphabet; Partially ordered set; Divisibility rule; Lattice (music); Discrete mathematics; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01448663258522862,"gpt":0.2363788144778925,"spread":0.2218921818926639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003290863,0.000104114,0.000115299,0.00003368497,0.000201588,0.00008390864,0.001747756,0.00003783045,0.00007177235],"category_scores_gemma":[0.00006996178,0.00005661033,0.0000429166,0.0005334626,0.0000950783,0.0002139821,0.0005228973,0.00008383767,0.00005284222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001704944,"about_ca_system_score_gemma":0.00003584964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001664346,"about_ca_topic_score_gemma":0.00004220402,"domain_scores_codex":[0.9990005,0.0001328893,0.0001452285,0.0002647727,0.000257586,0.0001990119],"domain_scores_gemma":[0.9982466,0.00005473198,0.00007741774,0.001476284,0.00009832297,0.00004662456],"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.00008165937,0.00129804,0.003210026,0.0000684281,0.000154803,0.000001990722,0.01450768,0.0005481134,0.0200971,0.7399055,0.1509517,0.06917499],"study_design_scores_gemma":[0.001863651,0.0006358742,0.1510249,0.00007989482,0.00005628073,0.00006491612,0.0008469963,0.6464743,0.01210138,0.02644758,0.1595386,0.0008656261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5124601,0.00009035222,0.4585066,0.005544829,0.000802784,0.0006315117,0.0000176844,0.0001676292,0.0217786],"genre_scores_gemma":[0.9825882,0.000001157744,0.01516183,0.001742146,0.0001255821,0.00001959381,0.000001785427,0.00001071534,0.0003490029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7134579,"threshold_uncertainty_score":0.3247795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109981504","doi":"10.1007/s11083-010-9167-z","title":"A Note on Schnyder’s Theorem","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially ordered set; Graph; Dimension (graph theory); Ordered set; Antichain; Algebra over a field; Graph theory","retraction":null,"screen_n_in":null,"score":{"opus":0.01496878642624127,"gpt":0.3140181872646999,"spread":0.2990494008384586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002993807,0.00008550235,0.00007055947,0.00009838463,0.0001109635,0.00008027704,0.0008843174,0.00005361749,0.000201761],"category_scores_gemma":[0.0001946744,0.00006807367,0.00003136151,0.0004582881,0.00009951592,0.0002273673,0.0001949386,0.000404511,0.001180456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007274733,"about_ca_system_score_gemma":0.00004673199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002126027,"about_ca_topic_score_gemma":0.00001130496,"domain_scores_codex":[0.9990712,0.00003957666,0.00007265036,0.0002819191,0.0002548223,0.0002797977],"domain_scores_gemma":[0.99885,0.000146319,0.00002145386,0.0008107238,0.0000863773,0.00008515208],"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.000007149938,0.00003258132,0.00006263427,0.000001361039,0.00000231721,0.000008829541,0.0001076388,0.00001663372,0.008236223,0.9264245,0.0003292487,0.0647709],"study_design_scores_gemma":[0.0005471607,0.0001549025,0.001122762,0.00001074456,0.000001491013,0.00002472949,0.00001054055,0.01202796,0.02297326,0.8331406,0.129667,0.0003189431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06798384,0.00002042561,0.8214251,0.004907071,0.0009066602,0.0002444103,0.000001725334,0.0004173728,0.1040933],"genre_scores_gemma":[0.916859,0.000002887628,0.0798895,0.0008312357,0.00008561561,0.00001614509,5.482576e-7,0.0000140685,0.002300998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8488752,"threshold_uncertainty_score":0.9995973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1818676058","doi":"10.1007/s11083-016-9404-1","title":"Duality for Convex Monoids","year":2016,"lang":"en","type":"article","venue":"Order","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Fields Institute for Research in Mathematical Sciences; University of Ottawa","keywords":"Mathematics; Duality (order theory); Algebra over a field; Group algebra; Tensor product; Hopf algebra; Pure mathematics; Poincaré duality; Cellular algebra; Filtered algebra; Group (periodic table); Algebra representation","retraction":null,"screen_n_in":null,"score":{"opus":0.1143535582777176,"gpt":0.4332355820413764,"spread":0.3188820237636588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002599731,0.00007466367,0.0001237652,0.00002198503,0.00005559438,0.00001203955,0.0001184325,0.00005089683,0.0007999731],"category_scores_gemma":[0.001247558,0.00004534788,0.00003443949,0.00007780945,0.00005512391,0.00009705544,0.0000466014,0.00004385619,0.0002141681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000370151,"about_ca_system_score_gemma":0.00004463245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001170216,"about_ca_topic_score_gemma":0.000005693413,"domain_scores_codex":[0.9993022,0.00002922523,0.0001279097,0.0001611042,0.000143521,0.0002360167],"domain_scores_gemma":[0.9988798,0.0005499924,0.00002507299,0.0002946734,0.0001900335,0.00006036757],"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.0001157014,0.0001942248,0.002116446,0.0001625443,0.00006963145,0.000006323127,0.0002985536,5.364294e-7,0.02435477,0.8817459,0.04731281,0.04362258],"study_design_scores_gemma":[0.001906722,0.0001040076,0.0003569139,0.00003138875,0.00001155277,0.000004097882,0.00007327384,0.00008396095,0.03686789,0.8542538,0.1060538,0.0002526158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4106895,0.00005884861,0.5745164,0.005440396,0.000211178,0.0009855347,0.00006276979,0.000205211,0.007830162],"genre_scores_gemma":[0.8448089,0.00001588785,0.1108384,0.000299324,0.0002346555,0.0002930065,0.000002745944,0.00007829547,0.04342872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.463678,"threshold_uncertainty_score":0.8759145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386582925","doi":"10.1007/s11083-023-09647-5","title":"A short note on the characterization of countable chains with finite big Ramsey spectra","year":2023,"lang":"en","type":"article","venue":"Order","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"Science Fund of the Republic of Serbia; Fields Institute for Research in Mathematical Sciences","keywords":"Countable set; Mathematics; Ramsey theory; Hausdorff space; Combinatorics; Characterization (materials science); Chain (unit); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04152209645963933,"gpt":0.298428554336005,"spread":0.2569064578763656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002135665,0.00008041851,0.0001216869,0.00004387913,0.00008099247,0.00000507303,0.00008400757,0.00005350812,0.0001544732],"category_scores_gemma":[0.0001328457,0.00004889194,0.00001835474,0.0002983043,0.00008473432,0.00003260153,0.00001698992,0.0001123951,0.000079388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001003112,"about_ca_system_score_gemma":0.00002254945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001304939,"about_ca_topic_score_gemma":0.00001310273,"domain_scores_codex":[0.9995007,0.00003866652,0.0001072008,0.0001053584,0.0001057408,0.0001423702],"domain_scores_gemma":[0.9992809,0.0003757714,0.00004977432,0.0002338898,0.0000448947,0.00001474231],"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.0002871039,0.0001745908,0.000811247,0.00007690278,0.00009187342,0.00001830265,0.003080598,0.0002041943,0.02488157,0.9658269,0.0004012772,0.004145397],"study_design_scores_gemma":[0.002641737,0.001218555,0.03418362,0.0005818678,0.0002700756,0.00004053038,0.002203788,0.01263613,0.1160948,0.7857165,0.04304756,0.001364862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9387419,0.000002886192,0.05240789,0.001109687,0.0001344328,0.0002610183,0.00002776627,0.0001100412,0.007204342],"genre_scores_gemma":[0.9924329,0.00002685987,0.000448682,0.0003135843,0.00006983046,0.00002248237,0.00003106944,0.00002312476,0.006631466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1801104,"threshold_uncertainty_score":0.1993756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2345399371","doi":"10.1023/a:1022845202361","title":"Counting Endomorphisms of Crown-like Orders","year":2002,"lang":"en","type":"article","venue":"Order","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Algebra over a field; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01455637221134341,"gpt":0.203917247870523,"spread":0.1893608756591796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001660494,0.00008253404,0.0001179297,0.00005478205,0.00005920851,0.00004649352,0.0004904285,0.00003561029,0.0006860644],"category_scores_gemma":[0.00003750639,0.00007366463,0.0000368812,0.0003505835,0.00005650768,0.0002478741,0.0001174755,0.00006412561,0.0002068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000865618,"about_ca_system_score_gemma":0.00001174491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003228212,"about_ca_topic_score_gemma":0.000002504687,"domain_scores_codex":[0.999253,0.0000235187,0.0001529446,0.000191973,0.0001851638,0.0001934231],"domain_scores_gemma":[0.9993718,0.00007713102,0.00007640861,0.0003701503,0.00007042372,0.00003410718],"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.00001314538,0.0006442442,0.003054554,0.0001130224,0.0001319645,0.00009744972,0.005119661,0.0004817995,0.02470629,0.521324,0.09761994,0.346694],"study_design_scores_gemma":[0.002753464,0.0002129981,0.002553556,0.0001226421,0.0000284948,0.0001269323,0.0002423534,0.522027,0.01393808,0.01314043,0.4438215,0.001032543],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2960619,0.001666486,0.6266851,0.002803237,0.001950555,0.0003246069,0.00000666216,0.0007198069,0.06978162],"genre_scores_gemma":[0.9786814,0.00002100505,0.01881982,0.00076179,0.00003586677,0.000004325619,7.595493e-7,0.000009445364,0.001665552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6826195,"threshold_uncertainty_score":0.7511924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048775750","doi":"10.1007/s11083-014-9340-x","title":"Generalized Laminar Families and Certain Forbidden Matrices","year":2014,"lang":"en","type":"article","venue":"Order","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Laminar flow; Mathematics; Disjoint sets; Combinatorics; Discrete mathematics; Physics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.004958774077755051,"gpt":0.1872343444408253,"spread":0.1822755703630702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001050703,0.00007692533,0.00009751445,0.00004323423,0.00003773872,0.00002407227,0.00005326687,0.00004253452,0.0000520127],"category_scores_gemma":[0.000009111882,0.00006665075,0.00001704728,0.0000890823,0.00001743995,0.0000528819,0.00001044375,0.00003717085,0.00004924785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003443712,"about_ca_system_score_gemma":0.00000135736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002055967,"about_ca_topic_score_gemma":0.00001645447,"domain_scores_codex":[0.9996551,0.00002667756,0.0000781318,0.00007552945,0.00004665575,0.0001179341],"domain_scores_gemma":[0.9998167,0.00002847425,0.000009212832,0.0001053175,0.00001095999,0.00002938769],"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.0001016213,0.00009746798,0.03976196,0.002330853,0.0005641895,0.0000277391,0.01128793,0.01353242,0.08237176,0.5874463,0.05053727,0.2119404],"study_design_scores_gemma":[0.001782321,0.0001120449,0.009346787,0.00008912235,0.00006690301,0.0000414362,0.001377131,0.07985232,0.004835274,0.02117014,0.8804153,0.0009111784],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9792916,0.0009132853,0.001663728,0.00002996659,0.0001887886,0.00006093398,0.000001825028,0.0001592556,0.01769062],"genre_scores_gemma":[0.9982329,0.0001126916,0.0005335641,0.00003195829,0.00007440332,0.00001192035,0.000002606049,0.00001649976,0.000983433],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8298781,"threshold_uncertainty_score":0.2717939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065333210","doi":"10.1007/s11083-009-9133-9","title":"Posets with the Maximal Antichain Property","year":2009,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Antichain; Partially ordered set; Mathematics; Combinatorics; Property (philosophy); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008195563251251668,"gpt":0.2126549502580421,"spread":0.2044593870067904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006019323,0.00006499943,0.00005267405,0.00001225394,0.0001003531,0.00005500291,0.0003815067,0.00002289231,0.00001577944],"category_scores_gemma":[0.000007183257,0.00002440561,0.00001138216,0.0002302429,0.00002808384,0.0001747737,0.00003719277,0.0001029769,0.00006234912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000049013,"about_ca_system_score_gemma":0.00002301378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002076106,"about_ca_topic_score_gemma":0.000003319877,"domain_scores_codex":[0.9995074,0.00001795986,0.00004263009,0.000155943,0.0001148672,0.0001612588],"domain_scores_gemma":[0.9996275,0.00001120293,0.00001948821,0.0002789974,0.00003653193,0.00002628977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003309809,0.0001993144,0.0006753309,0.000005031813,0.00001650197,0.0001322025,0.001497254,0.0005525395,0.002153503,0.315233,0.008287299,0.6712149],"study_design_scores_gemma":[0.003368969,0.003947345,0.1601511,0.00008483919,0.00003466826,0.0007406375,0.0003324765,0.07654234,0.006020725,0.1500594,0.5966929,0.002024591],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03601829,0.0001182984,0.899228,0.04637225,0.00007575531,0.000190646,2.819121e-7,0.0001780623,0.0178184],"genre_scores_gemma":[0.9659907,0.000002610625,0.02688146,0.00478135,0.00003274288,0.000002739652,3.184009e-7,0.000002887913,0.002305227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9299724,"threshold_uncertainty_score":0.09952319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388826287","doi":"10.1007/s11083-023-09650-w","title":"A Proof of the Alternate Thomassé Conjecture for Countable N-Free Posets","year":2023,"lang":"en","type":"article","venue":"Order","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Partially ordered set; Mathematics; Combinatorics; Countable set; Conjecture; Discrete mathematics; Isomorphism (crystallography); Comparability graph; Preorder; Comparability; Star product; Order (exchange); Class (philosophy); Graph; Chordal graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03261062724155461,"gpt":0.3315577304792162,"spread":0.2989471032376616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002207548,0.00007499963,0.0001371184,0.00002165503,0.00008487521,0.00000352388,0.0002560558,0.00007258131,0.00009230638],"category_scores_gemma":[0.0005521821,0.00004680594,0.00005278423,0.0001481994,0.00008832505,0.00003286289,0.00009016075,0.00008440366,0.000008489059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008795069,"about_ca_system_score_gemma":0.00003341413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002544016,"about_ca_topic_score_gemma":0.00003806236,"domain_scores_codex":[0.9994863,0.00003255812,0.0001216405,0.0001053224,0.00008583896,0.000168356],"domain_scores_gemma":[0.9990957,0.0003562522,0.00008072716,0.0003901034,0.00006301789,0.0000142079],"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.0001044065,0.00007720564,0.0006515605,0.0002526501,0.000102786,0.000004272125,0.001154004,0.0001650714,0.00170338,0.9497854,0.04504536,0.0009539136],"study_design_scores_gemma":[0.0005659657,0.00003117302,0.00006533549,0.00002115413,0.00002285206,0.000006914071,0.00009387537,0.0003834706,0.01128482,0.973011,0.01445103,0.00006239933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9063038,0.0003562993,0.04718545,0.008742626,0.001831949,0.002720552,0.0004659387,0.0003753915,0.03201794],"genre_scores_gemma":[0.9470757,0.00001034524,0.008508782,0.0005036561,0.0001241109,0.0001347312,0.00001329064,0.00005476613,0.04357462],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04077185,"threshold_uncertainty_score":0.1908691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053725458","doi":"10.1007/s11083-010-9149-1","title":"Prime Orders All of Whose Prime Suborders Are Selfdual","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Royal Military College of Canada","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics; Prime power; Set (abstract data type); Element (criminal law); Order (exchange); Discrete mathematics; Prime element; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02122968024905074,"gpt":0.3047966964348104,"spread":0.2835670161857596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003339277,0.0002146256,0.0003196819,0.00009918179,0.0001121486,0.00002024215,0.0003449016,0.000215395,0.001006854],"category_scores_gemma":[0.0005381581,0.0001727283,0.0001096403,0.000222993,0.0002326151,0.00009398223,0.0001341615,0.0003933834,0.00001905944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008986141,"about_ca_system_score_gemma":0.0000595797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002947834,"about_ca_topic_score_gemma":0.00008032014,"domain_scores_codex":[0.9987484,0.00005392924,0.0003215635,0.0002619514,0.0002912284,0.0003229796],"domain_scores_gemma":[0.9985792,0.0002216068,0.0002397995,0.0006580937,0.0002100807,0.00009119395],"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.0002472057,0.0009586371,0.02349571,0.0004741104,0.0008861153,0.00003369824,0.01122903,0.00001029435,0.03918368,0.8642445,0.04522235,0.01401473],"study_design_scores_gemma":[0.003233553,0.0002545522,0.01400649,0.0001037957,0.0003454076,0.00006014366,0.00140739,0.0002634153,0.04089902,0.7682692,0.1697431,0.001413921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9868322,0.0000507876,0.0005340892,0.0003647995,0.0006891351,0.0002765992,0.00001677351,0.0001091196,0.01112647],"genre_scores_gemma":[0.9802549,0.00001078195,0.01812717,0.0002637815,0.0001123779,0.000009210017,0.00000596107,0.0000548803,0.001160889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1245207,"threshold_uncertainty_score":0.9999064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2270268103","doi":"10.1007/s11083-016-9413-0","title":"On Scattered Convex Geometries","year":2016,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Semilattice; Regular polygon; Convex analysis; Convex set; Convex polytope; Pure mathematics; Axiom; Subderivative; Convex hull; Geometry; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.0105577475988629,"gpt":0.226533994235239,"spread":0.2159762466363761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004438156,0.00006053664,0.00006483969,0.00005791854,0.00004623398,0.00002752934,0.0003078049,0.000022726,0.0002610426],"category_scores_gemma":[0.00007990118,0.0000338849,0.00001757332,0.0002624498,0.00003717466,0.0002044242,0.00007292107,0.00002798267,0.001561511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008147495,"about_ca_system_score_gemma":0.00001372261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.270505e-7,"about_ca_topic_score_gemma":5.713298e-7,"domain_scores_codex":[0.9994904,0.000009951921,0.00006070942,0.0001834351,0.0001028202,0.0001527247],"domain_scores_gemma":[0.9994747,0.0001250814,0.00002318131,0.0003043868,0.00003467579,0.00003795815],"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.000007177496,0.00004773988,0.001091124,0.000002723463,0.000009269031,0.00001664528,0.00009686829,0.000008016799,0.002687898,0.6623102,0.007301975,0.3264203],"study_design_scores_gemma":[0.00205471,0.0004677738,0.02740424,0.0000739707,0.000004634745,0.00003204322,0.00001762141,0.0003263683,0.03480921,0.7058742,0.228194,0.0007412729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05803449,0.0000494155,0.9297068,0.005726408,0.0003596584,0.00004802798,9.596979e-7,0.0001389399,0.005935357],"genre_scores_gemma":[0.9891511,0.000007580222,0.005064635,0.001881806,0.00003349986,0.000004794444,2.060148e-7,0.000004022091,0.003852423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9311165,"threshold_uncertainty_score":0.9992159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038115433","doi":"10.1007/s11083-012-9278-9","title":"On Infinite–finite Duality Pairs of Directed Graphs","year":2012,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Royal Military College of Canada","funders":"","keywords":"Antichain; Duality (order theory); Directed graph; Constraint satisfaction problem; Construct (python library); Constraint (computer-aided design)","retraction":null,"screen_n_in":null,"score":{"opus":0.03131159960911015,"gpt":0.3098149036877476,"spread":0.2785033040786374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006534189,0.0001083563,0.0001470634,0.0001947794,0.00006824002,0.00001924285,0.0005205274,0.00005163024,0.000133372],"category_scores_gemma":[0.0005097245,0.00009251027,0.00005746949,0.001283854,0.0001163074,0.0003799865,0.000192362,0.0001692032,0.0001444145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001260602,"about_ca_system_score_gemma":0.00002781304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009943677,"about_ca_topic_score_gemma":0.000002358301,"domain_scores_codex":[0.998653,0.0002119187,0.0001793344,0.000205453,0.000359758,0.0003905323],"domain_scores_gemma":[0.9982926,0.0006642904,0.00007154272,0.000685781,0.0001588769,0.0001268779],"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.00003327045,0.0002812375,0.0179486,0.00001949992,0.0000271788,0.000002414918,0.0008261079,0.0001028224,0.0007202402,0.9650074,0.0005997328,0.01443149],"study_design_scores_gemma":[0.001734407,0.0005408568,0.1549154,0.00009055911,0.00001480946,0.00001073977,0.0001100157,0.006001885,0.01815957,0.7921807,0.02530246,0.0009385993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6244791,0.0004369361,0.3188158,0.000690869,0.0008543124,0.0004717244,0.000018663,0.0007372064,0.05349542],"genre_scores_gemma":[0.9856412,0.00001126739,0.01373764,0.0001880289,0.00001851896,0.00001275524,0.000002279939,0.00001000295,0.00037828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3611622,"threshold_uncertainty_score":0.3772459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075726393","doi":"10.1007/s11083-009-9136-6","title":"When Will Every Maximal F-free Subposet Contain a Maximal Element?","year":2009,"lang":"en","type":"article","venue":"Order","topic":"Elasticity and Material Modeling","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Element (criminal law); Maximal element; Combinatorics; Discrete mathematics; Computer science; Programming language; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.008343787582730747,"gpt":0.1971623127895958,"spread":0.1888185252068651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008212254,0.000149184,0.0001535903,0.00004774414,0.00004721313,0.0000542358,0.0001754268,0.0000807478,0.0004663885],"category_scores_gemma":[0.00002875846,0.0001539563,0.00003441962,0.00006218121,0.00001303286,0.0002265931,0.00003610026,0.000114878,0.0001050602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000408649,"about_ca_system_score_gemma":0.00001332966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002272182,"about_ca_topic_score_gemma":0.00002926004,"domain_scores_codex":[0.9992131,0.00001177381,0.0001778653,0.0001427996,0.0001277882,0.0003266791],"domain_scores_gemma":[0.9996475,0.00001384923,0.00001575429,0.0002211176,0.0000356284,0.00006617067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001193247,0.0007653479,0.002148615,0.0007440597,0.0006343027,0.0004707878,0.005076057,0.2100832,0.4439465,0.07086763,0.1941718,0.06989847],"study_design_scores_gemma":[0.01386742,0.00184948,0.01514151,0.0005836082,0.0003875994,0.0001881812,0.0005723912,0.3079065,0.05032259,0.1721577,0.432166,0.004857041],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8805003,0.0003041751,0.105268,0.001056874,0.0007480565,0.0002673123,0.00005935806,0.0006805927,0.01111539],"genre_scores_gemma":[0.9917552,0.00002415591,0.007259494,0.0003847403,0.0001942869,0.000007982037,0.00002261712,0.0000261309,0.0003254232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3936239,"threshold_uncertainty_score":0.6278157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2181843556","doi":"10.1023/a:1010614400132","title":"On the Partially Ordered Semigroup Generated by the Class Operators I,R,H,S,P","year":2001,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Retract; Class (philosophy); Semigroup; Operator (biology); Set (abstract data type); Pure mathematics; Type (biology); Discrete mathematics; Algebra over a field; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01443905460028625,"gpt":0.2309692622574119,"spread":0.2165302076571257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002056976,0.0001533124,0.000100846,0.00001761962,0.0003968137,0.0001897577,0.0009735589,0.00005537935,0.0003828165],"category_scores_gemma":[0.00008065022,0.00007277574,0.00003672171,0.0006924677,0.00007194946,0.0001725562,0.0001315054,0.0002037652,0.0004798392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001966809,"about_ca_system_score_gemma":0.00004791551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001525712,"about_ca_topic_score_gemma":0.00003796639,"domain_scores_codex":[0.9988537,0.0001380455,0.0001472137,0.0003096804,0.0002290057,0.0003223651],"domain_scores_gemma":[0.998972,0.0001714431,0.00004838366,0.0006719514,0.00008019833,0.00005601432],"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.00002801595,0.0002240333,0.0005076976,0.000002568416,0.00006303093,0.00004244907,0.0009285765,0.006814322,0.006906635,0.5505525,0.3813359,0.05259425],"study_design_scores_gemma":[0.0005114708,0.0001589944,0.000346979,0.000009382067,0.00000791353,0.0000308605,0.0001003385,0.06298639,0.003858419,0.01234943,0.9192643,0.0003755646],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4271211,0.0006411148,0.47677,0.0654232,0.001112235,0.0006449511,0.000005085511,0.0004551856,0.02782713],"genre_scores_gemma":[0.969837,0.00007159798,0.001096029,0.02165612,0.0001548924,0.00005796775,0.000005061993,0.00001759151,0.007103716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5427159,"threshold_uncertainty_score":0.6167521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2180110214","doi":"10.1023/b:orde.0000034755.82568.09","title":"Obituary: Günter Bruns","year":2003,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Obituary; Mathematics; Combinatorics; Philosophy; Theology","retraction":null,"screen_n_in":null,"score":{"opus":0.00879220590819138,"gpt":0.2203778606526741,"spread":0.2115856547444828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005190399,0.00006328619,0.00005925705,0.00002333781,0.00005509602,0.00003634912,0.0002446767,0.00002537153,0.0002218234],"category_scores_gemma":[0.0000286644,0.00005103716,0.00002227666,0.0002236784,0.00001697181,0.0002172572,0.0000414393,0.00006062876,0.0005957169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008052741,"about_ca_system_score_gemma":0.00002753281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001472548,"about_ca_topic_score_gemma":0.000002725893,"domain_scores_codex":[0.9994841,0.00002246202,0.00006303439,0.000179534,0.00007926716,0.0001716531],"domain_scores_gemma":[0.9996021,0.00001924696,0.00001717665,0.0002912511,0.0000279385,0.00004226867],"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":[6.380648e-7,0.00003845039,0.0008402611,0.000002252083,0.000005063544,0.00001761143,0.0002071863,0.00006107026,0.0003580666,0.9817005,0.003797822,0.01297104],"study_design_scores_gemma":[0.0004895543,0.00007402793,0.002633272,0.000007618917,0.00000307467,0.00005531012,0.0000317943,0.001416003,0.00291127,0.1726135,0.8194134,0.0003511128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008172103,0.0001548796,0.9044492,0.0006110604,0.0003656028,0.00005040882,1.798651e-7,0.000130382,0.08606614],"genre_scores_gemma":[0.8900671,0.000009740298,0.1010294,0.002522175,0.00003819448,0.000006421051,5.442947e-7,0.000007231694,0.006319143],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.881895,"threshold_uncertainty_score":0.7656934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114850296","doi":"10.1007/s11083-005-9016-7","title":"Integral Stone Rings","year":2005,"lang":"en","type":"article","venue":"Order","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Von Neumann regular ring; Hausdorff space; Integer (computer science); Noncommutative ring; Bounded function; Commutative ring; Pure mathematics; Ring (chemistry); Commutative algebra; Unit (ring theory); Characterization (materials science); Discrete mathematics; Local ring; Commutative property; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02810587549316461,"gpt":0.2901652450060777,"spread":0.2620593695129131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001101757,0.00009276575,0.0001184402,0.00003594841,0.0000475245,0.0000239911,0.0001121474,0.00004617039,0.001000425],"category_scores_gemma":[0.0001562715,0.00007704159,0.00003982764,0.00008117544,0.00003338602,0.0001018097,0.00003582984,0.0001181159,0.0007340396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002428135,"about_ca_system_score_gemma":0.00001475548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001573349,"about_ca_topic_score_gemma":0.00005354685,"domain_scores_codex":[0.9994248,0.00001033768,0.0001307498,0.0001332764,0.000117494,0.0001833692],"domain_scores_gemma":[0.9996123,0.0000584411,0.00003760178,0.0002052128,0.00004117903,0.00004526752],"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.00002518899,0.0004897139,0.002490929,0.0001007519,0.00008527354,0.00001338463,0.003880533,0.00001395121,0.002463883,0.5589244,0.320579,0.1109329],"study_design_scores_gemma":[0.001075479,0.0000637162,0.002982685,0.00008000928,0.0000387239,0.0000338448,0.0003616358,0.000532663,0.009840543,0.19099,0.7934787,0.000522],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9628921,0.00008309088,0.002625866,0.003009638,0.0001187238,0.00007877027,0.000001123774,0.0001392574,0.03105144],"genre_scores_gemma":[0.9279844,0.00001067009,0.03629314,0.0008953357,0.0004767616,0.000009532996,0.000002052746,0.0000351568,0.03429294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4728997,"threshold_uncertainty_score":0.9999128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027883459","doi":"10.1007/s11083-010-9177-x","title":"The 1st International Conference on Relations, Orders and Graphs—ROGICS 2008","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02218641360514442,"gpt":0.2982895848577818,"spread":0.2761031712526374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004757131,0.00005109691,0.00004579603,0.00005155258,0.001171122,0.0001391725,0.0001435229,0.00005522068,0.0002458515],"category_scores_gemma":[0.0003092229,0.00003580215,0.00001759593,0.0001993784,0.0004101832,0.0001490756,0.00002810166,0.0001452809,0.0001098093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007584088,"about_ca_system_score_gemma":0.00004733687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004969783,"about_ca_topic_score_gemma":0.007313708,"domain_scores_codex":[0.9993826,0.00003013558,0.0001229662,0.00007366847,0.0002650991,0.00012555],"domain_scores_gemma":[0.9993832,0.0001186382,0.00006964019,0.00009157712,0.0003037491,0.00003324115],"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.000002412109,0.0000055724,0.02401902,6.272011e-7,0.00001513281,1.309058e-7,0.00527281,0.000001109661,0.000004239937,0.9612305,0.007034111,0.002414354],"study_design_scores_gemma":[0.0001588204,0.000009722857,0.02650474,0.000005767226,0.000003590999,0.000001003615,0.01601602,0.00009288273,0.000001175182,0.01669218,0.9404284,0.00008570206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1342254,0.00006486614,0.00009139544,0.03291843,0.002206634,0.0002637721,0.000006167723,0.00007422965,0.8301491],"genre_scores_gemma":[0.993735,0.0003190237,0.0001793037,0.000214893,0.00006547467,0.00001758681,0.000002604042,0.000002593848,0.005463593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9445383,"threshold_uncertainty_score":0.9007444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402679330","doi":"10.1007/s11083-024-09685-7","title":"Partition Rank and Partition Lattices","year":2024,"lang":"en","type":"article","venue":"Order","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Rank (graph theory); Discrete mathematics; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.006325592644393327,"gpt":0.2001727517342348,"spread":0.1938471590898414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007282123,0.00004384777,0.00004082654,0.00002609111,0.00002212632,0.00004952639,0.00001400099,0.00002846923,0.0001870556],"category_scores_gemma":[0.000002777008,0.0000392821,0.00001186401,0.00008821505,0.00001190224,0.0001147889,0.000002875699,0.00004062304,0.0001960615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003839829,"about_ca_system_score_gemma":0.000001563133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001700208,"about_ca_topic_score_gemma":0.000005049666,"domain_scores_codex":[0.9997669,0.00001104656,0.00005611004,0.00006139541,0.00003410528,0.0000704448],"domain_scores_gemma":[0.9999085,0.00001646367,0.000002617834,0.00004656183,0.000005875552,0.00001997789],"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.0000438381,0.00007489345,0.004851047,0.00485372,0.0005602665,0.0001304605,0.00795175,0.01089151,0.08338305,0.6676922,0.06138786,0.1581794],"study_design_scores_gemma":[0.0004818797,0.0000680061,0.00513793,0.0005226273,0.0001067435,0.00006185789,0.0004373431,0.1598978,0.009297197,0.06142268,0.7619794,0.0005864913],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9681906,0.00503638,0.004167743,0.0001652318,0.0009173622,0.00008673107,0.00000613052,0.0006020023,0.0208278],"genre_scores_gemma":[0.9994648,0.00008284926,0.00003595062,0.00001478018,0.00007931307,0.00001572935,0.000005159717,0.000009724101,0.000291682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7005916,"threshold_uncertainty_score":0.2520039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7081523646","doi":"10.1007/s11083-025-09706-z","title":"Orthogonality Relations and Operators on Bounded Quasi-Implication Algebras","year":2025,"lang":"en","type":"article","venue":"Order","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Social Sciences and Humanities Research Council","keywords":"Bounded function; Isomorphism (crystallography); Quantum; Algebraic structure; Monadic predicate calculus; Lattice (music); Algebra over a field; Algebraic number","retraction":null,"screen_n_in":null,"score":{"opus":0.01069856285586475,"gpt":0.2544669268655703,"spread":0.2437683640097056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001347673,0.00005530957,0.0000545783,0.00002567526,0.0001695103,0.00006676142,0.0001545734,0.00004776716,0.0000489837],"category_scores_gemma":[0.0001427596,0.00005031145,0.00001206446,0.0003045506,0.00002902974,0.00009279649,0.00008250033,0.00007530478,0.00002578803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001170872,"about_ca_system_score_gemma":0.00005394164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001095479,"about_ca_topic_score_gemma":0.000005516354,"domain_scores_codex":[0.999516,0.00002637221,0.00009071756,0.0002192219,0.00005718185,0.00009050216],"domain_scores_gemma":[0.999535,0.00005646441,0.00002305629,0.0002823338,0.00007738906,0.00002575138],"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.000001822271,0.00005005319,0.01793226,0.00001003844,0.000009370118,6.969947e-7,0.0001195401,0.0000468066,0.0004171517,0.9707927,0.002613564,0.008005961],"study_design_scores_gemma":[0.0004891191,0.00005569195,0.3066771,0.00004573778,0.00001130726,0.00000785729,0.0000516107,0.0155951,0.00357545,0.3096827,0.3635145,0.0002938703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3534588,0.0001283814,0.3359231,0.06850986,0.0002423785,0.0002391248,0.000002909498,0.0002350535,0.2412604],"genre_scores_gemma":[0.9874917,0.000003393187,0.004104475,0.0008646638,0.00001067133,0.00001401846,0.00000487449,6.60258e-7,0.007505594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.66111,"threshold_uncertainty_score":0.2051641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013323319","doi":"10.1007/s11083-004-0024-9","title":"Semilattice Operations Generated by Lattice Terms","year":2004,"lang":"en","type":"article","venue":"Order","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Semilattice; Mathematics; Lattice (music); Bounded function; Congruence lattice problem; Ternary operation; Combinatorics; Modular design; Distributive lattice; Discrete mathematics; Algebra over a field; Pure mathematics; Distributive property; Computer science; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01041645394985028,"gpt":0.2429733818461717,"spread":0.2325569278963214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004993793,0.00009066334,0.00007374363,0.0000245116,0.0001636411,0.0001070082,0.0003470898,0.00004174341,0.00005782199],"category_scores_gemma":[0.00002734589,0.00007619305,0.00001755509,0.0003904801,0.00002424522,0.000456969,0.00007652484,0.00009029934,0.0003571254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002594284,"about_ca_system_score_gemma":0.00004558964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001643912,"about_ca_topic_score_gemma":0.00001464517,"domain_scores_codex":[0.9993305,0.00001796609,0.000105713,0.0002440715,0.0001094299,0.0001923754],"domain_scores_gemma":[0.9995299,0.00001602371,0.00001636307,0.0003085906,0.00006480893,0.00006429644],"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.000004693341,0.0004146376,0.000244244,0.00001343395,0.00004810935,0.00006589806,0.00163797,0.1068373,0.06005865,0.7988449,0.008217227,0.02361298],"study_design_scores_gemma":[0.007627655,0.0006911758,0.003439641,0.0001012203,0.00008136687,0.0003552489,0.0001923673,0.2510503,0.1307879,0.2011484,0.4010446,0.003480111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04440067,0.0001725014,0.9471916,0.003168376,0.0001984275,0.00008604621,0.000002550669,0.000193766,0.004586099],"genre_scores_gemma":[0.719156,0.00003250415,0.2711488,0.005784071,0.00009652573,0.00002342898,0.00001831599,0.00001448958,0.003725832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6760427,"threshold_uncertainty_score":0.4590244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385659976","doi":"10.1007/s11083-023-09641-x","title":"Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications","year":2023,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Interval graph; Discrete mathematics; Split graph; Distance-hereditary graph; Line graph; Pathwidth; Chordal graph; Induced subgraph; Block graph; Cograph; Intersection graph; Indifference graph; Induced subgraph isomorphism problem; Graph; Graph power; Voltage graph; Vertex (graph theory)","retraction":null,"screen_n_in":null,"score":{"opus":0.03176355493799585,"gpt":0.3440101601170344,"spread":0.3122466051790385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003033025,0.000111998,0.0001302914,0.0001425945,0.0002044101,0.00009642266,0.0007151503,0.00003773207,0.00001562023],"category_scores_gemma":[0.00002696564,0.00008691883,0.00004085128,0.001234327,0.000172228,0.0002905592,0.0001366194,0.0001121867,0.00004062421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001448539,"about_ca_system_score_gemma":0.00005766958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006185054,"about_ca_topic_score_gemma":0.00001998201,"domain_scores_codex":[0.9988497,0.00005107016,0.000126348,0.0004170461,0.0002190673,0.0003367639],"domain_scores_gemma":[0.9987783,0.0002893568,0.00004622217,0.0005900261,0.000220813,0.00007525034],"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.00004967875,0.00005288497,0.003423434,0.00006624195,0.00003950506,0.000002827967,0.0003781507,0.0005864553,0.0003429429,0.9306138,0.0005882434,0.06385584],"study_design_scores_gemma":[0.0003849025,0.0001358073,0.01166444,0.000005504621,0.000005366659,0.000005640826,0.00007439461,0.01718202,0.001111026,0.9500269,0.01920288,0.000201118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02813203,0.00006287556,0.9687051,0.001154762,0.00004227212,0.00099528,0.000018984,0.0004961626,0.0003924998],"genre_scores_gemma":[0.5349242,0.00002260203,0.4624926,0.0001572773,0.00007087956,0.00170256,0.00002878124,0.00002970093,0.0005713669],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5067922,"threshold_uncertainty_score":0.3544447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397983808","doi":"10.1007/s11083-016-9394-z","title":"Rigid Binary Relations on a 4-Element Domain","year":2016,"lang":"en","type":"article","venue":"Order","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Binary relation; Conjecture; Combinatorics; Element (criminal law); Pairwise comparison; Domain (mathematical analysis); Maximal element; Binary number; Projective test; Unary operation; Binary operation; Discrete mathematics; Set (abstract data type); Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01757887691479201,"gpt":0.2982002506832728,"spread":0.2806213737684808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002290369,0.00006676789,0.00005445415,0.0001081467,0.0001176457,0.00002372709,0.00042639,0.00002471101,0.0003532766],"category_scores_gemma":[0.00005224136,0.0000420658,0.00002595282,0.0003994947,0.00005341833,0.0002479425,0.0001582931,0.00006711522,0.001868994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000478179,"about_ca_system_score_gemma":0.00003893776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001070666,"about_ca_topic_score_gemma":0.000002211285,"domain_scores_codex":[0.9991312,0.0000726393,0.00009030144,0.0002416022,0.0002321374,0.000232114],"domain_scores_gemma":[0.9991643,0.0001654774,0.00002400554,0.0005268715,0.00005462041,0.00006474137],"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.00001107494,0.00006099186,0.0004722433,0.000001118121,0.00000757689,0.00001352455,0.0001129443,0.00003833247,0.003053099,0.9568015,0.003981819,0.03544583],"study_design_scores_gemma":[0.0009314218,0.0003334128,0.003501828,0.00004551825,0.000001399526,0.000006716261,0.00001955218,0.000631402,0.00171804,0.7230401,0.2695383,0.0002323436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03097352,0.00003190808,0.9323782,0.01206715,0.0001418618,0.0001746837,0.000003179737,0.0001441925,0.02408533],"genre_scores_gemma":[0.85562,0.00001925304,0.1203682,0.0006407141,0.00006785932,0.00008304478,0.000001317732,0.00001920281,0.02318042],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8246465,"threshold_uncertainty_score":0.9989082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4416943509","doi":"10.1007/s11083-025-09716-x","title":"Promotion, Tangled Labelings, and Sorting Generating Functions","year":2025,"lang":"en","type":"article","venue":"Order","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Combinatorics Foundation; National Security Agency; National Science Foundation","keywords":"Partially ordered set; Conjecture; Operator (biology); Generating function; Generalization; Sorting; Order (exchange); Function (biology)","retraction":null,"screen_n_in":null,"score":{"opus":0.03012760556179584,"gpt":0.3230991935536882,"spread":0.2929715879918923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001999824,0.0001035864,0.0001533011,0.00005311637,0.0002164294,0.0000426093,0.00005956881,0.00005779262,0.00005072438],"category_scores_gemma":[0.001898512,0.00009728593,0.00001980005,0.0002848216,0.00002499744,0.00008202888,0.00007051625,0.0001122671,0.00001232114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002834239,"about_ca_system_score_gemma":0.00003751136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001439558,"about_ca_topic_score_gemma":0.000006271006,"domain_scores_codex":[0.999296,0.00002586627,0.0002644857,0.0001632155,0.00009662,0.000153778],"domain_scores_gemma":[0.9992954,0.0002040842,0.0001001448,0.0001981659,0.0001741247,0.00002812648],"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.000003858245,0.0001855862,0.0006684951,0.0002573399,0.00005958858,0.000002142454,0.0005432638,0.00004279297,0.006254253,0.9804034,0.003029887,0.008549418],"study_design_scores_gemma":[0.0004827412,0.00002495423,0.00001795064,0.0001243724,0.00005617645,0.000004237912,0.000249098,0.005096881,0.001229502,0.990309,0.002263743,0.0001413696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5190243,0.0002671958,0.4615828,0.001130872,0.00097882,0.0005564624,0.000002499065,0.0004203162,0.01603676],"genre_scores_gemma":[0.5156171,0.00001802886,0.4605166,0.000214211,0.0002729318,0.0001264064,0.000006089711,0.00006395212,0.02316471],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009905598,"threshold_uncertainty_score":0.3967205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}