{"meta":{"query_hash":"5f1b5b4f0626","filters":{"venue":"Order"},"cohort_total":40,"direct_labels_cover":0,"predictions_cover":40,"exported":40,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/5f1b5b4f0626","api":"https://metacan.xera.ac/api/v1/cohort?venue=Order"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11435355827771759,"score_gpt":0.4332355820413764,"score_spread":0.3188820237636588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1818676058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41068947,0.000058848615,0.5745164,0.005440396,0.00021117803,0.0009855347,0.00006276979,0.00020521096,0.007830162],"genre_scores_gemma":[0.84480894,0.000015887854,0.110838406,0.000299324,0.00023465547,0.00029300645,0.0000027459437,0.000078295474,0.043428723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993022,0.000029225228,0.00012790972,0.00016110417,0.000143521,0.00023601667],"domain_scores_gemma":[0.99887985,0.00054999243,0.000025072988,0.00029467343,0.00019003346,0.00006036757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025997308,0.00007466367,0.00012376522,0.000021985026,0.00005559438,0.0000120395525,0.000118432545,0.000050896833,0.00079997315],"category_scores_gemma":[0.0012475578,0.00004534788,0.000034439494,0.00007780945,0.00005512391,0.00009705544,0.0000466014,0.00004385619,0.00021416813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011570143,0.00019422485,0.002116446,0.0001625443,0.000069631446,0.0000063231273,0.00029855364,5.3642935e-7,0.024354773,0.8817459,0.047312807,0.043622583],"study_design_scores_gemma":[0.0019067222,0.00010400758,0.00035691386,0.000031388754,0.000011552766,0.000004097882,0.00007327384,0.00008396095,0.036867894,0.85425377,0.10605384,0.00025261584],"about_ca_topic_score_codex":0.0000011702158,"about_ca_topic_score_gemma":0.0000056934127,"teacher_disagreement_score":0.463678,"about_ca_system_score_codex":0.000037015096,"about_ca_system_score_gemma":0.00004463245,"threshold_uncertainty_score":0.8759145},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Distributive property; Planar; Combinatorics; Mathematics; Distributive lattice; Computer science; Pure mathematics","score_opus":0.027266026324679008,"score_gpt":0.2746508667821295,"score_spread":0.24738484045745052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963598054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43160287,0.0030307819,0.5310137,0.0043125455,0.0021908826,0.000588735,0.00004574224,0.0006488899,0.02656581],"genre_scores_gemma":[0.96762633,0.0000498157,0.030984689,0.00059343525,0.00024968275,0.000014899402,0.00000999614,0.000019751928,0.00045138857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846596,0.000082266466,0.0002524407,0.00035995682,0.00035269756,0.00048666255],"domain_scores_gemma":[0.99856687,0.00030902703,0.00015050992,0.0007249483,0.00009504997,0.00015359938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757596,0.00020765798,0.0002495956,0.00014866877,0.00018871512,0.000044448698,0.0006080627,0.000121436846,0.000089830035],"category_scores_gemma":[0.00014995445,0.00017059754,0.000074105374,0.00056245073,0.00007695486,0.00071519666,0.00008563826,0.00023397371,0.00023615536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008854272,0.0016088132,0.0547708,0.00026323,0.00035202937,0.000069817186,0.005671402,0.005295278,0.019122804,0.86740494,0.006987042,0.038365282],"study_design_scores_gemma":[0.0046147155,0.0022472204,0.16149752,0.0007156759,0.0003062643,0.00024644495,0.0009260192,0.0325875,0.11689485,0.13307579,0.5425383,0.004349744],"about_ca_topic_score_codex":0.00005324796,"about_ca_topic_score_gemma":0.000026389665,"teacher_disagreement_score":0.73432916,"about_ca_system_score_codex":0.000029880253,"about_ca_system_score_gemma":0.000034446293,"threshold_uncertainty_score":0.6956766},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029195700140188536,"score_gpt":0.23872308345377524,"score_spread":0.2095273833135867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965001312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079693645,0.00018929529,0.8711616,0.00058787444,0.00014141579,0.000075517215,4.950912e-7,0.00014851439,0.048001673],"genre_scores_gemma":[0.9407535,0.000019336794,0.057702806,0.0004532785,0.000020419002,0.00000821565,4.1726366e-7,0.0000038387725,0.00103814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963,0.000009712917,0.000055160443,0.00016804508,0.000034820703,0.00010228752],"domain_scores_gemma":[0.9996617,0.000022868117,0.000018030398,0.00023438931,0.000025983241,0.000037036265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003679817,0.00004931607,0.00004669483,0.000022879989,0.000065626096,0.000022662862,0.0001785351,0.000017520244,0.000068663576],"category_scores_gemma":[0.000017169952,0.00003617489,0.000011262546,0.0001411248,0.000030958574,0.00025448392,0.00011033563,0.00004326399,0.00004611561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054395173,0.000105122286,0.013022152,0.000010676902,0.000022355853,0.000018487379,0.01685938,0.000017981976,0.002123571,0.7820012,0.0022032077,0.18361045],"study_design_scores_gemma":[0.00075340766,0.00016292003,0.15753357,0.00002152557,0.000007361484,0.000104819934,0.000730181,0.010069656,0.014374638,0.7732766,0.04234521,0.00062008237],"about_ca_topic_score_codex":0.000013327023,"about_ca_topic_score_gemma":0.00000397798,"teacher_disagreement_score":0.8610599,"about_ca_system_score_codex":0.000002749531,"about_ca_system_score_gemma":0.0000082741135,"threshold_uncertainty_score":0.14751692},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007018406646354243,"score_gpt":0.2113288240303752,"score_spread":0.20431041738402095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969798688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35136566,0.00018683849,0.644554,0.00081660016,0.00060706015,0.00007510189,0.000002487735,0.00006455653,0.002327641],"genre_scores_gemma":[0.9183439,7.60372e-7,0.08083485,0.00020463238,0.0001208707,0.0000037659886,0.00001717634,0.0000038518915,0.00047020637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936247,0.000013155021,0.00014042927,0.00016064913,0.0002233322,0.000099979676],"domain_scores_gemma":[0.999582,0.00004005849,0.00005128865,0.0001482621,0.00015658981,0.000021785154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010529216,0.00006036638,0.00007278741,0.00009411344,0.000059931823,0.000025956831,0.00016963715,0.000026610796,0.000046740715],"category_scores_gemma":[0.0000107877695,0.00005588121,0.000038567618,0.00051251997,0.000022836964,0.0001804797,0.000063194086,0.00003883699,0.000037472746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014783791,0.00030688004,0.007245297,0.00002444891,0.000031431657,0.000011122142,0.00010831054,0.10722631,0.013904282,0.7863723,0.041882683,0.04287214],"study_design_scores_gemma":[0.0013547535,0.00021200062,0.19103515,0.000039815244,0.000019029678,0.00005401565,0.0000040062428,0.3237518,0.031740624,0.39675152,0.054430533,0.00060674956],"about_ca_topic_score_codex":0.000063155254,"about_ca_topic_score_gemma":0.000024606632,"teacher_disagreement_score":0.5669782,"about_ca_system_score_codex":0.000006534787,"about_ca_system_score_gemma":0.00005296208,"threshold_uncertainty_score":0.22787696},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0173793824275137,"score_gpt":0.22306140824120535,"score_spread":0.20568202581369166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974524636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7251464,0.0002683602,0.2693354,0.0004126984,0.000061879575,0.00008557668,5.0205193e-7,0.00013593303,0.0045532244],"genre_scores_gemma":[0.9731625,0.00003838241,0.025553737,0.00031469317,0.000038575865,0.0000059612903,0.0000011274299,0.000008821231,0.0008762227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999254,0.000023670515,0.000075091135,0.0002776799,0.00013684847,0.0002327258],"domain_scores_gemma":[0.99951684,0.000033633958,0.00003059983,0.0002893596,0.000045965913,0.00008361477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004624562,0.00011553901,0.0001081774,0.000047664995,0.00020213758,0.00003877049,0.00024109126,0.0000330932,0.000044808505],"category_scores_gemma":[0.0000100174175,0.00008366605,0.00001363243,0.00033867374,0.00009443766,0.00035999503,0.00009473447,0.00011116081,0.000061019047],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059306876,0.00030696965,0.20738912,0.000055982444,0.000108323395,0.000718068,0.0053356234,0.000986754,0.0012134113,0.6630412,0.0015487159,0.119236566],"study_design_scores_gemma":[0.00767207,0.0034583418,0.8092408,0.00015987115,0.000063467036,0.0032314754,0.0007933296,0.032719124,0.0036431372,0.04574913,0.08991307,0.0033561806],"about_ca_topic_score_codex":0.000010108267,"about_ca_topic_score_gemma":0.000017441349,"teacher_disagreement_score":0.61729205,"about_ca_system_score_codex":0.000007851086,"about_ca_system_score_gemma":0.00004160645,"threshold_uncertainty_score":0.34118024},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Join (topology); Irreducibility; Discrete mathematics; Order (exchange); Omega; Pure mathematics","score_opus":0.01812048192973254,"score_gpt":0.2922381663705092,"score_spread":0.27411768444077667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981167177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070116885,0.00005264302,0.84436375,0.0031896036,0.0017690397,0.00018060935,0.0000034374125,0.00035066225,0.07997338],"genre_scores_gemma":[0.8403274,0.000005537663,0.11747442,0.00049971463,0.00022462479,0.000041739866,0.000003962229,0.000024168148,0.041398447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991497,0.00002295413,0.00008199871,0.00028256045,0.00018846591,0.00027436603],"domain_scores_gemma":[0.99892133,0.000047664136,0.000020352136,0.0007911901,0.00011395857,0.00010550105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021948636,0.00007325292,0.00006421045,0.000110128,0.00017333929,0.000091110785,0.0005973072,0.000041561987,0.00054031645],"category_scores_gemma":[0.0000968605,0.000066041976,0.00003343737,0.0006272435,0.000082298255,0.00039825027,0.00019409388,0.00032449182,0.0015468982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008672015,0.00015981944,0.0013528856,0.0000074464288,0.000021142543,0.000016006079,0.00037282912,0.00011135255,0.058514442,0.766354,0.022436816,0.15064457],"study_design_scores_gemma":[0.0004588247,0.00009306382,0.0038397165,0.0000058228698,0.0000036586332,0.000057821417,0.00005762572,0.0065485556,0.008274845,0.15128002,0.8290226,0.0003574447],"about_ca_topic_score_codex":0.00000614409,"about_ca_topic_score_gemma":0.000026001444,"teacher_disagreement_score":0.8065858,"about_ca_system_score_codex":0.0000070954106,"about_ca_system_score_gemma":0.000067957175,"threshold_uncertainty_score":0.9992305},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016288944898138293,"score_gpt":0.2882060357094795,"score_spread":0.2719170908113412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005947941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804458,0.000063960244,0.013923773,0.0010785698,0.00015644381,0.00007635775,6.0436525e-7,0.00007311443,0.004181372],"genre_scores_gemma":[0.9723953,0.0000053199537,0.026585916,0.00014557446,0.000032941098,0.000008901993,3.6446372e-7,0.0000064015207,0.00081930705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992771,0.000048412363,0.00009093288,0.00020623025,0.00014122861,0.00023607534],"domain_scores_gemma":[0.99947375,0.00016412162,0.00001744336,0.00025336718,0.000039082315,0.000052256844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043784577,0.0000624174,0.000071382376,0.000098831726,0.000064912325,0.00007570595,0.00021657012,0.00003651355,0.000045347246],"category_scores_gemma":[0.00018015952,0.000057033532,0.000010201859,0.00031597514,0.00010192681,0.00033946332,0.00024038593,0.0002426029,0.00002588604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004878421,0.00002735491,0.021043636,0.000012757667,0.000004199519,0.000036225665,0.002133961,0.0000111006275,0.004640423,0.9240915,0.00013419273,0.04785974],"study_design_scores_gemma":[0.0014117501,0.00013018485,0.06475641,0.000039090177,0.0000021777466,0.00014288822,0.001299398,0.014779794,0.0072137173,0.88739353,0.022139769,0.00069127127],"about_ca_topic_score_codex":0.000020888121,"about_ca_topic_score_gemma":0.0001298491,"teacher_disagreement_score":0.047168467,"about_ca_system_score_codex":0.000004718603,"about_ca_system_score_gemma":0.0000288891,"threshold_uncertainty_score":0.232576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01041645394985028,"score_gpt":0.24297338184617168,"score_spread":0.2325569278963214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013323319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044400666,0.00017250143,0.9471916,0.003168376,0.0001984275,0.00008604621,0.0000025506688,0.00019376595,0.004586099],"genre_scores_gemma":[0.719156,0.000032504155,0.2711488,0.005784071,0.000096525735,0.000023428984,0.000018315986,0.000014489584,0.003725832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933046,0.000017966087,0.00010571301,0.00024407153,0.00010942987,0.00019237545],"domain_scores_gemma":[0.9995299,0.000016023709,0.000016363067,0.0003085906,0.000064808926,0.000064296444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004993793,0.000090663336,0.00007374363,0.0000245116,0.0001636411,0.00010700817,0.0003470898,0.00004174341,0.00005782199],"category_scores_gemma":[0.00002734589,0.00007619305,0.000017555094,0.00039048013,0.000024245224,0.000456969,0.00007652484,0.00009029934,0.00035712545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004693341,0.00041463756,0.00024424397,0.000013433946,0.00004810935,0.000065898064,0.0016379695,0.1068373,0.06005865,0.7988449,0.008217227,0.023612982],"study_design_scores_gemma":[0.0076276553,0.0006911758,0.0034396406,0.000101220256,0.00008136687,0.00035524892,0.00019236734,0.2510503,0.13078792,0.20114838,0.40104464,0.0034801112],"about_ca_topic_score_codex":0.000016439117,"about_ca_topic_score_gemma":0.000014645173,"teacher_disagreement_score":0.67604274,"about_ca_system_score_codex":0.000025942838,"about_ca_system_score_gemma":0.000045589637,"threshold_uncertainty_score":0.45902443},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Antichain; Combinatorics; Prime (order theory); Discrete mathematics; Partially ordered set","score_opus":0.015306450410302702,"score_gpt":0.28578481517410337,"score_spread":0.27047836476380066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022730759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9680929,0.00007766158,0.00004907909,0.00028041558,0.00008876368,0.00007972082,0.0000025026773,0.00005134424,0.031277604],"genre_scores_gemma":[0.994512,0.000009370099,0.003947598,0.00070603454,0.000021681823,0.0000010492251,9.085809e-7,0.000008318208,0.0007930151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.00001970931,0.0000881096,0.00012636743,0.00009573141,0.00012674645],"domain_scores_gemma":[0.9996272,0.00010530966,0.0000284124,0.00017847028,0.00002122786,0.00003943665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008260911,0.000087601744,0.00010093307,0.00004567713,0.000093266906,0.00001497645,0.000067022665,0.000056356923,0.0001387958],"category_scores_gemma":[0.000100118195,0.00006372671,0.000028058821,0.000070922644,0.000039757742,0.000028677798,0.00001848988,0.0000805501,0.0000067425253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028148592,0.00003728385,0.00013838754,0.000005386165,0.000010325893,0.000004576245,0.00038876152,1.06022995e-7,0.00021569653,0.98690933,0.0032747888,0.008987212],"study_design_scores_gemma":[0.0002412916,0.00013885117,0.007259924,0.000010441511,0.000010764477,0.000010193443,0.00001640366,0.000009075246,0.00043687123,0.99058706,0.0011862806,0.00009287018],"about_ca_topic_score_codex":5.6650805e-7,"about_ca_topic_score_gemma":6.069058e-7,"teacher_disagreement_score":0.03048459,"about_ca_system_score_codex":0.0000033450494,"about_ca_system_score_gemma":0.0000051451393,"threshold_uncertainty_score":0.25986996},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09220822558538179,"score_gpt":0.34877389227405703,"score_spread":0.25656566668867525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027053128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86371547,0.00007526844,0.0017650631,0.09989485,0.00061099546,0.0018299979,0.000032576405,0.0001970457,0.031878736],"genre_scores_gemma":[0.8972721,0.00005285916,0.01354008,0.010407581,0.0015583688,0.00063067285,0.00008982244,0.0004314643,0.07601702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969171,0.0005622197,0.00032342508,0.00043478218,0.0011086154,0.00065384386],"domain_scores_gemma":[0.9915883,0.0047094235,0.00015902103,0.0016713573,0.0017532973,0.00011858337],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026961074,0.00034928214,0.00024099978,0.00006704442,0.0015877903,0.00054063345,0.001129011,0.00018092882,0.007097584],"category_scores_gemma":[0.0037929416,0.00014036351,0.00005550944,0.0014079802,0.0009678063,0.00018677561,0.00018300736,0.0013342277,0.0009937178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006336263,0.00039727186,0.00066996086,0.00001897049,0.00022733677,0.000009537476,0.0016406253,0.00009112988,0.0011965554,0.92812747,0.064332746,0.0026547862],"study_design_scores_gemma":[0.001686525,0.0009618569,0.0031188724,0.00004849445,0.00012103674,0.00009522015,0.0025194525,0.0031614308,0.00053043076,0.23257436,0.75430524,0.0008770474],"about_ca_topic_score_codex":0.00003363468,"about_ca_topic_score_gemma":0.0032812837,"teacher_disagreement_score":0.69555306,"about_ca_system_score_codex":0.000025202713,"about_ca_system_score_gemma":0.00064235606,"threshold_uncertainty_score":0.9997841},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.02218641360514442,"score_gpt":0.2982895848577818,"score_spread":0.2761031712526374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027883459","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1342254,0.00006486614,0.000091395435,0.032918435,0.0022066345,0.00026377206,0.0000061677233,0.000074229654,0.8301491],"genre_scores_gemma":[0.99373496,0.00031902367,0.00017930368,0.000214893,0.00006547467,0.000017586808,0.0000026040425,0.000002593848,0.005463593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938256,0.00003013558,0.00012296624,0.000073668474,0.0002650991,0.00012555004],"domain_scores_gemma":[0.99938315,0.00011863818,0.00006964019,0.000091577116,0.00030374908,0.00003324115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047571308,0.000051096908,0.000045796034,0.000051552583,0.0011711223,0.00013917247,0.00014352292,0.000055220677,0.00024585152],"category_scores_gemma":[0.00030922287,0.000035802153,0.000017595932,0.00019937835,0.00041018316,0.00014907555,0.000028101662,0.00014528085,0.00010980926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002412109,0.0000055724,0.024019018,6.2720113e-7,0.000015132806,1.309058e-7,0.00527281,0.0000011096612,0.000004239937,0.96123046,0.0070341113,0.0024143544],"study_design_scores_gemma":[0.00015882045,0.000009722857,0.026504744,0.0000057672255,0.000003590999,0.0000010036146,0.016016023,0.00009288273,0.0000011751815,0.01669218,0.9404284,0.00008570206],"about_ca_topic_score_codex":0.0004969783,"about_ca_topic_score_gemma":0.007313708,"teacher_disagreement_score":0.9445383,"about_ca_system_score_codex":0.0000075840876,"about_ca_system_score_gemma":0.00004733687,"threshold_uncertainty_score":0.9007444},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01689841924082072,"score_gpt":0.20021986904912967,"score_spread":0.18332144980830894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033288181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5295881,0.0026797089,0.009139681,0.0053447713,0.00077223673,0.00019315621,0.000055271954,0.0001285906,0.45209846],"genre_scores_gemma":[0.9922327,0.00016696905,0.0009861705,0.002144682,0.000086617,0.000004403556,0.000007857309,0.000015676735,0.00435496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.000004169166,0.0003188176,0.00029404173,0.000012141157,0.0002718409],"domain_scores_gemma":[0.9994586,0.000012480201,0.000117174764,0.00031489768,0.000016926631,0.000079915444],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020603271,0.00011852772,0.00023176779,0.00014354184,0.00007045946,0.000052677227,0.00017084467,0.0000773666,0.0016555588],"category_scores_gemma":[0.000029568855,0.0001379311,0.00010025832,0.00017924384,0.000039068374,0.00018472593,0.000019616342,0.00009388166,0.0014439774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011721938,0.00004716414,0.004184639,0.000002268168,0.000018238728,0.0000018892005,0.00017265888,0.000067898676,0.000008829357,0.99025536,0.0024599463,0.0027694078],"study_design_scores_gemma":[0.00063424645,0.000102532045,0.013650464,0.000005706685,0.000003793545,0.0000062342788,0.000056762678,0.0005961759,0.00003342421,0.7135451,0.27102843,0.0003371559],"about_ca_topic_score_codex":0.000047659498,"about_ca_topic_score_gemma":0.000010701315,"teacher_disagreement_score":0.46264455,"about_ca_system_score_codex":0.000028238512,"about_ca_system_score_gemma":0.00000993406,"threshold_uncertainty_score":0.9993335},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03131159960911015,"score_gpt":0.30981490368774756,"score_spread":0.27850330407863744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038115433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62447906,0.00043693607,0.3188158,0.000690869,0.00085431244,0.00047172437,0.000018663004,0.0007372064,0.05349542],"genre_scores_gemma":[0.98564124,0.000011267391,0.013737643,0.00018802893,0.000018518962,0.000012755243,0.0000022799386,0.0000100029465,0.00037828003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998653,0.00021191868,0.00017933441,0.00020545303,0.000359758,0.00039053228],"domain_scores_gemma":[0.9982926,0.0006642904,0.000071542716,0.000685781,0.00015887692,0.00012687795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065341895,0.00010835627,0.00014706336,0.00019477941,0.00006824002,0.000019242854,0.0005205274,0.00005163024,0.00013337198],"category_scores_gemma":[0.0005097245,0.00009251027,0.00005746949,0.0012838541,0.00011630743,0.00037998654,0.00019236204,0.00016920322,0.00014441452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003327045,0.00028123747,0.017948596,0.000019499925,0.0000271788,0.000002414918,0.0008261079,0.00010282239,0.0007202402,0.9650074,0.0005997328,0.014431486],"study_design_scores_gemma":[0.0017344073,0.0005408568,0.15491538,0.00009055911,0.00001480946,0.000010739772,0.00011001568,0.0060018846,0.018159572,0.7921807,0.025302462,0.0009385993],"about_ca_topic_score_codex":0.0000099436775,"about_ca_topic_score_gemma":0.0000023583013,"teacher_disagreement_score":0.36116216,"about_ca_system_score_codex":0.000012606017,"about_ca_system_score_gemma":0.000027813045,"threshold_uncertainty_score":0.37724593},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.06924299315783805,"score_gpt":0.2901136555825268,"score_spread":0.22087066242468872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041674345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20276691,0.00026738795,0.6434125,0.00038576568,0.0005937319,0.000102259444,6.773657e-7,0.00016814376,0.15230267],"genre_scores_gemma":[0.9192606,0.000007840383,0.07994282,0.000098468154,0.000015641228,0.000002421465,6.313161e-8,0.0000031308011,0.0006689632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995449,0.0000149393945,0.0001180237,0.000120402416,0.0000967426,0.00010499701],"domain_scores_gemma":[0.9995121,0.000033149787,0.000049896043,0.00029695476,0.00008341025,0.000024523633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008712395,0.000044937726,0.00006555993,0.000036222078,0.000018410938,0.000013091453,0.0004966007,0.000023875797,0.0003469932],"category_scores_gemma":[0.000045314693,0.000037817907,0.000021080383,0.00019626852,0.000061770195,0.0002291819,0.00010019369,0.0000340692,0.00027221497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007141858,0.00019173892,0.019964248,0.000019533747,0.000028444003,0.0000110004175,0.016144449,0.00002412393,0.0021623096,0.59526694,0.0017350074,0.36444506],"study_design_scores_gemma":[0.000111201276,0.00029394293,0.028319696,0.00005473363,0.000015480242,0.000012211805,0.0007540675,0.02218007,0.7263276,0.1840956,0.03731728,0.00051813433],"about_ca_topic_score_codex":0.000076413766,"about_ca_topic_score_gemma":0.000014522334,"teacher_disagreement_score":0.72416526,"about_ca_system_score_codex":0.0000028976224,"about_ca_system_score_gemma":0.000020989404,"threshold_uncertainty_score":0.37993324},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Laminar flow; Mathematics; Disjoint sets; Combinatorics; Discrete mathematics; Physics; Thermodynamics","score_opus":0.004958774077755051,"score_gpt":0.1872343444408253,"score_spread":0.18227557036307024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048775750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792916,0.0009132853,0.0016637276,0.000029966594,0.00018878857,0.000060933977,0.0000018250277,0.00015925558,0.017690618],"genre_scores_gemma":[0.9982329,0.00011269165,0.00053356413,0.000031958287,0.00007440332,0.000011920349,0.0000026060486,0.000016499764,0.000983433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965507,0.000026677559,0.0000781318,0.00007552945,0.000046655754,0.00011793412],"domain_scores_gemma":[0.99981666,0.000028474253,0.000009212832,0.00010531752,0.000010959991,0.000029387687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010507034,0.00007692533,0.00009751445,0.000043234235,0.000037738715,0.000024072266,0.000053266875,0.000042534524,0.000052012703],"category_scores_gemma":[0.000009111882,0.000066650755,0.00001704728,0.0000890823,0.000017439948,0.0000528819,0.00001044375,0.000037170852,0.000049247847],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101621335,0.00009746798,0.039761957,0.0023308527,0.00056418945,0.0000277391,0.011287926,0.013532423,0.082371764,0.58744633,0.050537273,0.21194044],"study_design_scores_gemma":[0.0017823211,0.000112044916,0.009346787,0.00008912235,0.000066903005,0.000041436204,0.0013771313,0.07985232,0.0048352736,0.021170141,0.8804153,0.00091117836],"about_ca_topic_score_codex":0.000020559668,"about_ca_topic_score_gemma":0.000016454465,"teacher_disagreement_score":0.8298781,"about_ca_system_score_codex":0.0000034437119,"about_ca_system_score_gemma":0.00000135736,"threshold_uncertainty_score":0.2717939},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008076845308624325,"score_gpt":0.23371086798086937,"score_spread":0.22563402267224505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049256457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7722297,0.0064484198,0.1754568,0.0036505403,0.001954273,0.0005671481,0.0000067302763,0.0005555956,0.03913083],"genre_scores_gemma":[0.98938555,0.00005611066,0.0082307,0.00086329086,0.00012303205,0.000036656256,0.0000021424553,0.000021446198,0.0012810648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981568,0.00014466327,0.0003216284,0.0003307249,0.00041422792,0.0006319431],"domain_scores_gemma":[0.9982178,0.00019739066,0.00014473357,0.0011956132,0.00008733278,0.00015709423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700066,0.0002322908,0.00026749837,0.00018877798,0.00021328604,0.000114769915,0.0013899978,0.0001100563,0.00014244951],"category_scores_gemma":[0.00007220374,0.00015606981,0.00014996946,0.0012158024,0.00022129863,0.0008010779,0.00036034596,0.00023525048,0.0001386252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021928641,0.00066123763,0.005768611,0.00005997877,0.00015199948,0.000006783841,0.028483003,0.00003212883,0.006676928,0.877507,0.0073038545,0.07332656],"study_design_scores_gemma":[0.004545553,0.0010992265,0.11912669,0.00054285437,0.00017353412,0.00028221527,0.005070451,0.054028604,0.03582866,0.19722477,0.5781327,0.003944732],"about_ca_topic_score_codex":0.00008955581,"about_ca_topic_score_gemma":0.0000082074675,"teacher_disagreement_score":0.68028224,"about_ca_system_score_codex":0.000023092256,"about_ca_system_score_gemma":0.000067868954,"threshold_uncertainty_score":0.63643426},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02122968024905074,"score_gpt":0.3047966964348104,"score_spread":0.28356701618575963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053725458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868322,0.000050787596,0.0005340892,0.00036479946,0.0006891351,0.00027659917,0.000016773514,0.00010911959,0.011126468],"genre_scores_gemma":[0.98025495,0.000010781953,0.018127171,0.00026378152,0.00011237788,0.000009210017,0.0000059610697,0.000054880304,0.0011608893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874836,0.00005392924,0.00032156354,0.00026195135,0.0002912284,0.00032297955],"domain_scores_gemma":[0.9985792,0.00022160678,0.00023979954,0.00065809366,0.00021008067,0.00009119395],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033392775,0.00021462559,0.00031968192,0.000099181794,0.0001121486,0.000020242154,0.00034490158,0.00021539503,0.0010068543],"category_scores_gemma":[0.0005381581,0.00017272831,0.00010964027,0.00022299303,0.00023261509,0.000093982235,0.00013416146,0.0003933834,0.000019059442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002472057,0.0009586371,0.02349571,0.00047411045,0.0008861153,0.000033698245,0.011229034,0.000010294354,0.03918368,0.86424446,0.04522235,0.0140147265],"study_design_scores_gemma":[0.0032335527,0.00025455217,0.014006495,0.00010379567,0.00034540764,0.000060143662,0.0014073895,0.00026341528,0.040899016,0.76826924,0.16974309,0.0014139207],"about_ca_topic_score_codex":0.000029478339,"about_ca_topic_score_gemma":0.00008032014,"teacher_disagreement_score":0.12452075,"about_ca_system_score_codex":0.0000089861405,"about_ca_system_score_gemma":0.000059579696,"threshold_uncertainty_score":0.99990636},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03630029057446595,"score_gpt":0.2807656256942987,"score_spread":0.24446533511983273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062832600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46724433,0.00030593958,0.07195425,0.007878439,0.0012164235,0.000796825,0.000059060014,0.0006434645,0.44990125],"genre_scores_gemma":[0.9187936,0.00001261967,0.021312898,0.0005297009,0.0005856879,0.000027928161,0.000021708722,0.00003864419,0.05867722],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955523,0.000018661172,0.000118097574,0.00010308958,0.00010604283,0.00009887021],"domain_scores_gemma":[0.99959886,0.000108254346,0.000029419922,0.000180707,0.000055207838,0.000027556627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085850945,0.000065190296,0.00007683761,0.00003886445,0.000073440264,0.000025015574,0.000044071177,0.00004713899,0.0008299325],"category_scores_gemma":[0.00013887175,0.000053649626,0.000026420237,0.00011106451,0.000009194318,0.00008425058,0.000009165427,0.000053786935,0.0005514387],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008368486,0.0016141257,0.0035036379,0.00035754233,0.0002635196,0.000014438944,0.004848746,0.10471394,0.0006984959,0.34283334,0.50257486,0.038493644],"study_design_scores_gemma":[0.0009329138,0.00012985762,0.0006522866,0.00008993543,0.000059639977,0.000006089708,0.00028712561,0.063922405,0.00032226936,0.007997777,0.92522115,0.00037854636],"about_ca_topic_score_codex":0.000006092898,"about_ca_topic_score_gemma":0.00003316225,"teacher_disagreement_score":0.45154926,"about_ca_system_score_codex":0.000016129175,"about_ca_system_score_gemma":0.000010153621,"threshold_uncertainty_score":0.90871793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Antichain; Partially ordered set; Mathematics; Combinatorics; Property (philosophy); Discrete mathematics","score_opus":0.008195563251251668,"score_gpt":0.21265495025804212,"score_spread":0.20445938700679045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065333210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036018293,0.000118298405,0.89922804,0.046372253,0.00007575531,0.00019064602,2.8191212e-7,0.00017806233,0.0178184],"genre_scores_gemma":[0.96599066,0.000002610625,0.026881464,0.0047813505,0.000032742875,0.0000027396516,3.1840085e-7,0.0000028879133,0.0023052273],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950737,0.000017959865,0.000042630094,0.00015594297,0.0001148672,0.00016125875],"domain_scores_gemma":[0.9996275,0.00001120293,0.000019488214,0.00027899735,0.000036531932,0.00002628977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060193233,0.00006499943,0.000052674048,0.00001225394,0.00010035312,0.000055002914,0.00038150675,0.000022892315,0.000015779444],"category_scores_gemma":[0.0000071832574,0.000024405612,0.000011382159,0.00023024289,0.00002808384,0.00017477374,0.000037192767,0.00010297688,0.00006234912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033098087,0.00019931441,0.0006753309,0.000005031813,0.000016501974,0.00013220246,0.0014972544,0.00055253954,0.0021535035,0.315233,0.008287299,0.67121494],"study_design_scores_gemma":[0.003368969,0.003947345,0.16015112,0.00008483919,0.00003466826,0.00074063754,0.00033247648,0.07654234,0.0060207252,0.15005937,0.5966929,0.0020245912],"about_ca_topic_score_codex":0.0000020761063,"about_ca_topic_score_gemma":0.000003319877,"teacher_disagreement_score":0.92997235,"about_ca_system_score_codex":0.0000049013,"about_ca_system_score_gemma":0.000023013776,"threshold_uncertainty_score":0.099523194},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046741832969382384,"score_gpt":0.27947337871520894,"score_spread":0.23273154574582655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075190915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7358492,0.00027462663,0.23131955,0.0012001427,0.00017292869,0.00039233608,0.0000020523637,0.00013895718,0.030650225],"genre_scores_gemma":[0.9063536,0.0000064544897,0.09334882,0.00019961904,0.000013666285,0.000007065907,0.0000018276461,0.0000033270364,0.00006564139],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989622,0.000038897557,0.00020693307,0.00033563183,0.00013287608,0.00032346623],"domain_scores_gemma":[0.9994309,0.00009767644,0.000044618326,0.00029212356,0.000054728738,0.00007996726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056524196,0.000115944684,0.00019927787,0.000064527885,0.00008342501,0.00008312325,0.00028072996,0.00005240661,0.00002473375],"category_scores_gemma":[0.000022537983,0.000097519995,0.000017443283,0.0005362699,0.000087419954,0.0002501775,0.00016583233,0.00014790375,0.00003076383],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010674408,0.0013799076,0.74156934,0.000126366,0.000050943436,0.00010127999,0.019890454,0.0019584708,0.00038044978,0.17092963,0.018669426,0.044836972],"study_design_scores_gemma":[0.001411197,0.00024299788,0.8320019,0.00003517494,0.000005385106,0.000027965123,0.0006004388,0.0716064,0.00038088363,0.017819779,0.075232364,0.0006355247],"about_ca_topic_score_codex":0.00019369551,"about_ca_topic_score_gemma":0.0009251119,"teacher_disagreement_score":0.17050439,"about_ca_system_score_codex":0.00003052679,"about_ca_system_score_gemma":0.00003253844,"threshold_uncertainty_score":0.39767498},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.008343787582730747,"score_gpt":0.1971623127895958,"score_spread":0.18881852520686507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075726393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88050026,0.0003041751,0.10526798,0.0010568737,0.0007480565,0.00026731234,0.00005935806,0.0006805927,0.011115394],"genre_scores_gemma":[0.9917552,0.000024155908,0.0072594937,0.00038474033,0.00019428687,0.0000079820375,0.000022617123,0.0000261309,0.00032542323],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992131,0.000011773809,0.00017786525,0.00014279965,0.00012778815,0.00032667906],"domain_scores_gemma":[0.9996475,0.000013849228,0.000015754293,0.00022111756,0.000035628404,0.00006617067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008212254,0.000149184,0.00015359026,0.000047744143,0.00004721313,0.000054235803,0.00017542683,0.0000807478,0.0004663885],"category_scores_gemma":[0.000028758463,0.00015395634,0.000034419623,0.000062181214,0.000013032863,0.00022659308,0.00003610026,0.00011487798,0.00010506023],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011932468,0.00076534785,0.002148615,0.0007440597,0.00063430273,0.0004707878,0.0050760573,0.21008319,0.44394654,0.07086763,0.19417177,0.06989847],"study_design_scores_gemma":[0.013867423,0.0018494795,0.015141512,0.0005836082,0.00038759943,0.00018818118,0.0005723912,0.3079065,0.05032259,0.17215766,0.432166,0.0048570414],"about_ca_topic_score_codex":0.000022721815,"about_ca_topic_score_gemma":0.00002926004,"teacher_disagreement_score":0.39362395,"about_ca_system_score_codex":0.000040864903,"about_ca_system_score_gemma":0.000013329656,"threshold_uncertainty_score":0.6278157},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008059683917308876,"score_gpt":0.1874648852515281,"score_spread":0.17940520133421922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096032355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48904067,0.000092930255,0.5025849,0.00068389886,0.00062296144,0.00010433001,0.0000015053084,0.0003977029,0.0064711086],"genre_scores_gemma":[0.7921987,0.000005144416,0.20186655,0.0010589403,0.00027235315,0.000027450906,0.00000467034,0.000026646178,0.0045395107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988359,0.00004005005,0.00017623103,0.0003818448,0.00020727678,0.00035867555],"domain_scores_gemma":[0.99892503,0.00009787528,0.00008646578,0.0006670134,0.000140178,0.000083414256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034424217,0.00019301829,0.00017746094,0.00005731739,0.00023040002,0.00044436436,0.000719004,0.00010175641,0.00014728362],"category_scores_gemma":[0.000042768417,0.00014660727,0.00003754556,0.00027082113,0.0001259793,0.00036937185,0.00022474337,0.0003291535,0.00007865522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000206786,0.00013282352,0.0062104533,0.0000416566,0.00007279451,0.000069771726,0.0042928085,0.000072449686,0.07916385,0.8729131,0.0059019094,0.031107657],"study_design_scores_gemma":[0.005502611,0.0012098076,0.035546575,0.00019638687,0.00013746404,0.0012607495,0.0022956962,0.3641842,0.16660316,0.114016116,0.3035894,0.005457829],"about_ca_topic_score_codex":0.00006399545,"about_ca_topic_score_gemma":0.00031411723,"teacher_disagreement_score":0.758897,"about_ca_system_score_codex":0.000007278597,"about_ca_system_score_gemma":0.000069099005,"threshold_uncertainty_score":0.5978471},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023030080373455417,"score_gpt":0.2766309605178506,"score_spread":0.25360088014439514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106316671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053735774,0.00017332553,0.9369405,0.002713631,0.000407065,0.0005046113,0.0000047884537,0.00037100422,0.0051493077],"genre_scores_gemma":[0.62856156,0.00002003061,0.3694272,0.0010404962,0.00026822375,0.00009310713,0.000009685446,0.000017146172,0.00056255877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832696,0.00013739389,0.00025643207,0.00058619713,0.00028971623,0.00040332877],"domain_scores_gemma":[0.9987272,0.00039529847,0.000048683407,0.0005799955,0.00014136401,0.00010747204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057562423,0.00019355539,0.00022436761,0.000048548507,0.00030461996,0.0001750443,0.00079712045,0.00012081192,0.0006569055],"category_scores_gemma":[0.00008901691,0.00015963725,0.00012009541,0.0003340625,0.00010738925,0.00029476944,0.00014081047,0.00012860898,0.00015704345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019218419,0.001274606,0.0015032717,0.0000731782,0.00009653226,0.000032404263,0.0014605841,0.004363213,0.00022719453,0.46883294,0.0031905381,0.51875335],"study_design_scores_gemma":[0.002122974,0.0009215108,0.026927272,0.00003507121,0.000043673444,0.00012606716,0.000027535207,0.5802171,0.00041658353,0.31137186,0.076927654,0.0008626928],"about_ca_topic_score_codex":0.000032267562,"about_ca_topic_score_gemma":0.0000405263,"teacher_disagreement_score":0.5758539,"about_ca_system_score_codex":0.00006217171,"about_ca_system_score_gemma":0.000028639175,"threshold_uncertainty_score":0.7192655},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014968786426241274,"score_gpt":0.3140181872646999,"score_spread":0.2990494008384586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109981504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067983836,0.000020425612,0.82142514,0.004907071,0.0009066602,0.0002444103,0.0000017253338,0.00041737282,0.10409334],"genre_scores_gemma":[0.91685903,0.0000028876284,0.0798895,0.00083123567,0.00008561561,0.00001614509,5.482576e-7,0.000014068499,0.0023009977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907124,0.000039576662,0.000072650364,0.00028191908,0.00025482234,0.0002797977],"domain_scores_gemma":[0.99885,0.00014631903,0.000021453856,0.0008107238,0.0000863773,0.00008515208],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029938068,0.000085502346,0.00007055947,0.000098384626,0.000110963505,0.00008027704,0.00088431744,0.00005361749,0.000201761],"category_scores_gemma":[0.00019467439,0.00006807367,0.00003136151,0.00045828812,0.00009951592,0.00022736726,0.00019493864,0.00040451097,0.0011804557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071499385,0.000032581316,0.000062634266,0.0000013610386,0.0000023172104,0.000008829541,0.000107638836,0.000016633718,0.008236223,0.9264245,0.00032924872,0.0647709],"study_design_scores_gemma":[0.0005471607,0.00015490246,0.0011227615,0.000010744561,0.0000014910131,0.000024729487,0.000010540552,0.012027964,0.022973256,0.83314055,0.12966697,0.00031894314],"about_ca_topic_score_codex":0.0000021260273,"about_ca_topic_score_gemma":0.000011304964,"teacher_disagreement_score":0.84887516,"about_ca_system_score_codex":0.000007274733,"about_ca_system_score_gemma":0.000046731988,"threshold_uncertainty_score":0.99959725},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028105875493164612,"score_gpt":0.2901652450060777,"score_spread":0.2620593695129131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114850296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9628921,0.00008309088,0.0026258659,0.0030096383,0.00011872382,0.00007877027,0.0000011237743,0.0001392574,0.031051444],"genre_scores_gemma":[0.9279844,0.000010670087,0.036293138,0.0008953357,0.00047676163,0.000009532996,0.0000020527464,0.0000351568,0.03429294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942476,0.000010337675,0.00013074985,0.00013327642,0.00011749399,0.00018336922],"domain_scores_gemma":[0.9996123,0.000058441095,0.00003760178,0.0002052128,0.00004117903,0.000045267516],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011017568,0.000092765746,0.00011844019,0.00003594841,0.000047524503,0.000023991097,0.0001121474,0.00004617039,0.0010004253],"category_scores_gemma":[0.00015627146,0.000077041586,0.000039827642,0.00008117544,0.00003338602,0.000101809695,0.00003582984,0.00011811594,0.0007340396],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025188985,0.00048971386,0.0024909286,0.000100751946,0.00008527354,0.000013384634,0.0038805327,0.000013951208,0.0024638833,0.55892444,0.32057902,0.11093291],"study_design_scores_gemma":[0.0010754789,0.0000637162,0.0029826853,0.00008000928,0.000038723898,0.0000338448,0.00036163584,0.00053266296,0.009840543,0.19099002,0.79347867,0.00052199996],"about_ca_topic_score_codex":0.000015733493,"about_ca_topic_score_gemma":0.00005354685,"teacher_disagreement_score":0.47289968,"about_ca_system_score_codex":0.000024281346,"about_ca_system_score_gemma":0.000014755479,"threshold_uncertainty_score":0.9999128},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02379298697490722,"score_gpt":0.2500888003429157,"score_spread":0.22629581336800847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161458631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9032721,0.00026938008,0.016031208,0.00035563036,0.0003505214,0.00008245108,0.000045408564,0.000025661986,0.079567656],"genre_scores_gemma":[0.9954236,0.0000031745603,0.0005167749,0.00022940953,0.00016123764,0.000004750765,0.000015734302,0.0000076132296,0.003637701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995068,0.0000075822713,0.00020855163,0.00013862099,0.000013887742,0.00012460034],"domain_scores_gemma":[0.9996743,0.00009610702,0.00008043457,0.00009199016,0.000017458198,0.000039709503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062382483,0.00005299991,0.00010516989,0.00006833443,0.00010093736,0.000028520148,0.00004661325,0.000045746543,0.0006273821],"category_scores_gemma":[0.000053220458,0.000060858605,0.000018114657,0.00010814498,0.00004487481,0.0000870659,0.000011961866,0.000054668384,0.00046158404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003060317,0.000019759957,0.05190329,0.000007228253,0.00000989245,9.63004e-7,0.0002075483,0.000005509603,0.000053469634,0.94720536,0.0004998806,0.000084055],"study_design_scores_gemma":[0.0007424681,0.000028041875,0.2913568,0.00001188227,0.0000026393245,0.000015406498,0.0002133784,0.00008477427,0.0000663251,0.24715109,0.46010554,0.0002216295],"about_ca_topic_score_codex":0.00003329055,"about_ca_topic_score_gemma":0.000030597712,"teacher_disagreement_score":0.7000542,"about_ca_system_score_codex":0.000013949744,"about_ca_system_score_gemma":0.000005169869,"threshold_uncertainty_score":0.68693936},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Obituary; Mathematics; Combinatorics; Philosophy; Theology","score_opus":0.00879220590819138,"score_gpt":0.22037786065267415,"score_spread":0.21158565474448277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180110214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008172103,0.00015487958,0.9044492,0.0006110604,0.0003656028,0.000050408824,1.7986505e-7,0.00013038202,0.08606614],"genre_scores_gemma":[0.8900671,0.000009740298,0.10102943,0.002522175,0.000038194477,0.000006421051,5.442947e-7,0.000007231694,0.0063191433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948406,0.000022462018,0.00006303439,0.00017953398,0.000079267156,0.00017165308],"domain_scores_gemma":[0.99960214,0.00001924696,0.000017176646,0.00029125114,0.000027938499,0.00004226867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051903986,0.00006328619,0.000059257054,0.000023337812,0.000055096018,0.000036349124,0.00024467666,0.000025371533,0.00022182337],"category_scores_gemma":[0.0000286644,0.00005103716,0.000022276663,0.00022367845,0.000016971806,0.00021725721,0.000041439296,0.000060628758,0.0005957169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3806476e-7,0.000038450387,0.0008402611,0.000002252083,0.0000050635435,0.00001761143,0.00020718634,0.000061070255,0.0003580666,0.98170054,0.0037978217,0.012971036],"study_design_scores_gemma":[0.00048955425,0.00007402793,0.0026332722,0.000007618917,0.0000030746696,0.000055310116,0.000031794305,0.0014160027,0.0029112704,0.17261355,0.8194134,0.0003511128],"about_ca_topic_score_codex":0.0000014725483,"about_ca_topic_score_gemma":0.0000027258927,"teacher_disagreement_score":0.881895,"about_ca_system_score_codex":0.000008052741,"about_ca_system_score_gemma":0.000027532815,"threshold_uncertainty_score":0.76569337},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014439054600286253,"score_gpt":0.2309692622574119,"score_spread":0.21653020765712566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181843556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42712113,0.0006411148,0.47676998,0.0654232,0.0011122351,0.00064495107,0.0000050855115,0.0004551856,0.027827134],"genre_scores_gemma":[0.969837,0.000071597984,0.0010960292,0.021656124,0.00015489239,0.000057967747,0.000005061993,0.000017591514,0.007103716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988537,0.00013804546,0.00014721374,0.0003096804,0.00022900569,0.00032236506],"domain_scores_gemma":[0.998972,0.00017144308,0.000048383663,0.00067195145,0.000080198326,0.000056014323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020569764,0.00015331236,0.00010084603,0.000017619615,0.00039681373,0.00018975772,0.00097355887,0.000055379354,0.0003828165],"category_scores_gemma":[0.00008065022,0.00007277574,0.00003672171,0.0006924677,0.000071949464,0.00017255619,0.00013150544,0.00020376524,0.00047983916],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002801595,0.00022403334,0.0005076976,0.0000025684164,0.00006303093,0.00004244907,0.00092857645,0.006814322,0.0069066347,0.55055255,0.38133588,0.052594252],"study_design_scores_gemma":[0.0005114708,0.00015899443,0.000346979,0.000009382067,0.00000791353,0.000030860505,0.00010033851,0.06298639,0.003858419,0.012349431,0.91926426,0.00037556456],"about_ca_topic_score_codex":0.0000152571165,"about_ca_topic_score_gemma":0.000037966387,"teacher_disagreement_score":0.5427159,"about_ca_system_score_codex":0.000019668092,"about_ca_system_score_gemma":0.000047915513,"threshold_uncertainty_score":0.61675215},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010557747598862898,"score_gpt":0.22653399423523898,"score_spread":0.21597624663637607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270268103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058034487,0.0000494155,0.92970675,0.0057264077,0.00035965844,0.000048027978,9.596979e-7,0.00013893994,0.0059353574],"genre_scores_gemma":[0.98915106,0.000007580222,0.005064635,0.0018818062,0.00003349986,0.000004794444,2.0601478e-7,0.000004022091,0.0038524228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994904,0.000009951921,0.00006070942,0.00018343514,0.00010282015,0.0001527247],"domain_scores_gemma":[0.9994747,0.0001250814,0.00002318131,0.00030438678,0.00003467579,0.00003795815],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000044381562,0.00006053664,0.00006483969,0.00005791854,0.000046233985,0.000027529342,0.00030780488,0.000022725999,0.00026104262],"category_scores_gemma":[0.000079901176,0.0000338849,0.000017573322,0.00026244984,0.000037174657,0.00020442421,0.000072921066,0.00002798267,0.0015615108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007177496,0.000047739875,0.0010911238,0.000002723463,0.000009269031,0.000016645285,0.000096868294,0.000008016799,0.0026878975,0.66231024,0.0073019746,0.32642034],"study_design_scores_gemma":[0.0020547102,0.00046777385,0.027404236,0.0000739707,0.0000046347454,0.00003204322,0.000017621414,0.00032636835,0.03480921,0.7058742,0.22819397,0.0007412729],"about_ca_topic_score_codex":7.270505e-7,"about_ca_topic_score_gemma":5.7132985e-7,"teacher_disagreement_score":0.9311165,"about_ca_system_score_codex":0.000008147495,"about_ca_system_score_gemma":0.000013722613,"threshold_uncertainty_score":0.9992159},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.014556372211343415,"score_gpt":0.20391724787052304,"score_spread":0.1893608756591796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345399371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2960619,0.0016664865,0.62668514,0.0028032374,0.0019505554,0.0003246069,0.0000066621596,0.00071980694,0.06978162],"genre_scores_gemma":[0.97868145,0.000021005046,0.018819824,0.00076179,0.000035866775,0.0000043256186,7.595493e-7,0.0000094453635,0.0016655521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999253,0.000023518696,0.00015294465,0.00019197297,0.00018516378,0.00019342305],"domain_scores_gemma":[0.99937177,0.000077131015,0.000076408614,0.00037015026,0.000070423725,0.000034107175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016604945,0.00008253404,0.00011792968,0.00005478205,0.000059208505,0.000046493522,0.0004904285,0.000035610286,0.00068606436],"category_scores_gemma":[0.000037506394,0.00007366463,0.0000368812,0.00035058346,0.00005650768,0.00024787406,0.00011747552,0.00006412561,0.00020680003],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013145383,0.0006442442,0.0030545536,0.00011302242,0.00013196452,0.00009744972,0.005119661,0.0004817995,0.024706291,0.521324,0.09761994,0.34669396],"study_design_scores_gemma":[0.0027534636,0.00021299814,0.0025535559,0.00012264207,0.000028494798,0.0001269323,0.00024235342,0.522027,0.013938084,0.013140433,0.4438215,0.0010325433],"about_ca_topic_score_codex":0.000032282118,"about_ca_topic_score_gemma":0.0000025046868,"teacher_disagreement_score":0.6826195,"about_ca_system_score_codex":0.00000865618,"about_ca_system_score_gemma":0.000011744913,"threshold_uncertainty_score":0.7511924},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017578876914792006,"score_gpt":0.2982002506832728,"score_spread":0.28062137376848084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397983808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030973524,0.000031908083,0.9323782,0.012067146,0.0001418618,0.00017468366,0.0000031797372,0.0001441925,0.024085328],"genre_scores_gemma":[0.85562,0.000019253039,0.12036815,0.0006407141,0.00006785932,0.000083044775,0.0000013177319,0.000019202806,0.023180421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991312,0.0000726393,0.000090301444,0.00024160222,0.00023213738,0.00023211403],"domain_scores_gemma":[0.9991643,0.00016547744,0.000024005538,0.0005268715,0.000054620406,0.00006474137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022903689,0.00006676789,0.00005445415,0.000108146654,0.00011764572,0.000023727089,0.00042639,0.000024711006,0.00035327655],"category_scores_gemma":[0.00005224136,0.000042065796,0.000025952822,0.00039949466,0.00005341833,0.00024794246,0.00015829306,0.00006711522,0.0018689936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011074941,0.000060991857,0.00047224326,0.0000011181206,0.00000757689,0.000013524549,0.000112944326,0.000038332466,0.0030530994,0.9568015,0.003981819,0.035445828],"study_design_scores_gemma":[0.00093142176,0.00033341275,0.0035018278,0.000045518245,0.0000013995259,0.000006716261,0.000019552177,0.00063140196,0.0017180395,0.7230401,0.26953828,0.00023234358],"about_ca_topic_score_codex":0.0000010706657,"about_ca_topic_score_gemma":0.0000022112854,"teacher_disagreement_score":0.82464653,"about_ca_system_score_codex":0.000047817895,"about_ca_system_score_gemma":0.000038937756,"threshold_uncertainty_score":0.99890816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014486632585228622,"score_gpt":0.23637881447789247,"score_spread":0.22189218189266385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810888652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51246005,0.000090352216,0.45850655,0.005544829,0.000802784,0.0006315117,0.000017684404,0.00016762922,0.021778597],"genre_scores_gemma":[0.9825882,0.0000011577438,0.015161827,0.0017421455,0.00012558213,0.000019593814,0.000001785427,0.000010715339,0.0003490029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990005,0.00013288934,0.0001452285,0.0002647727,0.00025758595,0.0001990119],"domain_scores_gemma":[0.9982466,0.000054731976,0.00007741774,0.0014762841,0.00009832297,0.00004662456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032908632,0.00010411405,0.00011529903,0.00003368497,0.00020158803,0.00008390864,0.0017477565,0.000037830454,0.000071772345],"category_scores_gemma":[0.00006996178,0.00005661033,0.0000429166,0.0005334626,0.0000950783,0.00021398207,0.0005228973,0.00008383767,0.000052842224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008165937,0.0012980396,0.0032100256,0.000068428104,0.00015480297,0.000001990722,0.014507679,0.00054811337,0.0200971,0.7399055,0.15095171,0.06917499],"study_design_scores_gemma":[0.0018636507,0.00063587417,0.15102491,0.00007989482,0.000056280733,0.00006491612,0.00084699626,0.6464743,0.012101376,0.026447576,0.15953858,0.0008656261],"about_ca_topic_score_codex":0.0001664346,"about_ca_topic_score_gemma":0.000042204018,"teacher_disagreement_score":0.7134579,"about_ca_system_score_codex":0.000017049442,"about_ca_system_score_gemma":0.000035849636,"threshold_uncertainty_score":0.32477954},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.031763554937995854,"score_gpt":0.3440101601170344,"score_spread":0.3122466051790385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385659976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028132034,0.00006287556,0.9687051,0.0011547618,0.00004227212,0.00099528,0.000018984003,0.0004961626,0.00039249985],"genre_scores_gemma":[0.5349242,0.000022602026,0.46249261,0.00015727735,0.00007087956,0.0017025605,0.000028781242,0.00002970093,0.0005713669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988497,0.000051070157,0.00012634801,0.00041704607,0.00021906727,0.00033676386],"domain_scores_gemma":[0.99877834,0.00028935683,0.00004622217,0.0005900261,0.00022081303,0.00007525034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030330254,0.00011199797,0.00013029142,0.0001425945,0.00020441007,0.000096422664,0.0007151503,0.000037732072,0.000015620231],"category_scores_gemma":[0.000026965641,0.00008691883,0.000040851275,0.0012343271,0.00017222804,0.00029055917,0.00013661936,0.00011218665,0.00004062421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049678754,0.000052884967,0.003423434,0.00006624195,0.000039505063,0.0000028279667,0.00037815067,0.00058645534,0.00034294292,0.9306138,0.00058824336,0.06385584],"study_design_scores_gemma":[0.00038490247,0.00013580729,0.011664441,0.000005504621,0.000005366659,0.000005640826,0.000074394615,0.017182022,0.0011110262,0.95002687,0.019202884,0.00020111803],"about_ca_topic_score_codex":0.000006185054,"about_ca_topic_score_gemma":0.000019982008,"teacher_disagreement_score":0.5067922,"about_ca_system_score_codex":0.0000144853875,"about_ca_system_score_gemma":0.00005766958,"threshold_uncertainty_score":0.35444468},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.041522096459639335,"score_gpt":0.29842855433600496,"score_spread":0.2569064578763656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386582925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9387419,0.0000028861923,0.052407894,0.0011096874,0.0001344328,0.00026101834,0.00002776627,0.000110041176,0.0072043417],"genre_scores_gemma":[0.9924329,0.000026859874,0.00044868197,0.00031358434,0.000069830465,0.000022482365,0.00003106944,0.000023124756,0.006631466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995007,0.000038666523,0.000107200816,0.000105358435,0.00010574079,0.00014237023],"domain_scores_gemma":[0.9992809,0.00037577143,0.00004977432,0.0002338898,0.000044894696,0.00001474231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021356654,0.00008041851,0.00012168689,0.000043879132,0.00008099247,0.00000507303,0.00008400757,0.00005350812,0.00015447324],"category_scores_gemma":[0.00013284574,0.000048891943,0.000018354736,0.00029830428,0.00008473432,0.000032601525,0.000016989925,0.00011239506,0.000079387995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028710387,0.0001745908,0.00081124704,0.000076902776,0.00009187342,0.000018302646,0.003080598,0.00020419432,0.024881568,0.9658269,0.0004012772,0.0041453973],"study_design_scores_gemma":[0.0026417368,0.0012185547,0.03418362,0.00058186776,0.00027007563,0.000040530384,0.0022037881,0.01263613,0.116094775,0.7857165,0.04304756,0.0013648618],"about_ca_topic_score_codex":0.0000013049394,"about_ca_topic_score_gemma":0.000013102732,"teacher_disagreement_score":0.18011044,"about_ca_system_score_codex":0.000010031123,"about_ca_system_score_gemma":0.000022549453,"threshold_uncertainty_score":0.19937555},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032610627241554606,"score_gpt":0.3315577304792162,"score_spread":0.2989471032376616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388826287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9063038,0.0003562993,0.047185455,0.008742626,0.0018319485,0.0027205525,0.0004659387,0.00037539154,0.03201794],"genre_scores_gemma":[0.9470757,0.00001034524,0.008508782,0.0005036561,0.00012411091,0.00013473124,0.0000132906425,0.000054766133,0.04357462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948627,0.000032558117,0.00012164049,0.00010532245,0.00008583896,0.00016835604],"domain_scores_gemma":[0.9990957,0.00035625222,0.000080727164,0.0003901034,0.00006301789,0.000014207902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022075475,0.00007499963,0.0001371184,0.000021655029,0.00008487521,0.0000035238804,0.00025605582,0.00007258131,0.00009230638],"category_scores_gemma":[0.00055218214,0.000046805937,0.000052784235,0.00014819943,0.000088325054,0.000032862892,0.00009016075,0.00008440366,0.000008489059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104406536,0.00007720564,0.00065156055,0.00025265006,0.000102785976,0.000004272125,0.0011540035,0.00016507143,0.00170338,0.9497854,0.045045365,0.0009539136],"study_design_scores_gemma":[0.00056596566,0.00003117302,0.00006533549,0.000021154132,0.000022852058,0.000006914071,0.000093875366,0.00038347064,0.011284818,0.973011,0.014451029,0.000062399326],"about_ca_topic_score_codex":0.000002544016,"about_ca_topic_score_gemma":0.000038062364,"teacher_disagreement_score":0.04077185,"about_ca_system_score_codex":0.000008795069,"about_ca_system_score_gemma":0.000033414133,"threshold_uncertainty_score":0.19086908},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Partially ordered set; Pure mathematics; Combinatorics; Discrete mathematics","score_opus":0.024695583208998024,"score_gpt":0.3273396079372843,"score_spread":0.3026440247282863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393861209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94812727,0.00088335306,0.039774995,0.0003187397,0.00021184987,0.00008973897,0.000008871564,0.00007886543,0.010506339],"genre_scores_gemma":[0.9743189,0.000014691417,0.02452147,0.000021240046,0.00003450962,0.0000023973862,0.0000022278464,0.000009184293,0.001075334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962455,0.000027606216,0.0001140083,0.000111648405,0.00005358386,0.00006860993],"domain_scores_gemma":[0.9994424,0.0003977437,0.000019108737,0.00010159105,0.000023485474,0.000015659327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013230229,0.000055346478,0.00009112522,0.000027048955,0.00003411567,0.000003987251,0.000028862205,0.000059616203,0.0008295811],"category_scores_gemma":[0.00020059399,0.00004507896,0.000019022062,0.0000614744,0.00011775131,0.000056475186,0.000026954776,0.00010168675,0.000008832247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001057982,0.000013835575,0.00066979113,0.00013277344,0.000021946686,0.000002150832,0.0004495886,0.000026753545,0.00013972296,0.99674904,0.0001455577,0.0016382782],"study_design_scores_gemma":[0.00006798525,0.000014970887,0.00088907755,0.000015368985,0.000012545231,0.000010894242,0.00007538386,0.0010446953,0.00036778804,0.99390894,0.003542779,0.000049570015],"about_ca_topic_score_codex":0.0000017378417,"about_ca_topic_score_gemma":0.000005526766,"teacher_disagreement_score":0.026191697,"about_ca_system_score_codex":0.000006241239,"about_ca_system_score_gemma":0.000017016431,"threshold_uncertainty_score":0.9083332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0063255926443933266,"score_gpt":0.20017275173423477,"score_spread":0.19384715908984143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402679330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681906,0.00503638,0.004167743,0.00016523182,0.00091736217,0.00008673107,0.0000061305195,0.00060200226,0.020827804],"genre_scores_gemma":[0.9994648,0.00008284926,0.00003595062,0.000014780179,0.000079313075,0.000015729354,0.0000051597167,0.000009724101,0.00029168202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997669,0.000011046563,0.000056110035,0.00006139541,0.00003410528,0.0000704448],"domain_scores_gemma":[0.9999085,0.000016463666,0.0000026178343,0.000046561825,0.000005875552,0.000019977888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007282123,0.000043847773,0.000040826537,0.000026091107,0.000022126318,0.00004952639,0.000014000989,0.000028469232,0.00018705562],"category_scores_gemma":[0.0000027770081,0.0000392821,0.000011864013,0.00008821505,0.0000119022425,0.00011478889,0.0000028756988,0.000040623043,0.00019606149],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000438381,0.00007489345,0.004851047,0.0048537203,0.0005602665,0.00013046045,0.00795175,0.010891506,0.08338305,0.66769224,0.061387856,0.15817936],"study_design_scores_gemma":[0.00048187972,0.0000680061,0.00513793,0.0005226273,0.000106743464,0.00006185789,0.00043734314,0.15989785,0.009297197,0.061422676,0.7619794,0.00058649125],"about_ca_topic_score_codex":0.0000017002085,"about_ca_topic_score_gemma":0.000005049666,"teacher_disagreement_score":0.70059156,"about_ca_system_score_codex":0.000003839829,"about_ca_system_score_gemma":0.0000015631333,"threshold_uncertainty_score":0.2520039},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.03012760556179584,"score_gpt":0.32309919355368816,"score_spread":0.2929715879918923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416943509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51902425,0.00026719578,0.4615828,0.0011308717,0.00097882,0.0005564624,0.0000024990645,0.00042031615,0.01603676],"genre_scores_gemma":[0.5156171,0.000018028864,0.4605166,0.00021421097,0.00027293176,0.00012640642,0.0000060897114,0.00006395212,0.02316471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999296,0.000025866273,0.00026448572,0.00016321549,0.000096619995,0.00015377803],"domain_scores_gemma":[0.99929535,0.00020408422,0.00010014476,0.0001981659,0.0001741247,0.000028126484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019998243,0.00010358636,0.00015330108,0.000053116368,0.0002164294,0.000042609303,0.000059568814,0.000057792622,0.000050724382],"category_scores_gemma":[0.0018985118,0.000097285934,0.000019800053,0.0002848216,0.000024997442,0.00008202888,0.00007051625,0.00011226705,0.000012321139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038582452,0.0001855862,0.00066849514,0.00025733985,0.000059588576,0.0000021424542,0.0005432638,0.000042792974,0.0062542525,0.98040336,0.0030298866,0.008549418],"study_design_scores_gemma":[0.0004827412,0.000024954232,0.000017950635,0.00012437235,0.000056176446,0.0000042379124,0.000249098,0.0050968807,0.0012295025,0.990309,0.0022637434,0.00014136956],"about_ca_topic_score_codex":0.0000014395578,"about_ca_topic_score_gemma":0.000006271006,"teacher_disagreement_score":0.009905598,"about_ca_system_score_codex":0.000028342394,"about_ca_system_score_gemma":0.00003751136,"threshold_uncertainty_score":0.39672053},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Lemma (botany); Surjective function; Bounded function; Pure mathematics; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.009129982892657219,"score_gpt":0.22436083910600965,"score_spread":0.21523085621335244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69796697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899004,0.0006155902,0.25069168,0.0024090766,0.00022492651,0.00019783685,0.000001344589,0.00015758387,0.055801548],"genre_scores_gemma":[0.97442853,0.000028405011,0.023040542,0.00037584925,0.000015058787,0.000005644602,7.2946415e-7,0.000004297756,0.0021009177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999402,0.000027822527,0.00013680637,0.00016682337,0.00010549356,0.0001610747],"domain_scores_gemma":[0.99962354,0.00003904777,0.000025441617,0.0002632899,0.000022368302,0.000026298929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007982373,0.00006761141,0.00010889618,0.000049334394,0.000022678245,0.000013058976,0.0003370004,0.000036025183,0.0007983891],"category_scores_gemma":[0.000015679008,0.0000581755,0.000021754773,0.0004035028,0.00004192064,0.00020563771,0.00004235846,0.00006847527,0.00012275898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011961296,0.00014513964,0.0036565717,0.000012860746,0.0000074776362,0.000029981182,0.0015706032,0.0023726334,0.00056278636,0.7112455,0.0005514883,0.27983302],"study_design_scores_gemma":[0.0010284209,0.00020034553,0.052684914,0.00003065759,0.0000040728255,0.000020603931,0.00007785839,0.012974223,0.0035975878,0.88376886,0.045133863,0.00047857335],"about_ca_topic_score_codex":0.00003433988,"about_ca_topic_score_gemma":0.000016021846,"teacher_disagreement_score":0.28452814,"about_ca_system_score_codex":0.000008789401,"about_ca_system_score_gemma":0.000026013637,"threshold_uncertainty_score":0.87418},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010698562855864749,"score_gpt":0.2544669268655703,"score_spread":0.24376836400970558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081523646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35345882,0.00012838139,0.3359231,0.06850986,0.00024237855,0.00023912481,0.0000029094977,0.00023505352,0.24126036],"genre_scores_gemma":[0.98749167,0.0000033931872,0.0041044755,0.0008646638,0.000010671331,0.000014018458,0.00000487449,6.60258e-7,0.007505594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999516,0.00002637221,0.00009071756,0.00021922188,0.000057181853,0.00009050216],"domain_scores_gemma":[0.999535,0.000056464414,0.000023056291,0.00028233379,0.00007738906,0.000025751382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013476725,0.000055309574,0.000054578297,0.000025675263,0.00016951025,0.00006676142,0.0001545734,0.000047767157,0.000048983704],"category_scores_gemma":[0.00014275957,0.000050311453,0.000012064456,0.0003045506,0.00002902974,0.00009279649,0.00008250033,0.00007530478,0.000025788027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018222712,0.00005005319,0.017932257,0.000010038436,0.000009370118,6.969947e-7,0.000119540084,0.000046806603,0.00041715166,0.9707927,0.0026135638,0.008005961],"study_design_scores_gemma":[0.0004891191,0.000055691948,0.30667707,0.00004573778,0.00001130726,0.00000785729,0.0000516107,0.015595095,0.00357545,0.30968273,0.36351445,0.0002938703],"about_ca_topic_score_codex":0.000010954795,"about_ca_topic_score_gemma":0.0000055163537,"teacher_disagreement_score":0.66111004,"about_ca_system_score_codex":0.000011708721,"about_ca_system_score_gemma":0.000053941643,"threshold_uncertainty_score":0.20516415},"labels":[],"label_agreement":null}]}