{"meta":{"query_hash":"94f91cfdcf51","filters":{"venue":"Journal of Combinatorial Theory Series A"},"cohort_total":210,"direct_labels_cover":0,"predictions_cover":210,"exported":210,"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/94f91cfdcf51","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorial+Theory+Series+A"},"results":[{"id":"W1412351404","doi":"10.1016/j.jcta.2015.08.005","title":"Littlewood–Richardson rules for symmetric skew quasisymmetric Schur functions","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"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; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Skew; Symmetric function; Combinatorics; Conjecture; Schur polynomial; Discrete mathematics; Pure mathematics; Macdonald polynomials; Computer science; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.06107878497430066,"score_gpt":0.3255539238221512,"score_spread":0.26447513884785057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1412351404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36748287,0.007070825,0.46611297,0.0018632374,0.12564167,0.0039476375,0.0001994659,0.0006701329,0.027011186],"genre_scores_gemma":[0.8427042,0.00022079727,0.14262567,0.00010761961,0.008693359,0.00014458744,0.00001357883,0.00034513613,0.0051450916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627715,0.00040456996,0.0014754588,0.00026140857,0.0010483008,0.0005331265],"domain_scores_gemma":[0.99111456,0.0038702933,0.0016659087,0.0005857589,0.0022972208,0.00046627643],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004349904,0.0004251868,0.0011274122,0.00091659214,0.0002354086,0.00014692586,0.00073935644,0.00027457773,0.000049480765],"category_scores_gemma":[0.025330044,0.0003619481,0.0005230987,0.0014841359,0.0001426658,0.0009460039,0.0001486956,0.0005308793,0.000039945575],"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.0013862011,0.00068788585,0.0000251424,0.00015799535,0.00025929787,0.000014157539,0.00047301975,0.000006368273,0.000062955405,0.9841634,0.010747054,0.0020165227],"study_design_scores_gemma":[0.0044116797,0.0024898916,0.0000067745373,0.00012924292,0.00035466815,0.00017175935,0.0014195454,0.000019713978,0.0010335473,0.9464298,0.04317134,0.0003620288],"about_ca_topic_score_codex":0.0000015347445,"about_ca_topic_score_gemma":3.8727484e-7,"teacher_disagreement_score":0.47522128,"about_ca_system_score_codex":0.00042855262,"about_ca_system_score_gemma":0.00040467642,"threshold_uncertainty_score":0.99988323},"labels":[],"label_agreement":null},{"id":"W1505344614","doi":"10.1016/j.jcta.2010.04.002","title":"Bases for diagonally alternating harmonic polynomials of low degree","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Combinatorics; Bijection; Diagonal; Degree (music); Mathematics; Operator (biology); Space (punctuation); Basis (linear algebra); Arithmetic; Physics; Geometry; Chemistry; Computer science","score_opus":0.03908528554895011,"score_gpt":0.3204968679921958,"score_spread":0.28141158244324566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505344614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9683172,0.00013233809,0.010856966,0.00022501664,0.018641876,0.0006199043,0.00003457594,0.000049074384,0.001123027],"genre_scores_gemma":[0.9459972,0.000023355062,0.051507045,0.000029591081,0.0021209712,0.000021059122,0.0000011294003,0.00008840763,0.00021128933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711984,0.00018018931,0.0015595208,0.0001745172,0.0005997829,0.0003661216],"domain_scores_gemma":[0.9905109,0.0052662794,0.002462857,0.0004807679,0.0011069637,0.00017227304],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029296253,0.0003107741,0.0010019009,0.00018652083,0.00013471866,0.000059414568,0.00080703385,0.00018978203,0.00010671606],"category_scores_gemma":[0.01304242,0.00026505828,0.00046216516,0.00018071236,0.00021908991,0.0005769294,0.00013168486,0.0005388793,0.000001742892],"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.0012959499,0.00042211017,0.000036571164,0.00031312782,0.00020997808,0.000012347766,0.00042465585,0.0000040508357,0.04279952,0.95257425,0.00057086645,0.0013365468],"study_design_scores_gemma":[0.0025886795,0.00082631916,0.000010609552,0.00021692952,0.00014676413,0.00009061325,0.00021428487,0.00001440033,0.14676985,0.84695166,0.0019539944,0.00021591574],"about_ca_topic_score_codex":0.0000014505301,"about_ca_topic_score_gemma":0.0000026659611,"teacher_disagreement_score":0.105622634,"about_ca_system_score_codex":0.000064802705,"about_ca_system_score_gemma":0.00030336663,"threshold_uncertainty_score":0.99998015},"labels":[],"label_agreement":null},{"id":"W1537254652","doi":"10.1016/j.jcta.2017.05.003","title":"Multiplicative structures of the immaculate basis of non-commutative symmetric functions","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Mathematics; Commutative property; Multiplicative function; Symmetric function; Complete homogeneous symmetric polynomial; Commutative algebra; Pure mathematics; Polytope; Commutative ring; Ring of symmetric functions; Algebra over a field; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.025214483721400043,"score_gpt":0.32178409444127204,"score_spread":0.296569610719872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537254652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755202,0.00015592933,0.0069239354,0.00033634988,0.0102808215,0.000757366,0.00006007284,0.000019683546,0.005945658],"genre_scores_gemma":[0.9937383,0.000025151452,0.00569967,0.0000049729642,0.00026311493,0.0000074384834,3.150189e-7,0.00003988449,0.00022114391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744844,0.0003543543,0.0011825539,0.00013909131,0.00065685314,0.00021871107],"domain_scores_gemma":[0.9901358,0.0021077255,0.0051648957,0.0011866238,0.0013178068,0.000087152715],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0011361239,0.00026752765,0.0009453149,0.00018402265,0.00044704662,0.000048153477,0.0014701567,0.00014503118,0.00004356283],"category_scores_gemma":[0.009030143,0.00017543806,0.0004883094,0.00032492084,0.00074245676,0.0005273451,0.00039520426,0.0004918788,9.712628e-7],"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.00078997615,0.00029070335,0.0002680918,0.00014659358,0.00044138185,0.0000042133343,0.0020841057,0.000022484093,0.003588844,0.9915093,0.00016297091,0.0006913117],"study_design_scores_gemma":[0.001934932,0.00048068177,0.00123291,0.00021272567,0.00026774497,0.0000422863,0.0014066376,0.000017636974,0.07368598,0.9203872,0.00018450018,0.00014674001],"about_ca_topic_score_codex":0.000007885019,"about_ca_topic_score_gemma":0.0000014116887,"teacher_disagreement_score":0.0711221,"about_ca_system_score_codex":0.000096612945,"about_ca_system_score_gemma":0.0001722992,"threshold_uncertainty_score":0.9993172},"labels":[],"label_agreement":null},{"id":"W1579458986","doi":"10.1006/jcta.2000.3159","title":"Orthogonal Frames in the Leech Lattice and a Type II Code over Z22","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","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":"University of Victoria","funders":"","keywords":"Leech; Lattice (music); Basis (linear algebra); Mathematics; Orthogonal basis; Combinatorics; Code (set theory); Type (biology); Discrete mathematics; Pure mathematics; Computer science; Physics; Geometry; Programming language; Biology; Quantum mechanics","score_opus":0.011505245931273068,"score_gpt":0.2479558214037235,"score_spread":0.23645057547245044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579458986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98907864,0.0007554993,0.0026280012,0.0013092627,0.0028770359,0.00008787047,9.388554e-7,0.000022586408,0.0032401404],"genre_scores_gemma":[0.9982181,0.00018819513,0.00078101386,0.00043965885,0.00031494186,0.000001446859,1.5754873e-7,0.000006477167,0.00004996447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854213,0.00047093144,0.00032196948,0.00013163283,0.00033378808,0.00019952224],"domain_scores_gemma":[0.9987697,0.0005681651,0.00021225163,0.00027001006,0.000115795345,0.00006409062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025080526,0.0001280014,0.00022216335,0.00014455078,0.00021379613,0.00017178098,0.00080638373,0.00007271431,0.00004948769],"category_scores_gemma":[0.0002101054,0.00008649544,0.00009208777,0.0006238135,0.00014072283,0.00073999376,0.00018088582,0.00039477617,0.0000012441726],"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.00072863244,0.000119365344,0.0013651836,0.0000042361157,0.000028730625,0.00009880797,0.0026223927,0.00000419185,0.00010361578,0.9913247,0.00018547001,0.0034146274],"study_design_scores_gemma":[0.00082514115,0.00093579676,0.0034626373,0.000037948932,0.000016157474,0.0005110565,0.00031047876,0.000025282909,0.000053252013,0.93151015,0.062197447,0.000114664675],"about_ca_topic_score_codex":0.0000014126856,"about_ca_topic_score_gemma":0.0000026370258,"teacher_disagreement_score":0.062011976,"about_ca_system_score_codex":0.000014782415,"about_ca_system_score_gemma":0.000073112744,"threshold_uncertainty_score":0.35271817},"labels":[],"label_agreement":null},{"id":"W1696036094","doi":"10.1016/j.jcta.2016.02.002","title":"Combinatorics of the zeta map on rational Dyck paths","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"York University","funders":"York University; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Bijection; Mathematics; Combinatorics; Path (computing); Riemann zeta function; Bijection, injection and surjection; Pure mathematics; Computer science","score_opus":0.026855416507147414,"score_gpt":0.2944627365106263,"score_spread":0.2676073200034789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696036094","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43274483,0.0026697651,0.024182182,0.009697078,0.48456395,0.007176764,0.00082220096,0.00044867006,0.03769457],"genre_scores_gemma":[0.9914697,0.00014782838,0.0024265982,0.00007510178,0.0033556183,0.000040137984,0.000004268341,0.000227996,0.00225276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99311364,0.0011866521,0.002613362,0.00040357612,0.0021915785,0.0004912089],"domain_scores_gemma":[0.98576677,0.004121588,0.006211336,0.0017432977,0.001946581,0.00021042419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033491205,0.0007872009,0.0018968311,0.00027696605,0.00023872945,0.000101044476,0.0024793686,0.00074627064,0.00014570047],"category_scores_gemma":[0.006647467,0.00049190613,0.0011469434,0.00030449714,0.0005389116,0.00034731135,0.0013490414,0.001951416,0.0000108380345],"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.0012613244,0.0008623046,0.00003761406,0.0006324464,0.00044743752,0.000023616818,0.00059870485,0.000029693549,0.0003562966,0.99034727,0.0052475175,0.0001557946],"study_design_scores_gemma":[0.0026652792,0.00088330684,0.000016004191,0.002230385,0.00033233056,0.00006226719,0.00019411814,0.0000049385953,0.010600991,0.9759265,0.0065975697,0.0004862969],"about_ca_topic_score_codex":7.5835976e-7,"about_ca_topic_score_gemma":3.840219e-7,"teacher_disagreement_score":0.5587249,"about_ca_system_score_codex":0.00052526034,"about_ca_system_score_gemma":0.0010019576,"threshold_uncertainty_score":0.99975324},"labels":[],"label_agreement":null},{"id":"W1708227213","doi":"10.1016/j.jcta.2015.09.002","title":"M-vector analogue for the cd-index","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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 British Columbia","funders":"","keywords":"Polytope; h-vector; Mathematics; Conjecture; Lattice (music); Combinatorics; Lie algebra; Partially ordered set; SPHERES; Pure mathematics; Simplicial complex; Physics","score_opus":0.054527018428424404,"score_gpt":0.3246458590949017,"score_spread":0.2701188406664773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1708227213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18111086,0.003961162,0.60705477,0.0079144575,0.18185844,0.0056487042,0.00009147094,0.00055292237,0.011807233],"genre_scores_gemma":[0.98470384,0.00003444775,0.0104629425,0.000085361586,0.0038310003,0.000040878902,0.0000010021839,0.000097795564,0.0007427028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754757,0.00027725953,0.00095859356,0.00014538958,0.0007122353,0.00035895707],"domain_scores_gemma":[0.9922541,0.0045318827,0.0011476757,0.0005360014,0.0012950103,0.00023537698],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0038829641,0.00028129606,0.0006946295,0.00010615377,0.000197229,0.00010208108,0.0008562717,0.00015352943,0.00003067619],"category_scores_gemma":[0.010323504,0.00018009046,0.0003559419,0.00028793936,0.00019516253,0.00050832075,0.000121527184,0.00040587434,0.0000051680427],"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.0018683828,0.0001569964,0.000015262473,0.000051091178,0.00021056464,0.000013203395,0.000986222,0.00004516488,0.000097531294,0.9876122,0.008584595,0.00035877072],"study_design_scores_gemma":[0.0031889637,0.0010918148,0.000005916545,0.000064192915,0.00018821856,0.00014839352,0.0018258556,0.00006554615,0.0010080095,0.9493066,0.04290328,0.00020317739],"about_ca_topic_score_codex":0.0000016907026,"about_ca_topic_score_gemma":0.0000022056136,"teacher_disagreement_score":0.80359304,"about_ca_system_score_codex":0.00025183146,"about_ca_system_score_gemma":0.0004129242,"threshold_uncertainty_score":0.99801296},"labels":[],"label_agreement":null},{"id":"W1750697786","doi":"10.1016/j.jcta.2011.01.009","title":"The Murnaghan–Nakayama rule for k-Schur functions","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"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":"Schur's theorem; Algebra over a field; Pure mathematics; Chemistry; Computer science; Mathematics","score_opus":0.04393758315576886,"score_gpt":0.2911379965500908,"score_spread":0.24720041339432197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750697786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39456272,0.0026343884,0.30619454,0.0020939386,0.2050546,0.0051748864,0.00008998465,0.0006887158,0.08350622],"genre_scores_gemma":[0.9082935,0.00026583453,0.073502764,0.000110571404,0.006611704,0.00019877114,0.0000024313501,0.0003284671,0.0106859775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975647,0.00025820217,0.0011172702,0.00015262309,0.00048152203,0.0004257033],"domain_scores_gemma":[0.9939094,0.003041702,0.0013072704,0.0005644021,0.0010052674,0.00017194015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029057546,0.0002840733,0.0005698138,0.0001047758,0.0006289488,0.00009881291,0.0007920093,0.00015395677,0.00010082826],"category_scores_gemma":[0.0052373805,0.00018970875,0.00042723934,0.00023684601,0.00025273062,0.0005802205,0.00011561122,0.0004240818,0.0000115552075],"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.0019381781,0.00029833466,0.000010665229,0.000050424653,0.0002189986,0.000009490812,0.001127282,7.8337183e-7,0.00021485645,0.9910207,0.0039691837,0.0011411351],"study_design_scores_gemma":[0.0019458057,0.0011041224,0.000008458019,0.000070969174,0.00018805523,0.00013577355,0.0019212195,0.000004306879,0.0035880236,0.9435381,0.047288463,0.00020667395],"about_ca_topic_score_codex":8.322331e-7,"about_ca_topic_score_gemma":0.0000013006427,"teacher_disagreement_score":0.51373076,"about_ca_system_score_codex":0.00011456629,"about_ca_system_score_gemma":0.00017464561,"threshold_uncertainty_score":0.7736098},"labels":[],"label_agreement":null},{"id":"W1757536559","doi":"10.1016/j.jcta.2016.08.001","title":"A bijection for rooted maps on general surfaces","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":23,"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":"Agence Nationale de la Recherche","keywords":"Bijection; Mathematics; Combinatorics; Euler characteristic; Bipartite graph; Bijection, injection and surjection; Surface (topology); Exponent; RADIUS; Euler's formula; Infinity; Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.024046128702391832,"score_gpt":0.29431008359529254,"score_spread":0.2702639548929007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757536559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9522249,0.000045718,0.035372388,0.0015191978,0.0066408515,0.00044524373,0.000048586357,0.00004851773,0.00365457],"genre_scores_gemma":[0.98863375,0.000040052164,0.006789261,0.000048600396,0.0011714041,0.000011539567,9.657205e-7,0.00004702464,0.0032573738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872077,0.00014118652,0.00055929984,0.000100155354,0.00028420167,0.00019441178],"domain_scores_gemma":[0.9972326,0.0016595382,0.00053841434,0.00017754851,0.00030012985,0.00009177315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015261084,0.0001501727,0.00039899946,0.00009303031,0.00008794134,0.0000452917,0.0001885835,0.00010776414,0.000119045384],"category_scores_gemma":[0.0021092203,0.00008491373,0.00022482802,0.000083511186,0.0000666531,0.000232751,0.000024867442,0.000109763765,0.000005092832],"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.0015849037,0.00020384791,0.000008512667,0.000046009613,0.000088246445,0.000004850333,0.000089117464,0.000001918433,0.003991117,0.9903487,0.0021426925,0.0014900841],"study_design_scores_gemma":[0.0017421291,0.0013101572,0.00001734145,0.00015560337,0.000047674235,0.000036671427,0.00005513055,0.000034317392,0.004081902,0.98222226,0.010171852,0.00012493411],"about_ca_topic_score_codex":4.5751526e-7,"about_ca_topic_score_gemma":6.202625e-7,"teacher_disagreement_score":0.036408853,"about_ca_system_score_codex":0.000066629545,"about_ca_system_score_gemma":0.00004716682,"threshold_uncertainty_score":0.34626812},"labels":[],"label_agreement":null},{"id":"W1795149005","doi":"10.1016/j.jcta.2017.03.009","title":"Staircase diagrams and enumeration of smooth Schubert varieties","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"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":"Enumeration; Bijection; Mathematics; Schubert polynomial; Combinatorics; Graph; Type (biology); Decomposition; Set (abstract data type); Schubert variety; Computer science","score_opus":0.026292482925520135,"score_gpt":0.31090658259987963,"score_spread":0.2846140996743595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795149005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784359,0.00039119934,0.009185446,0.0003698771,0.008417925,0.00037004604,0.000008866251,0.000037172544,0.0027835988],"genre_scores_gemma":[0.99143517,0.00012391809,0.007652987,0.000010614444,0.0005424958,0.000004400313,4.2108942e-7,0.000037543425,0.00019243092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981067,0.00020543716,0.000862584,0.00012687172,0.00049335614,0.00020501793],"domain_scores_gemma":[0.99558914,0.0009118582,0.002126929,0.00061360374,0.0006346809,0.00012379128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017438955,0.00022252876,0.0006973515,0.00009550528,0.00035430063,0.00018038253,0.0004899796,0.00014109773,0.000034875207],"category_scores_gemma":[0.0062465263,0.00018531825,0.00014511347,0.00005940163,0.00042944998,0.0011191571,0.00018431587,0.00030704512,8.778576e-7],"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.0007457269,0.00021808427,0.00017717386,0.00016557371,0.00010772424,0.000026067904,0.0011934657,0.0000014159826,0.00089987164,0.9945751,0.00019972735,0.0016901043],"study_design_scores_gemma":[0.0018245018,0.000780423,0.00011477094,0.00015189646,0.000121897996,0.00008105618,0.0006177401,0.000009283617,0.009734709,0.98459625,0.0017932197,0.0001742317],"about_ca_topic_score_codex":0.000003921657,"about_ca_topic_score_gemma":0.0000017055089,"teacher_disagreement_score":0.01299932,"about_ca_system_score_codex":0.000051775933,"about_ca_system_score_gemma":0.00011740951,"threshold_uncertainty_score":0.75570583},"labels":[],"label_agreement":null},{"id":"W1861968797","doi":"10.1016/j.jcta.2015.11.003","title":"Critical exponents of graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; UPS Foundation; National Science Foundation","keywords":"Chordal graph; Mathematics; Combinatorics; Critical exponent; Bipartite graph; Exponent; Treewidth; Indifference graph; Conjecture; Pathwidth; Invariant (physics); Discrete mathematics; Graph; Line graph","score_opus":0.04989356602177974,"score_gpt":0.3323412379104951,"score_spread":0.28244767188871533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861968797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98786694,0.00020677544,0.0011438442,0.0003955638,0.00355378,0.00012672933,0.000008846968,0.000023455284,0.006674039],"genre_scores_gemma":[0.99729383,0.000011788081,0.002344823,0.000019529056,0.00021351237,0.0000036410154,3.741577e-7,0.000015378177,0.00009715127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985093,0.00030733433,0.00060355413,0.00007173032,0.0003632141,0.00014485359],"domain_scores_gemma":[0.9975667,0.0009290402,0.00039632508,0.00023682728,0.0006937583,0.00017732184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020846536,0.00011180445,0.00036142417,0.00011560532,0.000057707017,0.000020892248,0.0003128132,0.00007905279,0.00007226011],"category_scores_gemma":[0.0030084683,0.000090510155,0.00018715607,0.0002070833,0.00028467082,0.00032788544,0.000047725258,0.00019747448,0.0000035890823],"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.0008357843,0.0003595358,0.00006608885,0.000028117858,0.00005780964,0.000008255185,0.0007150035,5.6780686e-7,0.001058012,0.9950508,0.0016996289,0.00012043604],"study_design_scores_gemma":[0.00096506113,0.0005346301,0.000024947341,0.000054241096,0.000077019344,0.00008725712,0.001247582,4.623058e-7,0.008456351,0.98504156,0.003425002,0.00008589477],"about_ca_topic_score_codex":5.0763276e-7,"about_ca_topic_score_gemma":1.11415424e-7,"teacher_disagreement_score":0.010009209,"about_ca_system_score_codex":0.000019207828,"about_ca_system_score_gemma":0.00008789811,"threshold_uncertainty_score":0.36908972},"labels":[],"label_agreement":null},{"id":"W1929335507","doi":"10.1016/j.jcta.2018.04.004","title":"Extremal hypergraphs for Ryser's Conjecture","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Hypergraph; Conjecture; Combinatorics; Bipartite graph; Mathematics; Social connectedness; Independence number; Vertex (graph theory); Matching (statistics); Discrete mathematics; Base (topology); Graph","score_opus":0.010925980757902062,"score_gpt":0.2467997779114212,"score_spread":0.23587379715351914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929335507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12844631,0.0014541151,0.83365464,0.0057437113,0.02559533,0.00033278315,0.000035310957,0.00012993098,0.004607841],"genre_scores_gemma":[0.986016,0.00003586762,0.0114492765,0.0002686275,0.0018137908,0.0000028650236,0.0000012686703,0.0000071155982,0.00040520896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871594,0.00014120183,0.00041625733,0.00017557236,0.00030420756,0.00024684033],"domain_scores_gemma":[0.99823135,0.00042143633,0.000377475,0.0003301515,0.00050141366,0.00013814896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816933,0.00013871437,0.0003702197,0.0002582144,0.00019118299,0.00015894313,0.001167874,0.00009826507,0.00013763037],"category_scores_gemma":[0.00070676784,0.00009238765,0.00029220534,0.00085202744,0.00021820932,0.0007619087,0.00016207912,0.0001539389,0.000007885546],"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.0003541277,0.000079158184,0.000058590784,0.000003913358,0.00010853729,0.00001554768,0.00012881099,0.0000021271394,0.00022588043,0.98784924,0.0029434178,0.008230631],"study_design_scores_gemma":[0.0008761715,0.0021454163,0.00012988025,0.0000089692785,0.00004430349,0.00011007893,0.000069726426,0.000034080935,0.0021524176,0.84497905,0.14932801,0.00012188427],"about_ca_topic_score_codex":0.0000018806487,"about_ca_topic_score_gemma":8.965662e-7,"teacher_disagreement_score":0.8575697,"about_ca_system_score_codex":0.000021316315,"about_ca_system_score_gemma":0.00007559702,"threshold_uncertainty_score":0.3767459},"labels":[],"label_agreement":null},{"id":"W1965328002","doi":"10.1006/jcta.2000.3144","title":"Logarithmic Concavity and sl2(C)","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"University of Waterloo","funders":"","keywords":"SL2(R); Logarithm; Mathematics; Combinatorics; Graph; Sequence (biology); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01844273816181695,"score_gpt":0.27882510868235116,"score_spread":0.2603823705205342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965328002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98869646,0.00043198324,0.00038703874,0.0001881793,0.004674007,0.00010379839,0.0000027920155,0.000023803279,0.0054919245],"genre_scores_gemma":[0.997321,0.00024586802,0.0010796288,0.00008411123,0.00080855435,0.0000010854193,1.9649688e-7,0.000020210173,0.000439329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867034,0.00029453734,0.00046731872,0.00010250071,0.0002697408,0.00019554135],"domain_scores_gemma":[0.9983149,0.00072622893,0.00041356805,0.00020301098,0.0002179494,0.00012431004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835563,0.00016198568,0.00041607383,0.00009890544,0.000220327,0.000051564937,0.00024906866,0.0001232521,0.0001720201],"category_scores_gemma":[0.00072483777,0.000118650576,0.0001353323,0.00011585606,0.00029552614,0.0003246448,0.000113405455,0.00034170222,8.109782e-7],"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.0011123996,0.00005793851,0.0005672073,0.000022669494,0.00009832393,0.000093123286,0.0008571464,3.2428258e-7,0.00020837365,0.9947231,0.00063011074,0.0016293168],"study_design_scores_gemma":[0.0013532819,0.00046851113,0.00037890818,0.000038758204,0.000071046146,0.0010870531,0.00042246107,0.0000011224487,0.00051755866,0.9758917,0.01963534,0.00013427432],"about_ca_topic_score_codex":9.894369e-7,"about_ca_topic_score_gemma":6.4541916e-7,"teacher_disagreement_score":0.01900523,"about_ca_system_score_codex":0.000034939185,"about_ca_system_score_gemma":0.00004432311,"threshold_uncertainty_score":0.483843},"labels":[],"label_agreement":null},{"id":"W1967329424","doi":"10.1016/j.jcta.2009.07.010","title":"Extensions and restrictions of Wythoff's game preserving its <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">P</mml:mi></mml:math> positions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"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":"Fibonacci number; Morphism; Set (abstract data type); Computer science; Word (group theory); Discrete mathematics; Mathematics; Combinatorics; Programming language; Geometry","score_opus":0.013300653658497575,"score_gpt":0.23385288848705402,"score_spread":0.22055223482855643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967329424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98813504,0.00085300073,0.0041810153,0.001025122,0.0032920826,0.000060187656,0.000024626699,0.00009616742,0.0023327381],"genre_scores_gemma":[0.9950398,0.00041012684,0.0034708648,0.00034756536,0.00058808434,0.000012303896,0.0000053333024,0.000036369624,0.00008951629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975789,0.00025154444,0.0007888525,0.00032242385,0.00063195766,0.0004262945],"domain_scores_gemma":[0.9973971,0.0005539735,0.0008447862,0.0007062113,0.00024602187,0.0002518625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013237913,0.000251205,0.00031484704,0.00021163859,0.0005230972,0.0003898059,0.0009092735,0.00026278087,0.00004616735],"category_scores_gemma":[0.0005990387,0.00026616166,0.0003304795,0.00045626372,0.00020395695,0.0017271999,0.00045403544,0.0005071444,0.00002507985],"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.0003340062,0.00022847205,0.0000023637383,0.000043674896,0.00012844821,0.00020375676,0.0010442366,0.00015499885,0.008113847,0.9881948,0.0008808548,0.00067054573],"study_design_scores_gemma":[0.0027601314,0.003784367,0.0011257855,0.0011744124,0.0004331363,0.003992425,0.0015525619,0.26266593,0.020647297,0.6943496,0.006772112,0.00074225996],"about_ca_topic_score_codex":0.000023812549,"about_ca_topic_score_gemma":0.0000027472536,"teacher_disagreement_score":0.2938452,"about_ca_system_score_codex":0.000019503852,"about_ca_system_score_gemma":0.00030323685,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W1967421215","doi":"10.1016/j.jcta.2006.08.002","title":"On the maximum number of edges in quasi-planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":90,"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","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Planar; Simple (philosophy); Upper and lower bounds; Pairwise comparison; Book embedding; Multiple edges; Matching (statistics); Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","score_opus":0.007860445494885649,"score_gpt":0.2300400927524089,"score_spread":0.22217964725752323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967421215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94736814,0.00019153456,0.037947424,0.0020697718,0.005914647,0.00013404622,0.0000023832508,0.000015159337,0.006356908],"genre_scores_gemma":[0.99858433,0.000012747618,0.0009724721,0.00008179379,0.00024229052,0.000001563672,6.92696e-7,0.000004174241,0.000099959594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874,0.00028029786,0.00042244166,0.00008781514,0.00035470247,0.000114699],"domain_scores_gemma":[0.9986471,0.0006197542,0.00033811782,0.0001706107,0.00019662143,0.000027797676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012514507,0.000091095004,0.0001883042,0.0001435547,0.0000665702,0.00005562294,0.00045797214,0.000043687523,0.000032516222],"category_scores_gemma":[0.00014677807,0.00006201771,0.00009775014,0.00047977382,0.000060842696,0.0003605999,0.00003338783,0.00016513965,0.000004235519],"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.00019566793,0.000186172,0.00020529,0.0000044325907,0.000012840817,0.000011486907,0.00014730281,0.0004427074,0.0003453191,0.99587494,0.0010667015,0.001507162],"study_design_scores_gemma":[0.0005207344,0.0003256677,0.0011654997,0.00003022548,0.000004434642,0.000057068228,0.00005766544,0.00007645039,0.004515385,0.9910859,0.002094828,0.000066144254],"about_ca_topic_score_codex":0.00000761163,"about_ca_topic_score_gemma":0.0000023763207,"teacher_disagreement_score":0.05121618,"about_ca_system_score_codex":0.000025917245,"about_ca_system_score_gemma":0.00008702296,"threshold_uncertainty_score":0.25290087},"labels":[],"label_agreement":null},{"id":"W1967885750","doi":"10.1006/jcta.2002.3304","title":"Permutations with Low Discrepancy Consecutive k-sums","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":9,"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":"Combinatorics; Permutation (music); Mathematics; Modulo; Parity of a permutation; Cyclic permutation; Line (geometry); Discrete mathematics; Symmetric group; Physics","score_opus":0.027057550137999764,"score_gpt":0.2996241831864421,"score_spread":0.2725666330484423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967885750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92374283,0.00039413222,0.008921131,0.0018183421,0.0022308126,0.00056921976,0.000022512273,0.000089895664,0.0622111],"genre_scores_gemma":[0.99259365,0.000036728085,0.0016550974,0.000037611255,0.00044636414,0.000006765746,6.9884345e-7,0.000044551536,0.00517855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774927,0.0005271469,0.0005740802,0.00014269786,0.00068775605,0.00031903494],"domain_scores_gemma":[0.9966368,0.0014900396,0.0006872572,0.0003157453,0.0006685826,0.00020155207],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001338045,0.0002040265,0.000498537,0.00015408763,0.00020337712,0.00008900995,0.00037795908,0.0000840108,0.0017551858],"category_scores_gemma":[0.0018591416,0.00014231062,0.00018358143,0.00032721017,0.00048664195,0.0005000147,0.000061089435,0.00045477838,0.0000355903],"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.0012146079,0.0003780083,0.00022631137,0.000040209925,0.00033873328,0.0001685922,0.0028209523,0.0000034289653,0.000106584055,0.9922706,0.0021840602,0.00024792558],"study_design_scores_gemma":[0.0019608673,0.0009694918,0.000030530504,0.00015157867,0.00013964456,0.0006998866,0.003395719,0.000016639377,0.001179671,0.989442,0.0018266918,0.00018728674],"about_ca_topic_score_codex":0.0000016441068,"about_ca_topic_score_gemma":0.0000020441364,"teacher_disagreement_score":0.06885078,"about_ca_system_score_codex":0.00010519486,"about_ca_system_score_gemma":0.00011989576,"threshold_uncertainty_score":0.99915737},"labels":[],"label_agreement":null},{"id":"W1968759207","doi":"10.1016/j.jcta.2006.11.005","title":"Maximum distance separable codes and arcs in projective spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"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; University of New Brunswick","funders":"","keywords":"Mathematics; Projective test; Separable space; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.004965791969250566,"score_gpt":0.21562679224028844,"score_spread":0.21066100027103787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968759207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92940503,0.0022266724,0.054342538,0.0006911447,0.0036364554,0.00023278946,0.0000040822706,0.000062725376,0.009398555],"genre_scores_gemma":[0.99743736,0.00006405151,0.0021708838,0.00002508845,0.00020264156,0.0000032985672,1.9954537e-7,0.0000067023166,0.00008977713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987506,0.00030481003,0.0003398757,0.000159306,0.00023158237,0.0002137858],"domain_scores_gemma":[0.99905634,0.00029467727,0.00028235037,0.00018490992,0.00012805637,0.00005367249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418543,0.0001378917,0.00029123324,0.00019536636,0.000111841466,0.00021648512,0.0004393311,0.00005548695,0.0000062384092],"category_scores_gemma":[0.00007989986,0.00011484802,0.000081223545,0.0004642193,0.00017978619,0.00096179976,0.000099614226,0.00022469368,6.469449e-7],"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.00061650184,0.00011126766,0.0019073666,0.000012863581,0.000017574603,0.000052022493,0.0006213833,0.000027180868,0.00031853683,0.99504334,0.00013671706,0.001135228],"study_design_scores_gemma":[0.00083885546,0.00045807427,0.0014782072,0.000070545175,0.000007996781,0.00009733955,0.00026834809,0.00003329949,0.0016822511,0.98694825,0.007979973,0.00013687913],"about_ca_topic_score_codex":0.000011741522,"about_ca_topic_score_gemma":0.000011153802,"teacher_disagreement_score":0.06803232,"about_ca_system_score_codex":0.00003679435,"about_ca_system_score_gemma":0.00007103398,"threshold_uncertainty_score":0.46833664},"labels":[],"label_agreement":null},{"id":"W1969686332","doi":"10.1006/jcta.2002.3268","title":"Vanishing Ideals of Lattice Diagram Determinants","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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":"York University","funders":"","keywords":"Lattice (music); Diagram; Mathematics; Homogeneous; Combinatorics; Ideal (ethics); Partition (number theory); Quadrant (abdomen); Space (punctuation); Mathematical physics; Pure mathematics; Physics; Computer science; Philosophy; Statistics","score_opus":0.0406839642677423,"score_gpt":0.3068111698883582,"score_spread":0.2661272056206159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969686332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715111,0.0007769056,0.0060077333,0.00017355353,0.014252776,0.00050006085,0.000010715175,0.00009289208,0.006674239],"genre_scores_gemma":[0.98546845,0.00014572607,0.013143879,0.000022214736,0.0007520102,0.000004847104,1.5451181e-7,0.00006969317,0.0003930282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966909,0.00040049836,0.0016041136,0.0001576322,0.00077974406,0.00036705693],"domain_scores_gemma":[0.99374634,0.0026670469,0.0022270666,0.00050761935,0.0006758423,0.00017607136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002107999,0.00030037554,0.0010667192,0.00016840477,0.00012156319,0.00006119377,0.0007114475,0.00018553287,0.00023995376],"category_scores_gemma":[0.007169815,0.0002558298,0.0003278818,0.0003290435,0.00019103121,0.000891048,0.00014674354,0.00045569474,0.000009024266],"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.00031682156,0.00053409964,0.0000994177,0.00022638698,0.00012335849,0.00007838713,0.0020250762,0.000004892487,0.0006898458,0.99272007,0.00066485815,0.0025168129],"study_design_scores_gemma":[0.0017419187,0.000948691,0.000008883173,0.0003302401,0.00016935148,0.00023397776,0.0006197675,0.00004609548,0.012575462,0.9814839,0.0016011207,0.00024063149],"about_ca_topic_score_codex":0.0000010614799,"about_ca_topic_score_gemma":6.564811e-7,"teacher_disagreement_score":0.013957323,"about_ca_system_score_codex":0.00009703527,"about_ca_system_score_gemma":0.00005038012,"threshold_uncertainty_score":0.9999894},"labels":[],"label_agreement":null},{"id":"W1970396807","doi":"10.1016/j.jcta.2010.02.006","title":"Laurent polynomials and Eulerian numbers","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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":"Queen's University","funders":"","keywords":"Laurent polynomial; Mathematics; Eulerian path; Constant (computer programming); Zero (linguistics); Polynomial; Ideal (ethics); Laurent series; Pure mathematics; Sequence (biology); Degree (music); Discrete mathematics; Combinatorics; Mathematical analysis; Computer science; Physics; Lagrangian","score_opus":0.01400517660512065,"score_gpt":0.2873138421584913,"score_spread":0.2733086655533707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970396807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96830404,0.00013103962,0.00092891266,0.00053164543,0.024643632,0.0003076101,0.000006049785,0.00007280614,0.0050742584],"genre_scores_gemma":[0.97957635,0.000050897677,0.017703103,0.00004188789,0.002114886,0.0000058418254,4.4703884e-7,0.0000705999,0.0004359754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979713,0.00020252133,0.00090157724,0.00015799346,0.0004629385,0.00030369355],"domain_scores_gemma":[0.9967945,0.001202673,0.0009923087,0.00039737328,0.00035806917,0.00025507782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019757852,0.00027519118,0.0007043778,0.00012941312,0.00015239918,0.00010924579,0.00042203415,0.00020204682,0.00021202299],"category_scores_gemma":[0.0035870182,0.00022780617,0.00017447936,0.00016279104,0.00026509986,0.00058115885,0.00013507014,0.00070983137,0.0000051609495],"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.00053362607,0.00018673288,0.00005940795,0.000056686196,0.00009501209,0.000028849758,0.0008011473,3.0423698e-7,0.007782691,0.9886041,0.0012718049,0.0005795863],"study_design_scores_gemma":[0.0018240502,0.0004383704,0.000019995012,0.000065727516,0.00009526541,0.00040721617,0.00053217384,0.0000014069819,0.008120819,0.9696977,0.018566031,0.0002312433],"about_ca_topic_score_codex":0.0000016905814,"about_ca_topic_score_gemma":0.0000044970175,"teacher_disagreement_score":0.022528745,"about_ca_system_score_codex":0.000046741734,"about_ca_system_score_gemma":0.00012703988,"threshold_uncertainty_score":0.9289666},"labels":[],"label_agreement":null},{"id":"W1973306860","doi":"10.1006/jcta.2001.3173","title":"Complementary Algorithms for Tableaux","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"University of Victoria","funders":"","keywords":"Equivalence (formal languages); Class (philosophy); Set (abstract data type); Diagram; Computer science; A priori and a posteriori; Mathematics; Algorithm; Column (typography); Combinatorics; Discrete mathematics; Programming language; Artificial intelligence; Connection (principal bundle)","score_opus":0.05499614994011755,"score_gpt":0.34642994031474017,"score_spread":0.29143379037462264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973306860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25761622,0.0013865385,0.6301985,0.0036437607,0.08611132,0.004121634,0.00012611327,0.0004777851,0.01631815],"genre_scores_gemma":[0.5983738,0.00040992137,0.38507643,0.00038801166,0.011535194,0.000113023176,0.000015942454,0.0004015218,0.0036861876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974494,0.00019492515,0.001184026,0.00017160717,0.0005636033,0.00043642888],"domain_scores_gemma":[0.9954454,0.0020732488,0.0011227083,0.00039591853,0.00078071374,0.00018201554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021755085,0.00029980156,0.0008075407,0.00015781031,0.0002210225,0.000071218834,0.00061650143,0.00012161806,0.0002381733],"category_scores_gemma":[0.0019866948,0.0002581072,0.00033572427,0.00027499275,0.00012966938,0.0006690569,0.000112354624,0.00031290518,0.0000045113675],"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.0016770927,0.0004093263,0.000022308364,0.00008528911,0.00019942474,0.00004184354,0.00045570754,0.0000062833747,0.00034161354,0.98985964,0.005235241,0.0016662149],"study_design_scores_gemma":[0.003970234,0.0013875132,0.0000020501989,0.00009724602,0.00015136515,0.00033844434,0.0010248607,0.000024448842,0.0020216235,0.89124614,0.099489585,0.00024647845],"about_ca_topic_score_codex":0.000001255152,"about_ca_topic_score_gemma":9.194518e-7,"teacher_disagreement_score":0.34075755,"about_ca_system_score_codex":0.00017354502,"about_ca_system_score_gemma":0.00013597694,"threshold_uncertainty_score":0.9999871},"labels":[],"label_agreement":null},{"id":"W1974325710","doi":"10.1016/j.jcta.2011.10.001","title":"Sets of orthogonal hypercubes of class r","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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; University College Dublin","keywords":"Hypercube; Combinatorics; Orthogonality; Mathematics; Class (philosophy); Power of two; Discrete mathematics; Prime (order theory); Computer science; Arithmetic; Geometry","score_opus":0.01977501702963548,"score_gpt":0.22370991365212553,"score_spread":0.20393489662249004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974325710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9334664,0.00041478165,0.027481984,0.000104852574,0.022090554,0.00012280846,0.0000039015363,0.00002244876,0.01629232],"genre_scores_gemma":[0.99818194,0.00002423089,0.0014057782,0.000020848474,0.0002772095,7.6491733e-7,1.1604033e-7,0.0000067909273,0.00008234426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837077,0.00029445565,0.0007702472,0.00009288809,0.00033275608,0.00013889554],"domain_scores_gemma":[0.99808663,0.00016467954,0.0008061517,0.00025543722,0.0006167646,0.000070320566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014657222,0.00010665575,0.00041804486,0.00012816342,0.000042698346,0.00002084009,0.00067442557,0.00008308064,0.00007975892],"category_scores_gemma":[0.00010608486,0.00008179785,0.00021579265,0.00020880766,0.00011278482,0.0005996454,0.00009809409,0.00016731945,0.0000016275869],"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.00044954944,0.00012492154,0.00039249976,0.000022599712,0.000087439126,0.000015156342,0.0018542254,0.000015140259,0.0010257497,0.9944056,0.00030771727,0.0012993743],"study_design_scores_gemma":[0.0013748263,0.002874112,0.0012848488,0.00022674081,0.00003526319,0.0005671549,0.00090969517,0.00024361073,0.027115911,0.95776695,0.007400914,0.00019995426],"about_ca_topic_score_codex":0.0000058356263,"about_ca_topic_score_gemma":0.0000011255232,"teacher_disagreement_score":0.064715564,"about_ca_system_score_codex":0.000019231808,"about_ca_system_score_gemma":0.00011363486,"threshold_uncertainty_score":0.33356196},"labels":[],"label_agreement":null},{"id":"W1974746744","doi":"10.1016/j.jcta.2009.11.002","title":"Quasisymmetric Schur functions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":97,"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; Pure mathematics","score_opus":0.02374640907156703,"score_gpt":0.30137025831362535,"score_spread":0.2776238492420583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974746744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6453934,0.0024217207,0.16667451,0.0042054267,0.084458366,0.0017296778,0.00002441521,0.00071935146,0.094373144],"genre_scores_gemma":[0.9799578,0.00006133554,0.016122779,0.00008997762,0.0019564226,0.000004009704,6.999877e-7,0.000045996807,0.001760959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736536,0.00029226622,0.0011077884,0.00015976268,0.0007197497,0.00035510585],"domain_scores_gemma":[0.996119,0.0013261599,0.0011303384,0.00047680552,0.0007360113,0.00021166514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018725165,0.00028874254,0.0007421772,0.0004060386,0.00020351647,0.000088437424,0.00054592977,0.00016983622,0.00017940725],"category_scores_gemma":[0.0057609715,0.00024200247,0.00034863598,0.00086629,0.00009682496,0.00081099133,0.000054304837,0.00055695866,0.00003095813],"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.0006485874,0.00057836645,0.000010804208,0.000025472684,0.000091383554,0.000036752503,0.0002825806,0.0000051026104,0.0004671366,0.9909103,0.004111931,0.002831573],"study_design_scores_gemma":[0.0018230056,0.0018730893,0.000026140568,0.000090890506,0.00014694037,0.00026781988,0.00057913375,0.0000031871607,0.0018096885,0.97944987,0.013688768,0.00024145028],"about_ca_topic_score_codex":2.514044e-7,"about_ca_topic_score_gemma":1.2891873e-7,"teacher_disagreement_score":0.33456442,"about_ca_system_score_codex":0.0001690304,"about_ca_system_score_gemma":0.0001296258,"threshold_uncertainty_score":0.9868574},"labels":[],"label_agreement":null},{"id":"W1976554601","doi":"10.1016/j.jcta.2013.09.002","title":"Lyndon words and Fibonacci numbers","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","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":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Combinatorics; Concatenation (mathematics); Word (group theory); Mathematics; Golden ratio; Upper and lower bounds; Closure (psychology); Aperiodic graph; Combinatorics on words; Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.004193574610920123,"score_gpt":0.20143033041803673,"score_spread":0.1972367558071166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976554601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95987713,0.0011826684,0.017065631,0.0025921126,0.0108720735,0.00022594389,0.0000012304887,0.00011379697,0.008069388],"genre_scores_gemma":[0.99513316,0.00009683578,0.00373332,0.00023344399,0.00045196334,0.0000033977738,1.941077e-7,0.000011715373,0.00033597843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987324,0.00020811905,0.000394783,0.00014194193,0.00029561546,0.00022716001],"domain_scores_gemma":[0.9987417,0.00031238195,0.00033152566,0.0002859279,0.0001644654,0.00016402085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009956504,0.00014898586,0.00029270802,0.00010095216,0.00011075773,0.0003290883,0.0007019248,0.000074108364,0.00018081811],"category_scores_gemma":[0.00015408767,0.00011515897,0.00010047369,0.000201828,0.00011275875,0.0019600869,0.00021300418,0.00021941836,0.000018251778],"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.00007875705,0.000047861646,0.000117613316,0.00000889339,0.000040065326,0.000023735089,0.0009396133,0.0000014643697,0.00079543574,0.9784649,0.002519748,0.016961932],"study_design_scores_gemma":[0.0008641648,0.00039301487,0.0006193096,0.00004408561,0.000010482279,0.00035799405,0.00046145992,0.00011502642,0.0015457644,0.9857405,0.009692591,0.00015564864],"about_ca_topic_score_codex":0.000008335603,"about_ca_topic_score_gemma":2.437497e-7,"teacher_disagreement_score":0.035255995,"about_ca_system_score_codex":0.00003167418,"about_ca_system_score_gemma":0.00006490804,"threshold_uncertainty_score":0.46960464},"labels":[],"label_agreement":null},{"id":"W1979399949","doi":"10.1016/j.jcta.2014.12.006","title":"Directed graphs and boron trees","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"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":"Disjoint sets; Class (philosophy); Combinatorics; Mathematics; Extension (predicate logic); Tree (set theory); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.026216392693924135,"score_gpt":0.2959892680415045,"score_spread":0.2697728753475804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979399949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848832,0.001469472,0.0006081691,0.0004002632,0.0054960283,0.00011803642,0.0000038435014,0.00009391561,0.0069270837],"genre_scores_gemma":[0.99604475,0.00010829532,0.0027783548,0.000043465665,0.0002991954,0.000001729139,5.1864885e-7,0.000021434767,0.0007022227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878055,0.00039254123,0.00038085034,0.00008558135,0.0001970739,0.00016338381],"domain_scores_gemma":[0.99840564,0.00066613656,0.00036142237,0.00015049636,0.0002542069,0.00016207735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015127973,0.00013727887,0.00038479525,0.00009460388,0.000083432875,0.00002052338,0.00016272902,0.000113898896,0.000045311608],"category_scores_gemma":[0.0018227756,0.00010508388,0.0000821056,0.00010679019,0.0003209513,0.00038141568,0.000049799757,0.0002565839,0.000001600764],"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.002210495,0.00009367291,0.00012927478,0.000009808475,0.000082778824,0.000044896333,0.0012721814,9.669224e-7,0.0001629959,0.9937133,0.0015787298,0.000700893],"study_design_scores_gemma":[0.0017373436,0.00075465726,0.00007812263,0.000030097293,0.00006338563,0.00028415798,0.0014408212,0.0000010439868,0.0011012759,0.9871768,0.0072184736,0.00011385314],"about_ca_topic_score_codex":7.218969e-7,"about_ca_topic_score_gemma":0.0000019152135,"teacher_disagreement_score":0.011161596,"about_ca_system_score_codex":0.000030130901,"about_ca_system_score_gemma":0.00007058664,"threshold_uncertainty_score":0.4285196},"labels":[],"label_agreement":null},{"id":"W1981620429","doi":"10.1016/j.jcta.2011.11.006","title":"Combinatorial variations on Cantorʼs diagonal","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Diagonal; Cantor's diagonal argument; Combinatorics; Equivalence relation; Class (philosophy); Equivalence (formal languages); Relation (database); Square (algebra); Discrete mathematics; Cantor set; Geometry","score_opus":0.03823127826310168,"score_gpt":0.27948129278037176,"score_spread":0.24125001451727007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981620429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59054613,0.00015030865,0.023730485,0.00079746085,0.06502342,0.0011659948,0.00010318692,0.00021609683,0.3182669],"genre_scores_gemma":[0.99504846,0.000021869153,0.003195469,0.00006099702,0.001287075,0.00000818174,0.0000014354534,0.00004654657,0.00032994445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768984,0.00030952142,0.0009367067,0.00014660321,0.00061813573,0.00029916965],"domain_scores_gemma":[0.99677986,0.0013758177,0.0008378543,0.00034484308,0.00043437575,0.0002272793],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019965433,0.00024925,0.0006134692,0.00015764845,0.00016180272,0.00006152642,0.00046526542,0.00017714124,0.001119871],"category_scores_gemma":[0.0025361446,0.00019406254,0.0002962487,0.00019057696,0.00013838265,0.00034641445,0.000073930605,0.00046202092,0.00002138348],"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.001142539,0.0009657853,0.000034790955,0.00003552543,0.00017119433,0.00005104056,0.0011923937,3.9453522e-7,0.00007956584,0.99506384,0.0010245424,0.00023839893],"study_design_scores_gemma":[0.0015939343,0.0012943823,0.00011034442,0.00008788051,0.000117783944,0.00007526842,0.00019222933,0.000018469736,0.0005922346,0.9927526,0.0029536255,0.00021121374],"about_ca_topic_score_codex":0.000004790632,"about_ca_topic_score_gemma":0.0000010324379,"teacher_disagreement_score":0.40450233,"about_ca_system_score_codex":0.00009436417,"about_ca_system_score_gemma":0.00016408887,"threshold_uncertainty_score":0.99979323},"labels":[],"label_agreement":null},{"id":"W1982890265","doi":"10.1016/j.jcta.2012.03.013","title":"On triple systems and strongly regular graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Concordia University","funders":"","keywords":"Combinatorics; Strongly regular graph; Mathematics; Graph; Automorphism; Latin square; Discrete mathematics; Line graph; Pathwidth; Chemistry","score_opus":0.005895100764086992,"score_gpt":0.19247226673729487,"score_spread":0.18657716597320786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982890265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9663166,0.0053686835,0.00021754316,0.000012531216,0.023558516,0.00014425088,0.0000053444787,0.00006126746,0.004315272],"genre_scores_gemma":[0.99891883,0.00008678857,0.000016494194,0.0000054125358,0.0007649239,0.000004335585,5.573809e-7,0.000029744297,0.00017289614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987308,0.00026101706,0.00042921957,0.00006212172,0.0002464838,0.00027038492],"domain_scores_gemma":[0.9992192,0.00017602668,0.00016536812,0.0001767706,0.00007260075,0.00019006105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016094927,0.00017580415,0.0003728466,0.00015653702,0.00008412218,0.00006367816,0.00015650917,0.00010781198,0.000022892053],"category_scores_gemma":[0.00007884686,0.00014306924,0.000117144096,0.00014413882,0.00007523739,0.0005238812,0.000015246179,0.00025810694,0.000004803239],"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.0004823684,0.000044916203,0.00015772044,0.00006666772,0.0001424186,0.000007959904,0.0004565041,0.000306468,0.0010033251,0.9961356,0.0010223624,0.00017367964],"study_design_scores_gemma":[0.0029641883,0.0013223131,0.00043621263,0.0003200369,0.00012896757,0.0006210268,0.0030156316,0.00005630091,0.0041817683,0.9314494,0.055042017,0.00046213812],"about_ca_topic_score_codex":6.9968513e-7,"about_ca_topic_score_gemma":5.986929e-8,"teacher_disagreement_score":0.06468621,"about_ca_system_score_codex":0.000035730824,"about_ca_system_score_gemma":0.000011108243,"threshold_uncertainty_score":0.5834194},"labels":[],"label_agreement":null},{"id":"W1985237288","doi":"10.1016/j.jcta.2014.08.002","title":"Descent sets on 321-avoiding involutions and hook decompositions of partitions","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca; National Sanitarium Association; Simons Foundation; National Science Foundation","keywords":"Bijection, injection and surjection; Mathematics; Descent (aeronautics); Combinatorics; Hook; Set (abstract data type); Diagram; Index (typography); Binomial coefficient; Bijection; Statistics; Computer science; Physics","score_opus":0.026322335408093915,"score_gpt":0.3024315229464988,"score_spread":0.27610918753840485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985237288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9459747,0.00016198117,0.040888507,0.0006607412,0.0064095813,0.0004750091,0.00003281359,0.00008357524,0.0053130984],"genre_scores_gemma":[0.9885272,0.00005478283,0.010950764,0.000029817407,0.00033486963,0.000008449028,0.0000013705177,0.000034236713,0.000058559064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978908,0.00050505344,0.00086001446,0.0001254789,0.00038997998,0.00022868114],"domain_scores_gemma":[0.99567413,0.0025303024,0.0008793011,0.00031549687,0.0004333356,0.0001674288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015338501,0.0002053289,0.00056315406,0.00018688415,0.00030421795,0.00004027215,0.00024022968,0.00010402318,0.000038369202],"category_scores_gemma":[0.0028219977,0.00018264956,0.0001702234,0.00018136657,0.00022203453,0.00035551155,0.00008415153,0.00040231485,0.0000042480046],"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.00026606632,0.0004644203,0.00004136611,0.0000910578,0.000085000414,0.0000036954486,0.0006555843,0.000037389687,0.0014977313,0.9960618,0.0006524485,0.0001434614],"study_design_scores_gemma":[0.0013506146,0.0009959463,0.000034746543,0.00036370603,0.00014333568,0.00009136392,0.0005249993,0.00004150192,0.0073906207,0.9874721,0.0014271826,0.00016389001],"about_ca_topic_score_codex":5.983408e-7,"about_ca_topic_score_gemma":8.656101e-7,"teacher_disagreement_score":0.042552456,"about_ca_system_score_codex":0.000106087304,"about_ca_system_score_gemma":0.00007727989,"threshold_uncertainty_score":0.7448233},"labels":[],"label_agreement":null},{"id":"W1985908622","doi":"10.1016/j.jcta.2009.02.007","title":"On decompositions of complete hypergraphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Hypergraph; Combinatorics; Partition (number theory); Mathematics; Discrete mathematics","score_opus":0.005404203268405634,"score_gpt":0.1992977980009139,"score_spread":0.19389359473250828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985908622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762382,0.00049781793,0.00081026746,0.00008354318,0.006078096,0.00010114078,0.000013934896,0.000057268997,0.016119722],"genre_scores_gemma":[0.99955946,0.000037905775,0.00011265912,0.000031485422,0.00022197235,8.167768e-7,0.0000010102084,0.000012778019,0.000021914944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.00014065254,0.0004886564,0.00005368584,0.00020628289,0.00014309712],"domain_scores_gemma":[0.999265,0.00018770383,0.0001760233,0.00016785368,0.00012191043,0.00008151878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194558,0.00013328984,0.00035798852,0.00018257093,0.00006224976,0.000019673835,0.00022729891,0.00006659949,0.000058596244],"category_scores_gemma":[0.00004281688,0.00011499103,0.00021619837,0.00020288283,0.00006481307,0.00019459227,0.0000062580416,0.00020852123,0.0000042380484],"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.00056385784,0.0000917318,0.000010102819,0.000017312033,0.00008924308,0.000013859683,0.00022307198,0.0012460317,0.020488298,0.9762555,0.0005544894,0.00044650008],"study_design_scores_gemma":[0.000885479,0.001367618,0.0002562833,0.00013039295,0.000035967943,0.00011758907,0.00017447579,0.00002013272,0.0117079215,0.98168904,0.0034897006,0.00012537661],"about_ca_topic_score_codex":2.3627801e-7,"about_ca_topic_score_gemma":1.0197461e-7,"teacher_disagreement_score":0.023321249,"about_ca_system_score_codex":0.000022516115,"about_ca_system_score_gemma":0.000014099113,"threshold_uncertainty_score":0.4689198},"labels":[],"label_agreement":null},{"id":"W1988752459","doi":"10.1016/j.jcta.2010.11.015","title":"On polynomial integrals over the orthogonal group","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":25,"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; Haar measure; Group (periodic table); Measure (data warehouse); Combinatorics; Polynomial; Type (biology); Haar; Pure mathematics; Mathematical analysis; Physics; Computer science; Quantum mechanics","score_opus":0.015585444995203382,"score_gpt":0.2842858870133922,"score_spread":0.2687004420181888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988752459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.971558,0.000026193133,0.00043177628,0.00075698824,0.015245614,0.0002045311,0.000010498798,0.000027127708,0.011739291],"genre_scores_gemma":[0.99431634,0.000009460652,0.0011053048,0.0002448295,0.0031980593,0.000007805979,7.106924e-7,0.000036138743,0.0010813706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981054,0.00030487467,0.0007653112,0.00011319203,0.0004664362,0.00024479852],"domain_scores_gemma":[0.9949045,0.0037823932,0.000587673,0.00040689477,0.00017791831,0.00014061992],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030951058,0.00021625344,0.0004685624,0.000103253115,0.00023057385,0.00012346334,0.00047942673,0.00016356538,0.0030524635],"category_scores_gemma":[0.0035341086,0.0001173795,0.00035860966,0.00015187457,0.00023512793,0.00024872483,0.000068951056,0.0009751064,0.000024677332],"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.0012687028,0.00026634504,0.000018041606,0.00001559915,0.00009839703,0.00000946262,0.00025258202,3.262664e-7,0.001456496,0.9676138,0.028339026,0.00066119776],"study_design_scores_gemma":[0.0009581133,0.00070169516,0.00008334214,0.00004585744,0.00007687853,0.00015628933,0.00016339091,0.0000025139568,0.0010511806,0.9389083,0.05771896,0.00013347271],"about_ca_topic_score_codex":0.0000017954939,"about_ca_topic_score_gemma":0.0000050129206,"teacher_disagreement_score":0.029379932,"about_ca_system_score_codex":0.00002899124,"about_ca_system_score_gemma":0.000095174,"threshold_uncertainty_score":0.9978589},"labels":[],"label_agreement":null},{"id":"W1989541938","doi":"10.1016/j.jcta.2009.09.001","title":"Map operations and k-orbit maps","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":41,"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":"Orbit (dynamics); Automorphism group; Mathematics; Automorphism; Heteroclinic orbit; Truncation (statistics); Genus; Physics; Combinatorics; Homoclinic orbit; Bifurcation; Biology","score_opus":0.02877329543576233,"score_gpt":0.31500807998242664,"score_spread":0.2862347845466643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989541938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9646415,0.0011559682,0.0017777679,0.0063092317,0.005641893,0.0005639643,0.00002109724,0.000092646595,0.019795949],"genre_scores_gemma":[0.9924572,0.00006582679,0.0044578444,0.00013170311,0.00095403154,0.0000024172505,0.000001282408,0.000025769235,0.0019039278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832,0.0004178117,0.0005143434,0.00010696086,0.00040498644,0.00023589557],"domain_scores_gemma":[0.99843615,0.0006429548,0.00017089922,0.00024019321,0.00035250516,0.00015726557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024858483,0.00015067896,0.00036542735,0.00016184374,0.00017895475,0.00014168413,0.0002989492,0.00009950395,0.000254169],"category_scores_gemma":[0.0012242256,0.000121087294,0.00010459372,0.00013411883,0.00015190212,0.0005427839,0.000044857512,0.00041305108,0.0000135602695],"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.0008658087,0.00015950501,0.000015106612,0.000022785065,0.00004838316,0.000051468287,0.0007917848,0.000002286298,0.0014293661,0.9929927,0.0027897283,0.00083108636],"study_design_scores_gemma":[0.0011807369,0.001282512,0.00005748219,0.00005486122,0.000036615344,0.000253201,0.0006545937,0.000004664909,0.0015322419,0.984907,0.009911116,0.0001249932],"about_ca_topic_score_codex":5.824018e-7,"about_ca_topic_score_gemma":7.1923574e-7,"teacher_disagreement_score":0.027815714,"about_ca_system_score_codex":0.000049730403,"about_ca_system_score_gemma":0.00009837088,"threshold_uncertainty_score":0.49377966},"labels":[],"label_agreement":null},{"id":"W1993463637","doi":"10.1016/j.jcta.2012.03.011","title":"Piercing quasi-rectangles—On a problem of Danzer and Rogers","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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","funders":"","keywords":"Rectangle; Square (algebra); Unit square; Combinatorics; Mathematics; Center (category theory); Unit (ring theory); Rotation (mathematics); Trajectory; Geometry; Physics; Crystallography","score_opus":0.00868938134234849,"score_gpt":0.2312529134461897,"score_spread":0.22256353210384122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993463637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86574143,0.0013392267,0.12390156,0.0005667694,0.0058263466,0.0001702401,0.000001630725,0.000025677184,0.0024271486],"genre_scores_gemma":[0.98886806,0.00002780819,0.010525299,0.00005242101,0.0004577881,0.0000012964855,3.5659718e-7,0.000005435891,0.00006152243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989292,0.0001889329,0.0003473076,0.00008097784,0.0003052306,0.00014835803],"domain_scores_gemma":[0.9989406,0.00027382493,0.00035795607,0.00011654923,0.00020562123,0.00010544805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014631491,0.00009473512,0.00021121433,0.0001548432,0.00007706736,0.000051244042,0.0002195958,0.000045278895,0.0000087445915],"category_scores_gemma":[0.000121601915,0.00007782915,0.000068220485,0.00026629036,0.00004666558,0.0009690243,0.00006660903,0.00012784502,0.0000011864311],"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.00022661591,0.00016551223,0.00022914015,0.00001646065,0.00003675878,0.0000025599666,0.0014288417,0.00013830305,0.002021767,0.98161006,0.00015784478,0.013966163],"study_design_scores_gemma":[0.0018701017,0.0027282177,0.0014706634,0.0001568207,0.00004307545,0.00034504003,0.0003704171,0.0003595868,0.034598764,0.94164306,0.016138341,0.00027591543],"about_ca_topic_score_codex":8.192689e-7,"about_ca_topic_score_gemma":1.03073006e-7,"teacher_disagreement_score":0.12312667,"about_ca_system_score_codex":0.00003020006,"about_ca_system_score_gemma":0.00007240921,"threshold_uncertainty_score":0.31737807},"labels":[],"label_agreement":null},{"id":"W1993609467","doi":"10.1016/s0097-3165(03)00053-0","title":"Decompositions of complete multigraphs derived from Hadamard matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Combinatorics; Mathematical analysis","score_opus":0.0073355197483380655,"score_gpt":0.19867845312648041,"score_spread":0.19134293337814234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993609467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98541296,0.0021714463,0.0023701435,0.000013583369,0.006632,0.00011118332,0.000043596516,0.0000476712,0.0031974395],"genre_scores_gemma":[0.99843574,0.00014482421,0.0011892042,0.000008491549,0.00017859993,0.0000030233543,0.0000027207736,0.000025469177,0.000011958952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843836,0.00037999055,0.0006838009,0.000081041806,0.00023422726,0.00018259336],"domain_scores_gemma":[0.9987755,0.0004149109,0.00031530843,0.00020192079,0.00018161972,0.00011077948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065695134,0.00018007371,0.0004901934,0.00017594188,0.00008977433,0.000037267306,0.00026275392,0.000097396536,0.000176254],"category_scores_gemma":[0.000091534224,0.0001624882,0.00026670177,0.0002460294,0.000116403775,0.000324782,0.00001332722,0.00022317615,0.000004630649],"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.0006216905,0.00013302437,0.00063876377,0.00007772437,0.0006363529,0.00003298113,0.0011913562,0.001199636,0.13951716,0.85536355,0.00038027397,0.00020747918],"study_design_scores_gemma":[0.0024502045,0.00040883487,0.0009830366,0.00022383648,0.00016914886,0.0001242792,0.0018176422,0.000043393753,0.09730841,0.8809769,0.01517243,0.00032189145],"about_ca_topic_score_codex":0.0000049887803,"about_ca_topic_score_gemma":0.0000017721563,"teacher_disagreement_score":0.04220874,"about_ca_system_score_codex":0.000026400026,"about_ca_system_score_gemma":0.000028784681,"threshold_uncertainty_score":0.6626076},"labels":[],"label_agreement":null},{"id":"W1994066278","doi":"10.1006/jcta.2001.3231","title":"A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; School of Mathematics, Institute for Research in Fundamental Sciences","keywords":"Mathematics; Combinatorics; Hadamard transform; Diagonal; Graph; Hadamard matrix; Block (permutation group theory); Block matrix; Order (exchange); Discrete mathematics; Geometry; Physics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.006470355454004183,"score_gpt":0.20229150830952286,"score_spread":0.19582115285551868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994066278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98199767,0.007353765,0.00004870853,0.000095257215,0.008176881,0.0001385411,0.0000036552967,0.00009717677,0.0020883724],"genre_scores_gemma":[0.99812824,0.00045531796,0.00010591769,0.000009447173,0.0005985373,0.0000024372305,4.947348e-7,0.000045856315,0.0006537604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984358,0.00024678186,0.00058497424,0.00012425768,0.00030377964,0.0003043885],"domain_scores_gemma":[0.99902606,0.00015879188,0.00020936635,0.00026113048,0.00015356454,0.00019108513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008407883,0.00025382012,0.00048983283,0.00020551571,0.00012897394,0.00011916166,0.00027662303,0.00012277381,0.00012883828],"category_scores_gemma":[0.00009284044,0.0002254389,0.00017604209,0.00033102385,0.00012326498,0.00051555573,0.000035743324,0.00039824395,0.000010967766],"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.0007414572,0.00008836359,0.00029922143,0.00011144891,0.0004291832,0.0001315492,0.0011251953,0.0012080356,0.0072738566,0.9845903,0.0031430717,0.0008583418],"study_design_scores_gemma":[0.0043948954,0.001312894,0.00015171392,0.0002363377,0.00021030742,0.0014441554,0.0011802565,0.00035816446,0.0040763062,0.90196323,0.08407463,0.000597133],"about_ca_topic_score_codex":0.0000019713668,"about_ca_topic_score_gemma":9.3648663e-7,"teacher_disagreement_score":0.08262707,"about_ca_system_score_codex":0.000046666697,"about_ca_system_score_gemma":0.000012765214,"threshold_uncertainty_score":0.91931313},"labels":[],"label_agreement":null},{"id":"W1994907374","doi":"10.1016/j.jcta.2004.01.009","title":"Labelled and unlabelled enumeration of k-gonal 2-trees","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"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é du Québec à Montréal","funders":"","keywords":"Enumeration; Combinatorics; Mathematics","score_opus":0.016552700683581934,"score_gpt":0.2807712878681287,"score_spread":0.26421858718454677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994907374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878958,0.00044104998,0.0061648604,0.00029537274,0.0039402605,0.00029519806,0.0000047718427,0.000034544464,0.0009281464],"genre_scores_gemma":[0.98148644,0.000110690155,0.017791713,0.000014152179,0.00043548277,0.0000037463897,6.462964e-7,0.00003813793,0.0001190103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794495,0.00016135834,0.0010326407,0.00012698816,0.00052948855,0.0002045767],"domain_scores_gemma":[0.99700385,0.0008199666,0.0012078779,0.00025820502,0.0005920588,0.00011801344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013073805,0.0002281376,0.0007323814,0.00014954056,0.000112844216,0.000034964698,0.0002710238,0.00013833778,0.00004929969],"category_scores_gemma":[0.00199127,0.00019102146,0.00014821065,0.00022762961,0.00021129275,0.000510423,0.000097202406,0.00028911713,0.0000016361067],"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.0010187284,0.00037389854,0.000033977813,0.000102193706,0.00014275943,0.000016920323,0.0014404759,0.000042636028,0.006275581,0.99027395,0.00006215962,0.00021672246],"study_design_scores_gemma":[0.0048903446,0.0010869339,0.000019023879,0.0002066307,0.00012477473,0.0001327829,0.0004865148,0.0000034070013,0.032100305,0.9602905,0.0004916354,0.00016714176],"about_ca_topic_score_codex":0.0000015068041,"about_ca_topic_score_gemma":0.0000014642362,"teacher_disagreement_score":0.02998344,"about_ca_system_score_codex":0.00008861273,"about_ca_system_score_gemma":0.00017833697,"threshold_uncertainty_score":0.7789629},"labels":[],"label_agreement":null},{"id":"W1996052195","doi":"10.1006/jcta.2000.3143","title":"New Codes from Old; A New Geometric Construction","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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; Western University","funders":"","keywords":"Computer science; Engineering drawing; Mathematics; Engineering","score_opus":0.0095552161052839,"score_gpt":0.22841441317189198,"score_spread":0.21885919706660809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996052195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1013573,0.0007842747,0.88407207,0.0009752419,0.011859794,0.0000714384,0.000001463653,0.000041639832,0.0008368023],"genre_scores_gemma":[0.7803009,0.00045045538,0.20739968,0.00033281208,0.007959162,0.0000013069921,0.00000716076,0.00001986031,0.0035286313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.00016071873,0.00047710416,0.00016446895,0.00047906462,0.00016842161],"domain_scores_gemma":[0.9984379,0.00035829755,0.00045029246,0.00021356982,0.0003022247,0.0002377137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057966425,0.00013858314,0.00027210143,0.00039205005,0.00012160673,0.00025780208,0.0005396232,0.00007907986,0.00022334159],"category_scores_gemma":[0.00032849272,0.00012536359,0.00013195515,0.0012348929,0.00003416612,0.0013954717,0.00008860028,0.00019453197,0.000015859348],"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.0003819956,0.000047115787,0.00023233265,0.0000017748785,0.00007407764,0.000034515182,0.00029108394,0.0006051989,0.00065913814,0.85914814,0.0047810394,0.13374358],"study_design_scores_gemma":[0.0015312361,0.00045870378,0.0009133795,0.000023372952,0.000025145337,0.00043906106,0.00006655983,0.00015359987,0.0037555024,0.9291226,0.06336414,0.00014668939],"about_ca_topic_score_codex":0.000038239214,"about_ca_topic_score_gemma":0.0000017137135,"teacher_disagreement_score":0.67894363,"about_ca_system_score_codex":0.00006948077,"about_ca_system_score_gemma":0.0004723312,"threshold_uncertainty_score":0.5112179},"labels":[],"label_agreement":null},{"id":"W1996369432","doi":"10.1016/j.jcta.2005.05.002","title":"Inequalities between Littlewood–Richardson coefficients","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"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; Université du Québec à Montréal","funders":"","keywords":"Inequality; Mathematics; Mathematical economics; Applied mathematics; Economics; Mathematical analysis","score_opus":0.03674467252206416,"score_gpt":0.32052073444180434,"score_spread":0.2837760619197402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996369432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418502,0.00063747517,0.032806486,0.0009826623,0.014563908,0.00062774663,0.00003707821,0.00023613608,0.008258335],"genre_scores_gemma":[0.98158765,0.000042527096,0.01284546,0.000048576396,0.0044147484,0.000006752376,0.00000176545,0.00008592093,0.0009666142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996369,0.00046794215,0.001528281,0.00018767634,0.0009911319,0.00045598717],"domain_scores_gemma":[0.99486816,0.0022362545,0.0014210608,0.00048964494,0.0007459904,0.00023887203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002850026,0.00036112263,0.00101267,0.00023456442,0.00017947714,0.000101866455,0.0007434089,0.00021036972,0.00016864864],"category_scores_gemma":[0.0040727207,0.0003070262,0.0003167525,0.0003594184,0.00018467077,0.00087221013,0.00017382774,0.0005769145,0.000027174721],"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.00041681924,0.00035001515,0.00008991246,0.000094545445,0.00016610528,0.000014152466,0.0021405492,0.000012905135,0.00017898716,0.99280167,0.0014460289,0.0022883324],"study_design_scores_gemma":[0.0020999503,0.00076607894,0.000013608066,0.00017750676,0.00015187156,0.00006816137,0.0009809065,0.000004553419,0.007214476,0.9490952,0.039121836,0.00030588653],"about_ca_topic_score_codex":6.93432e-7,"about_ca_topic_score_gemma":3.7139088e-7,"teacher_disagreement_score":0.04370648,"about_ca_system_score_codex":0.00025556434,"about_ca_system_score_gemma":0.00016404888,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W1997415583","doi":"10.1016/j.jcta.2011.07.005","title":"Binary bubble languages and cool-lex order","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"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; University of Guelph; University of Victoria","funders":"","keywords":"Substring; Mathematics; Combinatorics; Lexicographical order; Binary number; String (physics); Discrete mathematics; Order (exchange); De Bruijn sequence; Set (abstract data type); Computer science; Arithmetic","score_opus":0.010322232063146836,"score_gpt":0.2343718908907133,"score_spread":0.22404965882756647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997415583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94575953,0.00402947,0.020768395,0.0005611595,0.009658907,0.00020062835,0.000004262553,0.00019492456,0.0188227],"genre_scores_gemma":[0.9897966,0.00014345162,0.009079728,0.00018831607,0.000356766,0.0000017191276,3.1161272e-7,0.000015086543,0.00041801692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988475,0.00021453778,0.00034198674,0.00014534219,0.00023889783,0.00021176258],"domain_scores_gemma":[0.9988852,0.00017109368,0.00030268202,0.000302601,0.0002090415,0.00012934227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011907272,0.00014884895,0.00028597616,0.000121433404,0.00011305136,0.00010989628,0.00070633134,0.00007605016,0.00013491126],"category_scores_gemma":[0.00016127212,0.00011432186,0.000074589065,0.0002507126,0.000143554,0.0011584561,0.00024855003,0.00020619843,0.000007935443],"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.0003570206,0.0001054057,0.00010860169,0.000012159039,0.000050399765,0.0001619455,0.0023052772,8.381462e-7,0.001081019,0.9903746,0.0007114349,0.0047312896],"study_design_scores_gemma":[0.0011989616,0.0011920689,0.0013675159,0.00006321981,0.000026360793,0.00061367435,0.0013261802,0.000056033565,0.006591406,0.97852254,0.008809183,0.00023282801],"about_ca_topic_score_codex":0.000006614,"about_ca_topic_score_gemma":3.1603037e-7,"teacher_disagreement_score":0.04403705,"about_ca_system_score_codex":0.000018344374,"about_ca_system_score_gemma":0.00008173148,"threshold_uncertainty_score":0.46619102},"labels":[],"label_agreement":null},{"id":"W1999618093","doi":"10.1016/j.jcta.2011.02.006","title":"A bijection for covered maps, or a shortcut between Harer–Zagierʼs and Jacksonʼs formulas","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":22,"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","funders":"","keywords":"Bijection; Bipartite graph; Combinatorics; Genus; Tree (set theory); Mathematics; Botany; Biology; Graph","score_opus":0.09212673232476869,"score_gpt":0.32207747192891456,"score_spread":0.22995073960414586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999618093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053766906,0.00020961635,0.9373809,0.00013875298,0.006117352,0.0008292653,0.0002898185,0.00005996136,0.0012074193],"genre_scores_gemma":[0.93995976,0.00007351354,0.05810345,0.000052367388,0.0011690672,0.000028944085,0.0000054422994,0.000065916305,0.00054152857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867076,0.00006910295,0.00061839167,0.00013716794,0.00025767792,0.00024693043],"domain_scores_gemma":[0.9973669,0.0014228029,0.00048669198,0.00014117666,0.00041950235,0.0001629108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009961027,0.0001866677,0.00053655746,0.00009328357,0.00013893346,0.00005742244,0.00019084493,0.00013909423,0.000116904215],"category_scores_gemma":[0.0038865847,0.0001340692,0.00011553618,0.0001241043,0.00006973521,0.00033861428,0.000059195874,0.00019923851,0.0000011402472],"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.0054608053,0.00010588463,0.000020730968,0.00019325585,0.00016910695,0.000016526443,0.00097457354,6.093194e-8,0.000054144624,0.98879445,0.0013491226,0.0028613452],"study_design_scores_gemma":[0.0020960383,0.0034999847,0.00002352154,0.00012649376,0.00026557766,0.00015318814,0.0006840029,0.000025234622,0.0016259418,0.9874146,0.003913541,0.00017187378],"about_ca_topic_score_codex":0.000001567309,"about_ca_topic_score_gemma":0.0000017090994,"teacher_disagreement_score":0.88619286,"about_ca_system_score_codex":0.000048219106,"about_ca_system_score_gemma":0.00013356493,"threshold_uncertainty_score":0.5467183},"labels":[],"label_agreement":null},{"id":"W1999694424","doi":"10.1016/j.jcta.2010.11.014","title":"Asymptotic enumeration and limit laws for graphs of fixed genus","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":40,"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","funders":"","keywords":"Mathematics; Combinatorics; Enumeration; Genus; Planar graph; Planar; Exponential function; Graph; Limit (mathematics); Exponential growth; Discrete mathematics; Surface (topology); Random graph; Limit of a function; Mathematical analysis; Geometry; Computer science","score_opus":0.017847354399316555,"score_gpt":0.28617199868673954,"score_spread":0.268324644287423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999694424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5970039,0.00019124373,0.39278013,0.00032458056,0.008742786,0.00045561313,0.000048065758,0.000020461352,0.00043324844],"genre_scores_gemma":[0.97435194,0.000020545709,0.025251219,0.000014896024,0.00029338882,0.000005593354,7.7519826e-7,0.000016746571,0.000044902867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908173,0.000044679957,0.0004753823,0.000076075434,0.00019741814,0.00012473986],"domain_scores_gemma":[0.9973041,0.0015842244,0.00045900416,0.000111789166,0.00045831045,0.00008257582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087436056,0.00010594055,0.000343331,0.000060611772,0.00007329849,0.000031424493,0.00012833106,0.00009794075,0.00003687578],"category_scores_gemma":[0.004482644,0.00008452833,0.000088304194,0.00007402896,0.0000816954,0.00014992824,0.00002559574,0.00019359945,2.7269743e-7],"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.0008052751,0.000089002606,0.0000056090075,0.00013281895,0.00005692634,0.0000025672514,0.00026945092,3.097606e-7,0.005895498,0.9904756,0.00014155653,0.0021254055],"study_design_scores_gemma":[0.0011873019,0.0011688377,0.000014889565,0.000043881602,0.00012313787,0.00006806001,0.00013830345,0.00009659971,0.006687218,0.98955554,0.000830554,0.00008566251],"about_ca_topic_score_codex":4.6283927e-7,"about_ca_topic_score_gemma":0.000001513386,"teacher_disagreement_score":0.37734807,"about_ca_system_score_codex":0.0000073529577,"about_ca_system_score_gemma":0.000068689864,"threshold_uncertainty_score":0.5366468},"labels":[],"label_agreement":null},{"id":"W2001092675","doi":"10.1016/j.jcta.2007.04.005","title":"On generalized separating hash families","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Hash function; Double hashing; Mathematics; Hash chain; SHA-2; Collision resistance; Computer science; Theoretical computer science; Hash table; Computer security","score_opus":0.005995814983847147,"score_gpt":0.21914593369610458,"score_spread":0.21315011871225742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001092675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9629962,0.00044039305,0.0017064261,0.000014169914,0.012701852,0.00008566729,0.0000021680448,0.00008764507,0.0219655],"genre_scores_gemma":[0.9985705,0.00004429601,0.0001701215,0.00003468001,0.0009526511,0.000001437042,6.6350543e-7,0.000031534804,0.00019412451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861854,0.00014990369,0.00060792535,0.000074862204,0.00028626536,0.00026252438],"domain_scores_gemma":[0.9990602,0.00035227262,0.00018905026,0.00016763728,0.00011585102,0.00011496488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022966648,0.00018388774,0.0003639938,0.00018568702,0.00010723055,0.00005588772,0.00022962659,0.00010844076,0.00007346395],"category_scores_gemma":[0.00014487334,0.00015423565,0.00018259845,0.00020333896,0.00006885463,0.00027978816,0.000015400421,0.0003070331,0.000011769661],"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.0010819994,0.000037588878,0.000041826603,0.000030779356,0.00012967635,0.00006297645,0.0007791968,0.0016225973,0.008820896,0.9853133,0.0010356948,0.0010434544],"study_design_scores_gemma":[0.0020435487,0.0007682043,0.00011525515,0.00014796358,0.00004019351,0.00019497664,0.00162849,0.000044955585,0.042087212,0.92505497,0.027572079,0.00030215114],"about_ca_topic_score_codex":7.6863637e-7,"about_ca_topic_score_gemma":9.713945e-7,"teacher_disagreement_score":0.060258344,"about_ca_system_score_codex":0.0000554596,"about_ca_system_score_gemma":0.000019628415,"threshold_uncertainty_score":0.62895477},"labels":[],"label_agreement":null},{"id":"W2001303594","doi":"10.1016/j.jcta.2008.01.012","title":"The 2-adic valuation of a sequence arising from a rational integral","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":25,"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":"National Science Foundation","keywords":"Valuation (finance); Sequence (biology); Quartic function; Mathematics; Integer sequence; Discrete mathematics; Pure mathematics; Economics; Chemistry; Finance","score_opus":0.07428530349154007,"score_gpt":0.299901273683655,"score_spread":0.22561597019211493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001303594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807735,0.00019823608,0.013601667,0.0002036532,0.0043138904,0.00012943974,0.0000064341125,0.000015427284,0.00075773435],"genre_scores_gemma":[0.9970462,0.00007150938,0.0020490864,0.000015340074,0.0006753642,0.0000026397217,0.0000013423729,0.0000119120505,0.00012662545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983452,0.0003119382,0.0006543565,0.000069668895,0.0005008407,0.0001179713],"domain_scores_gemma":[0.9972796,0.0011711834,0.0008264431,0.00016472116,0.00051137805,0.00004667029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015376192,0.00010691573,0.00026131872,0.000057658763,0.00029465946,0.00003538797,0.00020836496,0.00008640549,0.000044687928],"category_scores_gemma":[0.0014635613,0.000070788556,0.00016127648,0.00014555256,0.0002420076,0.00042865076,0.00002664678,0.0002809655,0.0000015054615],"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.0012126006,0.00007024847,0.00009397439,0.0000071504724,0.00009772915,0.000008346773,0.0013384906,0.000011382304,0.0048157917,0.99020463,0.0003214441,0.0018181957],"study_design_scores_gemma":[0.00082838675,0.00042801248,0.00021793056,0.00005845653,0.00005690625,0.00015550337,0.0005310552,0.00007317205,0.013068227,0.9826668,0.0018436053,0.00007195347],"about_ca_topic_score_codex":0.000013614292,"about_ca_topic_score_gemma":0.0000054471857,"teacher_disagreement_score":0.016272662,"about_ca_system_score_codex":0.00008117588,"about_ca_system_score_gemma":0.00023480254,"threshold_uncertainty_score":0.28866735},"labels":[],"label_agreement":null},{"id":"W2001779588","doi":"10.1006/jcta.1999.3036","title":"Some New Bounds for Cover-Free Families","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":102,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cover (algebra); Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Engineering; Mathematical analysis","score_opus":0.015494861498290434,"score_gpt":0.26975640607044293,"score_spread":0.2542615445721525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001779588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9547408,0.0024043696,0.0012559262,0.0011621392,0.022794986,0.00064816256,0.00006492645,0.00011357357,0.016815098],"genre_scores_gemma":[0.9341671,0.0015627632,0.016716104,0.0007675112,0.017273327,0.000015417427,0.000004047666,0.00018615345,0.02930758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982854,0.00017434725,0.00069976697,0.00013603589,0.0003985918,0.00030582363],"domain_scores_gemma":[0.9976503,0.0010883596,0.00041181725,0.00047688946,0.00020364102,0.0001689541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012963769,0.00023708421,0.0005701944,0.000119294666,0.00032345374,0.00009880197,0.0007554172,0.00016079872,0.00075369613],"category_scores_gemma":[0.001052753,0.00017909188,0.00041395338,0.0001262963,0.00021391398,0.0006504549,0.00008066437,0.00028181783,0.0000035507678],"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.0037285625,0.000076064185,0.000009853496,0.000045295033,0.00018993586,0.000010449738,0.0013119023,0.0000062017216,0.0000809352,0.9579729,0.03283034,0.003737554],"study_design_scores_gemma":[0.002849707,0.00087622163,0.000015091856,0.000048444108,0.00010712544,0.00009420176,0.00027834656,0.0000013016344,0.0010369538,0.82732236,0.16719365,0.00017656307],"about_ca_topic_score_codex":0.0000015412357,"about_ca_topic_score_gemma":4.3424797e-7,"teacher_disagreement_score":0.13436331,"about_ca_system_score_codex":0.00005314279,"about_ca_system_score_gemma":0.00017045661,"threshold_uncertainty_score":0.82524437},"labels":[],"label_agreement":null},{"id":"W2001861700","doi":"10.1016/j.jcta.2012.05.004","title":"Character-theoretic techniques for near-central enumerative problems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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 Waterloo","funders":"","keywords":"Centralizer and normalizer; Factorization; Mathematics; Combinatorics; Enumeration; Genus; Symmetric group; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.024414076731989923,"score_gpt":0.30196833595456946,"score_spread":0.27755425922257954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001861700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.591298,0.00196088,0.31595507,0.0014174131,0.07203751,0.007286316,0.0000980385,0.00078854663,0.009158243],"genre_scores_gemma":[0.929147,0.00006147367,0.06611278,0.00006248521,0.00404377,0.00009795838,0.0000028195757,0.00013149407,0.00034021866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971714,0.00035127232,0.0011217277,0.00015129692,0.00050116435,0.00070316525],"domain_scores_gemma":[0.9954627,0.0017708926,0.0014168366,0.00037295162,0.0006873114,0.00028926446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027151357,0.0003665485,0.00085146003,0.00010891409,0.00024398224,0.00011942904,0.0004914183,0.00021332758,0.00008960399],"category_scores_gemma":[0.0032941254,0.00029673977,0.00036380545,0.00020164737,0.0002899984,0.001307787,0.00009660856,0.00046045604,0.0000042210722],"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.00092073047,0.0006223998,0.00004673102,0.00023637312,0.00015452153,0.000003608533,0.0037761903,7.8039903e-7,0.0012789452,0.99140567,0.000666569,0.0008874648],"study_design_scores_gemma":[0.001403957,0.0011828151,0.000008002702,0.00021891634,0.00016972935,0.00014432786,0.00044886488,0.000006501757,0.025824921,0.9425883,0.027696272,0.00030738625],"about_ca_topic_score_codex":3.361219e-7,"about_ca_topic_score_gemma":1.16036254e-7,"teacher_disagreement_score":0.33784905,"about_ca_system_score_codex":0.00020396801,"about_ca_system_score_gemma":0.00016073264,"threshold_uncertainty_score":0.9999485},"labels":[],"label_agreement":null},{"id":"W2003130149","doi":"10.1016/j.jcta.2004.10.006","title":"On a conjecture of Brown concerning accessible sets","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Pure mathematics","score_opus":0.023209250469334558,"score_gpt":0.3031206753338589,"score_spread":0.27991142486452436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003130149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835367,0.00038053497,0.00029521596,0.0002254627,0.0038446293,0.00013036304,0.000009456093,0.000024110193,0.011553497],"genre_scores_gemma":[0.99702847,0.000037547197,0.0017610791,0.00011240224,0.0007780557,0.0000013149996,4.2770486e-7,0.000028915689,0.00025178026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814045,0.00033421553,0.0007357604,0.00011487578,0.0004625609,0.00021215311],"domain_scores_gemma":[0.99700916,0.0012999808,0.0010216173,0.00028287742,0.0002882923,0.00009808719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401444,0.00020440751,0.0005852796,0.00015431453,0.0001592708,0.000038233153,0.00046507717,0.00015962489,0.0005304802],"category_scores_gemma":[0.0010270936,0.00014351089,0.00026158305,0.00015807488,0.00021918495,0.00035093483,0.00009275578,0.00046528698,0.0000013208039],"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.0018441953,0.000109844535,0.00006188845,0.000055406013,0.00017001158,0.000016670649,0.0020528997,0.00003823359,0.00044901346,0.9912807,0.001674258,0.0022469151],"study_design_scores_gemma":[0.0018154993,0.00079232984,0.000044619243,0.00018735518,0.00007783941,0.00012547785,0.0003233916,0.0000037303612,0.014024554,0.9751369,0.0073202173,0.00014810669],"about_ca_topic_score_codex":5.665624e-7,"about_ca_topic_score_gemma":5.2127484e-7,"teacher_disagreement_score":0.016143784,"about_ca_system_score_codex":0.000050391467,"about_ca_system_score_gemma":0.00009257255,"threshold_uncertainty_score":0.5852204},"labels":[],"label_agreement":null},{"id":"W2003267114","doi":"10.1006/jcta.2000.3164","title":"Strongly Regular (α, β)-Geometries","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":"University of Toronto","funders":"","keywords":"Mathematics; Strongly regular graph; Graph; Point (geometry); Class (philosophy); Geometry; Pure mathematics; Combinatorics; Computer science; Line graph; Artificial intelligence","score_opus":0.04099810295209044,"score_gpt":0.3186384195708372,"score_spread":0.2776403166187468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003267114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770477,0.00058970304,0.0018382589,0.0006093,0.0046472126,0.00024467314,0.0000066240295,0.00006891854,0.014947629],"genre_scores_gemma":[0.99179757,0.00017308783,0.0018897603,0.000027119739,0.001629512,0.0000046647415,0.0000011033127,0.000066959874,0.0044102445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700224,0.000587467,0.0008430268,0.00015479355,0.0009568079,0.00045565097],"domain_scores_gemma":[0.99601656,0.0019206777,0.0006177146,0.00048069924,0.0007452373,0.00021910576],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0052878573,0.00023731726,0.0006224268,0.00045494773,0.00018404433,0.00013690902,0.0007466368,0.00015784617,0.00096898887],"category_scores_gemma":[0.0054253596,0.00019316262,0.00028721412,0.0007553375,0.00034941998,0.0007744005,0.00015526883,0.00060581614,0.000025820375],"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.0039187325,0.00024778416,0.0002804942,0.000037960148,0.00018152682,0.00024328746,0.00046200334,0.0000033962856,0.00083370047,0.9899639,0.002720737,0.001106462],"study_design_scores_gemma":[0.0017113711,0.0013305121,0.00007269467,0.00007061426,0.000058532776,0.0006297655,0.0013272695,0.000001389449,0.0029338996,0.9355964,0.05608435,0.00018319664],"about_ca_topic_score_codex":0.000001084715,"about_ca_topic_score_gemma":6.9574094e-7,"teacher_disagreement_score":0.054367512,"about_ca_system_score_codex":0.00013110483,"about_ca_system_score_gemma":0.00017868922,"threshold_uncertainty_score":0.99994427},"labels":[],"label_agreement":null},{"id":"W2003770393","doi":"10.1016/s0097-3165(02)00018-3","title":"Some new triplewhist tournaments TWh(v)","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Concordia University","funders":"","keywords":"Tournament; Mathematics; Product (mathematics); Frame (networking); Combinatorics; Physics; Geometry; Engineering; Mechanical engineering","score_opus":0.006672644512148106,"score_gpt":0.19728052111862196,"score_spread":0.19060787660647385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003770393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83974135,0.013935945,0.0021732226,0.00016943685,0.10376852,0.0004161673,0.000009555973,0.00026202598,0.039523765],"genre_scores_gemma":[0.9965527,0.00025017012,0.00015091983,0.00003415548,0.001567354,0.0000018735713,4.564828e-7,0.00004265255,0.0013997413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984135,0.00027338663,0.0006360591,0.00008509312,0.00031444858,0.0002775361],"domain_scores_gemma":[0.9991106,0.000110230096,0.00022667767,0.0002128931,0.00009398899,0.00024563432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012669892,0.00020933076,0.00043004274,0.00015400254,0.00009320644,0.00008328411,0.0002921943,0.00011459696,0.0002530118],"category_scores_gemma":[0.00020070032,0.00018294522,0.0002322304,0.00020589781,0.00005495287,0.00068808487,0.000012638941,0.0003450915,0.000020596453],"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.0003296113,0.000046834968,0.000053136875,0.000026507612,0.00018675633,0.000048699996,0.00043815555,0.0002691068,0.0024046306,0.9898135,0.005824801,0.000558264],"study_design_scores_gemma":[0.0017917864,0.0003091559,0.000023492132,0.000064233434,0.0000420473,0.00027925204,0.000434081,0.00000281329,0.009086992,0.78278106,0.20499757,0.00018748095],"about_ca_topic_score_codex":8.3462095e-7,"about_ca_topic_score_gemma":2.424802e-7,"teacher_disagreement_score":0.2070324,"about_ca_system_score_codex":0.00009498559,"about_ca_system_score_gemma":0.00009039969,"threshold_uncertainty_score":0.74602896},"labels":[],"label_agreement":null},{"id":"W2005295899","doi":"10.1006/jcta.2000.3060","title":"Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Affine transformation; Mathematics; Hadamard transform; Combinatorics; Upper and lower bounds; Prime power; Order (exchange); Combinatorial design; Hadamard matrix; Discrete mathematics; Prime (order theory); Pure mathematics; Mathematical analysis","score_opus":0.007386910017196912,"score_gpt":0.20423052351866688,"score_spread":0.19684361350146998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005295899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98061293,0.0013424366,0.000020841344,0.00007136784,0.0012629726,0.00008103041,0.000003824983,0.000017958087,0.01658664],"genre_scores_gemma":[0.99868536,0.00075804285,0.000038403847,0.000017360177,0.00024142042,0.0000020144619,1.5515914e-7,0.00001745435,0.00023978083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990349,0.00020560909,0.0003619239,0.00006382313,0.00019912046,0.00013465977],"domain_scores_gemma":[0.9990448,0.00057067984,0.0001278984,0.00012830747,0.00006194207,0.000066418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011041221,0.00013781319,0.00030183577,0.000092478964,0.00009054788,0.000068849244,0.00015717237,0.00007405497,0.00028409838],"category_scores_gemma":[0.00007562404,0.00009047349,0.00007510241,0.00024924384,0.0001356547,0.0002232497,0.000013029266,0.00019879019,0.0000035500625],"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.00084398786,0.00004030111,0.00042860614,0.000067980975,0.00016594624,0.000012329114,0.00059242395,0.00007053724,0.00055331085,0.9925194,0.00065075094,0.004054448],"study_design_scores_gemma":[0.0015864761,0.0007675885,0.0015054987,0.00022627188,0.000119565375,0.000513577,0.0011518935,0.000047062775,0.0052440446,0.9518729,0.036691,0.0002741148],"about_ca_topic_score_codex":0.0000019496936,"about_ca_topic_score_gemma":2.2361225e-7,"teacher_disagreement_score":0.04064647,"about_ca_system_score_codex":0.00001412858,"about_ca_system_score_gemma":0.000013093196,"threshold_uncertainty_score":0.3689402},"labels":[],"label_agreement":null},{"id":"W2005621996","doi":"10.1016/j.jcta.2005.04.011","title":"Constructions of generalized Sidon sets","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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 British Columbia","funders":"National Science Foundation","keywords":"Interleaving; Set (abstract data type); Integer (computer science); Property (philosophy); Mathematics; Yield (engineering); Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.005009242748111012,"score_gpt":0.23367982182243097,"score_spread":0.22867057907431995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005621996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91615295,0.0019770227,0.06252763,0.00039861375,0.0048466744,0.00019961802,0.000016935934,0.0003430985,0.013537457],"genre_scores_gemma":[0.96983415,0.0002865837,0.029402995,0.000016449458,0.0003895029,0.0000018627788,7.182584e-7,0.000019866822,0.000047892332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902195,0.000068974085,0.000541924,0.00005258155,0.00018994867,0.00012461124],"domain_scores_gemma":[0.9992864,0.00008679615,0.0002323101,0.0001376595,0.00018560633,0.000071232935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027147259,0.000115779294,0.00038403552,0.0001283054,0.00003411902,0.000011291448,0.00017013085,0.00006575338,0.00018118085],"category_scores_gemma":[0.000094531424,0.00009986561,0.0001794291,0.00022149552,0.0001175868,0.00037368812,0.000020690974,0.00019472414,0.0000020034042],"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.0007061555,0.0001683788,0.000117550466,0.000053585798,0.00059043523,0.000016186183,0.0004041041,0.019207157,0.091285124,0.8386619,0.0026619602,0.046127457],"study_design_scores_gemma":[0.0009891279,0.00029117134,0.000029383998,0.000044326294,0.00010693029,0.00013764463,0.00013508055,0.0003192778,0.25317788,0.6761823,0.06839567,0.0001911507],"about_ca_topic_score_codex":6.689103e-7,"about_ca_topic_score_gemma":3.2817223e-7,"teacher_disagreement_score":0.16247955,"about_ca_system_score_codex":0.00006226152,"about_ca_system_score_gemma":0.000019823441,"threshold_uncertainty_score":0.40724015},"labels":[],"label_agreement":null},{"id":"W2006143633","doi":"10.1006/jcta.2001.3189","title":"A Theory of Ternary Complementary Pairs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"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":"Binary Golay code; Complementary sequences; Autocorrelation; Ternary operation; Zero (linguistics); Mathematics; Combinatorics; Binary number; Discrete mathematics; Algorithm; Arithmetic; Computer science; Statistics","score_opus":0.009776670719507887,"score_gpt":0.20789294868449082,"score_spread":0.19811627796498293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006143633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97235745,0.0017021704,0.0019775901,0.000053553118,0.010098798,0.00016358618,0.000015095746,0.00007838763,0.013553353],"genre_scores_gemma":[0.99888474,0.00018110292,0.00010803779,0.000024345447,0.00061431277,0.0000028671832,0.0000018227032,0.000033796547,0.0001489875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982215,0.0004009706,0.0007663403,0.00007941461,0.00029966966,0.00023207284],"domain_scores_gemma":[0.99893284,0.0002963885,0.0002925011,0.00023673216,0.0001317905,0.00010977181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019178914,0.00019372611,0.00047976634,0.00017611778,0.00006392846,0.00002224337,0.00039675544,0.00008046169,0.000512739],"category_scores_gemma":[0.000057251942,0.00016552387,0.0002558718,0.0002185567,0.0001465808,0.00039316015,0.00003995158,0.0002629296,0.000005397429],"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.0024698116,0.00013407013,0.0012535806,0.00010498437,0.00049431156,0.0001474469,0.0013488192,0.00042348113,0.0050804177,0.9844178,0.001338028,0.0027872745],"study_design_scores_gemma":[0.0016662547,0.00073616294,0.00042753728,0.00017109029,0.00008228642,0.0005613621,0.0033585823,0.000023073086,0.005760701,0.95403934,0.032959353,0.00021424433],"about_ca_topic_score_codex":0.0000016675016,"about_ca_topic_score_gemma":5.736619e-7,"teacher_disagreement_score":0.031621326,"about_ca_system_score_codex":0.000043211323,"about_ca_system_score_gemma":0.000027568787,"threshold_uncertainty_score":0.6749868},"labels":[],"label_agreement":null},{"id":"W2009560547","doi":"10.1016/j.jcta.2005.05.004","title":"The stationary measure of a 2-type totally asymmetric exclusion process","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":61,"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 Hospital","funders":"","keywords":"Asymmetric simple exclusion process; Measure (data warehouse); Mathematics; Class (philosophy); Process (computing); Type (biology); Statistical physics; Space (punctuation); Simple (philosophy); Pure mathematics; Combinatorics; Computer science; Physics; Statistics; Artificial intelligence; Data mining","score_opus":0.019942808961524016,"score_gpt":0.3038591216700842,"score_spread":0.2839163127085602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009560547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30560222,0.011017252,0.6229266,0.005373181,0.025750129,0.0019418512,0.000085115906,0.00015803662,0.027145645],"genre_scores_gemma":[0.99354833,0.00010662428,0.005596831,0.000028100414,0.0005112465,0.00000288634,5.2302465e-7,0.000021643744,0.00018382251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981065,0.0001455841,0.000731092,0.000085933316,0.0007475275,0.00018340358],"domain_scores_gemma":[0.9950691,0.0023829574,0.00075445,0.00016232855,0.0015405839,0.000090597234],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0018659219,0.00013598328,0.000340026,0.00009177774,0.00018707996,0.000037534264,0.00036530214,0.000080431535,0.00004711818],"category_scores_gemma":[0.009599374,0.00008497675,0.000096514515,0.00044580415,0.00009251988,0.00025253574,0.000057392597,0.0002534325,0.000002221375],"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.0021608437,0.000179497,0.0000017982019,0.00007933887,0.00007343792,0.0000068017334,0.0005496037,0.00002015709,0.00015097477,0.9827448,0.00052518357,0.013507573],"study_design_scores_gemma":[0.0008545953,0.0011470789,0.000010178242,0.000106241765,0.00007979128,0.0000912802,0.0007609657,0.00016113368,0.0012655355,0.99322814,0.0021988167,0.00009623486],"about_ca_topic_score_codex":3.15763e-7,"about_ca_topic_score_gemma":6.739341e-7,"teacher_disagreement_score":0.6879461,"about_ca_system_score_codex":0.000052883734,"about_ca_system_score_gemma":0.00030680822,"threshold_uncertainty_score":0.9987432},"labels":[],"label_agreement":null},{"id":"W2010902762","doi":"10.1016/s0097-3165(02)00015-8","title":"Doubly regular digraphs and symmetric designs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"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 Lethbridge","funders":"","keywords":"Digraph; Adjacency matrix; Combinatorics; Mathematics; Versa; Incidence matrix; Matrix (chemical analysis); Carry (investment); Skew; Construct (python library); Adjacency list; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.008512606908426673,"score_gpt":0.19182302294834708,"score_spread":0.1833104160399204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010902762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96315897,0.007866092,0.0017913262,0.000023367404,0.010596996,0.00017569636,0.0000028267193,0.00009184602,0.016292866],"genre_scores_gemma":[0.99923354,0.0002648868,0.0001386977,0.000010108415,0.00020637487,0.0000026537407,2.1862235e-7,0.00002823337,0.00011530004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873877,0.00031217208,0.0004338755,0.00008322514,0.00021765324,0.00021433161],"domain_scores_gemma":[0.9992232,0.00020745514,0.00014439879,0.00016862349,0.00010945076,0.00014692814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016194795,0.0001744567,0.00035534616,0.00028666176,0.00009328797,0.000075166456,0.00016300424,0.00010807615,0.000042348427],"category_scores_gemma":[0.00019310626,0.00014836882,0.00013625309,0.00046060886,0.00009842421,0.0003999939,0.0000107427095,0.00024184702,0.0000026937785],"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.00019662562,0.000027925144,0.00015513838,0.000044468423,0.00014020722,0.00003392555,0.00029231852,0.000104910956,0.0024344334,0.9958191,0.00030435107,0.00044659415],"study_design_scores_gemma":[0.0013120498,0.0004280644,0.000117582895,0.00006462867,0.000063177366,0.00054180255,0.00060824613,0.000004981246,0.014226894,0.94662076,0.035799935,0.00021185857],"about_ca_topic_score_codex":3.4944344e-7,"about_ca_topic_score_gemma":1.3151887e-7,"teacher_disagreement_score":0.049198326,"about_ca_system_score_codex":0.000027507958,"about_ca_system_score_gemma":0.000024674413,"threshold_uncertainty_score":0.6050305},"labels":[],"label_agreement":null},{"id":"W2010930039","doi":"10.1016/j.jcta.2012.04.005","title":"Generalised quadrangles with a group of automorphisms acting primitively on points and lines","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":22,"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 Lethbridge","funders":"","keywords":"Transitive relation; Automorphism; Quadrangle; Mathematics; Combinatorics; Type (biology); Group (periodic table); Simple (philosophy); Flag (linear algebra); Automorphisms of the symmetric and alternating groups; Outer automorphism group; Pure mathematics; Automorphism group; Algebra over a field; Physics; Geography; Geology; Paleontology","score_opus":0.04801010565271538,"score_gpt":0.3074660429841423,"score_spread":0.2594559373314269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010930039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99684095,0.00017488415,0.00039090784,0.0001822782,0.00088855723,0.00020169602,0.000008143165,0.0000212674,0.0012913104],"genre_scores_gemma":[0.9926908,0.00003395719,0.0063830754,0.00003119666,0.00071650016,0.0000044436447,8.3030505e-7,0.00004672589,0.00009248847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976685,0.000703342,0.000579388,0.00011167536,0.00060091,0.00033617718],"domain_scores_gemma":[0.99620944,0.002212837,0.0007995353,0.00021632104,0.00038011154,0.0001817692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036697816,0.00021398683,0.00057627953,0.00021677288,0.00011162077,0.00004323267,0.0002459955,0.00010789957,0.00008422387],"category_scores_gemma":[0.0017965694,0.00014882624,0.00011039574,0.00020131926,0.00032119994,0.0006171498,0.00008136432,0.00038742294,0.0000017795703],"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.0074332734,0.000481569,0.00086684915,0.00013402152,0.00020154617,0.00002188497,0.0028317294,7.6836864e-7,0.0069197663,0.9801677,0.00011214965,0.00082874467],"study_design_scores_gemma":[0.003712355,0.0034477587,0.0010989651,0.00044294895,0.00012008819,0.00026674458,0.0020607994,0.00000472505,0.03056396,0.9570027,0.0010377706,0.00024119068],"about_ca_topic_score_codex":0.0000026234125,"about_ca_topic_score_gemma":9.857209e-7,"teacher_disagreement_score":0.023644194,"about_ca_system_score_codex":0.000055056444,"about_ca_system_score_gemma":0.00006807533,"threshold_uncertainty_score":0.60689574},"labels":[],"label_agreement":null},{"id":"W2011862520","doi":"10.1006/jcta.2000.3090","title":"Noncommutative Pieri Operators on Posets","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":54,"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":"Hopf algebra; Mathematics; Representation theory of Hopf algebras; Noncommutative geometry; Symmetric function; Morphism; Algebra over a field; Eulerian path; Partially ordered set; Pure mathematics; Cellular algebra; Symmetric algebra; Quasitriangular Hopf algebra; Filtered algebra; Division algebra; Combinatorics; Algebra representation; Lagrangian","score_opus":0.019100193308127778,"score_gpt":0.30764671394888776,"score_spread":0.28854652064076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011862520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9437088,0.00017015348,0.0007395413,0.00048332213,0.010045841,0.0005267317,0.00001613066,0.00013190706,0.044177566],"genre_scores_gemma":[0.98777854,0.000110287394,0.008479963,0.00016728694,0.0013758839,0.000012166396,0.0000012765848,0.00011752876,0.0019570615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969334,0.00057135534,0.0011245703,0.00019481944,0.0007848396,0.00039102344],"domain_scores_gemma":[0.99616313,0.0018287931,0.0007586487,0.0005414791,0.00047223762,0.00023569565],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016386957,0.0003899307,0.00089134846,0.00016678896,0.00022812177,0.00009673427,0.00072662364,0.0001809217,0.0012310683],"category_scores_gemma":[0.0018304604,0.0003131661,0.0003042159,0.00036283568,0.00021195102,0.00069660606,0.00006659109,0.00070164085,0.00006663385],"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.0024612902,0.00062235486,0.000006273855,0.000040621682,0.00017091184,0.00011237277,0.0021216017,0.000034334902,0.00020869801,0.9893756,0.001592024,0.0032539417],"study_design_scores_gemma":[0.0026025926,0.0025086664,0.000006593085,0.0002301126,0.00008712099,0.00020584196,0.00076546095,0.0000051186707,0.006243145,0.96973014,0.017299157,0.00031602746],"about_ca_topic_score_codex":7.646506e-7,"about_ca_topic_score_gemma":3.1614235e-7,"teacher_disagreement_score":0.04406974,"about_ca_system_score_codex":0.0002084958,"about_ca_system_score_gemma":0.00016297946,"threshold_uncertainty_score":0.99993205},"labels":[],"label_agreement":null},{"id":"W2011867530","doi":"10.1016/j.jcta.2013.01.014","title":"A multivariate hook formula for labelled trees","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Mathematical proof; Enumeration; Hook; Combinatorics; Vertex (graph theory); Binary tree; Combinatorial proof; Binary number; Discrete mathematics; Graph; Arithmetic","score_opus":0.025869195108072462,"score_gpt":0.305206108392345,"score_spread":0.27933691328427257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011867530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7179744,0.0007327865,0.22361478,0.0019538463,0.040606067,0.0063896524,0.000043432494,0.0004552217,0.008229764],"genre_scores_gemma":[0.8915613,0.00003731723,0.103299886,0.00008104702,0.0021481477,0.00016580574,0.000001963586,0.00016712132,0.0025373928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739337,0.00023049432,0.001244502,0.00018057987,0.0004978365,0.0004532314],"domain_scores_gemma":[0.9936453,0.0031449464,0.0013733426,0.00044427515,0.0011800383,0.0002120836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015635209,0.00035140716,0.00094497297,0.00016835949,0.00020119034,0.0001262771,0.00061783055,0.00019741163,0.00021981959],"category_scores_gemma":[0.0055064345,0.00027434668,0.0004178039,0.00021168582,0.00012083824,0.0010823357,0.00012018006,0.00033931967,0.00001779295],"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.00099426,0.00041784238,0.000006619598,0.000119073695,0.000224827,0.000007241418,0.0010656543,0.0000072856114,0.0036273524,0.9891091,0.003513208,0.00090752967],"study_design_scores_gemma":[0.005541095,0.0013044975,0.00000789584,0.00014981841,0.00014830542,0.00006936649,0.0007415303,0.00007585148,0.0071600056,0.9763189,0.008181735,0.00030102264],"about_ca_topic_score_codex":0.0000028947634,"about_ca_topic_score_gemma":9.0311585e-7,"teacher_disagreement_score":0.17358686,"about_ca_system_score_codex":0.00013638282,"about_ca_system_score_gemma":0.00013816786,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2012291069","doi":"10.1006/jcta.2000.3089","title":"Multiple Left Regular Representations Generated by Alternants","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"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é du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Coxeter group; Diagonal; Span (engineering); Lattice (music); Geometry; Physics","score_opus":0.018343020946209466,"score_gpt":0.2933913306558475,"score_spread":0.275048309709638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012291069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807887,0.0004396027,0.0054599107,0.00036996606,0.007758198,0.00050589687,0.0000341734,0.0001419216,0.004501639],"genre_scores_gemma":[0.97491753,0.00030927904,0.014497843,0.00007330688,0.001567314,0.000011616061,0.000008233661,0.00014011806,0.00847478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705106,0.0004581291,0.0012084752,0.00021590057,0.0006954073,0.00037102503],"domain_scores_gemma":[0.99669695,0.0011231051,0.0008756496,0.00057826174,0.00051043875,0.00021559621],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011978293,0.00030718083,0.00069647504,0.000107465625,0.0002236666,0.0001015575,0.00061152794,0.00016260635,0.0010339883],"category_scores_gemma":[0.002282895,0.00026837728,0.00024465658,0.0002558932,0.00016714746,0.0007992697,0.000062562525,0.00041046855,0.000025790885],"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.0015383689,0.0007788297,0.000109092136,0.000060605948,0.00029307572,0.000086927656,0.0013203833,0.00007205677,0.009359346,0.96349704,0.02113889,0.0017453873],"study_design_scores_gemma":[0.002740854,0.0004251144,0.0000065282843,0.000095544645,0.00009917653,0.00024628776,0.00029061377,0.000042247728,0.031482052,0.93763703,0.026671192,0.00026334132],"about_ca_topic_score_codex":0.00000387403,"about_ca_topic_score_gemma":0.0000012272211,"teacher_disagreement_score":0.025859991,"about_ca_system_score_codex":0.000119523516,"about_ca_system_score_gemma":0.00012895015,"threshold_uncertainty_score":0.9999768},"labels":[],"label_agreement":null},{"id":"W2012333844","doi":"10.1016/j.jcta.2014.10.009","title":"Dyck path triangulations and extendability","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"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; Government of Canada","keywords":"Matroid; Triangulation; Mathematics; Combinatorics; Cartesian product; Path (computing); Product (mathematics); Oriented matroid; Discrete mathematics; Graphic matroid; Geometry; Computer science","score_opus":0.01809792919344944,"score_gpt":0.29258203959829643,"score_spread":0.274484110404847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012333844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049645,0.00032868685,0.070722684,0.0010151498,0.014438523,0.0006971146,0.000009768693,0.00015553902,0.00766802],"genre_scores_gemma":[0.97770494,0.00002581261,0.02092392,0.00003384722,0.0010330352,0.0000057325174,4.520492e-7,0.000043054613,0.00022918475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772567,0.0005400612,0.00091047253,0.00015494284,0.0004338361,0.00023501004],"domain_scores_gemma":[0.9954264,0.0026451556,0.0008767593,0.0004166122,0.00045663727,0.00017842176],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0032001755,0.00022249023,0.00066055945,0.00010610557,0.00016773149,0.00006811149,0.00028887292,0.00012869878,0.000073734045],"category_scores_gemma":[0.00905903,0.00018048771,0.00016862704,0.0001888658,0.00020690315,0.0005127966,0.00010241814,0.0003329506,0.0000026735336],"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.00044980948,0.00020340037,0.000056031844,0.00007568279,0.000052568048,0.000005025669,0.0006098568,0.000002480372,0.00025981874,0.9963652,0.00027427133,0.0016458583],"study_design_scores_gemma":[0.0021022044,0.00072611374,0.000085260464,0.000083254825,0.00009928056,0.000118439486,0.00033069137,0.000028526403,0.00071101985,0.9882168,0.007315495,0.00018287415],"about_ca_topic_score_codex":5.763433e-7,"about_ca_topic_score_gemma":4.009867e-7,"teacher_disagreement_score":0.07274044,"about_ca_system_score_codex":0.000075118725,"about_ca_system_score_gemma":0.000074229574,"threshold_uncertainty_score":0.9992881},"labels":[],"label_agreement":null},{"id":"W2012585113","doi":"10.1016/j.jcta.2007.10.001","title":"A multi-dimensional approach to the construction and enumeration of Golay complementary sequences","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":85,"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","funders":"","keywords":"Binary Golay code; Mathematics; Complementary sequences; Enumeration; Sequence (biology); Ternary Golay code; Construct (python library); Combinatorics; Algorithm; Computer science; Decoding methods; Biology; Genetics","score_opus":0.016699250436633516,"score_gpt":0.22630774308162727,"score_spread":0.20960849264499376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012585113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98984385,0.00046559257,0.0040569324,0.0001666762,0.0048783002,0.00015588023,0.0000095868345,0.000020788317,0.00040242219],"genre_scores_gemma":[0.9861688,0.000053187876,0.013335391,0.000024341962,0.00038145386,0.0000037155576,0.000001798381,0.000009701345,0.000021629288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916834,0.00010871232,0.00035648025,0.000058658698,0.0002196368,0.0000881467],"domain_scores_gemma":[0.99950963,0.000073563446,0.00013762791,0.00008432395,0.00013998323,0.00005489035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004387919,0.000090462,0.00018368404,0.00007974567,0.00011849237,0.000012419857,0.000107335334,0.00003531059,0.000022542075],"category_scores_gemma":[0.000053800733,0.000066503904,0.000047018824,0.00012420308,0.00018721366,0.0002690796,0.000022685972,0.00014806667,8.536086e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032192809,0.0006127406,0.0031341466,0.00027409036,0.0014764185,0.00003779686,0.024208076,0.15289403,0.2703867,0.51841253,0.018255262,0.007088946],"study_design_scores_gemma":[0.01958447,0.0050137104,0.015773356,0.0005759097,0.00061711314,0.030825043,0.02842148,0.011247828,0.3530984,0.34757018,0.18501078,0.0022617397],"about_ca_topic_score_codex":0.000004427579,"about_ca_topic_score_gemma":4.1448544e-7,"teacher_disagreement_score":0.17084235,"about_ca_system_score_codex":0.000040130246,"about_ca_system_score_gemma":0.00003701423,"threshold_uncertainty_score":0.27119505},"labels":[],"label_agreement":null},{"id":"W2013425391","doi":"10.1016/j.jcta.2012.12.008","title":"On the number of pentagons in triangle-free graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":164,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.017312287981244973,"score_gpt":0.2730303166830055,"score_spread":0.2557180287017605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013425391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98261744,0.00006141847,0.000019004037,0.00060800527,0.0035083634,0.00025392242,0.000005377177,0.000008492715,0.012917981],"genre_scores_gemma":[0.9990364,0.000033107353,0.0003670098,0.000099431854,0.00019879328,0.000007730092,1.8498733e-7,0.000022457773,0.0002349322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784625,0.00063394575,0.0007968114,0.000090519905,0.0004272555,0.00020520821],"domain_scores_gemma":[0.9953698,0.0031129813,0.0006996258,0.0005144413,0.00023649445,0.00006667056],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021370274,0.00017410814,0.0005124487,0.00014120441,0.00011656329,0.000036637422,0.00079469493,0.00010851485,0.0014575003],"category_scores_gemma":[0.0026376129,0.00009798126,0.0003170439,0.00025405773,0.00027973758,0.00026125324,0.00013763206,0.00044842288,0.0000043381506],"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.0008904198,0.00016993085,0.0003652819,0.000021921012,0.00010100617,0.0000090110425,0.001229056,8.9325505e-7,0.00013261719,0.9914896,0.005360663,0.00022959565],"study_design_scores_gemma":[0.0018722554,0.0003210397,0.00049472105,0.000098707584,0.000037924034,0.000062637846,0.0012350733,6.860734e-7,0.0014138661,0.9938669,0.00049010204,0.00010607929],"about_ca_topic_score_codex":0.000006116842,"about_ca_topic_score_gemma":0.0000012579922,"teacher_disagreement_score":0.016418917,"about_ca_system_score_codex":0.000031467705,"about_ca_system_score_gemma":0.00004881717,"threshold_uncertainty_score":0.9994553},"labels":[],"label_agreement":null},{"id":"W2013789449","doi":"10.1016/j.jcta.2014.11.005","title":"Half-turn symmetric alternating sign matrices and Tokuyama type factorisation for orthogonal group characters","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sign (mathematics); Factorization; Orthogonal group; Group (periodic table); Character (mathematics); Combinatorics; Type (biology); General linear group; Pure mathematics; Weyl group; Symmetric group; Geometry; Mathematical analysis; Physics","score_opus":0.01843054326254419,"score_gpt":0.2820732678088319,"score_spread":0.26364272454628773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013789449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97335726,0.00027919412,0.020938575,0.00013701763,0.0048487033,0.00019292034,0.000004486656,0.00002538446,0.00021647578],"genre_scores_gemma":[0.9952685,0.000080807105,0.002870732,0.00003802804,0.001632767,0.000003648806,0.000002598869,0.000030348994,0.000072569215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985972,0.00016588603,0.00055625895,0.00013697818,0.00032619256,0.00021750243],"domain_scores_gemma":[0.99686205,0.001621022,0.00092545454,0.00012781905,0.00035332897,0.00011034475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016281817,0.00018036674,0.00041644977,0.0002692151,0.00014890263,0.000093825984,0.00018920195,0.00010159589,0.000021085674],"category_scores_gemma":[0.0031454142,0.0001455655,0.00012358777,0.0003048374,0.000051846426,0.0006644101,0.000044652275,0.0002206224,0.0000012414431],"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.0007511409,0.00007605501,0.0003035694,0.00010984925,0.00009397299,0.0000030082133,0.0002870233,0.000002673337,0.0010944011,0.9843177,0.000058475824,0.012902108],"study_design_scores_gemma":[0.0015190969,0.0012388366,0.0007359718,0.000071024,0.00008681537,0.00005542609,0.0003016128,0.000039180173,0.00095193496,0.9916361,0.00319129,0.00017274033],"about_ca_topic_score_codex":5.929434e-7,"about_ca_topic_score_gemma":4.2010203e-7,"teacher_disagreement_score":0.021911258,"about_ca_system_score_codex":0.000049765007,"about_ca_system_score_gemma":0.00003052492,"threshold_uncertainty_score":0.5935989},"labels":[],"label_agreement":null},{"id":"W2013850021","doi":"10.1016/j.jcta.2012.06.006","title":"Near-central permutation factorization and Strahovʼs generalized Murnaghan–Nakayama rule","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Factorization; Permutation (music); Centralizer and normalizer; Vertex (graph theory); Symmetric group; Graph; Algorithm; Physics","score_opus":0.03523002347532969,"score_gpt":0.3127356246100759,"score_spread":0.2775056011347462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013850021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99173445,0.00033981726,0.0029667553,0.00012845629,0.0037016326,0.00021403928,0.000008693755,0.000031470816,0.0008746795],"genre_scores_gemma":[0.9952363,0.00008502535,0.0028436538,0.000022070784,0.0014367151,0.0000039329275,0.000004934541,0.000046203488,0.00032118938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973696,0.0007731259,0.0006447564,0.00011516065,0.0006104791,0.00048688604],"domain_scores_gemma":[0.9978494,0.00073198375,0.0005370765,0.00020100093,0.00037170085,0.00030883116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026091796,0.00021188249,0.0004255749,0.00013666479,0.00022637864,0.0001967548,0.00023316409,0.00015793247,0.00034637155],"category_scores_gemma":[0.0016719938,0.00017732714,0.00013088886,0.00021007769,0.00020570913,0.0013279105,0.00007756142,0.0003969172,0.0000061078485],"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.0015163892,0.0002485141,0.0024197805,0.000072294104,0.00012207843,0.000011177673,0.00454476,0.000005726601,0.004386129,0.9853207,0.00028411028,0.0010683781],"study_design_scores_gemma":[0.002382047,0.00046267326,0.0023014604,0.00005138974,0.00008977201,0.0002026776,0.0010412643,0.000027441449,0.004404853,0.9855569,0.0032735833,0.00020593152],"about_ca_topic_score_codex":0.0000024012859,"about_ca_topic_score_gemma":4.1693335e-7,"teacher_disagreement_score":0.0035034956,"about_ca_system_score_codex":0.00013012477,"about_ca_system_score_gemma":0.00012392283,"threshold_uncertainty_score":0.7231191},"labels":[],"label_agreement":null},{"id":"W2014086479","doi":"10.1016/j.jcta.2014.09.002","title":"Categorification and Heisenberg doubles arising from towers of algebras","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":18,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fock space; Mathematics; Categorification; Hopf algebra; Pure mathematics; Algebra over a field; Heisenberg group; Ring (chemistry); Representation theory; Generalization; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.01531627639064651,"score_gpt":0.2563569798345632,"score_spread":0.24104070344391668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014086479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99030924,0.00042434622,0.0026238516,0.0001769612,0.0054906514,0.000109771194,0.0000027393946,0.000018658526,0.0008438042],"genre_scores_gemma":[0.9973615,0.00008671597,0.0015582558,0.000020709076,0.00090571935,0.0000015221314,0.0000013551947,0.000026563166,0.000037653434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982689,0.00026684158,0.0007534983,0.00014894512,0.0003908166,0.00017099017],"domain_scores_gemma":[0.9973955,0.0008936821,0.0009813637,0.00028750757,0.00032754493,0.000114367715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552763,0.00019260871,0.0005797004,0.000097484284,0.000101645855,0.0000624922,0.00027997867,0.0001562453,0.00006136167],"category_scores_gemma":[0.00079550676,0.00015645445,0.00014226392,0.00012250368,0.00017089436,0.00035984663,0.00006594069,0.00023962483,5.088388e-7],"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.0007496429,0.00006188776,0.00017099509,0.00003070362,0.0001285874,0.0000018383286,0.0010095079,0.000004817005,0.0015021029,0.99419117,0.00016050378,0.0019882682],"study_design_scores_gemma":[0.0015823824,0.0004087656,0.0002163666,0.000073702,0.00012993155,0.000021848418,0.0006376592,0.000010179235,0.011488526,0.98326284,0.002014782,0.00015301879],"about_ca_topic_score_codex":0.000021613394,"about_ca_topic_score_gemma":0.0000010226531,"teacher_disagreement_score":0.010928307,"about_ca_system_score_codex":0.000038782553,"about_ca_system_score_gemma":0.0000733361,"threshold_uncertainty_score":0.6380027},"labels":[],"label_agreement":null},{"id":"W2016962604","doi":"10.1016/j.jcta.2008.06.010","title":"Linear spaces with small generated subspaces","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Linear subspace; Mathematics; Computer science; Pure mathematics","score_opus":0.011310246464176856,"score_gpt":0.18218775532860096,"score_spread":0.1708775088644241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016962604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910062,0.0011603506,0.0007879532,0.000039486993,0.004338153,0.00008840389,0.0000025731779,0.00009669782,0.0024801749],"genre_scores_gemma":[0.9979586,0.00023914278,0.000489012,0.000011640024,0.00090698793,0.0000029435598,9.803407e-7,0.000040289553,0.00035041576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890554,0.0001777853,0.00037186913,0.00008405692,0.00023352781,0.00022721059],"domain_scores_gemma":[0.9991811,0.000102082246,0.0001828242,0.00017182749,0.00023082446,0.00013133172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058565295,0.00020460569,0.0003953602,0.00013214383,0.00013691696,0.000039576906,0.00024245508,0.000099400764,0.000056369176],"category_scores_gemma":[0.0000448663,0.00014888722,0.000110370835,0.00028200375,0.00016109164,0.00033322992,0.00001414435,0.00028950028,0.000007549098],"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.008067662,0.00033381765,0.0030296468,0.00032213848,0.0018009008,0.001840356,0.00886267,0.019551424,0.030960403,0.9210479,0.003282946,0.0009001177],"study_design_scores_gemma":[0.014698617,0.008451073,0.001258674,0.0010892979,0.00047728838,0.014159198,0.008695473,0.00064170477,0.32051647,0.3973004,0.23011468,0.0025971448],"about_ca_topic_score_codex":0.0000018480915,"about_ca_topic_score_gemma":0.0000023869402,"teacher_disagreement_score":0.52374756,"about_ca_system_score_codex":0.00002921044,"about_ca_system_score_gemma":0.000057308822,"threshold_uncertainty_score":0.6071445},"labels":[],"label_agreement":null},{"id":"W2017008783","doi":"10.1016/j.jcta.2010.05.006","title":"Symmetric bilinear forms over finite fields of even characteristic","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"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","funders":"","keywords":"Mathematics; Bilinear form; Rank (graph theory); Combinatorics; Vector space; Finite field; Space (punctuation); Set (abstract data type); Bilinear interpolation; Distribution (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.006065735391801461,"score_gpt":0.2239817132919832,"score_spread":0.21791597790018172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017008783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9591528,0.000096868745,0.02689279,0.00021840632,0.011727201,0.00009872754,0.000004749683,0.00003444289,0.0017739747],"genre_scores_gemma":[0.99792796,0.00002971481,0.0014107196,0.000068383895,0.000491742,0.0000014323097,4.4224032e-7,0.000009334374,0.00006024703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857765,0.00015008899,0.00057665264,0.00013239385,0.00035882386,0.00020439572],"domain_scores_gemma":[0.99770296,0.00079866464,0.0006342838,0.00044576466,0.00030131673,0.00011700298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018268119,0.00014847692,0.00036880578,0.00037953875,0.00009244629,0.00009151988,0.001047609,0.00013174757,0.00011871123],"category_scores_gemma":[0.00085519877,0.000113588656,0.00028104545,0.0007485367,0.00013054402,0.000846211,0.00017099387,0.00052156055,0.00000334352],"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.00043538195,0.00013650532,0.00029909,0.000020584792,0.00005588168,0.000017184173,0.00039457803,0.0000035034775,0.0030373698,0.9895432,0.000062913496,0.0059937853],"study_design_scores_gemma":[0.0008719384,0.0011582978,0.0016641761,0.000039623465,0.000027965632,0.00007789489,0.000038412374,0.00009673823,0.0061806985,0.98020357,0.009481425,0.00015925942],"about_ca_topic_score_codex":0.0000013405449,"about_ca_topic_score_gemma":6.050432e-7,"teacher_disagreement_score":0.038775146,"about_ca_system_score_codex":0.000010315297,"about_ca_system_score_gemma":0.00010824635,"threshold_uncertainty_score":0.4632011},"labels":[],"label_agreement":null},{"id":"W2017325803","doi":"10.1016/j.jcta.2012.01.006","title":"Fixed points avoiding Abelian k-powers","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Mathematics; Invertible matrix; Fixed point; Decidability; Pure mathematics; Matrix (chemical analysis); Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.009556108663495173,"score_gpt":0.23177425499645135,"score_spread":0.22221814633295617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017325803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.767969,0.0036762315,0.1305271,0.0029306205,0.08198747,0.00031053345,0.0000053892786,0.00033309823,0.012260573],"genre_scores_gemma":[0.9937319,0.000048844842,0.0045206593,0.00027443928,0.0012468651,0.0000014276376,3.3088065e-7,0.000017431144,0.00015810595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979161,0.00053487293,0.0005238058,0.00012830208,0.00044706126,0.0004498328],"domain_scores_gemma":[0.99815345,0.00047992394,0.00051503215,0.0003975482,0.0001760616,0.00027796475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043210653,0.00018849704,0.00035137698,0.00017718408,0.0002271388,0.00018242639,0.0011083815,0.00009435278,0.00010404479],"category_scores_gemma":[0.0005119237,0.00015173668,0.00020390906,0.00033493765,0.00009425634,0.0027933335,0.0002268785,0.00040145632,0.000036065238],"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.000151436,0.00011932612,0.00025374306,0.000008628982,0.000058226844,0.00002114434,0.0018386259,0.0000020323996,0.0021844988,0.99039346,0.0015124929,0.003456394],"study_design_scores_gemma":[0.0012804954,0.00047016644,0.00046483026,0.000092234026,0.000027900658,0.00045481333,0.00091411633,0.00003914376,0.016763855,0.9347939,0.044399377,0.00029914948],"about_ca_topic_score_codex":0.0000011640344,"about_ca_topic_score_gemma":6.074129e-8,"teacher_disagreement_score":0.2257629,"about_ca_system_score_codex":0.000078198165,"about_ca_system_score_gemma":0.00008537135,"threshold_uncertainty_score":0.6187642},"labels":[],"label_agreement":null},{"id":"W2018135193","doi":"10.1016/j.jcta.2005.07.013","title":"Further explorations into ternary complementary pairs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"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":"Ternary operation; Equivalence (formal languages); Product (mathematics); Computer science; Combinatorics; Mathematics; Discrete mathematics; Geometry","score_opus":0.0062114698178719506,"score_gpt":0.19757699805860948,"score_spread":0.19136552824073752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018135193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9623757,0.0016635744,0.0049992753,0.00037470332,0.01803018,0.00023236852,0.000014431642,0.00019850566,0.012111239],"genre_scores_gemma":[0.99816966,0.000026586742,0.00027602277,0.000020723282,0.0013424442,0.0000063549614,0.0000055575383,0.00003261857,0.00012003166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998771,0.00018838211,0.00056383444,0.000069946385,0.0002277185,0.00017909128],"domain_scores_gemma":[0.99940574,0.00010203674,0.0001558504,0.00016939256,0.000098588374,0.00006837116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068667287,0.00016259233,0.0002764963,0.00013107766,0.00010695463,0.000055657012,0.0002453779,0.000060790786,0.0002469291],"category_scores_gemma":[0.000014639659,0.0001435226,0.0001589456,0.00015926512,0.000079236714,0.000576401,0.000024098745,0.0002021082,0.000014176421],"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.00041578925,0.00012357716,0.0006586798,0.000057218054,0.00020876783,0.00007354041,0.0018870663,0.0024614308,0.0069671907,0.9775002,0.008901027,0.0007455229],"study_design_scores_gemma":[0.00095814787,0.00027775852,0.00019887494,0.000057264067,0.000039150164,0.00010379314,0.0027381638,0.000042336425,0.003879629,0.937511,0.05400608,0.00018776901],"about_ca_topic_score_codex":0.000008807755,"about_ca_topic_score_gemma":0.000006166276,"teacher_disagreement_score":0.045105055,"about_ca_system_score_codex":0.00005854371,"about_ca_system_score_gemma":0.000020702066,"threshold_uncertainty_score":0.58526814},"labels":[],"label_agreement":null},{"id":"W2019253309","doi":"10.1016/j.jcta.2004.11.012","title":"Self-duality of chiral polytopes","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Synthesis and Properties of Aromatic Compounds","field":"Chemistry","cited_by":25,"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":"Polytope; Duality (order theory); Rank (graph theory); Automorphism; Dual (grammatical number); Combinatorics; Mathematics; Polarity (international relations); Pure mathematics; Chemistry; Philosophy; Linguistics","score_opus":0.008744218932907045,"score_gpt":0.22444105967977687,"score_spread":0.21569684074686982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019253309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93701774,0.001010018,0.000010389509,0.00058772933,0.0012060757,0.00003210371,0.00000557667,0.000031297324,0.06009906],"genre_scores_gemma":[0.9959682,0.00009709015,0.00169538,0.0000334244,0.0013458546,0.000001103257,5.0006065e-7,0.000017418788,0.0008410028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984386,0.00010729027,0.0007913267,0.00008978885,0.00039299362,0.00017999056],"domain_scores_gemma":[0.99845386,0.00029491153,0.00067741156,0.00027208964,0.00020651624,0.00009520843],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010180436,0.00015628201,0.00048177468,0.000052585343,0.0000771053,0.000042229054,0.00043865023,0.00009493305,0.0013269745],"category_scores_gemma":[0.00030049117,0.00011824894,0.00025438514,0.00006892063,0.000115022,0.0003782066,0.000079875645,0.00020765405,0.000004889513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009147616,0.0024451423,0.0020990213,0.0008307724,0.0016486798,0.000039196864,0.008108394,0.00003262292,0.08966019,0.8304223,0.0042529223,0.051313143],"study_design_scores_gemma":[0.0022898824,0.00054208405,0.00018647213,0.00024434048,0.00016992305,0.00022929897,0.0014429479,0.00001682935,0.42456654,0.3442629,0.22572087,0.00032793882],"about_ca_topic_score_codex":0.0000029675086,"about_ca_topic_score_gemma":5.058123e-7,"teacher_disagreement_score":0.4861594,"about_ca_system_score_codex":0.000060500653,"about_ca_system_score_gemma":0.000115987095,"threshold_uncertainty_score":0.9995859},"labels":[],"label_agreement":null},{"id":"W2022058915","doi":"10.1016/j.jcta.2007.11.007","title":"The number of possibilities for random dating","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","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":"Université de Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Induced subgraph isomorphism problem; Mathematics; Random graph; Graph; Set (abstract data type); Discrete mathematics; Computer science; Line graph; Voltage graph; Programming language","score_opus":0.02580193314037548,"score_gpt":0.3056127799729388,"score_spread":0.2798108468325633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022058915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989587,0.00029709077,0.00086834066,0.00006437394,0.0054529915,0.00022083586,0.000009779758,0.000011876851,0.0034876906],"genre_scores_gemma":[0.99481326,0.00011589861,0.0031996975,0.000016926098,0.0007939294,0.000005375576,3.3014794e-7,0.00002317085,0.0010313912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830425,0.00031360186,0.0008067712,0.000073935524,0.00031366703,0.00018778615],"domain_scores_gemma":[0.9927731,0.0055376524,0.000852082,0.00027176697,0.00051530584,0.000050062114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028081497,0.00013525884,0.0004519937,0.00003651786,0.0005830316,0.000024661476,0.00040536042,0.00007700424,0.00006433037],"category_scores_gemma":[0.0033741642,0.00007652262,0.00034014665,0.000083927305,0.00051264267,0.000225895,0.00007299037,0.00019524575,2.148751e-7],"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.0045458497,0.00004501159,0.00018828307,0.000052267464,0.00016511702,0.000004115912,0.0033339967,0.0000011264165,0.000107404434,0.99000716,0.0011893385,0.00036032673],"study_design_scores_gemma":[0.0027366844,0.0002607615,0.00003687122,0.000048690046,0.000060140515,0.00028011634,0.0019468856,0.0000019866181,0.0029846395,0.98836535,0.003189551,0.000088302324],"about_ca_topic_score_codex":8.7711703e-7,"about_ca_topic_score_gemma":2.0595584e-7,"teacher_disagreement_score":0.0055311075,"about_ca_system_score_codex":0.00002113557,"about_ca_system_score_gemma":0.00009249228,"threshold_uncertainty_score":0.4484267},"labels":[],"label_agreement":null},{"id":"W2022062611","doi":"10.1016/j.jcta.2013.06.004","title":"Extensions of a result of Elekes and Rónyai","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"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; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Cartesian product; Combinatorics; Conjecture; Mathematics; Cartesian coordinate system; Product (mathematics); Graph; Line (geometry); Discrete geometry; Discrete mathematics; Geometry","score_opus":0.006129390363911423,"score_gpt":0.21493981736942236,"score_spread":0.20881042700551095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022062611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617333,0.00062732154,0.033918027,0.00067434885,0.0023201967,0.00011000291,0.0000017409333,0.000008582901,0.0006065225],"genre_scores_gemma":[0.99002594,0.00006607326,0.009634586,0.000029500923,0.00014666848,0.0000010463203,3.046408e-7,0.000003022179,0.000092874914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899733,0.00013989247,0.0004525543,0.00007540543,0.00025509385,0.00007972004],"domain_scores_gemma":[0.9982491,0.00031546075,0.00046766613,0.00014251725,0.00076283945,0.00006242473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642918,0.00006826821,0.0002243543,0.00014106803,0.000047365167,0.0000363108,0.00024717575,0.00003829447,0.000019707579],"category_scores_gemma":[0.00035876676,0.000054393884,0.00006651959,0.00025055514,0.000083903244,0.00070130394,0.000087703025,0.000086533,8.5912586e-7],"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.00012097044,0.000079045865,0.000045107143,0.000015853935,0.000033528613,0.0000024446633,0.0005320447,0.00014630768,0.027364884,0.96410817,0.0005405695,0.007011097],"study_design_scores_gemma":[0.00081641984,0.0009069875,0.002477304,0.000055968714,0.0000143505285,0.0000918075,0.00015684993,0.0004103038,0.040107287,0.95319164,0.0016945038,0.0000765921],"about_ca_topic_score_codex":0.000003839316,"about_ca_topic_score_gemma":1.8706899e-7,"teacher_disagreement_score":0.028292665,"about_ca_system_score_codex":0.000008013512,"about_ca_system_score_gemma":0.00009451015,"threshold_uncertainty_score":0.22181183},"labels":[],"label_agreement":null},{"id":"W2022449958","doi":"10.1016/j.jcta.2004.07.010","title":"Almost disjoint families of 3-term arithmetic progressions","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Disjoint sets; Arithmetic; Term (time); Mathematics; Arithmetic progression; Point (geometry); Combinatorics; Discrete mathematics; Geometry","score_opus":0.016629102650738782,"score_gpt":0.28815015757052165,"score_spread":0.27152105491978284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022449958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99140006,0.00042960967,0.0005622106,0.00017901827,0.005085885,0.0001980025,0.000010826566,0.000025819741,0.0021085588],"genre_scores_gemma":[0.9944863,0.00012662045,0.0047960393,0.000021195754,0.00045558365,0.0000034044253,6.2434316e-7,0.000030100777,0.00008015793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806,0.00022135727,0.00088239723,0.00011691409,0.00048454662,0.00023480698],"domain_scores_gemma":[0.9977897,0.00048168417,0.00088786596,0.00034476834,0.00037254055,0.00012346676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011577191,0.00021482832,0.0006158735,0.00018617393,0.00020955266,0.000032388638,0.00044568663,0.00013038154,0.00008139319],"category_scores_gemma":[0.000929683,0.00014538462,0.0003314426,0.00021879462,0.0004925274,0.0002964154,0.00015704904,0.00036437073,7.308048e-7],"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.00085962226,0.00030069484,0.00019663268,0.00010163401,0.00017114046,0.000046106463,0.003300211,0.000007456444,0.0009415195,0.99302375,0.000084676365,0.0009665688],"study_design_scores_gemma":[0.001776806,0.0009366468,0.00035950585,0.0003455122,0.00012390262,0.00025475194,0.0015955115,2.2220054e-7,0.012559184,0.9812416,0.00064958987,0.00015677647],"about_ca_topic_score_codex":0.0000010978788,"about_ca_topic_score_gemma":6.043665e-7,"teacher_disagreement_score":0.011782146,"about_ca_system_score_codex":0.00005524756,"about_ca_system_score_gemma":0.00013747685,"threshold_uncertainty_score":0.5928613},"labels":[],"label_agreement":null},{"id":"W2022838882","doi":"10.1016/j.jcta.2004.11.004","title":"Sieve methods in combinatorics","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Sieve (category theory); Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Abelian group; Interpretation (philosophy); Context (archaeology); Simple (philosophy); Discrete mathematics; Computer science; Graph; Geography","score_opus":0.03187556135946576,"score_gpt":0.37317404036418095,"score_spread":0.3412984790047152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022838882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9270839,0.0011199126,0.020435693,0.002838963,0.00819155,0.0007500601,0.000009853377,0.00013138719,0.039438672],"genre_scores_gemma":[0.9533941,0.00007021072,0.045085948,0.00008357976,0.000612519,0.000012401452,5.450309e-7,0.0000359457,0.00070475007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977381,0.00077306485,0.00085740123,0.00012061647,0.00026589134,0.0002448903],"domain_scores_gemma":[0.9971295,0.0016163358,0.00058456726,0.00030346442,0.0002496907,0.000116430696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004756687,0.00017844813,0.00048400514,0.00021947296,0.00008215057,0.00004097346,0.00044277107,0.00013381522,0.00013884879],"category_scores_gemma":[0.0012774434,0.00015381494,0.00020418243,0.00048487578,0.00012887982,0.00035590757,0.00006369198,0.00048502098,0.0000066151756],"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.00039160994,0.00045447436,0.000057650283,0.000016975084,0.00004548464,0.000009517015,0.0007858121,0.0000075390712,0.0013374649,0.992825,0.00043353875,0.0036349369],"study_design_scores_gemma":[0.0013744627,0.00023871846,0.000055425306,0.000042570464,0.000043862416,0.00008973046,0.0005317902,0.000004686768,0.010243824,0.9393605,0.047863476,0.00015095861],"about_ca_topic_score_codex":6.7805587e-7,"about_ca_topic_score_gemma":0.0000018018849,"teacher_disagreement_score":0.053464502,"about_ca_system_score_codex":0.00010131069,"about_ca_system_score_gemma":0.000086316504,"threshold_uncertainty_score":0.62723917},"labels":[],"label_agreement":null},{"id":"W2023034313","doi":"10.1016/j.jcta.2005.01.006","title":"A simple proof that a word of length n has at most <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Simple (philosophy); Scroll; Mathematics; Computer science; Theology; Philosophy; Geometry","score_opus":0.015236540240838172,"score_gpt":0.2316709412900469,"score_spread":0.21643440104920872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023034313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902675,0.0008065588,0.0017560864,0.0005571657,0.003306941,0.00006829729,0.000056671146,0.0001147101,0.0030660753],"genre_scores_gemma":[0.99623257,0.0001347515,0.0017275441,0.00032975248,0.0012838109,0.00004690642,0.000024878926,0.00010268023,0.000117096475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960573,0.00034774403,0.0010792818,0.0005099871,0.0012405453,0.0007651788],"domain_scores_gemma":[0.99584115,0.000978724,0.0015855706,0.0010596237,0.00018569201,0.0003492604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021911059,0.00041906396,0.00044224245,0.00019326626,0.0006899423,0.0006217165,0.0017447157,0.0004023496,0.0005696763],"category_scores_gemma":[0.0006672453,0.0004679765,0.0006551644,0.00047115964,0.00061087083,0.0017506848,0.0010595976,0.00063396373,0.000095664356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015986019,0.000313839,0.000017858563,0.00015426787,0.0003222938,0.00025100054,0.0020862292,0.0002317893,0.0010329426,0.98239267,0.006491491,0.0051069926],"study_design_scores_gemma":[0.007125124,0.005421069,0.00031687054,0.0014946343,0.00064268836,0.0027841008,0.0026748255,0.13026951,0.4665495,0.2800707,0.10079089,0.0018601172],"about_ca_topic_score_codex":0.00005476865,"about_ca_topic_score_gemma":0.000048914277,"teacher_disagreement_score":0.702322,"about_ca_system_score_codex":0.00004480095,"about_ca_system_score_gemma":0.0005714325,"threshold_uncertainty_score":0.9997772},"labels":[],"label_agreement":null},{"id":"W2026069272","doi":"10.1016/j.jcta.2013.05.009","title":"Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":17,"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":"Monomial; Mathematics; h-vector; Simplicial approximation theorem; Monomial ideal; Ideal (ethics); Abstract simplicial complex; Combinatorics; Simplicial complex; Quadratic equation; Class (philosophy); Graph; Simplicial homology; Pure mathematics; Discrete mathematics; Polynomial ring; Polynomial; Mathematical analysis; Simplicial set; Geometry","score_opus":0.028284822655334035,"score_gpt":0.32253687212060933,"score_spread":0.2942520494652753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026069272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97769433,0.000078806916,0.018434616,0.0019451018,0.00052085327,0.0008525935,0.000025334306,0.000021257521,0.0004270905],"genre_scores_gemma":[0.9873601,0.000014971179,0.011637139,0.00009501945,0.00063937355,0.00010090703,0.0000048818674,0.000021288084,0.00012628727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998996,0.00013820597,0.00046676598,0.00010345868,0.00014187534,0.00015367557],"domain_scores_gemma":[0.99806607,0.0008813488,0.000352693,0.00014344117,0.00043281564,0.0001236051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063577155,0.0001247218,0.0003180199,0.00010674143,0.00019133177,0.000076441385,0.00015351649,0.000063782405,0.0000695176],"category_scores_gemma":[0.0006735304,0.00010662989,0.00009119048,0.000084323285,0.00009390557,0.0004135111,0.000060029375,0.0001426584,0.0000042404067],"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.0010148718,0.00011170725,0.000034433306,0.000033270233,0.00007313133,7.382653e-7,0.0014360558,0.0000051923384,0.0045093386,0.98400724,0.007921196,0.00085285335],"study_design_scores_gemma":[0.0016213023,0.0009634399,0.00038429978,0.00004421539,0.00005621836,0.000032646996,0.0016057172,0.000107463755,0.0021335385,0.9847763,0.008155937,0.00011892495],"about_ca_topic_score_codex":0.000010538375,"about_ca_topic_score_gemma":0.0000042878446,"teacher_disagreement_score":0.009665786,"about_ca_system_score_codex":0.00004915587,"about_ca_system_score_gemma":0.000054929005,"threshold_uncertainty_score":0.43482408},"labels":[],"label_agreement":null},{"id":"W2027087977","doi":"10.1016/s0097-3165(03)00005-0","title":"Embeddings of polar spaces","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Structural Analysis and Optimization","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":"York University","funders":"","keywords":"Polar; Statement (logic); Field (mathematics); Mathematics; Geometry; Pure mathematics; Physics; Epistemology; Philosophy; Quantum mechanics","score_opus":0.003612113548295665,"score_gpt":0.19326118582976112,"score_spread":0.18964907228146546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027087977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870477,0.0011783191,0.0020638965,0.00003307543,0.0041600727,0.000040541843,0.000002323858,0.0000216162,0.005452475],"genre_scores_gemma":[0.99851227,0.00015066892,0.001109109,0.000004920091,0.00014645746,2.0759995e-7,4.0432514e-7,0.000010760957,0.00006523253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993366,0.000058607024,0.000320846,0.00003510789,0.00016035367,0.0000885035],"domain_scores_gemma":[0.9995018,0.00005152553,0.00017318038,0.00007246015,0.00015705652,0.000043959866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035046463,0.00008352361,0.0002484873,0.00008577086,0.00002858054,0.00002479038,0.00009647835,0.000047940717,0.00020975593],"category_scores_gemma":[0.00015054802,0.00006448732,0.00011831061,0.000178431,0.000035359364,0.00027185204,0.0000060405437,0.00010241318,7.9768705e-7],"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.00015369966,0.000019960762,0.0004960807,0.000037376743,0.0002409075,0.0000065823174,0.0005235398,0.019442428,0.008662776,0.9694855,0.00048253383,0.0004485961],"study_design_scores_gemma":[0.0016087476,0.00052911765,0.00041255204,0.00008410707,0.0001891095,0.00014474544,0.001508752,0.00052530086,0.13053182,0.83385694,0.030287938,0.00032090102],"about_ca_topic_score_codex":7.4078827e-7,"about_ca_topic_score_gemma":1.7416617e-7,"teacher_disagreement_score":0.1356286,"about_ca_system_score_codex":0.000022789083,"about_ca_system_score_gemma":0.000015651489,"threshold_uncertainty_score":0.26297167},"labels":[],"label_agreement":null},{"id":"W2027965373","doi":"10.1016/s0097-3165(03)00100-6","title":"Independent Deuber sets in graphs on the natural numbers","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"University of Manitoba","funders":"","keywords":"Natural (archaeology); Natural number; Mathematics; Combinatorics; Geography; Archaeology","score_opus":0.01538640533843842,"score_gpt":0.2696220057074402,"score_spread":0.2542356003690018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027965373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9723532,0.00020380833,0.000010969949,0.0002238765,0.009308697,0.00018833634,0.000001849563,0.000013001566,0.017696243],"genre_scores_gemma":[0.9991712,0.000037383652,0.0002388041,0.00019510911,0.0001459057,0.0000037449047,1.7916327e-7,0.000026503836,0.0001811564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743444,0.0009912759,0.000610162,0.00012793695,0.0005538141,0.0002823473],"domain_scores_gemma":[0.99735945,0.0016187617,0.000455018,0.00033295545,0.00015512771,0.00007865646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003236396,0.0002224543,0.0003925876,0.00017050582,0.00025627334,0.000058026075,0.00044510124,0.00013360762,0.00023981159],"category_scores_gemma":[0.0017011403,0.00012771493,0.00026141957,0.0002765967,0.00020163557,0.0002289879,0.000055376582,0.0008860215,0.000002175302],"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.00087813206,0.000110512636,0.0003914522,0.000011798858,0.000105074025,0.000059772465,0.0016610638,0.000004075335,0.000046666562,0.9957238,0.0008645439,0.0001431483],"study_design_scores_gemma":[0.0012725169,0.00025378284,0.00029850114,0.000069803726,0.00003292866,0.00021914855,0.0014423471,5.345908e-7,0.0016001732,0.99046236,0.0041916766,0.00015622884],"about_ca_topic_score_codex":0.0000012558475,"about_ca_topic_score_gemma":0.0000048020047,"teacher_disagreement_score":0.026817996,"about_ca_system_score_codex":0.00007657129,"about_ca_system_score_gemma":0.00006530918,"threshold_uncertainty_score":0.5208064},"labels":[],"label_agreement":null},{"id":"W2028350743","doi":"10.1016/j.jcta.2008.06.011","title":"Classifying lattice walks restricted to the quarter plane","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Random walk; Mathematics; Quadrant (abdomen); Lattice (music); Transcendental number; Combinatorics; Algebraic number; Discrete mathematics; Mathematical analysis; Physics; Statistics","score_opus":0.037828813530528874,"score_gpt":0.29186427533078096,"score_spread":0.2540354618002521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028350743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94188404,0.00032703418,0.015217644,0.004866471,0.027703406,0.001137465,0.0000143526495,0.00022411151,0.008625472],"genre_scores_gemma":[0.9833337,0.00006727779,0.012775492,0.00021305429,0.0026362115,0.000017328062,9.053254e-7,0.00008638707,0.00086960767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688953,0.000508939,0.0011167945,0.00018036268,0.0008805341,0.0004238444],"domain_scores_gemma":[0.9947978,0.0027788563,0.0009415751,0.00063951133,0.0006058545,0.00023637543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011801145,0.00031220887,0.00069255824,0.00017683055,0.00042014505,0.00006975912,0.00087900885,0.00016471265,0.00008222492],"category_scores_gemma":[0.0045382683,0.00020914545,0.00022947835,0.0005497681,0.00016198524,0.000489325,0.00015154382,0.00072188984,0.00003508832],"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.0012335146,0.0002396985,0.000030422118,0.000042581665,0.00013249878,0.00017155922,0.00396415,0.000013119157,0.00060196436,0.97854733,0.014860688,0.0001624918],"study_design_scores_gemma":[0.0015500842,0.0009887619,0.00007904208,0.00012346676,0.00008918311,0.0009592597,0.0012651905,0.00000609661,0.0012544886,0.95440984,0.039024666,0.00024990086],"about_ca_topic_score_codex":0.0000016200655,"about_ca_topic_score_gemma":0.0000012855476,"teacher_disagreement_score":0.041449692,"about_ca_system_score_codex":0.00015575658,"about_ca_system_score_gemma":0.00018667444,"threshold_uncertainty_score":0.8528704},"labels":[],"label_agreement":null},{"id":"W2028399610","doi":"10.1016/j.jcta.2007.07.010","title":"On sets of integers whose shifted products are powers","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","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":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Integer (computer science); Combinatorics; Mathematics; Property (philosophy); Discrete mathematics; Binary logarithm; Computer science","score_opus":0.01633077978276656,"score_gpt":0.28504268758100726,"score_spread":0.2687119077982407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028399610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857116,0.00017065457,0.00023109964,0.0001959572,0.009328611,0.00018484096,0.000007644663,0.000024279938,0.00414531],"genre_scores_gemma":[0.9981412,0.000021955833,0.0011070624,0.000075140466,0.00045943877,6.526952e-7,5.3822544e-7,0.000035782556,0.00015821279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977776,0.00028228114,0.00090462447,0.00014940111,0.00059518387,0.00029092075],"domain_scores_gemma":[0.99631613,0.0011957905,0.00132838,0.0004023113,0.00062600005,0.00013138283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003767755,0.00023835483,0.00061826076,0.00028684028,0.00013340778,0.000024470071,0.0004590736,0.0001649703,0.00010110622],"category_scores_gemma":[0.00361104,0.00017266274,0.00024577137,0.0003265072,0.00031601725,0.00025555174,0.00008354508,0.0005192553,0.0000010578034],"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.0061144377,0.00022785041,0.00010400084,0.00010019801,0.00020904696,0.000081521124,0.002492174,0.0000027062167,0.00056794536,0.98765665,0.0016608716,0.0007825687],"study_design_scores_gemma":[0.0013157215,0.0011456584,0.00035281706,0.00025152884,0.00007522382,0.00008975889,0.0018528898,3.271527e-7,0.023167811,0.9701501,0.0014248984,0.00017326201],"about_ca_topic_score_codex":6.3979877e-7,"about_ca_topic_score_gemma":6.2963505e-7,"teacher_disagreement_score":0.022599867,"about_ca_system_score_codex":0.000073241135,"about_ca_system_score_gemma":0.00008228141,"threshold_uncertainty_score":0.7040982},"labels":[],"label_agreement":null},{"id":"W2028910286","doi":"10.1016/j.jcta.2006.06.007","title":"Semisymmetric graphs from polytopes","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":28,"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; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Symmetric graph; Transitive relation; Vertex (graph theory); Graph; Toroid; Discrete mathematics; Line graph; Voltage graph","score_opus":0.022371334077596366,"score_gpt":0.2853764405316327,"score_spread":0.2630051064540363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028910286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976702,0.000990891,0.00047377116,0.0002536533,0.004012962,0.00017952651,0.00002527601,0.000059369948,0.017302569],"genre_scores_gemma":[0.9946793,0.000048796825,0.002354214,0.000030920637,0.0016056813,0.0000034549619,0.0000032108455,0.00005429024,0.001220165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709195,0.00067880796,0.00086406467,0.0001629904,0.0008296886,0.0003724997],"domain_scores_gemma":[0.99533945,0.0030319223,0.0006386646,0.00038954863,0.00046073593,0.000139671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027555565,0.00023440957,0.00059174694,0.00048167715,0.000148005,0.00013286874,0.0006769516,0.00016386696,0.0005841031],"category_scores_gemma":[0.0020561833,0.00018943947,0.0003198269,0.0007632944,0.00021831613,0.0005096047,0.00012303698,0.00054967945,0.000020996877],"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.0015357849,0.0003066968,0.00040591968,0.000021816588,0.00012923533,0.000101769176,0.00018486015,0.00000147012,0.0030675984,0.98788166,0.005794746,0.0005684185],"study_design_scores_gemma":[0.0016730889,0.0005100716,0.00038276752,0.000061312065,0.00007473848,0.00008394945,0.00038478675,0.0000016107269,0.009916714,0.9770941,0.009623938,0.00019288367],"about_ca_topic_score_codex":0.000028915489,"about_ca_topic_score_gemma":0.0000029236678,"teacher_disagreement_score":0.017977286,"about_ca_system_score_codex":0.00009499349,"about_ca_system_score_gemma":0.00011652008,"threshold_uncertainty_score":0.7725118},"labels":[],"label_agreement":null},{"id":"W2029485128","doi":"10.1016/j.jcta.2004.02.002","title":"A hypergraph extension of the bipartite Turán problem","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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 Waterloo","funders":"","keywords":"Extension (predicate logic); Hypergraph; Combinatorics; Upper and lower bounds; Mathematics; Bipartite graph; Element (criminal law); Set (abstract data type); Computer science; Graph; Law; Mathematical analysis; Political science","score_opus":0.014395830166834702,"score_gpt":0.25527151260474595,"score_spread":0.24087568243791124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029485128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99144465,0.0004034671,0.0001865121,0.0003758938,0.0055144713,0.00020654494,0.0000040560676,0.000017214546,0.0018471634],"genre_scores_gemma":[0.99696714,0.00006475822,0.0023690164,0.00006146529,0.00039639004,0.0000019809502,1.1756506e-7,0.000024943309,0.00011417037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816215,0.00028743522,0.00074215344,0.00010869674,0.0004974796,0.00020209883],"domain_scores_gemma":[0.9978466,0.00032833283,0.00089794677,0.00043500608,0.00041581682,0.000076295255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529579,0.00017914573,0.0004522849,0.0001124991,0.00023018333,0.000024480698,0.00053567026,0.00012199907,0.000042910247],"category_scores_gemma":[0.00067029876,0.00009920482,0.00041743575,0.00031545587,0.00036639188,0.0002490448,0.00016183247,0.00036866413,5.19237e-7],"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.0008206634,0.00014446837,0.000100770056,0.00005591912,0.00011327689,0.000010607611,0.0015602672,0.00003285627,0.004060304,0.9926088,0.00023426786,0.0002578195],"study_design_scores_gemma":[0.0014675806,0.0004619829,0.0002918769,0.00024013531,0.000105552375,0.00022644582,0.0003561041,2.4080433e-7,0.020866077,0.9735658,0.0023042036,0.00011400751],"about_ca_topic_score_codex":0.0000017778495,"about_ca_topic_score_gemma":9.263018e-7,"teacher_disagreement_score":0.019042987,"about_ca_system_score_codex":0.000038802547,"about_ca_system_score_gemma":0.00011444756,"threshold_uncertainty_score":0.40454555},"labels":[],"label_agreement":null},{"id":"W2031011579","doi":"10.1016/j.jcta.2005.09.002","title":"Alternating sign matrices with one −1 under vertical reflection","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Sign (mathematics); Reflection (computer programming); Mathematics; Materials science; Computer science; Mathematical analysis; Programming language","score_opus":0.033370355862873236,"score_gpt":0.31450391040521974,"score_spread":0.2811335545423465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031011579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90857124,0.0003169689,0.0773117,0.0010938705,0.0053242487,0.00043042444,0.0000018490983,0.00017402622,0.006775662],"genre_scores_gemma":[0.950215,0.000047964826,0.046973355,0.00005555062,0.002388212,0.0000066202383,3.379827e-7,0.00007358396,0.0002394022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973747,0.00028410312,0.0009478992,0.00017418512,0.00086850394,0.00035057197],"domain_scores_gemma":[0.996819,0.0013495139,0.0007554561,0.0003232946,0.0005817283,0.00017101585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014554613,0.00027549465,0.00063376507,0.00017511453,0.00017883019,0.00010854994,0.00041047492,0.00013786885,0.000114948234],"category_scores_gemma":[0.001226916,0.00021615205,0.00014984774,0.00033756983,0.00013644887,0.001014888,0.00007890512,0.0005397541,0.000010942405],"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.0018470185,0.0005223119,0.000014316565,0.00006666258,0.00020935698,0.000021797025,0.00053221866,0.00015560482,0.0020199057,0.9934091,0.00018061028,0.0010210731],"study_design_scores_gemma":[0.0024288087,0.0015280189,0.000008042601,0.0002521396,0.00019615395,0.0003053969,0.00057560275,0.000034315053,0.018647177,0.9738672,0.0019007417,0.0002564369],"about_ca_topic_score_codex":0.0000010126789,"about_ca_topic_score_gemma":0.000002005218,"teacher_disagreement_score":0.041643728,"about_ca_system_score_codex":0.00029529186,"about_ca_system_score_gemma":0.00013738763,"threshold_uncertainty_score":0.8814425},"labels":[],"label_agreement":null},{"id":"W2033949361","doi":"10.1016/j.jcta.2012.07.010","title":"Subsets of products of finite sets of positive upper density","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"University of Toronto","funders":"","keywords":"Sequence (biology); Combinatorics; Mathematics; Physics; Chemistry","score_opus":0.018095933409191654,"score_gpt":0.2742560461828031,"score_spread":0.25616011277361145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033949361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99406016,0.00046838465,0.000078488,0.000048187212,0.0040020477,0.00015863204,0.00002998604,0.00000562571,0.0011485195],"genre_scores_gemma":[0.99752253,0.000046875237,0.0019740278,0.000012333013,0.0003648879,6.414718e-7,0.0000010173542,0.000022385442,0.00005532343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977373,0.00049214077,0.0009612074,0.000088341374,0.0004895162,0.00023149305],"domain_scores_gemma":[0.99563557,0.0011612343,0.0016656088,0.00034841575,0.0010943527,0.00009483388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024291852,0.00018582332,0.0007986517,0.00016704666,0.000070107206,0.000005824506,0.0003229683,0.00013885381,0.00007501008],"category_scores_gemma":[0.0021090813,0.00013768328,0.00027271497,0.00022365029,0.0004187603,0.00039338286,0.00013395636,0.00026490906,3.49527e-7],"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.002655289,0.00038714625,0.0028666975,0.00028462618,0.00034325957,0.00000463354,0.0066042305,0.0000016837105,0.006803037,0.9795683,0.00024757985,0.00023349226],"study_design_scores_gemma":[0.00078032236,0.0005046486,0.003279309,0.00016007252,0.00016155983,0.00006851311,0.00057921564,3.2074863e-7,0.23175663,0.76245874,0.00014860691,0.00010207494],"about_ca_topic_score_codex":0.0000019752827,"about_ca_topic_score_gemma":2.136264e-7,"teacher_disagreement_score":0.22495358,"about_ca_system_score_codex":0.000025322224,"about_ca_system_score_gemma":0.000090979265,"threshold_uncertainty_score":0.56145614},"labels":[],"label_agreement":null},{"id":"W2035044354","doi":"10.1016/j.jcta.2010.11.003","title":"An Erdős–Ko–Rado theorem for the derangement graph of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">PGL</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> acting on the projective line","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":49,"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 Regina","funders":"","keywords":"Combinatorics; Derangement; Pencil (optics); Mathematics; Coset; Point (geometry); Projective test; Graph; Discrete mathematics; Pure mathematics; Physics; Geometry","score_opus":0.02436183775028209,"score_gpt":0.27203609666789197,"score_spread":0.24767425891760989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035044354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771113,0.0010249258,0.0012913649,0.0013347883,0.007803095,0.0004870913,0.0008704286,0.0002687337,0.009808303],"genre_scores_gemma":[0.98770785,0.0011828925,0.0025047127,0.00081869593,0.0052174274,0.0010742442,0.00024951593,0.0011181743,0.00012648436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9837251,0.0022892198,0.0039691175,0.001963754,0.004713883,0.0033389733],"domain_scores_gemma":[0.97820514,0.0103855645,0.0057994607,0.0031465017,0.0011636965,0.0012996406],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.01395754,0.0017296929,0.0011797203,0.0009544742,0.0035921321,0.0025398878,0.004911004,0.0028762717,0.0053120996],"category_scores_gemma":[0.007917093,0.0020891114,0.003225133,0.00176824,0.0033671288,0.0025480948,0.0024239728,0.00521397,0.00044362983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015621259,0.0016965662,0.000012539396,0.001686951,0.0048022945,0.00070730346,0.009655775,0.0007959595,0.0060204742,0.94389975,0.011226752,0.003874389],"study_design_scores_gemma":[0.0057335934,0.008950014,0.00002120371,0.0022553692,0.0029899261,0.0018313025,0.017761765,0.0216979,0.47017056,0.4629845,0.0035737099,0.0020301638],"about_ca_topic_score_codex":0.0005365453,"about_ca_topic_score_gemma":0.00043056952,"teacher_disagreement_score":0.48091525,"about_ca_system_score_codex":0.00009347145,"about_ca_system_score_gemma":0.0023532682,"threshold_uncertainty_score":0.9995449},"labels":[],"label_agreement":null},{"id":"W2036754114","doi":"10.1016/j.jcta.2013.12.004","title":"On balanced incomplete block designs with specified weak chromatic number","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Lambda; Block (permutation group theory); Combinatorics; Block design; Discrete mathematics; Physics; Optics","score_opus":0.007952064428015451,"score_gpt":0.19136564150939853,"score_spread":0.18341357708138306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036754114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.970006,0.00006883221,0.0007362114,0.000042351818,0.0042494857,0.00026839584,0.0000023507803,0.00009646896,0.024529923],"genre_scores_gemma":[0.99897075,0.000014558095,0.0001768381,0.000022823333,0.0005533841,0.000014150704,6.6241046e-7,0.000048473295,0.00019835081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985381,0.00023119034,0.00051868573,0.00010003592,0.00033570893,0.00027632367],"domain_scores_gemma":[0.99895823,0.0003031707,0.00016990851,0.00026175787,0.00015418073,0.0001527526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444535,0.00024878647,0.00048710033,0.00009487124,0.00009285853,0.00010378882,0.00030652116,0.00009394418,0.0005371778],"category_scores_gemma":[0.000051667408,0.00018085791,0.00012821262,0.00021089605,0.00009569515,0.0004313726,0.000016840395,0.00033491323,0.00012415161],"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.0014132758,0.00012281159,0.00015789022,0.00012352249,0.00043640635,0.000052446383,0.0007136893,0.0018810366,0.011174838,0.9791425,0.004408927,0.00037266975],"study_design_scores_gemma":[0.002672994,0.001513724,0.001004771,0.0004911273,0.00007022534,0.00066344073,0.0010253561,0.00014703671,0.009684004,0.97709775,0.005137669,0.00049190846],"about_ca_topic_score_codex":0.0000014138982,"about_ca_topic_score_gemma":4.4867866e-7,"teacher_disagreement_score":0.02896478,"about_ca_system_score_codex":0.000068140216,"about_ca_system_score_gemma":0.000025726571,"threshold_uncertainty_score":0.7375171},"labels":[],"label_agreement":null},{"id":"W2037565534","doi":"10.1016/j.jcta.2012.05.003","title":"Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":32,"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","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Integer (computer science); Prime (order theory); Coprime integers; Discrete mathematics; Prime power; Sequence (biology); Character (mathematics); Binary number; Arithmetic","score_opus":0.015578767243669647,"score_gpt":0.24843029463459676,"score_spread":0.23285152739092713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037565534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350047,0.0018895773,0.05687139,0.00012738764,0.005440416,0.00010698855,0.000009308583,0.000016314996,0.00053390133],"genre_scores_gemma":[0.9974052,0.00005730067,0.0021476613,0.000020776193,0.0003295948,9.618319e-7,3.7640658e-7,0.000008911074,0.000029244464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847496,0.00025369663,0.0006328741,0.000108103144,0.00031926244,0.00021110201],"domain_scores_gemma":[0.9978396,0.00052276184,0.0008540121,0.0002952058,0.00036252802,0.00012586797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025353178,0.00015270183,0.0004367862,0.00019620969,0.00010382164,0.000058905174,0.00055746024,0.000120928074,0.000034268618],"category_scores_gemma":[0.00027606366,0.00012158374,0.00018572004,0.0003571805,0.00035860937,0.0010846815,0.00017133493,0.00023471407,7.4777176e-7],"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.00072432315,0.000110272966,0.011567809,0.000036685433,0.00009295986,0.0000022122367,0.0017398373,0.000016590266,0.0020394134,0.98131627,0.00007948805,0.0022741128],"study_design_scores_gemma":[0.0015813544,0.00082422094,0.0116194915,0.0000875112,0.000041923056,0.0001261866,0.00015310643,0.000022969081,0.016540267,0.96675086,0.0020971852,0.00015495175],"about_ca_topic_score_codex":0.0000034959278,"about_ca_topic_score_gemma":8.4287e-7,"teacher_disagreement_score":0.062400457,"about_ca_system_score_codex":0.0000149339285,"about_ca_system_score_gemma":0.000106003994,"threshold_uncertainty_score":0.4958041},"labels":[],"label_agreement":null},{"id":"W2038004087","doi":"10.1016/s0097-3165(03)00098-0","title":"Cycle decompositions IV: complete directed graphs and fixed length directed cycles","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":46,"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; University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Directed graph; Discrete mathematics","score_opus":0.006390053528123849,"score_gpt":0.2002197457387437,"score_spread":0.19382969221061985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038004087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98470706,0.0017945308,0.00021888407,0.000035334342,0.005797379,0.00016422628,0.00002339353,0.00037486636,0.0068843355],"genre_scores_gemma":[0.9990946,0.00021685565,0.00044949003,0.000017578124,0.00012743351,0.0000068387435,0.0000032844932,0.000042556658,0.000041370742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982396,0.00054621993,0.0005815802,0.000126719,0.00022237509,0.00028355216],"domain_scores_gemma":[0.9988649,0.00037918353,0.00019347576,0.00020286486,0.00016997047,0.0001896172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008098922,0.00024973354,0.0005011627,0.0002158067,0.00023480834,0.00009564752,0.00019024653,0.00011858347,0.000090320034],"category_scores_gemma":[0.00015950638,0.00022744242,0.00017700213,0.000352215,0.00015789975,0.00041360236,0.00001913448,0.00032567765,0.000004156984],"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.00035731806,0.00009743719,0.00032315054,0.000056339508,0.00036701793,0.000038212995,0.00067694194,0.00028995232,0.014127368,0.9826253,0.00074180483,0.0002991563],"study_design_scores_gemma":[0.0022109507,0.0003265401,0.0016937702,0.00013623781,0.00012809818,0.0005549737,0.0006027382,0.00014746847,0.0071181473,0.96708006,0.019586276,0.00041471704],"about_ca_topic_score_codex":0.0000021605115,"about_ca_topic_score_gemma":0.0000022661623,"teacher_disagreement_score":0.01884447,"about_ca_system_score_codex":0.000037870974,"about_ca_system_score_gemma":0.000025861591,"threshold_uncertainty_score":0.92748326},"labels":[],"label_agreement":null},{"id":"W2039267601","doi":"10.1016/s0097-3165(02)00020-1","title":"Sets of three pairwise orthogonal Steiner triple systems","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; California Institute of Technology","keywords":"Steiner system; Disjoint sets; Combinatorics; Pairwise comparison; Mathematics; Order (exchange); Triple system; Discrete mathematics; Pure mathematics; Statistics","score_opus":0.008658855848408292,"score_gpt":0.1943711763680776,"score_spread":0.18571232051966932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039267601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587294,0.0040851543,0.0015027997,0.000010851044,0.025370225,0.00025228152,0.00001848795,0.000067812274,0.009963008],"genre_scores_gemma":[0.99934,0.000050199935,0.000060120263,0.000003977664,0.00033374244,0.000005653776,9.692064e-7,0.000039273713,0.00016604201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979177,0.0004232907,0.00091105106,0.00009293292,0.00040092293,0.00025411614],"domain_scores_gemma":[0.9987438,0.00020381066,0.00038221577,0.00026332453,0.00026666577,0.00014021798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022691076,0.00022265193,0.0006271647,0.0001731535,0.00006386469,0.00004165783,0.00027311497,0.00014618013,0.0001081408],"category_scores_gemma":[0.00019241094,0.00018345159,0.00027001646,0.00028180936,0.000101173144,0.00037298584,0.000015164312,0.0002947869,0.0000053586637],"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.0005407412,0.000078283556,0.00051405793,0.00019283444,0.00030183097,0.00003901722,0.00029447497,0.002075555,0.0026904896,0.9922855,0.00077198446,0.00021521107],"study_design_scores_gemma":[0.004849371,0.0013911215,0.00035371195,0.00048544956,0.00019827137,0.00087222515,0.0020439005,0.00016785561,0.0129084755,0.90997916,0.06616593,0.0005845047],"about_ca_topic_score_codex":0.0000012198734,"about_ca_topic_score_gemma":9.815735e-7,"teacher_disagreement_score":0.08230634,"about_ca_system_score_codex":0.000045299814,"about_ca_system_score_gemma":0.000071747454,"threshold_uncertainty_score":0.74809384},"labels":[],"label_agreement":null},{"id":"W2039325744","doi":"10.1016/j.jcta.2005.09.007","title":"A combinatorial proof of the Rogers–Ramanujan and Schur identities","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorial proof; Ramanujan's sum; Mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.015835563125030552,"score_gpt":0.2794830966889912,"score_spread":0.26364753356396065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039325744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97829723,0.00097095995,0.000792464,0.0008812172,0.008468147,0.0006099923,0.000012488675,0.000045674173,0.009921808],"genre_scores_gemma":[0.9951054,0.000054783988,0.001822381,0.000022362356,0.0009965412,0.000007113015,1.9252595e-7,0.000041549116,0.0019496854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746233,0.00031651228,0.001069653,0.00013269878,0.00075228343,0.00026650625],"domain_scores_gemma":[0.99683815,0.0009793394,0.0011888226,0.0003824368,0.0005012071,0.00011001967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016095608,0.00024176615,0.00070847466,0.000121149445,0.00019622156,0.00010128927,0.00056285126,0.00013210981,0.000116720854],"category_scores_gemma":[0.0028780922,0.00016610947,0.0002754122,0.00020121985,0.00066740834,0.0010123507,0.0002646634,0.00041482694,0.0000016885363],"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.0004348175,0.00026658407,0.00005036988,0.0002114963,0.00013977998,0.0000062248523,0.0014873575,0.0000046521895,0.0005216099,0.99582154,0.0008653799,0.0001901868],"study_design_scores_gemma":[0.0017675048,0.00035578507,0.00002422405,0.00026228064,0.00015954673,0.00017576273,0.0014817051,0.000004669351,0.03027365,0.9629954,0.0023380367,0.0001614018],"about_ca_topic_score_codex":0.0000011170611,"about_ca_topic_score_gemma":0.0000020621449,"teacher_disagreement_score":0.032826107,"about_ca_system_score_codex":0.00008683328,"about_ca_system_score_gemma":0.0001294777,"threshold_uncertainty_score":0.6773748},"labels":[],"label_agreement":null},{"id":"W2040192988","doi":"10.1016/j.jcta.2015.01.005","title":"Simple recurrence formulas to count maps on orientable surfaces","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Generating function; Bijection; Bipartite graph; Combinatorics; Simple (philosophy); Genus; Recurrence relation; Interpretation (philosophy); Discrete mathematics; Graph","score_opus":0.0453241027719853,"score_gpt":0.32527315538470486,"score_spread":0.2799490526127196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040192988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92958313,0.0002633084,0.0083606625,0.00065287505,0.044237506,0.0012211158,0.00005254648,0.00018772211,0.015441135],"genre_scores_gemma":[0.9846623,0.000027404358,0.012789788,0.00012477848,0.0014118653,0.000018571334,0.0000026711696,0.00010057617,0.00086203415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676764,0.00030154106,0.0010584515,0.00022154434,0.0011802114,0.00047061994],"domain_scores_gemma":[0.99524087,0.0015464814,0.00094155985,0.00056887645,0.0011963183,0.0005058686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031452037,0.00035191947,0.0008264908,0.000185258,0.00014670071,0.00012285591,0.0007403415,0.00014440197,0.000059202637],"category_scores_gemma":[0.00829253,0.0002876622,0.00017284972,0.00047478898,0.00009432324,0.00076382863,0.000185527,0.00045668305,0.000049582213],"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.0022878712,0.00041324313,0.000038782076,0.00005340706,0.00006853669,0.000036783425,0.0016420385,0.00018273249,0.0001241957,0.9740832,0.02086912,0.00020013483],"study_design_scores_gemma":[0.0020170852,0.0029521226,0.0000026813557,0.00019339698,0.000054839526,0.00006927909,0.0015408733,0.000009544697,0.005234444,0.90204316,0.08559285,0.0002897137],"about_ca_topic_score_codex":0.000002867831,"about_ca_topic_score_gemma":0.0000018569596,"teacher_disagreement_score":0.072039984,"about_ca_system_score_codex":0.0004266094,"about_ca_system_score_gemma":0.00032793285,"threshold_uncertainty_score":0.99995756},"labels":[],"label_agreement":null},{"id":"W2040288558","doi":"10.1006/jcta.2001.3209","title":"Compactness Theorems for Geometric Packings","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quasicrystal Structures and Properties","field":"Materials Science","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":"University of Toronto","funders":"","keywords":"Rectangle; Combinatorics; Mathematics; Square (algebra); Unit square; Compact space; Geometry; Pure mathematics","score_opus":0.018106030893622956,"score_gpt":0.22845005799612392,"score_spread":0.21034402710250097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040288558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816882,0.00224447,0.0014724506,0.00043570803,0.011375503,0.00022996844,0.00002357853,0.00003467067,0.0024954658],"genre_scores_gemma":[0.9978016,0.00007890462,0.00043683505,0.00008837221,0.001167467,0.000003670843,5.5932566e-7,0.000022605316,0.00039998998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855286,0.00017409639,0.00049986376,0.00012141632,0.00035764478,0.00029410602],"domain_scores_gemma":[0.9984449,0.00039065367,0.00050604745,0.00017501728,0.0003626671,0.00012072417],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013682839,0.00017055291,0.00042213773,0.00014242968,0.0002197883,0.00019651829,0.00044308184,0.000086691216,0.0017243808],"category_scores_gemma":[0.00057255826,0.00011374299,0.00020005774,0.0002480787,0.00021730055,0.0005687877,0.000051689,0.00015184435,0.000012125559],"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.0030648203,0.00015960612,0.000061314335,0.000086710614,0.000066049426,0.00001924358,0.0015985349,0.000054489763,0.11173664,0.87122995,0.0060414756,0.0058811684],"study_design_scores_gemma":[0.001623127,0.0015400583,0.0000611391,0.000050791263,0.000046284924,0.000193012,0.00045149945,0.000011175921,0.12381806,0.77315986,0.098826565,0.00021842936],"about_ca_topic_score_codex":0.0000032862988,"about_ca_topic_score_gemma":2.5067916e-7,"teacher_disagreement_score":0.09807009,"about_ca_system_score_codex":0.000049765757,"about_ca_system_score_gemma":0.000025043451,"threshold_uncertainty_score":0.9991882},"labels":[],"label_agreement":null},{"id":"W2040687890","doi":"10.1016/j.jcta.2005.10.004","title":"On the work of Basil Gordon","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","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":"University of Regina","funders":"","keywords":"Congruence relation; Ramanujan's sum; Partition (number theory); Modular form; Ramanujan theta function; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.01750865563763116,"score_gpt":0.2667803809036236,"score_spread":0.24927172526599245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040687890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9265518,0.0003155906,0.0038345559,0.0011146175,0.0048178295,0.00035140573,0.000006171281,0.000046835583,0.0629612],"genre_scores_gemma":[0.9938007,0.000014316433,0.0018683014,0.000025492533,0.00055445445,0.000003961289,1.9310437e-7,0.000031263502,0.0037013055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826634,0.00024354023,0.0007402232,0.00007087167,0.0005079429,0.00017110005],"domain_scores_gemma":[0.9947393,0.0038145431,0.00082419504,0.00029959853,0.00028268038,0.000039705843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015036493,0.00015078767,0.00043633563,0.000074708296,0.00008770451,0.00003685536,0.00037870047,0.000069957154,0.00030624098],"category_scores_gemma":[0.0026817883,0.00009098133,0.00021582643,0.00020156274,0.00025469967,0.00023194577,0.0000593317,0.00028130293,0.0000069123225],"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.00061448076,0.00023515025,0.000012353752,0.000048849426,0.00004746759,0.000010588333,0.00019328676,0.000012921839,0.00020635253,0.9923756,0.0061926316,0.00005031925],"study_design_scores_gemma":[0.0005072614,0.0003456345,0.000030126695,0.00022308748,0.000054741548,0.000023961984,0.0004728496,6.087031e-7,0.00864062,0.9879684,0.0016431914,0.000089541485],"about_ca_topic_score_codex":0.0000014274597,"about_ca_topic_score_gemma":7.54595e-7,"teacher_disagreement_score":0.06724892,"about_ca_system_score_codex":0.000050131643,"about_ca_system_score_gemma":0.00004464527,"threshold_uncertainty_score":0.3710111},"labels":[],"label_agreement":null},{"id":"W2042105004","doi":"10.1016/j.jcta.2006.04.002","title":"The small octagon with longest perimeter","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Numerical Methods and Algorithms","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Perimeter; Regular polygon; Mathematics; Trigonometry; Series (stratigraphy); Unit (ring theory); Interval (graph theory); Combinatorics; Arithmetic; Algorithm; Computer science; Mathematical analysis; Geometry; Mathematics education","score_opus":0.006864764530871105,"score_gpt":0.21850662028562967,"score_spread":0.21164185575475858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042105004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087537125,0.0019699675,0.8786085,0.0052345064,0.017387062,0.0002645935,0.0000016096732,0.00009652737,0.008900104],"genre_scores_gemma":[0.66725355,0.00011177196,0.32601658,0.00026459474,0.0042309924,0.000008667169,3.5355873e-7,0.000045236855,0.0020682283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985169,0.00038927322,0.0003695849,0.00012954263,0.00033988865,0.00025480997],"domain_scores_gemma":[0.99833864,0.0005984756,0.000380999,0.00032242047,0.00027237833,0.00008709668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015244572,0.00014489816,0.00025066704,0.000046894635,0.00026290878,0.00036674947,0.0009421055,0.00004603406,0.000007711199],"category_scores_gemma":[0.00011259584,0.000074077456,0.00011935674,0.0002756119,0.00018309329,0.00046431323,0.000113133116,0.00027347347,0.0000030689405],"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.00033217785,0.00007446732,0.00006425529,0.0000027935407,0.000030898587,0.000062686995,0.000080758524,0.000011505588,0.0003981811,0.96700424,0.00018808513,0.031749927],"study_design_scores_gemma":[0.000816515,0.0016283636,0.00057722203,0.000025139783,0.00001755324,0.0003324002,0.00008469661,0.00005214075,0.005739605,0.8994546,0.09110828,0.0001634833],"about_ca_topic_score_codex":0.0000070360024,"about_ca_topic_score_gemma":0.0000011972386,"teacher_disagreement_score":0.57971644,"about_ca_system_score_codex":0.0000322258,"about_ca_system_score_gemma":0.00009207699,"threshold_uncertainty_score":0.35365736},"labels":[],"label_agreement":null},{"id":"W2043024709","doi":"10.1016/j.jcta.2015.03.007","title":"Large sets of complex and real equiangular lines","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equiangular polygon; Mathematics; Combinatorics; Computer science; Geometry","score_opus":0.05458883067344754,"score_gpt":0.3330086423460021,"score_spread":0.27841981167255453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043024709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840318,0.00020698454,0.0029155551,0.00029783457,0.0015038266,0.00016543252,0.000028436416,0.00001847539,0.010831687],"genre_scores_gemma":[0.9940548,0.000060053553,0.0053727645,0.000020663818,0.00028467271,9.874692e-7,0.0000014167708,0.000021571072,0.00018308715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985275,0.00017329176,0.0006829474,0.00007339953,0.00037358204,0.00016922393],"domain_scores_gemma":[0.99800086,0.000531647,0.00063903345,0.00018132327,0.00046875747,0.00017836256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023404777,0.00013318383,0.00057263765,0.00007395062,0.00003945531,0.00003182598,0.00019011753,0.000092524875,0.00009839147],"category_scores_gemma":[0.0015768516,0.00009897272,0.00011164125,0.00009274256,0.00012557558,0.00020480303,0.000106011816,0.00014802444,0.000001192463],"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.00048032208,0.00024210542,0.00006868336,0.00012446943,0.00008125239,0.000022609745,0.0012906037,4.2879176e-7,0.00059177703,0.9958232,0.0010881035,0.00018641239],"study_design_scores_gemma":[0.0015433206,0.00062027294,0.000060005008,0.00008571275,0.00006793815,0.0001027992,0.001166654,0.000113874514,0.00030093736,0.99283195,0.003005203,0.000101366284],"about_ca_topic_score_codex":0.0000016884975,"about_ca_topic_score_gemma":9.959602e-7,"teacher_disagreement_score":0.0106486,"about_ca_system_score_codex":0.00002211669,"about_ca_system_score_gemma":0.00007049245,"threshold_uncertainty_score":0.40359905},"labels":[],"label_agreement":null},{"id":"W2044138171","doi":"10.1016/j.jcta.2005.08.004","title":"Möbius functions and semigroup representation theory","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":102,"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":"Semilattice; Mathematics; Semigroup; Inverse semigroup; Krohn–Rhodes theory; Pure mathematics; Algebra over a field; Representation (politics); Bicyclic semigroup; Inverse; Product (mathematics); Representation theory; Eigenvalues and eigenvectors; Matrix (chemical analysis); Special classes of semigroups","score_opus":0.008332151884208635,"score_gpt":0.23615552530717582,"score_spread":0.22782337342296718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044138171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61023116,0.0048472243,0.34110758,0.0054486594,0.017621772,0.0004016895,0.000008812221,0.00035915605,0.019973952],"genre_scores_gemma":[0.9926629,0.00015459537,0.0041869506,0.00027345534,0.0013249367,0.0000039205424,9.702038e-7,0.0000159732,0.0013762646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826974,0.0004769414,0.00049856916,0.0001974248,0.0003387531,0.00021858621],"domain_scores_gemma":[0.99823874,0.0006087192,0.0004242888,0.00038157956,0.0002023468,0.00014435172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021909892,0.00016264846,0.0002904573,0.00016739653,0.00020928886,0.00023367537,0.00056532153,0.00008599357,0.00008271622],"category_scores_gemma":[0.00031740262,0.00013358502,0.00013093207,0.00029309624,0.00014427157,0.0021390182,0.00018466465,0.00026785143,0.00001378385],"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.00029304513,0.00008434226,0.00006322345,0.0000055072883,0.00005949918,0.00001843848,0.00097539346,0.000029549905,0.0012757524,0.95275766,0.0011863834,0.043251198],"study_design_scores_gemma":[0.0011159932,0.00042628252,0.0003760233,0.000037569993,0.000036336165,0.0006016986,0.00089889456,0.00020967002,0.003410579,0.96172625,0.030982502,0.00017818136],"about_ca_topic_score_codex":0.000001475261,"about_ca_topic_score_gemma":5.311766e-7,"teacher_disagreement_score":0.38243178,"about_ca_system_score_codex":0.000053580417,"about_ca_system_score_gemma":0.00007433712,"threshold_uncertainty_score":0.5447439},"labels":[],"label_agreement":null},{"id":"W2044637983","doi":"10.1006/jcta.1999.3007","title":"Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"University of Calgary","funders":"","keywords":"Van der Waerden's theorem; Generalization; Mathematics; Clique; Combinatorics; Independent set; Graph; Set (abstract data type); Natural number; Arithmetic progression; Discrete mathematics; Arithmetic; Computer science","score_opus":0.017421382214355567,"score_gpt":0.2850047353484325,"score_spread":0.26758335313407694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044637983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98486143,0.00029184218,0.000019055315,0.001357543,0.007191181,0.0003108384,0.0000030681858,0.000026223814,0.005938824],"genre_scores_gemma":[0.99857163,0.00012210454,0.00038491367,0.00019634042,0.0004058664,0.000009879201,3.398505e-7,0.000030758423,0.00027817753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972751,0.00081603427,0.0007372222,0.00015448526,0.00068224914,0.00033488864],"domain_scores_gemma":[0.9967666,0.0017704712,0.0005835709,0.0005687356,0.00020611449,0.0001044639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028798804,0.0002496356,0.00044840405,0.00024366505,0.00030797214,0.000078186764,0.00097295566,0.00016016216,0.00016399026],"category_scores_gemma":[0.0022209527,0.00013899815,0.00030179985,0.00041181827,0.00031503293,0.00026211003,0.00020398373,0.001153523,0.0000014240951],"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.0020092032,0.00022329223,0.0008218987,0.000013831482,0.000102889295,0.00016437465,0.0014930214,0.0000026695802,0.0000440639,0.9932311,0.0012798292,0.0006137829],"study_design_scores_gemma":[0.0016507872,0.00048689893,0.0007626392,0.00019675755,0.000044998127,0.0003757756,0.0014242309,0.0000021737058,0.00039203418,0.99191695,0.0025759637,0.000170781],"about_ca_topic_score_codex":0.0000024816031,"about_ca_topic_score_gemma":0.000009085907,"teacher_disagreement_score":0.013710196,"about_ca_system_score_codex":0.00008319803,"about_ca_system_score_gemma":0.00008366091,"threshold_uncertainty_score":0.566818},"labels":[],"label_agreement":null},{"id":"W2045430869","doi":"10.1016/j.jcta.2014.12.003","title":"Combinatorics of labelled parallelogram polyominoes","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; National Science Foundation","keywords":"Polyomino; Parallelogram; Enumeration; Mathematics; Combinatorics; Connection (principal bundle); Discrete mathematics; Geometry; Computer science","score_opus":0.018793619843996356,"score_gpt":0.28743853764086785,"score_spread":0.2686449177968715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045430869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9184986,0.0007228937,0.032519177,0.0005029502,0.029602975,0.00094702473,0.000012674015,0.00022198408,0.016971735],"genre_scores_gemma":[0.98575646,0.000080111626,0.012853271,0.000025238378,0.0007275366,0.000007513263,9.1974147e-7,0.00008432693,0.00046459856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590856,0.00070762256,0.0018127678,0.00020278736,0.00093147793,0.00043679992],"domain_scores_gemma":[0.9921942,0.0032734994,0.00251178,0.00069369277,0.001095295,0.00023155008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034330564,0.0004016578,0.0014459251,0.00026820877,0.00014174856,0.000049102564,0.0009342949,0.00026193383,0.00008935645],"category_scores_gemma":[0.007066917,0.00033442618,0.0004396144,0.000498218,0.00033831308,0.00051660754,0.00019300512,0.00054404227,0.0000054984257],"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.0010321747,0.0007683306,0.000107571046,0.00020765864,0.00020644955,0.000012783137,0.0006941394,0.000008624791,0.0010933039,0.99439144,0.00082439696,0.00065313553],"study_design_scores_gemma":[0.003964297,0.00204794,0.00001645524,0.0001920374,0.00019670592,0.00010455931,0.0004763411,0.000017954388,0.012241182,0.97268325,0.0077456064,0.00031364383],"about_ca_topic_score_codex":0.0000016110135,"about_ca_topic_score_gemma":4.65323e-7,"teacher_disagreement_score":0.067257896,"about_ca_system_score_codex":0.000105667576,"about_ca_system_score_gemma":0.00015120472,"threshold_uncertainty_score":0.9999108},"labels":[],"label_agreement":null},{"id":"W2048141192","doi":"10.1016/j.jcta.2009.12.002","title":"The Non-Commutative Cycle Lemma","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Random Matrices and Applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Lemma (botany); Commutative property; Mathematics; Reduction (mathematics); Pure mathematics; Group (periodic table); Commutative ring; Combinatorics; Discrete mathematics; Physics; Geometry; Quantum mechanics","score_opus":0.012126769500237842,"score_gpt":0.2984994572973665,"score_spread":0.28637268779712866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048141192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90359944,0.0010634429,0.009061634,0.013504674,0.0057755313,0.00088853034,0.000009709278,0.00008343092,0.0660136],"genre_scores_gemma":[0.99744767,0.00013156908,0.0011668042,0.00006405951,0.00065096724,0.000004367349,2.3609576e-7,0.000011511303,0.00052283023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887025,0.00016250662,0.00048363197,0.00006037353,0.00025870386,0.00016452455],"domain_scores_gemma":[0.99756104,0.0013235549,0.00056200236,0.00023783393,0.00024592166,0.0000696679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014771579,0.000111695,0.00026926573,0.00003771382,0.00036829774,0.000109257846,0.00041622255,0.000049043818,0.000029429857],"category_scores_gemma":[0.00046276202,0.000066312095,0.00017086211,0.00017078246,0.00009475887,0.00024247434,0.000026255533,0.0002530332,0.0000062701943],"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.00067880313,0.00010882974,0.000003098254,0.0000038518833,0.000046993813,0.000005747983,0.0007381261,0.00000463909,0.000201895,0.9914285,0.0037364578,0.0030430793],"study_design_scores_gemma":[0.0013848298,0.00042304827,0.000081429505,0.00002054727,0.000048795628,0.000059939608,0.0009738579,0.000007832732,0.0011867691,0.9670562,0.028678454,0.00007829915],"about_ca_topic_score_codex":7.918993e-7,"about_ca_topic_score_gemma":4.6739967e-7,"teacher_disagreement_score":0.093848206,"about_ca_system_score_codex":0.000032791097,"about_ca_system_score_gemma":0.000058766713,"threshold_uncertainty_score":0.28326857},"labels":[],"label_agreement":null},{"id":"W2048145627","doi":"10.1016/j.jcta.2009.05.001","title":"Avoider–Enforcer: The rules of the game","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Complete graph; Monotonic function; Set (abstract data type); Monotone polygon; Element (criminal law); Mathematical economics; Mathematics; Graph; Combinatorics; Computer science; Law","score_opus":0.005057344982118709,"score_gpt":0.23138600549454463,"score_spread":0.22632866051242592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048145627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95728046,0.0005854212,0.0034652182,0.00278769,0.0026955905,0.0003277215,0.000010665724,0.000030742314,0.03281652],"genre_scores_gemma":[0.9984004,0.000013940496,0.0001107064,0.000070290924,0.0010944314,0.0000012762307,5.9721833e-7,0.000008376614,0.000299968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986418,0.00028910566,0.00052795076,0.00006922462,0.00031454256,0.00015741368],"domain_scores_gemma":[0.9983692,0.00022230217,0.000765909,0.00036637654,0.00023560302,0.000040604264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009390174,0.000133484,0.00033622413,0.000045341545,0.00014260216,0.000053055814,0.00070540566,0.00003192706,0.00026454264],"category_scores_gemma":[0.000041943254,0.000068978785,0.00045579186,0.00019018719,0.00017064576,0.00018907567,0.00007726113,0.000325003,0.0000015107602],"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.00018162676,0.00007482503,0.0004358608,0.0000016354471,0.00012339707,6.015603e-7,0.0003327189,0.000051895968,0.00048425983,0.9897662,0.0020017466,0.006545243],"study_design_scores_gemma":[0.0003486361,0.00021768193,0.0011745162,0.000042002437,0.00010007625,0.000006869845,0.00031804136,0.000013422496,0.0065464643,0.96466357,0.026491756,0.000076952194],"about_ca_topic_score_codex":0.000008025836,"about_ca_topic_score_gemma":3.106613e-7,"teacher_disagreement_score":0.041119985,"about_ca_system_score_codex":0.000020771227,"about_ca_system_score_gemma":0.000080592814,"threshold_uncertainty_score":0.28965566},"labels":[],"label_agreement":null},{"id":"W2048170084","doi":"10.1016/j.jcta.2009.12.009","title":"A new source of seed pairs for Golay sequences of length <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mn>2</mml:mn><mml:mi>m</mml:mi></mml:msup></mml:math>","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"PAPR reduction in OFDM","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Mathematics; Complementary sequences; Sequence (biology); Phase (matter); Combinatorics; Statistics; Physics; Biology; Genetics","score_opus":0.011752440008418715,"score_gpt":0.2305285340564384,"score_spread":0.21877609404801968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048170084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97133464,0.001221015,0.0012400323,0.00044884265,0.016717978,0.0001075865,0.00015832805,0.00013224038,0.008639334],"genre_scores_gemma":[0.99054575,0.0005224253,0.0040228954,0.000092635426,0.0040109656,0.0000932132,0.000047482543,0.00034593348,0.0003186746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.994287,0.00032653607,0.0021391958,0.00061155006,0.0015449133,0.0010907918],"domain_scores_gemma":[0.9937385,0.0014873135,0.0025497922,0.00115337,0.00041569743,0.000655337],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00250502,0.0006883417,0.0007153932,0.00038018057,0.0005876143,0.00039379045,0.0014864865,0.0013015039,0.0022722522],"category_scores_gemma":[0.0019902224,0.00093278044,0.0014955108,0.00058845384,0.001008033,0.0014922154,0.0004895604,0.0017055869,0.00012774985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003675445,0.0002560265,0.00001258395,0.0009792824,0.0015494105,0.00015821258,0.0035352756,0.0038578734,0.026445603,0.950299,0.008158551,0.001072689],"study_design_scores_gemma":[0.0066451645,0.005564023,0.00005102739,0.0016376739,0.0016979742,0.0027293873,0.0073417486,0.060311668,0.83733886,0.029670056,0.045461956,0.0015504708],"about_ca_topic_score_codex":0.00024510312,"about_ca_topic_score_gemma":0.000037256774,"teacher_disagreement_score":0.92062896,"about_ca_system_score_codex":0.00004317005,"about_ca_system_score_gemma":0.0015773262,"threshold_uncertainty_score":0.999995},"labels":[],"label_agreement":null},{"id":"W2049223273","doi":"10.1016/j.jcta.2007.12.003","title":"Partition identities and the coin exchange problem","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","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 British Columbia","funders":"","keywords":"Partition (number theory); Mathematics; Mathematical economics; Computer science; Combinatorics","score_opus":0.027337613386615944,"score_gpt":0.2756742187194449,"score_spread":0.24833660533282897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049223273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8997359,0.006223405,0.018180883,0.0030508079,0.008951471,0.0017282803,0.000018035063,0.00022145936,0.06188975],"genre_scores_gemma":[0.97793365,0.0017095589,0.005119903,0.00007380188,0.0011732209,0.00003550797,6.453573e-7,0.00005313794,0.013900588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983853,0.0003346997,0.0006047975,0.00008045547,0.00041578466,0.0001789711],"domain_scores_gemma":[0.99754494,0.0013744957,0.000563426,0.00017739575,0.00027095218,0.00006879686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001706073,0.00014721959,0.00045907724,0.00007140381,0.00027074871,0.00006883992,0.00020985767,0.00006120391,0.00014774683],"category_scores_gemma":[0.001405196,0.00009187207,0.00013683132,0.00010087339,0.0009089182,0.0007749346,0.00009825081,0.00023579189,0.0000046233326],"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.00071768044,0.000067062014,0.000012314157,0.00013192305,0.000068652036,0.000038832062,0.0034012476,7.253334e-7,0.000043859967,0.9922504,0.0032305403,0.000036774163],"study_design_scores_gemma":[0.0022928421,0.0002057273,0.000014250545,0.00010345753,0.00008214381,0.0009556261,0.0011639249,0.0000022056327,0.00077841926,0.992093,0.002204724,0.000103646154],"about_ca_topic_score_codex":0.0000015308971,"about_ca_topic_score_gemma":0.0000015762863,"teacher_disagreement_score":0.078197725,"about_ca_system_score_codex":0.00003668475,"about_ca_system_score_gemma":0.000043683795,"threshold_uncertainty_score":0.37464342},"labels":[],"label_agreement":null},{"id":"W2049742021","doi":"10.1016/s0097-3165(03)00048-7","title":"On intervals in some posets of forests","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Factorization; Binary number; Mathematics; Combinatorics; Binary tree; Arithmetic; Algorithm","score_opus":0.022020894112846027,"score_gpt":0.3075137463898115,"score_spread":0.28549285227696547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049742021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98751086,0.00017182845,0.00092708616,0.00007349916,0.007577935,0.000296601,0.00000362342,0.000020400434,0.0034181785],"genre_scores_gemma":[0.9965007,0.000025754138,0.0030757484,0.000024154153,0.00018737222,0.0000048450524,2.0566671e-7,0.000047292087,0.00013393065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971202,0.00054827414,0.0013395925,0.00013306561,0.00057165505,0.00028721173],"domain_scores_gemma":[0.9955492,0.0023128667,0.0013002348,0.00040060378,0.00032837735,0.00010873469],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002556776,0.00025050764,0.0008871741,0.00029677848,0.000039599843,0.000022962404,0.00043381465,0.00015133873,0.000083504514],"category_scores_gemma":[0.009083723,0.00020865742,0.00024537797,0.00028584473,0.00012884477,0.0005208421,0.00005655694,0.000438052,0.000003946899],"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.001044477,0.00071110483,0.00008533071,0.00012276789,0.000067897854,0.00005023905,0.0007867099,0.000021154074,0.0004684802,0.9962574,0.00026244516,0.00012198905],"study_design_scores_gemma":[0.0028430596,0.0016362137,0.000029873278,0.00047407046,0.000038025246,0.00007981337,0.00037076787,0.0000019492802,0.020890994,0.9729275,0.0005317197,0.00017603043],"about_ca_topic_score_codex":5.854483e-7,"about_ca_topic_score_gemma":0.000001539548,"teacher_disagreement_score":0.023329921,"about_ca_system_score_codex":0.0001459967,"about_ca_system_score_gemma":0.0001379938,"threshold_uncertainty_score":0.99926317},"labels":[],"label_agreement":null},{"id":"W2050823015","doi":"10.1006/jcta.2001.3230","title":"Tree-like Properties of Cycle Factorizations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Combinatorics; Mathematics; Vertex (graph theory); Factorization; Generalization; Tree (set theory); Tuple; Product (mathematics); Degree (music); Class (philosophy); Set (abstract data type); Discrete mathematics; Computer science; Graph; Algorithm; Physics","score_opus":0.010848599789244946,"score_gpt":0.17369882893564886,"score_spread":0.16285022914640393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050823015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97267354,0.0027765788,0.0005822701,0.00003948666,0.011909086,0.0001311303,0.0000068784448,0.0000799534,0.011801054],"genre_scores_gemma":[0.9991889,0.00013031081,0.00003190631,0.0000050066933,0.00034039712,0.0000024775602,2.8402332e-7,0.000023599167,0.00027711852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989469,0.00013052802,0.0005087511,0.000052284315,0.00021622109,0.00014531949],"domain_scores_gemma":[0.9993765,0.0000555507,0.00018340706,0.00015633824,0.0001559653,0.0000722624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036415557,0.00013038053,0.00032139343,0.00012211376,0.00006111735,0.000027370314,0.00022220748,0.00007753018,0.00020591535],"category_scores_gemma":[0.00007389892,0.00010399381,0.00014935696,0.00020613169,0.000094473304,0.0004101361,0.000015118922,0.00016650211,0.0000064814726],"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.0004069404,0.00024316683,0.00024362003,0.0002466466,0.00044254825,0.000018752402,0.0058999546,0.002033825,0.06967581,0.91677815,0.0018631724,0.0021474152],"study_design_scores_gemma":[0.004195848,0.0016997434,0.00025648344,0.00075512036,0.0002494638,0.00036524047,0.006342308,0.0010415359,0.22511865,0.69604313,0.06307817,0.00085431687],"about_ca_topic_score_codex":7.3506897e-7,"about_ca_topic_score_gemma":4.3013034e-7,"teacher_disagreement_score":0.22073504,"about_ca_system_score_codex":0.000021593618,"about_ca_system_score_gemma":0.00001075377,"threshold_uncertainty_score":0.42407444},"labels":[],"label_agreement":null},{"id":"W2051380353","doi":"10.1006/jcta.2000.3088","title":"Generalized Binomial Coefficients for Molecular Species","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Analytical Chemistry and Chromatography","field":"Chemistry","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é du Québec à Montréal","funders":"","keywords":"Binomial coefficient; Mathematics; Integer (computer science); Combinatorics; Binomial (polynomial); Context (archaeology); Binomial theorem; Polynomial; Gaussian binomial coefficient; Central binomial coefficient; Negative binomial distribution; Type (biology); Discrete mathematics; Mathematical analysis; Statistics; Poisson distribution","score_opus":0.007057883494237132,"score_gpt":0.22621747799479183,"score_spread":0.2191595945005547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051380353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97572356,0.00021055035,0.0004009056,0.000118553726,0.0007309362,0.000048156562,0.000026044272,0.000026311674,0.022714958],"genre_scores_gemma":[0.9950797,0.00005180768,0.0003085579,0.00006265246,0.0011334342,0.000004311244,0.000008864805,0.000025630996,0.003325026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987221,0.000036406826,0.00052507885,0.0001402366,0.0003134266,0.00026279155],"domain_scores_gemma":[0.99905944,0.00013427905,0.00023976761,0.00020324341,0.00020017067,0.0001630934],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003180217,0.00019033499,0.00040384135,0.000041944462,0.000120373625,0.000070210626,0.00036661763,0.00015006978,0.005020133],"category_scores_gemma":[0.000135641,0.00016360752,0.00048782176,0.00013381388,0.00020362929,0.00014809867,0.000022528646,0.00020274248,0.0000054910493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010760437,0.0006340071,0.00016464229,0.00019082065,0.0006185688,0.00012135109,0.00018883562,0.00018216822,0.3049609,0.67751306,0.0031692218,0.0014959414],"study_design_scores_gemma":[0.0043441737,0.0002501306,0.000006877191,0.00006639573,0.00018176314,0.000107124695,0.00023150543,0.000020760443,0.56196815,0.21055229,0.22199026,0.00028056648],"about_ca_topic_score_codex":5.4485923e-7,"about_ca_topic_score_gemma":3.2711924e-8,"teacher_disagreement_score":0.46696082,"about_ca_system_score_codex":0.000041059237,"about_ca_system_score_gemma":0.000070653296,"threshold_uncertainty_score":0.9958894},"labels":[],"label_agreement":null},{"id":"W2051748292","doi":"10.1006/jcta.2001.3225","title":"The Largest Small Octagon","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic growth; Conjecture; Combinatorics; Unit (ring theory); Mathematics; Quadratic equation; Computer science; Geometry; Algorithm; Mathematics education","score_opus":0.019666642754590416,"score_gpt":0.2502709973929753,"score_spread":0.2306043546383849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051748292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31766948,0.034487627,0.40130517,0.035990763,0.11155969,0.0020292809,0.000014717656,0.0007675052,0.096175775],"genre_scores_gemma":[0.9895349,0.0011448851,0.004368327,0.00017603657,0.0011502359,0.0000076012293,1.5563852e-7,0.000031301577,0.0035865265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777526,0.0006426805,0.0004713012,0.00015327723,0.00054397574,0.00041350225],"domain_scores_gemma":[0.99724364,0.0011487836,0.00038714998,0.000604686,0.00044287188,0.00017286827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029412431,0.00015499684,0.00024766874,0.00012049113,0.000491989,0.00032807435,0.0022420143,0.00006904528,0.00005649367],"category_scores_gemma":[0.0008250789,0.00009893837,0.0001880873,0.0004946723,0.00028056017,0.0009445967,0.0003013567,0.0005328196,0.000031399442],"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.00022253099,0.00007622682,0.00003530147,0.0000035232033,0.000041539017,0.000063538944,0.00033434678,0.000010601211,0.00032995277,0.98719656,0.0008543645,0.010831483],"study_design_scores_gemma":[0.0007348077,0.0006423914,0.00004345347,0.000017723542,0.0000062814115,0.00023600429,0.00011914124,0.000095990654,0.0032579831,0.869141,0.12558722,0.00011805067],"about_ca_topic_score_codex":4.994575e-7,"about_ca_topic_score_gemma":7.5616657e-7,"teacher_disagreement_score":0.67186546,"about_ca_system_score_codex":0.000056587716,"about_ca_system_score_gemma":0.000053267904,"threshold_uncertainty_score":0.41662574},"labels":[],"label_agreement":null},{"id":"W2052391167","doi":"10.1016/j.jcta.2009.03.002","title":"On the asymptotic existence of cocyclic Hadamard matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Lethbridge","funders":"","keywords":"Hadamard transform; Hadamard matrix; Hadamard's inequality; Hadamard three-lines theorem; Mathematics; Hadamard's maximal determinant problem; Complex Hadamard matrix; Order (exchange); Combinatorics; Hadamard product; Binary number; Matrix (chemical analysis); Hadamard three-circle theorem; Pure mathematics; Arithmetic; Mathematical analysis; Chemistry","score_opus":0.006055257048665549,"score_gpt":0.19579576174781926,"score_spread":0.1897405046991537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052391167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810827,0.00097231433,0.00012857447,0.00017498367,0.0047857193,0.000116652765,0.000002708163,0.00003763991,0.012698723],"genre_scores_gemma":[0.9994441,0.00010822835,0.000023575083,0.000046437763,0.00028920494,0.0000013181397,1.8359695e-7,0.000013344672,0.00007357367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986783,0.00024138927,0.0005272783,0.00006301055,0.0003192692,0.00017074516],"domain_scores_gemma":[0.9987697,0.00053900824,0.00028695093,0.00023719594,0.000102981656,0.00006416078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012587148,0.00015406577,0.00036191448,0.00010702478,0.00007621915,0.000039825267,0.00042650843,0.00006280885,0.0000651302],"category_scores_gemma":[0.00019070777,0.00009934712,0.00019176776,0.00024175488,0.00009569897,0.00022323949,0.000011318582,0.00027280013,0.0000063020557],"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.0005031928,0.000051196293,0.000016619886,0.000027923385,0.00008005343,0.000016368984,0.00035312164,0.000511491,0.0023398318,0.9947464,0.0006281898,0.00072562764],"study_design_scores_gemma":[0.0005597682,0.0010419618,0.00025460412,0.00021193603,0.00004390328,0.0001105514,0.00070384366,0.000022801145,0.012911734,0.98141366,0.0025937958,0.00013142642],"about_ca_topic_score_codex":4.059877e-7,"about_ca_topic_score_gemma":1.06909994e-7,"teacher_disagreement_score":0.01836145,"about_ca_system_score_codex":0.000030581,"about_ca_system_score_gemma":0.000021069503,"threshold_uncertainty_score":0.4051258},"labels":[],"label_agreement":null},{"id":"W2053703089","doi":"10.1016/j.jcta.2009.11.009","title":"Annular embeddings of permutations for arbitrary genus","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Permutation (music); Disjoint sets; Genus; Conjugacy class; Distribution (mathematics); Graph; Surface (topology); Discrete mathematics; Geometry; Physics; Mathematical analysis","score_opus":0.022631482739046225,"score_gpt":0.32264862219851426,"score_spread":0.300017139459468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053703089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87330276,0.000717863,0.10696913,0.00091520866,0.011329428,0.001315496,0.00004671328,0.00012442023,0.0052789575],"genre_scores_gemma":[0.9375769,0.000031824347,0.061163366,0.000054425454,0.00087395025,0.000008734393,0.0000017081708,0.00004816436,0.00024095085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978695,0.00013655065,0.0011595102,0.0001300672,0.0004366788,0.00026769997],"domain_scores_gemma":[0.9960315,0.0014088424,0.001413699,0.00032608787,0.00069461326,0.00012521783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001128542,0.00023369592,0.0007718993,0.00018111627,0.00012238695,0.000035430105,0.00044907193,0.00014429067,0.00003312766],"category_scores_gemma":[0.0028317966,0.00020681297,0.00037815372,0.00025417592,0.00011746258,0.00059990346,0.00003365526,0.0002734969,8.227924e-7],"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.0010463307,0.0004325269,0.0000055544915,0.000116490395,0.00010613014,0.000013717387,0.0014421638,0.000012568637,0.003119804,0.9925453,0.0005477565,0.00061164977],"study_design_scores_gemma":[0.002071932,0.001961781,0.00001074964,0.00015627881,0.00017604954,0.00011880255,0.00088398106,0.000019745668,0.018618861,0.9730621,0.0027279658,0.00019174817],"about_ca_topic_score_codex":1.1544465e-7,"about_ca_topic_score_gemma":3.864855e-8,"teacher_disagreement_score":0.064274095,"about_ca_system_score_codex":0.000056852314,"about_ca_system_score_gemma":0.00014652635,"threshold_uncertainty_score":0.8433588},"labels":[],"label_agreement":null},{"id":"W2054188207","doi":"10.1016/j.jcta.2009.11.008","title":"On cycle systems with specified weak chromatic number","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Combinatorics; Mathematics; Order (exchange); Physics","score_opus":0.0037975787769110926,"score_gpt":0.1871654017250892,"score_spread":0.1833678229481781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054188207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9210606,0.00036229184,0.0007022785,0.00004055777,0.008840414,0.00020703788,0.0000029541134,0.00013030485,0.06865355],"genre_scores_gemma":[0.99888974,0.000023888344,0.000028981582,0.000015356927,0.00080390985,0.000002884641,5.7798155e-7,0.000030604446,0.00020403917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860775,0.00019239097,0.0005090161,0.00008906387,0.00036273798,0.0002390185],"domain_scores_gemma":[0.9992007,0.00016037234,0.00015934106,0.00024606538,0.00010286888,0.00013066237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073384383,0.00022136437,0.0004720209,0.00009601072,0.000082066734,0.00010296116,0.000256329,0.000097139025,0.00008426644],"category_scores_gemma":[0.000038064332,0.00016188876,0.00012200131,0.00020810583,0.000054131277,0.00035393532,0.0000062798426,0.00030558117,0.000034416964],"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.0013272826,0.00008823856,0.000016377688,0.000058352558,0.00014533066,0.00007512712,0.0003517537,0.005177069,0.00078398286,0.99055415,0.0011110568,0.0003112608],"study_design_scores_gemma":[0.0025196727,0.0025699073,0.00041158992,0.00082847127,0.000091291484,0.0012909042,0.0015290421,0.0002196108,0.0030176353,0.97776395,0.00927186,0.0004860424],"about_ca_topic_score_codex":5.143187e-7,"about_ca_topic_score_gemma":1.5023807e-7,"teacher_disagreement_score":0.07782915,"about_ca_system_score_codex":0.00007216872,"about_ca_system_score_gemma":0.000022135599,"threshold_uncertainty_score":0.6601632},"labels":[],"label_agreement":null},{"id":"W2056514476","doi":"10.1016/j.jcta.2005.11.005","title":"On the number of factorizations of a full cycle","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":22,"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; Algebraic number; Argument (complex analysis); Product (mathematics); Expression (computer science); Algebraic expression; Combinatorics; Algebra over a field; Pure mathematics; Computer science; Chemistry; Geometry","score_opus":0.014686246693888579,"score_gpt":0.28482919259603057,"score_spread":0.270142945902142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056514476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9717151,0.00004458783,0.010599251,0.00022167563,0.004747101,0.00031188765,0.000019243478,0.000026755866,0.01231442],"genre_scores_gemma":[0.99582523,0.000009363592,0.00350648,0.000008528901,0.0004026124,0.0000043009736,5.9398053e-7,0.00003784361,0.00020504872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976309,0.00029400017,0.001154316,0.0000908954,0.0006442626,0.00018565025],"domain_scores_gemma":[0.9935687,0.0034296678,0.001807094,0.00043472377,0.00071022264,0.0000495634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011299818,0.00019747535,0.0006199383,0.00008714363,0.00009105093,0.000019633515,0.00048986357,0.00010939572,0.0002351404],"category_scores_gemma":[0.0028564243,0.00013171007,0.0002665831,0.00033805997,0.00022819737,0.00023574154,0.0000709632,0.00028580095,0.0000038614075],"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.00057556044,0.00058340834,0.00005133698,0.00007385986,0.000086911496,0.000003951589,0.0004110464,0.00005168251,0.0025084487,0.9949581,0.00066564087,0.000030041203],"study_design_scores_gemma":[0.001013196,0.00046208242,0.00001780232,0.00016493212,0.000087298475,0.000048979433,0.00040815098,0.00000659427,0.016487485,0.98064053,0.0005473016,0.000115666975],"about_ca_topic_score_codex":0.0000029957573,"about_ca_topic_score_gemma":6.4439064e-7,"teacher_disagreement_score":0.02411015,"about_ca_system_score_codex":0.000061554,"about_ca_system_score_gemma":0.00010849672,"threshold_uncertainty_score":0.5370981},"labels":[],"label_agreement":null},{"id":"W2058026608","doi":"10.1016/j.jcta.2011.10.004","title":"A combinatorial result with applications to self-interacting random walks","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":21,"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":"Random walk; Simple (philosophy); Simple random sample; Series (stratigraphy); Mathematics; Combinatorics; Statistical physics; Discrete mathematics; Physics; Statistics; Demography; Population","score_opus":0.029100928343866277,"score_gpt":0.2923464822287513,"score_spread":0.263245553884885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058026608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020332342,0.000077025405,0.9522468,0.0002535523,0.008931184,0.0011780703,0.000025945183,0.0001530382,0.016802048],"genre_scores_gemma":[0.921452,0.0000112546295,0.07708041,0.0000696752,0.0011667527,0.00006614364,8.9489936e-7,0.000059658367,0.00009324161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802643,0.00016851602,0.0008073667,0.0001889074,0.0004999786,0.00030879214],"domain_scores_gemma":[0.9959484,0.0018866484,0.00070074835,0.00029761216,0.00088272896,0.00028390932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014082026,0.00023754552,0.00060123095,0.00012564492,0.00018828054,0.00007277658,0.00045213566,0.000106513675,0.00012587759],"category_scores_gemma":[0.0028615168,0.000174478,0.00012189742,0.00031774226,0.0000561172,0.00029747994,0.00008724155,0.00041533913,0.0000119942515],"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.010265701,0.00044927775,0.0000035730563,0.000066128625,0.00018548436,0.00004513393,0.0025928374,8.5347995e-7,0.00009837824,0.98522705,0.00034663978,0.00071891875],"study_design_scores_gemma":[0.004623308,0.0022895504,0.0000037248224,0.00016430061,0.00022433033,0.00023895335,0.001086261,0.000013746418,0.001520892,0.98386204,0.0057493066,0.00022359115],"about_ca_topic_score_codex":0.000003009645,"about_ca_topic_score_gemma":0.0000011462946,"teacher_disagreement_score":0.90111965,"about_ca_system_score_codex":0.000084625564,"about_ca_system_score_gemma":0.00018511806,"threshold_uncertainty_score":0.71150064},"labels":[],"label_agreement":null},{"id":"W2058306224","doi":"10.1016/j.jcta.2010.10.010","title":"A self paired Hopf algebra on double posets and a Littlewood–Richardson rule","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Hopf algebra; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.0366604297994211,"score_gpt":0.2733523688405685,"score_spread":0.2366919390411474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058306224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97323364,0.00041647177,0.0008850042,0.00021903985,0.0097644115,0.00071161264,0.000008996605,0.00023597239,0.014524871],"genre_scores_gemma":[0.97444916,0.00015039701,0.023921294,0.0000674362,0.0009276916,0.000019101037,7.3859303e-7,0.00011770735,0.00034649076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735045,0.00031479343,0.0009970542,0.00024749117,0.0006646888,0.00042550892],"domain_scores_gemma":[0.99673414,0.0008701155,0.0011148485,0.0005187463,0.00047605086,0.00028607523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018215957,0.0004051435,0.0008826657,0.00021858998,0.0001868669,0.00008249319,0.00050529564,0.00023233751,0.00012118304],"category_scores_gemma":[0.0011052554,0.00033369413,0.00023819816,0.00027695534,0.00015261657,0.00066551834,0.00016877732,0.00055149023,0.000014651069],"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.0035001787,0.00092705555,0.00003798144,0.00017119836,0.0002415318,0.00009812634,0.005695191,1.8412415e-7,0.00021080876,0.98818904,0.0004726052,0.00045609518],"study_design_scores_gemma":[0.004647679,0.002183656,0.0000340159,0.00022693217,0.00018495573,0.00028314668,0.00078938826,0.0000038667386,0.009946065,0.97829175,0.0030671326,0.00034142155],"about_ca_topic_score_codex":0.0000019807633,"about_ca_topic_score_gemma":4.7279661e-7,"teacher_disagreement_score":0.02303629,"about_ca_system_score_codex":0.00013762419,"about_ca_system_score_gemma":0.00013811383,"threshold_uncertainty_score":0.9999115},"labels":[],"label_agreement":null},{"id":"W2060399644","doi":"10.1016/j.jcta.2004.03.004","title":"The peak algebra and the Hecke–Clifford algebras at q=0","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":34,"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":"Clifford algebra; Mathematics; Noncommutative geometry; Algebra over a field; Formalism (music); Pure mathematics; Classification of Clifford algebras; Algebra representation; Division algebra; Hecke algebra; Hopf algebra","score_opus":0.013083767121128105,"score_gpt":0.26680467631292404,"score_spread":0.2537209091917959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060399644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9544025,0.0037293644,0.0031717995,0.009706094,0.020946607,0.0013444561,0.0000066103867,0.00013861887,0.0065539693],"genre_scores_gemma":[0.9927463,0.0009092122,0.0030930203,0.00018453004,0.0017385093,0.000029466168,5.1157406e-7,0.00010732014,0.0011911561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969053,0.00052459445,0.0011567387,0.00017568648,0.00080278,0.00043486495],"domain_scores_gemma":[0.99266344,0.004737882,0.001335076,0.00065769535,0.00043316468,0.00017271293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043428717,0.0003459319,0.0007416915,0.000066170694,0.0010026505,0.00020971797,0.00089029426,0.00014451433,0.000031993724],"category_scores_gemma":[0.005528657,0.00017708687,0.0003242787,0.0002532007,0.0011608547,0.00047502606,0.00041333202,0.00061660487,0.000009380812],"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.0029666354,0.000107203356,0.000006644109,0.000038546994,0.00019755107,0.00002580438,0.0019187385,0.0000053598906,0.00008762996,0.9936752,0.00062749884,0.00034320512],"study_design_scores_gemma":[0.0077473065,0.0004771876,0.000009762633,0.00010408775,0.00017154503,0.00062020356,0.0014033656,0.0000020051843,0.0018066555,0.9709353,0.016513132,0.00020945752],"about_ca_topic_score_codex":0.0000023167509,"about_ca_topic_score_gemma":0.000007715859,"teacher_disagreement_score":0.038343795,"about_ca_system_score_codex":0.00024096832,"about_ca_system_score_gemma":0.00016473058,"threshold_uncertainty_score":0.7711678},"labels":[],"label_agreement":null},{"id":"W2061558558","doi":"10.1016/j.jcta.2011.03.001","title":"A new perspective on k-triangulations","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":50,"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é du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Regular polygon; Connection (principal bundle); Mathematics; Perspective (graphical); Simplicial complex; Geometry; Graph","score_opus":0.047996022444638534,"score_gpt":0.31770253718352276,"score_spread":0.26970651473888424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061558558","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23537412,0.00084929075,0.18914539,0.0019501183,0.08169308,0.0025978212,0.000024596333,0.00068906054,0.48767653],"genre_scores_gemma":[0.90768117,0.000024642211,0.08697889,0.000062657884,0.0026392655,0.0000071261893,3.2499273e-7,0.00010908643,0.0024968656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980673,0.00024407385,0.00075422926,0.00015085032,0.0005256251,0.00025790735],"domain_scores_gemma":[0.9967346,0.0010005785,0.00094392546,0.0004221426,0.0006758893,0.00022285951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009662055,0.0002520074,0.0005670772,0.00021556317,0.0001269094,0.000036578407,0.00047905184,0.00013445273,0.0005445138],"category_scores_gemma":[0.00396826,0.00020686451,0.00028107324,0.00031702858,0.00009026929,0.00050833914,0.00006827186,0.00042842393,0.000021542692],"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.0017018327,0.00035297326,0.000007727499,0.000013322995,0.0001507677,0.000041121562,0.005961204,0.0000016137883,0.00009897696,0.98942083,0.0019333648,0.00031624374],"study_design_scores_gemma":[0.0021130685,0.001572984,0.000020252168,0.00010822995,0.00012107128,0.00010963382,0.002882848,9.889479e-7,0.00409234,0.9867527,0.0020190142,0.00020686795],"about_ca_topic_score_codex":0.0000052017363,"about_ca_topic_score_gemma":9.73867e-7,"teacher_disagreement_score":0.672307,"about_ca_system_score_codex":0.0002713693,"about_ca_system_score_gemma":0.00026247877,"threshold_uncertainty_score":0.843569},"labels":[],"label_agreement":null},{"id":"W2062529082","doi":"10.1006/jcta.2001.3180","title":"A Generalization of Two q-Identities of Andrews","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"University of Victoria","funders":"","keywords":"Fibonacci number; Generalization; Unification; George (robot); Mathematics; Object (grammar); Algebra over a field; Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis; Programming language","score_opus":0.02793526091221507,"score_gpt":0.32375617140830687,"score_spread":0.2958209104960918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062529082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9660504,0.00051555864,0.022602169,0.0000617099,0.0025944859,0.00018915556,0.0000073390747,0.000022936332,0.007956263],"genre_scores_gemma":[0.9860247,0.00039335067,0.009316944,0.000008326644,0.00046495843,0.0000028710726,8.423116e-7,0.000035250858,0.0037527732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806076,0.00019189918,0.0010547929,0.00006960845,0.00047796936,0.00014497967],"domain_scores_gemma":[0.997173,0.00055674044,0.0013325996,0.00021893704,0.0006622602,0.000056448363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010594042,0.00013633847,0.00062232686,0.00017158523,0.000043819964,0.000023275856,0.00026692465,0.000062551,0.0002695776],"category_scores_gemma":[0.0015506963,0.00011409895,0.00019908839,0.00020923161,0.0002464637,0.0006439725,0.000068009394,0.00012506302,0.000001172849],"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.00042264978,0.00020019249,0.00013716308,0.00020830779,0.00010004602,0.000014625131,0.001023879,0.000030186688,0.004064212,0.9932557,0.00048256514,0.000060512128],"study_design_scores_gemma":[0.0012524807,0.00036238573,0.000012691266,0.00020074581,0.00010931989,0.00014025596,0.00096871646,0.0000072116127,0.029603831,0.966796,0.00045130265,0.00009509044],"about_ca_topic_score_codex":0.0000023327254,"about_ca_topic_score_gemma":0.000001908247,"teacher_disagreement_score":0.026459692,"about_ca_system_score_codex":0.00003749067,"about_ca_system_score_gemma":0.00006474202,"threshold_uncertainty_score":0.465282},"labels":[],"label_agreement":null},{"id":"W2063346456","doi":"10.1016/j.jcta.2014.06.003","title":"Measurable events indexed by words","year":2014,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","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":"University of Toronto","funders":"","keywords":"Combinatorics; Integer (computer science); Dimension (graph theory); Tree (set theory); Mathematics; Omega; Space (punctuation); Constant (computer programming); Discrete mathematics; Physics; Quantum mechanics","score_opus":0.01850507248785363,"score_gpt":0.27761987846084285,"score_spread":0.2591148059729892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063346456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90329474,0.0021505454,0.0052832905,0.00043068282,0.07696559,0.00078901945,0.00008687442,0.0001347363,0.010864543],"genre_scores_gemma":[0.99451417,0.0002118353,0.0013904445,0.00009030593,0.0023262673,0.00001069414,0.0000061192304,0.00010706976,0.0013430811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953908,0.0013225584,0.0014419274,0.00030697955,0.0011039001,0.0004338878],"domain_scores_gemma":[0.99478906,0.0010354825,0.0024147038,0.0008473441,0.00066623307,0.00024715002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0053121834,0.0005673485,0.0014607055,0.00023845841,0.0002984983,0.0001186905,0.001430502,0.0007566829,0.00029452305],"category_scores_gemma":[0.0020292557,0.000440874,0.0007275298,0.00014445971,0.00023208132,0.0002554003,0.00083554635,0.0020406449,0.0000027391172],"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.0019349639,0.00019260123,0.00008853569,0.00029062698,0.0007190516,0.000018624345,0.001192716,0.000014836705,0.00011224542,0.97695124,0.017536942,0.00094762904],"study_design_scores_gemma":[0.0015247867,0.0004019367,0.0000235277,0.0004845114,0.00028549682,0.00009507139,0.00020575209,0.0000029122239,0.0014157427,0.9751712,0.019948374,0.0004407042],"about_ca_topic_score_codex":0.0000023043901,"about_ca_topic_score_gemma":5.212606e-7,"teacher_disagreement_score":0.09121946,"about_ca_system_score_codex":0.00016951954,"about_ca_system_score_gemma":0.00024889418,"threshold_uncertainty_score":0.9998043},"labels":[],"label_agreement":null},{"id":"W2064465307","doi":"10.1016/j.jcta.2008.08.007","title":"Distributive lattices of small width, II: A problem from Stanley's 1986 text Enumerative Combinatorics","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":"Combinatorics; Cardinality (data modeling); Distributive property; Partially ordered set; Mathematics; Enumerative combinatorics; Order (exchange); Extremal combinatorics; Algebraic combinatorics; Generating function; Distributive lattice; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.009677406249627167,"score_gpt":0.22997294305811897,"score_spread":0.2202955368084918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064465307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59044904,0.004559527,0.37892625,0.0038825087,0.013095282,0.0009910978,0.00015012673,0.00021986949,0.007726281],"genre_scores_gemma":[0.98674744,0.00011207028,0.012614842,0.00010349254,0.00027673808,0.0000027024614,0.000004645363,0.000011644666,0.0001264074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997535,0.00040183964,0.00087755744,0.00027774984,0.000548841,0.00035903076],"domain_scores_gemma":[0.99665606,0.00056545093,0.0013640401,0.00041193538,0.00081453886,0.00018795268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083793065,0.0003004467,0.0007271189,0.00012478465,0.00026360297,0.00012097919,0.0012763864,0.00014102779,0.000026172052],"category_scores_gemma":[0.0002554166,0.00023910882,0.00021094075,0.00055567897,0.00019556687,0.0011759208,0.00023155173,0.0004865349,0.0000026586254],"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.00063080416,0.00049240445,0.000073440024,0.000008226669,0.00010639761,0.000061357474,0.0025302032,0.000049288687,0.001184875,0.9849911,0.000115195195,0.009756708],"study_design_scores_gemma":[0.0018164095,0.003943542,0.000377515,0.00010065476,0.000044332814,0.00004633235,0.0003750595,0.000041636926,0.012930696,0.9752367,0.0048319716,0.00025514505],"about_ca_topic_score_codex":0.000005650379,"about_ca_topic_score_gemma":0.0000017391777,"teacher_disagreement_score":0.3962984,"about_ca_system_score_codex":0.00011803463,"about_ca_system_score_gemma":0.00024321389,"threshold_uncertainty_score":0.9750574},"labels":[],"label_agreement":null},{"id":"W2064723783","doi":"10.1016/j.jcta.2009.04.007","title":"Coloring axis-parallel rectangles","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","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":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Point (geometry); Construct (python library); Mathematics; Plane (geometry); Computer science; Geometry","score_opus":0.00995740381703517,"score_gpt":0.23863102350545598,"score_spread":0.22867361968842081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064723783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23204045,0.0016018493,0.7296373,0.004889002,0.020109052,0.00022284678,0.0000011642917,0.00013078538,0.011367548],"genre_scores_gemma":[0.9725551,0.000060364444,0.025770772,0.00022888173,0.0010601785,9.3051034e-7,5.825279e-7,0.0000042740253,0.00031890892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886674,0.0001594265,0.00037274364,0.00011097326,0.0003400376,0.00015011146],"domain_scores_gemma":[0.9989658,0.00016913339,0.000301765,0.00015990413,0.0003122647,0.00009115142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851762,0.00010363118,0.00020307081,0.00015311847,0.00013207024,0.00015438543,0.00051094865,0.000050185317,0.000016672224],"category_scores_gemma":[0.00021535116,0.00009029229,0.000108571985,0.0003732984,0.000025063739,0.0011119908,0.000046751287,0.00016111681,0.000004992989],"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.0002474339,0.00007535583,0.000007661634,0.0000020706127,0.00001900717,0.000027585465,0.0002934763,0.00097190525,0.0014947967,0.978479,0.0007019654,0.017679717],"study_design_scores_gemma":[0.0007466851,0.0012019707,0.00049147406,0.000022617893,0.000008626427,0.00021214127,0.00004457011,0.00025855628,0.0041927877,0.96696097,0.025740517,0.00011910019],"about_ca_topic_score_codex":2.601573e-7,"about_ca_topic_score_gemma":1.1908909e-7,"teacher_disagreement_score":0.74051464,"about_ca_system_score_codex":0.000049912367,"about_ca_system_score_gemma":0.0001279556,"threshold_uncertainty_score":0.36820126},"labels":[],"label_agreement":null},{"id":"W2065215403","doi":"10.1016/j.jcta.2004.01.007","title":"Bose–Mesner algebras attached to invertible Jones pairs","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","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 Waterloo","funders":"National Science Council","keywords":"Invertible matrix; Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.023113355523870952,"score_gpt":0.2860101398870554,"score_spread":0.2628967843631845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065215403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792187,0.0002552434,0.0021241712,0.0016821162,0.014566376,0.000350289,0.0000034066054,0.00008723863,0.0017124573],"genre_scores_gemma":[0.99450535,0.00002307513,0.0028409804,0.00035143903,0.0018789583,0.000010000443,7.7766055e-7,0.0000727499,0.00031670087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971774,0.00025003497,0.001019631,0.00025260908,0.0008165105,0.0004837778],"domain_scores_gemma":[0.99757755,0.0003892273,0.0006327209,0.00048610708,0.0005143049,0.00040010983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013763263,0.00038070302,0.00083122397,0.0002342871,0.00022334635,0.00013551625,0.0007262268,0.00023538274,0.0002585231],"category_scores_gemma":[0.0014095018,0.00030253682,0.0003915279,0.0004576862,0.00013645359,0.00061330525,0.00018948968,0.00048778206,0.000021003312],"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.0014465654,0.00021104484,0.000078087025,0.00003812153,0.00020557837,0.000054412787,0.0017327577,0.00007061975,0.0005961931,0.99334145,0.0019020877,0.00032309204],"study_design_scores_gemma":[0.0031252196,0.0013112786,0.00009100044,0.00013639228,0.00011443693,0.00015834346,0.00079173077,5.882178e-7,0.011023951,0.97665125,0.0062417095,0.0003540914],"about_ca_topic_score_codex":0.000011972618,"about_ca_topic_score_gemma":0.0000032395994,"teacher_disagreement_score":0.016690182,"about_ca_system_score_codex":0.00023640359,"about_ca_system_score_gemma":0.00033573527,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W2066106400","doi":"10.1016/j.jcta.2013.01.010","title":"Advances in the merit factor problem for binary sequences","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"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","funders":"","keywords":"Mathematics; Binary number; Skew; Conjecture; Figure of merit; Aperiodic graph; Combinatorics; Complementary sequences; Binary Golay code; Pseudorandom binary sequence; Autocorrelation; Discrete mathematics; Algorithm; Statistics; Computer science; Arithmetic","score_opus":0.010201449082750266,"score_gpt":0.24430902632471282,"score_spread":0.23410757724196257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066106400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7723161,0.012677379,0.1482309,0.017614376,0.02922138,0.0036671308,0.00001731176,0.00024172834,0.016013706],"genre_scores_gemma":[0.99349356,0.0002495612,0.005629207,0.00017614948,0.00037061732,0.00004707444,2.6335744e-7,0.0000075425237,0.0000260141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998462,0.00042407724,0.0004334332,0.00013881948,0.0002973452,0.0002442858],"domain_scores_gemma":[0.9982764,0.00082605454,0.0003597178,0.00025745202,0.00022194555,0.000058419664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127921,0.00014380147,0.00025590396,0.00015331873,0.00016397637,0.00026173878,0.0014794365,0.000054799828,0.000039031278],"category_scores_gemma":[0.00014452396,0.00008742487,0.00018658722,0.0004399737,0.0001465424,0.0027189862,0.000074619784,0.0002213048,0.000003001705],"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.00019234666,0.00008726317,0.00008892525,0.000020326757,0.000014696876,0.000007690484,0.0018023209,0.000013568181,0.0005852437,0.97931993,0.00021717278,0.01765051],"study_design_scores_gemma":[0.0005634274,0.0012837709,0.00017512612,0.000051930092,0.000006440549,0.000057622477,0.0007857318,0.000022862516,0.00058934424,0.9635845,0.03276033,0.00011892501],"about_ca_topic_score_codex":0.0000019553718,"about_ca_topic_score_gemma":8.3842565e-7,"teacher_disagreement_score":0.22117747,"about_ca_system_score_codex":0.000020590123,"about_ca_system_score_gemma":0.00007909576,"threshold_uncertainty_score":0.35650828},"labels":[],"label_agreement":null},{"id":"W2066934281","doi":"10.1016/j.jcta.2013.09.005","title":"Non-D-finite excursions in the quarter plane","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Invertible matrix; Combinatorics; Plane (geometry); Finite set; Sequence (biology); Polynomial; Generating function; Point (geometry); Quarter (Canadian coin); Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.01739643027986382,"score_gpt":0.27716853887648824,"score_spread":0.2597721085966244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066934281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960481,0.00017892542,0.0048270496,0.0029315508,0.015217128,0.0014336682,0.000005011988,0.000064540945,0.014861129],"genre_scores_gemma":[0.995776,0.000026896872,0.0029043502,0.00011939603,0.0009003624,0.000034523473,7.587467e-7,0.000039561226,0.00019817887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974352,0.00040326218,0.0010312446,0.00013065977,0.00063728436,0.00036233093],"domain_scores_gemma":[0.99489266,0.003341589,0.000792763,0.0005185278,0.0003434144,0.00011104947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020966046,0.00026145484,0.00059546315,0.00018027156,0.0001306716,0.00012496978,0.00086558063,0.00014593687,0.00026764398],"category_scores_gemma":[0.0018811127,0.0001664935,0.0001982239,0.00036737666,0.00014776185,0.00078090135,0.000076763994,0.000682572,0.000048545364],"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.00022328875,0.000425156,0.00006474306,0.000047380174,0.000046552006,0.000048569953,0.004207681,0.0000063430475,0.00026823362,0.98764527,0.006863158,0.00015360302],"study_design_scores_gemma":[0.0017466471,0.0007147564,0.00009929355,0.00015102507,0.000043071017,0.0001638437,0.0048478786,0.000013622169,0.00038303182,0.9885083,0.0031386167,0.00018990891],"about_ca_topic_score_codex":0.000004022859,"about_ca_topic_score_gemma":0.0000015166701,"teacher_disagreement_score":0.035294976,"about_ca_system_score_codex":0.00007911836,"about_ca_system_score_gemma":0.00008946378,"threshold_uncertainty_score":0.6789408},"labels":[],"label_agreement":null},{"id":"W2067182672","doi":"10.1016/j.jcta.2008.01.009","title":"A bound on the size of separating hash families","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"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":"Engineering and Physical Sciences Research Council","keywords":"Hash function; Upper and lower bounds; Perfect hash function; Collision resistance; Mathematics; Double hashing; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Hash table; Computer security","score_opus":0.014942243950462786,"score_gpt":0.22755504918899902,"score_spread":0.21261280523853623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067182672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843617,0.00019462801,0.0032162382,0.0006650588,0.0037372368,0.00009455284,0.0000012482749,0.000030111692,0.007699229],"genre_scores_gemma":[0.9985488,0.00006857831,0.0008129706,0.0001661127,0.00029071252,0.00000194296,4.611367e-8,0.000007446313,0.00010336669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982994,0.0004885188,0.0004771808,0.00011444707,0.00043939063,0.00018102194],"domain_scores_gemma":[0.99677885,0.0019654809,0.00054845365,0.00039444902,0.00025059344,0.00006215229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018778234,0.00014215142,0.00030940183,0.00010152719,0.00036021473,0.000078506026,0.001058218,0.000053721134,0.0000381981],"category_scores_gemma":[0.0007263432,0.000091147,0.00025847412,0.00044216655,0.0003651017,0.0005030406,0.00013090228,0.0002920566,0.000002880271],"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.0005068137,0.00010245889,0.00010133753,0.0000062123645,0.00006511765,0.000027716229,0.002576081,0.000019407935,0.0013832948,0.99393934,0.0006023612,0.0006698341],"study_design_scores_gemma":[0.0006305832,0.0014121437,0.00036771,0.000073496325,0.000013671243,0.00020667257,0.00056873227,0.000015908514,0.011538253,0.9784373,0.006616938,0.0001185871],"about_ca_topic_score_codex":0.0000012454838,"about_ca_topic_score_gemma":2.468812e-7,"teacher_disagreement_score":0.015502061,"about_ca_system_score_codex":0.00001844944,"about_ca_system_score_gemma":0.00013322337,"threshold_uncertainty_score":0.37168667},"labels":[],"label_agreement":null},{"id":"W2069076235","doi":"10.1016/j.jcta.2013.05.006","title":"Average mixing of continuous quantum walks","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"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":"Kempe Foundation","keywords":"Combinatorics; Adjacency matrix; Mathematics; Valency; Mixing (physics); Matrix (chemical analysis); Discrete mathematics; Quantum walk; Graph; Quantum; Quantum algorithm; Physics; Quantum mechanics","score_opus":0.004749944518514823,"score_gpt":0.2049384801558578,"score_spread":0.20018853563734298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069076235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85644317,0.0004997953,0.13005903,0.0009307958,0.010828242,0.00017773667,0.0000014557767,0.00006138489,0.0009983788],"genre_scores_gemma":[0.9909182,0.000018839264,0.008340282,0.0000702409,0.0005485971,0.000001300302,1.8206107e-7,0.000013113314,0.00008924826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981441,0.00029429598,0.0006926789,0.00015562872,0.0004325417,0.00028074294],"domain_scores_gemma":[0.9978633,0.0003974612,0.000767451,0.0003541721,0.00048220885,0.00013541308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011226215,0.00017673011,0.0004938563,0.00015848332,0.000117215495,0.00016482623,0.0010836154,0.000081962695,0.000050180028],"category_scores_gemma":[0.00025198367,0.00013490164,0.00022510462,0.00027717234,0.000115772884,0.00069211284,0.00024113378,0.0003813813,0.000007344259],"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.000106634034,0.00014989045,0.000077588105,0.000029956407,0.000090392256,0.000057988294,0.0018317231,0.0006380101,0.0048453757,0.96773773,0.00070079736,0.023733888],"study_design_scores_gemma":[0.0011411486,0.0012674663,0.00046807915,0.00014381538,0.00001215406,0.00036406002,0.00016963406,0.008099015,0.006333802,0.97774774,0.004036728,0.00021633277],"about_ca_topic_score_codex":0.000011157732,"about_ca_topic_score_gemma":1.0575222e-7,"teacher_disagreement_score":0.13447502,"about_ca_system_score_codex":0.000024180265,"about_ca_system_score_gemma":0.000111803,"threshold_uncertainty_score":0.5501129},"labels":[],"label_agreement":null},{"id":"W2069955765","doi":"10.1006/jcta.2001.3246","title":"Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Suzhou University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Group (periodic table); Type (biology); Mathematics; Block (permutation group theory); Combinatorics; Block size; Spectrum (functional analysis); Physics; Computer science; Biology","score_opus":0.01417728954953936,"score_gpt":0.1983650972140626,"score_spread":0.18418780766452322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069955765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879359,0.0007542522,0.0001958795,0.000077347744,0.0024865079,0.0003000413,0.0000043707096,0.0001123356,0.008133381],"genre_scores_gemma":[0.99724257,0.00024852532,0.00037670674,0.000074707394,0.0005311825,0.000009160654,6.2935715e-7,0.000093711074,0.0014228207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980408,0.00026586824,0.0005456082,0.00021650197,0.00043171254,0.00049950765],"domain_scores_gemma":[0.99831814,0.0004029001,0.00035348564,0.00039001473,0.00022130663,0.00031415615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011194028,0.00040310324,0.0006369794,0.00014259729,0.00035842435,0.00032811222,0.00043475343,0.00018374389,0.0005151785],"category_scores_gemma":[0.00023964536,0.00027258307,0.000105843574,0.00038135768,0.00017047788,0.00075711793,0.000062183564,0.0005014825,0.000032434775],"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.015421195,0.0004907082,0.0016965463,0.00036112306,0.0011912122,0.0017739726,0.0026114588,0.00028635774,0.0044489703,0.970531,0.00082327897,0.00036420795],"study_design_scores_gemma":[0.02372588,0.03915985,0.0015742839,0.0020242587,0.00076440535,0.01784804,0.006498299,0.00018690681,0.014686579,0.8659281,0.025355456,0.0022479175],"about_ca_topic_score_codex":0.000011416953,"about_ca_topic_score_gemma":0.000017092008,"teacher_disagreement_score":0.10460284,"about_ca_system_score_codex":0.000052405714,"about_ca_system_score_gemma":0.00004898007,"threshold_uncertainty_score":0.99997264},"labels":[],"label_agreement":null},{"id":"W2070651047","doi":"10.1016/j.jcta.2003.09.004","title":"Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":36,"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":"Bijection; Ballot; Reflection (computer programming); Mathematics; Integer (computer science); Rotation (mathematics); Mathematical proof; Combinatorics; Boundary (topology); Geometry; Mathematical analysis; Law; Computer science; Political science","score_opus":0.03903225595970209,"score_gpt":0.3060320941221698,"score_spread":0.2669998381624677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070651047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8143707,0.00241192,0.02665753,0.01606734,0.07270226,0.0035237097,0.000017189413,0.00020140359,0.064047955],"genre_scores_gemma":[0.99377507,0.000036197802,0.004098414,0.000198474,0.0009683913,0.000018698567,2.467358e-7,0.00007917805,0.00082531996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582005,0.0014650153,0.0012990128,0.00016371685,0.000891139,0.0003610593],"domain_scores_gemma":[0.99385923,0.0025871538,0.0019207114,0.00095038285,0.00060225994,0.000080255704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005705232,0.00031407794,0.0006079701,0.00008006201,0.00080885296,0.00017800684,0.0012206226,0.00015882721,0.00017304606],"category_scores_gemma":[0.0071903844,0.00015133599,0.00044003682,0.0004289651,0.00083657424,0.0004973696,0.00023362837,0.0011864026,0.0000031913512],"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.00048950623,0.00018614162,0.00004856405,0.000052600528,0.00018374537,0.0000072095463,0.0034509148,0.00001794084,0.0004986975,0.993586,0.001321862,0.00015680326],"study_design_scores_gemma":[0.00093136565,0.0003998797,0.000015996126,0.00020314251,0.00015190901,0.00029800506,0.0025267622,0.00000613111,0.008357116,0.8670737,0.11988503,0.00015092513],"about_ca_topic_score_codex":0.000002019287,"about_ca_topic_score_gemma":0.0000042855822,"teacher_disagreement_score":0.17940438,"about_ca_system_score_codex":0.0002049617,"about_ca_system_score_gemma":0.0005715251,"threshold_uncertainty_score":0.8608081},"labels":[],"label_agreement":null},{"id":"W2071136805","doi":"10.1016/j.jcta.2008.06.006","title":"Computing a pyramid partition generating function with dimer shuffling","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Shuffling; Conjecture; Partition function (quantum field theory); Pyramid (geometry); Conifold; Domino; Mathematics; Partition (number theory); Combinatorics; Generating function; Singularity; Discrete mathematics; Pure mathematics; Geometry; Mathematical physics; Physics","score_opus":0.028966344436302603,"score_gpt":0.2702389285313033,"score_spread":0.24127258409500071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071136805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8647186,0.00012549078,0.12849924,0.00008777727,0.0054488084,0.00023652361,0.0000010648471,0.000104208266,0.0007782669],"genre_scores_gemma":[0.9656828,0.000018637436,0.032368284,0.00003793078,0.0017031484,0.000004317345,0.0000011122834,0.000067169334,0.00011656829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997548,0.00028594764,0.0009720323,0.0001773584,0.000682839,0.00033380988],"domain_scores_gemma":[0.99665344,0.0008860111,0.0013358478,0.00029315305,0.00069357944,0.00013795967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013696968,0.00028597107,0.00063460175,0.0001358005,0.0004563905,0.00006126022,0.00024727336,0.00012702309,0.00004447738],"category_scores_gemma":[0.0011978819,0.00022554489,0.00016658561,0.0003163079,0.00019263217,0.00076750555,0.000071389906,0.0005066814,0.0000036737467],"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.0013033119,0.00026254758,0.00012640246,0.00007448889,0.00017169691,0.000083265295,0.001631811,0.00049947156,0.0025189829,0.9927932,0.00023102136,0.00030379105],"study_design_scores_gemma":[0.0022434003,0.00153229,0.000019673942,0.00022864918,0.00015419532,0.00087900704,0.00079845847,0.00026826776,0.0051173684,0.9873789,0.0010944153,0.00028539548],"about_ca_topic_score_codex":8.972909e-7,"about_ca_topic_score_gemma":6.139134e-7,"teacher_disagreement_score":0.10096422,"about_ca_system_score_codex":0.00013525487,"about_ca_system_score_gemma":0.00016183898,"threshold_uncertainty_score":0.9197454},"labels":[],"label_agreement":null},{"id":"W2071880022","doi":"10.1016/j.jcta.2012.04.001","title":"Co-quasi-invariant spaces for generalized symmetric groups","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Geometry","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":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Invariant (physics); Quotient; Pure mathematics; Symmetric group; Diagonal; Permutation (music); Symmetric function; Combinatorics; Mathematical physics","score_opus":0.026905456412873223,"score_gpt":0.3115081288469948,"score_spread":0.2846026724341216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071880022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9000225,0.0038408958,0.06923273,0.0006255861,0.021302413,0.00072085694,0.00003668318,0.00009328458,0.004125032],"genre_scores_gemma":[0.9814398,0.00012832224,0.01337201,0.000112591384,0.0043372163,0.000013818854,0.0000027956728,0.000058826983,0.0005345645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981077,0.00023198777,0.00069058524,0.00010897542,0.00040714137,0.000453666],"domain_scores_gemma":[0.9965569,0.0017999301,0.0008459027,0.00024326921,0.00031566684,0.00023834093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026129498,0.00023121996,0.0006481543,0.00031258797,0.00017203328,0.000067631496,0.00031096814,0.00014258942,0.00014391949],"category_scores_gemma":[0.0028904951,0.00017698834,0.00032923179,0.00042040518,0.00009349001,0.00086797436,0.000036160225,0.0002535138,0.000006814522],"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.0014181515,0.0004431037,0.00012171669,0.00009284346,0.00018035411,0.0000072054636,0.00061278394,0.0000011112501,0.0007408876,0.99355644,0.0022827683,0.0005426196],"study_design_scores_gemma":[0.002686691,0.0008631334,0.000033430493,0.000041130155,0.00017657985,0.0001499484,0.0007288429,0.0000020630896,0.008261071,0.95555955,0.03128278,0.00021480469],"about_ca_topic_score_codex":3.3297022e-7,"about_ca_topic_score_gemma":1.164564e-7,"teacher_disagreement_score":0.08141734,"about_ca_system_score_codex":0.0000812197,"about_ca_system_score_gemma":0.00006703526,"threshold_uncertainty_score":0.7217375},"labels":[],"label_agreement":null},{"id":"W2074881723","doi":"10.1016/j.jcta.2010.11.005","title":"Relatively prime polynomials and nonsingular Hankel matrices over finite fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"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; Invertible matrix; Hankel matrix; Coprime integers; Monic polynomial; Finite field; Rank (graph theory); Prime (order theory); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Polynomial; Mathematical analysis","score_opus":0.005469718997047604,"score_gpt":0.22236128612609604,"score_spread":0.21689156712904845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074881723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94071996,0.00065842125,0.04373117,0.00083345716,0.01135696,0.00012962219,0.0000026938249,0.00006360325,0.0025041301],"genre_scores_gemma":[0.9929914,0.000060020295,0.0060870834,0.00012223583,0.0006138793,0.0000010184924,1.4440626e-7,0.000009911286,0.00011434161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986844,0.00026014727,0.00041534755,0.00016665697,0.00026950423,0.00020396318],"domain_scores_gemma":[0.9980402,0.000856622,0.00047593648,0.00031352157,0.00017538319,0.00013833244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019213838,0.00016341364,0.00031217522,0.00022124327,0.0002151857,0.0002784321,0.0006413166,0.00015158759,0.00006441347],"category_scores_gemma":[0.00050540053,0.0001347153,0.0001583831,0.00030636135,0.00019351378,0.0011902268,0.00020668765,0.0005549216,0.000002704029],"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.00039748143,0.000059208545,0.00028617578,0.000007000476,0.0000617462,0.00003246331,0.0010620778,0.000002034426,0.0044475608,0.9888992,0.00017868525,0.0045663896],"study_design_scores_gemma":[0.0009187764,0.000625517,0.0010325318,0.000040753966,0.000031376654,0.00016207303,0.00005663056,0.000038312803,0.0063004307,0.97380126,0.016808296,0.00018402131],"about_ca_topic_score_codex":0.0000021975402,"about_ca_topic_score_gemma":9.62195e-7,"teacher_disagreement_score":0.052271426,"about_ca_system_score_codex":0.000009545762,"about_ca_system_score_gemma":0.00009770752,"threshold_uncertainty_score":0.549353},"labels":[],"label_agreement":null},{"id":"W2081918372","doi":"10.1016/j.jcta.2008.01.005","title":"Bounds on some van der Waerden numbers","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"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","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics","score_opus":0.022948755705174434,"score_gpt":0.27580125580153364,"score_spread":0.2528525000963592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081918372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97097534,0.00023600069,0.00005746731,0.00021854417,0.010424799,0.00012415009,0.0000044075955,0.000042729414,0.017916586],"genre_scores_gemma":[0.99553776,0.00012858845,0.00071216567,0.00024158064,0.00163281,0.0000021556245,5.337516e-7,0.000047683436,0.0016967093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792564,0.0003564802,0.00065770943,0.00014343552,0.0006091524,0.0003075747],"domain_scores_gemma":[0.9978437,0.0008032986,0.0005677615,0.0003773213,0.00023988754,0.00016802938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011607587,0.00025342737,0.0005448133,0.00016155338,0.00051270705,0.000044343735,0.00049778534,0.00017181871,0.00039382515],"category_scores_gemma":[0.0007269182,0.00018528958,0.00034893173,0.00014712551,0.00037798678,0.00048826094,0.00009596659,0.000536706,0.000009699871],"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.0016940057,0.0001485156,0.000105284096,0.000021487167,0.00023192681,0.00016826813,0.0024310814,0.000004167267,0.00009917659,0.9882178,0.006660174,0.00021811936],"study_design_scores_gemma":[0.0015146522,0.00083157344,0.00010471264,0.00005627595,0.00007484019,0.000723182,0.0003819864,4.3714996e-7,0.0019411395,0.97475183,0.01940602,0.00021335755],"about_ca_topic_score_codex":8.2837784e-7,"about_ca_topic_score_gemma":2.3672291e-7,"teacher_disagreement_score":0.02456246,"about_ca_system_score_codex":0.00008398317,"about_ca_system_score_gemma":0.00011026334,"threshold_uncertainty_score":0.75558895},"labels":[],"label_agreement":null},{"id":"W2084593271","doi":"10.1016/j.jcta.2003.12.004","title":"Polynomial versus exponential growth in repetition-free binary words","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":73,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exponential growth; Binary number; Mathematics; Exponential function; Polynomial; Repetition (rhetorical device); Combinatorics; Discrete mathematics; Exponential polynomial; Arithmetic; Mathematical analysis","score_opus":0.007989040553793911,"score_gpt":0.22204206467397514,"score_spread":0.21405302412018123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084593271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9482509,0.0005239435,0.010721421,0.0029951187,0.034551486,0.00017299644,0.0000054278826,0.00011502948,0.0026637027],"genre_scores_gemma":[0.9950374,0.00007679139,0.0034386273,0.00008669975,0.0012967676,0.000003858262,0.000001018907,0.000017607295,0.0000412483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796164,0.00028105822,0.000678625,0.00022816515,0.00051162473,0.0003388616],"domain_scores_gemma":[0.9984447,0.00028904778,0.00044317255,0.0005137648,0.00016341323,0.0001459294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001618246,0.00020840605,0.0003889628,0.0003276009,0.00012513473,0.00018358437,0.0016745651,0.00012531372,0.00005073114],"category_scores_gemma":[0.00052915816,0.00018828621,0.00021107367,0.0005122453,0.0001504883,0.0018392802,0.00039980546,0.0004018925,0.000009745196],"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.003150994,0.00027585283,0.00003373059,0.000010035473,0.00004501676,0.00039912105,0.0010111128,0.00005738287,0.0012397143,0.9922506,0.0008150358,0.0007113837],"study_design_scores_gemma":[0.010952404,0.0017186885,0.000495674,0.00013663643,0.000018074472,0.00023859338,0.0004136752,0.000017595456,0.007108821,0.97651803,0.0021048172,0.00027696782],"about_ca_topic_score_codex":0.000018979195,"about_ca_topic_score_gemma":0.0000037634668,"teacher_disagreement_score":0.046786506,"about_ca_system_score_codex":0.00020994946,"about_ca_system_score_gemma":0.0003078594,"threshold_uncertainty_score":0.76780885},"labels":[],"label_agreement":null},{"id":"W2085908617","doi":"10.1016/s0097-3165(03)00118-3","title":"Boolean and ternary complementary pairs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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 Manitoba","funders":"","keywords":"Mathematics; Ternary operation; Combinatorics; Converse; Autocorrelation; Discrete mathematics; Product (mathematics); Zero (linguistics); Complementary sequences; Computer science; Statistics","score_opus":0.005821087705566269,"score_gpt":0.1904102313786939,"score_spread":0.18458914367312762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085908617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9699158,0.0024772375,0.0007231854,0.000051590643,0.010953434,0.00013141909,0.0000071202253,0.000071828676,0.01566839],"genre_scores_gemma":[0.99930596,0.00010901959,0.00017703336,0.000027533011,0.00027430395,0.000001537776,6.1913255e-7,0.000022769778,0.00008123458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989784,0.00023801491,0.0003890058,0.00006362574,0.00016072142,0.0001702351],"domain_scores_gemma":[0.99949825,0.000111382826,0.00010839147,0.00012173994,0.000049348233,0.000110878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290894,0.0001411884,0.00027055762,0.000087426735,0.00007820003,0.00004052427,0.00013458887,0.000051242536,0.00016101534],"category_scores_gemma":[0.00004145817,0.00012309203,0.00009027171,0.000086693515,0.000080018406,0.0003135358,0.000015272493,0.00020104104,0.0000028898678],"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.00023506254,0.000035236968,0.0008978901,0.000055157863,0.0001794492,0.0000630746,0.00062041305,0.000088688,0.0018153888,0.9937695,0.001589118,0.0006510076],"study_design_scores_gemma":[0.001508915,0.00048000805,0.00024786455,0.000081085236,0.000048080557,0.00084311503,0.0025186576,0.000013927762,0.0041902517,0.8709369,0.118916914,0.00021430945],"about_ca_topic_score_codex":6.850095e-7,"about_ca_topic_score_gemma":3.8042197e-7,"teacher_disagreement_score":0.12283264,"about_ca_system_score_codex":0.000026643274,"about_ca_system_score_gemma":0.000014659654,"threshold_uncertainty_score":0.50195473},"labels":[],"label_agreement":null},{"id":"W2085975956","doi":"10.1016/j.jcta.2015.02.006","title":"Differential calculus on graphon space","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; UPS Foundation; National Science Foundation","keywords":"Homomorphism; Mathematics; Combinatorics; Multigraph; Discrete mathematics; Graph","score_opus":0.0310953572690605,"score_gpt":0.28821467349880814,"score_spread":0.25711931622974765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085975956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697005,0.00010312786,0.00089553226,0.00024301953,0.020077651,0.0001333527,0.000005321104,0.00003970503,0.0088017685],"genre_scores_gemma":[0.99728304,0.000017754212,0.0004726127,0.00005472414,0.0016008123,0.0000016561065,4.4292096e-7,0.00003439985,0.0005345531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979692,0.00044985375,0.00053725106,0.00013021017,0.00065523235,0.00025825252],"domain_scores_gemma":[0.99803174,0.000470082,0.0005384452,0.00033620824,0.00036270032,0.00026083618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011875435,0.00023363956,0.0005098461,0.00018638687,0.00016479882,0.000060824288,0.00042708206,0.00015213566,0.00015203899],"category_scores_gemma":[0.0011309906,0.00016076582,0.00030062709,0.00017663794,0.00020187839,0.00022903491,0.00010962446,0.00045688025,0.0000035808164],"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.0039510126,0.00014560382,0.0000499919,0.000016678187,0.00014174063,0.00005778648,0.0019382492,0.0000035172295,0.00015846796,0.98810923,0.005114026,0.00031367343],"study_design_scores_gemma":[0.0023830417,0.0015359072,0.00004774632,0.000058984115,0.0000883208,0.0001475415,0.00082049245,0.0000019240279,0.005354549,0.9818045,0.007573436,0.00018358762],"about_ca_topic_score_codex":0.0000010166963,"about_ca_topic_score_gemma":3.2796387e-7,"teacher_disagreement_score":0.027582524,"about_ca_system_score_codex":0.000072257615,"about_ca_system_score_gemma":0.00008951263,"threshold_uncertainty_score":0.655584},"labels":[],"label_agreement":null},{"id":"W2087428017","doi":"10.1006/jcta.1999.3006","title":"The Distribution of the Maximum Vertex Degree in Random Planar Maps","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":59,"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":"Mathematics; Independent and identically distributed random variables; Vertex (graph theory); Combinatorics; Degree (music); Random variable; Limiting; Triangulation; Distribution (mathematics); Discrete mathematics; Asymptotic distribution; Planar; Statistics; Geometry; Mathematical analysis; Computer science; Physics","score_opus":0.01727243179445884,"score_gpt":0.2589933192367653,"score_spread":0.24172088744230644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087428017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96969205,0.0008116093,0.0013429757,0.0014043448,0.015827762,0.0011127436,0.000049873463,0.000045397446,0.009713217],"genre_scores_gemma":[0.9986253,0.00020931604,0.00034440937,0.000016392161,0.00032377176,0.000009480994,0.0000013879736,0.000034887813,0.00043507697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707085,0.0006575286,0.0011925405,0.00011039045,0.0006637944,0.0003048683],"domain_scores_gemma":[0.9954253,0.0027686115,0.0009192653,0.000547633,0.00026877242,0.00007043732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026469016,0.00022205341,0.000603286,0.00004348359,0.00022871299,0.000048390164,0.000900736,0.00013560531,0.00006303714],"category_scores_gemma":[0.0029923036,0.0001243045,0.0002923288,0.0003774599,0.00031254778,0.00030132185,0.00006710804,0.0005214075,0.0000038182766],"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.0036031662,0.00022142318,0.000050878065,0.000044634384,0.00007493091,0.0000120914565,0.0004979186,0.000014694852,0.00009750476,0.99124193,0.0010924939,0.0030483177],"study_design_scores_gemma":[0.0043463274,0.00028779596,0.00012721015,0.00021938398,0.00007076277,0.00008869246,0.00047886837,0.0000057558013,0.0017878177,0.97813773,0.0143205635,0.00012907022],"about_ca_topic_score_codex":0.000003367075,"about_ca_topic_score_gemma":0.0000065317213,"teacher_disagreement_score":0.028933201,"about_ca_system_score_codex":0.00013043676,"about_ca_system_score_gemma":0.00017449957,"threshold_uncertainty_score":0.506899},"labels":[],"label_agreement":null},{"id":"W2088132468","doi":"10.1016/j.jcta.2008.08.003","title":"The number of lattice paths below a cyclically shifting boundary","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lattice (music); Mathematics; Statistical physics; Geometry; Physics","score_opus":0.02176566622767288,"score_gpt":0.3000446872456298,"score_spread":0.27827902101795693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088132468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97438896,0.00047515667,0.0037367572,0.00047873938,0.010556068,0.00039391662,0.0000066619227,0.00007742632,0.009886337],"genre_scores_gemma":[0.97151864,0.00029266192,0.02603557,0.000043590517,0.0013290771,0.000010131058,4.498164e-7,0.0000982635,0.0006716285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625385,0.00053306366,0.0016473386,0.00015666652,0.0009928768,0.00041622497],"domain_scores_gemma":[0.9906035,0.005644234,0.0020449474,0.0005930995,0.00094955676,0.0001646315],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002951969,0.00030327888,0.0008434877,0.00006780601,0.0006113379,0.000065086206,0.0008781254,0.00017464363,0.00006698478],"category_scores_gemma":[0.008502403,0.00021018447,0.00038296697,0.00035912852,0.0006582312,0.0005654052,0.00021168236,0.0006808157,0.00000946277],"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.001056809,0.00033496754,0.0002655916,0.00008723409,0.00019436255,0.0000859552,0.0019330976,0.000001915255,0.00026181206,0.9944882,0.0006401823,0.00064987806],"study_design_scores_gemma":[0.0016248222,0.0003995288,0.00005005445,0.00017667607,0.000109372166,0.0009149804,0.00068240275,0.000006474443,0.0018389681,0.9828059,0.011177714,0.00021311651],"about_ca_topic_score_codex":0.0000016425247,"about_ca_topic_score_gemma":7.7551715e-7,"teacher_disagreement_score":0.022298813,"about_ca_system_score_codex":0.00011445184,"about_ca_system_score_gemma":0.0003544058,"threshold_uncertainty_score":0.9998494},"labels":[],"label_agreement":null},{"id":"W2088620080","doi":"10.1016/j.jcta.2011.03.004","title":"Enumerating isodiametric and isoperimetric polygons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Combinatorics; Mathematics; Isoperimetric inequality; Perimeter; Regular polygon; Integer (computer science); Upper and lower bounds; Geometry; Mathematical analysis","score_opus":0.039581387715692355,"score_gpt":0.27047583634923983,"score_spread":0.23089444863354747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088620080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97568196,0.0024897424,0.0008187007,0.00003321619,0.0058760005,0.00013843359,0.0000036506085,0.000032615422,0.01492568],"genre_scores_gemma":[0.99105453,0.00015732105,0.008029675,0.00004616304,0.00050795934,0.0000013520415,1.09563956e-7,0.00002838629,0.00017451405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984566,0.00032485326,0.00059555547,0.00011958757,0.00027971185,0.00022371905],"domain_scores_gemma":[0.99804735,0.0008181191,0.0005458339,0.00022652982,0.00022258858,0.00013955319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017312235,0.00018584017,0.00044572575,0.0004699621,0.00027468818,0.0000489661,0.00030183903,0.00011756238,0.00027211578],"category_scores_gemma":[0.0019872747,0.0001364245,0.0001582201,0.0005468525,0.00020649747,0.00040087505,0.00013716509,0.00035434472,0.0000010100517],"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.0005187514,0.00008614427,0.0004981811,0.00002609332,0.00012427564,0.000026642521,0.0034286636,6.531524e-8,0.00018313111,0.99150807,0.0002201673,0.0033797887],"study_design_scores_gemma":[0.0008128525,0.0007685926,0.0004707348,0.00003280935,0.000094566174,0.00032272685,0.0009625949,9.5052354e-7,0.0038580592,0.9914237,0.0010923834,0.00016003218],"about_ca_topic_score_codex":0.000002745065,"about_ca_topic_score_gemma":2.0950726e-7,"teacher_disagreement_score":0.0153725585,"about_ca_system_score_codex":0.000025442652,"about_ca_system_score_gemma":0.00004832227,"threshold_uncertainty_score":0.55632293},"labels":[],"label_agreement":null},{"id":"W2091157920","doi":"10.1016/j.jcta.2006.09.002","title":"An update on primitive ternary complementary pairs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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 Manitoba","funders":"","keywords":"Ternary operation; Mathematics; Combinatorics; Computer science; Programming language","score_opus":0.015030218796192785,"score_gpt":0.278152044446627,"score_spread":0.26312182565043424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091157920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851933,0.00009226138,0.00065040373,0.0003952995,0.009490642,0.00025518853,0.000017025473,0.00006385738,0.0038420223],"genre_scores_gemma":[0.99562544,0.000014760328,0.0012582578,0.00018558536,0.0027554664,0.000004368861,0.0000075895127,0.000050700968,0.00009784735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974962,0.00045420357,0.0008481663,0.00020511028,0.00066430547,0.00033202127],"domain_scores_gemma":[0.99794644,0.0004344781,0.0007844129,0.0003962093,0.00029096694,0.00014750377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010034797,0.00030526312,0.00057504873,0.00014380403,0.00020506317,0.000096861295,0.00057588407,0.00012525693,0.00037106327],"category_scores_gemma":[0.00011635811,0.00024348067,0.0002551426,0.00014152525,0.00014481679,0.0005724453,0.00007326886,0.00041726718,0.000004826663],"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.0023901048,0.00045633185,0.00014860526,0.000016886293,0.00012216088,0.00008604419,0.00023407684,0.000027373644,0.00027508446,0.99229366,0.0035243903,0.00042526156],"study_design_scores_gemma":[0.002445785,0.002227037,0.00035105093,0.000067471265,0.000094335795,0.00010385975,0.0005372738,0.000006446637,0.003284906,0.9844893,0.0061282413,0.00026429357],"about_ca_topic_score_codex":0.000013513293,"about_ca_topic_score_gemma":0.0000020514933,"teacher_disagreement_score":0.010432123,"about_ca_system_score_codex":0.00013613288,"about_ca_system_score_gemma":0.0001019372,"threshold_uncertainty_score":0.99288535},"labels":[],"label_agreement":null},{"id":"W2092375161","doi":"10.1006/jcta.2001.3218","title":"New Maximal Arcs in Desarguesian Planes","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"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":"Conic section; Combinatorics; Arc (geometry); Mathematics; Projective plane; Order (exchange); Enumeration; Construct (python library); Discrete mathematics; Geometry; Computer science","score_opus":0.011824715899154022,"score_gpt":0.20682386458745025,"score_spread":0.19499914868829624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092375161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6081155,0.00705732,0.27651966,0.00817665,0.04711641,0.00063916476,0.000005585362,0.000414599,0.051955126],"genre_scores_gemma":[0.9914199,0.00009385213,0.007412302,0.00011075332,0.0006848607,9.914216e-7,1.5131211e-7,0.000010732506,0.00026643884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852526,0.00029658416,0.00045187026,0.00014472868,0.00031545345,0.00026608037],"domain_scores_gemma":[0.99896604,0.00023681643,0.00026695078,0.0002908272,0.00007576458,0.00016362111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010702464,0.00015362674,0.00030126557,0.00029991326,0.00008330233,0.00016158824,0.001035763,0.00007943259,0.00021526456],"category_scores_gemma":[0.00012126947,0.00013316322,0.00016008812,0.00052799215,0.00006636297,0.0010122141,0.00011103541,0.00031855263,0.00001405029],"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.00033354165,0.00009813013,0.00031716865,0.000005692247,0.000024854102,0.00016257496,0.001281003,0.000010775456,0.00016025967,0.9791731,0.0011874918,0.017245382],"study_design_scores_gemma":[0.001217336,0.0007449141,0.00038497505,0.000055093544,0.000008635869,0.0003590325,0.000116296476,0.000044027518,0.00086392194,0.9714207,0.024621846,0.00016324136],"about_ca_topic_score_codex":0.0000027554197,"about_ca_topic_score_gemma":0.0000014831301,"teacher_disagreement_score":0.38330445,"about_ca_system_score_codex":0.000032783104,"about_ca_system_score_gemma":0.000052906507,"threshold_uncertainty_score":0.5430239},"labels":[],"label_agreement":null},{"id":"W2096474673","doi":"10.1016/j.jcta.2004.12.003","title":"A direct bijection for the Harer–Zagier formula","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":69,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Mathematics; Combinatorics; Enumeration; Pairing; Cardinality (data modeling); Disjoint sets; Partition (number theory); Tree (set theory); Discrete mathematics; Computer science","score_opus":0.02742315502893356,"score_gpt":0.312658380593504,"score_spread":0.2852352255645704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096474673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25389874,0.005382963,0.55226207,0.012644312,0.13261756,0.008396807,0.000103514634,0.00091219996,0.033781856],"genre_scores_gemma":[0.9636872,0.00014119053,0.027233008,0.00012317431,0.0064971633,0.000076208795,9.758073e-7,0.00012525721,0.0021158194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790114,0.00017976794,0.00092258386,0.00014367023,0.0005126769,0.00034016883],"domain_scores_gemma":[0.9935724,0.004134056,0.0010444301,0.00044320629,0.0007006759,0.0001052463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026227604,0.0002657452,0.0005834616,0.00011935542,0.0003405703,0.0001055048,0.00056787423,0.0001413335,0.000078719335],"category_scores_gemma":[0.004669313,0.00017251805,0.00041111346,0.0002479255,0.00012301853,0.0007924611,0.00008279013,0.00034227595,0.000005910886],"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.0013384218,0.00023836413,0.0000033199995,0.00006157042,0.00020694693,0.0000031052987,0.000892113,0.000048285565,0.00051246595,0.9888395,0.004483258,0.0033726532],"study_design_scores_gemma":[0.0019816523,0.00062273897,0.000002748576,0.0000756468,0.0001982207,0.000104609375,0.00048425313,0.00006767954,0.010010766,0.8428769,0.14339882,0.00017597809],"about_ca_topic_score_codex":6.745314e-7,"about_ca_topic_score_gemma":0.000002017238,"teacher_disagreement_score":0.70978844,"about_ca_system_score_codex":0.00020124551,"about_ca_system_score_gemma":0.00012511257,"threshold_uncertainty_score":0.70350814},"labels":[],"label_agreement":null},{"id":"W2099082421","doi":"10.1016/j.jcta.2013.05.002","title":"Rank of divisors on tropical curves","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rank (graph theory); Mathematics; Divisor (algebraic geometry); Conjecture; Graph; Combinatorics; Equivalence (formal languages); Metric (unit); Discrete mathematics","score_opus":0.0072740607135053465,"score_gpt":0.21692893685422238,"score_spread":0.20965487614071704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099082421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514301,0.00057730824,0.032142274,0.0044321623,0.008920292,0.00021011369,0.000001100333,0.000039248935,0.0022474118],"genre_scores_gemma":[0.9984764,0.000060685885,0.0008135312,0.00020184358,0.00034374546,0.0000019101583,1.5978941e-7,0.0000051142847,0.0000966404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987337,0.00021988321,0.00045806257,0.00009443926,0.00035311442,0.00014078338],"domain_scores_gemma":[0.9987455,0.0003372616,0.0004053317,0.00018695921,0.0002311862,0.000093741364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037893685,0.0001039584,0.0002948816,0.000096948264,0.00004932306,0.00005712336,0.0006169303,0.00004146041,0.000074097276],"category_scores_gemma":[0.00024752418,0.00007632645,0.00014714892,0.00018774945,0.00007819152,0.00074512477,0.00009582139,0.00016904957,0.000014915246],"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.0001736779,0.00014393638,0.000086214095,0.000024710465,0.000036839523,0.000005846634,0.00027298747,0.00002319596,0.00057070464,0.9826571,0.0031163422,0.0128884865],"study_design_scores_gemma":[0.0010679188,0.0015419982,0.00656651,0.00018380907,0.000010984268,0.000035531706,0.000032267893,0.00012020298,0.005616288,0.98277426,0.0019380584,0.00011216684],"about_ca_topic_score_codex":0.000004288454,"about_ca_topic_score_gemma":1.2314739e-7,"teacher_disagreement_score":0.04704628,"about_ca_system_score_codex":0.000024580107,"about_ca_system_score_gemma":0.000078470526,"threshold_uncertainty_score":0.3112502},"labels":[],"label_agreement":null},{"id":"W2099229992","doi":"10.1016/j.jcta.2004.06.009","title":"The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematics and Applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Regular polygon; Unit (ring theory); Quadratic equation; Geometry; Mathematics education","score_opus":0.02068061691314682,"score_gpt":0.28115773145001205,"score_spread":0.26047711453686523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099229992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743792,0.00033831462,0.007902043,0.005703128,0.0022514903,0.00080319564,0.000030261494,0.00008536692,0.008507017],"genre_scores_gemma":[0.98199224,0.0001814433,0.015422008,0.00016204303,0.00090483844,0.000029789715,0.0000014340136,0.00008585412,0.0012203464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788207,0.00015609335,0.0008292579,0.0001679802,0.000608384,0.0003561902],"domain_scores_gemma":[0.99645066,0.0013403329,0.0009557849,0.0005870571,0.00049462786,0.00017155411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064825,0.00029351102,0.00050928135,0.00009061736,0.00043882595,0.00021572065,0.00063397957,0.000121819015,0.00010000043],"category_scores_gemma":[0.00053992565,0.0001722341,0.00023118862,0.00027724,0.00032006818,0.0003353791,0.000088593595,0.0004459496,0.000011762725],"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.0008476032,0.0003570852,0.000017193413,0.00005554935,0.00023359181,0.000021100022,0.0019148333,0.000013257684,0.00047965365,0.9925712,0.0032253333,0.00026359918],"study_design_scores_gemma":[0.0019364738,0.0010408305,0.000014156383,0.00016221308,0.00017050038,0.00020511966,0.002059526,0.000007692293,0.0077520628,0.949003,0.037412193,0.0002362681],"about_ca_topic_score_codex":0.0000032770263,"about_ca_topic_score_gemma":0.0000047798612,"teacher_disagreement_score":0.043568235,"about_ca_system_score_codex":0.00008790165,"about_ca_system_score_gemma":0.0002508806,"threshold_uncertainty_score":0.70235026},"labels":[],"label_agreement":null},{"id":"W2099869189","doi":"10.1016/j.jcta.2018.06.013","title":"On the chromatic number of structured Cayley graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Cayley graph; Mathematics; Combinatorics; Chromatic scale; Algebraic number; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.03751198900411745,"score_gpt":0.3325691220864022,"score_spread":0.29505713308228476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099869189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811233,0.00009608852,0.00011928792,0.00030718982,0.009464255,0.0006499031,0.000053614054,0.00003088305,0.008155476],"genre_scores_gemma":[0.9971392,0.00005519288,0.0011219612,0.000044996996,0.0011300389,0.000016786626,0.0000032103692,0.00010600375,0.00038259636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939088,0.0022792337,0.0015727214,0.00027125466,0.0015457507,0.00042221308],"domain_scores_gemma":[0.9883807,0.0061591063,0.0026501503,0.0013746425,0.0012770559,0.00015839205],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0071400553,0.00050596276,0.0013507316,0.00028174912,0.00018151448,0.00013591466,0.0020005957,0.0005170479,0.0024175707],"category_scores_gemma":[0.008041815,0.00031468857,0.0007438869,0.00032807855,0.0009932164,0.00016500217,0.00079902686,0.002073839,0.00002478623],"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.003119453,0.0002510013,0.000042793577,0.00053755677,0.0007717019,0.00003444466,0.0019382199,0.0000047094936,0.00029946983,0.98684853,0.0060726246,0.00007947534],"study_design_scores_gemma":[0.0010436714,0.0008642209,0.000051464296,0.0009804968,0.000211708,0.00015647705,0.0005879912,0.000005020496,0.005371814,0.9900591,0.00039544117,0.00027261773],"about_ca_topic_score_codex":0.000004134138,"about_ca_topic_score_gemma":0.0000014555757,"teacher_disagreement_score":0.01601591,"about_ca_system_score_codex":0.0001591576,"about_ca_system_score_gemma":0.00047773207,"threshold_uncertainty_score":0.9999305},"labels":[],"label_agreement":null},{"id":"W2101535655","doi":"10.1016/j.jcta.2004.09.005","title":"Cohen–Macaulay properties of square-free monomial ideals","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":77,"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":"Monomial; Mathematics; Quotient; Square-free integer; Monomial ideal; Simplicial complex; Square (algebra); Class (philosophy); Combinatorics; h-vector; Pure mathematics; Graph; Computer science; Mathematical analysis; Geometry; Artificial intelligence; Polynomial ring; Polynomial","score_opus":0.03214177214561393,"score_gpt":0.2838619238585814,"score_spread":0.25172015171296747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101535655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99365616,0.00045760887,0.0015854702,0.0009814994,0.0011671452,0.00028389043,0.000010812725,0.000024387877,0.0018330258],"genre_scores_gemma":[0.9974654,0.000045496352,0.0019060869,0.000027943533,0.00042649923,0.000010280019,4.2915565e-7,0.0000269522,0.00009095133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983148,0.00018778768,0.00087502657,0.00009684798,0.00034923243,0.00017630476],"domain_scores_gemma":[0.9977206,0.00033194927,0.00086669496,0.00043717187,0.000550417,0.000093142815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010464337,0.00017043743,0.0005322437,0.00011753536,0.00012012839,0.000038687103,0.0005980097,0.00008646729,0.00007822222],"category_scores_gemma":[0.0012309267,0.00012911354,0.00022121762,0.00018320643,0.0002504417,0.00038229814,0.00013288086,0.00025987477,0.00000398971],"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.000994134,0.0002989146,0.00002628929,0.00006725247,0.00018362969,0.000004956472,0.0022143703,0.00001983692,0.010770307,0.9845819,0.00058619765,0.00025222742],"study_design_scores_gemma":[0.002363399,0.00067132636,0.00006098142,0.00015193013,0.00009298775,0.000053018968,0.0010347319,5.907315e-7,0.08103049,0.91242933,0.0019845248,0.0001267017],"about_ca_topic_score_codex":0.000007662005,"about_ca_topic_score_gemma":0.0000030237534,"teacher_disagreement_score":0.07215257,"about_ca_system_score_codex":0.00009218381,"about_ca_system_score_gemma":0.00024135676,"threshold_uncertainty_score":0.52650976},"labels":[],"label_agreement":null},{"id":"W2102207023","doi":"10.1016/j.jcta.2013.11.005","title":"Resolvability of infinite designs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Resolution (logic); Mathematics; Contrast (vision); Combinatorics; Discrete mathematics; Pure mathematics; Physics; Computer science; Optics","score_opus":0.009741561019551986,"score_gpt":0.19871775146611279,"score_spread":0.1889761904465608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102207023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864003,0.0004148715,0.00077316415,0.000025283842,0.0052528447,0.00015461596,0.0000030574556,0.000041027874,0.00693484],"genre_scores_gemma":[0.99942124,0.000033526838,0.00016872294,0.000007121721,0.00028363883,0.0000047556555,3.0714276e-7,0.000019082892,0.00006163087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986135,0.00027591345,0.0006694473,0.000058002388,0.0002159617,0.0001672036],"domain_scores_gemma":[0.9988545,0.00030648045,0.00023399622,0.00022626453,0.00028005723,0.00009867275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013262017,0.00013472632,0.0003888792,0.000114396316,0.000038821803,0.000031329677,0.00027230498,0.000097963806,0.00032404935],"category_scores_gemma":[0.000210409,0.00011083652,0.00017612914,0.000195501,0.00013120791,0.0004991269,0.000022134409,0.00023053266,0.000012039847],"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.00056674605,0.0001050394,0.0007755916,0.00019066577,0.00024191322,0.0000069984253,0.0014219204,0.0007314943,0.032891933,0.96003425,0.0015420235,0.0014914086],"study_design_scores_gemma":[0.0007549921,0.0005113156,0.00086590415,0.00008898175,0.00003064209,0.000041793573,0.0007556146,0.000024567878,0.029956523,0.9609508,0.0058719963,0.00014687842],"about_ca_topic_score_codex":0.0000030234958,"about_ca_topic_score_gemma":2.4523123e-7,"teacher_disagreement_score":0.013020919,"about_ca_system_score_codex":0.00002967205,"about_ca_system_score_gemma":0.000029902116,"threshold_uncertainty_score":0.4519782},"labels":[],"label_agreement":null},{"id":"W2102747227","doi":"10.1016/j.jcta.2004.04.001","title":"Asymptotics of combinatorial structures with large smallest component","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Carleton University; University of Waterloo","funders":"","keywords":"Component (thermodynamics); Mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.012771638754875275,"score_gpt":0.25502157571622674,"score_spread":0.24224993696135147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102747227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856673,0.00024220388,0.0015664981,0.000112410395,0.010266283,0.00027736876,0.000029313176,0.000033035692,0.0018056165],"genre_scores_gemma":[0.99375963,0.000046771293,0.0050356095,0.00003948317,0.0010259842,0.0000020337272,0.0000024131275,0.000057253124,0.0000308094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970241,0.00032922116,0.0011214244,0.00019303783,0.00091510464,0.00041707506],"domain_scores_gemma":[0.99650955,0.0006464464,0.0014185735,0.00049626624,0.00072978606,0.0001993808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015778654,0.00038460293,0.0010068882,0.00021927198,0.00030558437,0.000055254688,0.0007116759,0.00023716125,0.00013309176],"category_scores_gemma":[0.0005298394,0.00026419276,0.00033291415,0.0002709311,0.000479582,0.00027756343,0.00019190808,0.0006226224,6.026053e-7],"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.00468697,0.00041625646,0.00031058525,0.00011051541,0.00046830229,0.00008144336,0.0021660188,0.000078731915,0.00043205556,0.99104995,0.00013948891,0.00005968027],"study_design_scores_gemma":[0.008502204,0.002336527,0.00039827643,0.00019507922,0.00023709393,0.0003620944,0.0011262686,5.6130006e-7,0.009232344,0.975917,0.0013919915,0.00030059097],"about_ca_topic_score_codex":0.0000033580143,"about_ca_topic_score_gemma":0.0000023145847,"teacher_disagreement_score":0.015132982,"about_ca_system_score_codex":0.00011314118,"about_ca_system_score_gemma":0.00025536562,"threshold_uncertainty_score":0.99998105},"labels":[],"label_agreement":null},{"id":"W2108737894","doi":"10.1016/j.jcta.2009.10.007","title":"Partitions and indivisibility properties of countable dimensional vector spaces","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Topology and Set Theory","field":"Mathematics","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":"University of Calgary","funders":"","keywords":"Countable set; Counterexample; Partition (number theory); Vector space; Affine transformation; Mathematics; Space (punctuation); Pure mathematics; Discrete mathematics; Computer science; Combinatorics","score_opus":0.024860863344130825,"score_gpt":0.2822014688557475,"score_spread":0.25734060551161664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108737894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972042,0.00071438286,0.00015012715,0.00044266853,0.0008952569,0.000097849574,0.0000061003752,0.000012574469,0.00047684283],"genre_scores_gemma":[0.99866885,0.000040210292,0.000945923,0.000041382395,0.0001597855,0.0000011094888,3.5880967e-7,0.0000067612305,0.00013559402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998877,0.00024782808,0.00044562636,0.00008470866,0.00020491183,0.00013993392],"domain_scores_gemma":[0.9987451,0.00037414915,0.00041953087,0.00014519336,0.0002506246,0.000065446424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012033631,0.00011429518,0.00038969325,0.000060188904,0.00012675558,0.00001586676,0.000117196585,0.000084929874,0.00007800859],"category_scores_gemma":[0.0009340129,0.00008258499,0.000077809236,0.00007817166,0.00041413368,0.00039525738,0.000030616717,0.00021006657,6.5037085e-7],"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.0016352993,0.00026475405,0.00013854708,0.000035241097,0.000059660168,0.0000068273434,0.0008507044,0.0000067791148,0.005225317,0.9914573,0.00020298205,0.0001166093],"study_design_scores_gemma":[0.00074508524,0.0008183082,0.00038250932,0.000095039286,0.000055652054,0.000084611755,0.00057602196,0.0000011805265,0.020104237,0.9765663,0.00048691977,0.00008412668],"about_ca_topic_score_codex":6.0846713e-7,"about_ca_topic_score_gemma":7.043238e-7,"teacher_disagreement_score":0.014890971,"about_ca_system_score_codex":0.000023977484,"about_ca_system_score_gemma":0.00008241329,"threshold_uncertainty_score":0.33677182},"labels":[],"label_agreement":null},{"id":"W2108918469","doi":"10.1016/j.jcta.2003.12.005","title":"A class of prototiles with doubly generated level semigroups","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"University of Waterloo","keywords":"Class (philosophy); Mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.013825378483179678,"score_gpt":0.2232447927371347,"score_spread":0.20941941425395502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108918469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8790151,0.00034284525,0.11540579,0.0007660658,0.0031063952,0.0004464345,0.00000896656,0.000092851595,0.0008155599],"genre_scores_gemma":[0.98233324,0.000025430503,0.017091408,0.00009284453,0.0003493188,0.000009371458,8.080514e-7,0.000021050746,0.000076496544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807656,0.00021018283,0.0006623954,0.00019625085,0.0005742189,0.00028040577],"domain_scores_gemma":[0.99787366,0.00014063247,0.0008391932,0.00044617156,0.0005597594,0.00014057037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013061448,0.00022876852,0.00051140215,0.00018050367,0.000108266846,0.0001332601,0.0011263456,0.000105294836,0.000019406189],"category_scores_gemma":[0.000102959326,0.00015917057,0.00015347653,0.0005255757,0.00022049388,0.0012430827,0.0001464427,0.00029442308,0.0000028456534],"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.0010631215,0.00025664203,0.00005523262,0.00003167551,0.00012264453,0.00010220055,0.0011091442,0.00055880955,0.008626031,0.98637223,0.000104149454,0.0015981207],"study_design_scores_gemma":[0.0050584394,0.0030334927,0.0003809521,0.00031417958,0.00004007936,0.0008325269,0.00037810212,0.000046963534,0.13329326,0.85269177,0.0036200597,0.0003101639],"about_ca_topic_score_codex":0.000008576454,"about_ca_topic_score_gemma":0.0000018865456,"teacher_disagreement_score":0.13368043,"about_ca_system_score_codex":0.000081479775,"about_ca_system_score_gemma":0.00045062165,"threshold_uncertainty_score":0.6490787},"labels":[],"label_agreement":null},{"id":"W2117446874","doi":"10.1016/j.jcta.2005.04.006","title":"Erdős–Szekeres theorem with forbidden order types","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"University of British Columbia","funders":"","keywords":"Combinatorics; General position; Mathematics; Regular polygon; Position (finance); Order (exchange); Plane (geometry); Type (biology); Graph; Order type; Discrete mathematics; Geometry","score_opus":0.012300289041590208,"score_gpt":0.26267693494356215,"score_spread":0.25037664590197195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117446874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95960265,0.00085971947,0.0014207496,0.0007748514,0.004510173,0.00028638323,0.000008169654,0.000081981496,0.032455307],"genre_scores_gemma":[0.9869637,0.00006616029,0.009719448,0.00013443122,0.0019437502,0.0000028603536,5.283526e-7,0.00005300165,0.0011161029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822867,0.00028652154,0.0005666448,0.00013777071,0.00048576528,0.0002946276],"domain_scores_gemma":[0.9977036,0.00072927534,0.0005730856,0.0003502803,0.0005154699,0.00012825578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140331,0.0002526568,0.00050884625,0.00013729543,0.000256311,0.000075492775,0.00049323804,0.00013570122,0.0005799583],"category_scores_gemma":[0.00059263664,0.00015394716,0.00017276248,0.00022565445,0.00030690656,0.00052984117,0.00010036051,0.0004069122,0.0000044552507],"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.0028170135,0.000109544184,0.00010083324,0.000028198892,0.00029375032,0.0000291349,0.0017491938,0.000015756283,0.00008418003,0.99049526,0.0017799613,0.0024971485],"study_design_scores_gemma":[0.0015609652,0.00078898645,0.000048510992,0.00007994897,0.00013990821,0.00037529424,0.0007411408,0.0000026091204,0.0024428756,0.9597669,0.033838477,0.00021437324],"about_ca_topic_score_codex":6.79203e-7,"about_ca_topic_score_gemma":0.0000031822553,"teacher_disagreement_score":0.032058515,"about_ca_system_score_codex":0.000051666066,"about_ca_system_score_gemma":0.00011603392,"threshold_uncertainty_score":0.6350137},"labels":[],"label_agreement":null},{"id":"W2120707415","doi":"10.1016/j.jcta.2007.05.008","title":"On distinguishing trees by their chromatic symmetric functions","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":83,"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":"University of Minnesota","keywords":"Symmetric function; Combinatorics; Mathematics; Chromatic scale; Monomial; Elementary symmetric polynomial; Invariant (physics); Power sum symmetric polynomial; Function (biology); Complete homogeneous symmetric polynomial; Ring of symmetric functions; Isomorphism (crystallography); Stanley symmetric function; Symmetric polynomial; Chromatic polynomial; Corollary; Discrete mathematics; Polynomial; Orthogonal polynomials; Mathematical analysis; Matrix polynomial","score_opus":0.01814852272102464,"score_gpt":0.2825410242038569,"score_spread":0.2643925014828323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120707415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8652408,0.0005567778,0.07722558,0.00031985648,0.028510077,0.000684902,0.00003743504,0.00027939532,0.027145192],"genre_scores_gemma":[0.9949312,0.000018198425,0.0029437975,0.00003772975,0.0012839118,0.000004868516,0.000002302788,0.00008731355,0.0006906752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968755,0.00027246156,0.0013702653,0.00019883805,0.00079774327,0.00048518722],"domain_scores_gemma":[0.9895408,0.0076926076,0.0015296368,0.00049310504,0.0004985647,0.00024528487],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034277828,0.00038514615,0.0008321281,0.0003868183,0.000307477,0.00012010834,0.000605903,0.00018552372,0.00009577321],"category_scores_gemma":[0.013948378,0.00029756333,0.00032575353,0.00079353125,0.00015798486,0.00051957695,0.00009708039,0.0006826302,0.000010228605],"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.0007668062,0.0006505649,0.000016477019,0.000075070304,0.00016396861,0.000049519036,0.00073988654,0.000004576848,0.00081744755,0.9906028,0.0046722405,0.0014406221],"study_design_scores_gemma":[0.0017211016,0.00145348,0.000013623559,0.0002744295,0.000113875794,0.00019342302,0.0015356351,0.0000075056505,0.0053239553,0.98398054,0.005088895,0.00029356056],"about_ca_topic_score_codex":0.0000011664491,"about_ca_topic_score_gemma":0.000001413678,"teacher_disagreement_score":0.12969041,"about_ca_system_score_codex":0.00031259045,"about_ca_system_score_gemma":0.00008972705,"threshold_uncertainty_score":0.99994767},"labels":[],"label_agreement":null},{"id":"W2123992412","doi":"10.1016/j.jcta.2012.11.004","title":"The down operator and expansions of near rectangular k -Schur functions","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Fields Institute for Research in Mathematical Sciences; York University; Université du Québec à Montréal","funders":"","keywords":"Affine transformation; Mathematics; Subalgebra; Conjecture; Operator (biology); Affine coordinate system; Affine representation; Pure mathematics; Algebra over a field; Interpretation (philosophy); Affine group; Affine space; Affine Lie algebra; Computer science; Current algebra","score_opus":0.017409972200986713,"score_gpt":0.2825466754068814,"score_spread":0.26513670320589466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123992412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97573704,0.002972074,0.002246457,0.00038723243,0.015915498,0.00042878292,0.000011065162,0.000047258283,0.002254616],"genre_scores_gemma":[0.9910268,0.0002419741,0.0071681724,0.00001769889,0.0010408678,0.0000114116665,4.0029644e-7,0.00005180921,0.00044083456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977825,0.00039851575,0.0009110047,0.00009399482,0.00047945438,0.00033447836],"domain_scores_gemma":[0.99557674,0.0023678634,0.00085876323,0.000437118,0.0005502529,0.00020924838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002650009,0.00021629031,0.00054475584,0.00006710204,0.0004920892,0.00007846775,0.00034283183,0.00012589633,0.000047673537],"category_scores_gemma":[0.004442717,0.00014072345,0.00017774575,0.0002598048,0.00038883468,0.0006809916,0.00014325893,0.00039420568,0.0000035875796],"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.00048805616,0.00024728297,0.00008913602,0.00004718228,0.0001484426,0.0000031185145,0.0017959881,0.0000020791692,0.0020054872,0.99351186,0.001178728,0.0004826222],"study_design_scores_gemma":[0.0010840519,0.0005223299,0.00002841344,0.000113777205,0.00016297276,0.00015663667,0.0028938313,0.0000036019974,0.0046085897,0.96289533,0.027376885,0.00015356032],"about_ca_topic_score_codex":0.0000011689622,"about_ca_topic_score_gemma":5.9579395e-7,"teacher_disagreement_score":0.030616526,"about_ca_system_score_codex":0.00006211321,"about_ca_system_score_gemma":0.00013802238,"threshold_uncertainty_score":0.5738536},"labels":[],"label_agreement":null},{"id":"W2132589312","doi":"10.1016/j.jcta.2010.10.003","title":"Divisible design graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"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 Lethbridge","funders":"","keywords":"Adjacency matrix; Combinatorics; Mathematics; Indifference graph; Discrete mathematics; Chordal graph; Adjacency list; Strongly regular graph; Incidence matrix; Generalization; Cograph; Pathwidth; Line graph; Graph","score_opus":0.006352779784245656,"score_gpt":0.19350495685116315,"score_spread":0.1871521770669175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132589312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9320276,0.00052984955,0.0069732727,0.000046238605,0.047702324,0.00019244924,0.0000036768909,0.00015295025,0.01237164],"genre_scores_gemma":[0.9986471,0.00003959327,0.00048322257,0.000011271289,0.0006445622,0.0000035224002,2.9730037e-7,0.000031458138,0.00013900391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988689,0.00017747347,0.00043716226,0.00006842594,0.00023070084,0.00021738089],"domain_scores_gemma":[0.99911845,0.00024520696,0.00014597664,0.00021786428,0.00013620839,0.00013632144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018146324,0.00016432905,0.00031327314,0.00016316224,0.00008968486,0.00007229172,0.00035020473,0.00012871421,0.0002476787],"category_scores_gemma":[0.0001383331,0.00013686137,0.000181109,0.00022693032,0.000100131656,0.00046153722,0.000018815284,0.00053408847,0.000015436315],"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.0003338733,0.000038283917,0.000071932554,0.000024346129,0.000115687326,0.000030464242,0.00033940628,0.0003353069,0.035293818,0.9610706,0.0015058564,0.00084040436],"study_design_scores_gemma":[0.0007222516,0.0003085652,0.00008101892,0.000031336633,0.00003224231,0.00023855074,0.0001977994,0.000025605976,0.030615432,0.94432706,0.023249239,0.00017091786],"about_ca_topic_score_codex":3.831957e-7,"about_ca_topic_score_gemma":3.8049436e-7,"teacher_disagreement_score":0.06661947,"about_ca_system_score_codex":0.000012884429,"about_ca_system_score_gemma":0.000031653988,"threshold_uncertainty_score":0.5581045},"labels":[],"label_agreement":null},{"id":"W2139746216","doi":"10.1016/j.jcta.2005.02.005","title":"The Ramsey number for hypergraph cycles I","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":62,"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":"Hypergraph; Combinatorics; Mathematics; Monochromatic color; Ramsey's theorem; Discrete mathematics; Graph; Physics","score_opus":0.016230243126950247,"score_gpt":0.29848306450790657,"score_spread":0.2822528213809563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139746216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96351427,0.0012456105,0.0016535652,0.002548127,0.018330256,0.0005676415,0.000016854645,0.00007019696,0.0120534515],"genre_scores_gemma":[0.99042356,0.00021354263,0.0050700633,0.0001262358,0.0031364725,0.000010382055,3.7814382e-7,0.000041668623,0.0009776993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983738,0.00025376427,0.0006515559,0.000100863675,0.00033378636,0.00028619543],"domain_scores_gemma":[0.99608135,0.0025816003,0.0005608351,0.00031343522,0.00036632526,0.00009644907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551462,0.00018530864,0.0003629862,0.000050327144,0.00070656836,0.00010191613,0.0005643207,0.000119174976,0.000083151055],"category_scores_gemma":[0.001202929,0.00010621118,0.00041152723,0.00011263785,0.0002913286,0.00031660855,0.000079290425,0.0002880373,0.0000021267547],"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.0017315528,0.00006430627,0.00006413922,0.000016722026,0.0001879509,0.000002736144,0.00069731165,0.000002591167,0.00008013212,0.9841582,0.0069768173,0.0060175355],"study_design_scores_gemma":[0.001095348,0.0001974117,0.000032104097,0.000024035884,0.000074799726,0.00012873113,0.00051830045,0.0000020638333,0.0013318574,0.8122138,0.18426554,0.00011604052],"about_ca_topic_score_codex":2.513207e-7,"about_ca_topic_score_gemma":0.000001146919,"teacher_disagreement_score":0.17728873,"about_ca_system_score_codex":0.000038153095,"about_ca_system_score_gemma":0.000056886027,"threshold_uncertainty_score":0.54344237},"labels":[],"label_agreement":null},{"id":"W2140390981","doi":"10.1016/j.jcta.2005.01.010","title":"Colouring lines in projective space","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":18,"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; Linear subspace; Combinatorics; Chromatic scale; Subspace topology; Vector space; Dimension (graph theory); Discrete mathematics; Projective space; Graph; Projective test; Pure mathematics; Mathematical analysis","score_opus":0.036570643388460625,"score_gpt":0.3355192001754775,"score_spread":0.2989485567870169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140390981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98892957,0.00019799797,0.00016881281,0.0009887398,0.0015603804,0.00030136117,0.0000022925612,0.000028373111,0.007822478],"genre_scores_gemma":[0.9934058,0.000044818258,0.0038432425,0.000024119892,0.0015016539,0.0000082272645,2.1238156e-7,0.00003900898,0.0011328837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977182,0.0006611536,0.0006617304,0.00012779086,0.0004952156,0.00033590168],"domain_scores_gemma":[0.9971765,0.0016566038,0.00043492898,0.0002254852,0.00040433346,0.00010214057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004396181,0.00017527195,0.000479541,0.000348068,0.000077968325,0.000064263666,0.00041563765,0.00012376785,0.00015734952],"category_scores_gemma":[0.0037557473,0.00014515751,0.00014057789,0.0003936206,0.00015115285,0.0006370136,0.00011995222,0.0006502838,0.000011857477],"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.0033520893,0.00036971562,0.00032027613,0.00004866749,0.000065259956,0.000081911436,0.0029919369,0.000020070212,0.0011694449,0.9901349,0.00057307264,0.0008726631],"study_design_scores_gemma":[0.0020848438,0.000741847,0.00012276247,0.0001471066,0.00002039221,0.00015528755,0.0018069928,0.000014684206,0.009694564,0.97639346,0.008665156,0.00015287935],"about_ca_topic_score_codex":0.000002206361,"about_ca_topic_score_gemma":0.000010213941,"teacher_disagreement_score":0.013741408,"about_ca_system_score_codex":0.00024543522,"about_ca_system_score_gemma":0.00020438652,"threshold_uncertainty_score":0.5919351},"labels":[],"label_agreement":null},{"id":"W2140893304","doi":"10.1016/j.jcta.2007.08.003","title":"Partially directed paths in a wedge","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":37,"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; York University","funders":"","keywords":"Mathematics; Combinatorics; Iterated function; Lattice (music); Wedge (geometry); Square lattice; Generating function; Enumeration; Mathematical analysis; Geometry; Statistical physics; Physics","score_opus":0.020448295905492832,"score_gpt":0.30197842620575766,"score_spread":0.2815301303002648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140893304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95086753,0.00040558004,0.014963721,0.00022951294,0.021097543,0.0006765407,0.000004398598,0.000217155,0.011538022],"genre_scores_gemma":[0.9853459,0.000038831276,0.012971695,0.000032721862,0.0011796727,0.000005733091,5.212901e-7,0.00007280527,0.0003521045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672186,0.00033391148,0.0016000868,0.00016922817,0.00066463294,0.00051026687],"domain_scores_gemma":[0.995317,0.0024461087,0.001122227,0.0003873911,0.00051889056,0.00020838543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0053420477,0.00029617824,0.0008300592,0.00031861893,0.00008529447,0.000051122064,0.0005296092,0.00020844529,0.00009740314],"category_scores_gemma":[0.006021276,0.00025708778,0.00022916665,0.0006027302,0.00014160306,0.0005733805,0.000111217436,0.0006171394,0.000008689552],"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.0020641705,0.0005888288,0.00016863768,0.00006611068,0.00006636448,0.00031868796,0.0015200381,0.000003749077,0.0012690081,0.9925429,0.00043325452,0.00095824024],"study_design_scores_gemma":[0.0030037751,0.00057894574,0.00010942622,0.00020737511,0.00005379787,0.00016642862,0.00072756887,0.0000055812047,0.007816271,0.9815607,0.005509732,0.00026038408],"about_ca_topic_score_codex":0.0000016776245,"about_ca_topic_score_gemma":0.000011844396,"teacher_disagreement_score":0.03447839,"about_ca_system_score_codex":0.00024191162,"about_ca_system_score_gemma":0.00018128364,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W2154493507","doi":"10.1016/s0097-3165(03)00006-2","title":"Width and dual width of subsets in polynomial association schemes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":40,"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 Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Association scheme; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Dual (grammatical number); Graph; Discrete mathematics; Polynomial; Physics; Mathematical analysis","score_opus":0.022878052541247997,"score_gpt":0.2962240398218491,"score_spread":0.2733459872806011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154493507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954141,0.00028006666,0.000040083123,0.00012583619,0.0013978087,0.00015101158,0.000006183289,0.000008464608,0.0025764517],"genre_scores_gemma":[0.9979656,0.00006313374,0.0013759555,0.000011440232,0.00021965247,0.0000022946067,5.0655484e-7,0.00002576558,0.00033566548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714345,0.0010568062,0.00079427415,0.000113809285,0.0006032819,0.0002884057],"domain_scores_gemma":[0.99648684,0.0020654015,0.000822839,0.00017539175,0.00034929035,0.00010022621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067080627,0.00015769513,0.0005610873,0.0002577024,0.000059375812,0.00004602097,0.00017700474,0.00017410135,0.00013485973],"category_scores_gemma":[0.008266704,0.0001395939,0.00011158842,0.00029140493,0.00014438752,0.00043825677,0.000057012323,0.0004535263,0.0000018652144],"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.0019346989,0.0002857933,0.0067517026,0.00007508735,0.0001198469,0.000031696516,0.0010935314,9.94519e-7,0.0029465407,0.9857689,0.00060372875,0.0003874724],"study_design_scores_gemma":[0.003121031,0.0006298274,0.00064016157,0.000089604546,0.00003792568,0.00007306665,0.0005984831,0.0000017586066,0.014742803,0.97608113,0.0038533476,0.0001308698],"about_ca_topic_score_codex":0.000002633411,"about_ca_topic_score_gemma":0.000003430211,"teacher_disagreement_score":0.011796262,"about_ca_system_score_codex":0.00018465541,"about_ca_system_score_gemma":0.00020658254,"threshold_uncertainty_score":0.9896614},"labels":[],"label_agreement":null},{"id":"W2155233457","doi":"10.1016/j.jcta.2009.03.015","title":"Some Ramsey-type results for the n-cube","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","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":"University of British Columbia","funders":"","keywords":"Cube (algebra); Type (biology); Ramsey's theorem; Combinatorics; Mathematics; Geology","score_opus":0.02540676515078403,"score_gpt":0.2997708149569002,"score_spread":0.2743640498061162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155233457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81759465,0.011062592,0.0036097062,0.018705117,0.13069822,0.0028421208,0.0001023222,0.00027458873,0.015110698],"genre_scores_gemma":[0.9916219,0.00029516648,0.0018409129,0.00042920126,0.0048443684,0.0000025652516,9.4296996e-7,0.00002641737,0.000938537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828404,0.00022494806,0.0007413897,0.00011976644,0.0003606257,0.00026925103],"domain_scores_gemma":[0.9957089,0.0026512577,0.00067417725,0.00040834877,0.00046823974,0.000089071305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031484563,0.00019602274,0.00042393903,0.00008047844,0.00045282202,0.00008087116,0.0006386514,0.00013325954,0.000021257056],"category_scores_gemma":[0.0030087486,0.000110668065,0.0003236572,0.00015957047,0.00017276913,0.0003721361,0.000054085467,0.00035618595,9.021717e-7],"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.008491023,0.00008100062,0.0000014899849,0.000013769983,0.00013517881,0.000009294395,0.001065864,0.0000060785796,0.00021944326,0.9752443,0.012829768,0.0019027849],"study_design_scores_gemma":[0.0023387354,0.0017270441,0.0000439338,0.000040670784,0.00012929214,0.00009868859,0.00040855515,0.0000042508223,0.0016713538,0.9378117,0.055588655,0.00013716138],"about_ca_topic_score_codex":2.4310575e-7,"about_ca_topic_score_gemma":1.3192651e-7,"teacher_disagreement_score":0.17402725,"about_ca_system_score_codex":0.000037465452,"about_ca_system_score_gemma":0.00008023825,"threshold_uncertainty_score":0.45129126},"labels":[],"label_agreement":null},{"id":"W2158442467","doi":"10.1016/j.jcta.2007.11.001","title":"Shellable graphs and sequentially Cohen–Macaulay bipartite graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Bipartite graph; Chordal graph; Mathematics; Complete bipartite graph; Simplicial complex; Discrete mathematics; Graph","score_opus":0.02093647635948099,"score_gpt":0.3009365561280307,"score_spread":0.28000007976854974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158442467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98718804,0.0006814018,0.0030631602,0.00036673466,0.0016279431,0.00024082769,0.000006643235,0.00004616769,0.006779104],"genre_scores_gemma":[0.99640197,0.00019383519,0.0026645602,0.000079177975,0.0001876037,0.000003654336,0.0000011218916,0.00003124274,0.00043684687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983668,0.00017454516,0.0007124973,0.0001304187,0.00034133976,0.0002744539],"domain_scores_gemma":[0.9975618,0.0009983723,0.00056353846,0.00026170653,0.00042810504,0.00018644883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026162972,0.00018657268,0.0004001594,0.00022006051,0.0002293084,0.00008923858,0.00027583182,0.00009738859,0.0001803271],"category_scores_gemma":[0.0004246397,0.00015473984,0.00016381926,0.00037790812,0.000265598,0.0004024513,0.00008311711,0.00032001865,0.000004415323],"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.00056315766,0.00013971885,0.00033156466,0.000029243618,0.00015372969,0.000023660547,0.0008156915,5.839038e-7,0.004939865,0.9905883,0.0015868313,0.00082765287],"study_design_scores_gemma":[0.0010970451,0.0004319055,0.00037980883,0.00004618746,0.000118274394,0.00016130056,0.000588736,0.0000011752281,0.009591726,0.97012174,0.01729777,0.00016433027],"about_ca_topic_score_codex":0.000003180412,"about_ca_topic_score_gemma":0.000006831711,"teacher_disagreement_score":0.020466562,"about_ca_system_score_codex":0.000035929308,"about_ca_system_score_gemma":0.00007788604,"threshold_uncertainty_score":0.6310108},"labels":[],"label_agreement":null},{"id":"W2164133693","doi":"10.1016/j.jcta.2016.08.003","title":"Sign variation, the Grassmannian, and total positivity","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Grassmannian; Linear subspace; Sign (mathematics); Mathematics; Combinatorics; Subspace topology; Matroid; Sequence (biology); Dimension (graph theory); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.014449102648179375,"score_gpt":0.2663213028469291,"score_spread":0.25187220019874973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164133693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87752277,0.00035819053,0.09518419,0.0062236474,0.016382812,0.0007943733,0.00001765494,0.00012901306,0.0033873587],"genre_scores_gemma":[0.9955516,0.00004500016,0.0027841283,0.000033758348,0.0009876259,0.000006766002,9.290882e-8,0.000037878883,0.00055314245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792045,0.0005196736,0.0006871046,0.00013759971,0.00048669503,0.00024849022],"domain_scores_gemma":[0.9942697,0.0038821155,0.0008734049,0.00036103453,0.00049342203,0.00012026918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025205482,0.00022145639,0.0004662984,0.00007508288,0.00021997381,0.00007855923,0.0003408664,0.000112949456,0.000053652053],"category_scores_gemma":[0.0042226124,0.00011467064,0.00014214832,0.00016687877,0.00025451375,0.0007229569,0.00013399345,0.000241871,0.0000041755643],"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.0004994996,0.00013160439,0.000032677326,0.00002426516,0.00011192777,0.000016886477,0.0008159736,4.809504e-7,0.0030728045,0.9933974,0.0005497844,0.0013466971],"study_design_scores_gemma":[0.0016848949,0.0005858878,0.0002542676,0.00012051888,0.00010672539,0.00037982213,0.00021436086,0.000001552609,0.0026601444,0.9922416,0.00158295,0.0001672781],"about_ca_topic_score_codex":7.777555e-7,"about_ca_topic_score_gemma":4.1529407e-7,"teacher_disagreement_score":0.11802884,"about_ca_system_score_codex":0.00009565907,"about_ca_system_score_gemma":0.000098013974,"threshold_uncertainty_score":0.50551665},"labels":[],"label_agreement":null},{"id":"W2165133602","doi":"10.1016/j.jcta.2013.06.009","title":"Distinct distances on two lines","year":2013,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","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 British Columbia","funders":"","keywords":"Omega; Combinatorics; Line (geometry); Mathematics; Plane (geometry); Physics; Geometry","score_opus":0.013910387833546624,"score_gpt":0.2673390019252354,"score_spread":0.25342861409168876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165133602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41700032,0.0027123555,0.4436976,0.004086042,0.123294264,0.0006890495,0.000028093515,0.00017821066,0.008314064],"genre_scores_gemma":[0.98671436,0.00009954075,0.0077053662,0.00012436122,0.00459104,0.0000121950725,0.00000939798,0.000016879567,0.00072684104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977149,0.0003884533,0.0007330559,0.000284305,0.00068007776,0.0001992314],"domain_scores_gemma":[0.99704653,0.00050142006,0.0010956004,0.0004473169,0.00076919247,0.00013992624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779681,0.00028674954,0.00049928215,0.00023658879,0.00015231776,0.00055329123,0.0012937923,0.00013395591,0.000052946143],"category_scores_gemma":[0.00040984125,0.00022757247,0.00027483888,0.00024394874,0.00008270505,0.00067855767,0.0005225993,0.0006567385,0.000017292363],"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.0002471584,0.00014122916,0.000016635286,0.000034880886,0.000085747844,0.000025963553,0.00025817353,0.0032072957,0.00006905307,0.98184806,0.001920602,0.012145186],"study_design_scores_gemma":[0.0006458163,0.00054753333,0.00022312917,0.00017669213,0.000024869158,0.00004710503,0.000023476932,0.00082287414,0.0011038616,0.9714236,0.024714006,0.0002470365],"about_ca_topic_score_codex":0.0000031947247,"about_ca_topic_score_gemma":9.4733315e-7,"teacher_disagreement_score":0.56971407,"about_ca_system_score_codex":0.00009355049,"about_ca_system_score_gemma":0.00034700808,"threshold_uncertainty_score":0.9280136},"labels":[],"label_agreement":null},{"id":"W2165510821","doi":"10.1016/j.jcta.2015.12.002","title":"Inequivalent factorizations of permutations","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Saint Mary's University","funders":"","keywords":"Permutation (music); Mathematics; Enumeration; Disjoint sets; Combinatorics; Transitive relation; Equivalence relation; Monotone polygon; Equivalence (formal languages); Discrete mathematics; Relation (database); Series (stratigraphy); Computer science","score_opus":0.016639644029016812,"score_gpt":0.22281031841786625,"score_spread":0.20617067438884945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165510821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9622307,0.00087718724,0.009634619,0.000052970052,0.016577221,0.00013308728,0.000020626498,0.0000669542,0.010406675],"genre_scores_gemma":[0.9994612,0.000026039734,0.00011685896,0.0000031070763,0.0002804349,0.0000019906217,0.0000016582289,0.000016712398,0.000092031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900764,0.00012986448,0.00048136374,0.00003929625,0.00023549575,0.00010635238],"domain_scores_gemma":[0.99911064,0.00010088406,0.00018446385,0.00012573529,0.00036037824,0.00011792163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006786236,0.000098140765,0.00025831553,0.00013200514,0.00003355985,0.000019266867,0.0001758049,0.000058693127,0.000045699293],"category_scores_gemma":[0.00021505031,0.00008496764,0.00010951244,0.0002225362,0.00006424118,0.00034660823,0.000014432832,0.00013323277,0.0000033913984],"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.000159693,0.000053167398,0.00023489248,0.000036687914,0.00011950936,0.00000622614,0.0024486901,0.0053145094,0.0026402967,0.9881929,0.0006906419,0.000102745566],"study_design_scores_gemma":[0.0013320661,0.0005618688,0.00018878974,0.00008221839,0.000071163726,0.00010013562,0.0039807027,0.00007521226,0.009472359,0.9661378,0.017835498,0.00016214266],"about_ca_topic_score_codex":6.641968e-7,"about_ca_topic_score_gemma":2.5256136e-7,"teacher_disagreement_score":0.037230507,"about_ca_system_score_codex":0.00004260393,"about_ca_system_score_gemma":0.00006680685,"threshold_uncertainty_score":0.346488},"labels":[],"label_agreement":null},{"id":"W2179035910","doi":"10.1016/j.jcta.2013.07.008","title":"Transition matrices for symmetric and quasisymmetric Hall–Littlewood polynomials","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Ring of symmetric functions; Pure mathematics; Combinatorics; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.02037149803948858,"score_gpt":0.2835089170388023,"score_spread":0.26313741899931375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179035910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8862696,0.004306178,0.08439754,0.0018867489,0.016326604,0.0032805442,0.000039908395,0.00018522199,0.0033076215],"genre_scores_gemma":[0.96030843,0.00030076012,0.037587516,0.000056138484,0.001379899,0.000064103006,0.0000013854599,0.00008142632,0.0002203613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737036,0.00028354887,0.0012369822,0.00020666035,0.00051717384,0.00038529368],"domain_scores_gemma":[0.9929479,0.0044106604,0.001250756,0.00029993488,0.00086724205,0.00022350995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020679126,0.00032663794,0.00093076256,0.00066159014,0.00019040752,0.00018730025,0.00038585532,0.00021770415,0.000087705055],"category_scores_gemma":[0.0047466657,0.0002719867,0.00029273436,0.00077360653,0.00012706514,0.0011877546,0.000060315677,0.0002932403,0.000007886693],"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.0005206464,0.0003234549,0.000007876876,0.00031022652,0.00016969856,0.000004732969,0.0006627753,0.0000018346807,0.000669898,0.9924196,0.0013650978,0.0035441522],"study_design_scores_gemma":[0.0031109152,0.0015287289,0.000019252646,0.00012461239,0.00025537907,0.00015191532,0.0010581824,0.000030239753,0.0033080326,0.98860294,0.0015236686,0.000286107],"about_ca_topic_score_codex":0.0000042931415,"about_ca_topic_score_gemma":3.120051e-7,"teacher_disagreement_score":0.07403878,"about_ca_system_score_codex":0.00012425972,"about_ca_system_score_gemma":0.000083035746,"threshold_uncertainty_score":0.99997324},"labels":[],"label_agreement":null},{"id":"W2183648216","doi":"10.1016/j.jcta.2017.08.012","title":"A marvellous embedding of the Lagrangian Grassmannian","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection, injection and surjection; Bijection; Embedding; Mathematics; Diagonal; Combinatorics; Grassmannian; Pure mathematics; Geometry","score_opus":0.0255410018380399,"score_gpt":0.31276091165124276,"score_spread":0.28721990981320283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183648216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85257703,0.00094428024,0.0108618075,0.0008076838,0.1216547,0.0021774534,0.00009734328,0.0001732758,0.010706458],"genre_scores_gemma":[0.97642034,0.000094293144,0.018389063,0.0000345958,0.0039683767,0.00001842973,0.0000017065457,0.00020620167,0.0008670011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484724,0.00091861776,0.0021838564,0.0003035412,0.0012885116,0.00045820692],"domain_scores_gemma":[0.98968655,0.0015501968,0.0055183377,0.0014792498,0.0015888707,0.0001768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035431262,0.00061770424,0.0017285405,0.0002566319,0.0002093982,0.000113339775,0.002375182,0.00062289,0.00013134141],"category_scores_gemma":[0.005780215,0.00043004114,0.0011185698,0.00038807048,0.00062739314,0.00029493903,0.0015638149,0.0016525007,0.0000040165883],"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.0008435017,0.00042396976,0.000044861412,0.00093471014,0.00057028857,0.000029584817,0.0025644153,0.000038018585,0.00034515426,0.9912846,0.0027113582,0.00020951772],"study_design_scores_gemma":[0.0013177723,0.00054142973,0.000014990893,0.0018328885,0.0005160506,0.00015046378,0.0006508589,0.000018609118,0.0065925727,0.9846945,0.0032753476,0.0003945371],"about_ca_topic_score_codex":0.0000035995317,"about_ca_topic_score_gemma":0.0000023913105,"teacher_disagreement_score":0.12384333,"about_ca_system_score_codex":0.00027556266,"about_ca_system_score_gemma":0.00058039074,"threshold_uncertainty_score":0.99981517},"labels":[],"label_agreement":null},{"id":"W2254138235","doi":"10.1006/jcta.1999.3031","title":"Truncated Transversal Designs: A New Lower Bound on the Number of Idempotent MOLS of Side n","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transversal (combinatorics); Mathematics; Disjoint sets; Combinatorics; Corollary; Idempotence; Type (biology); Upper and lower bounds; Point (geometry); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.011410803374765703,"score_gpt":0.2144298490886143,"score_spread":0.20301904571384857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254138235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875065,0.00029146217,0.0002388289,0.000104329585,0.0028493847,0.00017476473,0.000007439491,0.000025715237,0.008801587],"genre_scores_gemma":[0.9991915,0.00009268772,0.000036388406,0.000023160592,0.00028322046,0.0000023863142,4.80997e-7,0.000031356438,0.00033881655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981947,0.00035519918,0.00079690834,0.000079688936,0.00037219955,0.00020129215],"domain_scores_gemma":[0.99884033,0.00043291342,0.00025185375,0.0002561395,0.00011625469,0.00010252064],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012478015,0.00020040128,0.00051336066,0.000068406756,0.00005498532,0.000026164362,0.00036296275,0.00011908675,0.0011363608],"category_scores_gemma":[0.000082555634,0.00013738078,0.00033346566,0.00024839104,0.00015108155,0.0002407997,0.000007009992,0.00029733975,0.000011589275],"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.0084063765,0.000262683,0.00006500434,0.00010660295,0.00081370457,0.000048520298,0.0031579556,0.0056740385,0.024224197,0.95308477,0.0019816407,0.0021745397],"study_design_scores_gemma":[0.0025946463,0.0011329296,0.00018264382,0.00042792258,0.00016132643,0.00017160627,0.000930493,0.00004235581,0.07264451,0.91142315,0.010022065,0.00026636565],"about_ca_topic_score_codex":0.000008265022,"about_ca_topic_score_gemma":5.687072e-7,"teacher_disagreement_score":0.048420314,"about_ca_system_score_codex":0.00003676541,"about_ca_system_score_gemma":0.00007773445,"threshold_uncertainty_score":0.9997767},"labels":[],"label_agreement":null},{"id":"W2255049322","doi":"10.1016/j.jcta.2016.08.002","title":"Four-dimensional polytopes of minimum positive semidefinite rank","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","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":"Fundação para a Ciência e a Tecnologia; European Regional Development Fund; Fonds De La Recherche Scientifique - FNRS; Ministério da Educação e Ciência; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Polytope model; Rank (graph theory); Birkhoff polytope; Discrete mathematics; Regular polygon","score_opus":0.031160743924278166,"score_gpt":0.30007566497242666,"score_spread":0.2689149210481485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255049322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96334213,0.0017349209,0.005533444,0.0038490945,0.009501895,0.00101442,0.0005465482,0.000060260594,0.01441729],"genre_scores_gemma":[0.9942954,0.00014623608,0.0035283158,0.00006945037,0.001136758,0.000018689901,0.000007907878,0.000070498514,0.0007267212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680936,0.0006605039,0.0013950667,0.00022620895,0.000654929,0.00025391625],"domain_scores_gemma":[0.99132407,0.0039103525,0.0025950347,0.0005830721,0.0014392622,0.00014820568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017757703,0.00038475593,0.0011710969,0.00026481456,0.00012604863,0.0000484565,0.00073446974,0.0003131613,0.0003023585],"category_scores_gemma":[0.0014282789,0.00028007393,0.00060319866,0.00014697599,0.00037771155,0.00023463965,0.0006697007,0.00078338577,0.0000069468174],"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.0019741263,0.0002806499,0.000029798373,0.00012658273,0.0007051065,0.000023106062,0.0009906493,0.0000033047877,0.003702906,0.9881863,0.0034144209,0.0005630573],"study_design_scores_gemma":[0.0015718408,0.0005247481,0.0001432924,0.0009988334,0.00033397967,0.00012046899,0.0002102752,0.0000018133413,0.013782569,0.98022705,0.0018021612,0.00028294593],"about_ca_topic_score_codex":0.0000026577836,"about_ca_topic_score_gemma":7.294652e-7,"teacher_disagreement_score":0.030953296,"about_ca_system_score_codex":0.000111300455,"about_ca_system_score_gemma":0.00051607547,"threshold_uncertainty_score":0.99996513},"labels":[],"label_agreement":null},{"id":"W2295702520","doi":"10.1016/j.jcta.2016.12.006","title":"Constructions and nonexistence results for suitable sets of permutations","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Set (abstract data type); Discrete mathematics; Computer science; Physics","score_opus":0.04575628242448536,"score_gpt":0.3403808837993896,"score_spread":0.2946246013749042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295702520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9411282,0.0013965302,0.002962359,0.000575113,0.03292552,0.0013349619,0.0016644893,0.00004490157,0.017967908],"genre_scores_gemma":[0.97584665,0.00026422358,0.022877809,0.000007955064,0.00052025827,0.000014146548,0.000008214404,0.00003415464,0.00042661375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792135,0.00024423713,0.0011030668,0.00020757299,0.0003167817,0.00020696808],"domain_scores_gemma":[0.99347186,0.0019939295,0.0027866077,0.0006211713,0.001017195,0.00010923599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024392921,0.0002652583,0.00089477375,0.00018663077,0.0005551874,0.000115902694,0.0005945572,0.0003544856,0.000013462457],"category_scores_gemma":[0.004789605,0.00021734678,0.00035981645,0.000045136872,0.00081000547,0.00023504971,0.00042942804,0.00063275266,8.533435e-8],"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.0020338881,0.00006488524,0.00002728605,0.0004502705,0.00036128028,0.0000069462044,0.0029667313,0.000015434605,0.00007152047,0.99278015,0.0008073416,0.0004142937],"study_design_scores_gemma":[0.0019353343,0.00042731586,0.000072902105,0.000475018,0.0003812933,0.00023005664,0.0012706151,0.000009929924,0.0006742336,0.99207985,0.0022393025,0.00020412491],"about_ca_topic_score_codex":0.0000034398793,"about_ca_topic_score_gemma":0.0000019286886,"teacher_disagreement_score":0.03471841,"about_ca_system_score_codex":0.000041158364,"about_ca_system_score_gemma":0.00030969863,"threshold_uncertainty_score":0.8863144},"labels":[],"label_agreement":null},{"id":"W2337358905","doi":"10.1016/j.jcta.2016.11.001","title":"An upper bound for the size of a k-uniform intersecting family with covering number k","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","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":"University of Manitoba","funders":"National Science Foundation","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Geometry; Mathematical analysis","score_opus":0.019286416900040262,"score_gpt":0.29779499393241077,"score_spread":0.27850857703237053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337358905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9690431,0.00020565666,0.013774246,0.00011282832,0.013114057,0.000664198,0.00006597259,0.0000296226,0.002990345],"genre_scores_gemma":[0.9942699,0.00007266999,0.00358595,0.000047262998,0.0017647374,0.000018774599,7.311149e-7,0.000085911815,0.00015402562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762243,0.00030167142,0.0010197387,0.00021904158,0.0005201684,0.0003169347],"domain_scores_gemma":[0.9916254,0.0046321875,0.0021034076,0.00072837865,0.00080893026,0.000101671205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003096728,0.00040026032,0.00094507943,0.00008514258,0.00033856236,0.0001400616,0.0010602536,0.0003030273,0.000092956994],"category_scores_gemma":[0.0012459052,0.0002026097,0.0005306825,0.00008254659,0.00046351412,0.0003718114,0.00040630376,0.0008056026,2.269248e-7],"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.0074341507,0.000096533106,0.00017948801,0.00037828338,0.001017451,0.000009254614,0.0051344717,0.000021722512,0.00046938474,0.9842627,0.00019749954,0.00079904555],"study_design_scores_gemma":[0.001821572,0.0009046792,0.000086708846,0.0009454296,0.00040149645,0.00015313072,0.0044312254,0.000009446216,0.0016619428,0.9877271,0.001572979,0.00028429768],"about_ca_topic_score_codex":0.0000039930637,"about_ca_topic_score_gemma":0.0000020304917,"teacher_disagreement_score":0.025226863,"about_ca_system_score_codex":0.00010936943,"about_ca_system_score_gemma":0.00026575715,"threshold_uncertainty_score":0.8262184},"labels":[],"label_agreement":null},{"id":"W2343027471","doi":"10.1016/j.jcta.2017.02.006","title":"Cutting algebraic curves into pseudo-segments and applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"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; Bounded function; Constant (computer programming); Upper and lower bounds; Degree (music); Plane (geometry); Algebraic number; Plane curve; Combinatorics; Algebraic curve; Family of curves; Space (punctuation); Current (fluid); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.008612297358442805,"score_gpt":0.26262579572424116,"score_spread":0.25401349836579834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343027471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12808675,0.004696222,0.8475009,0.0060835793,0.0090998765,0.0004891638,0.0000025555669,0.00006717822,0.0039737863],"genre_scores_gemma":[0.9819571,0.000541092,0.015932316,0.00023679312,0.0010646288,0.000010312907,0.0000012244456,0.000007658795,0.00024887908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991021,0.00009816598,0.00030367533,0.00012552737,0.00026471866,0.000105774714],"domain_scores_gemma":[0.9986205,0.00014135208,0.00056291255,0.00030643828,0.00027707085,0.000091737944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025812,0.00009074197,0.00016810442,0.000084285,0.00060852326,0.00035665333,0.0006850665,0.000035724253,0.000008196794],"category_scores_gemma":[0.00029315683,0.00008099884,0.000055922003,0.00009353109,0.00008741328,0.0014986556,0.00022999223,0.00012585211,0.0000028811482],"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.000034870638,0.00004530894,0.00015386897,0.000034954446,0.000032762062,0.000004922643,0.00020307678,0.000018621291,0.0006786815,0.9601972,0.00032066708,0.03827507],"study_design_scores_gemma":[0.0005908087,0.00020536323,0.001236852,0.00010191661,0.000016975651,0.000111254776,0.000036385984,0.00017204501,0.002352731,0.98003924,0.015027291,0.000109126704],"about_ca_topic_score_codex":0.0000016323594,"about_ca_topic_score_gemma":3.044035e-7,"teacher_disagreement_score":0.85387033,"about_ca_system_score_codex":0.000023141023,"about_ca_system_score_gemma":0.00009402777,"threshold_uncertainty_score":0.46803302},"labels":[],"label_agreement":null},{"id":"W2443570680","doi":"10.1016/j.jcta.2018.01.006","title":"Dual Immaculate Quasisymmetric Functions Expand Positively into Young Quasisymmetric Schur Functions","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Dual (grammatical number); Noncommutative geometry; Combinatorics; Schur's lemma; Young tableau; Decomposition; Symmetric function; Schur algebra; Schur's theorem; Dual function; Function (biology); Pure mathematics; Computer science; Chemistry","score_opus":0.02731809846106409,"score_gpt":0.30899481540139667,"score_spread":0.2816767169403326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2443570680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6630157,0.0035894446,0.15773785,0.0006133268,0.15897411,0.002575813,0.00022442058,0.0005196425,0.012749647],"genre_scores_gemma":[0.96102536,0.00043349926,0.02336159,0.000039784976,0.009885679,0.0001172942,0.000034713954,0.00035642902,0.0047456226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915002,0.0013670189,0.0033302146,0.00081865315,0.00206453,0.0009193837],"domain_scores_gemma":[0.9854384,0.0034323782,0.0051259915,0.0015437461,0.0038725557,0.00058691856],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004732748,0.0012705005,0.0026212798,0.0025253925,0.00088751793,0.00054276915,0.0013607034,0.0011756849,0.0003965523],"category_scores_gemma":[0.01164411,0.0011689413,0.0014484164,0.002382798,0.0006114371,0.0011520549,0.0014397211,0.0030361314,0.00015437054],"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.003468984,0.0022512972,0.00029139273,0.0007751942,0.0028741127,0.00020835486,0.002804066,0.000054144537,0.00041438753,0.97504324,0.009982913,0.0018319226],"study_design_scores_gemma":[0.0032229275,0.0022422415,0.00010935865,0.00078730425,0.0017331069,0.0006427002,0.0022514516,0.000025250394,0.0011738995,0.98307353,0.003657667,0.0010805589],"about_ca_topic_score_codex":0.000017755063,"about_ca_topic_score_gemma":0.000005471386,"teacher_disagreement_score":0.29800966,"about_ca_system_score_codex":0.0012098189,"about_ca_system_score_gemma":0.0008049221,"threshold_uncertainty_score":0.9992639},"labels":[],"label_agreement":null},{"id":"W2521932407","doi":"10.1016/j.jcta.2017.06.008","title":"Weighted lattice walks and universality classes","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Universality (dynamical systems); Random walk; Generating function; Combinatorics; Lattice (music); Algebraic number; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.02951541638307812,"score_gpt":0.3153242338792457,"score_spread":0.28580881749616754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521932407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9666878,0.00027234777,0.0030157536,0.001089785,0.012860703,0.00034107603,0.00000864413,0.0000843048,0.015639607],"genre_scores_gemma":[0.98506635,0.00014930803,0.013109771,0.000023289269,0.0008991111,0.0000020343189,2.9026415e-7,0.000048504797,0.0007013625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981373,0.00027958702,0.00067621213,0.00016106722,0.0004805847,0.00026526145],"domain_scores_gemma":[0.9953373,0.0014166061,0.0017227454,0.00073119684,0.0006003068,0.00019181095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018041014,0.00024971415,0.00067887275,0.000092951996,0.0005394062,0.00028060327,0.0007612797,0.00017319372,0.00005862387],"category_scores_gemma":[0.004346596,0.00020810767,0.00015036373,0.000070196875,0.00043160364,0.0015156812,0.000286616,0.00046387836,0.0000030450756],"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.0007322471,0.00016836835,0.00013192355,0.00009791055,0.00014090684,0.00006334989,0.0006326367,1.2937579e-7,0.00025196475,0.99670714,0.00038933413,0.00068410276],"study_design_scores_gemma":[0.0022482849,0.00046159988,0.00012377591,0.000151652,0.0001726532,0.00015518614,0.0007947854,0.000006374476,0.0020015095,0.9833503,0.0103154825,0.0002183987],"about_ca_topic_score_codex":0.0000032419923,"about_ca_topic_score_gemma":0.0000017668372,"teacher_disagreement_score":0.01837855,"about_ca_system_score_codex":0.00009787862,"about_ca_system_score_gemma":0.00012475482,"threshold_uncertainty_score":0.8486384},"labels":[],"label_agreement":null},{"id":"W2522011589","doi":"10.1016/j.jcta.2018.03.012","title":"Subalgebras of Solomon's descent algebra based on alternating runs","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Descent (aeronautics); Mathematics; Noncommutative geometry; Permutation (music); Eulerian path; Symmetric group; Commutative property; Algebra over a field; Pure mathematics; Lagrangian; Physics","score_opus":0.023966803463956726,"score_gpt":0.3041818992252612,"score_spread":0.28021509576130443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522011589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96109927,0.0000692106,0.016136926,0.00026802366,0.01513729,0.0004700416,0.000009749005,0.00009295272,0.0067165564],"genre_scores_gemma":[0.9821311,0.000010270338,0.015956404,0.000067930916,0.0016593531,0.0000048408892,6.029629e-7,0.00008009077,0.00008939505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99653035,0.00042462294,0.0014035007,0.00020812442,0.0010256901,0.00040772549],"domain_scores_gemma":[0.99376285,0.0021286425,0.002163882,0.0006223475,0.0011305563,0.00019173414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002386098,0.0003591168,0.00092446845,0.00026546908,0.00017002165,0.00005345647,0.0007892646,0.00017634341,0.00019837906],"category_scores_gemma":[0.005031654,0.0003010277,0.00034554582,0.00035044496,0.00039060178,0.00039680407,0.00012419271,0.00046889018,0.000010063113],"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.0019914438,0.00072212005,0.00007565025,0.0001388482,0.00012387778,0.00003488349,0.0009169589,0.000016343234,0.0026521736,0.9924105,0.00037850445,0.0005387037],"study_design_scores_gemma":[0.002540638,0.0033105258,0.000011972533,0.00046927782,0.0001097179,0.000043518885,0.0004161356,0.000115577765,0.09384003,0.8982536,0.0006418689,0.00024709568],"about_ca_topic_score_codex":0.0000015473506,"about_ca_topic_score_gemma":8.458279e-7,"teacher_disagreement_score":0.094156854,"about_ca_system_score_codex":0.00018236903,"about_ca_system_score_gemma":0.00023350178,"threshold_uncertainty_score":0.9999442},"labels":[],"label_agreement":null},{"id":"W2529358956","doi":"10.1016/j.jcta.2017.11.020","title":"A graphical calculus for the Jack inner product on symmetric functions","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","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":"University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Inner product space; Product (mathematics); Space (punctuation); Mathematics; Planar; Superalgebra; String (physics); Pure mathematics; Symmetric function; Realization (probability); Action (physics); Combinatorics; Calculus (dental); Algebra over a field; Geometry; Mathematical physics; Physics; Computer science; Quantum mechanics","score_opus":0.03376618277547973,"score_gpt":0.3056247157401893,"score_spread":0.2718585329647096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529358956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80641764,0.0014370626,0.010905768,0.017894063,0.15264614,0.0028582483,0.000045023615,0.00013440165,0.0076616695],"genre_scores_gemma":[0.99489814,0.00003691831,0.00017221097,0.00006686576,0.0039902553,0.000030759762,4.982164e-7,0.00004025772,0.00076407084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816513,0.0001754021,0.0006023346,0.00019809352,0.0005492526,0.00030977835],"domain_scores_gemma":[0.9955399,0.0018015486,0.0010172047,0.00090377004,0.0006120955,0.00012550627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015784722,0.00024829493,0.00050379365,0.0001521254,0.0012708326,0.00029190473,0.0009900455,0.00013771866,0.000055663564],"category_scores_gemma":[0.0068549137,0.00014450178,0.0004665453,0.00018726404,0.0003143374,0.00036434256,0.00012531268,0.0005310181,0.0000028246154],"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.0023086257,0.00016472716,0.000035983954,0.000024739631,0.00027329024,0.0000083867,0.00014814308,0.000004887667,0.000032633743,0.9900299,0.005122648,0.0018460816],"study_design_scores_gemma":[0.0021573734,0.0011867845,0.0002642567,0.000049676917,0.00023575709,0.00008996575,0.00017884586,0.000012132623,0.00047741653,0.9719344,0.023238774,0.00017463791],"about_ca_topic_score_codex":0.0000055053806,"about_ca_topic_score_gemma":0.0000017767392,"teacher_disagreement_score":0.18848054,"about_ca_system_score_codex":0.00006720933,"about_ca_system_score_gemma":0.00014437521,"threshold_uncertainty_score":0.9774346},"labels":[],"label_agreement":null},{"id":"W2594692962","doi":"10.1016/j.jcta.2013.05.008","title":"There is no upper bound for the diameter of the commuting graph of a finite group","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Construct (python library); Finite group; Group (periodic table); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.03221502957088206,"score_gpt":0.2928860373630313,"score_spread":0.26067100779214925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594692962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822136,0.00094467774,0.0041448404,0.0017514669,0.005471825,0.0018742684,0.00006602775,0.000019697709,0.0035135685],"genre_scores_gemma":[0.9971184,0.00006617898,0.0016575091,0.0001188492,0.00038479868,0.00003367648,4.3098674e-7,0.000054999986,0.00056513015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970364,0.00085081195,0.001000646,0.00011433298,0.0006630066,0.00033477947],"domain_scores_gemma":[0.98510003,0.011695402,0.0012629648,0.00074784376,0.0011256132,0.000068168716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004636513,0.0002165629,0.0005997299,0.00011496619,0.0002765266,0.00008875345,0.0012973482,0.00013509489,0.0006265545],"category_scores_gemma":[0.004364543,0.00011100996,0.00066832313,0.0003205707,0.0007648302,0.00036649048,0.00022768545,0.00054297235,0.000005475429],"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.0016355424,0.00030283225,0.00063184195,0.00027935926,0.0005328615,0.0000010496715,0.0034986134,0.0000026015275,0.0053483695,0.98386383,0.0030808102,0.0008222837],"study_design_scores_gemma":[0.001531713,0.000925072,0.00029357444,0.00024033315,0.00012791611,0.000018198036,0.002204606,0.000037093632,0.008843388,0.9824258,0.0032316928,0.0001205897],"about_ca_topic_score_codex":0.000014458832,"about_ca_topic_score_gemma":0.0000016661294,"teacher_disagreement_score":0.014904799,"about_ca_system_score_codex":0.000036896326,"about_ca_system_score_gemma":0.00009589845,"threshold_uncertainty_score":0.6860332},"labels":[],"label_agreement":null},{"id":"W2732577140","doi":"10.1016/j.jcta.2019.105185","title":"Exponential bounds for the Erdős-Ginzburg-Ziv constant","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Subsequence; Mathematics; Conjecture; Abelian group; Constant (computer programming); Partition (number theory); Exponential function; Rank (graph theory); Upper and lower bounds; Discrete mathematics; Bounded function; Mathematical analysis","score_opus":0.044113817173430846,"score_gpt":0.310377205515471,"score_spread":0.26626338834204016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732577140","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26791808,0.016399058,0.19134875,0.024396187,0.47458553,0.008891961,0.0012782782,0.00057993137,0.014602233],"genre_scores_gemma":[0.98562086,0.0004901782,0.003842643,0.00038057208,0.009070058,0.00005417477,0.0000081290855,0.00014213742,0.0003912618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963332,0.0006127581,0.001488253,0.00033122444,0.0007988171,0.0004357624],"domain_scores_gemma":[0.9919891,0.0041098176,0.0021526248,0.00079410034,0.0007430605,0.00021134675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034692378,0.00056106376,0.0012965938,0.00014405587,0.00067909755,0.00032524843,0.0016662721,0.00050326664,0.0002294553],"category_scores_gemma":[0.0025273277,0.0003544859,0.0012758164,0.0001382728,0.0007156669,0.00020594281,0.0010616634,0.0017212647,0.0000010208317],"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.0053531607,0.000095404605,0.000005057951,0.00031088846,0.0012552297,0.000046065277,0.002796056,0.000019015522,0.00016891657,0.97507834,0.014180285,0.0006915942],"study_design_scores_gemma":[0.0018448555,0.0005916696,0.000004584142,0.00022292764,0.0008301543,0.00014666405,0.0012122069,0.0000231114,0.00091004453,0.9288399,0.064999394,0.00037446446],"about_ca_topic_score_codex":0.0000016311285,"about_ca_topic_score_gemma":7.50607e-7,"teacher_disagreement_score":0.71770275,"about_ca_system_score_codex":0.000118507116,"about_ca_system_score_gemma":0.0005231587,"threshold_uncertainty_score":0.9998907},"labels":[],"label_agreement":null},{"id":"W2754741933","doi":"10.1016/j.jcta.2018.07.005","title":"Promotion on generalized oscillating tableaux and web rotation","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Promotion (chess); Young tableau; Rotation (mathematics); Computer science; Pure mathematics; Mathematics; Combinatorics; Geometry; Political science","score_opus":0.03392842528636295,"score_gpt":0.30086210994625934,"score_spread":0.26693368465989636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754741933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775607,0.0002085504,0.00043799815,0.00029093827,0.019579912,0.0005033562,0.000009799039,0.0000533344,0.0013554161],"genre_scores_gemma":[0.9918509,0.0001440342,0.002744163,0.000030409934,0.0048594596,0.000015001053,0.0000048880015,0.00007701975,0.00027413302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693346,0.00061797217,0.0010820959,0.00032688404,0.0007495332,0.00029004738],"domain_scores_gemma":[0.996242,0.0003890722,0.0020388728,0.0004050963,0.0007687909,0.00015618607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019568626,0.00044589693,0.0009442716,0.00022026678,0.00023414496,0.00024678936,0.00039086904,0.000509724,0.00015912078],"category_scores_gemma":[0.0011485635,0.00036422568,0.0002689555,0.00013008916,0.0001721081,0.00027987067,0.0003551013,0.0009029901,0.0000016565805],"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.0014758576,0.00011060654,0.000027799433,0.0002011229,0.00021643809,0.0000114080485,0.0007820023,0.00003950464,0.00022842645,0.99530625,0.00079210714,0.0008084548],"study_design_scores_gemma":[0.0020614,0.0014781363,0.000023587847,0.0005851268,0.00020114938,0.00007086133,0.00017179605,0.00011768169,0.0015221512,0.9922252,0.0012020898,0.0003408176],"about_ca_topic_score_codex":0.000004031353,"about_ca_topic_score_gemma":9.587714e-7,"teacher_disagreement_score":0.014720453,"about_ca_system_score_codex":0.0001789678,"about_ca_system_score_gemma":0.00032935676,"threshold_uncertainty_score":0.99988097},"labels":[],"label_agreement":null},{"id":"W2764047484","doi":"10.1016/j.jcta.2019.105181","title":"State transfer in strongly regular graphs with an edge perturbation","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Perturbation (astronomy); Mathematics; Quantum walk; Algebraic number; Graph; Quantum; Strongly regular graph; Combinatorics; Discrete mathematics; Line graph; Physics; Quantum computer; Quantum mechanics; Graph power; Mathematical analysis","score_opus":0.006800926363474224,"score_gpt":0.21704227831666595,"score_spread":0.2102413519531917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764047484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84331805,0.00039543374,0.14694738,0.0003924741,0.00838424,0.000340651,0.000007950231,0.00005560442,0.00015822094],"genre_scores_gemma":[0.9903829,0.00006278008,0.008861426,0.000036643236,0.00049710163,0.0000042719685,0.0000046871733,0.000037746748,0.00011243784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709034,0.0007210874,0.0007309659,0.00042903912,0.0006710254,0.000357518],"domain_scores_gemma":[0.9980595,0.00017454168,0.0004762681,0.00074164494,0.00039091395,0.00015710005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001804875,0.00038687946,0.00072912,0.00042626882,0.000088889414,0.0003897833,0.0016068675,0.00021437,0.0000064561186],"category_scores_gemma":[0.000042873093,0.0002890933,0.00021788456,0.00032804182,0.00011328725,0.0007610006,0.00029470658,0.0014865729,0.000001019437],"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.0023481138,0.0004173051,0.00018147599,0.00016442483,0.00020858717,0.0002586214,0.008159475,0.13778159,0.00013581965,0.83797896,0.000043106356,0.012322521],"study_design_scores_gemma":[0.002111737,0.0032515896,0.000602649,0.0005578156,0.000031918957,0.00017280871,0.00014373592,0.021339046,0.0005625871,0.9698882,0.00086729985,0.0004705766],"about_ca_topic_score_codex":0.000008230078,"about_ca_topic_score_gemma":0.0000038079759,"teacher_disagreement_score":0.14706486,"about_ca_system_score_codex":0.000093957686,"about_ca_system_score_gemma":0.0005760226,"threshold_uncertainty_score":0.99995613},"labels":[],"label_agreement":null},{"id":"W2775067917","doi":"10.1016/j.jcta.2018.09.003","title":"Permuted composition tableaux, 0-Hecke algebra and labeled binary trees","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Combinatorics; Mathematics; Composition (language); Young tableau; Descent (aeronautics); Equivalence (formal languages); Binary number; Equivalence relation; Generalization; Discrete mathematics; Arithmetic; Physics; Linguistics","score_opus":0.023677703957730757,"score_gpt":0.2981074055268169,"score_spread":0.27442970156908614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775067917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96755356,0.0014548474,0.003118545,0.0004969636,0.02471927,0.0009892231,0.0000611312,0.00020991216,0.0013965557],"genre_scores_gemma":[0.9665566,0.0006887939,0.027297426,0.000063682644,0.0046332744,0.00003854369,0.000025048304,0.000257618,0.0004390236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952137,0.0008765041,0.0019201139,0.0004655343,0.0009951165,0.0005290585],"domain_scores_gemma":[0.9925133,0.00164754,0.0031501413,0.0009112773,0.0014570042,0.00032074616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025561696,0.0008060857,0.0019938836,0.00041416852,0.00031659592,0.00028361139,0.0009757825,0.000778427,0.0001686604],"category_scores_gemma":[0.0019224463,0.000717792,0.00043376346,0.00029549227,0.00058249314,0.00066808774,0.0011659799,0.0016175641,0.000007898301],"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.0025945888,0.0007446224,0.000023996346,0.00085551833,0.0006708486,0.00014075628,0.0017277906,0.000015287687,0.003026321,0.98645025,0.0035341545,0.00021587928],"study_design_scores_gemma":[0.0030562102,0.0016578698,0.000021649792,0.0015125384,0.00063388504,0.00039432943,0.00053899497,0.00006397234,0.0047903126,0.98468983,0.00197366,0.00066671986],"about_ca_topic_score_codex":0.0000028884697,"about_ca_topic_score_gemma":0.0000014166998,"teacher_disagreement_score":0.024178881,"about_ca_system_score_codex":0.00031681242,"about_ca_system_score_gemma":0.0003878263,"threshold_uncertainty_score":0.99952734},"labels":[],"label_agreement":null},{"id":"W2781906402","doi":"10.1016/j.jcta.2018.08.003","title":"A bound on the inducibility of cycles","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme","keywords":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Physics","score_opus":0.036263694401268004,"score_gpt":0.30648365309322384,"score_spread":0.2702199586919558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781906402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863007,0.000058969756,0.00005199687,0.0003035029,0.0049160025,0.0001206796,0.00000469461,0.000009926958,0.008233538],"genre_scores_gemma":[0.99836737,0.00001258342,0.00027220108,0.0000911742,0.0011410597,0.0000012087506,8.0919605e-8,0.000016279248,0.00009803467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981301,0.00057397183,0.0006122405,0.00010601287,0.00041480327,0.00016287848],"domain_scores_gemma":[0.9963839,0.001856891,0.00072087155,0.00052596326,0.0004540894,0.000058262132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003855247,0.00014687203,0.0003819683,0.000079236146,0.00027896915,0.00003214126,0.0005279239,0.00010354129,0.00030981077],"category_scores_gemma":[0.0027057969,0.00007898911,0.0002243786,0.00015997243,0.00090153713,0.00015801654,0.00010977353,0.00033425255,0.0000014298406],"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.0018359905,0.0001262527,0.000104460756,0.0000211914,0.00012998123,0.0000036015488,0.0024812026,1.6299653e-7,0.0005483636,0.9931224,0.0011577689,0.00046862086],"study_design_scores_gemma":[0.0005209668,0.0012654484,0.0003669938,0.00007443781,0.000050576764,0.000038233607,0.0008883923,4.1493365e-7,0.021433884,0.9727571,0.0025200946,0.00008347146],"about_ca_topic_score_codex":0.0000010428357,"about_ca_topic_score_gemma":8.233324e-7,"teacher_disagreement_score":0.020885522,"about_ca_system_score_codex":0.00003085095,"about_ca_system_score_gemma":0.00007694163,"threshold_uncertainty_score":0.3392211},"labels":[],"label_agreement":null},{"id":"W2808988185","doi":"10.1016/j.jcta.2019.105204","title":"Chordality, d-collapsibility, and componentwise linear ideals","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences; National Science Foundation","keywords":"Betti number; Dual polyhedron; Mathematics; Ideal (ethics); Chordal graph; Combinatorics; Vertex (graph theory); Simplicial complex; Polynomial ring; Monomial ideal; Discrete mathematics; Polynomial; Graph; Mathematical analysis","score_opus":0.06670502554353652,"score_gpt":0.35442728357235437,"score_spread":0.28772225802881785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808988185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783282,0.0012194373,0.003849494,0.007246403,0.0050181984,0.0011255635,0.00012540193,0.0000954619,0.0029917844],"genre_scores_gemma":[0.9914986,0.0003730491,0.006261317,0.00012837203,0.001508984,0.000021712276,0.000009024593,0.00006358615,0.00013536426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969008,0.0007624251,0.0012875431,0.0003066888,0.0005235043,0.00021904915],"domain_scores_gemma":[0.9953007,0.0015907953,0.0015390555,0.00061110576,0.00068202993,0.00027630947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022759116,0.00037638212,0.0011741819,0.00012613676,0.00016545292,0.0001528597,0.0007253153,0.00026860018,0.00012992692],"category_scores_gemma":[0.001978226,0.00032675467,0.00034552868,0.00017199956,0.00031769418,0.00020437308,0.0014370838,0.0012699186,0.00000487123],"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.0008641397,0.00025675926,0.00013839161,0.00037952646,0.0003571665,0.000022366525,0.0016634845,0.0000032367234,0.0005384954,0.9930507,0.0023767077,0.00034901663],"study_design_scores_gemma":[0.0011026814,0.0003943592,0.00034543633,0.00021187485,0.00028773834,0.00006767809,0.00039966096,0.000016756849,0.0008894846,0.9877452,0.008255143,0.00028399128],"about_ca_topic_score_codex":0.0000062962677,"about_ca_topic_score_gemma":0.0000023564717,"teacher_disagreement_score":0.013170335,"about_ca_system_score_codex":0.000101433354,"about_ca_system_score_gemma":0.00030282067,"threshold_uncertainty_score":0.99991846},"labels":[],"label_agreement":null},{"id":"W2883399088","doi":"10.1016/j.jcta.2019.105173","title":"Minimal binary 2-neighbour-transitive codes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","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":"Memorial University of Newfoundland","funders":"Australian Research Council","keywords":"Transitive relation; Mathematics; Combinatorics; Alphabet; Permutation (music); Mathematical proof; Discrete mathematics; Transitive closure; Binary number; Permutation group; Class (philosophy); Cyclic permutation; Symmetric group; Computer science; Arithmetic","score_opus":0.01077805819466981,"score_gpt":0.2373821752603489,"score_spread":0.2266041170656791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883399088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5618155,0.0062005967,0.2781393,0.003311764,0.1282464,0.0012732137,0.00011200434,0.00045821595,0.020442994],"genre_scores_gemma":[0.9934071,0.0002731556,0.004443195,0.00015923053,0.0014673643,0.000007371358,0.0000039821584,0.000039011236,0.00019959999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960877,0.001182788,0.0010079822,0.00048424024,0.0007804301,0.00045688337],"domain_scores_gemma":[0.9957982,0.00085431914,0.0013857331,0.0009997074,0.0007329136,0.00022914883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032228664,0.00052712014,0.0011249833,0.00053682324,0.00019370086,0.000492111,0.003015773,0.00046403223,0.000098929595],"category_scores_gemma":[0.00021649121,0.00046447432,0.0009639415,0.0004125288,0.00030853122,0.0010270427,0.0012807959,0.001654618,0.000019119121],"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.0022103933,0.00025613562,0.00007108009,0.00012486747,0.00045569593,0.0002406461,0.0022784157,0.0002651607,0.00074328994,0.9907416,0.00081129785,0.0018014158],"study_design_scores_gemma":[0.0012383374,0.0019553674,0.0002700052,0.00052871346,0.0001313125,0.00024108379,0.00035200545,0.00012335874,0.0022843238,0.98385304,0.00848046,0.00054196257],"about_ca_topic_score_codex":0.000002179602,"about_ca_topic_score_gemma":2.8938538e-7,"teacher_disagreement_score":0.43159157,"about_ca_system_score_codex":0.00010069068,"about_ca_system_score_gemma":0.0006737065,"threshold_uncertainty_score":0.9997807},"labels":[],"label_agreement":null},{"id":"W2922084446","doi":"10.1016/j.jcta.2019.02.019","title":"Products of symmetric group characters","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Symmetric group; Kronecker delta; Basis (linear algebra); Ring (chemistry); Combinatorics; Symmetric function; Group (periodic table); Pure mathematics; Representation theory of the symmetric group; Kronecker product; Algebra over a field; Geometry","score_opus":0.01631038196023676,"score_gpt":0.26545687144788604,"score_spread":0.24914648948764928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922084446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823578,0.0001850504,0.0002992529,0.00011544761,0.014533423,0.00047027046,0.0000041168946,0.00003724474,0.0019973866],"genre_scores_gemma":[0.9935208,0.00005253582,0.0052043325,0.000015907151,0.0007358168,0.0000038472613,9.312885e-7,0.00006143407,0.00040442543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972011,0.00029028952,0.00125035,0.00017604885,0.0007804606,0.00030179266],"domain_scores_gemma":[0.9952124,0.0011302473,0.0020981615,0.0005773135,0.00086635695,0.00011553571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001903009,0.00027063262,0.0009961745,0.00035191057,0.00004807938,0.000031683023,0.00064338674,0.00012662147,0.0000770342],"category_scores_gemma":[0.004156669,0.00022294227,0.00024619323,0.00084121973,0.00011993013,0.00074675283,0.00012984689,0.0004246878,0.000015322647],"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.00079683,0.00048389248,0.00015998872,0.00043557712,0.00016354868,0.000013494774,0.0005542717,0.0000019857616,0.0043914276,0.99239963,0.00023136787,0.0003680093],"study_design_scores_gemma":[0.0020550687,0.0015169433,0.00015938183,0.00020375085,0.00010785533,0.00009472606,0.0003586865,0.0000018848028,0.011802574,0.9812678,0.0022137994,0.00021750263],"about_ca_topic_score_codex":5.065446e-7,"about_ca_topic_score_gemma":1.112485e-7,"teacher_disagreement_score":0.013797605,"about_ca_system_score_codex":0.00011603802,"about_ca_system_score_gemma":0.0001304857,"threshold_uncertainty_score":0.9091322},"labels":[],"label_agreement":null},{"id":"W2963003471","doi":"10.1016/j.jcta.2017.08.004","title":"Turán numbers of extensions","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Extension (predicate logic); Stability (learning theory); Discrete mathematics; Computer science","score_opus":0.028833399518335037,"score_gpt":0.31922771188474053,"score_spread":0.2903943123664055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963003471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704059,0.00017577228,0.0001649705,0.00022331162,0.011872845,0.00010703423,0.0000075607204,0.000013779099,0.017028866],"genre_scores_gemma":[0.99679506,0.00006858314,0.0019566314,0.000023056462,0.0006719906,7.690923e-7,1.5209557e-7,0.000022346905,0.0004614416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985331,0.00019648409,0.0006309685,0.00008987321,0.00037252554,0.00017699802],"domain_scores_gemma":[0.99663657,0.00060940604,0.0015128242,0.0006799094,0.00045721664,0.00010408041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016247957,0.00015394982,0.0005309658,0.00008586419,0.0005148486,0.00005847173,0.00077959883,0.00012221954,0.00018487552],"category_scores_gemma":[0.0028634968,0.00010967386,0.00031814416,0.00004486831,0.00050367194,0.0004314034,0.00020577203,0.00030955783,8.6373143e-7],"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.0009071393,0.00008360587,0.0002532782,0.00003610433,0.00015428493,0.000033964894,0.0009711275,7.4826744e-7,0.00067001453,0.994779,0.0014820839,0.00062864413],"study_design_scores_gemma":[0.0010740341,0.00033490505,0.00061458186,0.00011240322,0.00010384852,0.00015648632,0.00051817653,5.000714e-7,0.004476007,0.9873929,0.005099349,0.000116799],"about_ca_topic_score_codex":0.000002330363,"about_ca_topic_score_gemma":7.4919814e-7,"teacher_disagreement_score":0.026389169,"about_ca_system_score_codex":0.000020987742,"about_ca_system_score_gemma":0.00007002473,"threshold_uncertainty_score":0.44723704},"labels":[],"label_agreement":null},{"id":"W2963202195","doi":"10.1016/j.jcta.2017.05.002","title":"Power series with coefficients from a finite set","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"University of Waterloo","funders":"","keywords":"Series (stratigraphy); Power series; Mathematics; Rationality; Finite set; Set (abstract data type); Power (physics); Formal power series; Multivariate statistics; Power set; Applied mathematics; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis; Statistics; Physics; Philosophy; Geology; Thermodynamics","score_opus":0.0236838797959467,"score_gpt":0.2980891950488319,"score_spread":0.2744053152528852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963202195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9528564,0.00017386266,0.014490792,0.0006944543,0.020006614,0.0006033607,0.00008474981,0.0001322751,0.0109575],"genre_scores_gemma":[0.98687947,0.00002269405,0.011299767,0.000031654734,0.000827921,0.000008147725,0.0000018535612,0.00009467986,0.0008337883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973467,0.00024052968,0.0008974478,0.00023274824,0.00088357506,0.00039900068],"domain_scores_gemma":[0.9940005,0.0013614212,0.0024074193,0.0012168337,0.00079170906,0.00022209344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012228092,0.00039905397,0.00094841025,0.00011208665,0.00061705045,0.0003922451,0.0012940437,0.0001838293,0.00024947667],"category_scores_gemma":[0.0053739096,0.00029709146,0.0002168938,0.00011399081,0.0004964622,0.0015739042,0.00028379,0.00053911,0.00001515046],"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.0041110087,0.00035254995,0.0001744674,0.000045872075,0.0003173445,0.00021782935,0.0022236435,0.000013971687,0.00030316508,0.9913416,0.00076117925,0.00013739818],"study_design_scores_gemma":[0.0035963482,0.0016587846,0.000058905604,0.00036687273,0.00014951878,0.00014388251,0.0012364815,0.0000034920379,0.0048279837,0.97692806,0.010676675,0.00035298406],"about_ca_topic_score_codex":0.0000032968653,"about_ca_topic_score_gemma":0.0000026798937,"teacher_disagreement_score":0.034023102,"about_ca_system_score_codex":0.00010827836,"about_ca_system_score_gemma":0.00019859019,"threshold_uncertainty_score":0.99994814},"labels":[],"label_agreement":null},{"id":"W2963234396","doi":"10.1016/j.jcta.2009.03.008","title":"Extremal problems on triangle areas in two and three dimensions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"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":"Tel Aviv University; National Science Foundation","keywords":"Combinatorics; Mathematics; General position; Regular polygon; Span (engineering); Upper and lower bounds; Position (finance); Plane (geometry); Point (geometry); Discrete geometry; Unit (ring theory); Geometry; Mathematical analysis","score_opus":0.013936423538197943,"score_gpt":0.2565667971483106,"score_spread":0.24263037361011267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963234396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94299406,0.0007698082,0.047330543,0.00264708,0.0040399535,0.00022839436,8.8602144e-7,0.000029867748,0.0019594321],"genre_scores_gemma":[0.9971689,0.000026685744,0.0022660368,0.00015494837,0.00031842597,0.0000011733179,4.3418245e-7,0.0000031892255,0.000060198665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897116,0.00015557758,0.0003483822,0.00012602848,0.00026760015,0.00013122632],"domain_scores_gemma":[0.9992057,0.0002337992,0.00020831282,0.0001348052,0.00013460872,0.00008275648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010393048,0.000100467434,0.0002157998,0.00022223117,0.00008600238,0.00010217711,0.00022811852,0.000031618325,0.000007723781],"category_scores_gemma":[0.0001817616,0.00008211504,0.000058946305,0.0003413513,0.000027157732,0.0006226009,0.00004045748,0.00017295935,0.0000015770138],"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.00031923078,0.0001668975,0.00010312922,0.0000021448998,0.000009264823,0.000030862513,0.0002816457,0.0017154728,0.0006616104,0.9804753,0.000083165614,0.016151289],"study_design_scores_gemma":[0.0020618043,0.0012453333,0.0037649903,0.000058886733,0.000005786145,0.00012316232,0.000021179612,0.00089827745,0.00077610184,0.98946774,0.0014789527,0.00009779947],"about_ca_topic_score_codex":0.0000011874714,"about_ca_topic_score_gemma":0.0000034680393,"teacher_disagreement_score":0.054174874,"about_ca_system_score_codex":0.000035422385,"about_ca_system_score_gemma":0.00008760127,"threshold_uncertainty_score":0.3348554},"labels":[],"label_agreement":null},{"id":"W2963414974","doi":"10.1016/j.jcta.2011.07.007","title":"Enumeration of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">H</mml:mi></mml:math>-strata in quantum matrices with respect to dimension","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Simon Fraser University","funders":"Seventh Framework Programme","keywords":"Permutation (music); Dimension (graph theory); Enumeration; Function (biology); Mathematics; Combinatorics; Stratum; Generating function; Physics; Geology","score_opus":0.02448853618539452,"score_gpt":0.25997010481856514,"score_spread":0.23548156863317063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963414974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926778,0.00016556257,0.0014723483,0.00009593014,0.0035167134,0.00015992048,0.000018341985,0.00006142185,0.0018319783],"genre_scores_gemma":[0.98725855,0.000104523526,0.011835455,0.000050678882,0.00052442803,0.000040321815,0.0000048258976,0.00013374707,0.00004748719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996301,0.00029458717,0.0014652662,0.00035393602,0.0010714438,0.00051378226],"domain_scores_gemma":[0.99587697,0.0008730852,0.0018807757,0.0008075518,0.0003307734,0.00023082586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022388182,0.00040454068,0.00061461935,0.0002880677,0.00023199753,0.00014787195,0.0006752756,0.0003757832,0.0000791421],"category_scores_gemma":[0.0016446401,0.00039709313,0.0002940438,0.0005272589,0.00022171825,0.0011256688,0.00030118405,0.00062428444,0.000049089922],"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.005000054,0.0005447414,0.000009771994,0.00035790217,0.00022585131,0.00030129118,0.0041211215,0.00007348772,0.0037922033,0.98520535,0.00027271826,0.00009552647],"study_design_scores_gemma":[0.0026769936,0.0040675243,0.00003688417,0.0012096894,0.00033924304,0.0005466007,0.0026238984,0.008698064,0.0478321,0.9309434,0.0005421608,0.00048340822],"about_ca_topic_score_codex":0.000047677346,"about_ca_topic_score_gemma":0.000025385782,"teacher_disagreement_score":0.0542619,"about_ca_system_score_codex":0.00005664365,"about_ca_system_score_gemma":0.00039597848,"threshold_uncertainty_score":0.99984807},"labels":[],"label_agreement":null},{"id":"W2963671227","doi":"10.1016/j.jcta.2019.05.003","title":"Discrete-time quantum walks and graph structures","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Rotation system; Mathematics; Limiting; Quantum; Random walk; Statistical physics; TRACE (psycholinguistics); Entropy (arrow of time); Graph; Discrete mathematics; Quantum algorithm; Combinatorics; Quantum mechanics; Physics; Statistics","score_opus":0.002975383547587072,"score_gpt":0.20376703839428,"score_spread":0.20079165484669292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963671227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97838324,0.00064819976,0.011384499,0.0007580996,0.008103928,0.00012882728,0.0000024096987,0.00006141474,0.00052938005],"genre_scores_gemma":[0.9942805,0.000029880788,0.0049602427,0.00009393243,0.0004932231,4.2881396e-7,3.6713215e-7,0.0000145487475,0.00012684397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851084,0.00024427054,0.0003968863,0.0002071304,0.00038276185,0.00025812935],"domain_scores_gemma":[0.9987049,0.00028764724,0.00038085922,0.00033564953,0.00014577822,0.00014512982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086716784,0.00019419724,0.00040206936,0.00015746467,0.00013389873,0.00024884622,0.00078525045,0.000084128274,0.00003832158],"category_scores_gemma":[0.00008141514,0.00013858065,0.0001484923,0.00023658441,0.0001083154,0.000569521,0.00027635667,0.00039554332,0.0000068219106],"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.00025344448,0.000027622977,0.00008380369,0.000017904562,0.000065098604,0.00002966566,0.0009174087,0.0002432178,0.0013810684,0.990929,0.00021008862,0.0058416906],"study_design_scores_gemma":[0.00094060163,0.0013516076,0.0006682799,0.000055276243,0.000013429485,0.0004613246,0.000083962565,0.0036792404,0.0007686092,0.987666,0.0041072695,0.00020438706],"about_ca_topic_score_codex":0.0000019243253,"about_ca_topic_score_gemma":8.562949e-8,"teacher_disagreement_score":0.01589729,"about_ca_system_score_codex":0.000015682537,"about_ca_system_score_gemma":0.00007439509,"threshold_uncertainty_score":0.5651155},"labels":[],"label_agreement":null},{"id":"W2964325648","doi":"10.1016/j.jcta.2019.01.006","title":"On the Turán number of ordered forests","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"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","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Geography","score_opus":0.012665367482101385,"score_gpt":0.27549971829699826,"score_spread":0.26283435081489687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964325648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97774774,0.00004565266,0.000044664823,0.00018979414,0.005850576,0.00017988324,0.000004095926,0.000009772114,0.015927803],"genre_scores_gemma":[0.99861133,0.000014778474,0.00025907517,0.00007714065,0.0003268858,0.000001507362,2.0600301e-7,0.000025312589,0.000683775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832433,0.00037446496,0.0005732025,0.000088222805,0.00046374343,0.00017600264],"domain_scores_gemma":[0.9960573,0.0024291913,0.00073809543,0.000422698,0.00029904317,0.000053706623],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017364648,0.00016495537,0.0004443307,0.00006059969,0.000110944944,0.000026166026,0.0005219218,0.0001111261,0.0012579298],"category_scores_gemma":[0.0011406655,0.00008906241,0.00027414394,0.0001464913,0.00017928529,0.0001643758,0.00009538364,0.00037274254,0.000008593401],"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.0018320186,0.00009169343,0.00061818876,0.000041060855,0.00015982159,0.000006159612,0.00096227083,0.000003901645,0.00014511617,0.99417347,0.001826039,0.00014028834],"study_design_scores_gemma":[0.0010572677,0.0005186207,0.00026818644,0.00010626618,0.000046958856,0.00008896032,0.000498676,0.0000013840862,0.0025071667,0.9923807,0.0024214825,0.00010435243],"about_ca_topic_score_codex":6.538652e-7,"about_ca_topic_score_gemma":4.48725e-7,"teacher_disagreement_score":0.02086356,"about_ca_system_score_codex":0.00002418103,"about_ca_system_score_gemma":0.000057599078,"threshold_uncertainty_score":0.99965507},"labels":[],"label_agreement":null},{"id":"W2967936998","doi":"10.1016/j.jcta.2017.11.018","title":"Extremal bounds for bootstrap percolation in the hypercube","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford","keywords":"Hypercube; Combinatorics; Vertex (graph theory); Mathematics; Cardinality (data modeling); Conjecture; Upper and lower bounds; Mathematical proof; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.08848085778958001,"score_gpt":0.3732643041425507,"score_spread":0.2847834463529707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967936998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4052187,0.00046032813,0.56866515,0.0033885995,0.0144120185,0.0012684212,0.000050109167,0.000029978724,0.006506707],"genre_scores_gemma":[0.9943211,0.000016477323,0.0047772825,0.00004290276,0.00072841195,0.000012374403,4.720348e-7,0.000014664221,0.00008627777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989105,0.00009451221,0.00044167446,0.00008204445,0.0002939311,0.00017737475],"domain_scores_gemma":[0.9973446,0.0015875119,0.0004972354,0.0002697619,0.00025469786,0.00004619442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022310775,0.00011352741,0.00029051566,0.00004454044,0.00032596986,0.00020048169,0.00055025175,0.000082825776,0.000031639458],"category_scores_gemma":[0.006975394,0.000073446725,0.00011561285,0.000039012884,0.000092847105,0.0003794597,0.000033860033,0.00021660667,7.408613e-7],"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.00093458354,0.00010786497,0.000011992151,0.0000495437,0.000021380567,0.000016189817,0.0007677843,6.6572386e-7,0.00013820254,0.99552757,0.00035018407,0.0020740407],"study_design_scores_gemma":[0.0013045855,0.0007329644,0.00021668778,0.00006792521,0.00006232403,0.00010742172,0.001006845,0.00011441532,0.00010852414,0.99422336,0.001966211,0.0000887163],"about_ca_topic_score_codex":0.0000014286913,"about_ca_topic_score_gemma":0.000004004007,"teacher_disagreement_score":0.58910245,"about_ca_system_score_codex":0.00003534398,"about_ca_system_score_gemma":0.00009569497,"threshold_uncertainty_score":0.83507025},"labels":[],"label_agreement":null},{"id":"W2979819925","doi":"10.1016/j.jcta.2019.105155","title":"The Paley graph conjecture and Diophantine m-tuples","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Bilkent Üniversitesi; Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Square number; Conjecture; Tuple; Mathematics; Diophantine equation; Combinatorics; Graph; Integer (computer science); Discrete mathematics; Diophantine set; Upper and lower bounds; Computer science","score_opus":0.007954308504379701,"score_gpt":0.24074425419648987,"score_spread":0.23278994569211017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979819925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898837,0.0017553163,0.00009363561,0.00054444,0.0050735157,0.00016124074,0.0000030967924,0.000019745594,0.0024652765],"genre_scores_gemma":[0.99749804,0.00034040536,0.00016693621,0.000049403116,0.00056600996,0.0000015439142,3.7014686e-7,0.000022353881,0.0013549349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985023,0.0003625046,0.00048492634,0.00010694683,0.00031670008,0.00022663135],"domain_scores_gemma":[0.9966745,0.0022529587,0.00053186185,0.00027150344,0.00017486021,0.000094336356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002657729,0.00017783635,0.000408828,0.000073197894,0.00022376767,0.000095067786,0.00033076692,0.00010796075,0.00017568117],"category_scores_gemma":[0.00095650495,0.00010384312,0.00016340583,0.00018123393,0.0002511867,0.0002656857,0.00008877075,0.000374532,0.0000072438374],"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.0012915235,0.00004907355,0.00047880382,0.0000459234,0.00016669113,0.000015135832,0.00048925425,4.0324466e-7,0.000536745,0.99554753,0.0007525239,0.0006263729],"study_design_scores_gemma":[0.0013497197,0.00054437557,0.00020465798,0.00006750497,0.00006548839,0.00034276058,0.0013650887,3.5435136e-7,0.0027618064,0.9733101,0.019859893,0.00012822662],"about_ca_topic_score_codex":5.333527e-7,"about_ca_topic_score_gemma":4.8300444e-7,"teacher_disagreement_score":0.022237426,"about_ca_system_score_codex":0.00001337235,"about_ca_system_score_gemma":0.0000503531,"threshold_uncertainty_score":0.42345998},"labels":[],"label_agreement":null},{"id":"W2979879756","doi":"10.1016/j.jcta.2021.105422","title":"Three-phase Golay sequence and array triads","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary Golay code; Sequence (biology); Phase (matter); Mathematics; Ternary Golay code; Combinatorics; Statistics; Physics; Biology; Genetics","score_opus":0.02032535427454144,"score_gpt":0.2766334399962903,"score_spread":0.25630808572174885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979879756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88676786,0.009706071,0.016710207,0.000293699,0.0830485,0.00034938028,0.00004359795,0.00019382813,0.0028868606],"genre_scores_gemma":[0.99266535,0.0016632186,0.0020950518,0.000017785535,0.0033674545,0.000013131937,0.000008076994,0.00008509304,0.00008486632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980631,0.00018481741,0.0008708658,0.0002102889,0.00041187488,0.00025904857],"domain_scores_gemma":[0.9983584,0.00019317726,0.0004662967,0.00041820112,0.00034994545,0.00021396908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012200541,0.0003712318,0.00083669927,0.00018986399,0.000079406076,0.00025083945,0.00043112808,0.00038344634,0.00017744557],"category_scores_gemma":[0.0004069514,0.00035967902,0.0002727198,0.0001594657,0.00019385836,0.00045844945,0.00016806471,0.0014822545,0.000002342694],"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.008410188,0.0011794858,0.00024607926,0.0034758816,0.0070876754,0.0023380427,0.010866435,0.023625042,0.28481784,0.6011284,0.01131898,0.045505937],"study_design_scores_gemma":[0.0049630953,0.0006884168,0.000049254162,0.0009577168,0.0003620784,0.0017028988,0.0011074535,0.00018743555,0.04696068,0.9086215,0.033511315,0.00088818226],"about_ca_topic_score_codex":0.0000026639595,"about_ca_topic_score_gemma":0.0000010771549,"teacher_disagreement_score":0.30749306,"about_ca_system_score_codex":0.00021039187,"about_ca_system_score_gemma":0.00026777876,"threshold_uncertainty_score":0.9998855},"labels":[],"label_agreement":null},{"id":"W2980330807","doi":"10.1016/j.jcta.2020.105337","title":"An analogue of Ruzsa's conjecture for polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","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 Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Conjecture; Polynomial; Field (mathematics); Combinatorics; Ring (chemistry); Physics; Mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis; Chemistry","score_opus":0.01710372350876875,"score_gpt":0.2712803088292093,"score_spread":0.2541765853204405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980330807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13463415,0.0012305081,0.8252153,0.0027995405,0.034219135,0.00083312206,0.00020721083,0.00013417637,0.00072688045],"genre_scores_gemma":[0.99156934,0.00007613308,0.006244122,0.00027969835,0.0017718205,0.0000094136985,0.000008955027,0.000025552761,0.000014989617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735075,0.0006291236,0.0009895558,0.00035588827,0.00040566162,0.00026899888],"domain_scores_gemma":[0.9957907,0.0011198607,0.0016392887,0.00078603084,0.00044623105,0.00021789479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020465825,0.00035411003,0.0010410844,0.00029346126,0.00011662985,0.00024333075,0.0024048714,0.0004611465,0.00005061358],"category_scores_gemma":[0.0005547681,0.0003091038,0.0008282057,0.00029230912,0.00017274753,0.0005463411,0.00056318037,0.000872891,5.2715774e-7],"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.0021583273,0.00015322112,0.0000376935,0.00016344617,0.00034668483,0.000027008042,0.0016879712,0.00057160377,0.0007657751,0.9907136,0.00091946503,0.0024551875],"study_design_scores_gemma":[0.0012862865,0.002783034,0.00007852835,0.0001804207,0.00012050168,0.000024528423,0.000098179145,0.00024545472,0.0052367183,0.98291403,0.006724404,0.0003079373],"about_ca_topic_score_codex":0.0000043382893,"about_ca_topic_score_gemma":0.0000012951654,"teacher_disagreement_score":0.85693514,"about_ca_system_score_codex":0.0000331445,"about_ca_system_score_gemma":0.00043738753,"threshold_uncertainty_score":0.9999361},"labels":[],"label_agreement":null},{"id":"W3000423532","doi":"10.1016/j.jcta.2019.105189","title":"3D positive lattice walks and spherical triangles","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Cellular Automata and Applications","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":"Simon Fraser University","funders":"Horizon 2020; European Research Council","keywords":"Mathematics; Eigenvalues and eigenvectors; Exponent; Lattice (music); Combinatorics; Dirichlet distribution; Mathematical analysis; Pure mathematics; Boundary value problem","score_opus":0.010130364783296758,"score_gpt":0.22477403037329377,"score_spread":0.214643665589997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000423532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20155813,0.002013306,0.75758934,0.027231695,0.0038959584,0.00041739264,0.000011271028,0.00018728703,0.007095619],"genre_scores_gemma":[0.9688252,0.0000645551,0.029744098,0.00064186903,0.0006474785,0.00000224151,6.891952e-7,0.000010666103,0.00006315535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912584,0.00015111837,0.0002788748,0.00012359732,0.00020284629,0.000117724114],"domain_scores_gemma":[0.99911165,0.00024403934,0.00021135448,0.0001373612,0.00012498621,0.00017063138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035428273,0.00009383806,0.00022203694,0.000022604945,0.00009985809,0.00014854652,0.00043379999,0.000046519515,0.000025076772],"category_scores_gemma":[0.0001468928,0.00007754031,0.0000724244,0.00022488796,0.00008017611,0.00056245964,0.00015457098,0.00018312108,0.0000069201687],"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.00020620912,0.000056102563,0.000018790632,0.000006935985,0.000039223287,0.00004089725,0.0016074543,0.0000022163993,0.0020730153,0.9847185,0.00042513557,0.010805533],"study_design_scores_gemma":[0.003035971,0.0018908955,0.0008082127,0.0000448961,0.00008849105,0.00048752688,0.0007152785,0.00122195,0.011032898,0.8538146,0.1264987,0.00036060088],"about_ca_topic_score_codex":0.0000010064522,"about_ca_topic_score_gemma":8.2178374e-8,"teacher_disagreement_score":0.7672671,"about_ca_system_score_codex":0.00001544028,"about_ca_system_score_gemma":0.00006699929,"threshold_uncertainty_score":0.31620023},"labels":[],"label_agreement":null},{"id":"W3011285915","doi":"10.1016/j.jcta.2019.105190","title":"The partition rank of a tensor and k-right corners in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Partition (number theory); Combinatorics; Rank (graph theory); Discrete mathematics","score_opus":0.01948802082768114,"score_gpt":0.2484689187412446,"score_spread":0.22898089791356346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011285915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5414868,0.0011135282,0.0007625414,0.0025397602,0.004308172,0.000072973904,0.00029941316,0.00016492815,0.44925186],"genre_scores_gemma":[0.9898454,0.0019597185,0.001903568,0.0013719994,0.0028024483,0.00076712656,0.00038235512,0.00069806434,0.0002693268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9900302,0.00091010146,0.0029779612,0.0013511259,0.0026704744,0.0020601016],"domain_scores_gemma":[0.9896075,0.0027957312,0.0038427315,0.0020575891,0.00038242879,0.0013140102],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033741563,0.0008997054,0.0005251543,0.000558919,0.0018067266,0.0016984296,0.0023525099,0.002175475,0.5013272],"category_scores_gemma":[0.0022964622,0.0015698752,0.0019445221,0.0014303868,0.0023588557,0.001865099,0.0014303116,0.0022595138,0.00080822856],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053136963,0.00042686876,0.000011433345,0.0010274693,0.0016018288,0.0010470472,0.003553734,0.00054019276,0.0026452756,0.7290144,0.25404838,0.0007696908],"study_design_scores_gemma":[0.0056218714,0.0027546308,0.00011486046,0.0016947059,0.0022141167,0.0027542654,0.006359453,0.008379348,0.9541298,0.006472547,0.007899631,0.0016047525],"about_ca_topic_score_codex":0.0004538122,"about_ca_topic_score_gemma":0.00045409883,"teacher_disagreement_score":0.95148456,"about_ca_system_score_codex":0.000024256522,"about_ca_system_score_gemma":0.0018126179,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W3015825817","doi":"10.1016/j.jcta.2020.105253","title":"Lower bounds for graph bootstrap percolation via properties of polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Hypercube; Simple (philosophy); Mathematics; Combinatorics; Torus; Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.036241503016032364,"score_gpt":0.2793446789304078,"score_spread":0.24310317591437547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015825817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3979064,0.0013917217,0.5895771,0.0034584126,0.00633528,0.00083909696,0.000009902573,0.00007526888,0.00040685618],"genre_scores_gemma":[0.99498606,0.000035060544,0.0042914203,0.0001089934,0.0005032352,0.000008994768,3.4690626e-7,0.000018730141,0.00004718715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980229,0.00031605977,0.0006942395,0.0001883572,0.0005038952,0.0002745247],"domain_scores_gemma":[0.9979519,0.00026092547,0.000578828,0.0002750743,0.0007509023,0.00018235954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015654424,0.0001679855,0.0004586523,0.00017638951,0.0001514753,0.00011672963,0.0010432607,0.000087655775,0.00001861106],"category_scores_gemma":[0.000656986,0.00013476772,0.00030259867,0.00045930254,0.0002697019,0.0016189666,0.00014636548,0.00024426563,0.0000014668387],"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.005105482,0.00012557584,0.000036349775,0.000083879095,0.0001100346,0.000008719519,0.0017272537,0.00009067288,0.14079957,0.84936416,0.00020805356,0.0023402546],"study_design_scores_gemma":[0.0016084729,0.003189972,0.000037032467,0.000060543905,0.000022307637,0.00003523096,0.00025051847,0.00022495424,0.1230446,0.8671668,0.004188378,0.00017118252],"about_ca_topic_score_codex":9.0295146e-7,"about_ca_topic_score_gemma":2.1175863e-7,"teacher_disagreement_score":0.59707963,"about_ca_system_score_codex":0.00003874785,"about_ca_system_score_gemma":0.00021889644,"threshold_uncertainty_score":0.5495668},"labels":[],"label_agreement":null},{"id":"W3081477286","doi":"10.1016/j.jcta.2020.105322","title":"All 2-transitive groups have the EKR-module property","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Transitive relation; Coset; Mathematics; Combinatorics; Property (philosophy); Group (periodic table); Graph; Characterization (materials science); Set (abstract data type); Generating set of a group; Discrete mathematics; Geometry; Computer science","score_opus":0.06295965401241103,"score_gpt":0.3081445957368152,"score_spread":0.24518494172440414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081477286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8673721,0.00078775623,0.0074838405,0.06340389,0.008819345,0.0026127945,0.00007661692,0.0002620272,0.04918162],"genre_scores_gemma":[0.99564844,0.00005491763,0.00060254603,0.00087802706,0.0019782125,0.000011680528,0.0000014799112,0.000068075635,0.0007566098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658304,0.0011976565,0.0007530944,0.00019652756,0.0008542035,0.00041545814],"domain_scores_gemma":[0.99655044,0.0017360164,0.00048464575,0.00036179076,0.00059483014,0.0002723003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037241941,0.0002679544,0.00058661547,0.000073700154,0.00021955793,0.0001456076,0.00096620753,0.00013692881,0.00028670314],"category_scores_gemma":[0.0032642654,0.00013841371,0.0003323934,0.00025743386,0.00042918432,0.0005523301,0.0001851974,0.0010216133,0.000030355364],"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.0062700417,0.00020507911,0.000034378612,0.00008507448,0.0003545748,0.0001597289,0.010081542,0.000004613175,0.0023704409,0.97137856,0.008558227,0.0004977083],"study_design_scores_gemma":[0.0017936084,0.0015711056,0.000031538406,0.00006210515,0.00011200093,0.0001621711,0.0041543706,0.000039338072,0.004591681,0.94849485,0.038786046,0.0002011968],"about_ca_topic_score_codex":0.000002702857,"about_ca_topic_score_gemma":0.0000013614467,"teacher_disagreement_score":0.12827635,"about_ca_system_score_codex":0.00009168818,"about_ca_system_score_gemma":0.00020214828,"threshold_uncertainty_score":0.56443477},"labels":[],"label_agreement":null},{"id":"W3093034456","doi":"10.1016/j.jcta.2022.105611","title":"On the Oberwolfach problem for single-flip 2-factors via graceful labelings","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Automorphism; Vertex (graph theory); Discrete mathematics; Path (computing); Multiplicity (mathematics); Graph; Computer science","score_opus":0.010781057771309437,"score_gpt":0.18796648477639918,"score_spread":0.17718542700508974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093034456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808716,0.00045465288,0.000726199,0.00023637175,0.014179464,0.00051288196,0.000029419314,0.0000981544,0.0028912406],"genre_scores_gemma":[0.9991837,0.000006706608,0.000044104127,0.000058053265,0.000389742,0.000047464633,0.0000028411166,0.000055430664,0.00021193827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982492,0.00037425375,0.0005757257,0.0001099708,0.00040310118,0.00028776884],"domain_scores_gemma":[0.99831104,0.0009324797,0.0003036601,0.0002353076,0.0001328139,0.00008472161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023758188,0.00022365757,0.00036015062,0.00012558437,0.0004732623,0.00007546673,0.0005143992,0.00006628539,0.00021382944],"category_scores_gemma":[0.0001701463,0.00015746304,0.00029917643,0.00026981768,0.000071375376,0.00021148704,0.000053259453,0.0005412343,0.000002511778],"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.0011613187,0.0001398589,0.000026040476,0.000045652854,0.00021841786,0.000009590652,0.0018365433,0.0036626987,0.010726137,0.97951424,0.0023167233,0.00034279175],"study_design_scores_gemma":[0.0009878604,0.001744799,0.00000811656,0.00004079177,0.000056051613,0.00011129577,0.002290325,0.000058813897,0.012384062,0.9187776,0.06331789,0.00022241281],"about_ca_topic_score_codex":0.0000011637125,"about_ca_topic_score_gemma":3.0906529e-7,"teacher_disagreement_score":0.061001163,"about_ca_system_score_codex":0.00013743977,"about_ca_system_score_gemma":0.000031230436,"threshold_uncertainty_score":0.64211565},"labels":[],"label_agreement":null},{"id":"W3154325236","doi":"10.1016/j.jcta.2021.105464","title":"On the d-cluster generalization of Erdős-Ko-Rado","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Combinatorics; Conjecture; Mathematics; Intersection (aeronautics); Cluster (spacecraft); Star (game theory); Discrete mathematics; Computer science; Geography; Mathematical analysis","score_opus":0.01749861317644078,"score_gpt":0.26722332841555996,"score_spread":0.24972471523911918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154325236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98136806,0.00032900067,0.0013691622,0.00090435636,0.008513288,0.00017275852,0.000007802377,0.000013787497,0.007321777],"genre_scores_gemma":[0.9975747,0.00007512391,0.0007428023,0.00030032409,0.0006603899,0.0000024720453,8.719201e-7,0.00002515866,0.0006181494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980095,0.00072784,0.0005955843,0.00009084318,0.00043281048,0.0001433955],"domain_scores_gemma":[0.9969737,0.0014691108,0.00062911713,0.00035807915,0.000519004,0.00005101729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534624,0.00014450906,0.00036222435,0.00007045041,0.00018094748,0.000038005204,0.00031890068,0.00010142978,0.00046379465],"category_scores_gemma":[0.0018391376,0.00008531758,0.00024769563,0.00020137668,0.00016368595,0.00015568435,0.000103956525,0.00027004565,8.807259e-7],"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.00072599214,0.0001005188,0.000025702366,0.000035187142,0.00015008899,0.000016909942,0.0011716229,0.00002608673,0.0008291352,0.99296343,0.0037336848,0.00022161583],"study_design_scores_gemma":[0.0007909634,0.00029338067,0.000030885993,0.00008663321,0.00007490113,0.00010329677,0.0005260093,0.0000052798596,0.021538327,0.9718108,0.0046469998,0.000092520815],"about_ca_topic_score_codex":3.1107277e-7,"about_ca_topic_score_gemma":3.9428167e-7,"teacher_disagreement_score":0.021152653,"about_ca_system_score_codex":0.000029745634,"about_ca_system_score_gemma":0.000088758425,"threshold_uncertainty_score":0.50782263},"labels":[],"label_agreement":null},{"id":"W3183769837","doi":"10.1016/j.jcta.2021.105571","title":"MacMahon Partition Analysis: A discrete approach to broken stick problems","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","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":"Université Laval","funders":"","keywords":"Partition (number theory); Fibonacci number; Mathematics; Combinatorics; Diophantine equation; Product (mathematics); Integer (computer science); Discrete mathematics; Computer science; Geometry","score_opus":0.033578059032865294,"score_gpt":0.3069739997334365,"score_spread":0.27339594070057116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183769837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26279357,0.0014122588,0.6846999,0.0006316292,0.03444407,0.0035571626,0.0001269501,0.00036151495,0.011972972],"genre_scores_gemma":[0.9086431,0.00014730163,0.08784333,0.000054139273,0.0023913742,0.0001585615,0.000049038223,0.00019526355,0.00051785936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99365187,0.001088799,0.0024672274,0.0006276501,0.001547234,0.00061724585],"domain_scores_gemma":[0.9923178,0.0010275635,0.0030842386,0.0014532858,0.0016457037,0.000471401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032995092,0.0007977305,0.0027198696,0.000701722,0.00018147302,0.000522455,0.0013507509,0.0006251132,0.000100671874],"category_scores_gemma":[0.0044062915,0.000709468,0.0013371811,0.0012418093,0.00015383831,0.00054140546,0.0012647791,0.0017434143,0.0000054886596],"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.00091165595,0.0010805784,0.000029098555,0.0013282874,0.0039865957,0.00006401826,0.004982145,0.005534988,0.00023651798,0.9811232,0.000598702,0.0001242049],"study_design_scores_gemma":[0.0012478147,0.0005644946,0.000013874498,0.0008932708,0.0040358584,0.00008316937,0.0019012915,0.00019234678,0.0009967869,0.9884237,0.00093956885,0.0007078479],"about_ca_topic_score_codex":0.0000064873093,"about_ca_topic_score_gemma":0.00000423183,"teacher_disagreement_score":0.6458496,"about_ca_system_score_codex":0.0004831212,"about_ca_system_score_gemma":0.000507586,"threshold_uncertainty_score":0.9995356},"labels":[],"label_agreement":null},{"id":"W4320477443","doi":"10.1016/j.jcta.2022.105723","title":"Compositions and parities of complete mappings and of orthomorphisms","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sylow theorems; Mathematics; Combinatorics; Permutation (music); Parity (physics); Group (periodic table); Finite field; Finite group; Discrete mathematics; Physics","score_opus":0.008526302920910316,"score_gpt":0.18838510898220048,"score_spread":0.17985880606129018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320477443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966613,0.00076870626,0.00013121529,0.000041628646,0.0014896501,0.00007029374,0.000039005823,0.000027923683,0.00077028276],"genre_scores_gemma":[0.9994653,0.00032889686,0.000062653555,0.0000036955926,0.00008296517,0.0000015599354,0.0000018300661,0.000012630684,0.00004050754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991581,0.000105582425,0.00044473313,0.000046824538,0.00013887309,0.00010589848],"domain_scores_gemma":[0.9993249,0.00024172125,0.00018281324,0.000086004744,0.000107755826,0.000056760306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006756687,0.00009694229,0.00038396972,0.0001612848,0.000054820546,0.000016242244,0.000090863046,0.000052840904,0.000014620952],"category_scores_gemma":[0.000033913046,0.000088585,0.000068535424,0.00018540121,0.0002620696,0.00017788068,0.000031725158,0.00011735586,4.6565918e-7],"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.0002537313,0.000019227748,0.0005504021,0.00034654132,0.00016467554,0.000012599209,0.001565873,0.00013804888,0.02848753,0.96802384,0.00027539567,0.00016216806],"study_design_scores_gemma":[0.0016107452,0.0006887565,0.003895007,0.0004932618,0.00009257796,0.00028585127,0.0039474866,0.00012221475,0.009947806,0.9720665,0.0066540567,0.00019568685],"about_ca_topic_score_codex":0.0000021689848,"about_ca_topic_score_gemma":5.517421e-7,"teacher_disagreement_score":0.018539725,"about_ca_system_score_codex":0.0000062640866,"about_ca_system_score_gemma":0.0000106864445,"threshold_uncertainty_score":0.36123914},"labels":[],"label_agreement":null},{"id":"W4365140412","doi":"10.1016/j.jcta.2023.105756","title":"Balancing permuted copies of multigraphs and integer matrices","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Permutation (music); Permutation matrix; Graph; Discrete mathematics; Integer (computer science); Integer matrix; Matrix (chemical analysis); Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.0045704480086358095,"score_gpt":0.19753891989771308,"score_spread":0.19296847188907726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365140412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99277174,0.0016315598,0.000100435005,0.000019901823,0.004694972,0.00006936178,0.0000065835043,0.00008206545,0.0006233784],"genre_scores_gemma":[0.99925286,0.00041767408,0.000040033454,0.0000035801622,0.00020863494,0.0000020719888,8.0925514e-7,0.000019840543,0.000054496344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990027,0.00012533528,0.00046631612,0.0000618266,0.00018572199,0.00015808924],"domain_scores_gemma":[0.99921894,0.00029272502,0.00018364444,0.00011027639,0.0001258936,0.000068529975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001031209,0.00013147999,0.00037293826,0.00028335082,0.000054078944,0.000031762662,0.00015902509,0.00007955464,0.000027133006],"category_scores_gemma":[0.00012418997,0.00010841863,0.000114615395,0.00041134784,0.000107225154,0.00030481623,0.000028775112,0.00018133417,0.0000027032684],"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.001100508,0.000055378063,0.0040282733,0.00080867193,0.0006541177,0.000096512966,0.008424527,0.0011430187,0.047985304,0.93153024,0.0019460082,0.0022274249],"study_design_scores_gemma":[0.0035744824,0.0009780689,0.0054264036,0.0009770205,0.00018388843,0.0005113829,0.01789542,0.00062849576,0.044372886,0.9115024,0.013365666,0.00058388367],"about_ca_topic_score_codex":0.0000017854871,"about_ca_topic_score_gemma":7.0770125e-7,"teacher_disagreement_score":0.020027852,"about_ca_system_score_codex":0.000012804108,"about_ca_system_score_gemma":0.00001502925,"threshold_uncertainty_score":0.44211835},"labels":[],"label_agreement":null},{"id":"W4366980112","doi":"10.1016/j.jcta.2023.105763","title":"Nonexistence results of generalized bent functions from <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math> to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.svg\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math>","year":2023,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Education - Singapore; Pacific Institute for the Mathematical Sciences","keywords":"Bent molecular geometry; Function (biology); Scalable Vector Graphics; Mathematics; Combinatorics; Computer science; Algorithm; World Wide Web; Engineering","score_opus":0.021819176248565966,"score_gpt":0.24281523015548215,"score_spread":0.22099605390691618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366980112","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4175214,0.0022723582,0.0025124615,0.0018582845,0.015618746,0.00011950727,0.0012979173,0.0007172427,0.5580821],"genre_scores_gemma":[0.97079366,0.003611731,0.006375574,0.002894892,0.0075778663,0.0028576483,0.0026243655,0.0023579213,0.0009063423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9714503,0.0022971546,0.006683185,0.0048859464,0.007996079,0.0066873217],"domain_scores_gemma":[0.9737627,0.0056050573,0.008453357,0.007284153,0.0009230338,0.00397168],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.009504751,0.0027657025,0.0012691083,0.0024469586,0.005231469,0.005842481,0.009194947,0.00641708,0.72297955],"category_scores_gemma":[0.00499346,0.005489585,0.006984674,0.005372257,0.005349759,0.0059208446,0.0076372437,0.0056115063,0.0045202444],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011189711,0.0008035044,0.000011752381,0.0016577991,0.0055582924,0.0044305827,0.005216871,0.003406281,0.0036610386,0.59685224,0.36531997,0.0018919494],"study_design_scores_gemma":[0.009003526,0.0064477865,0.00013890746,0.003828565,0.006141646,0.006060873,0.0065795304,0.029396938,0.91232264,0.002259238,0.01296074,0.0048595825],"about_ca_topic_score_codex":0.0044082124,"about_ca_topic_score_gemma":0.0028453919,"teacher_disagreement_score":0.9086616,"about_ca_system_score_codex":0.000066486245,"about_ca_system_score_gemma":0.006271224,"threshold_uncertainty_score":0.9993623},"labels":[],"label_agreement":null},{"id":"W4377818744","doi":"10.1016/j.jcta.2023.105769","title":"Integer colorings with forbidden rainbow sums","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"University of Waterloo","funders":"","keywords":"Rainbow; Combinatorics; Mathematics; Hypergraph; Integer (computer science); Context (archaeology); Mathematical proof; Discrete mathematics; Set (abstract data type); Computer science; Physics","score_opus":0.022721699812951343,"score_gpt":0.2807870395833798,"score_spread":0.25806533977042845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377818744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98298717,0.000070754606,0.00017526903,0.0003823734,0.0060345656,0.00020381616,0.0000054670463,0.000111879795,0.010028699],"genre_scores_gemma":[0.99544233,0.000055173034,0.0008769713,0.00006984358,0.00083982025,0.000006246361,9.152538e-7,0.00005313923,0.0026555336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982984,0.00022715586,0.0005285092,0.00013037687,0.0004993058,0.00031622418],"domain_scores_gemma":[0.9976948,0.0010359432,0.0005133303,0.00028807146,0.0003390892,0.00012875033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021440792,0.00021455747,0.000499404,0.00023657814,0.00024870777,0.000069556714,0.0004667307,0.00012359205,0.00015367914],"category_scores_gemma":[0.00076259865,0.00013812316,0.00020338495,0.00045531444,0.0002630821,0.00039683495,0.0001491893,0.00042453903,0.000005901218],"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.0024263505,0.00004355629,0.00020489929,0.000047724832,0.00023089419,0.00013444893,0.0021075958,0.0000049430814,0.00013064216,0.9904899,0.0036363576,0.00054266053],"study_design_scores_gemma":[0.0014849214,0.0009947872,0.00014253728,0.00010771145,0.00008526376,0.00024389816,0.0018071893,0.0000018036512,0.0013916001,0.9701524,0.023405608,0.00018232888],"about_ca_topic_score_codex":6.08681e-7,"about_ca_topic_score_gemma":8.237391e-7,"teacher_disagreement_score":0.020337576,"about_ca_system_score_codex":0.000051054085,"about_ca_system_score_gemma":0.00009245595,"threshold_uncertainty_score":0.5632498},"labels":[],"label_agreement":null},{"id":"W4384574781","doi":"10.1016/j.jcta.2023.105789","title":"Linked partition ideals and a family of quadruple summations","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts; Simons Foundation","keywords":"Extension (predicate logic); Ramanujan's sum; Mathematics; Partition (number theory); Identity (music); Type (biology); Combinatorics; Genealogy; Computer science; History","score_opus":0.04454970790137546,"score_gpt":0.33037692108034683,"score_spread":0.28582721317897136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928299,0.00018193637,0.0024749036,0.00028481492,0.0014951705,0.00019899735,0.000013360363,0.000068124646,0.0024527868],"genre_scores_gemma":[0.99497634,0.00025551126,0.0031821022,0.000010813281,0.00026606183,0.000008784141,0.0000016844599,0.000028030818,0.0012706502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851185,0.00016555702,0.00075849955,0.000072334544,0.0003370776,0.00015466198],"domain_scores_gemma":[0.9972464,0.0015416645,0.00063142675,0.00016419831,0.00034098089,0.00007537058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014917244,0.00011242426,0.00044200197,0.00016886424,0.000082380146,0.00003618366,0.00014316197,0.00007125086,0.000046239005],"category_scores_gemma":[0.0029088221,0.00009496663,0.00011297714,0.0002691866,0.00018091609,0.00049416925,0.00006942474,0.00014996804,0.000006707656],"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.00017344287,0.000069763504,0.000021376718,0.00018654573,0.00006221367,0.000009609156,0.0011381599,0.0000070935225,0.0036911306,0.9934175,0.0011410727,0.0000821039],"study_design_scores_gemma":[0.0006774594,0.0002592951,0.00016591352,0.0001896829,0.000070684386,0.000024464427,0.0028091809,0.000015726993,0.0025878318,0.99245954,0.0006539509,0.00008626285],"about_ca_topic_score_codex":0.0000012180851,"about_ca_topic_score_gemma":0.0000010148493,"teacher_disagreement_score":0.0021464564,"about_ca_system_score_codex":0.000025488982,"about_ca_system_score_gemma":0.000051534487,"threshold_uncertainty_score":0.38726267},"labels":[],"label_agreement":null},{"id":"W4386351978","doi":"10.1016/j.jcta.2023.105803","title":"Constructing uniform 2-factorizations via row-sum matrices: Solutions to the Hamilton-Waterloo problem","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Agencia Nacional de Promoción Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Agencia Nacional de Promoción de la Investigación, el Desarrollo Tecnológico y la Innovación; Universidad Nacional de San Luis; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Dihedral group; Mathematics; Combinatorics; Cayley graph; Factorization; Abelian group; Group (periodic table); Matrix (chemical analysis); Construct (python library); Spectrum (functional analysis); Discrete mathematics; Computer science; Algorithm; Graph","score_opus":0.00954778292910096,"score_gpt":0.2026864869044561,"score_spread":0.19313870397535512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386351978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86014336,0.0009035937,0.046808522,0.001458744,0.06847076,0.0015666388,0.00014482126,0.0013407301,0.019162802],"genre_scores_gemma":[0.99828917,0.000076332726,0.00020520278,0.000019976005,0.00096104975,0.000018886105,0.000006285231,0.000044535853,0.00037857253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834037,0.00020197997,0.00064979855,0.00010133621,0.00031056014,0.0003959612],"domain_scores_gemma":[0.998887,0.00028256912,0.00020236066,0.0002540653,0.00022613333,0.00014786117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016510009,0.00019925775,0.0003148593,0.00027362452,0.0004180284,0.00014139737,0.00045557113,0.000102118895,0.000051867188],"category_scores_gemma":[0.000096658514,0.00014365456,0.00016942121,0.0011124677,0.00008914566,0.00048181662,0.0000595132,0.00034229257,0.000058167723],"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.00011211331,0.000022231981,0.0001266755,0.00007119165,0.000213801,0.000017891354,0.0044143265,0.008485109,0.001658132,0.9815507,0.0021928912,0.0011349716],"study_design_scores_gemma":[0.0010534425,0.00041672742,0.00009161789,0.00026426814,0.00013806824,0.00044429203,0.014592681,0.0006008148,0.0035309913,0.87319064,0.10520571,0.00047073737],"about_ca_topic_score_codex":0.000004926742,"about_ca_topic_score_gemma":0.00000999421,"teacher_disagreement_score":0.13814577,"about_ca_system_score_codex":0.00010568454,"about_ca_system_score_gemma":0.000049510905,"threshold_uncertainty_score":0.5858063},"labels":[],"label_agreement":null},{"id":"W4386500718","doi":"10.1016/j.jcta.2023.105813","title":"Improved Elekes-Szabó type estimates using proximity","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"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; Nemzeti Kutatási és Technológiai Hivatal; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Cartesian product; Exponent; Intersection (aeronautics); Type (biology); Polynomial; Cardinality (data modeling); Product (mathematics); Algebraic number; Plane (geometry); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.05845199783888051,"score_gpt":0.3352890917572425,"score_spread":0.276837093918362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386500718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901337,0.00027984302,0.0016671396,0.00015170981,0.006605363,0.00017939671,0.000008157323,0.00012002616,0.0008546334],"genre_scores_gemma":[0.992668,0.0001010485,0.005136024,0.000030391566,0.0012014736,0.0000026854825,0.0000015929903,0.000048674057,0.00081014796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837035,0.00013472821,0.00067796715,0.000114594164,0.0003727537,0.00032958854],"domain_scores_gemma":[0.9972647,0.0010814336,0.0006461301,0.00020450188,0.00070329534,0.00009992683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024729364,0.00018779853,0.0005039697,0.00031510327,0.00016270611,0.000103738595,0.0003044628,0.000112290705,0.00010581365],"category_scores_gemma":[0.006024694,0.00014632697,0.00016010112,0.0010437398,0.00009158358,0.00068724534,0.000108195534,0.0002788089,0.0000071883574],"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.001247426,0.00013024233,0.00010820943,0.00032663872,0.00019651999,0.000055456476,0.00095348025,0.00001595376,0.003679805,0.9915576,0.0011548526,0.0005738103],"study_design_scores_gemma":[0.0007896944,0.00068661914,0.00002379534,0.000097061726,0.0000916915,0.00012446493,0.001060486,0.00022175304,0.0076286322,0.98676115,0.002337959,0.00017667317],"about_ca_topic_score_codex":0.0000047458097,"about_ca_topic_score_gemma":4.5410206e-7,"teacher_disagreement_score":0.0054038893,"about_ca_system_score_codex":0.00006882267,"about_ca_system_score_gemma":0.00022295506,"threshold_uncertainty_score":0.72125566},"labels":[],"label_agreement":null},{"id":"W4387793828","doi":"10.1016/j.jcta.2023.105828","title":"Non-expansive matrix number systems with bases similar to certain Jordan blocks","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","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; Expansive; Dimension (graph theory); Numerical digit; Eigenvalues and eigenvectors; Matrix (chemical analysis); Block (permutation group theory); Set (abstract data type); Base (topology); Context (archaeology); Jordan matrix; Logarithm; Combinatorics; Arithmetic; Representation (politics); Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.006912436830327222,"score_gpt":0.24505233938173857,"score_spread":0.23813990255141135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387793828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94073117,0.00023799246,0.035495073,0.0028386256,0.017019741,0.0006357563,0.00001840807,0.00037872145,0.002644502],"genre_scores_gemma":[0.9946878,0.000028270626,0.0027054413,0.00024180129,0.0009877429,0.000015057427,0.0000015518625,0.000038362887,0.0012939986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977039,0.00026631763,0.0005899147,0.00027348733,0.0007058461,0.00046051067],"domain_scores_gemma":[0.9977029,0.0005101451,0.00044916786,0.0005607813,0.00047786825,0.0002991126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018303848,0.00027896705,0.0005636039,0.0002612268,0.00021908313,0.0003931971,0.0012751848,0.00009551623,0.000052377527],"category_scores_gemma":[0.00018555524,0.00020514916,0.000159653,0.0011055061,0.000087058055,0.0009513305,0.00028598742,0.00028651697,0.00007995782],"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.0010602457,0.00013253083,0.0003459906,0.000058544705,0.00021185202,0.0010171146,0.002748731,0.002104456,0.0013652871,0.97398275,0.016225277,0.000747243],"study_design_scores_gemma":[0.004806471,0.00440045,0.0006332778,0.0009965554,0.0001300548,0.0021946456,0.008041244,0.0026584412,0.011014743,0.89561176,0.06827416,0.0012381985],"about_ca_topic_score_codex":0.000013578574,"about_ca_topic_score_gemma":8.6981504e-7,"teacher_disagreement_score":0.07837097,"about_ca_system_score_codex":0.000082247236,"about_ca_system_score_gemma":0.00022355978,"threshold_uncertainty_score":0.836574},"labels":[],"label_agreement":null},{"id":"W4387924186","doi":"10.1016/j.jcta.2023.105829","title":"A bivariate Q-polynomial structure for the non-binary Johnson scheme","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Mathematics; Univariate; Association scheme; Bivariate analysis; Polynomial; Binary number; Scheme (mathematics); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Multivariate statistics; Mathematical analysis; Statistics; Arithmetic","score_opus":0.020019275015350186,"score_gpt":0.3032173558796922,"score_spread":0.283198080864342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387924186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710077,0.0004396708,0.004984164,0.0017626177,0.020562453,0.000683833,0.00006316559,0.000092198774,0.00040416958],"genre_scores_gemma":[0.9906576,0.00014601847,0.0032999318,0.00009534157,0.004417155,0.000016156531,0.0000040410264,0.00007202856,0.0012916708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848086,0.0001106043,0.0005726053,0.0001359283,0.00035750234,0.00034251402],"domain_scores_gemma":[0.99637485,0.0023267688,0.00060406514,0.00031608602,0.00028231254,0.00009595029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014089474,0.0002157951,0.00045826338,0.00018603473,0.0003261627,0.0000746992,0.0005135031,0.00014706116,0.000119673954],"category_scores_gemma":[0.0017689713,0.0001363602,0.00030217992,0.00054050196,0.0001279288,0.00037934002,0.00011986005,0.0004137596,0.0000068293916],"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.0036479635,0.00008128089,0.000029346667,0.0001080872,0.0003513897,0.000038231963,0.00089206256,0.000060301536,0.0066824066,0.95486695,0.031775825,0.0014661805],"study_design_scores_gemma":[0.0021131937,0.0006361899,0.000112346286,0.000057280915,0.00010251682,0.000062235806,0.00082886766,0.00007819692,0.0033763242,0.9575055,0.03496207,0.0001652522],"about_ca_topic_score_codex":4.67143e-7,"about_ca_topic_score_gemma":5.3987003e-7,"teacher_disagreement_score":0.01964993,"about_ca_system_score_codex":0.000052234325,"about_ca_system_score_gemma":0.00013339319,"threshold_uncertainty_score":0.5560608},"labels":[],"label_agreement":null},{"id":"W4389087156","doi":"10.1016/j.jcta.2023.105834","title":"The second-order football-pool problem and the optimal rate of generalized-covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","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":"Order (exchange); Mathematics; Code (set theory); Property (philosophy); Function (biology); Football; Combinatorics; Discrete mathematics; Computer science; Law","score_opus":0.00764930142739302,"score_gpt":0.2229173974703567,"score_spread":0.21526809604296368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389087156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9651912,0.0013518883,0.02047717,0.0034910305,0.006418256,0.0004141178,0.000005903986,0.00010207874,0.0025483684],"genre_scores_gemma":[0.99704844,0.0005255577,0.00144626,0.000117731455,0.00030385525,0.000010995562,2.6031242e-7,0.000014947054,0.0005319846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979597,0.0008604289,0.0005262203,0.00013657253,0.00026374226,0.00025337658],"domain_scores_gemma":[0.9971603,0.0016098891,0.0005310578,0.000349032,0.00028820036,0.000061484134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063620145,0.00015467856,0.00033967916,0.00010430883,0.00044940368,0.00030815415,0.0010544903,0.000054781318,0.000013599582],"category_scores_gemma":[0.0002684452,0.000084099855,0.00019369106,0.00064062607,0.00051859,0.00057166925,0.00037621497,0.00027300633,0.0000014843642],"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.0015877351,0.000018746014,0.000018737446,0.000019086014,0.00015582357,0.000009869715,0.0014092749,0.00018658493,0.0010955831,0.99328214,0.0003181551,0.0018982553],"study_design_scores_gemma":[0.0020663121,0.00036991705,0.00008399878,0.000040574458,0.000027199421,0.00007134095,0.00040607317,0.00041407338,0.004197837,0.97891957,0.013292293,0.00011083013],"about_ca_topic_score_codex":0.0000017726214,"about_ca_topic_score_gemma":0.0000016059045,"teacher_disagreement_score":0.031857222,"about_ca_system_score_codex":0.000011181323,"about_ca_system_score_gemma":0.00009427888,"threshold_uncertainty_score":0.3456495},"labels":[],"label_agreement":null},{"id":"W4392071666","doi":"10.1016/j.jcta.2024.105874","title":"Two conjectures of Andrews, Merca and Yee on truncated theta series","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":15,"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":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Mathematics; Series (stratigraphy); Euler's formula; Combinatorics; Truncation (statistics); Partition (number theory); Integer (computer science); Number theory; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.019932076860667645,"score_gpt":0.3163920103492939,"score_spread":0.2964599334886262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392071666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95762724,0.005596275,0.0010244688,0.0010366655,0.009047057,0.00056084694,0.000049757607,0.00019007506,0.024867618],"genre_scores_gemma":[0.9946303,0.0003356853,0.0016808158,0.000018777544,0.0004606233,0.000004220866,7.6232413e-7,0.000052720818,0.0028160978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983178,0.00021166728,0.0007242037,0.00013686619,0.00042105812,0.00018840563],"domain_scores_gemma":[0.9974607,0.0016156007,0.00037422797,0.00022397695,0.00023586617,0.00008958423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010738017,0.00022583104,0.0006591572,0.00017503551,0.000075662014,0.000112975395,0.00022329493,0.00009144927,0.0001702381],"category_scores_gemma":[0.0015002167,0.00015820943,0.00017188658,0.0001738043,0.00040145716,0.0006097321,0.00008096157,0.00034625025,0.000003370676],"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.0010280212,0.00009649733,0.000004585669,0.00042534672,0.00023587208,0.00005760096,0.0018080355,0.000004484482,0.0022841636,0.99296653,0.00089425955,0.00019457286],"study_design_scores_gemma":[0.00080962037,0.00094678946,0.0000075427924,0.0005568869,0.0001635016,0.00029929748,0.001620935,0.0000048875463,0.026257616,0.9666007,0.0025831286,0.00014906058],"about_ca_topic_score_codex":0.0000013621981,"about_ca_topic_score_gemma":0.0000016970527,"teacher_disagreement_score":0.037003063,"about_ca_system_score_codex":0.000040762887,"about_ca_system_score_gemma":0.000089037945,"threshold_uncertainty_score":0.6451593},"labels":[],"label_agreement":null},{"id":"W4392947762","doi":"10.1016/j.jcta.2024.105887","title":"Extremal Peisert-type graphs without the strict-EKR property","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","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":"University of British Columbia","funders":"","keywords":"Type (biology); Property (philosophy); Combinatorics; Mathematics; Philosophy; Geology; Epistemology; Paleontology","score_opus":0.01369679362650714,"score_gpt":0.23965393686259145,"score_spread":0.22595714323608432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392947762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6457387,0.020381995,0.106117666,0.015564479,0.1686109,0.0015008468,0.000011210232,0.0013572726,0.0407169],"genre_scores_gemma":[0.9974547,0.00017596927,0.0007126275,0.00013822805,0.00077500026,0.0000038423027,2.6167405e-7,0.000020099556,0.00071924547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772155,0.00072929956,0.00048717955,0.0002289263,0.0005338332,0.0002991961],"domain_scores_gemma":[0.9982501,0.00057263375,0.00021948543,0.00050935,0.00031827236,0.00013011969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033594568,0.00022352929,0.00031093333,0.0002459102,0.00030747108,0.00069241814,0.001615484,0.00008673769,0.00007825563],"category_scores_gemma":[0.00026028318,0.00010974592,0.0003432516,0.0012211335,0.00022964556,0.0013060436,0.000231777,0.00057736196,0.000015154063],"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.0007779743,0.00007053662,0.000102105405,0.000022585518,0.00014420057,0.000093533105,0.0012243512,0.000007654913,0.0006110376,0.98349553,0.001957929,0.011492535],"study_design_scores_gemma":[0.00037037657,0.0010125535,0.000116826195,0.00011750947,0.000054069962,0.00033560424,0.00020899698,0.0001337541,0.0009092675,0.8817655,0.114799924,0.0001756283],"about_ca_topic_score_codex":0.0000019446204,"about_ca_topic_score_gemma":4.4524037e-7,"teacher_disagreement_score":0.351716,"about_ca_system_score_codex":0.000034570276,"about_ca_system_score_gemma":0.00026695812,"threshold_uncertainty_score":0.6677004},"labels":[],"label_agreement":null},{"id":"W4398195493","doi":"10.1016/j.jcta.2024.105910","title":"Power-free complementary binary morphisms","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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 Waterloo","funders":"","keywords":"Morphism; Binary number; Power (physics); Mathematics; Computer science; Arithmetic; Pure mathematics; Physics; Thermodynamics","score_opus":0.008167672429959087,"score_gpt":0.2369642211132666,"score_spread":0.2287965486833075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398195493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508463,0.027223716,0.20836875,0.029511178,0.19374266,0.00087223604,0.00010258851,0.0016791227,0.030036721],"genre_scores_gemma":[0.9918429,0.00011336027,0.006197056,0.00040066833,0.0010307549,0.0000032476917,0.0000018396719,0.0000315954,0.00037853027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796635,0.00030111155,0.00062589836,0.00023176134,0.00056145363,0.00031345023],"domain_scores_gemma":[0.99834174,0.00045342668,0.0002305557,0.00066613784,0.00014730913,0.00016085053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020726563,0.00022027896,0.0003645747,0.00027495678,0.00014438338,0.00043007414,0.002128074,0.00007378833,0.0004199086],"category_scores_gemma":[0.00011647255,0.00017432841,0.00027503815,0.000474147,0.00013959687,0.0019590075,0.0006043437,0.00039531424,0.000032947908],"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.00017483415,0.00008702103,0.000008481797,0.000024268225,0.00012594377,0.0006602817,0.00081780786,0.0000087126,0.0019743843,0.97160804,0.021047285,0.0034629437],"study_design_scores_gemma":[0.0007323197,0.0010341586,0.000057185225,0.00014439532,0.000022323517,0.0006754752,0.00030290792,0.00022961454,0.0019840722,0.880281,0.114342846,0.00019373036],"about_ca_topic_score_codex":0.0000020636267,"about_ca_topic_score_gemma":1.4358105e-7,"teacher_disagreement_score":0.48337993,"about_ca_system_score_codex":0.0000913192,"about_ca_system_score_gemma":0.00018884076,"threshold_uncertainty_score":0.71089065},"labels":[],"label_agreement":null},{"id":"W4402795462","doi":"10.1016/j.jcta.2024.105953","title":"On the proportion of metric matroids whose Jacobians have nontrivial p-torsion","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Matroid; Torsion (gastropod); Metric (unit); Combinatorics; Pure mathematics; Discrete mathematics; Surgery","score_opus":0.011077114220522991,"score_gpt":0.2752186489763287,"score_spread":0.2641415347558057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402795462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6769652,0.0026733323,0.28675854,0.003977661,0.024635144,0.0010069006,0.000015249616,0.00017382191,0.003794179],"genre_scores_gemma":[0.9981331,0.00009911898,0.0008258288,0.000035077002,0.00048477392,0.0000055874098,3.6865634e-7,0.000020028938,0.00039609228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702334,0.0006750071,0.0006378863,0.0002078593,0.0011659939,0.00028991554],"domain_scores_gemma":[0.99729145,0.001194575,0.00040310007,0.00047940467,0.0005223106,0.00010918206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004421265,0.00017979852,0.0003425747,0.0005943761,0.00016818439,0.00021402078,0.0012200539,0.00009276011,0.00006423306],"category_scores_gemma":[0.0011149374,0.00010883164,0.0002970166,0.001207709,0.00024889523,0.0010727604,0.00021474785,0.00062716583,0.000012757431],"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.0008678446,0.00012332732,0.000018802368,0.00003162962,0.00007955245,0.00008893152,0.00060009817,0.000059449696,0.0026377565,0.98968977,0.00063472264,0.00516814],"study_design_scores_gemma":[0.00050015067,0.0021762692,0.000052713858,0.00017371344,0.000023291246,0.000119763536,0.00018280248,0.0003169749,0.029966665,0.9618416,0.0045286627,0.00011742495],"about_ca_topic_score_codex":0.0000015295958,"about_ca_topic_score_gemma":3.474217e-7,"teacher_disagreement_score":0.32116795,"about_ca_system_score_codex":0.00012708138,"about_ca_system_score_gemma":0.0002491505,"threshold_uncertainty_score":0.44380254},"labels":[],"label_agreement":null},{"id":"W4403418439","doi":"10.1016/j.jcta.2024.105964","title":"Indecomposable combinatorial games","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Memorial University of Newfoundland; University of New Brunswick","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Indecomposable module; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.01376293463604206,"score_gpt":0.27344592975974574,"score_spread":0.2596829951237037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403418439","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19095892,0.013049259,0.3240998,0.0083330525,0.425131,0.0008036588,0.000012715162,0.001218865,0.036392715],"genre_scores_gemma":[0.9933227,0.00014520851,0.0031664683,0.00009629751,0.002670382,0.000004535189,4.594326e-7,0.00003083284,0.00056317553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973175,0.00036156364,0.0008963513,0.00028785734,0.00073891593,0.00039782957],"domain_scores_gemma":[0.99771386,0.0008352774,0.00032107142,0.00047799686,0.0004461945,0.00020558444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023798388,0.0002572736,0.00047266198,0.0003340331,0.0001607922,0.0009346543,0.0017256364,0.00016127186,0.00016244147],"category_scores_gemma":[0.0005116262,0.00021223481,0.00031839486,0.0007276798,0.00022629334,0.0027468004,0.00030960946,0.00062447536,0.000100329584],"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.00020692725,0.000105566556,0.0000322334,0.000025156929,0.00010784622,0.00024241733,0.0012764771,0.000041351766,0.0007384025,0.9792469,0.0045396946,0.013436997],"study_design_scores_gemma":[0.00023661398,0.00075458694,0.000011985123,0.00013154358,0.000023600316,0.0002979633,0.00021842867,0.00040562416,0.020061191,0.84712625,0.13052455,0.0002076928],"about_ca_topic_score_codex":0.000004619429,"about_ca_topic_score_gemma":4.871732e-7,"teacher_disagreement_score":0.8023637,"about_ca_system_score_codex":0.00014531784,"about_ca_system_score_gemma":0.00047921698,"threshold_uncertainty_score":0.9012893},"labels":[],"label_agreement":null},{"id":"W4406510177","doi":"10.1016/j.jcta.2025.106009","title":"There are no good infinite families of toric codes","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.00604794033340711,"score_gpt":0.22289110269807988,"score_spread":0.21684316236467277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406510177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661598,0.0061236178,0.06662445,0.001512481,0.04965857,0.0004420092,0.000020840554,0.00023305228,0.1092252],"genre_scores_gemma":[0.9977208,0.00025034082,0.0012524573,0.0000965509,0.0002734817,0.0000023117395,2.131762e-7,0.0000076011534,0.00039624717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983541,0.00040443405,0.0005828853,0.00014336349,0.00031936873,0.00019588222],"domain_scores_gemma":[0.99759716,0.0006480746,0.00065574335,0.00042913712,0.00060330384,0.00006658844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014605151,0.00017328032,0.0004725375,0.00032951336,0.00013740791,0.00010705314,0.0012012395,0.00009570107,0.000032673386],"category_scores_gemma":[0.0003815034,0.00013977676,0.00028507662,0.0006787894,0.00018281498,0.00067780446,0.0002337776,0.00027454772,0.000003551899],"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.0006607595,0.00014183206,0.0011049935,0.000052546424,0.0001534913,0.000015029333,0.00056547136,0.000011933758,0.0007247348,0.9930941,0.00048969575,0.0029854039],"study_design_scores_gemma":[0.0009145516,0.00072955794,0.001188162,0.00025534,0.000038381546,0.00001758108,0.000519427,0.000009498413,0.0048859008,0.9476683,0.043636102,0.00013717638],"about_ca_topic_score_codex":0.0000026506368,"about_ca_topic_score_gemma":9.4812765e-7,"teacher_disagreement_score":0.23156102,"about_ca_system_score_codex":0.000029729556,"about_ca_system_score_gemma":0.00015551422,"threshold_uncertainty_score":0.5699931},"labels":[],"label_agreement":null},{"id":"W4409135004","doi":"10.1016/j.jcta.2025.106048","title":"A central limit theorem for a card shuffling problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematics and Applications","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":"Dalhousie University","funders":"","keywords":"Shuffling; Mathematics; Limit (mathematics); Central limit theorem; Combinatorics; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.022667238971362594,"score_gpt":0.3050294632365724,"score_spread":0.2823622242652098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409135004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22769885,0.0015916425,0.65116096,0.009032634,0.013997788,0.0050416077,0.00009463405,0.00028047047,0.09110143],"genre_scores_gemma":[0.9220262,0.00006417786,0.0732201,0.00012646355,0.001102991,0.000104505,0.0000021295184,0.000054018557,0.0032993848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866897,0.000090232,0.0006847196,0.00010594637,0.00020022043,0.00024991477],"domain_scores_gemma":[0.99758875,0.0011955962,0.0004991614,0.00024685203,0.00039085274,0.00007878396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014863717,0.00015204487,0.00043593987,0.0001043484,0.00016831262,0.00008623108,0.00034385745,0.00008958671,0.000030437019],"category_scores_gemma":[0.00092682964,0.000118924254,0.0002841624,0.00018347504,0.00007404255,0.00014023288,0.00005316862,0.0001937306,6.956223e-7],"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.00041958143,0.00020985519,0.000009977553,0.00022107948,0.00016609268,0.0000017110623,0.0008689027,0.000007366101,0.00033688857,0.9852287,0.011924567,0.00060524046],"study_design_scores_gemma":[0.0010861261,0.00019407869,0.0000025117868,0.00021370388,0.00015991296,0.000017963283,0.00075052585,0.000038718295,0.0023744653,0.9306127,0.064445965,0.00010334898],"about_ca_topic_score_codex":5.362946e-7,"about_ca_topic_score_gemma":7.2663545e-7,"teacher_disagreement_score":0.69432735,"about_ca_system_score_codex":0.00006923481,"about_ca_system_score_gemma":0.00019394394,"threshold_uncertainty_score":0.48495904},"labels":[],"label_agreement":null},{"id":"W4411244456","doi":"10.1016/j.jcta.2025.106080","title":"Avoiding short progressions in Euclidean Ramsey theory","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Euclidean geometry; Ramsey theory; Combinatorics; Mathematics education; Discrete mathematics; Geometry","score_opus":0.01897258231165641,"score_gpt":0.3221627856217802,"score_spread":0.3031902033101238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411244456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96308243,0.0012022449,0.0014029414,0.00029045035,0.011510691,0.0003785001,0.000004476746,0.00005911368,0.022069132],"genre_scores_gemma":[0.9974463,0.000107336615,0.0011132319,0.0000929344,0.0004411256,0.000007725554,5.2887674e-7,0.000029846591,0.0007609593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964087,0.0016889626,0.0010088626,0.00017758334,0.0003703489,0.00034551392],"domain_scores_gemma":[0.99601126,0.0029015527,0.00037348873,0.00036147176,0.00024762453,0.000104604806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076943655,0.00025770598,0.0006488082,0.00044464588,0.00046347422,0.00007788981,0.0006325813,0.00020907001,0.0001241377],"category_scores_gemma":[0.0040804483,0.0001889123,0.000292859,0.00048392193,0.0002831317,0.00038314235,0.0002441694,0.0011496239,7.505176e-7],"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.0019766022,0.0001866448,0.0007761546,0.000069412716,0.00016937655,0.00009324406,0.00196081,0.0000036056774,0.00026864774,0.9887892,0.00067399663,0.0050323023],"study_design_scores_gemma":[0.0011043773,0.00021384866,0.00026797864,0.000586066,0.000094645155,0.00009708182,0.0028467316,0.0000021168019,0.0026438364,0.9876605,0.0043004155,0.0001823702],"about_ca_topic_score_codex":4.864343e-7,"about_ca_topic_score_gemma":0.0000010389451,"teacher_disagreement_score":0.034363862,"about_ca_system_score_codex":0.00010513334,"about_ca_system_score_gemma":0.00016610912,"threshold_uncertainty_score":0.77036196},"labels":[],"label_agreement":null},{"id":"W4412992705","doi":"10.1016/j.jcta.2025.106096","title":"The existence of m-Haar graphical representations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Homotopy and Cohomology in Algebraic Topology","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":"Ministry of Education and Child Care","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Mathematics; Haar; Combinatorics; Algebra over a field; Pure mathematics; Artificial intelligence","score_opus":0.016198755691314237,"score_gpt":0.323305856646236,"score_spread":0.3071071009549218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412992705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350267,0.0011240954,0.0031362898,0.007319927,0.016249197,0.0003156072,0.000004645586,0.000035820627,0.03678768],"genre_scores_gemma":[0.9974666,0.00014988297,0.00073716487,0.000059175367,0.00018721218,0.000005542941,1.6553396e-7,0.000006891494,0.001387351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983262,0.0005754679,0.00067734567,0.000077947356,0.00019246497,0.00015060643],"domain_scores_gemma":[0.9955443,0.0032810625,0.0004922042,0.0003104633,0.00033275463,0.000039172122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017759905,0.000091619135,0.00032505643,0.000093572526,0.00021402689,0.000018332341,0.00047602766,0.000116070274,0.00005429805],"category_scores_gemma":[0.0032771549,0.00005985392,0.00018842082,0.0002665181,0.0008170106,0.00011049595,0.00008045584,0.0003284999,8.483043e-7],"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.0007644477,0.00008281827,0.0002155912,0.00001802048,0.00017631808,0.00001652977,0.00035536944,5.3436065e-7,0.00024586057,0.99631065,0.0013761299,0.00043775295],"study_design_scores_gemma":[0.0006201232,0.00031006365,0.00020784515,0.00004101947,0.00008452769,0.00010002045,0.001221951,7.546502e-7,0.0037171815,0.9874127,0.0062366943,0.000047153542],"about_ca_topic_score_codex":0.0000017828539,"about_ca_topic_score_gemma":0.000002689556,"teacher_disagreement_score":0.062439878,"about_ca_system_score_codex":0.000024115963,"about_ca_system_score_gemma":0.00020234026,"threshold_uncertainty_score":0.39232972},"labels":[],"label_agreement":null}]}