{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"L. P. Belluce","is_ca":true},{"name":"Antonio Di Nola","is_ca":false},{"name":"Anna Rita Ferraioli","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120381,0.000591381,0.0006755846,0.003337643,0.001654481,0.003795856,0.0007567876,0.0008082719,0.009516874],"category_scores_gemma":[0.002473496,0.0004809226,0.0008679268,0.002713688,0.002461708,0.006887446,0.001833545,0.002054068,0.001530099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009411564,"about_ca_system_score_gemma":0.0004758976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008573891,"about_ca_topic_score_gemma":0.0007160007,"domain_scores_codex":[0.9991997,0.0001800655,0.00008502333,0.0001323906,0.0002493575,0.000153572],"domain_scores_gemma":[0.9987362,0.0004239591,0.0001930212,0.000179527,0.0002349651,0.0002322791],"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.00001946071,0.000008706423,0.00008037881,0.00001094903,0.000003754022,0.00002621576,0.0002230153,0.0001134052,0.0002611566,0.9957621,0.0003417721,0.003149118],"study_design_scores_gemma":[0.000009335972,0.00001317219,0.0001235182,0.00001041557,0.000007119407,0.00008925255,0.000124831,0.00116619,0.0003405806,0.9939406,0.004165615,0.000009494132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4934982,0.003844672,0.322402,0.003018642,0.0006669977,0.0001033053,0.001309256,0.0008052107,0.1743516],"genre_scores_gemma":[0.9407457,0.001149697,0.0260978,0.0002605868,0.0004256521,0.00006510726,0.0005001255,0.0001314552,0.03062387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009516874,"threshold_uncertainty_score":0.03183711,"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","authors":[{"name":"Gábor Czédli","is_ca":false},{"name":"George Grätzer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093775,0.0004994358,0.0003220525,0.0009511499,0.0009231903,0.001522531,0.0005077873,0.0005278569,0.01177494],"category_scores_gemma":[0.0009985084,0.0002826106,0.0005923175,0.001174308,0.002700611,0.003087551,0.001596379,0.002845272,0.003047945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139492,"about_ca_system_score_gemma":0.0004265387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001377544,"about_ca_topic_score_gemma":0.001569056,"domain_scores_codex":[0.9997335,0.00004266224,0.00001771894,0.00005010921,0.0001087294,0.00004729689],"domain_scores_gemma":[0.9996792,0.0001457529,0.00003653274,0.00004903305,0.00005369401,0.00003565023],"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.00003099304,0.000009028648,0.00005804483,0.00008559976,0.000005118046,0.00008794809,0.0002074855,0.0008345811,0.001594292,0.9731367,0.006634317,0.01731593],"study_design_scores_gemma":[0.000007560013,0.00002294199,0.0002336829,0.00002140244,0.00000656472,0.0001496013,0.000236124,0.0005954221,0.001644878,0.9250368,0.07203395,0.00001101287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05996724,0.01640453,0.2013647,0.009186684,0.00271638,0.00008910024,0.001418454,0.0005483046,0.7083046],"genre_scores_gemma":[0.6433243,0.01944178,0.0875422,0.0030341,0.002157969,0.0001474589,0.001585776,0.0003146858,0.2424517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01177494,"threshold_uncertainty_score":0.03939104,"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","authors":[{"name":"Moncef Bouaziz","is_ca":false},{"name":"Miguel Couceiro","is_ca":false},{"name":"Maurice Pouzet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222414,0.0008822271,0.001014664,0.002902273,0.002285196,0.00505656,0.0009195866,0.000998999,0.009177216],"category_scores_gemma":[0.003090697,0.0004926315,0.001066589,0.003061315,0.003294642,0.006646481,0.002343082,0.003847544,0.001827737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170038,"about_ca_system_score_gemma":0.0009089854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006441557,"about_ca_topic_score_gemma":0.001035513,"domain_scores_codex":[0.9988226,0.0001897193,0.00005280528,0.0002438792,0.0004480072,0.0002429787],"domain_scores_gemma":[0.9978708,0.001061133,0.0001724422,0.0002927637,0.0002827093,0.0003200921],"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.00003754974,0.00002744584,0.00008593893,0.0000213539,0.000003457003,0.00002740117,0.0001133007,0.0001913437,0.0006029627,0.9905918,0.001293885,0.007003477],"study_design_scores_gemma":[0.00001174455,0.00001114641,0.0001261087,0.000008939682,0.00001435923,0.00008030858,0.00004848289,0.00151858,0.001514716,0.9906862,0.005968482,0.00001098947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2864043,0.001780208,0.4193993,0.003620469,0.0008023442,0.0001291033,0.0009763993,0.001253261,0.2856347],"genre_scores_gemma":[0.8763686,0.001640858,0.04732898,0.0009341321,0.001052355,0.0001102894,0.0009894142,0.0004651646,0.07111022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009177216,"threshold_uncertainty_score":0.0307008,"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","authors":[{"name":"Charles C. Edmunds","is_ca":true},{"name":"Edmond W. H. Lee","is_ca":true},{"name":"Ken W. K. Lee","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009964876,0.0006143915,0.0009540701,0.002221824,0.001898238,0.003646927,0.0008843341,0.0006438264,0.006036408],"category_scores_gemma":[0.00239978,0.000611423,0.0008507291,0.001414431,0.003879673,0.004627192,0.002753962,0.001893264,0.0006418427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008912822,"about_ca_system_score_gemma":0.0003727803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002820357,"about_ca_topic_score_gemma":0.0004313531,"domain_scores_codex":[0.999248,0.0002059241,0.00004567357,0.0002005972,0.000207721,0.00009216552],"domain_scores_gemma":[0.9965796,0.002068324,0.0002260421,0.000344325,0.0002150316,0.0005666597],"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.00006405097,0.00003457284,0.0004766562,0.00002681065,0.000008024445,0.0001509121,0.0005733672,0.0007000635,0.002926667,0.9902734,0.0005026694,0.004262879],"study_design_scores_gemma":[0.00004747585,0.00004606426,0.0005598671,0.00001015508,0.00002179115,0.0004450441,0.0002870137,0.008021309,0.002669466,0.983384,0.004485988,0.00002180229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.618788,0.001263483,0.3252162,0.001193499,0.0002528525,0.00008753363,0.0002844369,0.001000815,0.05191314],"genre_scores_gemma":[0.9650642,0.0002370965,0.0221049,0.0001085347,0.0001725524,0.00006816362,0.0001352985,0.0001039132,0.0120054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006036408,"threshold_uncertainty_score":0.02019376,"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","authors":[{"name":"Vida Dujmović","is_ca":true},{"name":"David R. Wood","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002482353,0.0005827692,0.0004254697,0.001009396,0.0006393382,0.001517087,0.0008713944,0.0006294424,0.01066498],"category_scores_gemma":[0.001785306,0.0004898237,0.0004969368,0.001031153,0.0006826213,0.001145894,0.001160812,0.001281848,0.00197753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005146742,"about_ca_system_score_gemma":0.0003801512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00247005,"about_ca_topic_score_gemma":0.005497189,"domain_scores_codex":[0.9996756,0.0000777415,0.00002008239,0.0000445255,0.0001325154,0.00004943021],"domain_scores_gemma":[0.9992771,0.0002424537,0.00005305004,0.000198982,0.0001689999,0.00005948251],"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.000209324,0.00009593672,0.002057656,0.0003023282,0.00002472514,0.0006749493,0.0009645933,0.1099788,0.02521364,0.5783175,0.02043852,0.261722],"study_design_scores_gemma":[0.00008139318,0.00008707473,0.001256743,0.0001173724,0.00003928222,0.0007530015,0.000540034,0.395434,0.03080636,0.4501381,0.1206937,0.00005302344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05248586,0.0002391658,0.9114362,0.0003018021,0.0001179006,0.0001170583,0.0006078613,0.00132205,0.03337209],"genre_scores_gemma":[0.3666452,0.0007321065,0.6092891,0.0001017213,0.00003698585,0.0001152585,0.001416712,0.0007432021,0.02091978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01066498,"threshold_uncertainty_score":0.03567785,"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","authors":[{"name":"S. David Promislow","is_ca":true},{"name":"Virginia R. Young","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034092,0.0007689676,0.001170865,0.002269,0.001393419,0.003135137,0.0008547865,0.0006686428,0.006060537],"category_scores_gemma":[0.004352218,0.0005522296,0.0008604144,0.00188147,0.003722334,0.006487562,0.001569899,0.002328533,0.0006111251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230397,"about_ca_system_score_gemma":0.0008530026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001484885,"about_ca_topic_score_gemma":0.001964636,"domain_scores_codex":[0.9989334,0.0003816582,0.00005448193,0.0001475826,0.0003737159,0.0001091139],"domain_scores_gemma":[0.9968089,0.001872592,0.0003338456,0.0003232933,0.0004003875,0.0002610121],"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.00001335073,0.000008583941,0.00004040729,0.00001748808,0.000004212464,0.00001877471,0.00006977221,0.00145945,0.0002926832,0.9941441,0.0003909862,0.003540206],"study_design_scores_gemma":[0.000005552597,0.000009684622,0.00003906478,0.000005289445,0.000002662535,0.00003111734,0.00002925541,0.00739433,0.0001951018,0.9908348,0.001447528,0.000005561018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2098818,0.002902103,0.6984522,0.002606057,0.000292384,0.00004882314,0.0004273342,0.0002364388,0.08515289],"genre_scores_gemma":[0.8448463,0.002308206,0.1246751,0.0004053046,0.0005833314,0.0001206529,0.0002877615,0.0001331847,0.02664013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006060537,"threshold_uncertainty_score":0.02027452,"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","authors":[{"name":"Maurice Pouzet","is_ca":true},{"name":"Imed Zaguia","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001584502,0.001281895,0.001724701,0.004681305,0.004580417,0.005532131,0.001520293,0.001770143,0.008117918],"category_scores_gemma":[0.005186388,0.001128642,0.001408991,0.005161765,0.009786376,0.0170488,0.004213577,0.005524159,0.0008569832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002719898,"about_ca_system_score_gemma":0.0009840323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002681189,"about_ca_topic_score_gemma":0.003330396,"domain_scores_codex":[0.9989651,0.0003540502,0.00005498535,0.0002390045,0.0002451836,0.0001416213],"domain_scores_gemma":[0.9965678,0.002093073,0.0003621968,0.0002919387,0.0002856482,0.0003993403],"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.00001219724,0.00001032839,0.00009074256,0.00002057845,0.000002479239,0.00002734978,0.0003038499,0.0002397207,0.00007999584,0.9969925,0.0005397451,0.001680566],"study_design_scores_gemma":[0.000003360676,0.000002992155,0.00004536977,0.000006921604,0.000003748361,0.00002822971,0.00006768901,0.0003225867,0.00003436042,0.9981405,0.001341216,0.000003105148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3691377,0.01683741,0.2688198,0.01686327,0.001104992,0.0001300314,0.001230461,0.0006120488,0.3252642],"genre_scores_gemma":[0.9153497,0.006740989,0.03342009,0.001095125,0.001539336,0.0001879257,0.0007933488,0.0001942204,0.04067932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008117918,"threshold_uncertainty_score":0.02715713,"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","authors":[{"name":"Robin Christian","is_ca":true},{"name":"Marston Conder","is_ca":false},{"name":"Arkadii Slinko","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01142302,0.0006751547,0.001429324,0.004403506,0.00278865,0.004584558,0.001864676,0.001742039,0.008779353],"category_scores_gemma":[0.04911244,0.001034932,0.001507369,0.00626695,0.00728196,0.01991315,0.002900865,0.003857969,0.0004763812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002463279,"about_ca_system_score_gemma":0.001169241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001182079,"about_ca_topic_score_gemma":0.001597994,"domain_scores_codex":[0.9932601,0.004080286,0.0003750245,0.000928458,0.001065847,0.0002902137],"domain_scores_gemma":[0.9636243,0.02929209,0.001657872,0.002907876,0.001768856,0.0007490772],"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.0000354337,0.000007627754,0.0001565704,0.00003586987,0.00001075881,0.00003730229,0.0002513446,0.002422879,0.00009752489,0.9887543,0.0003317593,0.007858708],"study_design_scores_gemma":[0.00000525029,0.0000133212,0.00009683169,0.00001502786,0.000009997489,0.0000424231,0.00007382926,0.005466484,0.0001503754,0.9929604,0.001158963,0.000007088368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1070586,0.002427034,0.8527566,0.001525481,0.0002197081,0.0001089162,0.0003067468,0.0001386623,0.03545826],"genre_scores_gemma":[0.7222227,0.001204094,0.2686112,0.000260942,0.0002496164,0.0003071099,0.0004032854,0.0001171148,0.006623848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01142302,"threshold_uncertainty_score":0.06041145,"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","authors":[{"name":"Alfio Giarlotta","is_ca":false},{"name":"Stephen Watson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003103943,0.0009334544,0.001117605,0.00426758,0.001951452,0.007105179,0.0008533652,0.001050316,0.02085332],"category_scores_gemma":[0.009267706,0.0005371962,0.0007522983,0.003585001,0.006104534,0.01008609,0.002529455,0.00412105,0.003779501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001704542,"about_ca_system_score_gemma":0.001341555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001615339,"about_ca_topic_score_gemma":0.001693473,"domain_scores_codex":[0.9971682,0.001380578,0.0001963702,0.0003627646,0.0006772838,0.0002147648],"domain_scores_gemma":[0.9944411,0.00314441,0.0003519059,0.0007857884,0.0008986766,0.0003779643],"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.000007121915,0.000003545571,0.00003196707,0.000008241679,0.000001495184,0.000008269661,0.00005013074,0.0001224507,0.00004175165,0.9963323,0.0006890405,0.002703544],"study_design_scores_gemma":[0.000004584772,0.000003447736,0.00002643482,0.000005704487,0.000001815674,0.00002912296,0.00003094581,0.0005400621,0.0001119191,0.9934227,0.00581932,0.000003999814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06055865,0.00393047,0.5451561,0.008040127,0.001197957,0.00009447231,0.001340986,0.0003821425,0.3792991],"genre_scores_gemma":[0.7186718,0.005847074,0.1502485,0.001748897,0.001385462,0.0002698556,0.001180744,0.0005280346,0.1201197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02085332,"threshold_uncertainty_score":0.06976128,"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","authors":[{"name":"Norbert Sauer","is_ca":true},{"name":"Imed Zaguia","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397805,0.0008827737,0.0008036891,0.002711222,0.002008836,0.003740861,0.0006743213,0.001164401,0.006652173],"category_scores_gemma":[0.002736802,0.0004282588,0.001385889,0.001469757,0.006507338,0.006830179,0.001899517,0.003009963,0.001009217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001535435,"about_ca_system_score_gemma":0.00111362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001459701,"about_ca_topic_score_gemma":0.001413067,"domain_scores_codex":[0.9983528,0.0003498835,0.0001359909,0.0003431047,0.0005086694,0.0003095572],"domain_scores_gemma":[0.9971302,0.0005769336,0.0004134806,0.0006903447,0.0007702089,0.0004187017],"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.0000313606,0.00001554273,0.0001910923,0.00001345735,0.000005004783,0.00003321798,0.0001031128,0.00005682957,0.0008144638,0.9958192,0.0004341891,0.002482466],"study_design_scores_gemma":[0.00002298074,0.00005093135,0.0005994388,0.00001648162,0.0000197167,0.0002656743,0.000193872,0.0009407433,0.001571405,0.9880357,0.008255685,0.00002727766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4362627,0.001424147,0.2326914,0.004666458,0.002842521,0.00008911171,0.0006378327,0.0004088154,0.320977],"genre_scores_gemma":[0.9088111,0.001016852,0.03775038,0.0007687514,0.001431936,0.00006099449,0.0004584208,0.0002077848,0.04949383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006652173,"threshold_uncertainty_score":0.02225375,"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","authors":[{"name":"Walter Bossert","is_ca":true},{"name":"Kotaro Suzumura","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281865,0.0007360082,0.001779564,0.001779011,0.002161631,0.006672432,0.001516896,0.002982917,0.009719233],"category_scores_gemma":[0.02362709,0.0007350879,0.001107471,0.001494729,0.009307313,0.01299284,0.002143471,0.004877734,0.000826284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002636758,"about_ca_system_score_gemma":0.001974625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002802731,"about_ca_topic_score_gemma":0.001760336,"domain_scores_codex":[0.9964444,0.001826628,0.0001987264,0.000570201,0.0005116457,0.0004484702],"domain_scores_gemma":[0.9602515,0.03201501,0.001945557,0.002441854,0.00213313,0.001212933],"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.00001275924,0.00001076214,0.00007125917,0.00001288444,0.000003663725,0.00001355859,0.00007170242,0.001025747,0.00004848256,0.9976413,0.0003476795,0.0007403199],"study_design_scores_gemma":[0.000009950605,0.000002126379,0.00002428235,0.000003646254,0.000001186641,0.000006785154,0.00002556006,0.002224898,0.00003293106,0.9973186,0.0003477589,0.000002268671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2009626,0.002500704,0.6534644,0.01193593,0.0002590532,0.0001362864,0.0007629712,0.0002359593,0.1297421],"genre_scores_gemma":[0.9576412,0.001079352,0.02842413,0.0004020025,0.0002733352,0.0001961526,0.000405941,0.00007319598,0.01150469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009719233,"threshold_uncertainty_score":0.03251404,"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","authors":[{"name":"Alfio Giarlotta","is_ca":false},{"name":"Stephen Watson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701369,0.0006532967,0.0006543346,0.001847875,0.002318207,0.003898059,0.0006957435,0.001089739,0.02499357],"category_scores_gemma":[0.001645242,0.001009573,0.0005780642,0.001620561,0.002443516,0.004597301,0.001606268,0.001649704,0.004578369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001325357,"about_ca_system_score_gemma":0.0007519711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002142456,"about_ca_topic_score_gemma":0.004163908,"domain_scores_codex":[0.9992639,0.000165547,0.00005800849,0.0001887483,0.0001615626,0.0001622251],"domain_scores_gemma":[0.9972423,0.001499981,0.000234115,0.0002958664,0.000351968,0.0003757234],"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.0001647721,0.0000457071,0.0005968778,0.00008917409,0.00001053607,0.0003613009,0.001142612,0.0006465136,0.007438225,0.975523,0.003353757,0.01062745],"study_design_scores_gemma":[0.00007557045,0.00005506929,0.0007675146,0.00006823361,0.00002531705,0.0004089568,0.0005830744,0.007120552,0.004997179,0.9621474,0.02371162,0.00003956485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4926035,0.001584946,0.2725689,0.002514478,0.0002166833,0.0001488971,0.003078391,0.003045406,0.224239],"genre_scores_gemma":[0.8605747,0.0006980394,0.06968793,0.0005373644,0.0001729606,0.0001654032,0.002628524,0.0006331289,0.0649019],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02499357,"threshold_uncertainty_score":0.08361185,"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","authors":[{"name":"Günter Bruns","is_ca":true},{"name":"John Harding","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016504,0.0004059741,0.0005523915,0.001934996,0.002140245,0.003680691,0.0006221961,0.000711512,0.004649268],"category_scores_gemma":[0.001900409,0.0006074475,0.0008165128,0.001867846,0.002998793,0.00754588,0.00187501,0.002196796,0.000410063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107045,"about_ca_system_score_gemma":0.0004778593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007034822,"about_ca_topic_score_gemma":0.0007985792,"domain_scores_codex":[0.9992498,0.0001771759,0.00005629281,0.0001666093,0.0001789255,0.0001711698],"domain_scores_gemma":[0.9985877,0.0005583616,0.0001760456,0.0001666537,0.0001903842,0.0003209174],"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.00002936113,0.00001906006,0.0002836724,0.00001042966,0.000004324889,0.0001012597,0.0003664786,0.0001510267,0.0005646709,0.9964424,0.0002756223,0.001751803],"study_design_scores_gemma":[0.00002184902,0.00001998702,0.0006569733,0.000006578485,0.00001187983,0.0002644059,0.000238159,0.001137851,0.0007705124,0.9931149,0.0037457,0.00001124571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8005114,0.001139587,0.09026537,0.001614147,0.0002045218,0.00006846534,0.0003733262,0.0003163126,0.105507],"genre_scores_gemma":[0.9707106,0.0005452875,0.01045254,0.000185463,0.0002104487,0.00004376198,0.0002319654,0.00005698311,0.01756289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004649268,"threshold_uncertainty_score":0.01555341,"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","authors":[{"name":"L. P. Belluce","is_ca":true},{"name":"Antonio Di Nola","is_ca":false},{"name":"Brunella Gerla","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172025,0.0007079546,0.0009362467,0.001860972,0.002228566,0.003267098,0.001057104,0.0008333609,0.006513594],"category_scores_gemma":[0.002362851,0.0006803601,0.0009575822,0.001363734,0.003888669,0.006929307,0.00334132,0.001708532,0.001165024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008273102,"about_ca_system_score_gemma":0.0007502965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005288835,"about_ca_topic_score_gemma":0.0005672024,"domain_scores_codex":[0.9989017,0.0002113443,0.0001016179,0.0002059036,0.0003176659,0.000261745],"domain_scores_gemma":[0.9984165,0.000448698,0.0002933364,0.0002378351,0.0002415941,0.0003619052],"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.00009079885,0.00001666528,0.0002604133,0.00002115043,0.00001220966,0.00007404661,0.0002296332,0.0001936564,0.0007083622,0.9951642,0.0004108594,0.002818163],"study_design_scores_gemma":[0.00003126333,0.00003554003,0.0002521869,0.000009388655,0.00002580215,0.0001949636,0.0001503122,0.0009849577,0.00128161,0.9935335,0.003483751,0.00001678102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6852562,0.001613095,0.1771377,0.001999291,0.000565063,0.0001192841,0.0005832948,0.0007989119,0.1319273],"genre_scores_gemma":[0.9669103,0.0002758437,0.0120225,0.0001998052,0.0003262068,0.00004539109,0.000270671,0.0000553928,0.01989391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006513594,"threshold_uncertainty_score":0.02179015,"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","authors":[{"name":"Pedro Morales","is_ca":true},{"name":"Francisco García Mazario","is_ca":false},{"name":"P. Jiménez Guerra","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001548664,0.0007131742,0.001197675,0.00274351,0.002083754,0.004076531,0.001022689,0.001245698,0.006125094],"category_scores_gemma":[0.003425539,0.0005791053,0.001870125,0.001578752,0.003531848,0.009535853,0.002488677,0.004466972,0.00109732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001783425,"about_ca_system_score_gemma":0.0008505629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007282718,"about_ca_topic_score_gemma":0.0007548634,"domain_scores_codex":[0.9990841,0.0001799013,0.00005982769,0.0002192359,0.0002970586,0.0001598852],"domain_scores_gemma":[0.9984087,0.0006862616,0.0001038105,0.000271027,0.000331191,0.0001989623],"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.000005550781,0.000005474114,0.00003958146,0.00001065946,0.000002825531,0.000007333708,0.00006023165,0.0001219509,0.0001621152,0.9973668,0.000559539,0.001657858],"study_design_scores_gemma":[0.000004689728,0.000005925756,0.00006833599,0.000005814911,0.000003847837,0.00003655234,0.00001779402,0.001734408,0.0002385422,0.9956903,0.002188318,0.000005373617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1165292,0.001918331,0.7284961,0.004438767,0.0006232337,0.00008357171,0.0004853147,0.0004328296,0.1469927],"genre_scores_gemma":[0.8049603,0.00176207,0.1359491,0.001370543,0.001269382,0.0002049862,0.0006155664,0.0003059614,0.05356228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006125094,"threshold_uncertainty_score":0.02049047,"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)","authors":[{"name":"Michael Albert","is_ca":false},{"name":"Richard J. Nowakowski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001405143,0.001360686,0.001884704,0.003324055,0.003512862,0.009668952,0.001444651,0.001553592,0.01743621],"category_scores_gemma":[0.00502601,0.001212616,0.001537301,0.003159136,0.006970454,0.01085858,0.003023649,0.004420663,0.003164052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003115404,"about_ca_system_score_gemma":0.001771904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003691697,"about_ca_topic_score_gemma":0.003422318,"domain_scores_codex":[0.9975431,0.001009652,0.0001793364,0.0004458068,0.0005822588,0.0002399826],"domain_scores_gemma":[0.9969075,0.001570553,0.0002029223,0.000418951,0.000477127,0.0004228607],"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.000005289204,0.000004356257,0.00002224989,0.00001247185,0.000002306825,0.000006439432,0.00007257743,0.0002244878,0.00002850678,0.9976259,0.0008498337,0.00114559],"study_design_scores_gemma":[0.000007941037,0.000002817449,0.0000195016,0.000008587603,0.000002347711,0.00001351822,0.00004247992,0.0007711198,0.00003804682,0.9906114,0.008478381,0.000003884255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03715567,0.009828598,0.4767631,0.007574464,0.001459639,0.0002455522,0.002480449,0.001093484,0.4633991],"genre_scores_gemma":[0.7281904,0.005370083,0.1524035,0.001419775,0.001857955,0.0006408126,0.003258212,0.0005196189,0.1063397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01743621,"threshold_uncertainty_score":0.05832994,"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","authors":[{"name":"Jan Foniok","is_ca":false},{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Aleš Pultr","is_ca":false},{"name":"Claude Tardif","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438876,0.0009154545,0.001099081,0.003728936,0.004018942,0.005678746,0.001197593,0.001490856,0.009631732],"category_scores_gemma":[0.002293661,0.0008694747,0.001273959,0.002910848,0.005506545,0.0113439,0.002753719,0.004325836,0.00110131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696303,"about_ca_system_score_gemma":0.0008067625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001413419,"about_ca_topic_score_gemma":0.001516015,"domain_scores_codex":[0.9988549,0.0003227945,0.00007596002,0.0002328641,0.0002422357,0.0002713517],"domain_scores_gemma":[0.9985676,0.0004739891,0.0001811866,0.0001591348,0.000251882,0.0003662304],"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.00002641267,0.00001852835,0.00008790406,0.00001152522,0.000003831068,0.00003101673,0.0001956485,0.0001063917,0.0002111329,0.9978751,0.0002808722,0.001151595],"study_design_scores_gemma":[0.00001077413,0.000006664477,0.00005523378,0.000005288098,0.000006261472,0.00004434478,0.0001034997,0.0004968782,0.0002313586,0.9980443,0.0009874711,0.000007930544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6511936,0.002441168,0.1620829,0.003842592,0.0009049009,0.0001309077,0.0006726693,0.0003686408,0.1783625],"genre_scores_gemma":[0.9446641,0.0006989253,0.01857672,0.0005703864,0.0004747684,0.00007600063,0.0003321137,0.0001280448,0.03447901],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009631732,"threshold_uncertainty_score":0.03222132,"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","authors":[{"name":"Maurice Pouzet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001921862,0.0008383204,0.001007522,0.00284805,0.001812042,0.005310981,0.001059162,0.001287817,0.005603733],"category_scores_gemma":[0.00502771,0.0009216531,0.001205561,0.002432584,0.005444024,0.01481105,0.002324541,0.004134545,0.0005268395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001573058,"about_ca_system_score_gemma":0.0006620854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159637,"about_ca_topic_score_gemma":0.001724006,"domain_scores_codex":[0.9986864,0.0004509653,0.0001083612,0.0003545544,0.0002539226,0.0001458729],"domain_scores_gemma":[0.9927753,0.004449517,0.0007089197,0.0008257074,0.000576768,0.0006638094],"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.00003062405,0.0000172574,0.0002366559,0.00002628114,0.000008689648,0.00004397004,0.0004050793,0.0004642318,0.0005505895,0.9957609,0.0002471112,0.002208758],"study_design_scores_gemma":[0.000009552394,0.00001538261,0.0002533994,0.000007272568,0.000007816224,0.00005842929,0.0001170978,0.001284712,0.0002894431,0.9969176,0.001031769,0.000007594942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5176539,0.005812339,0.4009372,0.005452873,0.0003793328,0.00006184643,0.001012294,0.0004109283,0.06827918],"genre_scores_gemma":[0.9492564,0.001744898,0.03351556,0.0003887126,0.0004083783,0.00005836408,0.0006190976,0.0001048778,0.01390378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005603733,"threshold_uncertainty_score":0.01874638,"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","authors":[{"name":"Hans‐Jürgen Bandelt","is_ca":false},{"name":"Maurice Pouzet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002732116,0.0008722761,0.0008151756,0.002788178,0.003353514,0.005471599,0.00264939,0.002113544,0.008149809],"category_scores_gemma":[0.004112065,0.0008265415,0.001660329,0.001936611,0.009927276,0.01118272,0.003133418,0.004694367,0.001384863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003299975,"about_ca_system_score_gemma":0.00307305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003500768,"about_ca_topic_score_gemma":0.003650131,"domain_scores_codex":[0.9980628,0.0008309248,0.0001326176,0.0003239835,0.0004742413,0.0001753774],"domain_scores_gemma":[0.9981054,0.0008792469,0.0001207097,0.000258914,0.0004419974,0.0001935747],"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.000002515708,0.000004411552,0.00001433863,0.000008767029,9.671386e-7,0.00002091983,0.0001762612,0.00009587012,0.0001341677,0.9985702,0.0003213378,0.0006502342],"study_design_scores_gemma":[0.000005532841,0.000008802856,0.00003991084,0.00001270601,0.000003733247,0.00006184177,0.00008827887,0.00153193,0.0003318952,0.9878633,0.01004162,0.00001037449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02590846,0.002889754,0.8298744,0.007409731,0.001100213,0.00009315127,0.0004075002,0.000570185,0.1317466],"genre_scores_gemma":[0.6704154,0.001951029,0.2684292,0.00307275,0.002208784,0.0002668443,0.000632109,0.0005768084,0.05244713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008149809,"threshold_uncertainty_score":0.02726382,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002293543,0.0008384898,0.001377874,0.003253459,0.005144721,0.002716019,0.00253712,0.002363349,0.01696834],"category_scores_gemma":[0.007136739,0.0006786133,0.00181047,0.003370264,0.008039429,0.01325066,0.004508157,0.006320297,0.002629836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002738913,"about_ca_system_score_gemma":0.001392724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005282724,"about_ca_topic_score_gemma":0.005010824,"domain_scores_codex":[0.9981514,0.000356795,0.00009636935,0.0004798188,0.0006547536,0.0002608517],"domain_scores_gemma":[0.9933241,0.003877303,0.000183419,0.001229786,0.001050253,0.0003352476],"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.00001929156,0.00001210696,0.00007972372,0.00003995405,0.000007561861,0.00004199117,0.0001650649,0.0003028002,0.0001693271,0.9804783,0.01345705,0.005226774],"study_design_scores_gemma":[0.000005013939,0.000004274256,0.00006897076,0.000007455729,0.000006203587,0.00003809233,0.00003376293,0.0003887675,0.0001923449,0.9817067,0.01753926,0.000009171622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04203318,0.005870061,0.3001394,0.06014695,0.01212555,0.000109334,0.0009762189,0.001176192,0.5774232],"genre_scores_gemma":[0.5813293,0.01009549,0.1673427,0.02338577,0.01367042,0.0003222848,0.001072203,0.001283707,0.2014981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01696834,"threshold_uncertainty_score":0.05676472,"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","authors":[{"name":"Frank Roumen","is_ca":false},{"name":"Sutanu Roy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001716836,0.000568976,0.0006277002,0.002254171,0.002207493,0.003734483,0.0007997561,0.0009678058,0.007519928],"category_scores_gemma":[0.00267143,0.0004675082,0.00125394,0.001060065,0.003892419,0.0061443,0.00295442,0.002146705,0.0009740814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001891662,"about_ca_system_score_gemma":0.000792703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001173134,"about_ca_topic_score_gemma":0.0008024895,"domain_scores_codex":[0.9985286,0.0004149927,0.0001029587,0.000297964,0.0004098036,0.0002456676],"domain_scores_gemma":[0.9986563,0.0004200946,0.0001375183,0.0001680588,0.0003627634,0.0002552944],"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.000004603145,0.000004158484,0.00003839349,0.000007568935,0.000002006607,0.00002630397,0.00008926149,0.0001747019,0.000234846,0.9983725,0.0001239685,0.0009217549],"study_design_scores_gemma":[0.000006050907,0.00001695482,0.0001334773,0.00001214624,0.000005230191,0.00007765463,0.00009116879,0.003408653,0.0007886271,0.9909266,0.004523839,0.000009669987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2976158,0.002038017,0.4775681,0.001813422,0.0004917215,0.0001835516,0.000677262,0.0003382819,0.2192739],"genre_scores_gemma":[0.9057584,0.0008528947,0.06305682,0.0005890397,0.0002832637,0.0002829505,0.0004700664,0.0001637006,0.02854297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007519928,"threshold_uncertainty_score":0.02515668,"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","authors":[{"name":"Keegan Dasilva Barbosa","is_ca":true},{"name":"Dragan Mašulović","is_ca":false},{"name":"Rajko Nenadov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002023272,0.001024009,0.001160027,0.002375329,0.002317705,0.003842073,0.001255677,0.001557441,0.008860034],"category_scores_gemma":[0.004624689,0.0004138951,0.001162138,0.002360983,0.006607423,0.01153065,0.004470283,0.006518085,0.001115812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001508206,"about_ca_system_score_gemma":0.0006347852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001314445,"about_ca_topic_score_gemma":0.001494351,"domain_scores_codex":[0.9992529,0.0002087415,0.00005215752,0.0002089467,0.0002075612,0.00006969278],"domain_scores_gemma":[0.996741,0.002200008,0.0001526469,0.0003177257,0.0002947941,0.0002937644],"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.00002412164,0.00001294438,0.0001507828,0.00008060071,0.000008209119,0.00008940082,0.000226935,0.0002563702,0.0008304251,0.9879156,0.005113806,0.005290695],"study_design_scores_gemma":[0.000004235922,0.00001461784,0.000261919,0.00002384296,0.00000889985,0.000102483,0.00007316117,0.0009172302,0.0003351772,0.9781425,0.02010203,0.00001390525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07343996,0.02965705,0.4986648,0.04002335,0.01197034,0.0001419104,0.001559037,0.0009529016,0.3435906],"genre_scores_gemma":[0.7191617,0.02039444,0.1383713,0.01119248,0.01995756,0.0002666973,0.0009550385,0.00068223,0.08901853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008860034,"threshold_uncertainty_score":0.02963972,"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","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Terry I. Visentin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001809066,0.0005620348,0.001101394,0.003098402,0.002046145,0.005436087,0.0012589,0.001440469,0.004428216],"category_scores_gemma":[0.007519066,0.0006711569,0.0009838354,0.002729963,0.003433526,0.009709443,0.002133612,0.002087307,0.0004338934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001835488,"about_ca_system_score_gemma":0.0008401925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001012831,"about_ca_topic_score_gemma":0.001834336,"domain_scores_codex":[0.9985474,0.0002566773,0.0001490531,0.0003005535,0.0004807882,0.0002655934],"domain_scores_gemma":[0.9917121,0.004385489,0.0008449741,0.001034243,0.00102759,0.0009957177],"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.00004943509,0.00002657191,0.0012221,0.00002905684,0.000006529624,0.00009190274,0.0003521276,0.0005940462,0.001638338,0.9898987,0.000551214,0.005540006],"study_design_scores_gemma":[0.00001143258,0.00002049804,0.0007424395,0.00001519533,0.00001943801,0.0002425643,0.0001648111,0.006162396,0.001712476,0.9882216,0.002669767,0.00001737524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7140126,0.0007221792,0.2462441,0.0009406771,0.0002095134,0.00008034582,0.0003636593,0.0004926517,0.03693438],"genre_scores_gemma":[0.9474294,0.0003883985,0.04040271,0.0001608424,0.0001853424,0.00007582549,0.0003012211,0.0001274599,0.01092874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005436087,"threshold_uncertainty_score":0.01481384,"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","authors":[{"name":"Peter J. Dukes","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005240393,0.0004590936,0.0003344753,0.001459786,0.001903111,0.001867313,0.0005936182,0.000733847,0.004400537],"category_scores_gemma":[0.002356832,0.000332344,0.0004071388,0.0007760145,0.001625473,0.00182611,0.0007648519,0.001185781,0.0003069528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001045243,"about_ca_system_score_gemma":0.0008126318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001281479,"about_ca_topic_score_gemma":0.001799571,"domain_scores_codex":[0.9995754,0.0001403221,0.00001768796,0.00006523929,0.00009547979,0.0001059002],"domain_scores_gemma":[0.9975917,0.001217548,0.0004543974,0.0001766519,0.0002677712,0.0002918579],"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.0000408578,0.00002406125,0.0003670883,0.00001751131,0.000006059213,0.0001075342,0.0001933352,0.002842119,0.001332554,0.9922622,0.0006738906,0.002132786],"study_design_scores_gemma":[0.00001674824,0.00001950003,0.000241038,0.00001276202,0.000006479588,0.0001667532,0.0001772741,0.02413671,0.0009513035,0.9721698,0.002086449,0.00001521311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6306635,0.0003922125,0.3084417,0.001055088,0.00008918919,0.00005731171,0.0003156133,0.0002534002,0.05873201],"genre_scores_gemma":[0.9706077,0.0002700633,0.01683236,0.000185489,0.00007475195,0.00007468212,0.0002107751,0.00004244753,0.01170175],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004400537,"threshold_uncertainty_score":0.01472133,"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","authors":[{"name":"Bill Sands","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009552389,0.0005934298,0.0008018551,0.001459614,0.002325852,0.00486511,0.0006811594,0.0008917408,0.01264191],"category_scores_gemma":[0.002692691,0.0005840859,0.001035145,0.001639705,0.002498012,0.009194862,0.00215925,0.002240195,0.001401367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007638824,"about_ca_system_score_gemma":0.001213598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008356841,"about_ca_topic_score_gemma":0.001961923,"domain_scores_codex":[0.9988845,0.0002063107,0.0001035421,0.0003151953,0.0002800796,0.0002102893],"domain_scores_gemma":[0.996528,0.00170844,0.0003902862,0.0005316318,0.0004622867,0.0003794509],"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.00007319417,0.00004490749,0.0005209008,0.0000412839,0.0000124358,0.000149285,0.0002346553,0.0004909287,0.001246589,0.9887083,0.002214456,0.006263105],"study_design_scores_gemma":[0.00002189181,0.00001518503,0.000193933,0.000009644147,0.00001281804,0.0001949261,0.00009639288,0.001543458,0.001197484,0.9911595,0.005543231,0.00001156634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.377222,0.00184065,0.3255451,0.003420458,0.0007230056,0.0001488027,0.00303708,0.001588376,0.2864746],"genre_scores_gemma":[0.9350356,0.0006370152,0.03591898,0.0004991802,0.000533867,0.000103277,0.002057174,0.0002076654,0.02500703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01264191,"threshold_uncertainty_score":0.0422914,"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","authors":[{"name":"Davoud Abdi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002094571,0.001267391,0.001206269,0.002132661,0.002341762,0.003318122,0.001866635,0.001855904,0.01969997],"category_scores_gemma":[0.007356341,0.0008619205,0.001967443,0.00211227,0.006912059,0.01020546,0.006851801,0.006399596,0.001807789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001870339,"about_ca_system_score_gemma":0.001111471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001891403,"about_ca_topic_score_gemma":0.002667818,"domain_scores_codex":[0.9987016,0.0002816269,0.00007428205,0.0002918131,0.0004490984,0.0002015744],"domain_scores_gemma":[0.993579,0.004099499,0.0003143801,0.0008397228,0.0006105957,0.0005568486],"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.00007144357,0.00004768618,0.0003863208,0.0001033383,0.00001467805,0.0002067511,0.0003086926,0.0006989812,0.0009151992,0.9883107,0.004562836,0.004373345],"study_design_scores_gemma":[0.00003058241,0.00002008564,0.0002936324,0.00002470025,0.00001457441,0.000139405,0.00009510539,0.002172512,0.000409993,0.9904433,0.006342585,0.00001354818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2443384,0.003527086,0.2469832,0.03002674,0.003454167,0.0001350312,0.001244297,0.00145487,0.4688362],"genre_scores_gemma":[0.9211146,0.001783944,0.03906587,0.002664208,0.001555063,0.0001199956,0.0007809922,0.0002436274,0.03267167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01969997,"threshold_uncertainty_score":0.06590295,"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","authors":[{"name":"Youssef Boudabbous","is_ca":false},{"name":"Imed Zaguia","is_ca":true},{"name":"Nejib Zaguia","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001427091,0.0007760566,0.0009522497,0.003131937,0.004059443,0.004874867,0.0008864259,0.001037872,0.005770499],"category_scores_gemma":[0.003462213,0.0008952778,0.0008480994,0.002427036,0.006088388,0.0092424,0.002156281,0.003377797,0.001234722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001374484,"about_ca_system_score_gemma":0.000971616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008727887,"about_ca_topic_score_gemma":0.001186469,"domain_scores_codex":[0.9988179,0.0002495215,0.00008666101,0.0002841844,0.0003218144,0.0002398272],"domain_scores_gemma":[0.9966702,0.001284051,0.0003627178,0.0006019127,0.0005972315,0.0004838523],"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.00002221341,0.00002047154,0.0001370048,0.00001549364,0.000004644342,0.00006217606,0.0002710253,0.00007297951,0.0004363116,0.9960821,0.0007080656,0.002167544],"study_design_scores_gemma":[0.00000651914,0.000008279035,0.000105588,0.000007853121,0.000008523304,0.0001309995,0.0001217017,0.0002773876,0.0005165673,0.9938176,0.004991622,0.000007225395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4951333,0.002075146,0.2314806,0.003544147,0.0009253068,0.0001570602,0.001044098,0.0008780423,0.2647622],"genre_scores_gemma":[0.910487,0.001252502,0.03806817,0.0008061533,0.0006077318,0.0001426416,0.0007460205,0.0002839569,0.04760583],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005770499,"threshold_uncertainty_score":0.01930428,"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","authors":[{"name":"Kira Adaricheva","is_ca":false},{"name":"Maurice Pouzet","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915991,0.001148684,0.001135815,0.003436175,0.002077136,0.003288985,0.0009174639,0.0007744082,0.01254227],"category_scores_gemma":[0.002354422,0.0006943561,0.000942272,0.003094671,0.003862011,0.007882387,0.004143313,0.003441551,0.001441137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001474943,"about_ca_system_score_gemma":0.0004682455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001457929,"about_ca_topic_score_gemma":0.001710811,"domain_scores_codex":[0.9991242,0.0002190883,0.00005091311,0.0001926905,0.0002923439,0.0001207944],"domain_scores_gemma":[0.9985847,0.0005227286,0.0001776359,0.0001845629,0.0002704068,0.0002599617],"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.00001170664,0.000005456739,0.0001001258,0.00001203101,0.000004083931,0.00003636631,0.0001365472,0.0004466367,0.0002127767,0.9963757,0.000489543,0.002169071],"study_design_scores_gemma":[0.000004251552,0.000009809181,0.0001281233,0.000007595346,0.000004786046,0.00008847641,0.0001101777,0.002215079,0.0002071873,0.9942191,0.003000239,0.000005183846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3360047,0.002495469,0.4461316,0.003007742,0.000424945,0.00007016821,0.0008777901,0.000334031,0.2106535],"genre_scores_gemma":[0.8783768,0.001756222,0.04432335,0.0005525118,0.000457689,0.00006127007,0.001025825,0.0003083232,0.07313808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01254227,"threshold_uncertainty_score":0.04195809,"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)","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895259,0.0009330417,0.001117916,0.003650469,0.002941752,0.004773,0.001537227,0.001691691,0.00548788],"category_scores_gemma":[0.007492525,0.001039989,0.001412065,0.002222918,0.004840519,0.01036513,0.003549794,0.004240397,0.0006474143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002091562,"about_ca_system_score_gemma":0.0008723805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001082464,"about_ca_topic_score_gemma":0.001350049,"domain_scores_codex":[0.9979483,0.0008378295,0.0001158177,0.0004078093,0.0003476677,0.0003425832],"domain_scores_gemma":[0.9926144,0.004428872,0.0007001258,0.0005750793,0.0006634194,0.001018041],"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.00003213612,0.00001978088,0.0002000502,0.00002101094,0.000004299667,0.0000861208,0.0002203834,0.0005326725,0.0002821523,0.9964042,0.0003174163,0.001879792],"study_design_scores_gemma":[0.000008831992,0.000009473194,0.00007674023,0.00001456602,0.000005631512,0.00007345447,0.0001168576,0.002580459,0.0002667538,0.995804,0.001035868,0.000007283008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4979631,0.001148866,0.4085425,0.001762811,0.0003903935,0.00009680379,0.0004350223,0.0003330041,0.08932752],"genre_scores_gemma":[0.917056,0.0006007171,0.06232727,0.0005398052,0.0003016489,0.0001449782,0.0007281426,0.000234973,0.01806658],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00548788,"threshold_uncertainty_score":0.01835883,"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)","authors":[{"name":"Bill Sands","is_ca":true},{"name":"Jia Shen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402975,0.000440326,0.0006612001,0.0008807552,0.002238114,0.002925355,0.0009727223,0.002619501,0.008733384],"category_scores_gemma":[0.005941846,0.000574666,0.0007769402,0.0004953945,0.004068014,0.01315306,0.001255045,0.00183571,0.001886034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244624,"about_ca_system_score_gemma":0.0006956861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155571,"about_ca_topic_score_gemma":0.002069088,"domain_scores_codex":[0.9992774,0.00008060045,0.00003612025,0.0002115292,0.0001368917,0.0002574516],"domain_scores_gemma":[0.9975351,0.001173286,0.0001671194,0.0003337106,0.0004378005,0.0003529153],"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.0002121827,0.00003894949,0.001425289,0.00007046408,0.00001421759,0.0003652675,0.0008357181,0.002119272,0.003704698,0.9724823,0.003226142,0.0155054],"study_design_scores_gemma":[0.00001395505,0.00003358951,0.0005374493,0.00005847727,0.00001477525,0.0004596149,0.001439668,0.005507238,0.007290323,0.9621324,0.0224751,0.00003743016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3789422,0.0007902222,0.4603718,0.006223848,0.000727893,0.0001359673,0.0007010167,0.0006276782,0.1514794],"genre_scores_gemma":[0.90675,0.0004436427,0.0615081,0.0006518299,0.0003042277,0.00008094974,0.0005793795,0.0003301454,0.0293518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008733384,"threshold_uncertainty_score":0.02921611,"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","authors":[{"name":"Rozália Madarász","is_ca":false},{"name":"Boža Tasić","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119032,0.0007683596,0.0007803582,0.001832965,0.001914331,0.003684086,0.0006534579,0.0008842448,0.006308144],"category_scores_gemma":[0.00210117,0.0003376481,0.0007109339,0.001050169,0.002909127,0.003757319,0.001309186,0.001218514,0.001106572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291461,"about_ca_system_score_gemma":0.00109515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009185856,"about_ca_topic_score_gemma":0.0008558562,"domain_scores_codex":[0.9988763,0.0002759411,0.00005127749,0.000166395,0.0004074546,0.0002226021],"domain_scores_gemma":[0.9966343,0.001718051,0.0004595337,0.0002046086,0.0004347642,0.0005487859],"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.000122372,0.00002542034,0.000249315,0.00003779158,0.000007458591,0.0003092227,0.0004609831,0.0008269036,0.002967116,0.9892463,0.0009754639,0.004771594],"study_design_scores_gemma":[0.00004702818,0.00008406785,0.0005329641,0.00002135345,0.00001005161,0.0005120871,0.000197523,0.008603611,0.001667566,0.9812309,0.007063881,0.00002883003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5547599,0.001712415,0.3043726,0.002397257,0.001011058,0.0001357719,0.001230934,0.0005756413,0.1338045],"genre_scores_gemma":[0.9225441,0.001173144,0.03180481,0.0003382721,0.0009235506,0.0001651933,0.000796371,0.0001570008,0.04209739],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006308144,"threshold_uncertainty_score":0.02110285,"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","authors":[{"name":"John Harding","is_ca":false},{"name":"Michael Roddy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760668,0.001598862,0.002394655,0.001587792,0.005060034,0.004914946,0.001732065,0.00870991,0.1102918],"category_scores_gemma":[0.01490478,0.0007678633,0.0008388662,0.001129342,0.001894016,0.004543542,0.003021449,0.009735653,0.105571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004387108,"about_ca_system_score_gemma":0.002395875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01072214,"about_ca_topic_score_gemma":0.01314821,"domain_scores_codex":[0.9982278,0.000270857,0.0001463765,0.0004035622,0.0007351857,0.0002162962],"domain_scores_gemma":[0.9960824,0.001130215,0.0003726962,0.0003554414,0.001679175,0.0003801492],"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.00001601697,0.000002520024,0.00001026781,0.00002255603,0.000001814939,0.00002608376,0.000009009444,0.00001224596,0.00001713708,0.0007974054,0.996851,0.002234014],"study_design_scores_gemma":[0.00001102482,0.000006354479,0.00009607204,0.0000907103,0.000004196778,0.00003171799,0.00002470508,0.00002951427,0.00008668673,0.001439057,0.9981724,0.000007614633],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0002786565,0.01899437,0.0004695992,0.4056568,0.5004561,0.00006580867,0.0008370329,0.0004565597,0.07278498],"genre_scores_gemma":[0.004310717,0.008066359,0.0002179259,0.1511288,0.09810375,0.0000778442,0.0004170712,0.0005297827,0.7371478],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1102918,"threshold_uncertainty_score":0.3689629,"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","authors":[{"name":"B. Banaschewski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000749013,0.000421955,0.0006099537,0.001426007,0.001454573,0.004196174,0.0004539458,0.00064527,0.01495985],"category_scores_gemma":[0.00154663,0.000237964,0.0003780653,0.001212068,0.003061223,0.006059194,0.00205647,0.001831862,0.001952711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00117595,"about_ca_system_score_gemma":0.0007771127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005867494,"about_ca_topic_score_gemma":0.0006437295,"domain_scores_codex":[0.9994326,0.0001030032,0.00003046864,0.0001081581,0.0002390876,0.00008657124],"domain_scores_gemma":[0.9994981,0.0001184506,0.00006129078,0.00009866482,0.0001253032,0.00009812891],"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.0000066776,0.000003645599,0.00005359217,0.000009872609,0.00000148233,0.00001064392,0.00009242543,0.00004003099,0.0001755232,0.9957841,0.0007775149,0.003044474],"study_design_scores_gemma":[0.000006014993,0.00001004001,0.0002789464,0.00001171101,0.000008402028,0.0001233165,0.0001390325,0.000383608,0.0006522545,0.9657614,0.03261976,0.000005532722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1567895,0.008647078,0.08221152,0.003976361,0.0006145217,0.00005253668,0.0004809073,0.0004827582,0.7467448],"genre_scores_gemma":[0.8366525,0.003912353,0.01422297,0.0004567485,0.0007609213,0.00003316121,0.0003770352,0.00008785979,0.1434966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01495985,"threshold_uncertainty_score":0.05004567,"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","authors":[{"name":"Dwight Duffus","is_ca":false},{"name":"Nejib Zaguia","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003860474,0.001024024,0.002383518,0.00259976,0.001672472,0.0093293,0.002515351,0.001585598,0.117289],"category_scores_gemma":[0.007605524,0.000700058,0.001522056,0.003789922,0.002825082,0.007801728,0.003574119,0.003405469,0.02510135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003289531,"about_ca_system_score_gemma":0.002924769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008517522,"about_ca_topic_score_gemma":0.01011222,"domain_scores_codex":[0.997824,0.0008825113,0.0001154176,0.0004712134,0.0005556504,0.0001513745],"domain_scores_gemma":[0.9954571,0.001728572,0.0001169689,0.001302205,0.0009364267,0.0004587419],"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.0002177397,0.0001194873,0.0006057402,0.0004344133,0.0000727749,0.0001099093,0.0003412401,0.002067531,0.0007425942,0.1450509,0.5539587,0.296279],"study_design_scores_gemma":[0.00002571522,0.00004422684,0.0005711358,0.0002267821,0.00003255934,0.000175731,0.0002775774,0.004950246,0.0004611237,0.04451034,0.9486959,0.00002872902],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.01836947,0.1103909,0.3738184,0.06238127,0.07884377,0.0004761054,0.004810242,0.01057655,0.3403334],"genre_scores_gemma":[0.08465396,0.05862006,0.2376297,0.004642041,0.02206558,0.0005127385,0.01496238,0.004899203,0.5720143],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.117289,"threshold_uncertainty_score":0.3923708,"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","authors":[{"name":"Mohamed Omar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199672,0.0008428082,0.001681532,0.005171179,0.003485312,0.007176742,0.001254394,0.001757761,0.01315467],"category_scores_gemma":[0.01057593,0.0009136595,0.0007230999,0.004020116,0.006194475,0.01082829,0.002642,0.00372809,0.001117243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00195937,"about_ca_system_score_gemma":0.001395304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002078921,"about_ca_topic_score_gemma":0.002216662,"domain_scores_codex":[0.9981601,0.0006405582,0.00006539753,0.000314293,0.0005316327,0.0002879473],"domain_scores_gemma":[0.987012,0.007947561,0.001402191,0.001246814,0.001194217,0.001197217],"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.00002243598,0.00001491981,0.00009633409,0.00001639865,0.000003321927,0.00001283578,0.0001086974,0.001133555,0.0001004481,0.9953674,0.001123293,0.002000337],"study_design_scores_gemma":[0.000007571065,0.000006440001,0.00007595376,0.000007914012,0.000003804768,0.00002812507,0.00005928952,0.005793794,0.0001105488,0.9927102,0.001188263,0.000008073681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.442371,0.004209663,0.3571452,0.01169,0.0006507849,0.0001434934,0.001695182,0.0006382981,0.1814564],"genre_scores_gemma":[0.9366702,0.001566491,0.02584226,0.000914641,0.0009097989,0.0001260013,0.0006236936,0.0002221912,0.03312467],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01315467,"threshold_uncertainty_score":0.04400671,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002924659,0.0006744109,0.0008450723,0.002235539,0.00196173,0.004091098,0.001231152,0.001004388,0.005516759],"category_scores_gemma":[0.004921833,0.0007946471,0.001292392,0.002370751,0.004183084,0.01015651,0.003030149,0.002814325,0.0005576212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001611022,"about_ca_system_score_gemma":0.001273632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001793152,"about_ca_topic_score_gemma":0.002173738,"domain_scores_codex":[0.997646,0.000627443,0.0002508069,0.0003897056,0.000744783,0.0003413119],"domain_scores_gemma":[0.9950118,0.002675765,0.0005848404,0.0003757033,0.0008459809,0.0005058973],"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.00003744079,0.00003116078,0.0001694597,0.00002457254,0.000008922165,0.00006591826,0.0002486472,0.0003962133,0.001023159,0.9944928,0.0002946916,0.003207038],"study_design_scores_gemma":[0.00001248727,0.00001333356,0.0001397999,0.000007146291,0.000009770067,0.00006654901,0.00007759663,0.003958757,0.0005978791,0.9938213,0.001284209,0.00001112693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3632001,0.001875006,0.5902722,0.001859451,0.0003410707,0.00007734076,0.000539584,0.0003062065,0.04152906],"genre_scores_gemma":[0.9104701,0.0008475715,0.06991782,0.0004985432,0.0003086731,0.0001165991,0.0004345519,0.0001312038,0.01727484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005516759,"threshold_uncertainty_score":0.01845545,"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","authors":[{"name":"R. Padmanabhan","is_ca":true},{"name":"Patrick Penner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654252,0.0006941097,0.0007817284,0.002529975,0.001743355,0.00468868,0.001017628,0.0007561558,0.01139584],"category_scores_gemma":[0.002702082,0.0006972824,0.001219478,0.001666185,0.002810301,0.009449536,0.002651053,0.002301774,0.003647288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000982606,"about_ca_system_score_gemma":0.0008931243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004360622,"about_ca_topic_score_gemma":0.0006283835,"domain_scores_codex":[0.9981927,0.0004448602,0.0001730726,0.0002796037,0.0006716773,0.0002381079],"domain_scores_gemma":[0.9970685,0.001206022,0.0002685776,0.0004364474,0.000557608,0.0004629368],"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.0001192043,0.00005283079,0.0001498659,0.00005353471,0.00001070575,0.0001164528,0.0004349936,0.0003285434,0.003646042,0.981636,0.001583518,0.01186824],"study_design_scores_gemma":[0.00005307251,0.0000470737,0.0001285332,0.00002354039,0.00001705456,0.0003152349,0.0002231002,0.00417331,0.006907041,0.9715308,0.01655129,0.00002997928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773026,0.001558706,0.7021165,0.001750792,0.001023875,0.000181761,0.001103919,0.002128716,0.1128332],"genre_scores_gemma":[0.7629952,0.001189982,0.1692326,0.0007484226,0.0009735189,0.0003021788,0.001564355,0.0008944803,0.06209919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01139584,"threshold_uncertainty_score":0.03812289,"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)","authors":[{"name":"Jérémie Dusart","is_ca":false},{"name":"Michel Habib","is_ca":false},{"name":"Derek G. Corneil","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000782583,0.0007121792,0.0009117919,0.002647938,0.003835486,0.005163808,0.001895237,0.00134665,0.01604105],"category_scores_gemma":[0.006391305,0.0008759458,0.001445267,0.00371287,0.003315317,0.005928469,0.002235779,0.004223861,0.001405131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002324303,"about_ca_system_score_gemma":0.001759851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004399825,"about_ca_topic_score_gemma":0.008280827,"domain_scores_codex":[0.9988369,0.0002712793,0.00005103486,0.0003592384,0.0002712847,0.0002102797],"domain_scores_gemma":[0.9912503,0.005426575,0.0007168434,0.0008195349,0.0008653851,0.0009214912],"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.00006985829,0.00008886751,0.000624713,0.00006810447,0.00001125507,0.00007025756,0.0004036336,0.002397321,0.0009199533,0.981954,0.004008783,0.009383259],"study_design_scores_gemma":[0.00002266448,0.00001526073,0.0002695958,0.00001785934,0.00001553153,0.00008069645,0.0002900426,0.01915411,0.001076481,0.9744413,0.00460078,0.00001559809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2892579,0.001075947,0.5897119,0.005341308,0.0003405445,0.0002836294,0.00198825,0.001481148,0.1105194],"genre_scores_gemma":[0.7936958,0.0006142231,0.168294,0.0005828725,0.0005716642,0.0002865455,0.002537389,0.0005063729,0.03291113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01604105,"threshold_uncertainty_score":0.0536626,"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","authors":[{"name":"Qinghe Sun","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523205,0.0007707073,0.001016598,0.00247741,0.002184894,0.002964444,0.001670721,0.00122425,0.01657722],"category_scores_gemma":[0.001880091,0.00078322,0.000911253,0.002728999,0.002802841,0.006929202,0.003033998,0.002826632,0.003344517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001066485,"about_ca_system_score_gemma":0.0006164261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001337658,"about_ca_topic_score_gemma":0.001477441,"domain_scores_codex":[0.9988335,0.0002105077,0.0001018999,0.0003111275,0.0003152068,0.0002278121],"domain_scores_gemma":[0.9979377,0.0008648142,0.0002241457,0.0004357814,0.0002972596,0.0002402254],"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.00008734447,0.00006980891,0.0001928337,0.00005271071,0.000009919078,0.0001169676,0.0004262377,0.001450106,0.002859337,0.9816585,0.00151328,0.01156284],"study_design_scores_gemma":[0.00002192539,0.0000214094,0.0002251573,0.00001547651,0.00001248356,0.0001099055,0.0001882884,0.003489283,0.002805025,0.9806789,0.01241558,0.00001651424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3738153,0.0006077277,0.470925,0.001936439,0.0003340734,0.0001764543,0.001581981,0.0009925184,0.1496305],"genre_scores_gemma":[0.7377655,0.0005632358,0.1684781,0.0006151725,0.000273008,0.0002509588,0.002415874,0.0006587619,0.08897945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01657722,"threshold_uncertainty_score":0.05545628,"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)","authors":[{"name":"Margaret M. Bayer","is_ca":false},{"name":"Herman Chau","is_ca":false},{"name":"Mark Denker","is_ca":false},{"name":"Owen Goff","is_ca":false},{"name":"Jamie Kimble","is_ca":false},{"name":"Yi-Lin Lee","is_ca":false},{"name":"Jinting Liang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062518,0.0004168778,0.0005129309,0.001908935,0.00140518,0.002282213,0.0007520513,0.0009413231,0.008469339],"category_scores_gemma":[0.003939926,0.0004018626,0.0005501288,0.001557368,0.002494095,0.004366532,0.001237185,0.002131888,0.0009251526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001169763,"about_ca_system_score_gemma":0.0006239265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008257905,"about_ca_topic_score_gemma":0.001358964,"domain_scores_codex":[0.9996305,0.000102363,0.0000175925,0.00007483644,0.00009744514,0.00007724013],"domain_scores_gemma":[0.9973259,0.00138092,0.0003679743,0.0003440264,0.0002301557,0.0003509934],"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.00002184157,0.00001934983,0.0002864466,0.0000146595,0.000001549039,0.00003023023,0.0001115074,0.0009727213,0.0002525256,0.9909305,0.001036007,0.006322566],"study_design_scores_gemma":[0.000006541325,0.0000068315,0.0001322379,0.000008434561,0.000003156172,0.00005808464,0.0000345293,0.004304327,0.00023857,0.9935289,0.001672425,0.000005930241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6255073,0.001392061,0.2017663,0.00277112,0.0003381901,0.00005162996,0.0003992797,0.0008501288,0.166924],"genre_scores_gemma":[0.9426407,0.0006975165,0.01924367,0.0003154878,0.0002523339,0.00005436347,0.0002733686,0.0002122183,0.03631028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008469339,"threshold_uncertainty_score":0.02833277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}