{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29761577,0.0020380171,0.47756815,0.0018134221,0.0004917215,0.00018355165,0.00067726197,0.00033828188,0.21927387],"genre_scores_gemma":[0.9057584,0.0008528947,0.06305682,0.0005890397,0.0002832637,0.00028295052,0.00047006636,0.00016370065,0.028542973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985286,0.00041499268,0.000102958664,0.00029796397,0.00040980364,0.0002456676],"domain_scores_gemma":[0.9986563,0.00042009458,0.00013751833,0.00016805885,0.00036276344,0.00025529438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001716836,0.000568976,0.00062770024,0.002254171,0.0022074927,0.0037344834,0.00079975615,0.0009678058,0.0075199283],"category_scores_gemma":[0.0026714301,0.00046750825,0.0012539404,0.0010600651,0.0038924187,0.0061443,0.0029544202,0.002146705,0.0009740814],"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.000004603145,0.000004158484,0.00003839349,0.000007568935,0.000002006607,0.00002630397,0.00008926149,0.00017470187,0.00023484597,0.9983725,0.00012396846,0.0009217549],"study_design_scores_gemma":[0.0000060509074,0.000016954822,0.00013347731,0.000012146243,0.0000052301907,0.00007765463,0.00009116879,0.003408653,0.0007886271,0.9909266,0.0045238393,0.000009669987],"about_ca_topic_score_codex":0.0011731342,"about_ca_topic_score_gemma":0.0008024895,"teacher_disagreement_score":0.0075199283,"about_ca_system_score_codex":0.0018916621,"about_ca_system_score_gemma":0.000792703,"threshold_uncertainty_score":0.025156677},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059967242,0.016404532,0.2013647,0.009186684,0.0027163804,0.00008910024,0.0014184543,0.00054830464,0.7083046],"genre_scores_gemma":[0.64332426,0.01944178,0.0875422,0.0030341002,0.0021579692,0.0001474589,0.0015857755,0.00031468578,0.24245168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997335,0.000042662243,0.000017718938,0.00005010921,0.000108729386,0.00004729689],"domain_scores_gemma":[0.9996792,0.00014575293,0.000036532736,0.000049033046,0.00005369401,0.000035650228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093775,0.00049943576,0.00032205248,0.0009511499,0.00092319027,0.001522531,0.0005077873,0.0005278569,0.011774936],"category_scores_gemma":[0.0009985084,0.00028261062,0.0005923175,0.0011743075,0.002700611,0.0030875513,0.0015963794,0.0028452722,0.003047945],"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.000030993044,0.000009028648,0.00005804483,0.00008559976,0.000005118046,0.000087948094,0.00020748547,0.0008345811,0.0015942925,0.9731367,0.006634317,0.017315928],"study_design_scores_gemma":[0.000007560013,0.000022941987,0.00023368289,0.000021402442,0.00000656472,0.00014960127,0.00023612405,0.0005954221,0.0016448782,0.92503685,0.07203395,0.000011012873],"about_ca_topic_score_codex":0.0013775444,"about_ca_topic_score_gemma":0.0015690557,"teacher_disagreement_score":0.011774936,"about_ca_system_score_codex":0.0011394921,"about_ca_system_score_gemma":0.0004265387,"threshold_uncertainty_score":0.03939104},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4934982,0.0038446723,0.32240203,0.0030186418,0.00066699774,0.00010330534,0.0013092564,0.0008052107,0.17435159],"genre_scores_gemma":[0.9407457,0.001149697,0.026097802,0.0002605868,0.00042565214,0.000065107255,0.0005001255,0.00013145519,0.030623874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991997,0.00018006546,0.00008502333,0.0001323906,0.00024935752,0.00015357198],"domain_scores_gemma":[0.9987362,0.00042395914,0.00019302117,0.00017952698,0.00023496512,0.00023227908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120381,0.00059138105,0.0006755846,0.0033376429,0.0016544807,0.0037958564,0.0007567876,0.0008082719,0.009516874],"category_scores_gemma":[0.0024734961,0.00048092255,0.0008679268,0.0027136882,0.0024617082,0.006887446,0.0018335452,0.002054068,0.0015300987],"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.00001946071,0.000008706423,0.00008037881,0.000010949031,0.0000037540217,0.00002621576,0.00022301529,0.00011340517,0.0002611566,0.99576205,0.00034177207,0.003149118],"study_design_scores_gemma":[0.000009335972,0.000013172186,0.00012351823,0.000010415565,0.000007119407,0.00008925255,0.00012483104,0.0011661896,0.00034058062,0.9939406,0.004165615,0.0000094941315],"about_ca_topic_score_codex":0.0008573891,"about_ca_topic_score_gemma":0.0007160007,"teacher_disagreement_score":0.009516874,"about_ca_system_score_codex":0.00094115635,"about_ca_system_score_gemma":0.00047589763,"threshold_uncertainty_score":0.031837106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052485865,0.0002391658,0.9114362,0.00030180212,0.000117900556,0.00011705827,0.0006078613,0.0013220498,0.033372086],"genre_scores_gemma":[0.36664522,0.0007321065,0.6092891,0.00010172133,0.00003698585,0.00011525855,0.0014167124,0.00074320205,0.020919777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967563,0.000077741504,0.000020082387,0.0000445255,0.00013251544,0.00004943021],"domain_scores_gemma":[0.99927706,0.00024245368,0.00005305004,0.00019898196,0.00016899995,0.000059482507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002482353,0.0005827692,0.00042546968,0.001009396,0.0006393382,0.0015170866,0.00087139435,0.0006294424,0.010664981],"category_scores_gemma":[0.0017853057,0.0004898237,0.0004969368,0.0010311528,0.00068262126,0.0011458937,0.0011608121,0.0012818481,0.0019775303],"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.00020932397,0.000095936724,0.0020576557,0.0003023282,0.000024725141,0.00067494926,0.00096459326,0.10997882,0.025213644,0.57831746,0.020438517,0.261722],"study_design_scores_gemma":[0.00008139318,0.00008707473,0.0012567432,0.00011737239,0.00003928222,0.0007530015,0.000540034,0.39543396,0.030806355,0.45013806,0.120693654,0.000053023436],"about_ca_topic_score_codex":0.00247005,"about_ca_topic_score_gemma":0.005497189,"teacher_disagreement_score":0.010664981,"about_ca_system_score_codex":0.0005146742,"about_ca_system_score_gemma":0.00038015118,"threshold_uncertainty_score":0.03567785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6852562,0.0016130954,0.17713773,0.0019992911,0.000565063,0.000119284065,0.0005832948,0.0007989119,0.13192728],"genre_scores_gemma":[0.9669103,0.00027584375,0.0120225,0.0001998052,0.0003262068,0.00004539109,0.000270671,0.000055392804,0.019893909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989017,0.00021134428,0.00010161793,0.00020590365,0.00031766586,0.00026174504],"domain_scores_gemma":[0.99841654,0.00044869797,0.00029333643,0.00023783512,0.00024159407,0.0003619052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011720245,0.00070795463,0.00093624665,0.0018609717,0.0022285655,0.0032670985,0.0010571042,0.00083336094,0.006513594],"category_scores_gemma":[0.0023628508,0.0006803601,0.0009575822,0.0013637345,0.0038886687,0.0069293072,0.0033413202,0.0017085319,0.0011650244],"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.00009079885,0.000016665279,0.00026041328,0.00002115043,0.00001220966,0.00007404661,0.00022963315,0.00019365636,0.0007083622,0.99516416,0.00041085941,0.0028181633],"study_design_scores_gemma":[0.00003126333,0.00003554003,0.0002521869,0.000009388655,0.00002580215,0.00019496359,0.00015031219,0.0009849577,0.0012816101,0.9935335,0.0034837509,0.000016781023],"about_ca_topic_score_codex":0.00052888354,"about_ca_topic_score_gemma":0.0005672024,"teacher_disagreement_score":0.006513594,"about_ca_system_score_codex":0.0008273102,"about_ca_system_score_gemma":0.00075029646,"threshold_uncertainty_score":0.021790147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28640434,0.0017802084,0.4193993,0.0036204692,0.00080234424,0.00012910325,0.00097639934,0.0012532608,0.28563473],"genre_scores_gemma":[0.8763686,0.0016408584,0.047328975,0.00093413214,0.0010523549,0.00011028938,0.0009894142,0.00046516463,0.07111022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988226,0.00018971933,0.000052805284,0.0002438792,0.00044800717,0.0002429787],"domain_scores_gemma":[0.9978708,0.0010611332,0.00017244223,0.0002927637,0.00028270934,0.00032009213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012224143,0.0008822271,0.0010146637,0.0029022733,0.0022851957,0.0050565596,0.0009195866,0.000998999,0.009177216],"category_scores_gemma":[0.0030906969,0.0004926315,0.0010665887,0.0030613146,0.003294642,0.0066464813,0.002343082,0.0038475443,0.0018277367],"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.00003754974,0.000027445842,0.000085938926,0.000021353897,0.000003457003,0.000027401173,0.00011330067,0.00019134367,0.0006029627,0.9905918,0.0012938849,0.0070034773],"study_design_scores_gemma":[0.000011744549,0.000011146408,0.00012610875,0.000008939682,0.000014359234,0.00008030858,0.000048482892,0.0015185804,0.0015147156,0.99068624,0.0059684822,0.000010989465],"about_ca_topic_score_codex":0.00064415566,"about_ca_topic_score_gemma":0.0010355129,"teacher_disagreement_score":0.009177216,"about_ca_system_score_codex":0.00170038,"about_ca_system_score_gemma":0.0009089854,"threshold_uncertainty_score":0.030700803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6511936,0.0024411678,0.16208288,0.0038425915,0.0009049009,0.00013090769,0.00067266927,0.00036864082,0.17836253],"genre_scores_gemma":[0.9446641,0.00069892535,0.018576719,0.0005703864,0.00047476843,0.00007600063,0.00033211368,0.00012804482,0.034479007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988549,0.0003227945,0.000075960015,0.00023286408,0.00024223574,0.0002713517],"domain_scores_gemma":[0.9985676,0.00047398914,0.00018118658,0.00015913475,0.000251882,0.0003662304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388758,0.0009154545,0.0010990812,0.0037289362,0.004018942,0.005678746,0.0011975933,0.0014908556,0.0096317325],"category_scores_gemma":[0.002293661,0.00086947466,0.0012739592,0.002910848,0.005506545,0.011343897,0.0027537188,0.004325836,0.0011013105],"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.000026412674,0.000018528353,0.00008790406,0.000011525217,0.000003831068,0.000031016727,0.00019564849,0.00010639172,0.0002111329,0.9978751,0.00028087216,0.0011515948],"study_design_scores_gemma":[0.000010774127,0.0000066644766,0.00005523378,0.0000052880982,0.000006261472,0.00004434478,0.00010349965,0.0004968782,0.00023135856,0.99804425,0.0009874711,0.000007930544],"about_ca_topic_score_codex":0.0014134194,"about_ca_topic_score_gemma":0.0015160152,"teacher_disagreement_score":0.0096317325,"about_ca_system_score_codex":0.0016963029,"about_ca_system_score_gemma":0.00080676255,"threshold_uncertainty_score":0.032221317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17730255,0.001558706,0.7021165,0.001750792,0.0010238746,0.00018176097,0.001103919,0.002128716,0.112833224],"genre_scores_gemma":[0.7629952,0.0011899818,0.16923262,0.00074842264,0.00097351894,0.00030217876,0.0015643545,0.00089448027,0.06209919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981927,0.00044486023,0.0001730726,0.0002796037,0.0006716773,0.0002381079],"domain_scores_gemma":[0.99706846,0.001206022,0.00026857763,0.00043644742,0.00055760803,0.00046293685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016542524,0.00069410965,0.0007817284,0.002529975,0.0017433546,0.0046886797,0.001017628,0.00075615576,0.011395835],"category_scores_gemma":[0.002702082,0.00069728243,0.0012194784,0.001666185,0.0028103015,0.009449536,0.0026510528,0.002301774,0.0036472878],"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.000119204284,0.000052830786,0.00014986585,0.000053534706,0.000010705746,0.00011645281,0.00043499365,0.00032854336,0.0036460424,0.98163605,0.0015835179,0.011868238],"study_design_scores_gemma":[0.000053072512,0.000047073703,0.0001285332,0.000023540386,0.000017054559,0.00031523494,0.00022310016,0.00417331,0.006907041,0.9715308,0.016551292,0.000029979281],"about_ca_topic_score_codex":0.00043606223,"about_ca_topic_score_gemma":0.00062838354,"teacher_disagreement_score":0.011395835,"about_ca_system_score_codex":0.000982606,"about_ca_system_score_gemma":0.0008931243,"threshold_uncertainty_score":0.038122892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36913773,0.01683741,0.26881978,0.016863273,0.0011049919,0.00013003142,0.0012304606,0.00061204884,0.3252642],"genre_scores_gemma":[0.9153497,0.0067409887,0.03342009,0.0010951252,0.0015393364,0.00018792573,0.00079334877,0.00019422038,0.040679317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896514,0.0003540502,0.00005498535,0.00023900451,0.00024518365,0.00014162129],"domain_scores_gemma":[0.99656785,0.0020930732,0.00036219682,0.0002919387,0.0002856482,0.0003993403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015845017,0.0012818951,0.0017247013,0.0046813046,0.0045804167,0.005532131,0.0015202934,0.001770143,0.008117918],"category_scores_gemma":[0.0051863883,0.0011286422,0.0014089913,0.005161765,0.009786376,0.0170488,0.0042135767,0.0055241594,0.0008569832],"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.000012197238,0.00001032839,0.00009074256,0.000020578454,0.0000024792391,0.00002734978,0.00030384993,0.00023972067,0.000079995836,0.99699247,0.0005397451,0.001680566],"study_design_scores_gemma":[0.0000033606757,0.0000029921553,0.000045369772,0.0000069216044,0.0000037483608,0.00002822971,0.00006768901,0.00032258668,0.00003436042,0.99814045,0.0013412161,0.0000031051482],"about_ca_topic_score_codex":0.0026811885,"about_ca_topic_score_gemma":0.0033303958,"teacher_disagreement_score":0.008117918,"about_ca_system_score_codex":0.0027198975,"about_ca_system_score_gemma":0.0009840323,"threshold_uncertainty_score":0.027157128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43626267,0.001424147,0.23269142,0.004666458,0.0028425208,0.00008911171,0.00063783274,0.00040881542,0.320977],"genre_scores_gemma":[0.9088111,0.0010168522,0.037750382,0.00076875143,0.0014319359,0.00006099449,0.0004584208,0.00020778482,0.049493827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835277,0.00034988348,0.00013599094,0.00034310468,0.00050866936,0.00030955716],"domain_scores_gemma":[0.9971302,0.0005769336,0.00041348062,0.0006903447,0.00077020895,0.00041870167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013978047,0.0008827737,0.0008036891,0.002711222,0.0020088358,0.0037408613,0.00067432126,0.0011644008,0.006652173],"category_scores_gemma":[0.0027368015,0.00042825885,0.001385889,0.0014697572,0.0065073385,0.0068301787,0.0018995174,0.0030099628,0.0010092166],"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.000031360603,0.000015542728,0.00019109233,0.000013457346,0.0000050047834,0.000033217984,0.00010311283,0.000056829573,0.0008144638,0.9958192,0.00043418913,0.002482466],"study_design_scores_gemma":[0.000022980743,0.00005093135,0.0005994388,0.00001648162,0.0000197167,0.00026567435,0.00019387201,0.00094074325,0.0015714053,0.98803574,0.008255685,0.000027277662],"about_ca_topic_score_codex":0.0014597011,"about_ca_topic_score_gemma":0.0014130669,"teacher_disagreement_score":0.006652173,"about_ca_system_score_codex":0.0015354346,"about_ca_system_score_gemma":0.00111362,"threshold_uncertainty_score":0.022253752},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018369466,0.110390864,0.37381837,0.06238127,0.07884377,0.0004761054,0.0048102415,0.010576552,0.3403334],"genre_scores_gemma":[0.08465396,0.058620058,0.23762974,0.0046420414,0.022065576,0.0005127385,0.014962384,0.0048992033,0.5720143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782395,0.00088251126,0.00011541757,0.0004712134,0.00055565045,0.0001513745],"domain_scores_gemma":[0.99545705,0.0017285717,0.00011696886,0.0013022049,0.00093642675,0.0004587419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038604743,0.0010240243,0.002383518,0.0025997604,0.0016724716,0.0093293,0.0025153512,0.0015855975,0.117289014],"category_scores_gemma":[0.007605524,0.000700058,0.0015220556,0.0037899218,0.002825082,0.0078017283,0.0035741192,0.0034054692,0.025101349],"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.0002177397,0.00011948731,0.0006057402,0.00043441335,0.0000727749,0.00010990935,0.00034124008,0.002067531,0.0007425942,0.1450509,0.5539587,0.296279],"study_design_scores_gemma":[0.00002571522,0.000044226836,0.0005711358,0.0002267821,0.000032559336,0.00017573097,0.00027757743,0.004950246,0.00046112374,0.04451034,0.9486959,0.000028729017],"about_ca_topic_score_codex":0.008517522,"about_ca_topic_score_gemma":0.010112224,"teacher_disagreement_score":0.117289014,"about_ca_system_score_codex":0.0032895305,"about_ca_system_score_gemma":0.002924769,"threshold_uncertainty_score":0.39237082},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060558654,0.0039304704,0.5451561,0.008040127,0.0011979566,0.000094472314,0.0013409865,0.0003821425,0.37929907],"genre_scores_gemma":[0.7186718,0.005847074,0.15024851,0.0017488973,0.0013854622,0.00026985563,0.0011807444,0.00052803464,0.12011967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716824,0.0013805783,0.00019637022,0.0003627646,0.0006772838,0.00021476476],"domain_scores_gemma":[0.9944411,0.00314441,0.00035190588,0.0007857884,0.00089867663,0.00037796426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031039433,0.0009334544,0.0011176054,0.00426758,0.0019514516,0.007105179,0.0008533652,0.0010503163,0.02085332],"category_scores_gemma":[0.009267706,0.00053719623,0.0007522983,0.0035850008,0.0061045336,0.0100860875,0.0025294553,0.00412105,0.0037795012],"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.0000071219147,0.000003545571,0.000031967073,0.000008241679,0.0000014951838,0.000008269661,0.000050130744,0.00012245071,0.000041751646,0.99633235,0.0006890405,0.002703544],"study_design_scores_gemma":[0.000004584772,0.000003447736,0.000026434822,0.0000057044867,0.0000018156737,0.000029122959,0.000030945812,0.00054006214,0.000111919115,0.9934227,0.00581932,0.0000039998135],"about_ca_topic_score_codex":0.001615339,"about_ca_topic_score_gemma":0.0016934734,"teacher_disagreement_score":0.02085332,"about_ca_system_score_codex":0.0017045415,"about_ca_system_score_gemma":0.0013415554,"threshold_uncertainty_score":0.069761276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49796313,0.0011488664,0.40854245,0.0017628111,0.00039039354,0.000096803786,0.00043502235,0.00033300414,0.08932752],"genre_scores_gemma":[0.91705596,0.0006007171,0.062327266,0.00053980516,0.0003016489,0.00014497818,0.00072814256,0.00023497299,0.018066581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794835,0.0008378295,0.000115817675,0.00040780928,0.00034766766,0.0003425832],"domain_scores_gemma":[0.9926144,0.0044288724,0.0007001258,0.00057507935,0.0006634194,0.0010180414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018952588,0.00093304174,0.0011179157,0.003650469,0.0029417523,0.004773,0.0015372268,0.0016916913,0.0054878797],"category_scores_gemma":[0.007492525,0.001039989,0.0014120652,0.0022229182,0.004840519,0.010365134,0.003549794,0.0042403974,0.0006474143],"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.000032136122,0.00001978088,0.00020005017,0.000021010943,0.0000042996667,0.000086120795,0.00022038344,0.0005326725,0.00028215226,0.9964042,0.00031741633,0.0018797922],"study_design_scores_gemma":[0.000008831992,0.000009473194,0.00007674023,0.0000145660215,0.000005631512,0.000073454474,0.000116857635,0.002580459,0.0002667538,0.995804,0.0010358677,0.0000072830076],"about_ca_topic_score_codex":0.0010824641,"about_ca_topic_score_gemma":0.0013500487,"teacher_disagreement_score":0.0054878797,"about_ca_system_score_codex":0.002091562,"about_ca_system_score_gemma":0.0008723805,"threshold_uncertainty_score":0.018358827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037155673,0.009828598,0.47676313,0.0075744637,0.0014596387,0.00024555225,0.0024804487,0.0010934838,0.46339908],"genre_scores_gemma":[0.72819036,0.0053700833,0.15240352,0.0014197754,0.001857955,0.0006408126,0.0032582122,0.00051961886,0.10633967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975431,0.0010096516,0.00017933645,0.00044580683,0.0005822588,0.00023998256],"domain_scores_gemma":[0.99690753,0.0015705533,0.00020292233,0.00041895104,0.00047712703,0.00042286073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014051434,0.0013606864,0.0018847039,0.0033240546,0.003512862,0.009668952,0.0014446512,0.0015535916,0.01743621],"category_scores_gemma":[0.00502601,0.0012126161,0.0015373015,0.003159136,0.0069704535,0.01085858,0.003023649,0.004420663,0.0031640518],"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.000005289204,0.000004356257,0.000022249893,0.000012471849,0.0000023068246,0.000006439432,0.00007257743,0.00022448783,0.000028506776,0.9976259,0.0008498337,0.0011455902],"study_design_scores_gemma":[0.000007941037,0.000002817449,0.000019501604,0.000008587603,0.0000023477107,0.0000135182245,0.000042479922,0.00077111984,0.000038046815,0.9906114,0.008478381,0.000003884255],"about_ca_topic_score_codex":0.0036916968,"about_ca_topic_score_gemma":0.0034223183,"teacher_disagreement_score":0.01743621,"about_ca_system_score_codex":0.003115404,"about_ca_system_score_gemma":0.0017719041,"threshold_uncertainty_score":0.05832994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63066345,0.0003922125,0.30844167,0.0010550878,0.00008918919,0.000057311707,0.00031561326,0.00025340015,0.05873201],"genre_scores_gemma":[0.9706077,0.0002700633,0.016832363,0.00018548897,0.00007475195,0.00007468212,0.00021077506,0.000042447533,0.011701746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.0001403221,0.00001768796,0.00006523929,0.00009547979,0.00010590018],"domain_scores_gemma":[0.99759173,0.0012175478,0.00045439744,0.00017665194,0.00026777125,0.0002918579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005240393,0.0004590936,0.00033447528,0.0014597859,0.0019031108,0.0018673126,0.0005936182,0.000733847,0.004400537],"category_scores_gemma":[0.0023568324,0.00033234403,0.00040713875,0.00077601447,0.0016254731,0.0018261098,0.0007648519,0.0011857812,0.0003069528],"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.0000408578,0.000024061246,0.00036708833,0.000017511307,0.0000060592133,0.00010753424,0.00019333525,0.0028421194,0.0013325543,0.99226224,0.00067389064,0.0021327864],"study_design_scores_gemma":[0.000016748243,0.000019500028,0.00024103803,0.000012762016,0.000006479588,0.0001667532,0.00017727407,0.024136709,0.0009513035,0.97216976,0.0020864487,0.000015213107],"about_ca_topic_score_codex":0.0012814794,"about_ca_topic_score_gemma":0.0017995712,"teacher_disagreement_score":0.004400537,"about_ca_system_score_codex":0.0010452429,"about_ca_system_score_gemma":0.0008126318,"threshold_uncertainty_score":0.014721334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49260345,0.0015849456,0.27256885,0.0025144776,0.00021668327,0.0001488971,0.0030783908,0.0030454064,0.22423898],"genre_scores_gemma":[0.8605747,0.00069803937,0.06968793,0.0005373644,0.00017296059,0.00016540318,0.0026285243,0.00063312886,0.0649019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926394,0.00016554704,0.000058008492,0.00018874828,0.00016156262,0.00016222513],"domain_scores_gemma":[0.99724233,0.001499981,0.00023411502,0.00029586643,0.00035196802,0.00037572338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701369,0.0006532967,0.00065433455,0.0018478753,0.0023182074,0.0038980595,0.00069574354,0.0010897394,0.024993574],"category_scores_gemma":[0.0016452419,0.0010095725,0.0005780642,0.0016205605,0.0024435157,0.004597301,0.0016062679,0.0016497037,0.0045783687],"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.00016477208,0.000045707096,0.0005968778,0.000089174086,0.000010536068,0.00036130095,0.0011426121,0.0006465136,0.007438225,0.975523,0.0033537566,0.010627452],"study_design_scores_gemma":[0.000075570446,0.00005506929,0.00076751463,0.00006823361,0.000025317055,0.00040895678,0.0005830744,0.007120552,0.0049971794,0.96214736,0.023711622,0.000039564846],"about_ca_topic_score_codex":0.002142456,"about_ca_topic_score_gemma":0.0041639083,"teacher_disagreement_score":0.024993574,"about_ca_system_score_codex":0.0013253568,"about_ca_system_score_gemma":0.0007519711,"threshold_uncertainty_score":0.083611846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4951333,0.0020751462,0.2314806,0.003544147,0.00092530675,0.0001570602,0.001044098,0.0008780423,0.2647622],"genre_scores_gemma":[0.910487,0.0012525016,0.038068168,0.0008061533,0.00060773175,0.00014264164,0.0007460205,0.00028395694,0.04760583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881786,0.0002495215,0.00008666101,0.00028418438,0.00032181435,0.00023982723],"domain_scores_gemma":[0.9966702,0.001284051,0.00036271778,0.00060191273,0.0005972315,0.0004838523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014270908,0.0007760566,0.00095224974,0.0031319372,0.0040594433,0.004874867,0.0008864259,0.0010378718,0.005770499],"category_scores_gemma":[0.0034622126,0.0008952778,0.0008480994,0.0024270364,0.0060883877,0.0092424,0.0021562807,0.0033777968,0.0012347221],"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.000022213408,0.000020471542,0.00013700478,0.000015493635,0.000004644342,0.000062176056,0.00027102535,0.00007297951,0.0004363116,0.9960821,0.0007080656,0.0021675443],"study_design_scores_gemma":[0.00000651914,0.000008279035,0.00010558802,0.000007853121,0.000008523304,0.0001309995,0.000121701676,0.00027738756,0.0005165673,0.9938176,0.0049916217,0.0000072253947],"about_ca_topic_score_codex":0.0008727887,"about_ca_topic_score_gemma":0.0011864688,"teacher_disagreement_score":0.005770499,"about_ca_system_score_codex":0.0013744837,"about_ca_system_score_gemma":0.00097161595,"threshold_uncertainty_score":0.019304276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20988183,0.0029021031,0.6984522,0.002606057,0.00029238398,0.000048823138,0.0004273342,0.00023643882,0.085152894],"genre_scores_gemma":[0.8448463,0.0023082057,0.12467514,0.0004053046,0.00058333145,0.000120652854,0.0002877615,0.00013318475,0.026640132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989334,0.0003816582,0.00005448193,0.00014758264,0.0003737159,0.00010911387],"domain_scores_gemma":[0.99680895,0.0018725918,0.00033384564,0.0003232933,0.0004003875,0.00026101214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020340919,0.00076896755,0.0011708651,0.002269,0.0013934193,0.0031351366,0.00085478654,0.00066864275,0.006060537],"category_scores_gemma":[0.0043522185,0.00055222964,0.00086041435,0.0018814701,0.0037223343,0.0064875623,0.0015698987,0.0023285334,0.0006111251],"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.000013350732,0.000008583941,0.00004040729,0.000017488075,0.000004212464,0.00001877471,0.000069772206,0.0014594502,0.00029268322,0.99414414,0.00039098616,0.003540206],"study_design_scores_gemma":[0.000005552597,0.000009684622,0.00003906478,0.000005289445,0.0000026625348,0.00003111734,0.000029255405,0.0073943296,0.00019510178,0.99083483,0.0014475276,0.000005561018],"about_ca_topic_score_codex":0.001484885,"about_ca_topic_score_gemma":0.0019646361,"teacher_disagreement_score":0.006060537,"about_ca_system_score_codex":0.0023039696,"about_ca_system_score_gemma":0.0008530026,"threshold_uncertainty_score":0.02027452},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.377222,0.0018406505,0.32554513,0.0034204584,0.0007230056,0.00014880269,0.0030370802,0.0015883757,0.28647456],"genre_scores_gemma":[0.93503565,0.0006370152,0.035918985,0.00049918017,0.00053386705,0.000103277045,0.0020571745,0.0002076654,0.025007026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988845,0.0002063107,0.000103542145,0.00031519527,0.00028007964,0.00021028933],"domain_scores_gemma":[0.99652797,0.0017084404,0.00039028624,0.00053163175,0.00046228673,0.0003794509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095523894,0.0005934298,0.00080185506,0.0014596136,0.0023258517,0.0048651104,0.00068115944,0.0008917408,0.012641913],"category_scores_gemma":[0.0026926913,0.00058408594,0.0010351446,0.0016397054,0.0024980118,0.009194862,0.00215925,0.0022401954,0.0014013675],"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.00007319417,0.00004490749,0.00052090076,0.000041283896,0.000012435799,0.00014928504,0.0002346553,0.00049092865,0.001246589,0.98870826,0.0022144564,0.0062631047],"study_design_scores_gemma":[0.000021891809,0.000015185026,0.00019393301,0.000009644147,0.000012818036,0.00019492614,0.00009639288,0.0015434581,0.001197484,0.9911595,0.0055432306,0.000011566335],"about_ca_topic_score_codex":0.0008356841,"about_ca_topic_score_gemma":0.001961923,"teacher_disagreement_score":0.012641913,"about_ca_system_score_codex":0.00076388236,"about_ca_system_score_gemma":0.0012135977,"threshold_uncertainty_score":0.042291403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10705862,0.002427034,0.85275656,0.001525481,0.00021970812,0.000108916196,0.00030674678,0.0001386623,0.03545826],"genre_scores_gemma":[0.72222275,0.0012040936,0.2686112,0.00026094198,0.00024961642,0.00030710988,0.00040328543,0.00011711477,0.006623848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932601,0.004080286,0.00037502454,0.000928458,0.0010658466,0.0002902137],"domain_scores_gemma":[0.9636243,0.02929209,0.0016578718,0.0029078762,0.0017688562,0.00074907724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011423018,0.0006751547,0.001429324,0.0044035064,0.0027886503,0.004584558,0.0018646758,0.001742039,0.008779353],"category_scores_gemma":[0.049112435,0.001034932,0.0015073695,0.0062669497,0.00728196,0.019913152,0.0029008647,0.0038579686,0.00047638122],"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.000035433695,0.0000076277543,0.0001565704,0.00003586987,0.000010758808,0.000037302292,0.0002513446,0.0024228785,0.00009752489,0.9887543,0.00033175934,0.007858708],"study_design_scores_gemma":[0.0000052502896,0.000013321195,0.00009683169,0.000015027857,0.000009997489,0.000042423104,0.00007382926,0.0054664845,0.00015037543,0.9929604,0.0011589634,0.000007088368],"about_ca_topic_score_codex":0.0011820788,"about_ca_topic_score_gemma":0.0015979938,"teacher_disagreement_score":0.011423018,"about_ca_system_score_codex":0.0024632788,"about_ca_system_score_gemma":0.0011692413,"threshold_uncertainty_score":0.060411453},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37894216,0.0007902222,0.46037182,0.0062238476,0.000727893,0.00013596726,0.0007010167,0.0006276782,0.1514794],"genre_scores_gemma":[0.90674996,0.00044364267,0.061508104,0.00065182993,0.0003042277,0.00008094974,0.0005793795,0.00033014535,0.029351799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992774,0.00008060045,0.00003612025,0.00021152923,0.00013689171,0.00025745155],"domain_scores_gemma":[0.9975351,0.0011732857,0.00016711939,0.00033371057,0.00043780045,0.0003529153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014029753,0.000440326,0.0006612001,0.0008807552,0.002238114,0.0029253545,0.0009727223,0.0026195005,0.008733384],"category_scores_gemma":[0.0059418464,0.00057466596,0.0007769402,0.0004953945,0.004068014,0.013153059,0.001255045,0.0018357104,0.0018860338],"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.00021218265,0.00003894949,0.0014252887,0.00007046408,0.000014217589,0.00036526748,0.0008357181,0.0021192725,0.003704698,0.9724823,0.0032261421,0.015505401],"study_design_scores_gemma":[0.000013955053,0.000033589513,0.0005374493,0.00005847727,0.000014775248,0.00045961494,0.0014396681,0.0055072377,0.007290323,0.9621324,0.022475097,0.000037430164],"about_ca_topic_score_codex":0.0021555708,"about_ca_topic_score_gemma":0.0020690882,"teacher_disagreement_score":0.008733384,"about_ca_system_score_codex":0.0012446239,"about_ca_system_score_gemma":0.00069568615,"threshold_uncertainty_score":0.02921611},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.618788,0.001263483,0.3252162,0.0011934993,0.0002528525,0.000087533626,0.00028443686,0.001000815,0.05191314],"genre_scores_gemma":[0.96506417,0.00023709652,0.022104902,0.00010853466,0.00017255245,0.00006816362,0.00013529853,0.000103913226,0.0120054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924797,0.00020592414,0.000045673565,0.00020059719,0.000207721,0.00009216552],"domain_scores_gemma":[0.9965796,0.002068324,0.00022604206,0.00034432503,0.00021503156,0.0005666597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009964876,0.00061439147,0.0009540701,0.002221824,0.0018982379,0.0036469274,0.00088433415,0.0006438264,0.0060364082],"category_scores_gemma":[0.0023997803,0.00061142305,0.00085072906,0.0014144313,0.0038796733,0.004627192,0.0027539623,0.0018932635,0.00064184266],"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.00006405097,0.000034572844,0.00047665616,0.000026810645,0.000008024445,0.00015091212,0.00057336723,0.0007000635,0.0029266672,0.9902734,0.0005026694,0.004262879],"study_design_scores_gemma":[0.000047475845,0.00004606426,0.00055986707,0.000010155082,0.000021791153,0.00044504408,0.00028701368,0.008021309,0.0026694664,0.983384,0.004485988,0.000021802294],"about_ca_topic_score_codex":0.00028203567,"about_ca_topic_score_gemma":0.00043135305,"teacher_disagreement_score":0.0060364082,"about_ca_system_score_codex":0.00089128216,"about_ca_system_score_gemma":0.00037278034,"threshold_uncertainty_score":0.020193756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11652919,0.0019183314,0.72849613,0.004438767,0.0006232337,0.000083571715,0.00048531467,0.0004328296,0.14699265],"genre_scores_gemma":[0.80496025,0.0017620695,0.13594912,0.0013705433,0.0012693816,0.00020498624,0.0006155664,0.0003059614,0.053562284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990841,0.00017990133,0.000059827693,0.00021923585,0.00029705864,0.00015988521],"domain_scores_gemma":[0.99840873,0.00068626157,0.00010381053,0.00027102698,0.00033119097,0.00019896233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015486637,0.0007131742,0.0011976755,0.0027435096,0.002083754,0.004076531,0.0010226893,0.0012456978,0.006125094],"category_scores_gemma":[0.0034255385,0.00057910534,0.001870125,0.001578752,0.003531848,0.009535853,0.0024886772,0.004466972,0.0010973205],"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.000005550781,0.0000054741136,0.000039581464,0.000010659456,0.0000028255308,0.000007333708,0.00006023165,0.000121950885,0.00016211523,0.99736685,0.00055953895,0.0016578585],"study_design_scores_gemma":[0.0000046897285,0.000005925756,0.00006833599,0.000005814911,0.000003847837,0.00003655234,0.000017794016,0.0017344083,0.00023854221,0.9956903,0.0021883177,0.000005373617],"about_ca_topic_score_codex":0.0007282718,"about_ca_topic_score_gemma":0.0007548634,"teacher_disagreement_score":0.006125094,"about_ca_system_score_codex":0.0017834251,"about_ca_system_score_gemma":0.0008505629,"threshold_uncertainty_score":0.020490468},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04203318,0.005870061,0.3001394,0.06014695,0.01212555,0.00010933399,0.0009762189,0.0011761923,0.57742316],"genre_scores_gemma":[0.5813293,0.010095495,0.16734274,0.023385774,0.013670422,0.00032228485,0.001072203,0.0012837071,0.20149808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815136,0.00035679503,0.00009636935,0.00047981876,0.00065475365,0.00026085167],"domain_scores_gemma":[0.9933241,0.0038773033,0.00018341896,0.001229786,0.0010502528,0.0003352476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022935432,0.0008384898,0.0013778743,0.0032534595,0.0051447214,0.0027160186,0.0025371197,0.0023633486,0.016968343],"category_scores_gemma":[0.007136739,0.0006786133,0.0018104695,0.0033702638,0.008039429,0.013250662,0.0045081573,0.006320297,0.002629836],"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.000019291558,0.00001210696,0.000079723715,0.00003995405,0.0000075618614,0.000041991174,0.00016506492,0.00030280015,0.00016932712,0.98047835,0.013457054,0.0052267737],"study_design_scores_gemma":[0.0000050139392,0.0000042742563,0.00006897076,0.0000074557292,0.0000062035874,0.000038092327,0.00003376293,0.00038876745,0.00019234486,0.9817067,0.017539257,0.000009171622],"about_ca_topic_score_codex":0.0052827243,"about_ca_topic_score_gemma":0.0050108237,"teacher_disagreement_score":0.016968343,"about_ca_system_score_codex":0.0027389133,"about_ca_system_score_gemma":0.0013927241,"threshold_uncertainty_score":0.056764722},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15678953,0.008647078,0.082211524,0.003976361,0.0006145217,0.000052536685,0.00048090733,0.00048275822,0.74674475],"genre_scores_gemma":[0.83665246,0.003912353,0.014222974,0.0004567485,0.0007609213,0.000033161206,0.00037703518,0.000087859786,0.14349656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994326,0.00010300324,0.000030468644,0.00010815813,0.00023908763,0.000086571235],"domain_scores_gemma":[0.9994981,0.00011845065,0.00006129078,0.00009866482,0.0001253032,0.00009812891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074901304,0.00042195505,0.00060995365,0.0014260074,0.0014545725,0.0041961744,0.00045394577,0.00064527,0.014959854],"category_scores_gemma":[0.00154663,0.00023796402,0.0003780653,0.0012120676,0.0030612228,0.0060591935,0.0020564701,0.0018318623,0.0019527114],"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.0000066775997,0.0000036455988,0.00005359217,0.000009872609,0.0000014823303,0.000010643921,0.00009242543,0.000040030995,0.00017552316,0.9957841,0.0007775149,0.0030444744],"study_design_scores_gemma":[0.000006014993,0.000010040014,0.00027894636,0.000011711008,0.000008402028,0.00012331652,0.00013903249,0.00038360796,0.0006522545,0.96576136,0.032619763,0.000005532722],"about_ca_topic_score_codex":0.0005867494,"about_ca_topic_score_gemma":0.00064372947,"teacher_disagreement_score":0.014959854,"about_ca_system_score_codex":0.0011759503,"about_ca_system_score_gemma":0.00077711267,"threshold_uncertainty_score":0.05004567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20096263,0.0025007036,0.6534644,0.011935926,0.00025905322,0.00013628641,0.0007629712,0.00023595928,0.12974215],"genre_scores_gemma":[0.95764124,0.0010793515,0.028424127,0.00040200248,0.00027333523,0.00019615256,0.00040594095,0.00007319598,0.011504692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964444,0.001826628,0.0001987264,0.000570201,0.00051164575,0.00044847024],"domain_scores_gemma":[0.96025145,0.032015007,0.001945557,0.0024418535,0.0021331299,0.0012129333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005281865,0.0007360082,0.0017795643,0.0017790112,0.0021616307,0.006672432,0.0015168958,0.002982917,0.009719233],"category_scores_gemma":[0.023627086,0.0007350879,0.0011074714,0.0014947292,0.009307313,0.012992841,0.0021434706,0.004877734,0.000826284],"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.000012759238,0.000010762139,0.00007125917,0.0000128844395,0.0000036637255,0.000013558585,0.000071702416,0.0010257472,0.00004848256,0.9976413,0.00034767954,0.0007403199],"study_design_scores_gemma":[0.000009950605,0.000002126379,0.000024282353,0.0000036462543,0.0000011866409,0.000006785154,0.000025560059,0.002224898,0.000032931064,0.99731857,0.00034775888,0.0000022686706],"about_ca_topic_score_codex":0.002802731,"about_ca_topic_score_gemma":0.0017603356,"teacher_disagreement_score":0.009719233,"about_ca_system_score_codex":0.0026367577,"about_ca_system_score_gemma":0.0019746253,"threshold_uncertainty_score":0.032514036},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027865652,0.018994372,0.0004695992,0.40565684,0.5004561,0.00006580867,0.0008370329,0.0004565597,0.07278498],"genre_scores_gemma":[0.004310717,0.008066359,0.00021792589,0.15112878,0.098103754,0.0000778442,0.00041707116,0.0005297827,0.7371478],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982278,0.00027085695,0.00014637648,0.0004035622,0.0007351857,0.00021629616],"domain_scores_gemma":[0.99608237,0.0011302154,0.0003726962,0.00035544139,0.0016791753,0.0003801492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017606684,0.0015988621,0.0023946555,0.0015877918,0.0050600343,0.0049149464,0.0017320646,0.00870991,0.110291824],"category_scores_gemma":[0.014904782,0.0007678633,0.0008388662,0.0011293422,0.001894016,0.0045435424,0.003021449,0.009735653,0.10557101],"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.00001601697,0.0000025200236,0.000010267806,0.000022556032,0.0000018149389,0.000026083764,0.000009009444,0.0000122459605,0.000017137076,0.0007974054,0.996851,0.0022340135],"study_design_scores_gemma":[0.000011024818,0.0000063544785,0.00009607204,0.0000907103,0.0000041967783,0.00003171799,0.000024705081,0.000029514273,0.000086686734,0.001439057,0.9981724,0.000007614633],"about_ca_topic_score_codex":0.010722136,"about_ca_topic_score_gemma":0.013148213,"teacher_disagreement_score":0.110291824,"about_ca_system_score_codex":0.0043871077,"about_ca_system_score_gemma":0.0023958748,"threshold_uncertainty_score":0.36896288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55475986,0.0017124149,0.3043726,0.0023972571,0.0010110583,0.00013577189,0.0012309344,0.00057564134,0.13380449],"genre_scores_gemma":[0.9225441,0.0011731436,0.031804815,0.0003382721,0.0009235506,0.00016519327,0.00079637096,0.00015700082,0.04209739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.00027594113,0.000051277486,0.00016639498,0.00040745456,0.00022260206],"domain_scores_gemma":[0.9966343,0.0017180507,0.00045953374,0.0002046086,0.00043476422,0.0005487859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011903198,0.0007683596,0.0007803582,0.0018329648,0.0019143313,0.003684086,0.00065345794,0.0008842448,0.0063081444],"category_scores_gemma":[0.0021011701,0.00033764806,0.0007109339,0.0010501691,0.002909127,0.0037573194,0.0013091861,0.0012185136,0.0011065719],"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.000122372,0.000025420339,0.00024931502,0.000037791582,0.0000074585914,0.00030922273,0.0004609831,0.0008269036,0.0029671157,0.9892463,0.00097546395,0.004771594],"study_design_scores_gemma":[0.00004702818,0.000084067855,0.0005329641,0.000021353451,0.000010051606,0.00051208714,0.00019752303,0.008603611,0.0016675658,0.9812309,0.007063881,0.000028830033],"about_ca_topic_score_codex":0.00091858563,"about_ca_topic_score_gemma":0.0008558562,"teacher_disagreement_score":0.0063081444,"about_ca_system_score_codex":0.0012914612,"about_ca_system_score_gemma":0.00109515,"threshold_uncertainty_score":0.021102846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33600473,0.0024954693,0.44613165,0.0030077416,0.00042494503,0.00007016821,0.0008777901,0.000334031,0.21065353],"genre_scores_gemma":[0.8783768,0.0017562223,0.04432335,0.0005525118,0.00045768902,0.00006127007,0.0010258246,0.00030832316,0.07313808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991242,0.00021908831,0.000050913113,0.00019269054,0.00029234387,0.000120794444],"domain_scores_gemma":[0.99858475,0.0005227286,0.00017763585,0.00018456294,0.00027040683,0.00025996167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915991,0.0011486838,0.0011358146,0.003436175,0.002077136,0.0032889848,0.00091746385,0.00077440817,0.012542274],"category_scores_gemma":[0.002354422,0.0006943561,0.000942272,0.0030946706,0.0038620112,0.007882387,0.004143313,0.0034415512,0.001441137],"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.0000117066365,0.0000054567386,0.00010012582,0.000012031007,0.0000040839313,0.000036366306,0.00013654718,0.00044663672,0.00021277671,0.99637574,0.000489543,0.0021690705],"study_design_scores_gemma":[0.000004251552,0.000009809181,0.00012812334,0.0000075953462,0.0000047860462,0.00008847641,0.000110177694,0.0022150788,0.00020718732,0.99421906,0.003000239,0.000005183846],"about_ca_topic_score_codex":0.0014579293,"about_ca_topic_score_gemma":0.0017108113,"teacher_disagreement_score":0.012542274,"about_ca_system_score_codex":0.0014749434,"about_ca_system_score_gemma":0.0004682455,"threshold_uncertainty_score":0.041958094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71401256,0.00072217925,0.2462441,0.0009406771,0.00020951337,0.000080345824,0.00036365926,0.00049265166,0.03693438],"genre_scores_gemma":[0.94742936,0.0003883985,0.040402707,0.00016084238,0.00018534236,0.00007582549,0.00030122107,0.00012745989,0.010928736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985474,0.00025667727,0.00014905307,0.00030055354,0.00048078824,0.00026559344],"domain_scores_gemma":[0.9917121,0.004385489,0.00084497407,0.0010342427,0.0010275902,0.0009957177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018090663,0.0005620348,0.0011013944,0.0030984022,0.0020461446,0.0054360875,0.0012588996,0.001440469,0.0044282163],"category_scores_gemma":[0.0075190663,0.00067115686,0.0009838354,0.0027299633,0.0034335258,0.009709443,0.0021336116,0.0020873067,0.00043389344],"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.000049435086,0.00002657191,0.0012220999,0.000029056842,0.000006529624,0.000091902744,0.0003521276,0.0005940462,0.0016383381,0.98989874,0.00055121403,0.005540006],"study_design_scores_gemma":[0.0000114325785,0.00002049804,0.0007424395,0.000015195329,0.000019438014,0.00024256435,0.00016481112,0.006162396,0.0017124763,0.9882216,0.002669767,0.000017375238],"about_ca_topic_score_codex":0.0010128311,"about_ca_topic_score_gemma":0.0018343359,"teacher_disagreement_score":0.0054360875,"about_ca_system_score_codex":0.0018354879,"about_ca_system_score_gemma":0.00084019254,"threshold_uncertainty_score":0.01481384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3738153,0.0006077277,0.470925,0.0019364393,0.0003340734,0.00017645425,0.0015819807,0.0009925184,0.14963047],"genre_scores_gemma":[0.7377655,0.0005632358,0.16847806,0.0006151725,0.00027300796,0.00025095875,0.002415874,0.00065876194,0.088979445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988335,0.00021050773,0.00010189989,0.0003111275,0.0003152068,0.00022781205],"domain_scores_gemma":[0.99793774,0.00086481415,0.00022414571,0.00043578143,0.0002972596,0.00024022545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007523205,0.0007707073,0.001016598,0.00247741,0.0021848942,0.0029644435,0.001670721,0.0012242502,0.01657722],"category_scores_gemma":[0.0018800909,0.00078322005,0.00091125304,0.002728999,0.0028028414,0.0069292015,0.0030339977,0.0028266325,0.0033445167],"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.000087344466,0.000069808906,0.00019283369,0.000052710708,0.000009919078,0.000116967574,0.0004262377,0.0014501059,0.0028593368,0.98165846,0.0015132795,0.011562841],"study_design_scores_gemma":[0.00002192539,0.000021409403,0.00022515732,0.000015476511,0.000012483564,0.00010990551,0.00018828842,0.0034892827,0.002805025,0.9806789,0.012415577,0.000016514237],"about_ca_topic_score_codex":0.0013376577,"about_ca_topic_score_gemma":0.0014774413,"teacher_disagreement_score":0.01657722,"about_ca_system_score_codex":0.0010664851,"about_ca_system_score_gemma":0.00061642606,"threshold_uncertainty_score":0.05545628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025908463,0.0028897543,0.8298744,0.007409731,0.0011002134,0.00009315127,0.00040750022,0.000570185,0.13174662],"genre_scores_gemma":[0.6704154,0.0019510291,0.26842916,0.0030727503,0.0022087845,0.00026684435,0.000632109,0.00057680835,0.052447125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980628,0.00083092484,0.00013261758,0.00032398346,0.00047424133,0.00017537738],"domain_scores_gemma":[0.9981054,0.0008792469,0.00012070971,0.00025891396,0.00044199737,0.00019357467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027321165,0.0008722761,0.00081517565,0.0027881782,0.003353514,0.005471599,0.0026493904,0.0021135441,0.008149809],"category_scores_gemma":[0.004112065,0.0008265415,0.0016603288,0.0019366108,0.009927276,0.011182723,0.0031334176,0.004694367,0.0013848626],"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.0000025157083,0.0000044115523,0.000014338633,0.000008767029,9.671386e-7,0.00002091983,0.0001762612,0.00009587012,0.00013416767,0.9985702,0.00032133778,0.0006502342],"study_design_scores_gemma":[0.0000055328414,0.0000088028555,0.00003991084,0.000012706006,0.0000037332472,0.00006184177,0.00008827887,0.0015319304,0.00033189516,0.9878633,0.010041617,0.000010374494],"about_ca_topic_score_codex":0.003500768,"about_ca_topic_score_gemma":0.003650131,"teacher_disagreement_score":0.008149809,"about_ca_system_score_codex":0.0032999748,"about_ca_system_score_gemma":0.0030730504,"threshold_uncertainty_score":0.02726382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28925788,0.0010759471,0.5897119,0.0053413077,0.00034054453,0.0002836294,0.0019882503,0.0014811482,0.11051937],"genre_scores_gemma":[0.7936958,0.00061422307,0.168294,0.0005828725,0.0005716642,0.00028654555,0.0025373893,0.0005063729,0.032911126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883693,0.00027127928,0.00005103486,0.00035923845,0.0002712847,0.00021027973],"domain_scores_gemma":[0.9912503,0.005426575,0.00071684335,0.00081953494,0.0008653851,0.0009214912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078258297,0.00071217923,0.0009117919,0.002647938,0.0038354865,0.005163808,0.001895237,0.0013466496,0.01604105],"category_scores_gemma":[0.0063913055,0.0008759458,0.0014452671,0.00371287,0.0033153174,0.0059284694,0.0022357788,0.004223861,0.0014051307],"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.00006985829,0.00008886751,0.00062471296,0.00006810447,0.000011255069,0.00007025756,0.00040363363,0.002397321,0.00091995334,0.981954,0.0040087826,0.009383259],"study_design_scores_gemma":[0.000022664484,0.000015260728,0.00026959582,0.000017859336,0.000015531532,0.00008069645,0.0002900426,0.019154105,0.0010764814,0.97444135,0.0046007796,0.00001559809],"about_ca_topic_score_codex":0.004399825,"about_ca_topic_score_gemma":0.008280827,"teacher_disagreement_score":0.01604105,"about_ca_system_score_codex":0.0023243034,"about_ca_system_score_gemma":0.0017598514,"threshold_uncertainty_score":0.053662598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07343996,0.02965705,0.4986648,0.040023353,0.011970339,0.00014191038,0.0015590371,0.0009529016,0.34359065],"genre_scores_gemma":[0.7191617,0.020394435,0.13837129,0.011192484,0.019957563,0.00026669735,0.00095503853,0.00068223,0.08901853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925286,0.00020874155,0.000052157524,0.00020894669,0.00020756121,0.00006969278],"domain_scores_gemma":[0.996741,0.0022000081,0.00015264691,0.00031772567,0.0002947941,0.0002937644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020232718,0.0010240093,0.0011600268,0.0023753287,0.0023177047,0.0038420726,0.001255677,0.0015574411,0.008860034],"category_scores_gemma":[0.0046246885,0.00041389512,0.0011621376,0.0023609833,0.0066074226,0.01153065,0.004470283,0.0065180855,0.0011158118],"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.00002412164,0.000012944377,0.00015078284,0.00008060071,0.000008209119,0.00008940082,0.00022693501,0.00025637017,0.0008304251,0.98791564,0.0051138056,0.005290695],"study_design_scores_gemma":[0.0000042359216,0.000014617839,0.00026191905,0.00002384296,0.00000889985,0.00010248302,0.000073161165,0.00091723015,0.0003351772,0.9781425,0.020102028,0.000013905248],"about_ca_topic_score_codex":0.0013144448,"about_ca_topic_score_gemma":0.0014943506,"teacher_disagreement_score":0.008860034,"about_ca_system_score_codex":0.0015082059,"about_ca_system_score_gemma":0.00063478516,"threshold_uncertainty_score":0.02963972},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24433841,0.0035270855,0.24698316,0.030026736,0.0034541667,0.00013503116,0.0012442971,0.0014548695,0.46883622],"genre_scores_gemma":[0.92111456,0.0017839443,0.03906587,0.0026642084,0.0015550627,0.00011999557,0.0007809922,0.00024362741,0.03267167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987016,0.00028162694,0.00007428205,0.00029181308,0.00044909836,0.00020157437],"domain_scores_gemma":[0.99357903,0.0040994985,0.0003143801,0.0008397228,0.0006105957,0.0005568486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020945708,0.0012673911,0.0012062686,0.0021326614,0.0023417617,0.0033181217,0.0018666347,0.0018559041,0.01969997],"category_scores_gemma":[0.0073563415,0.0008619205,0.0019674432,0.0021122703,0.0069120587,0.01020546,0.0068518007,0.006399596,0.001807789],"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.000071443574,0.000047686175,0.00038632084,0.000103338345,0.0000146780485,0.00020675111,0.0003086926,0.0006989812,0.00091519917,0.9883107,0.0045628357,0.004373345],"study_design_scores_gemma":[0.00003058241,0.000020085645,0.00029363245,0.00002470025,0.000014574413,0.00013940499,0.00009510539,0.0021725125,0.00040999296,0.9904433,0.0063425847,0.0000135481805],"about_ca_topic_score_codex":0.001891403,"about_ca_topic_score_gemma":0.0026678182,"teacher_disagreement_score":0.01969997,"about_ca_system_score_codex":0.0018703387,"about_ca_system_score_gemma":0.0011114706,"threshold_uncertainty_score":0.06590295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5176539,0.0058123395,0.4009372,0.005452873,0.00037933284,0.000061846426,0.0010122935,0.0004109283,0.068279184],"genre_scores_gemma":[0.94925636,0.0017448982,0.03351556,0.0003887126,0.00040837826,0.00005836408,0.00061909755,0.00010487776,0.013903775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986864,0.00045096534,0.000108361186,0.00035455445,0.00025392263,0.00014587292],"domain_scores_gemma":[0.9927753,0.0044495175,0.00070891966,0.0008257074,0.00057676795,0.00066380936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019218618,0.0008383204,0.0010075215,0.0028480499,0.001812042,0.0053109806,0.0010591621,0.0012878175,0.0056037325],"category_scores_gemma":[0.00502771,0.00092165306,0.001205561,0.0024325843,0.0054440238,0.014811046,0.002324541,0.004134545,0.0005268395],"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.000030624047,0.0000172574,0.00023665592,0.000026281135,0.000008689648,0.00004397004,0.0004050793,0.00046423177,0.0005505895,0.99576086,0.00024711117,0.0022087577],"study_design_scores_gemma":[0.000009552394,0.000015382613,0.00025339943,0.000007272568,0.000007816224,0.00005842929,0.000117097814,0.0012847116,0.00028944312,0.9969176,0.0010317692,0.0000075949424],"about_ca_topic_score_codex":0.0015963705,"about_ca_topic_score_gemma":0.001724006,"teacher_disagreement_score":0.0056037325,"about_ca_system_score_codex":0.0015730582,"about_ca_system_score_gemma":0.0006620854,"threshold_uncertainty_score":0.018746376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44237095,0.004209663,0.35714516,0.011689997,0.00065078493,0.00014349338,0.0016951819,0.0006382981,0.18145637],"genre_scores_gemma":[0.93667024,0.0015664909,0.02584226,0.000914641,0.0009097989,0.00012600127,0.0006236936,0.00022219123,0.033124674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816006,0.0006405582,0.00006539753,0.00031429302,0.00053163274,0.0002879473],"domain_scores_gemma":[0.98701197,0.007947561,0.0014021905,0.0012468137,0.0011942171,0.0011972167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019967204,0.00084280816,0.0016815317,0.005171179,0.0034853115,0.007176742,0.0012543937,0.0017577609,0.013154669],"category_scores_gemma":[0.010575931,0.0009136595,0.0007230999,0.004020116,0.0061944746,0.010828291,0.0026419996,0.0037280896,0.0011172428],"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.000022435983,0.000014919811,0.000096334086,0.000016398651,0.0000033219274,0.000012835778,0.0001086974,0.0011335548,0.000100448065,0.9953674,0.0011232932,0.0020003375],"study_design_scores_gemma":[0.0000075710655,0.0000064400006,0.00007595376,0.000007914012,0.0000038047676,0.000028125067,0.00005928952,0.0057937936,0.00011054885,0.99271023,0.0011882634,0.000008073681],"about_ca_topic_score_codex":0.0020789208,"about_ca_topic_score_gemma":0.0022166618,"teacher_disagreement_score":0.013154669,"about_ca_system_score_codex":0.00195937,"about_ca_system_score_gemma":0.0013953042,"threshold_uncertainty_score":0.044006705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6255073,0.0013920609,0.20176628,0.0027711196,0.00033819015,0.000051629962,0.00039927967,0.0008501288,0.16692404],"genre_scores_gemma":[0.9426407,0.0006975165,0.019243667,0.00031548782,0.00025233394,0.000054363474,0.00027336858,0.00021221834,0.03631028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963045,0.00010236296,0.000017592503,0.00007483644,0.00009744514,0.00007724013],"domain_scores_gemma":[0.9973259,0.0013809203,0.00036797434,0.00034402637,0.0002301557,0.00035099336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090625184,0.00041687783,0.0005129309,0.0019089346,0.0014051795,0.0022822134,0.0007520513,0.0009413231,0.008469339],"category_scores_gemma":[0.0039399257,0.00040186258,0.00055012875,0.0015573684,0.0024940954,0.0043665324,0.0012371853,0.0021318884,0.00092515256],"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.000021841566,0.000019349834,0.00028644656,0.0000146594975,0.000001549039,0.000030230227,0.00011150737,0.00097272126,0.00025252555,0.9909305,0.0010360072,0.006322566],"study_design_scores_gemma":[0.0000065413246,0.0000068315,0.00013223792,0.000008434561,0.0000031561722,0.000058084643,0.000034529305,0.004304327,0.00023857005,0.9935289,0.0016724254,0.0000059302406],"about_ca_topic_score_codex":0.00082579046,"about_ca_topic_score_gemma":0.001358964,"teacher_disagreement_score":0.008469339,"about_ca_system_score_codex":0.0011697632,"about_ca_system_score_gemma":0.0006239265,"threshold_uncertainty_score":0.02833277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80051136,0.0011395873,0.09026537,0.0016141472,0.00020452181,0.00006846534,0.00037332624,0.00031631257,0.10550698],"genre_scores_gemma":[0.9707106,0.0005452875,0.01045254,0.00018546298,0.00021044872,0.000043761982,0.00023196542,0.000056983106,0.017562894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924976,0.00017717587,0.000056292814,0.00016660934,0.00017892549,0.0001711698],"domain_scores_gemma":[0.9985877,0.00055836164,0.00017604556,0.00016665368,0.0001903842,0.00032091737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010165045,0.00040597413,0.0005523915,0.0019349958,0.002140245,0.0036806907,0.0006221961,0.000711512,0.0046492675],"category_scores_gemma":[0.001900409,0.00060744747,0.0008165128,0.001867846,0.0029987935,0.00754588,0.0018750097,0.0021967962,0.00041006305],"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.00002936113,0.000019060064,0.00028367242,0.0000104296605,0.0000043248892,0.00010125973,0.00036647863,0.00015102669,0.00056467095,0.9964424,0.00027562233,0.0017518033],"study_design_scores_gemma":[0.000021849022,0.00001998702,0.0006569733,0.000006578485,0.0000118798325,0.00026440588,0.00023815905,0.0011378513,0.00077051244,0.9931149,0.0037456995,0.000011245712],"about_ca_topic_score_codex":0.0007034822,"about_ca_topic_score_gemma":0.00079857925,"teacher_disagreement_score":0.0046492675,"about_ca_system_score_codex":0.0011070446,"about_ca_system_score_gemma":0.00047785928,"threshold_uncertainty_score":0.015553415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3632001,0.0018750061,0.5902722,0.0018594507,0.00034107067,0.00007734076,0.00053958397,0.00030620646,0.04152906],"genre_scores_gemma":[0.91047007,0.0008475715,0.06991782,0.0004985432,0.00030867313,0.00011659911,0.00043455188,0.00013120384,0.017274836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764603,0.00062744296,0.00025080694,0.00038970562,0.00074478297,0.00034131185],"domain_scores_gemma":[0.9950118,0.0026757654,0.00058484037,0.0003757033,0.0008459809,0.0005058973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029246593,0.0006744109,0.0008450723,0.0022355395,0.0019617297,0.0040910975,0.001231152,0.0010043881,0.0055167587],"category_scores_gemma":[0.004921833,0.0007946471,0.0012923916,0.0023707512,0.004183084,0.010156514,0.0030301488,0.0028143253,0.0005576212],"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.000037440794,0.00003116078,0.00016945969,0.00002457254,0.000008922165,0.00006591826,0.0002486472,0.0003962133,0.0010231585,0.99449277,0.0002946916,0.003207038],"study_design_scores_gemma":[0.000012487267,0.00001333356,0.00013979989,0.000007146291,0.000009770067,0.00006654901,0.00007759663,0.003958757,0.0005978791,0.99382126,0.001284209,0.000011126929],"about_ca_topic_score_codex":0.0017931517,"about_ca_topic_score_gemma":0.002173738,"teacher_disagreement_score":0.0055167587,"about_ca_system_score_codex":0.0016110222,"about_ca_system_score_gemma":0.0012736316,"threshold_uncertainty_score":0.018455446},"labels":[],"label_agreement":null}]}