{"meta":{"query_hash":"87e7fe313859","filters":{"venue":"The Electronic Journal of Combinatorics"},"cohort_total":477,"direct_labels_cover":1,"predictions_cover":477,"exported":477,"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/87e7fe313859","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Electronic+Journal+of+Combinatorics"},"results":[{"id":"W1479790588","doi":"10.37236/583","title":"On Variants of Conway and Conolly's Meta-Fibonacci Recursions","year":2011,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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":"University of Toronto","funders":"","keywords":"Fibonacci number; Combinatorics; Monotonic function; Integer (computer science); Recursion (computer science); Mathematics; Sequence (biology); Physics; Algorithm; Mathematical analysis; Chemistry","score_opus":0.025882670816511837,"score_gpt":0.240042085165349,"score_spread":0.21415941434883717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479790588","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.3571882,0.0938312,0.5228295,0.0060319817,0.00821049,0.0013720469,0.000030096931,0.0001695583,0.01033692],"genre_scores_gemma":[0.99666035,0.0027779236,0.00022009305,0.00013916563,0.000045800905,0.0000054474367,6.7825533e-7,0.000019521896,0.00013103857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765533,0.0004067201,0.00071313285,0.0002713877,0.0004815935,0.000471831],"domain_scores_gemma":[0.9964186,0.0007065315,0.0014968212,0.00095089275,0.00031885304,0.00010830779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027077629,0.00030515532,0.00088627666,0.00021671162,0.00011140991,0.00008101757,0.0024833493,0.00019541763,0.000025131127],"category_scores_gemma":[0.00016033155,0.00018872831,0.0003724781,0.0002474578,0.00011790179,0.00016928585,0.0008112731,0.0016863762,0.0000035657747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036759324,0.00015764819,0.000005331471,0.00002303205,0.0010503314,0.000009651917,0.00041898884,0.000043585653,0.000064692635,0.9966713,0.00049968885,0.0010189979],"study_design_scores_gemma":[0.0005274989,0.0007697893,0.0001267812,0.00009803859,0.00059632544,0.00017555567,0.000022825248,0.0005034098,0.0014333712,0.9950064,0.00055542705,0.00018460467],"about_ca_topic_score_codex":0.000016187363,"about_ca_topic_score_gemma":0.000001203266,"teacher_disagreement_score":0.6394721,"about_ca_system_score_codex":0.00014233023,"about_ca_system_score_gemma":0.00081971596,"threshold_uncertainty_score":0.7696117},"labels":[],"label_agreement":null},{"id":"W1486890707","doi":"10.37236/199","title":"Composition of Transpositions and Equality of Ribbon Schur $Q$-Functions","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"University of British Columbia","funders":"","keywords":"Mathematics; Skew; Schur's lemma; Combinatorics; Schur's theorem; Ribbon; Diagram; Eulerian path; Schur algebra; Substitution (logic); Irreducibility; Pure mathematics; Discrete mathematics; Orthogonal polynomials; Geometry; Lagrangian; Gegenbauer polynomials; Computer science","score_opus":0.020457352553924914,"score_gpt":0.3009647153715366,"score_spread":0.2805073628176117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486890707","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.8358021,0.0011569271,0.16111529,0.00069728284,0.0002625868,0.00023612737,0.0000069233056,0.000019497222,0.0007032752],"genre_scores_gemma":[0.9990538,0.0002790566,0.0005588752,0.000014408791,0.000041242765,0.0000014018659,0.0000010670597,0.000014091272,0.000036109454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810666,0.00018340936,0.00089104654,0.00008494842,0.00045288677,0.00028106503],"domain_scores_gemma":[0.9972862,0.0008010406,0.001043294,0.00030150023,0.00050746877,0.000060476978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452452,0.000153377,0.000504109,0.00012390684,0.00011619655,0.000010003675,0.0002948141,0.0000821509,0.000005817411],"category_scores_gemma":[0.00022408238,0.00011592264,0.00016404047,0.0003949855,0.00011868962,0.00017552501,0.000018085468,0.00051581406,4.6210855e-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.000097203214,0.0006139188,0.000022116157,0.00007363259,0.000084897154,8.2675064e-7,0.00053298235,0.00003071398,0.008545097,0.9896487,0.00005782175,0.0002921156],"study_design_scores_gemma":[0.0011183103,0.0013479814,0.00017415955,0.00012465792,0.00027733887,0.00010068604,0.00019140617,0.00006394354,0.01453015,0.9818961,0.000077193654,0.00009809325],"about_ca_topic_score_codex":0.000002061159,"about_ca_topic_score_gemma":0.0000011397173,"teacher_disagreement_score":0.16325167,"about_ca_system_score_codex":0.00015349765,"about_ca_system_score_gemma":0.00017469971,"threshold_uncertainty_score":0.4727188},"labels":[],"label_agreement":null},{"id":"W1488677252","doi":"10.37236/1972","title":"A Note on Graphs Without Short Even Cycles","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","score_opus":0.01295528252795957,"score_gpt":0.29942992678122426,"score_spread":0.2864746442532647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488677252","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.37257332,0.004471406,0.60938513,0.009037843,0.0006676122,0.00035276543,7.096546e-7,0.0001060671,0.0034051645],"genre_scores_gemma":[0.9984826,0.0005540456,0.0003993925,0.00021921533,0.000099977435,0.0000032637186,1.153764e-7,0.000018394328,0.00022298815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974954,0.00026571483,0.00037713847,0.00018204903,0.0009056753,0.0007740036],"domain_scores_gemma":[0.9984031,0.00035727353,0.00020778955,0.00064300676,0.00025883396,0.00013003044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020885046,0.00017507485,0.0002585238,0.00026402174,0.00021677125,0.00008258622,0.0024228292,0.000057130852,0.000004266757],"category_scores_gemma":[0.00011889095,0.00011482433,0.00017894268,0.0008196352,0.00010040528,0.00049505907,0.00015630209,0.0012498285,0.000024154533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006732252,0.00013041362,0.00019963093,0.0000023388352,0.000044029668,0.0000083229825,0.000231898,0.00055126956,0.00040801862,0.98229146,0.00016788639,0.015897434],"study_design_scores_gemma":[0.0005275994,0.0009071783,0.000410687,0.000024494337,0.000012417971,0.00023910608,0.000016850809,0.0020669382,0.0047590053,0.98446906,0.0064201765,0.00014648978],"about_ca_topic_score_codex":9.499128e-7,"about_ca_topic_score_gemma":0.0000044282447,"teacher_disagreement_score":0.62590927,"about_ca_system_score_codex":0.0003756891,"about_ca_system_score_gemma":0.00040442732,"threshold_uncertainty_score":0.5429952},"labels":[],"label_agreement":null},{"id":"W1489392556","doi":"10.37236/472","title":"Random Subnetworks of Random Sorting Networks","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":12,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Subnetwork; Conjecture; Random graph; Sorting; Sorting network; Discrete mathematics; Graph; Sorting algorithm; Algorithm; Computer science","score_opus":0.011373354219958231,"score_gpt":0.273471849388716,"score_spread":0.2620984951687578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489392556","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.053991564,0.0015766234,0.94246924,0.00019014654,0.0011279063,0.00018002106,7.5632244e-7,0.000014573216,0.0004491746],"genre_scores_gemma":[0.99871993,0.0003163043,0.0005346789,0.000030300778,0.00029685034,0.0000033188364,3.8829734e-7,0.0000299531,0.00006830283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777436,0.0001109606,0.0009434174,0.000100187826,0.00048334736,0.0005877422],"domain_scores_gemma":[0.9943649,0.0036110892,0.0011379956,0.0002814574,0.0005060964,0.00009842525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032778638,0.00017819979,0.00061424164,0.000061016435,0.00013197005,0.000028145512,0.0006019919,0.00013845664,0.000035199137],"category_scores_gemma":[0.0030852777,0.00011222673,0.00021172687,0.00033996566,0.00008491303,0.0000721091,0.000058676338,0.0017031075,0.0000010476383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004930407,0.00011924696,0.000017163955,0.000031468375,0.00012158858,0.000004907365,0.00012130863,0.000238088,0.00020156096,0.99661505,0.00035256878,0.0016839925],"study_design_scores_gemma":[0.004239106,0.00038211767,0.0000065374875,0.0000529065,0.00023307577,0.00017339438,0.00006571255,0.022879664,0.00043353776,0.9712071,0.00020950925,0.000117374824],"about_ca_topic_score_codex":0.0000021681099,"about_ca_topic_score_gemma":0.0000083592995,"teacher_disagreement_score":0.9447283,"about_ca_system_score_codex":0.000051767005,"about_ca_system_score_gemma":0.00029856485,"threshold_uncertainty_score":0.7399249},"labels":[],"label_agreement":null},{"id":"W1491916424","doi":"10.37236/1129","title":"A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Singularity; Unit circle; Smoothness; Prime (order theory); Boundary (topology); Product (mathematics); Unit (ring theory); Mathematical analysis; Applied mathematics; Combinatorial method; Pure mathematics; Combinatorics; Geometry","score_opus":0.011226592183805733,"score_gpt":0.2882512973551546,"score_spread":0.27702470517134886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491916424","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.7877797,0.0011279949,0.20865566,0.00032446656,0.0003276114,0.0001755977,0.0000036409463,0.000010163227,0.0015951651],"genre_scores_gemma":[0.9988563,0.000082380415,0.00087015535,0.000010149917,0.00009092959,0.0000014507932,8.0075847e-7,0.000015778658,0.00007206648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770963,0.0003715483,0.0009948907,0.000111629866,0.00043305862,0.00037922946],"domain_scores_gemma":[0.9968531,0.0018132768,0.00073492463,0.000300641,0.00024507358,0.000052970066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003866268,0.00016498531,0.00077740004,0.0003246107,0.00007447897,0.000032295222,0.00029208907,0.00007885733,0.000023238212],"category_scores_gemma":[0.0006097805,0.00011482384,0.00024478196,0.0008002001,0.0000823848,0.00008130751,0.000057346744,0.0005723661,4.555007e-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.000055923403,0.00044595666,0.00095230015,0.000045141598,0.00031744418,0.0000047036892,0.000093415954,0.00006800564,0.00012684941,0.99762976,0.00015642171,0.000104063234],"study_design_scores_gemma":[0.0010676836,0.0002938756,0.0005077547,0.000025595938,0.0009318754,0.00006871428,0.000035685804,0.0008764436,0.0015884284,0.99416393,0.0003304553,0.0001095709],"about_ca_topic_score_codex":0.000061083454,"about_ca_topic_score_gemma":0.000021905147,"teacher_disagreement_score":0.21107659,"about_ca_system_score_codex":0.00017300533,"about_ca_system_score_gemma":0.00022530663,"threshold_uncertainty_score":0.46823803},"labels":[],"label_agreement":null},{"id":"W1493123414","doi":"10.37236/438","title":"Invariant and Coinvariant Spaces for the Algebra of Symmetric Polynomials in Non-Commuting Variables","year":2010,"lang":"fr","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Tensor product; Invariant (physics); Commutative property; Algebra over a field; Discrete mathematics; Mathematical physics; Pure mathematics","score_opus":0.011371058364893539,"score_gpt":0.26612105270224173,"score_spread":0.2547499943373482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493123414","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.8657536,0.06455101,0.054884348,0.010261563,0.003107208,0.0009987821,0.000016105825,0.000008973688,0.0004183951],"genre_scores_gemma":[0.9930234,0.0054211053,0.00067193544,0.00008110191,0.00035275653,0.0000089440855,5.724025e-7,0.000050467283,0.0003897413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968744,0.00027189474,0.001274791,0.00017889246,0.00044511107,0.000954922],"domain_scores_gemma":[0.98639286,0.010788314,0.0017814548,0.00053149427,0.00039637444,0.00010952299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008065662,0.00032577204,0.00087660906,0.00039698728,0.0003015317,0.00010016846,0.0009657957,0.00026348326,0.00002735369],"category_scores_gemma":[0.0037892202,0.0002029415,0.00022415144,0.001420101,0.00033612453,0.00028143177,0.00019397624,0.0021826199,0.0000014216813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013014655,0.00038035843,0.00036983012,0.00025642637,0.00033296584,0.000007361532,0.0010513965,0.00007554374,0.0023630685,0.99179244,0.00027430427,0.0029661783],"study_design_scores_gemma":[0.0024839032,0.00079377,0.0005491152,0.00027401416,0.00052397995,0.00048103265,0.0013023345,0.0021344523,0.0046856906,0.9841975,0.0023466307,0.00022758881],"about_ca_topic_score_codex":0.00006172501,"about_ca_topic_score_gemma":0.00010394968,"teacher_disagreement_score":0.12726976,"about_ca_system_score_codex":0.0001929077,"about_ca_system_score_gemma":0.0008258846,"threshold_uncertainty_score":0.94825184},"labels":[],"label_agreement":null},{"id":"W1493766186","doi":"10.37236/4082","title":"A Criterion for a Monomial Ideal to have a Linear Resolution in Characteristic 2","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":4,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Monomial; Ideal (ethics); Resolution (logic); Mathematics; Monomial ideal; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Polynomial; Computer science; Polynomial ring; Law; Artificial intelligence","score_opus":0.07130716521301153,"score_gpt":0.3769500251936341,"score_spread":0.30564285998062257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493766186","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.8429016,0.0011604718,0.15000123,0.003826687,0.0005000339,0.0014282882,0.000027343542,0.00001929855,0.00013507744],"genre_scores_gemma":[0.9985853,0.00016953883,0.0005300602,0.00006285024,0.00034219935,0.00013655906,0.000009156035,0.00004258757,0.00012173599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979857,0.00020938506,0.0008493087,0.00018166399,0.00030392094,0.00047001353],"domain_scores_gemma":[0.99735683,0.0006060945,0.0008272543,0.00044884637,0.00065461424,0.000106330976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002615079,0.00023327542,0.00057512114,0.0002526884,0.00008805054,0.00005437583,0.0007201953,0.00016781298,0.0000031751097],"category_scores_gemma":[0.001046658,0.00018259752,0.00019484117,0.00019238322,0.00003312422,0.00006435317,0.00028639153,0.0013903084,0.0000037322284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000985653,0.0005388386,0.000066645734,0.00018515564,0.00018826942,0.0000049609453,0.005896841,0.00029599483,0.00031007384,0.98497844,0.005500346,0.0010487542],"study_design_scores_gemma":[0.0009891704,0.0006923183,0.0001613683,0.00016063776,0.00013252613,0.000035951154,0.00023211633,0.0032107718,0.000104329745,0.989727,0.0043718317,0.0001819772],"about_ca_topic_score_codex":0.000022229067,"about_ca_topic_score_gemma":0.00005310536,"teacher_disagreement_score":0.15568374,"about_ca_system_score_codex":0.0013926768,"about_ca_system_score_gemma":0.0012346716,"threshold_uncertainty_score":0.7446111},"labels":[],"label_agreement":null},{"id":"W1495483909","doi":"10.37236/2732","title":"Graphs on Affine and Linear Spaces and Deuber Sets","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topology and Set 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 Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Graph homomorphism; Discrete mathematics; Independent set; Affine transformation; Abelian group; Graph; Graph power; Line graph; Pure mathematics","score_opus":0.01226512674955064,"score_gpt":0.2778294665202807,"score_spread":0.26556433977073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495483909","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.99311894,0.0028859514,0.0011509466,0.0018599796,0.0001313106,0.00011018124,2.9780784e-7,0.000011673643,0.0007307369],"genre_scores_gemma":[0.99787956,0.0013345921,0.0001297798,0.00012733389,0.00003550802,0.000001842351,1.290527e-7,0.000014370479,0.00047685084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991652,0.00011531126,0.00021285503,0.000074952324,0.00014009178,0.00029164166],"domain_scores_gemma":[0.99878937,0.0006986715,0.00021540298,0.00013975344,0.00009731597,0.000059488444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061979797,0.00011816966,0.00022105296,0.00006720277,0.00012798228,0.000017130005,0.0001432051,0.00006844345,0.000029028075],"category_scores_gemma":[0.00021068053,0.00007103776,0.0000408373,0.00009784959,0.00014016335,0.0001124975,0.00003483341,0.0005873326,0.00000486654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004363398,0.00006151247,0.0001203408,0.000011300699,0.00006178306,0.000003461133,0.00028119207,0.0000031005018,0.000078149154,0.9979976,0.00038528178,0.000952656],"study_design_scores_gemma":[0.00062404445,0.00058452407,0.000231619,0.000022110964,0.00004702126,0.00026086083,0.00018020558,0.000055425626,0.0004967819,0.9966405,0.00077868905,0.00007822304],"about_ca_topic_score_codex":0.0000016471001,"about_ca_topic_score_gemma":0.0000028432896,"teacher_disagreement_score":0.0047606714,"about_ca_system_score_codex":0.000037229303,"about_ca_system_score_gemma":0.00004638952,"threshold_uncertainty_score":0.28968358},"labels":[],"label_agreement":null},{"id":"W1497318709","doi":"10.37236/506","title":"On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Omega; Graph; Upper and lower bounds; Generalization; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.027189800630967837,"score_gpt":0.2455228207970944,"score_spread":0.21833302016612655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497318709","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.9938199,0.0009222102,0.0017942822,0.0003965178,0.0003223449,0.0001576292,0.0000010898841,0.000007866613,0.0025781856],"genre_scores_gemma":[0.9991641,0.00043139528,0.000019768484,0.00021798396,0.000043426502,0.0000012906381,1.6548836e-7,0.000018188382,0.000103704646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987947,0.00024663116,0.00032492037,0.000074112984,0.00031971867,0.00023995932],"domain_scores_gemma":[0.9983468,0.0007052325,0.0005045625,0.00027919444,0.00012899727,0.00003519191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010969234,0.00013756509,0.00023942301,0.00007452765,0.00013787666,0.000011537967,0.0003739123,0.00007481525,0.00003884634],"category_scores_gemma":[0.00029028347,0.00006445089,0.00010100397,0.00017312978,0.00012984729,0.000038687725,0.00003694377,0.0005646906,3.942535e-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.00014599193,0.00006714481,0.000041688352,0.000012096015,0.00012538735,0.000001786067,0.0024942264,0.000020084444,0.000070499336,0.99614906,0.0007401661,0.00013184368],"study_design_scores_gemma":[0.00051917805,0.0010342677,0.00015557487,0.000038913407,0.000093035975,0.00007149787,0.00015695284,0.000046259018,0.0041119223,0.993428,0.0002713241,0.00007308328],"about_ca_topic_score_codex":0.0000027286678,"about_ca_topic_score_gemma":0.0000018360932,"teacher_disagreement_score":0.005344203,"about_ca_system_score_codex":0.00006666062,"about_ca_system_score_gemma":0.000082738676,"threshold_uncertainty_score":0.2628231},"labels":[],"label_agreement":null},{"id":"W1498810156","doi":"10.37236/434","title":"The Orderings of Bicyclic Graphs and Connected Graphs by Algebraic Connectivity","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","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":"National Natural Science Foundation of China; Hong Kong Baptist University; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Chordal graph; Indifference graph; Algebraic number; Laplacian matrix; Pathwidth; Discrete mathematics; 1-planar graph; Graph; Metric dimension; Eigenvalues and eigenvectors; Connectivity; Line graph; Physics","score_opus":0.006625972996884825,"score_gpt":0.24965531773408564,"score_spread":0.2430293447372008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498810156","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.9959312,0.0014522518,0.0004326826,0.0015519196,0.00017942149,0.00020631295,0.0000028647055,0.00002154981,0.00022180537],"genre_scores_gemma":[0.999037,0.00078475464,0.000014796874,0.000035594487,0.000012418388,0.000008887816,4.5049373e-7,0.000021135133,0.00008490518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859214,0.00016913627,0.00046586295,0.00010782725,0.00027734693,0.00038771043],"domain_scores_gemma":[0.99607986,0.0024901438,0.00068781804,0.00039713326,0.0002704265,0.00007462622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134932,0.00016049595,0.0002975638,0.00008657202,0.00041363534,0.000037132584,0.00057340704,0.000087353736,0.000009563561],"category_scores_gemma":[0.0006534941,0.00009317643,0.0001447033,0.00058863795,0.0004394268,0.000094210234,0.00005203777,0.001062181,7.694227e-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.000041043328,0.00014631008,0.00023290546,0.0000119313945,0.00012659996,3.4028326e-7,0.0002458816,1.1911623e-7,0.021911005,0.9761478,0.0008171256,0.00031894],"study_design_scores_gemma":[0.0006456913,0.00023383825,0.00030545177,0.000010830272,0.00010663148,0.000117033866,0.00017050692,0.000013848933,0.013868326,0.9813197,0.0031054064,0.000102701095],"about_ca_topic_score_codex":0.000007075556,"about_ca_topic_score_gemma":0.000023388704,"teacher_disagreement_score":0.008042678,"about_ca_system_score_codex":0.000021799966,"about_ca_system_score_gemma":0.00012166171,"threshold_uncertainty_score":0.46147066},"labels":[],"label_agreement":null},{"id":"W1499415438","doi":"10.37236/3857","title":"A Schur-Like Basis of NSym Defined by a Pieri Rule","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"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; York University; Universities Space Research Association","keywords":"Basis (linear algebra); Mathematics; Symmetric function; Standard basis; Partition (number theory); Schur algebra; Element (criminal law); Schur polynomial; Gröbner basis; Commutative algebra; Pure mathematics; Algebra over a field; Combinatorics; Geometry; Orthogonal polynomials; Mathematical analysis; Macdonald polynomials; Discrete orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.011040920141027541,"score_gpt":0.2596897182557096,"score_spread":0.24864879811468205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499415438","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.7766948,0.003598659,0.21164997,0.0013919898,0.0020993433,0.00053954945,0.000006275028,0.00009918864,0.003920272],"genre_scores_gemma":[0.9977535,0.00030060095,0.0012254885,0.00005935071,0.00011591281,0.0000069903576,7.4574115e-7,0.000073642295,0.0004637912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967337,0.00031374226,0.0011500348,0.00016125674,0.00091093517,0.0007303262],"domain_scores_gemma":[0.9949118,0.0019704897,0.0016797838,0.00071428274,0.0005922288,0.00013145102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025961585,0.0003102225,0.0008441045,0.00014509808,0.00014320663,0.000031417883,0.0011150605,0.00014346681,0.00002593033],"category_scores_gemma":[0.0022230619,0.00022161349,0.00029889838,0.00061282306,0.0001327594,0.0001909532,0.00012523156,0.00093255675,0.000009569822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007262247,0.00055100885,0.00003749535,0.00009315662,0.00016838984,0.0000015322705,0.00028433758,0.000008685662,0.0017553344,0.99271584,0.0038134134,0.0004981869],"study_design_scores_gemma":[0.0018152208,0.00100647,0.000008215347,0.0000936593,0.00022103603,0.00010719892,0.00012389614,0.00017315922,0.011040235,0.97809005,0.0071066576,0.00021419719],"about_ca_topic_score_codex":0.0000032661724,"about_ca_topic_score_gemma":0.0000014481745,"teacher_disagreement_score":0.22105873,"about_ca_system_score_codex":0.00036378406,"about_ca_system_score_gemma":0.00035346416,"threshold_uncertainty_score":0.9037136},"labels":[],"label_agreement":null},{"id":"W1500859847","doi":"10.37236/826","title":"New Infinite Families of Almost-Planar Crossing-Critical Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Combinatorics; Degree (music); Planar graph; Chordal graph; 1-planar graph; Planar; Indifference graph; Simple (philosophy); Crossing number (knot theory); Clique-sum; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.017154063795545682,"score_gpt":0.28502763383726015,"score_spread":0.26787357004171447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500859847","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.25112352,0.009241042,0.73588336,0.002036657,0.0006139817,0.00013096828,0.0000011498869,0.00004114422,0.0009281922],"genre_scores_gemma":[0.9969815,0.00134963,0.0013171931,0.00007619506,0.000046139896,8.3342553e-7,1.7988249e-7,0.000014246743,0.0002140678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741286,0.00024709798,0.00054533465,0.00015523333,0.00089664344,0.000742851],"domain_scores_gemma":[0.99744165,0.00096573896,0.00031039774,0.0005559331,0.0005523042,0.00017399342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012326408,0.00016638423,0.0003502968,0.00030604337,0.00038790694,0.00007011438,0.002093751,0.00006743387,0.0000066186035],"category_scores_gemma":[0.00045028643,0.00011776779,0.00019434067,0.0013466041,0.0005653173,0.0005590812,0.0001415006,0.0010126138,0.0000064590663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000626801,0.00008102174,0.00048896606,0.000008242744,0.000048882044,0.000041264484,0.0008173651,0.000046671026,0.00073051674,0.99546224,0.00047805195,0.0017341173],"study_design_scores_gemma":[0.00068138493,0.000945649,0.00064498297,0.00002578886,0.000013627739,0.0010271218,0.00006627478,0.00015331192,0.004537597,0.98881173,0.0029693171,0.0001232345],"about_ca_topic_score_codex":0.00001211976,"about_ca_topic_score_gemma":0.0000021253288,"teacher_disagreement_score":0.745858,"about_ca_system_score_codex":0.00012282362,"about_ca_system_score_gemma":0.0016612522,"threshold_uncertainty_score":0.48024312},"labels":[],"label_agreement":null},{"id":"W1501289071","doi":"10.37236/135","title":"Random Even Graphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; University of Cambridge; Isaac Newton Institute for Mathematical Sciences","keywords":"Combinatorics; Mathematics; Random graph; Discrete mathematics; Lattice (music); Phase transition; Random regular graph; Transition point; Graph; Line graph; 1-planar graph; Physics; Condensed matter physics","score_opus":0.016063663243898733,"score_gpt":0.2915499532463266,"score_spread":0.27548629000242786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501289071","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.024685524,0.0028569745,0.9680803,0.002180936,0.00045082168,0.0001673744,0.0000011828129,0.0000262919,0.0015506314],"genre_scores_gemma":[0.9988764,0.00042085437,0.0002886029,0.00015134807,0.00007375388,0.0000011052055,1.7537313e-7,0.000012381226,0.00017536266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984901,0.00007572511,0.00045572163,0.00007570792,0.0004540597,0.00044870528],"domain_scores_gemma":[0.9981724,0.000901675,0.00037162806,0.00019739254,0.0002760292,0.00008086453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012183697,0.00013360208,0.00033212625,0.0000649523,0.000111638474,0.000028210512,0.00048078748,0.000056502096,0.000021042735],"category_scores_gemma":[0.0010856859,0.00008048293,0.00014415717,0.00031350143,0.000026157482,0.00007004484,0.000017391565,0.0006181217,0.000004747072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013749584,0.00012610703,0.0000010641653,0.000008272069,0.000047939084,0.000008124469,0.00010312499,0.000003610595,0.00007091631,0.9964401,0.0013835947,0.0016696271],"study_design_scores_gemma":[0.0016174408,0.0010828067,0.000012354624,0.000028753479,0.0001270996,0.00023495557,0.00005185812,0.0002261644,0.0002679715,0.9953763,0.00087846833,0.000095823074],"about_ca_topic_score_codex":4.565047e-7,"about_ca_topic_score_gemma":5.1221156e-7,"teacher_disagreement_score":0.9741909,"about_ca_system_score_codex":0.00011299493,"about_ca_system_score_gemma":0.00024989116,"threshold_uncertainty_score":0.32819986},"labels":[],"label_agreement":null},{"id":"W1503014997","doi":"10.37236/1041","title":"Tilings by Translation: Enumeration by a Rational Language Approach","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"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":"Polyomino; Parallelogram; Mathematics; Enumeration; Combinatorics; Characterization (materials science); Plane (geometry); Square (algebra); Class (philosophy); Boundary (topology); Regular polygon; Translation (biology); Combinatorics on words; Discrete mathematics; Word (group theory); Geometry; Computer science; Mathematical analysis","score_opus":0.010340173909762048,"score_gpt":0.263757804074699,"score_spread":0.25341763016493696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503014997","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.16588815,0.00981648,0.8178038,0.0011703176,0.00056941266,0.00052967266,0.000010752148,0.00008230005,0.004129132],"genre_scores_gemma":[0.9973897,0.00008276434,0.0012121324,0.00003401791,0.0002343462,0.000010037498,0.000018539247,0.000043583248,0.0009749142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782467,0.00015615915,0.00073500583,0.00012965036,0.0007382951,0.0004162202],"domain_scores_gemma":[0.9981404,0.00058455806,0.00071652496,0.00025502505,0.0002539699,0.00004952224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011612303,0.0002103439,0.0003390767,0.00006484792,0.0001779266,0.00006180332,0.0004308705,0.00010611319,0.000016119895],"category_scores_gemma":[0.00016973559,0.00015672049,0.00014001287,0.0003472095,0.000056603207,0.00027816667,0.000018601086,0.0006481878,0.0000037276257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037638805,0.00045165175,0.00000768866,0.000028974113,0.000053637883,0.0000012483749,0.00050126074,0.00004889504,0.0053738775,0.97251666,0.020776154,0.00020233807],"study_design_scores_gemma":[0.0012720613,0.00020681956,0.0000013576622,0.000014562048,0.0000906229,0.00011772969,0.00018287227,0.0008232102,0.008493852,0.98362553,0.005006101,0.00016527456],"about_ca_topic_score_codex":0.0000046310065,"about_ca_topic_score_gemma":0.0000013419696,"teacher_disagreement_score":0.83150154,"about_ca_system_score_codex":0.00031677794,"about_ca_system_score_gemma":0.00021216815,"threshold_uncertainty_score":0.6390876},"labels":[],"label_agreement":null},{"id":"W1503683857","doi":"10.37236/2982","title":"On the Directed Oberwolfach Problem with Equal Cycle Lengths","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"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 Ottawa; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Decomposition; Discrete mathematics","score_opus":0.002879945969358733,"score_gpt":0.1617463215410101,"score_spread":0.15886637557165137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503683857","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.97688365,0.0012281088,0.009852792,0.00038875724,0.00043286767,0.00019859165,5.511024e-7,0.0001194498,0.010895257],"genre_scores_gemma":[0.99964243,0.000067159504,0.0000030004924,0.000043554246,0.00008630427,0.0000062554286,2.8782614e-7,0.00003399341,0.000117035415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985505,0.00027251596,0.00029749857,0.000069965914,0.00034928691,0.00046026846],"domain_scores_gemma":[0.99888366,0.0005252399,0.00015685557,0.00028353938,0.000096543874,0.000054146683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017106575,0.00016536048,0.00021946222,0.000059579976,0.00016185612,0.00004262458,0.000502654,0.000052471045,0.000013075909],"category_scores_gemma":[0.000052948817,0.00007937376,0.00008693061,0.00034592862,0.0000493775,0.000077314675,0.000013228079,0.00088433997,0.000015267708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051445535,0.000045836572,0.00002772596,0.000013455306,0.00013633708,0.0000015592154,0.0002861403,0.005974734,0.00030052214,0.99227947,0.00044091346,0.00044186736],"study_design_scores_gemma":[0.00088038057,0.0011515316,0.00013875733,0.000088800654,0.00007161553,0.00017641345,0.00014318505,0.004540816,0.0026971549,0.98239946,0.007514158,0.00019774513],"about_ca_topic_score_codex":0.000002144385,"about_ca_topic_score_gemma":0.0000036070096,"teacher_disagreement_score":0.022758786,"about_ca_system_score_codex":0.00013390795,"about_ca_system_score_gemma":0.000060377908,"threshold_uncertainty_score":0.38420662},"labels":[],"label_agreement":null},{"id":"W1504761530","doi":"10.37236/1089","title":"Counting Rooted Trees: The Universal Law $t(n)\\,\\sim\\,C \\rho^{-n} n^{-3/2}$","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Multiset; Combinatorics; Radius of convergence; Sequence (biology); Series (stratigraphy); RADIUS; Simple (philosophy); Convergence (economics); Class (philosophy); Discrete mathematics; Mathematical analysis; Power series","score_opus":0.011659755835061807,"score_gpt":0.2556769988287156,"score_spread":0.24401724299365377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504761530","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.7533131,0.008730105,0.15342508,0.008047828,0.005821185,0.0018844118,0.000008992983,0.00044645034,0.068322845],"genre_scores_gemma":[0.99820435,0.000106168714,0.00014178146,0.00008207804,0.00048695953,0.000004480461,8.0410115e-7,0.00007755804,0.00089580275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965461,0.00030921676,0.0010041876,0.00017296863,0.0010441085,0.0009234126],"domain_scores_gemma":[0.995015,0.002151763,0.0014261144,0.0007269412,0.0006097808,0.000070380716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023713214,0.00035419,0.000574846,0.00009325698,0.00056016835,0.00011442132,0.0014753665,0.00014038089,0.000021387223],"category_scores_gemma":[0.00046785554,0.00020750705,0.0003112323,0.00071813597,0.00026358434,0.00032446935,0.00014024686,0.0014751165,0.000011356036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036423236,0.00026386513,0.00002516088,0.000022163067,0.00012068062,0.00001888204,0.0002283577,0.00015516304,0.0002657733,0.99664855,0.002157811,0.000057185025],"study_design_scores_gemma":[0.001409918,0.0003154278,0.000021979755,0.000065929395,0.00023277334,0.00027725718,0.00053121144,0.00033070034,0.0016203163,0.975054,0.019908635,0.00023184423],"about_ca_topic_score_codex":0.000037500773,"about_ca_topic_score_gemma":0.000060684364,"teacher_disagreement_score":0.24489127,"about_ca_system_score_codex":0.00078683987,"about_ca_system_score_gemma":0.00041795807,"threshold_uncertainty_score":0.8461892},"labels":[],"label_agreement":null},{"id":"W1504941748","doi":"10.37236/1175","title":"On Ryser's conjecture","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"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","keywords":"Mathematics; Combinatorics; Conjecture; Hypergraph; Cover (algebra); Matching (statistics); Statistics","score_opus":0.016473878180495057,"score_gpt":0.2854909058667473,"score_spread":0.26901702768625224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504941748","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.9848607,0.004171911,0.0027485124,0.0005864107,0.0018588613,0.0001205868,7.6132113e-7,0.000021796652,0.005630458],"genre_scores_gemma":[0.998917,0.00017081102,0.000020683428,0.00021829347,0.00034371423,9.918554e-7,1.3746208e-7,0.000024786534,0.0003036006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841887,0.00019246021,0.00032739778,0.000056006615,0.00041510287,0.0005901468],"domain_scores_gemma":[0.99821424,0.0008962357,0.00038689803,0.00030961612,0.00010248309,0.00009051182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017127832,0.00015495573,0.00025937826,0.000081240745,0.00022784573,0.000016722193,0.0005062387,0.00008837271,0.000055445555],"category_scores_gemma":[0.00038016232,0.00008249711,0.00017843251,0.00019503442,0.00006693724,0.00010688354,0.000050424525,0.0010127053,0.000004692637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005935302,0.00010800381,0.00014899106,0.000008261176,0.00011385268,0.0000019261402,0.00074933295,0.000004448626,0.000025565261,0.99511164,0.0034649072,0.00020370715],"study_design_scores_gemma":[0.00052806444,0.00043863145,0.00015384407,0.000017029615,0.00008748445,0.00028703653,0.00009321164,0.0000029937657,0.00092805194,0.9905675,0.0067951186,0.000101056394],"about_ca_topic_score_codex":4.5295334e-7,"about_ca_topic_score_gemma":3.2843096e-7,"teacher_disagreement_score":0.014056279,"about_ca_system_score_codex":0.00016750253,"about_ca_system_score_gemma":0.00009768441,"threshold_uncertainty_score":0.43997568},"labels":[],"label_agreement":null},{"id":"W1504968429","doi":"10.37236/3144","title":"Cores of Vertex Transitive Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Transitive relation; Discrete mathematics; Cayley graph; Graph","score_opus":0.010838545790543492,"score_gpt":0.2492117707299721,"score_spread":0.2383732249394286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504968429","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.99383336,0.0018035244,0.0011831784,0.00026939233,0.0004166331,0.00015812853,8.237854e-7,0.000009279235,0.0023256917],"genre_scores_gemma":[0.99933285,0.00043750787,0.000028138758,0.000042922813,0.000029291952,0.0000019600598,1.3171872e-7,0.000018393099,0.00010881029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985496,0.00016936401,0.00048001815,0.000065937114,0.00038284776,0.00035224934],"domain_scores_gemma":[0.99813014,0.00068700535,0.000486138,0.00024821743,0.00039646108,0.000052011612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080879754,0.00013571393,0.00034511683,0.00010915718,0.000108867505,0.000012479174,0.00052020786,0.00006910714,0.00004822259],"category_scores_gemma":[0.00018331756,0.00007798037,0.0002177832,0.0002695317,0.00016465462,0.000097492804,0.000033442837,0.0005778164,8.8171856e-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.000043726075,0.00008149415,0.00015580736,0.000020776319,0.00019924999,0.0000017154349,0.0012531854,0.0000019005386,0.0005557582,0.99675584,0.00049953826,0.0004310142],"study_design_scores_gemma":[0.0006232904,0.0005213854,0.0006236923,0.000031467236,0.00011239265,0.000100502584,0.00037042252,0.000031591753,0.003868758,0.99350345,0.00012649785,0.00008656433],"about_ca_topic_score_codex":0.000008413709,"about_ca_topic_score_gemma":0.0000015914254,"teacher_disagreement_score":0.005499495,"about_ca_system_score_codex":0.00006417091,"about_ca_system_score_gemma":0.00013327156,"threshold_uncertainty_score":0.3179947},"labels":[],"label_agreement":null},{"id":"W1505889193","doi":"10.37236/2404","title":"Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amortized analysis; Permutation (music); Mathematics; Algorithm; Constant (computer programming); Representation (politics); Polyomino; Construct (python library); Tree (set theory); Combinatorics; Computer science; Data structure; Geometry; Programming language","score_opus":0.026854551415974974,"score_gpt":0.26951137571001754,"score_spread":0.24265682429404256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505889193","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.029453287,0.011262819,0.956303,0.0013065732,0.0011241644,0.0001946782,0.000001144311,0.000022499347,0.0003318451],"genre_scores_gemma":[0.99626744,0.0017960262,0.0012547302,0.00017658538,0.00034307563,0.0000025372874,0.000002145218,0.000012856215,0.00014459006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982567,0.00016842652,0.0003582717,0.0001578092,0.00047297345,0.0005858176],"domain_scores_gemma":[0.9987692,0.00010773995,0.000392986,0.00038999514,0.00017713456,0.00016289756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148721,0.00016253801,0.00025311115,0.000082761064,0.00033503195,0.00043106373,0.0016203027,0.000064907705,0.000006211049],"category_scores_gemma":[0.00004191409,0.00010587352,0.00005733296,0.0003102042,0.000041132378,0.0021974829,0.0006430499,0.00050242775,0.0000031778798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022183947,0.00023041558,0.0004817826,0.0000076228675,0.00011414973,0.000004810774,0.0015943295,0.000052382587,0.00092247943,0.95276964,0.007391543,0.03640868],"study_design_scores_gemma":[0.0072045405,0.002627559,0.0018034588,0.0001669726,0.00021810908,0.002285056,0.0012895382,0.13188665,0.01089312,0.71447176,0.12592238,0.0012308581],"about_ca_topic_score_codex":0.000017318198,"about_ca_topic_score_gemma":0.0000032602688,"teacher_disagreement_score":0.96681416,"about_ca_system_score_codex":0.00019970578,"about_ca_system_score_gemma":0.00025358156,"threshold_uncertainty_score":0.4317397},"labels":[],"label_agreement":null},{"id":"W1507337585","doi":"10.37236/534","title":"Lattice Path Proofs of Extended Bressoud-Wei and Koike Skew Schur Function Identities","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Wilfrid Laurier University","keywords":"Mathematical proof; Skew; Mathematics; Combinatorial proof; Combinatorics; Lattice (music); Algebraic number; Path (computing); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.032169752925778596,"score_gpt":0.26883502435709955,"score_spread":0.23666527143132096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507337585","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.92643017,0.0069568446,0.060911767,0.000121935984,0.0018868479,0.0005618462,0.0000026277664,0.000069336296,0.003058642],"genre_scores_gemma":[0.99791443,0.0006845161,0.0008396356,0.000017294804,0.00009963375,0.0000067370106,2.2961969e-7,0.00005040968,0.0003871224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755,0.00020373824,0.0009105296,0.00014642965,0.0006767629,0.00051255606],"domain_scores_gemma":[0.99681973,0.0005832652,0.0014183451,0.0004595073,0.0006276506,0.00009149783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017204051,0.0002535408,0.0005806321,0.00015014148,0.00015139149,0.00003147894,0.0005572961,0.000119048476,0.000026606453],"category_scores_gemma":[0.00075932976,0.00018213278,0.00015518612,0.00035857136,0.0001662314,0.00038778165,0.00012696648,0.00077217043,0.0000035733722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001721924,0.00041270567,0.00006942831,0.00020118577,0.00020307764,0.000006533358,0.0016620207,6.325202e-7,0.0002817235,0.9963601,0.0001975655,0.00043280495],"study_design_scores_gemma":[0.0012979888,0.0013287802,0.00026772113,0.00014546822,0.00039945316,0.00022104513,0.00058454287,0.000031072763,0.0033309804,0.9919965,0.00021906255,0.00017736279],"about_ca_topic_score_codex":0.0000035100159,"about_ca_topic_score_gemma":0.0000022663526,"teacher_disagreement_score":0.07148427,"about_ca_system_score_codex":0.00018579494,"about_ca_system_score_gemma":0.00026753376,"threshold_uncertainty_score":0.7427159},"labels":[],"label_agreement":null},{"id":"W1509198134","doi":"10.37236/1829","title":"Standard Paths in Another Composition Poset","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Partially ordered set; Lambda; Mathematics; Combinatorics; Hasse diagram; Commutative property; Composition (language); Order (exchange); Diagram; Set (abstract data type); Discrete mathematics; Statistics; Computer science; Physics","score_opus":0.015025482835600389,"score_gpt":0.28714320486341727,"score_spread":0.27211772202781687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509198134","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.820036,0.0013735312,0.17408736,0.001802365,0.0010509832,0.00046875438,0.0000032751236,0.000053111886,0.0011246172],"genre_scores_gemma":[0.9988457,0.00022207318,0.0006673465,0.000069376234,0.00009794032,0.0000044139074,5.058377e-7,0.000048798334,0.00004385459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770814,0.0001523653,0.0007769176,0.000115420866,0.00067097455,0.0005761876],"domain_scores_gemma":[0.99815154,0.00044497332,0.00069741014,0.00036462053,0.0002854376,0.000055989556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015933643,0.00021442189,0.00048494566,0.00016005983,0.00009807492,0.000035916506,0.0005799804,0.00009957515,0.000011036875],"category_scores_gemma":[0.0003125579,0.00015287955,0.00014486183,0.0005168105,0.00006875927,0.00022311682,0.00005567919,0.00094494934,0.0000068507616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013524479,0.00034953767,0.00003395022,0.000027735527,0.000046231784,0.000026007327,0.00072128413,0.00029903135,0.00054808863,0.99757504,0.00011846486,0.00011940609],"study_design_scores_gemma":[0.0031378889,0.0008151123,0.00002338113,0.0001420419,0.00004768447,0.00023300352,0.0001515877,0.000014837595,0.0051346635,0.9895247,0.0006119035,0.0001631801],"about_ca_topic_score_codex":0.000002999194,"about_ca_topic_score_gemma":0.0000075162716,"teacher_disagreement_score":0.17880969,"about_ca_system_score_codex":0.0014208151,"about_ca_system_score_gemma":0.00049999106,"threshold_uncertainty_score":0.6234247},"labels":[],"label_agreement":null},{"id":"W1509672730","doi":"10.37236/635","title":"Toughness of $K_{a,t}$-Minor-free Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Simon Fraser University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Omega; Graph; Discrete mathematics; Physics","score_opus":0.020393673663520264,"score_gpt":0.25172823739228267,"score_spread":0.2313345637287624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509672730","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.38498017,0.007853591,0.5980558,0.00072137185,0.0011695642,0.00028600026,0.0000012513864,0.00005462832,0.006877657],"genre_scores_gemma":[0.99870914,0.00050437386,0.00052998355,0.000033232995,0.000025320322,0.0000023216785,7.42878e-8,0.000014438486,0.00018109873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976262,0.00028524367,0.0005118327,0.00014944794,0.0007494447,0.00067786686],"domain_scores_gemma":[0.99739647,0.0002876455,0.00056108786,0.001081589,0.0005665313,0.00010667739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022388054,0.00015485071,0.000315438,0.00027550722,0.000119030534,0.00002512973,0.0048302338,0.000059477723,0.00001459509],"category_scores_gemma":[0.00021280615,0.000104516046,0.0002022777,0.0012696573,0.00020253882,0.0005065371,0.0004083188,0.00082250073,0.0000047103017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000678625,0.00015688772,0.00033469877,0.000009090494,0.00007181664,0.000013747198,0.0007194641,0.000008341873,0.00036512356,0.9963575,0.00014032755,0.0017551404],"study_design_scores_gemma":[0.00074036233,0.0009774682,0.0006045122,0.000018089628,0.00001859966,0.00018906326,0.000080340586,0.0000720658,0.015298488,0.9813971,0.0004945587,0.000109335786],"about_ca_topic_score_codex":0.0000067608053,"about_ca_topic_score_gemma":0.0000027899412,"teacher_disagreement_score":0.613729,"about_ca_system_score_codex":0.000120311735,"about_ca_system_score_gemma":0.0004680001,"threshold_uncertainty_score":0.89758563},"labels":[],"label_agreement":null},{"id":"W1510569445","doi":"10.37236/678","title":"Spherical Venn Diagrams with Involutory Isometries","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"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 Victoria","funders":"","keywords":"Venn diagram; Antipodal point; Mathematics; Combinatorics; Involution (esoterism); Isometry (Riemannian geometry); Lattice (music); Pure mathematics; Geometry; Physics","score_opus":0.044220030189077005,"score_gpt":0.26225149162731637,"score_spread":0.21803146143823937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510569445","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.7425915,0.0042342898,0.24606524,0.00022777075,0.0013881761,0.00052181515,0.0000010200962,0.00013667198,0.004833536],"genre_scores_gemma":[0.99742997,0.0002703032,0.0017720758,0.000036409005,0.00015848559,0.000007695233,2.0653461e-7,0.00007196078,0.00025287917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748176,0.00017882907,0.00069453847,0.00014305761,0.00077686633,0.0007249508],"domain_scores_gemma":[0.99703664,0.0008256495,0.00096771744,0.0005602299,0.00047329007,0.0001364916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012974205,0.0002833217,0.000575676,0.00011902625,0.00016397412,0.000030842104,0.0009536598,0.00010753244,0.00003792006],"category_scores_gemma":[0.0008261025,0.00017005466,0.00016798149,0.00088578317,0.00022225149,0.0002742428,0.00009579414,0.0011142653,0.00001176087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017743143,0.00052473997,0.0004694078,0.000038512484,0.00019307724,0.000026732429,0.0012741409,0.0000024654378,0.000041606385,0.99649996,0.0004987089,0.00025321144],"study_design_scores_gemma":[0.0011277355,0.0019795804,0.000115568124,0.000052022624,0.00018854799,0.0002905977,0.0005448075,0.000012922561,0.0020195597,0.99151284,0.001935408,0.00022042297],"about_ca_topic_score_codex":0.000003206079,"about_ca_topic_score_gemma":0.000005145727,"teacher_disagreement_score":0.2548385,"about_ca_system_score_codex":0.00047336807,"about_ca_system_score_gemma":0.00047642444,"threshold_uncertainty_score":0.6934627},"labels":[],"label_agreement":null},{"id":"W1510785677","doi":"10.37236/1036","title":"A Few More Cyclic Steiner 2-Designs","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"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; Jiangsu Provincial Department of Education; National Science Foundation","keywords":"Mathematics; Combinatorics; Steiner system; Discrete mathematics","score_opus":0.004355605282741898,"score_gpt":0.18554196479731666,"score_spread":0.18118635951457476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510785677","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.9632955,0.015553335,0.01269185,0.0002784957,0.0010160465,0.00013518243,8.804403e-7,0.000094511364,0.0069341683],"genre_scores_gemma":[0.998911,0.00021700462,0.0000025596366,0.00001967218,0.00021190903,0.000002745568,5.519562e-7,0.000032231757,0.00060232857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876577,0.00006783599,0.00037906386,0.000056896934,0.00027018186,0.00046025688],"domain_scores_gemma":[0.99944574,0.000090094385,0.00013361096,0.00020824779,0.00007690376,0.000045387173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998571,0.0001494027,0.00023330556,0.000099558834,0.00008331643,0.000032993725,0.00039334834,0.000064059124,0.000013983528],"category_scores_gemma":[0.00000922397,0.000100991594,0.00014811949,0.00036252322,0.000037891885,0.000110429835,0.000011641963,0.00056646013,0.000012660324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000203447,0.00005630172,0.00014775732,0.00002244712,0.000113153306,0.000014629952,0.00015076753,0.0060727177,0.0044588214,0.986066,0.0026647928,0.00021226984],"study_design_scores_gemma":[0.00093749724,0.0002804492,0.00061184505,0.000044194032,0.00009314856,0.00047711038,0.00018553637,0.0007577732,0.006050008,0.97367847,0.016655136,0.00022885497],"about_ca_topic_score_codex":0.0000051510165,"about_ca_topic_score_gemma":0.0000028382842,"teacher_disagreement_score":0.035615467,"about_ca_system_score_codex":0.00018342253,"about_ca_system_score_gemma":0.000056154695,"threshold_uncertainty_score":0.41183177},"labels":[],"label_agreement":null},{"id":"W1514758408","doi":"10.37236/5157","title":"Tiling Groups with Difference Sets","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hrvatska Zaklada za Znanost; National Natural Science Foundation of China; European Science Foundation","keywords":"Mathematics; Disjoint sets; Combinatorics; Difference set; Substitution tiling; Abelian group; Skew; Hadamard transform; Group (periodic table); Discrete mathematics; Mathematical analysis","score_opus":0.009063236364971758,"score_gpt":0.1919677807521649,"score_spread":0.18290454438719314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514758408","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.9819921,0.0049527227,0.010785672,0.000057778518,0.0005598819,0.000058445134,2.4975543e-7,0.00004113011,0.0015519956],"genre_scores_gemma":[0.9996907,0.00013218017,0.000003831223,0.0000109067505,0.00006263528,0.0000014795525,2.2298603e-7,0.000020226787,0.000077827935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903893,0.00007275368,0.00021900136,0.000046185516,0.00028436867,0.00033878093],"domain_scores_gemma":[0.99945873,0.00006738744,0.000100170124,0.00016372267,0.00012015418,0.00008983279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082130387,0.00011545001,0.00018708623,0.000056437762,0.00004731411,0.00002692246,0.00033580285,0.000038962993,0.0000019665674],"category_scores_gemma":[0.000018896006,0.00006765885,0.000048520367,0.00024635898,0.00003057541,0.00008965568,0.000011661895,0.00053330313,0.000005546301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012021816,0.000060612594,0.0010717825,0.000033172728,0.00023730383,0.00002629059,0.0016485292,0.006207777,0.0005661819,0.98873323,0.00044548092,0.00084943214],"study_design_scores_gemma":[0.0015813624,0.0010763003,0.00053332525,0.00009386769,0.0000915545,0.0010741963,0.0009762908,0.0028244422,0.0022920899,0.9863584,0.0028451853,0.0002529749],"about_ca_topic_score_codex":0.0000010991282,"about_ca_topic_score_gemma":0.000002581159,"teacher_disagreement_score":0.017698565,"about_ca_system_score_codex":0.00016390777,"about_ca_system_score_gemma":0.00011556987,"threshold_uncertainty_score":0.2759048},"labels":[],"label_agreement":null},{"id":"W1516324643","doi":"10.37236/2633","title":"Properties of the Corolla Polynomial of a 3-regular Graph","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Black Holes and Theoretical Physics","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"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; Bundesministerium für Bildung und Forschung; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Feynman diagram; Combinatorics; Integral graph; Graph; Discrete mathematics; Connection (principal bundle); Polynomial; Voltage graph; Line graph; Geometry; Mathematical analysis","score_opus":0.003951396385732089,"score_gpt":0.1768781895493206,"score_spread":0.17292679316358853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516324643","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.9958556,0.00083644054,0.00096448546,0.0005437011,0.00019913002,0.00016112279,0.0000014567563,0.0000020440018,0.0014360072],"genre_scores_gemma":[0.99970955,0.00002168346,0.000002069437,0.000016436585,0.000110969275,0.000002368539,1.6215925e-7,0.000013300175,0.00012347255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998835,0.00011141853,0.00040492104,0.000057435736,0.00030008116,0.000291105],"domain_scores_gemma":[0.99879676,0.000053006876,0.00053035846,0.00027356716,0.0003073044,0.00003897546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032462648,0.00011534727,0.0002851296,0.000027447923,0.00007411129,0.000015693262,0.0005921284,0.000028981362,0.000035715955],"category_scores_gemma":[0.000009765957,0.00005568619,0.00028650792,0.0002541835,0.0002845282,0.0000848955,0.00007631725,0.00042596154,0.0000026279727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034748027,0.00017479021,0.00074508355,0.000010274197,0.00015606063,4.2178403e-8,0.00017528285,0.000035033976,0.0046643456,0.993126,0.00031479486,0.0005635412],"study_design_scores_gemma":[0.00057955005,0.00023188644,0.00051166833,0.000043727017,0.00008359878,0.0000030090084,0.0002510552,0.00003830574,0.07195476,0.92600745,0.00023059665,0.00006441925],"about_ca_topic_score_codex":0.000054913377,"about_ca_topic_score_gemma":3.3823278e-7,"teacher_disagreement_score":0.06729041,"about_ca_system_score_codex":0.00003008151,"about_ca_system_score_gemma":0.00022591249,"threshold_uncertainty_score":0.22708169},"labels":[],"label_agreement":null},{"id":"W1517109152","doi":"10.37236/2721","title":"On a Matrix Representation for Polynomially Recursive Sequences","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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; Characterization (materials science); Sequence (biology); Uniqueness; Extension (predicate logic); Combinatorics; Representation (politics); Matrix (chemical analysis); Similarity (geometry); Field (mathematics); Canonical form; Discrete mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.012416149409724757,"score_gpt":0.2878384431530843,"score_spread":0.2754222937433596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517109152","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.32013255,0.0058858837,0.66626436,0.004396191,0.0023534829,0.00029988794,0.0000010960515,0.000044112105,0.00062245026],"genre_scores_gemma":[0.9989053,0.00017618552,0.00033852967,0.00018130659,0.00021329298,0.0000047331373,3.5810734e-7,0.000008122884,0.0001721779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873024,0.00013944853,0.00027192032,0.000087113716,0.00029866156,0.00047261102],"domain_scores_gemma":[0.9984255,0.0006680727,0.0004185902,0.0002754858,0.00014589715,0.000066476896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016977568,0.000097599994,0.00016006353,0.00008746537,0.00013795463,0.00006861264,0.00093188573,0.000040119092,0.0000030135532],"category_scores_gemma":[0.00018039906,0.00006277837,0.00012402801,0.00028974403,0.000030567942,0.0005181584,0.00004635366,0.00027891106,0.000006706629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044695436,0.00006916068,0.0000355676,0.000002718874,0.000034246004,8.8528907e-7,0.0005298811,0.000043411317,0.00033123736,0.9958463,0.0014247682,0.0016371475],"study_design_scores_gemma":[0.0005201602,0.00073315215,0.00012808875,0.000016608285,0.000020089423,0.0001405279,0.00010970547,0.0005721231,0.005899219,0.9899988,0.0017745083,0.00008697479],"about_ca_topic_score_codex":0.000002978665,"about_ca_topic_score_gemma":3.3902054e-7,"teacher_disagreement_score":0.67877275,"about_ca_system_score_codex":0.00022083007,"about_ca_system_score_gemma":0.0002534195,"threshold_uncertainty_score":0.25600275},"labels":[],"label_agreement":null},{"id":"W1517376969","doi":"10.37236/1844","title":"Bounds on the Turán Density of ${\\rm PG}(3,2)$","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017657423144434477,"score_gpt":0.2631549794956275,"score_spread":0.24549755635119302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517376969","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.9926855,0.0009292403,0.0016590855,0.0015974711,0.00059894315,0.0001307179,6.6089433e-7,0.000009802641,0.0023886038],"genre_scores_gemma":[0.99917716,0.000317506,0.000028373981,0.00019593778,0.00011154563,9.575914e-7,1.151675e-7,0.000020941527,0.00014745191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824476,0.0001879443,0.00048609357,0.000084062114,0.0005857978,0.0004113379],"domain_scores_gemma":[0.99766976,0.00087510754,0.000645382,0.00049334194,0.00026804753,0.00004835099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021000726,0.00016781312,0.00033099914,0.000076565404,0.00033261196,0.00002311489,0.0008402689,0.00008490802,0.000020975447],"category_scores_gemma":[0.0005158158,0.0000799345,0.000256303,0.0002878785,0.00020381238,0.000060411952,0.00008008212,0.0010606581,0.0000021721255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009451995,0.00014796715,0.000070981674,0.000013216961,0.00015117977,0.0000048579845,0.00095144287,0.000018850767,0.00017944939,0.99776804,0.0004972466,0.00010223295],"study_design_scores_gemma":[0.0006906541,0.00067928137,0.00025911193,0.00004593044,0.00010489801,0.00017670455,0.000191,0.000003793254,0.011101241,0.985844,0.0008139567,0.00008942525],"about_ca_topic_score_codex":0.0000042857428,"about_ca_topic_score_gemma":0.000003891189,"teacher_disagreement_score":0.011924051,"about_ca_system_score_codex":0.0002656048,"about_ca_system_score_gemma":0.0003114703,"threshold_uncertainty_score":0.46080905},"labels":[],"label_agreement":null},{"id":"W1517511137","doi":"10.37236/1590","title":"A Note on the Ranks of Set-Inclusion Matrices","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rank (graph theory); Combinatorics; Set (abstract data type); Inclusion (mineral); Relation (database); Finite set; Mathematical analysis; Computer science; Data mining","score_opus":0.008505119402307144,"score_gpt":0.24364521393337032,"score_spread":0.2351400945310632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517511137","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.50022787,0.008950964,0.4650361,0.01924528,0.0015884242,0.0003258631,9.874492e-7,0.000049164548,0.0045753326],"genre_scores_gemma":[0.9979989,0.0014235293,0.000050692932,0.00021845702,0.00009982245,9.3716596e-7,7.394169e-8,0.0000071857426,0.00020040688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982024,0.000321465,0.00037920655,0.000097102005,0.00062949915,0.00037036577],"domain_scores_gemma":[0.9979592,0.0008173375,0.00054599956,0.00045846848,0.00017343997,0.000045550496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003197193,0.00012331917,0.00021144179,0.000100645666,0.00036414896,0.000045722434,0.0022155566,0.000048017417,0.000016439824],"category_scores_gemma":[0.000104861545,0.000060804425,0.00014732836,0.0007375564,0.00005617671,0.0001933107,0.00038712943,0.0006740978,0.000008400068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060213708,0.00008742426,0.0000133164585,0.0000045569914,0.000027764809,0.000011259548,0.0007842597,0.00012639537,0.00022629951,0.9934532,0.0002565193,0.004948784],"study_design_scores_gemma":[0.0005384082,0.00076800166,0.000035242196,0.000036424874,0.00002434538,0.00024912087,0.000044247896,0.0033551808,0.0042766077,0.9789028,0.01168262,0.00008696847],"about_ca_topic_score_codex":0.0000034801133,"about_ca_topic_score_gemma":6.839887e-7,"teacher_disagreement_score":0.49777102,"about_ca_system_score_codex":0.00011834935,"about_ca_system_score_gemma":0.00024562495,"threshold_uncertainty_score":0.41170925},"labels":[],"label_agreement":null},{"id":"W1519107695","doi":"10.37236/436","title":"A Theory of Transformation Monoids: Combinatorics and Representation Theory","year":2010,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monoid; Mathematics; Transformation (genetics); Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.010460771401402174,"score_gpt":0.24416750660461436,"score_spread":0.2337067352032122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519107695","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.3156223,0.009413043,0.6710058,0.00084389484,0.0018433587,0.0003747375,0.0000035827645,0.0000538423,0.0008394817],"genre_scores_gemma":[0.99613816,0.003459299,0.00013793688,0.00006243049,0.000083801046,0.000008332382,0.0000032246398,0.000026402166,0.00008042595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655837,0.0009253354,0.001024765,0.0002732141,0.00073541264,0.00048289463],"domain_scores_gemma":[0.9956307,0.0010717257,0.0017243971,0.0009560301,0.0005176974,0.000099494464],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006881914,0.00032711774,0.00063778803,0.00031196963,0.00016399809,0.00016546634,0.0022567736,0.00034850242,0.0000055918604],"category_scores_gemma":[0.00025684052,0.00023413137,0.00028173605,0.00046118855,0.00020580806,0.0005550539,0.0005003604,0.0027129916,0.0000014017934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081471386,0.00014400213,0.000026937958,0.0000826972,0.00016111002,0.000003753509,0.0033221832,0.00009477849,0.000515608,0.984038,0.00004607891,0.011483375],"study_design_scores_gemma":[0.00081543264,0.00036677794,0.00026607062,0.00010870644,0.00014412415,0.00017368601,0.000399194,0.0035250261,0.006551019,0.9871791,0.00024583226,0.00022505909],"about_ca_topic_score_codex":0.000007043895,"about_ca_topic_score_gemma":0.0000011609548,"teacher_disagreement_score":0.6805159,"about_ca_system_score_codex":0.00018824135,"about_ca_system_score_gemma":0.0007311995,"threshold_uncertainty_score":0.9995878},"labels":[],"label_agreement":null},{"id":"W1520046526","doi":"10.37236/1823","title":"The Degree of the Splitting Field of a Random Polynomial over a Finite Field","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Order (exchange); Finite field; Logarithm; Permutation (music); Field (mathematics); Polynomial; Binary logarithm; Random permutation; Distribution (mathematics); Symmetric group; Discrete mathematics; Mathematical analysis; Pure mathematics; Physics","score_opus":0.02229501341874963,"score_gpt":0.28810831804893217,"score_spread":0.26581330463018255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520046526","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.19790202,0.003332635,0.7916851,0.004489867,0.0010361177,0.000385742,0.00000425331,0.000009560654,0.0011546774],"genre_scores_gemma":[0.9993427,0.00022065591,0.00014125311,0.00011156167,0.00008128068,0.0000022917222,4.3955456e-8,0.000012880218,0.00008734148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983317,0.000087647124,0.00067897147,0.00006809702,0.00047867236,0.00035488704],"domain_scores_gemma":[0.9912688,0.0072798077,0.00084823713,0.00031570933,0.00024956977,0.000037889557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013535394,0.00012468029,0.00033578055,0.000030044004,0.00017819839,0.000019298226,0.00075063866,0.0000775069,0.000010574639],"category_scores_gemma":[0.0067165256,0.000057786627,0.00022349105,0.00026989935,0.00006339648,0.00004058464,0.000097818585,0.0007220203,4.3791118e-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.00040819382,0.0000899338,0.000012599717,0.000044646866,0.0001083357,0.0000015673307,0.00036372608,0.000032482465,0.00016380324,0.9970373,0.00038684922,0.001350563],"study_design_scores_gemma":[0.0022231718,0.00085607177,0.000018864877,0.00013726388,0.00015609733,0.000046197296,0.0001572464,0.00033203047,0.00833591,0.98739445,0.0002771724,0.00006551016],"about_ca_topic_score_codex":0.000018002198,"about_ca_topic_score_gemma":0.000018232531,"teacher_disagreement_score":0.80144066,"about_ca_system_score_codex":0.000090231755,"about_ca_system_score_gemma":0.00053651584,"threshold_uncertainty_score":0.80407935},"labels":[],"label_agreement":null},{"id":"W1521513823","doi":"10.37236/1133","title":"Cycle Lengths in a Permutation are Typically Poisson","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Poisson distribution; Set (abstract data type); Order (exchange); Parity of a permutation; Prime (order theory); Permutation group; Discrete mathematics; Cyclic permutation; Symmetric group; Statistics; Computer science","score_opus":0.010323945212025556,"score_gpt":0.2784055045512657,"score_spread":0.26808155933924016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521513823","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.96807456,0.0015443958,0.025419159,0.0016839775,0.0001927064,0.00018945914,6.674953e-7,0.000031092182,0.0028640055],"genre_scores_gemma":[0.99856067,0.00010930972,0.00019903138,0.000024936231,0.00008743183,0.0000037266989,3.0908714e-7,0.00002561878,0.0009889432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836373,0.00011623019,0.00059875543,0.0000816951,0.00042600348,0.00041355382],"domain_scores_gemma":[0.99833554,0.0006838806,0.00055512093,0.00018996456,0.00020294586,0.000032525935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297436,0.00013047097,0.0003111208,0.000116695424,0.00006872916,0.00003471064,0.0003301534,0.00006415128,0.00001770913],"category_scores_gemma":[0.0006776037,0.000092052534,0.0001036712,0.0003017499,0.00005397146,0.0002124732,0.00003412374,0.0006152221,0.0000095755895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003180864,0.0002541644,0.00017145605,0.000034872264,0.000016821718,0.000014049042,0.00018827262,0.00012720303,0.00013937899,0.998449,0.0005274019,0.00004553914],"study_design_scores_gemma":[0.0007166632,0.00014256923,0.0006792315,0.0000638071,0.00004105374,0.00010676168,0.0003325382,0.00018465219,0.0005701487,0.9967481,0.00031562016,0.000098839235],"about_ca_topic_score_codex":0.000008036529,"about_ca_topic_score_gemma":0.000058186946,"teacher_disagreement_score":0.030486157,"about_ca_system_score_codex":0.00045243517,"about_ca_system_score_gemma":0.0001371896,"threshold_uncertainty_score":0.37537932},"labels":[],"label_agreement":null},{"id":"W1521918479","doi":"10.37236/976","title":"Matrix Partitions with Finitely Many Obstructions","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"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; Partition (number theory); Matrix (chemical analysis); Diagonal; Characterization (materials science); Induced subgraph; Graph; Finite set; Block matrix; Discrete mathematics; Diagonal matrix; Eigenvalues and eigenvectors","score_opus":0.010567544475568983,"score_gpt":0.28278040714190844,"score_spread":0.2722128626663395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521918479","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.08199678,0.0013162125,0.913862,0.0013234225,0.00027808087,0.00009790491,3.8700563e-7,0.000035783894,0.0010894537],"genre_scores_gemma":[0.99814844,0.00020544651,0.0010934215,0.000042857115,0.00006543291,0.0000020299858,1.81454e-7,0.000012078188,0.0004300876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981528,0.0001077596,0.00033189476,0.000118143216,0.00058158697,0.00070781156],"domain_scores_gemma":[0.99827754,0.00046941737,0.00027579188,0.0004561093,0.0004004386,0.00012068932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019176422,0.000115430834,0.00015893353,0.00022959101,0.00032309038,0.00007549255,0.0012969314,0.00003852706,0.000008444622],"category_scores_gemma":[0.000080393096,0.00007305641,0.00008971119,0.0013413453,0.00013202101,0.00046676293,0.00009028811,0.00091968186,0.000013792957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004254605,0.00006649643,0.00016755195,0.0000022538434,0.000045817753,0.000027661878,0.00013836475,0.00028606443,0.00013277012,0.9980206,0.000107290834,0.0009626041],"study_design_scores_gemma":[0.0005289093,0.0006941525,0.0007940733,0.000012226023,0.00001767116,0.001037664,0.000114739705,0.00018666053,0.0015084421,0.9893789,0.0056260596,0.000100465215],"about_ca_topic_score_codex":0.0000014445044,"about_ca_topic_score_gemma":0.000006391764,"teacher_disagreement_score":0.9161517,"about_ca_system_score_codex":0.00024339503,"about_ca_system_score_gemma":0.00039359674,"threshold_uncertainty_score":0.3995611},"labels":[],"label_agreement":null},{"id":"W1522265958","doi":"10.37236/988","title":"Existentially Closed BIBD Block-Intersection Graphs","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Lambda; Intersection (aeronautics); Block (permutation group theory); Graph; Intersection graph; Discrete mathematics; Line graph; Physics","score_opus":0.003953022700178417,"score_gpt":0.1925948955714602,"score_spread":0.18864187287128178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522265958","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.96712774,0.004417549,0.019740436,0.000055738252,0.003661538,0.000092096445,3.5116042e-7,0.00007747159,0.004827073],"genre_scores_gemma":[0.99941117,0.00028204676,0.0000030655897,0.000014380782,0.0001518483,8.595267e-7,2.604275e-7,0.000027034155,0.00010934387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986096,0.00007634656,0.00046110284,0.00006356326,0.00029254705,0.0004968106],"domain_scores_gemma":[0.9992817,0.00014731781,0.00017396975,0.0001888569,0.00013638432,0.00007177803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021113208,0.0001427437,0.00020420524,0.0002454461,0.00011207187,0.000032529373,0.00035800604,0.000078086465,0.000008322982],"category_scores_gemma":[0.0000315287,0.000104550636,0.00020480606,0.0005669383,0.00004468773,0.00012836051,0.0000121117,0.0006844296,0.000008314113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099460005,0.000058573794,0.00013178393,0.000028397664,0.00023756037,0.000019480638,0.00046048028,0.0007164213,0.008224474,0.9888268,0.00039608253,0.00080047577],"study_design_scores_gemma":[0.0010130167,0.0007005252,0.0006301391,0.00006243519,0.00012774942,0.0010230555,0.0006366621,0.0002265033,0.016757747,0.96912664,0.009451326,0.00024419426],"about_ca_topic_score_codex":0.000002629841,"about_ca_topic_score_gemma":0.000011169641,"teacher_disagreement_score":0.032283414,"about_ca_system_score_codex":0.00021114698,"about_ca_system_score_gemma":0.000054038173,"threshold_uncertainty_score":0.4263451},"labels":[],"label_agreement":null},{"id":"W1522679550","doi":"10.37236/5056","title":"The CI Problem for Infinite Groups","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","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 Lethbridge","funders":"","keywords":"Infinite group; Group (periodic table); Mathematics; Combinatorics; Finite group; Discrete mathematics; Physics","score_opus":0.04286100853564823,"score_gpt":0.33607413585482865,"score_spread":0.2932131273191804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522679550","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.31744552,0.061747957,0.49979016,0.0650041,0.012948977,0.014747695,0.00021696233,0.00044150298,0.02765712],"genre_scores_gemma":[0.9914338,0.0036931888,0.00014927042,0.000057610127,0.0008774123,0.00014556276,0.0000028370612,0.00016385726,0.0034764467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950292,0.0008040558,0.0012782923,0.00025985242,0.0011803254,0.0014482881],"domain_scores_gemma":[0.987271,0.008139277,0.0019084873,0.0012175443,0.001329086,0.00013456527],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.013112818,0.0004414471,0.0007425996,0.00020016522,0.0005864269,0.00024508836,0.0033353542,0.0003508284,0.000016221617],"category_scores_gemma":[0.002508178,0.00020753252,0.00065595115,0.00029402395,0.00029698163,0.00010370761,0.0008553325,0.0036955215,0.000017847922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003993127,0.00013116992,0.0000142045965,0.0002014688,0.00053840934,0.000004046329,0.00033183422,0.0000058597598,0.000057555888,0.9898849,0.0068078083,0.0016234368],"study_design_scores_gemma":[0.001256573,0.00077755935,0.000007845675,0.0002703398,0.00020680205,0.00011616295,0.00011174297,0.0000629064,0.00031762518,0.96585506,0.03076562,0.00025176752],"about_ca_topic_score_codex":0.0000016821076,"about_ca_topic_score_gemma":0.0000069386247,"teacher_disagreement_score":0.6739883,"about_ca_system_score_codex":0.0010410495,"about_ca_system_score_gemma":0.0020100572,"threshold_uncertainty_score":0.998603},"labels":[],"label_agreement":null},{"id":"W1523516139","doi":"10.37236/1167","title":"Maximal Fillings of Moon Polyominoes, Simplicial Complexes, and Schubert Polynomials","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"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":"Polyomino; Bijection; Combinatorics; Schubert polynomial; Mathematics; Vertex (graph theory); Permutation (music); Simplicial complex; Enumerative combinatorics; Connection (principal bundle); Geometry; Graph; Physics","score_opus":0.026678800081841113,"score_gpt":0.2986068591763595,"score_spread":0.2719280590945184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523516139","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.97858816,0.006029134,0.013103242,0.0003525308,0.0009024816,0.0003308604,0.0000048010097,0.000030025913,0.0006587631],"genre_scores_gemma":[0.99820065,0.00040769944,0.00078869757,0.000037256603,0.00039117582,0.0000032865073,5.784495e-7,0.000056389646,0.000114232775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971237,0.00018682498,0.0010758344,0.000116651914,0.0006317774,0.0008651723],"domain_scores_gemma":[0.9963069,0.0013402238,0.0014390895,0.00040967145,0.00032976878,0.00017434922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165987,0.00028849827,0.0007977832,0.00015084045,0.00015494484,0.000025789808,0.000610884,0.00013815978,0.00001916706],"category_scores_gemma":[0.00094934605,0.00020766129,0.00018502268,0.0003317506,0.00017653557,0.00033948797,0.00015836276,0.000779972,0.0000029796506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012978737,0.00036588524,0.00035538763,0.00007951934,0.00014152749,0.0000013427384,0.00072930625,0.0000023795246,0.0038729047,0.9932985,0.00068970694,0.00033376517],"study_design_scores_gemma":[0.0012618499,0.00057359564,0.0001748177,0.0000692253,0.00022411415,0.00030982934,0.00022862141,0.00003117425,0.01703673,0.97798276,0.0018965809,0.00021068835],"about_ca_topic_score_codex":0.000011125481,"about_ca_topic_score_gemma":0.0000019815093,"teacher_disagreement_score":0.019612523,"about_ca_system_score_codex":0.00029769778,"about_ca_system_score_gemma":0.00025244034,"threshold_uncertainty_score":0.84681815},"labels":[],"label_agreement":null},{"id":"W1525993358","doi":"10.37236/1644","title":"Non-Repetitive Tilings","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":21,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Alphabet; Construct (python library); Combinatorics; Word (group theory); Plane (geometry); Type (biology); Square (algebra); Property (philosophy); Combinatorics on words; Discrete mathematics; Geometry; Computer science; Linguistics","score_opus":0.007394260334922949,"score_gpt":0.20476788377673022,"score_spread":0.19737362344180728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525993358","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.1430117,0.005105629,0.8325972,0.008519594,0.00055696804,0.00017996175,3.6268895e-7,0.000066128276,0.009962452],"genre_scores_gemma":[0.99840635,0.0004943022,0.00007733554,0.00012502338,0.0000545347,0.00000204097,1.0861221e-7,0.000006091839,0.0008342173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990533,0.000030672265,0.00023505597,0.00009011397,0.00028163235,0.00030920823],"domain_scores_gemma":[0.99911624,0.000089160574,0.00023199503,0.00035488143,0.00015531453,0.00005243035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047591503,0.000080680584,0.00012448881,0.00005822417,0.00013666238,0.00006737373,0.001189833,0.000028794828,0.000017830642],"category_scores_gemma":[0.000021136726,0.000055066812,0.00009472738,0.00045096027,0.000033234326,0.0002145924,0.00008137635,0.00040999398,0.000060230475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010733693,0.000090025016,0.00002648904,0.0000015733715,0.000022735629,0.0000051216343,0.00041490182,0.000013619273,0.00048582355,0.9950328,0.0016471304,0.002258705],"study_design_scores_gemma":[0.0008253382,0.0005030223,0.00044674697,0.000020573127,0.000041406074,0.0006327977,0.000065861845,0.034486175,0.009392148,0.88565505,0.06772346,0.00020742882],"about_ca_topic_score_codex":0.0000018375988,"about_ca_topic_score_gemma":5.1231285e-7,"teacher_disagreement_score":0.85539466,"about_ca_system_score_codex":0.00011575002,"about_ca_system_score_gemma":0.0000923193,"threshold_uncertainty_score":0.22455595},"labels":[],"label_agreement":null},{"id":"W1526980774","doi":"10.37236/318","title":"Value-Peaks of Permutations","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"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":"National Science Council","keywords":"Combinatorics; Mathematics; Sigma; Partially ordered set; Permutation (music); Value (mathematics); Set (abstract data type); Discrete mathematics; Physics; Statistics","score_opus":0.012874271294280905,"score_gpt":0.3050202986029429,"score_spread":0.29214602730866196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526980774","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.9270397,0.00048599427,0.06568009,0.000741883,0.0022994354,0.00029147448,0.0000018721041,0.00003832643,0.0034212545],"genre_scores_gemma":[0.99836975,0.000082112405,0.0010820818,0.00001715667,0.00016397226,0.0000034715688,2.6930942e-7,0.0000417441,0.00023946614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978092,0.00012136241,0.0008624333,0.00009303885,0.000664027,0.00044996772],"domain_scores_gemma":[0.99601954,0.0014692263,0.0012161151,0.00053210655,0.0006803306,0.000082678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017656672,0.00018385483,0.00045884974,0.00013101302,0.0001292282,0.000020077892,0.00086186454,0.000108322005,0.000028724518],"category_scores_gemma":[0.002087354,0.00012631649,0.00022500707,0.00046101882,0.00014477651,0.0001720065,0.000069350324,0.001425759,0.0000049694227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022517852,0.00028973052,0.000031321037,0.00003688011,0.00009246826,0.0000027748374,0.0006182417,0.000018922943,0.0040712412,0.9943937,0.00028134207,0.00014083862],"study_design_scores_gemma":[0.0008252706,0.0003899137,0.000029253335,0.00003132784,0.00016058025,0.00023044333,0.00023683865,0.00011064069,0.008553957,0.98797864,0.0013307688,0.00012236639],"about_ca_topic_score_codex":0.0000017665826,"about_ca_topic_score_gemma":0.000003388836,"teacher_disagreement_score":0.07133005,"about_ca_system_score_codex":0.00013623836,"about_ca_system_score_gemma":0.0005374136,"threshold_uncertainty_score":0.6194293},"labels":[],"label_agreement":null},{"id":"W1527608075","doi":"10.37236/460","title":"Another Abstraction of the Erdős-Szekeres Happy End Theorem","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Tel Aviv University; Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Integer (computer science); Simple (philosophy); Regular polygon; Set (abstract data type); Discrete mathematics; General position; Plane (geometry); Geometry; Computer science","score_opus":0.0073306789534315605,"score_gpt":0.25351135019581006,"score_spread":0.2461806712423785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527608075","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.77748173,0.0016985849,0.20788588,0.004769433,0.0026002938,0.0003488538,0.000001266585,0.000040264276,0.005173676],"genre_scores_gemma":[0.999273,0.0001340201,0.000112306516,0.00006234164,0.00007823754,0.0000016510736,4.4976083e-8,0.000014224899,0.0003241936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804366,0.00024592702,0.00037209535,0.00012269606,0.00073315954,0.00048246465],"domain_scores_gemma":[0.9976777,0.0005739089,0.00058151706,0.0007663059,0.0003512268,0.000049362887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024218622,0.00012829633,0.00019242759,0.000107753505,0.00019962483,0.00005722637,0.0026539692,0.00007142237,0.000029919445],"category_scores_gemma":[0.00026435728,0.0000678926,0.00018247473,0.00066361437,0.00027389618,0.0003792772,0.00018293626,0.0016621659,0.0000054664715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033407425,0.00008613923,0.00021793028,0.0000037480288,0.000041327774,0.0000016006095,0.00021729861,0.00005242988,0.020745935,0.97500277,0.00012192536,0.0034754674],"study_design_scores_gemma":[0.0003277473,0.00022019066,0.0017579144,0.000013029378,0.000012149397,0.00018825132,0.000041890846,0.00026687168,0.057965435,0.9349438,0.0041870857,0.00007563639],"about_ca_topic_score_codex":0.0000048713678,"about_ca_topic_score_gemma":0.000012672833,"teacher_disagreement_score":0.22179122,"about_ca_system_score_codex":0.00009507698,"about_ca_system_score_gemma":0.00047218555,"threshold_uncertainty_score":0.72213763},"labels":[],"label_agreement":null},{"id":"W1529426207","doi":"10.37236/2570","title":"Note on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Complement (music); Upper and lower bounds; Rank (graph theory); Type (biology); Chemistry","score_opus":0.01591747753785912,"score_gpt":0.2818817897808203,"score_spread":0.2659643122429612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529426207","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.19045684,0.0013973366,0.80063474,0.005280889,0.00085737597,0.00091508677,7.9570293e-7,0.000050680956,0.00040628397],"genre_scores_gemma":[0.99782217,0.00026416723,0.0012298276,0.00025749477,0.000054323005,0.000025046998,2.9832256e-7,0.000021489452,0.00032520568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979489,0.00020059364,0.00032470954,0.00016253791,0.00047353288,0.00088971277],"domain_scores_gemma":[0.99768406,0.0008523845,0.00029304795,0.0004795097,0.00055757345,0.00013344608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168881,0.00015387964,0.00023330959,0.00015381917,0.00019338391,0.00012316326,0.0018084365,0.00006828058,0.000005112615],"category_scores_gemma":[0.00031283163,0.00010489615,0.00013882396,0.00067328097,0.00007550366,0.0003691077,0.0001067084,0.0008303139,0.000032254688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010303795,0.00012979736,0.00005090334,0.00001345984,0.000058045734,0.0000030323888,0.00030433782,0.0021596628,0.0009383721,0.98951703,0.0014887351,0.0052335677],"study_design_scores_gemma":[0.0008406099,0.0026180155,0.00008925724,0.000026015541,0.000012882886,0.00007019258,0.000023010187,0.008675849,0.003393566,0.97829837,0.005823274,0.0001289451],"about_ca_topic_score_codex":0.000006441311,"about_ca_topic_score_gemma":0.0000024182443,"teacher_disagreement_score":0.8073653,"about_ca_system_score_codex":0.000494222,"about_ca_system_score_gemma":0.0006357882,"threshold_uncertainty_score":0.42775407},"labels":[],"label_agreement":null},{"id":"W1530270864","doi":"10.37236/344","title":"The Centers of Gravity of the Associahedron and of the Permutahedron are the Same","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"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; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Realization (probability); Center of gravity; Center (category theory); Statistics; Chemistry","score_opus":0.0091590157286692,"score_gpt":0.26143792284735917,"score_spread":0.25227890711869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530270864","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.9925215,0.0010959839,0.00028466558,0.0035976165,0.001727464,0.0005358565,0.0000075571706,0.000007309538,0.00022203871],"genre_scores_gemma":[0.999186,0.00039770515,0.000028055245,0.000031601478,0.00008446851,0.0000046470022,8.646045e-8,0.00003712262,0.00023031897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966508,0.0005467086,0.0010472307,0.000121079574,0.001118963,0.0005152064],"domain_scores_gemma":[0.9914319,0.0030522514,0.0036419004,0.0011957469,0.0006279642,0.00005027446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036117716,0.0002579938,0.00060616113,0.000039125516,0.00046809524,0.000030403788,0.0022795142,0.00014028983,0.0000035036362],"category_scores_gemma":[0.0027370062,0.000099175166,0.00041859204,0.0005069965,0.00080667296,0.00010017425,0.00039165272,0.0018928107,2.7377587e-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.000067918416,0.00026581888,0.0022015336,0.00008507425,0.00021652461,3.7292463e-7,0.0014476056,0.000010689477,0.004382735,0.9907943,0.00034678992,0.00018062007],"study_design_scores_gemma":[0.0008516846,0.00023972474,0.002227174,0.00013968395,0.00028728726,0.000072752206,0.0012857877,0.000054920212,0.014991007,0.9790869,0.0006598993,0.00010321291],"about_ca_topic_score_codex":0.000013549488,"about_ca_topic_score_gemma":0.000075791475,"teacher_disagreement_score":0.01170745,"about_ca_system_score_codex":0.00020313296,"about_ca_system_score_gemma":0.00041149158,"threshold_uncertainty_score":0.8223426},"labels":[],"label_agreement":null},{"id":"W1533352408","doi":"10.37236/707","title":"An Erdős-Ko-Rado Theorem for Multisets","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Element (criminal law); Discrete mathematics; Law","score_opus":0.038360408509622294,"score_gpt":0.3028242215553487,"score_spread":0.2644638130457264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533352408","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.9401527,0.0019061406,0.052688867,0.0001583143,0.0014679023,0.0004674212,0.0000051688135,0.000049986033,0.0031034674],"genre_scores_gemma":[0.99869996,0.0001935753,0.00066155585,0.00007969952,0.00017948958,0.000005368571,5.2247293e-7,0.000044739973,0.00013506413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828666,0.00021288444,0.00049125165,0.0001189714,0.00031581233,0.0005744],"domain_scores_gemma":[0.9980076,0.0005563495,0.00054234953,0.00048393343,0.00030838972,0.0001013806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022136027,0.0001932272,0.0003365395,0.00009771827,0.00032385514,0.000024134199,0.0009897946,0.00010480439,0.000039787832],"category_scores_gemma":[0.00029495696,0.00011342228,0.0002477585,0.00016617117,0.0001230811,0.00017485647,0.000048718823,0.0006004542,0.0000011136341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023298379,0.00019883741,0.00011024368,0.000018425459,0.00014472907,0.000003623803,0.0028166939,0.0000014012925,0.00011461447,0.99491733,0.00045727962,0.0009838346],"study_design_scores_gemma":[0.0010896747,0.0011874506,0.00021717403,0.000017319355,0.00015687186,0.00016349947,0.000321037,0.00008991283,0.002675879,0.9925157,0.0014141105,0.00015139463],"about_ca_topic_score_codex":0.0000021140124,"about_ca_topic_score_gemma":0.000002738241,"teacher_disagreement_score":0.05854725,"about_ca_system_score_codex":0.00012362894,"about_ca_system_score_gemma":0.00016739106,"threshold_uncertainty_score":0.4625226},"labels":[],"label_agreement":null},{"id":"W1533466804","doi":"10.37236/3605","title":"Square-Free Words with Square-Free Self-Shuffles","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"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 Winnipeg","funders":"","keywords":"Mathematics; Square-free integer; Square (algebra); Combinatorics; Discrete mathematics; Geometry","score_opus":0.0035218822975547205,"score_gpt":0.1908905607506606,"score_spread":0.1873686784531059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533466804","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.24094616,0.004886389,0.7409054,0.0076617934,0.0011603785,0.00024932492,0.0000012376414,0.00030300333,0.0038862932],"genre_scores_gemma":[0.9980378,0.00027789047,0.0009231878,0.00033498302,0.00022480178,0.0000039679535,3.2040225e-7,0.000030909683,0.00016615042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711376,0.0003540337,0.00049629033,0.00023988608,0.0009367328,0.000859267],"domain_scores_gemma":[0.99658644,0.00055370084,0.00060961815,0.0017992085,0.0002999444,0.00015109385],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002740408,0.00027875006,0.0004075431,0.0001724304,0.00026808103,0.00022938113,0.0054912907,0.00008720996,0.000008786745],"category_scores_gemma":[0.00020443322,0.00016805837,0.00017039443,0.00081280863,0.0000886766,0.0005775266,0.00046900386,0.0009210972,0.000013879753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038273996,0.00017649165,0.00022549559,0.000014670952,0.00010128357,0.000012027965,0.0006293722,0.000077552475,0.000048491427,0.99381703,0.0021025413,0.002756774],"study_design_scores_gemma":[0.0021461411,0.0020657438,0.00052534946,0.000068621615,0.00006639812,0.00058757054,0.00011121112,0.004425134,0.0008835867,0.9742966,0.01454289,0.000280719],"about_ca_topic_score_codex":0.000009198969,"about_ca_topic_score_gemma":0.000011267317,"teacher_disagreement_score":0.75709164,"about_ca_system_score_codex":0.00030063948,"about_ca_system_score_gemma":0.0005183102,"threshold_uncertainty_score":0.9998895},"labels":[],"label_agreement":null},{"id":"W1536629256","doi":"10.37236/484","title":"A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"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 Calgary","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Upper and lower bounds; Minkowski space; Constant (computer programming); Function (biology); Planar; Point (geometry); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01105788651696158,"score_gpt":0.264043747088684,"score_spread":0.2529858605717224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536629256","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.99516153,0.00071605295,0.00082598435,0.0005065914,0.001914377,0.00035390575,0.000012316181,0.0000056852678,0.0005035801],"genre_scores_gemma":[0.9994913,0.00008066884,0.00007937991,0.000055320044,0.00008185125,0.0000032726161,5.0378924e-7,0.000029352897,0.00017839501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979483,0.0001425892,0.0007520301,0.00010472031,0.0006164505,0.00043590053],"domain_scores_gemma":[0.9967301,0.0009401122,0.0012306155,0.00057343405,0.00046371957,0.00006203972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022077216,0.00019024796,0.00047058606,0.00009180261,0.00019266712,0.000017286235,0.0010779665,0.0001606026,0.000032574764],"category_scores_gemma":[0.0004671329,0.00009867107,0.00039854526,0.00020646588,0.00026854777,0.00008043413,0.000085409294,0.0010768274,3.3805162e-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.00023902021,0.00015434426,0.0003733355,0.0000723126,0.0002557735,0.000001940339,0.0009986474,0.0000011841996,0.0036253196,0.992763,0.0014385723,0.000076540004],"study_design_scores_gemma":[0.0013298511,0.0005165282,0.0005433962,0.000047452573,0.00019833124,0.0001884105,0.00013038222,0.000018638393,0.025952356,0.96936774,0.0015961833,0.00011073257],"about_ca_topic_score_codex":0.0000041862454,"about_ca_topic_score_gemma":0.000031134332,"teacher_disagreement_score":0.023395272,"about_ca_system_score_codex":0.000081494516,"about_ca_system_score_gemma":0.0004226569,"threshold_uncertainty_score":0.4678339},"labels":[],"label_agreement":null},{"id":"W1538770237","doi":"10.37236/3396","title":"Remarks on a Conjecture of Barát and Tóth","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"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; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Mathematics; Conjecture; Counterexample; Subdivision; Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.007093477513968651,"score_gpt":0.24895110354961106,"score_spread":0.2418576260356424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538770237","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.9882824,0.0016222751,0.0040173745,0.00046929953,0.0003952101,0.000107469445,7.651391e-7,0.000009229072,0.005096008],"genre_scores_gemma":[0.99932307,0.00032196767,0.00004711199,0.000099940095,0.00009394794,4.7210992e-7,9.8267606e-8,0.000016760952,0.00009662399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987444,0.00022864995,0.00036159388,0.0000745107,0.00032001286,0.00027078393],"domain_scores_gemma":[0.99804515,0.0010115952,0.0004793127,0.0002783217,0.00013601485,0.000049594593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017233663,0.00013001035,0.0003343151,0.00008383478,0.00011724033,0.000011971341,0.00034209518,0.00008252172,0.000011170255],"category_scores_gemma":[0.0005463478,0.00007201118,0.000110455854,0.00013750204,0.00011448905,0.00003862927,0.00004992919,0.00067990605,2.5342794e-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.000096844255,0.00004440875,0.00012102465,0.000026714059,0.00008756373,0.0000011500431,0.00047099555,0.0000041023245,0.000093564275,0.9976553,0.0005280852,0.0008702627],"study_design_scores_gemma":[0.0008434412,0.0011304778,0.00028247887,0.00005412203,0.00008494844,0.00015769886,0.000064325926,0.00003071827,0.0012678675,0.99416405,0.0018416004,0.000078275625],"about_ca_topic_score_codex":8.6155455e-7,"about_ca_topic_score_gemma":0.0000010478768,"teacher_disagreement_score":0.011040708,"about_ca_system_score_codex":0.000052597265,"about_ca_system_score_gemma":0.00007951629,"threshold_uncertainty_score":0.29538912},"labels":[],"label_agreement":null},{"id":"W1541859791","doi":"10.37236/587","title":"Vertex-Transitive $q$-Complementary Uniform Hypergraphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"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 Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Hypergraph; Vertex (graph theory); Order (exchange); Partition (number theory); Transitive relation; Permutation (music); Integer (computer science); Automorphism; Prime (order theory); Permutation group; Discrete mathematics; Graph; Physics","score_opus":0.06753642746723751,"score_gpt":0.3008666650945301,"score_spread":0.23333023762729257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541859791","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.96760094,0.0011599673,0.0050277943,0.00054619595,0.0005195593,0.0003436879,0.0000037428458,0.000040252893,0.024757883],"genre_scores_gemma":[0.9991547,0.00033640608,0.000102649654,0.00007056632,0.000049794857,0.0000033434874,7.3946916e-7,0.000039846585,0.00024193905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975579,0.00032689693,0.0005524378,0.00011363461,0.00066612515,0.00078304554],"domain_scores_gemma":[0.9980814,0.00070288003,0.00034117707,0.00039210124,0.00037383396,0.00010861814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029703435,0.0001930551,0.00034438047,0.00020805767,0.00016422637,0.000018897344,0.0009838612,0.00006578155,0.00017412924],"category_scores_gemma":[0.00018383535,0.00012835297,0.0002068963,0.0005299015,0.00015558819,0.00016324494,0.00007865669,0.0011593506,0.000012198491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027848655,0.00031168788,0.00025675565,0.000019077497,0.000286637,0.000029190775,0.0022777605,2.9658526e-7,0.0002455277,0.9954941,0.0004494174,0.00035104985],"study_design_scores_gemma":[0.001161671,0.0012499363,0.00020889548,0.000030054161,0.00012639872,0.00030539714,0.0011983737,0.000043293036,0.003420757,0.99138945,0.00072374794,0.00014202054],"about_ca_topic_score_codex":0.00001985475,"about_ca_topic_score_gemma":0.00001757846,"teacher_disagreement_score":0.031553797,"about_ca_system_score_codex":0.0003344877,"about_ca_system_score_gemma":0.00037242402,"threshold_uncertainty_score":0.5234082},"labels":[],"label_agreement":null},{"id":"W1542393439","doi":"10.37236/579","title":"Exterior Pairs and Up Step Statistics on Dyck Paths","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"Toronto Metropolitan University","funders":"National Science Council","keywords":"Equidistributed sequence; Mathematics; Combinatorics; Statistic; Automorphism; Bijection, injection and surjection; Discrete mathematics; Statistics; Bijection","score_opus":0.03760349564316957,"score_gpt":0.2830632771789675,"score_spread":0.24545978153579795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542393439","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.6663122,0.002499261,0.321176,0.0003276628,0.00448915,0.00090546825,0.000014801611,0.00013064677,0.004144804],"genre_scores_gemma":[0.99569404,0.0006592778,0.0028842618,0.00005782386,0.00011322977,0.0000065225327,3.5208595e-7,0.000072275616,0.0005122197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975381,0.00021802555,0.00079272996,0.00016413273,0.00063972885,0.0006472689],"domain_scores_gemma":[0.996844,0.0011911183,0.0009563413,0.000513473,0.0003489832,0.00014609563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014993277,0.00030131201,0.0005435496,0.00012045507,0.00017613024,0.00003875749,0.0006173838,0.000109829234,0.0000385207],"category_scores_gemma":[0.0009824191,0.00020612887,0.00010798018,0.00027936138,0.00013258161,0.00016035713,0.00010393378,0.0009806488,0.000011587054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014196963,0.00029234044,0.000042967087,0.00005720941,0.00010422665,0.000023632065,0.001366312,6.82562e-7,0.000050869687,0.9952039,0.001232837,0.0014830548],"study_design_scores_gemma":[0.0013376662,0.0019167126,0.0000777803,0.00009023378,0.00016352965,0.00022728193,0.00045252746,0.000092732356,0.0009737827,0.9931565,0.0012886868,0.00022258551],"about_ca_topic_score_codex":0.0000022822203,"about_ca_topic_score_gemma":0.0000025070158,"teacher_disagreement_score":0.32938182,"about_ca_system_score_codex":0.00030959095,"about_ca_system_score_gemma":0.00026230162,"threshold_uncertainty_score":0.84056914},"labels":[],"label_agreement":null},{"id":"W1542673380","doi":"10.37236/4822","title":"Hyperbinary Expansions and Stern Polynomials","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Integer (computer science); Sequence (biology); Polynomial; Class (philosophy); Function (biology); Generating function; Stern; Difference polynomials; Discrete mathematics; Orthogonal polynomials; Mathematical analysis","score_opus":0.05986491884891614,"score_gpt":0.32180774631230796,"score_spread":0.2619428274633918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542673380","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.9719355,0.0061110416,0.017153697,0.0012896635,0.0015428446,0.0003135722,0.00000112391,0.000054556614,0.0015979774],"genre_scores_gemma":[0.9984166,0.00035588458,0.00041572022,0.000054503536,0.00020418086,0.0000041269805,1.8365225e-7,0.000046762343,0.00050201965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978696,0.00021777676,0.00066793273,0.000119978235,0.0005989502,0.000525728],"domain_scores_gemma":[0.99727786,0.0009882248,0.0006822137,0.00042047864,0.00041996656,0.0002112666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020981377,0.00021768003,0.00049799756,0.00010715071,0.00012902639,0.000044656852,0.00056788087,0.00009384792,0.0000043538053],"category_scores_gemma":[0.0013453966,0.00014468087,0.000107205844,0.0002865426,0.00010618663,0.00024904803,0.00016061928,0.00072948326,0.0000067312594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007367959,0.0001982789,0.000058196096,0.000021457383,0.00007969078,0.0000146716,0.00097398006,0.00000607013,0.00022272705,0.99619436,0.0018896848,0.00026719368],"study_design_scores_gemma":[0.0016364402,0.00086943223,0.00001414769,0.000050651226,0.00013069017,0.0007086806,0.0008151647,0.000048524722,0.0007644897,0.99171245,0.0030902948,0.00015902179],"about_ca_topic_score_codex":0.0000022827232,"about_ca_topic_score_gemma":0.0000013978815,"teacher_disagreement_score":0.026481096,"about_ca_system_score_codex":0.0003119485,"about_ca_system_score_gemma":0.0005479903,"threshold_uncertainty_score":0.5899915},"labels":[],"label_agreement":null},{"id":"W1543709120","doi":"10.37236/2166","title":"Forbidden Submatrices: Some New Bounds and Constructions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Universities Space Research Association","keywords":"Combinatorics; Hypergraph; Mathematics; Vertex (graph theory); Order (exchange); Simple (philosophy); Matrix (chemical analysis); Block matrix; Discrete mathematics; Graph; Physics; Eigenvalues and eigenvectors","score_opus":0.0028402254465351925,"score_gpt":0.1610518127403532,"score_spread":0.158211587293818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543709120","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.9607474,0.03371467,0.00242624,0.00020770518,0.0009969821,0.00013370907,3.9424688e-7,0.00004708011,0.001725811],"genre_scores_gemma":[0.99821305,0.0013994671,0.0000073406927,0.000015141507,0.00015957444,0.0000023479533,2.035108e-7,0.000016209942,0.00018664553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920446,0.000039035505,0.00025677567,0.000045178414,0.0001453188,0.00030922997],"domain_scores_gemma":[0.9995333,0.00007727138,0.00009747991,0.00012832951,0.00007527199,0.000088324734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024862008,0.00010314284,0.00016795212,0.0000891854,0.00010574818,0.000074431766,0.00021830862,0.000050429542,0.000019313007],"category_scores_gemma":[0.000012274605,0.00007197074,0.000067323475,0.00019949484,0.000047485217,0.00030881568,0.000013293206,0.00040393465,0.000013412744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042997026,0.0000077352615,0.0002060697,0.00002494537,0.000106898224,9.974029e-7,0.00051309145,0.00011553659,0.00038999983,0.995693,0.0015169226,0.0014204852],"study_design_scores_gemma":[0.0005450961,0.00016348943,0.00030727818,0.000018345241,0.00005670637,0.00048126094,0.0009137347,0.00017274627,0.0005045236,0.98822963,0.008499658,0.00010754081],"about_ca_topic_score_codex":0.000010918208,"about_ca_topic_score_gemma":0.0000019523357,"teacher_disagreement_score":0.03746566,"about_ca_system_score_codex":0.000105970976,"about_ca_system_score_gemma":0.00010774288,"threshold_uncertainty_score":0.29348814},"labels":[],"label_agreement":null},{"id":"W1544545299","doi":"10.37236/791","title":"$\\overline{\\cal R}(3,4)=17$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Overline; Line (geometry); State (computer science); Upper and lower bounds; Discrete mathematics; Physics; Geometry; Mathematical analysis; Algorithm","score_opus":0.024897423045848976,"score_gpt":0.27149773401503274,"score_spread":0.24660031096918378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544545299","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.98243,0.002947035,0.007411225,0.00054316566,0.0009846803,0.0001163631,8.4902206e-7,0.000030022618,0.0055366615],"genre_scores_gemma":[0.9969219,0.00092802546,0.00007709876,0.00015693608,0.00028595602,9.5265153e-7,1.9221572e-7,0.000026347749,0.0016025968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982079,0.00015140948,0.00050383084,0.000088847184,0.0005403653,0.00050759676],"domain_scores_gemma":[0.9983,0.0005777787,0.00045207026,0.0003509137,0.00024033694,0.00007886794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011354256,0.00016779995,0.0003344332,0.000091602466,0.000408842,0.000012732423,0.0007088501,0.00008938889,0.000053931268],"category_scores_gemma":[0.00033689756,0.000097691074,0.00024808777,0.00027903146,0.00016217226,0.00011001736,0.00008387787,0.0010049845,0.0000032109049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006766313,0.00008833331,0.00022112,0.000006923019,0.00011342771,0.000027552012,0.0006927469,0.0000065280447,0.00003988931,0.99012053,0.008484975,0.00013032393],"study_design_scores_gemma":[0.00074945454,0.00039697377,0.00029029348,0.00001164591,0.000070439375,0.001772001,0.00007106799,0.000021713216,0.0004911378,0.98269975,0.013306642,0.00011885415],"about_ca_topic_score_codex":0.0000013061617,"about_ca_topic_score_gemma":0.0000010711648,"teacher_disagreement_score":0.014491896,"about_ca_system_score_codex":0.00018499739,"about_ca_system_score_gemma":0.00028666283,"threshold_uncertainty_score":0.43662134},"labels":[],"label_agreement":null},{"id":"W1544981408","doi":"10.37236/1839","title":"Half-Simple Symmetric Venn Diagrams","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Venn diagram; Intersection (aeronautics); Simple (philosophy); Mathematics; Diagram; Combinatorics; Point (geometry); Discrete mathematics; Geometry; Statistics","score_opus":0.02075874662687693,"score_gpt":0.29264575399252496,"score_spread":0.271887007365648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544981408","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.7571691,0.0064698807,0.22639254,0.002444842,0.0032587247,0.0007976966,0.0000019341571,0.00017988545,0.0032853687],"genre_scores_gemma":[0.9984623,0.0004918537,0.0004785655,0.00005622477,0.00029480344,0.000007682052,5.863316e-7,0.00007482177,0.00013312962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968995,0.00014605263,0.0009415026,0.00016109295,0.0009400498,0.00091183925],"domain_scores_gemma":[0.9964718,0.0011376344,0.0011017262,0.0006505293,0.00048435587,0.00015390647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019161681,0.00030787586,0.0006229056,0.00024085738,0.00023159172,0.00006262029,0.0011574321,0.00013238624,0.00001241256],"category_scores_gemma":[0.002026172,0.00021233152,0.0003069821,0.0013356853,0.000099802186,0.00026365978,0.000121832425,0.0012829953,0.000025326117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003350214,0.00045522585,0.0000243232,0.00003909346,0.00013226963,0.00002221536,0.00032792488,0.00007976283,0.00008928338,0.9980382,0.00032352493,0.00043468532],"study_design_scores_gemma":[0.0021568227,0.00086778426,0.000019907615,0.00005735671,0.00017590584,0.00041172683,0.0001791088,0.000018824157,0.0023907698,0.9898411,0.0036514304,0.00022928648],"about_ca_topic_score_codex":0.0000058561445,"about_ca_topic_score_gemma":0.000005835231,"teacher_disagreement_score":0.24129319,"about_ca_system_score_codex":0.0011911696,"about_ca_system_score_gemma":0.00065594236,"threshold_uncertainty_score":0.8658628},"labels":[],"label_agreement":null},{"id":"W1546598357","doi":"10.37236/4053","title":"On the Hyperbolicity of Random Graphs","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Binomial (polynomial); Random graph; Discrete mathematics; Statistics","score_opus":0.008707904971047311,"score_gpt":0.24355808628778286,"score_spread":0.23485018131673555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546598357","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.5455131,0.0011004391,0.4471173,0.0036643927,0.00036780114,0.00018220086,2.34074e-7,0.000017971059,0.0020365443],"genre_scores_gemma":[0.99939424,0.0002765379,0.00003550682,0.00018586831,0.000028952756,0.0000021728888,3.52165e-8,0.000008787639,0.00006792357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762344,0.0007293043,0.0003466062,0.00010460028,0.0007258186,0.00047023658],"domain_scores_gemma":[0.99613386,0.0024182182,0.0004028535,0.0006770036,0.00030810057,0.00005997384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004902955,0.000117561096,0.00026365436,0.00013682725,0.000183777,0.00003683123,0.0026028543,0.00003624322,0.0000049142823],"category_scores_gemma":[0.0006534857,0.00005762341,0.00018896011,0.0008250931,0.00016862669,0.00016086649,0.00013584747,0.00090503576,0.0000052835894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009563133,0.000074367934,0.000033314718,0.0000027032015,0.000040953135,8.033962e-7,0.00014356911,0.00017198248,0.00047353073,0.99746376,0.0001485388,0.0013508372],"study_design_scores_gemma":[0.0010352042,0.0008258386,0.00011188237,0.000014788268,0.000010304942,0.00004712496,0.000017048504,0.0011168997,0.006818378,0.98894286,0.000997881,0.00006180234],"about_ca_topic_score_codex":0.0000021768883,"about_ca_topic_score_gemma":8.860846e-7,"teacher_disagreement_score":0.45388108,"about_ca_system_score_codex":0.00007803205,"about_ca_system_score_gemma":0.00018842462,"threshold_uncertainty_score":0.4836794},"labels":[],"label_agreement":null},{"id":"W1548662877","doi":"10.37236/508","title":"Digraphs are $2$-Weight Choosable","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Digraph; Algebraic number; Graph; Weighting; Discrete mathematics","score_opus":0.013918262938280582,"score_gpt":0.1897037726936705,"score_spread":0.17578550975538992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548662877","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.5626351,0.08895954,0.3076968,0.010083754,0.009980182,0.0005435589,0.0000011246982,0.00041068136,0.019689236],"genre_scores_gemma":[0.9978515,0.0014648002,0.00023155415,0.0002062505,0.000015182921,0.0000014202208,7.2545156e-8,0.000009976028,0.00021924735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840015,0.00011518164,0.00038265967,0.0001343438,0.00042327584,0.0005443991],"domain_scores_gemma":[0.9984762,0.00007594323,0.0005129465,0.0005005512,0.0003275218,0.000106829335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012510169,0.0001378478,0.00022135614,0.00015563265,0.00018228256,0.000057123656,0.0015734686,0.00005435899,0.000011360667],"category_scores_gemma":[0.00004742718,0.00008393298,0.00015709214,0.0007794536,0.00005946072,0.00035089545,0.00011211239,0.000591633,0.000019852423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011218777,0.0001355173,0.00066481356,0.0000040586383,0.000052055027,0.000011927597,0.000350974,0.0000070367187,0.00007458294,0.99654394,0.0016897512,0.00045413602],"study_design_scores_gemma":[0.00052318233,0.00040382094,0.00061111274,0.00002393899,0.00002496994,0.00020436125,0.00003394659,0.00021430958,0.002824472,0.9894481,0.0055728885,0.00011490919],"about_ca_topic_score_codex":0.000009318669,"about_ca_topic_score_gemma":0.0000018529306,"teacher_disagreement_score":0.43521637,"about_ca_system_score_codex":0.00006933714,"about_ca_system_score_gemma":0.00024693544,"threshold_uncertainty_score":0.34226876},"labels":[],"label_agreement":null},{"id":"W1550173909","doi":"10.37236/1107","title":"Encores on Cores","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Random graph; Combinatorics; Sequence (biology); Discrete mathematics; Simple (philosophy); Poisson distribution; Random regular graph; Degree (music); Graph; Line graph; Pathwidth; Statistics","score_opus":0.010959225790021314,"score_gpt":0.2607164635614196,"score_spread":0.24975723777139827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550173909","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.98409086,0.0019642902,0.0019234578,0.00063714635,0.0008447539,0.00010671407,7.8538005e-7,0.000024383029,0.0104076],"genre_scores_gemma":[0.99886763,0.00019825058,0.00002296965,0.00007271029,0.00027667696,0.0000010760375,1.880407e-7,0.000020406473,0.0005400973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986246,0.000107634034,0.00038214176,0.00007190932,0.0004289978,0.00038468582],"domain_scores_gemma":[0.99834335,0.00080609025,0.00040304236,0.0002738806,0.00014123223,0.00003240115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009513105,0.00013827135,0.00023280074,0.00009600081,0.00027437232,0.00002480906,0.00054049067,0.000060298717,0.000022191127],"category_scores_gemma":[0.00019378413,0.00007572819,0.00016561602,0.00019182738,0.00009133861,0.000055793338,0.000041968106,0.0006314529,0.0000024809726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007137537,0.00009898274,0.00030335903,0.000007987132,0.00004852944,0.00000731335,0.00013144354,0.000033674845,0.00002868865,0.99261606,0.0065307505,0.000121822995],"study_design_scores_gemma":[0.00049739564,0.00052164774,0.00060675346,0.0000223636,0.000054142467,0.0001317194,0.00004578862,0.000012077273,0.0012313602,0.9897944,0.006991687,0.00009069333],"about_ca_topic_score_codex":0.000004924813,"about_ca_topic_score_gemma":0.0000079386555,"teacher_disagreement_score":0.014776755,"about_ca_system_score_codex":0.00014459906,"about_ca_system_score_gemma":0.000100317855,"threshold_uncertainty_score":0.3088106},"labels":[],"label_agreement":null},{"id":"W1554222672","doi":"10.37236/1052","title":"Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Mathematics; Combinatorics; Integer sequence; Integer (computer science); Pisano period; Binary number; Discrete mathematics; Binary tree; Fibonacci polynomials; Generating function; Arithmetic; Computer science","score_opus":0.017613448403264544,"score_gpt":0.2302005328627704,"score_spread":0.21258708445950586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554222672","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.81459373,0.08423422,0.09256503,0.006437563,0.000571633,0.00016863624,0.000002243435,0.000106824504,0.0013201265],"genre_scores_gemma":[0.99873203,0.0006468323,0.00015050029,0.00012069969,0.00007937579,0.000001073203,5.1373524e-7,0.000010794907,0.00025815069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982108,0.00024513016,0.0004258045,0.00015909052,0.00044584312,0.00051334227],"domain_scores_gemma":[0.9986416,0.00039676824,0.0004244218,0.0003454369,0.0001216852,0.00007006324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001655535,0.00019548951,0.0004299058,0.0001254184,0.00020311156,0.00017136015,0.0011739921,0.000051508945,0.00001013542],"category_scores_gemma":[0.000020088311,0.00011404344,0.00019327653,0.00042177443,0.00011526017,0.00052450254,0.00010299577,0.00047153133,0.000002906655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001463297,0.000100659796,0.0003009658,0.000004238156,0.00028977284,0.000031281663,0.000096519565,0.00019123078,0.0011631066,0.996044,0.001149848,0.000613743],"study_design_scores_gemma":[0.0005463913,0.00053714024,0.002580268,0.000014203895,0.00028459143,0.0009675261,0.000046487363,0.003865854,0.0018572526,0.98499256,0.0041323956,0.00017530611],"about_ca_topic_score_codex":0.00004602653,"about_ca_topic_score_gemma":0.00001268398,"teacher_disagreement_score":0.18413834,"about_ca_system_score_codex":0.00013443791,"about_ca_system_score_gemma":0.00026724304,"threshold_uncertainty_score":0.46505564},"labels":[],"label_agreement":null},{"id":"W1555454948","doi":"10.37236/1587","title":"Weakly Self-Avoiding Words and a Construction of Friedman","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"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","keywords":"Subsequence; Alphabet; Word (group theory); Combinatorics; Mathematics; Sequence (biology); Upper and lower bounds; Longest increasing subsequence; Longest common subsequence problem; Combinatorics on words; Discrete mathematics; Linguistics","score_opus":0.003872217624354327,"score_gpt":0.19836813087052352,"score_spread":0.1944959132461692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555454948","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.87132996,0.0035399576,0.123440355,0.0007636796,0.00037456822,0.000048605758,1.0405325e-7,0.00002950096,0.0004732812],"genre_scores_gemma":[0.99778247,0.0016430555,0.0004539819,0.00003814626,0.0000515061,4.7523673e-7,4.9628763e-8,0.0000061738115,0.000024118748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889696,0.00014391559,0.0003119082,0.00008835526,0.000270215,0.0002886482],"domain_scores_gemma":[0.9990033,0.00021111994,0.00040011562,0.00022469048,0.0001112417,0.000049561633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014400949,0.000093085546,0.00019338804,0.000103959486,0.00013125474,0.000051429466,0.00060815795,0.000039962677,0.0000027604535],"category_scores_gemma":[0.000043068645,0.0000646046,0.00006265653,0.00043967366,0.000057444122,0.00032174523,0.00008867723,0.00043464976,8.5610725e-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.000012248281,0.000044420794,0.00044138785,0.000005500044,0.000045058554,0.0000051321413,0.000752808,0.0000039179486,0.0006800186,0.9934058,0.00003389096,0.0045697764],"study_design_scores_gemma":[0.0005072214,0.00041448348,0.0003948074,0.000032133372,0.000030853822,0.0015868688,0.0003688345,0.0020108137,0.003185431,0.9897403,0.0016379833,0.000090232694],"about_ca_topic_score_codex":0.0000031782993,"about_ca_topic_score_gemma":6.921049e-7,"teacher_disagreement_score":0.12645255,"about_ca_system_score_codex":0.000103796374,"about_ca_system_score_gemma":0.00019374058,"threshold_uncertainty_score":0.2634499},"labels":[],"label_agreement":null},{"id":"W1556817639","doi":"10.37236/1885","title":"Words Avoiding a Reflexive Acyclic Relation","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"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; National Science Foundation","keywords":"Mathematics; Combinatorics; Generating function; Diagonal; Interpretation (philosophy); Series (stratigraphy); Geometry","score_opus":0.020031451097780918,"score_gpt":0.30347435699685416,"score_spread":0.2834429058990732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556817639","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.7719068,0.002383007,0.21501105,0.001042657,0.0017920028,0.00043055776,8.0996693e-7,0.00011725528,0.0073158857],"genre_scores_gemma":[0.99782556,0.00014237549,0.0005348683,0.000022661308,0.0004369072,0.000005493549,6.5287344e-7,0.000060377988,0.0009711096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971494,0.00031519824,0.0009778267,0.00013828947,0.00075540383,0.0006638735],"domain_scores_gemma":[0.99603623,0.0017151595,0.0013580355,0.00045840594,0.00036907115,0.00006308811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025957006,0.00024885454,0.0004682864,0.00016117435,0.00031049695,0.000053947435,0.00067197136,0.00012871342,0.000012430141],"category_scores_gemma":[0.001201515,0.00017697572,0.00022041054,0.000660285,0.000074085576,0.00032110626,0.000078721096,0.0014740449,0.000012564742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051053266,0.00020846081,0.0000583526,0.00002437943,0.000062175524,0.000007843226,0.00040549663,0.00007095733,0.0005504735,0.99755627,0.00088643277,0.000118102915],"study_design_scores_gemma":[0.0010675313,0.00034560973,0.000051608757,0.00007940252,0.0001439924,0.00020268469,0.00023540657,0.00012374626,0.0021379264,0.9931664,0.0022610906,0.0001846259],"about_ca_topic_score_codex":0.0000037097195,"about_ca_topic_score_gemma":0.0000040112336,"teacher_disagreement_score":0.22591877,"about_ca_system_score_codex":0.0008907385,"about_ca_system_score_gemma":0.00029530402,"threshold_uncertainty_score":0.721686},"labels":[],"label_agreement":null},{"id":"W1558974145","doi":"10.37236/131","title":"Near Threshold Graphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Constructive; Lambda; Graph; Characterization (materials science); Degree (music); Discrete mathematics; Computer science; Physics","score_opus":0.017063879545052736,"score_gpt":0.28428539930241,"score_spread":0.26722151975735725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558974145","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.98785937,0.001559611,0.0030781506,0.0030781073,0.00013994702,0.0001397483,4.3799548e-7,0.000031133404,0.0041135005],"genre_scores_gemma":[0.9992415,0.0002573701,0.0000529194,0.00017354744,0.000044219967,0.0000015010286,1.9888563e-7,0.000010843102,0.00021792318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888825,0.00006839046,0.00034275418,0.000066545785,0.00027475326,0.00035929107],"domain_scores_gemma":[0.998937,0.00022157756,0.00032318206,0.0003137494,0.00014669873,0.000057778976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012274192,0.00011109916,0.00019848505,0.00005836383,0.00023315824,0.000038646933,0.0005539714,0.000049605613,0.000015651063],"category_scores_gemma":[0.00008281355,0.000070935785,0.00017107907,0.00043428963,0.00006548051,0.00009196839,0.000014246186,0.0006445088,0.0000072414114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023277022,0.00017986193,0.000032538,0.000002458287,0.000038043672,0.000001929025,0.00017227951,0.000007448667,0.00022265714,0.99752533,0.0015264319,0.00026773757],"study_design_scores_gemma":[0.00038880843,0.0003925025,0.00011896598,0.000011452195,0.00007362638,0.00013169773,0.00005729979,0.000021890455,0.0008429455,0.9937681,0.004113662,0.00007907602],"about_ca_topic_score_codex":2.88711e-7,"about_ca_topic_score_gemma":4.916558e-7,"teacher_disagreement_score":0.011382113,"about_ca_system_score_codex":0.00006668478,"about_ca_system_score_gemma":0.00015168102,"threshold_uncertainty_score":0.28926772},"labels":[],"label_agreement":null},{"id":"W1561267140","doi":"10.37236/1091","title":"The Number of Permutation Binomials over ${\\Bbb F}_{4p+1}$ where $p$ and $4p+1$ are Primes","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Finite field; Monic polynomial; Partial permutation; Discrete mathematics; Hermite polynomials; Degree (music); Primality test; Cyclic permutation; Prime number; Symmetric group; Pure mathematics; Polynomial","score_opus":0.003212088831226066,"score_gpt":0.21892021866081637,"score_spread":0.2157081298295903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561267140","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.96449745,0.009745874,0.022686826,0.001534437,0.00040197928,0.00010464425,5.747012e-7,0.000019886715,0.0010083318],"genre_scores_gemma":[0.998767,0.0009131752,0.000042219774,0.0000318627,0.00007831572,0.000001483621,1.2841068e-7,0.000008348165,0.00015744788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856585,0.00024029013,0.0003933591,0.00010845761,0.0003577486,0.00033426628],"domain_scores_gemma":[0.9982871,0.0005039915,0.00065349566,0.00030571755,0.00021388207,0.000035845875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556323,0.00012420336,0.00020707241,0.0000628883,0.0002832341,0.0001279073,0.0008111299,0.000049583694,0.0000047961707],"category_scores_gemma":[0.000045539295,0.000072432624,0.00013102902,0.00043349926,0.00012471846,0.00027442432,0.00009155195,0.00036394657,0.0000017191405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003489807,0.00005827238,0.0044754073,0.000008245524,0.00004718977,0.0000020806933,0.00019208007,0.000025115456,0.00033307125,0.99263763,0.00063810666,0.0015479242],"study_design_scores_gemma":[0.0005594347,0.00018277457,0.012881912,0.00003346019,0.000037748618,0.00014688962,0.00008775817,0.0002275947,0.0015665654,0.97995543,0.0042209565,0.00009949031],"about_ca_topic_score_codex":0.000011280505,"about_ca_topic_score_gemma":0.000008965456,"teacher_disagreement_score":0.034269575,"about_ca_system_score_codex":0.00007561421,"about_ca_system_score_gemma":0.00019031265,"threshold_uncertainty_score":0.29537168},"labels":[],"label_agreement":null},{"id":"W1561862754","doi":"10.37236/2796","title":"Generalized Alcuin's Sequence","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Integer (computer science); Sequence (biology); Modulo; Generating function; Function (biology); Discrete mathematics","score_opus":0.05783539937336117,"score_gpt":0.3442194959542728,"score_spread":0.28638409658091163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561862754","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.8741824,0.011299469,0.10371155,0.0014740356,0.0016144696,0.000353568,0.0000015763554,0.00008800043,0.0072749183],"genre_scores_gemma":[0.99559057,0.0005230861,0.00068815955,0.000057904792,0.0002524666,0.000002906707,1.887431e-7,0.000032709388,0.0028520152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979887,0.00015469236,0.00052426226,0.00006038283,0.00053209375,0.00073987007],"domain_scores_gemma":[0.9980932,0.0007117152,0.0005410305,0.00031472277,0.00022455113,0.00011480915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018772116,0.0001580097,0.00034547749,0.00006997395,0.000106727304,0.000029337385,0.0005489409,0.000058345897,0.00005848227],"category_scores_gemma":[0.0008557063,0.000099213205,0.00016427014,0.0002456104,0.00009857057,0.000419389,0.000068714406,0.0006146129,0.000027660422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001434224,0.00013745353,0.000048704853,0.000025474788,0.00007106551,0.0000025260192,0.00042081386,0.000003538,0.0005240073,0.99708074,0.0016190464,0.000052293268],"study_design_scores_gemma":[0.00045676174,0.00011961746,0.000012830637,0.000028036015,0.00011099156,0.0003679322,0.00018530684,0.000022472314,0.0033059123,0.9910018,0.0042723557,0.00011602205],"about_ca_topic_score_codex":0.0000013860125,"about_ca_topic_score_gemma":8.8785134e-7,"teacher_disagreement_score":0.12140816,"about_ca_system_score_codex":0.0003631296,"about_ca_system_score_gemma":0.00016637154,"threshold_uncertainty_score":0.40457973},"labels":[],"label_agreement":null},{"id":"W1563415799","doi":"10.37236/370","title":"Properties of the Steiner Triple Systems of Order 19","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Nokia Foundation; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Mathematics; Chromatic scale; Combinatorics; Order (exchange); Index (typography); Edge coloring; Discrete mathematics; Graph; Computer science","score_opus":0.004956060529502049,"score_gpt":0.16972398822276255,"score_spread":0.1647679276932605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563415799","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.98753315,0.008684645,0.0003420301,0.000061983395,0.0025537524,0.00016830361,9.835018e-7,0.000013011927,0.00064211903],"genre_scores_gemma":[0.9994049,0.00013598758,8.521588e-7,0.000004072871,0.00007596055,0.0000030518818,7.050789e-8,0.00002008208,0.00035502532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873066,0.00012920756,0.00051314966,0.000042788983,0.0003236028,0.00026059788],"domain_scores_gemma":[0.9989952,0.000057512912,0.0003259638,0.0003268205,0.00025974846,0.00003477187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012102361,0.000114782786,0.0002957364,0.00006603618,0.00005793725,0.000012843154,0.0006085667,0.0000716499,0.0000049344603],"category_scores_gemma":[0.00008447524,0.000056679914,0.00013567672,0.00041106678,0.00008972003,0.000075024494,0.000024331031,0.00071175484,0.0000010447839],"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.00005868855,0.00008492019,0.0006801662,0.00026716443,0.00029003117,7.5431524e-7,0.00084227807,0.0042501204,0.1534605,0.8394615,0.000536255,0.0000675896],"study_design_scores_gemma":[0.0069734487,0.0019155286,0.0017677266,0.0011132208,0.0008035795,0.0015551116,0.0044152215,0.008918702,0.5921437,0.3254935,0.053892512,0.0010077328],"about_ca_topic_score_codex":0.000014723569,"about_ca_topic_score_gemma":0.000007767863,"teacher_disagreement_score":0.513968,"about_ca_system_score_codex":0.000048299542,"about_ca_system_score_gemma":0.00017322155,"threshold_uncertainty_score":0.30922604},"labels":[],"label_agreement":null},{"id":"W1568296425","doi":"10.37236/1533","title":"Large Equiangular Sets of Lines in Euclidean Space","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equiangular polygon; Mathematics; Combinatorics; Euclidean space; Upper and lower bounds; Constructive; Euclidean geometry; Integer (computer science); Euclidean distance; Space (punctuation); Order (exchange); Dimension (graph theory); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Regular polygon; Process (computing); Computer science","score_opus":0.0035316720272018697,"score_gpt":0.20008741365690902,"score_spread":0.19655574162970715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568296425","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.9870125,0.010072338,0.00044841022,0.00010258261,0.000277361,0.00006924574,0.0000011575411,0.000017548966,0.0019988539],"genre_scores_gemma":[0.99857783,0.0011342121,0.0000020994646,0.000010169646,0.000048666436,9.743108e-7,3.7293006e-7,0.000020490546,0.00020516156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988015,0.0001110055,0.00041757055,0.000048798607,0.00021146338,0.0004096532],"domain_scores_gemma":[0.999531,0.0000798559,0.000109445544,0.00018454964,0.000054667045,0.00004049285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012409186,0.000114644834,0.0002720809,0.000110440735,0.000030343586,0.00000972874,0.0003379878,0.00006128487,0.000057531895],"category_scores_gemma":[0.000020535932,0.00008456927,0.00010890874,0.00041787777,0.000023055127,0.000093954965,0.000009704084,0.00049159233,0.000007981342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011093893,0.00020478434,0.0011810535,0.00010578794,0.00020307457,0.000036197198,0.0022423994,0.011263561,0.0026577916,0.9798656,0.00066366355,0.0014651237],"study_design_scores_gemma":[0.0026128658,0.00063237885,0.0011938147,0.00023473513,0.00008070702,0.00032986348,0.0007469524,0.003246437,0.011566128,0.9500837,0.0289519,0.0003205373],"about_ca_topic_score_codex":0.0000031496622,"about_ca_topic_score_gemma":0.000009171376,"teacher_disagreement_score":0.029781943,"about_ca_system_score_codex":0.00009799472,"about_ca_system_score_gemma":0.000056728055,"threshold_uncertainty_score":0.34486347},"labels":[],"label_agreement":null},{"id":"W1568391928","doi":"10.37236/5180","title":"The Bondage Number of Random Graphs","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Domination analysis; Mathematics; Dominating set; Vertex (graph theory); Graph; Upper and lower bounds; Bound graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","score_opus":0.010165258565285135,"score_gpt":0.29121616005334944,"score_spread":0.28105090148806433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568391928","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.060789727,0.02775519,0.8943369,0.0073284963,0.00385843,0.0007819714,0.0000055036508,0.000060294322,0.0050835004],"genre_scores_gemma":[0.9913467,0.007621218,0.000084741754,0.00003072143,0.000091245194,0.000009800306,2.3170188e-7,0.00002871268,0.0007866031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550074,0.0009706673,0.0009208068,0.00026003338,0.0013637132,0.0009840606],"domain_scores_gemma":[0.99325305,0.0023887528,0.0016251793,0.0016476021,0.00096676196,0.00011867678],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006835918,0.00030434653,0.0006196655,0.00017197792,0.00034003973,0.00015096956,0.007109844,0.00016860302,0.0000071788927],"category_scores_gemma":[0.00044118054,0.00014317613,0.0005924774,0.00065118546,0.00043789492,0.0002486193,0.0015330728,0.00284475,0.000010367298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019166649,0.00006267135,0.00009059345,0.000019301015,0.0002477242,0.0000091506545,0.00018345163,0.000031626754,0.00011574599,0.9958404,0.00043739192,0.0027703005],"study_design_scores_gemma":[0.0014831534,0.00020480629,0.000041669937,0.000106273896,0.000038458107,0.00019375084,0.000023083478,0.000113225855,0.0018261557,0.9909192,0.0048879124,0.00016232012],"about_ca_topic_score_codex":0.00000258171,"about_ca_topic_score_gemma":0.000001632101,"teacher_disagreement_score":0.930557,"about_ca_system_score_codex":0.00032985833,"about_ca_system_score_gemma":0.0015933379,"threshold_uncertainty_score":0.99945575},"labels":[],"label_agreement":null},{"id":"W1572762747","doi":"10.37236/622","title":"Relating Different Cycle Spaces of the Same Infinite Graph","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Surjective function; Cycle basis; Combinatorics; Graph; Basis (linear algebra); Homeomorphism (graph theory); Discrete mathematics; Bijection, injection and surjection; Line graph; Graph power; Geometry","score_opus":0.023803348585518844,"score_gpt":0.2640841817242353,"score_spread":0.24028083313871645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572762747","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.9904536,0.0013658071,0.0044462434,0.00028536326,0.0004245667,0.000098880795,5.621281e-7,0.000011065211,0.0029139358],"genre_scores_gemma":[0.9992829,0.00026376266,0.000052934458,0.000039792056,0.00003540062,0.0000011526589,6.415705e-8,0.000016655902,0.00030735997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998576,0.00030328913,0.00046239578,0.000064761756,0.00025222354,0.000341334],"domain_scores_gemma":[0.99787104,0.0007583695,0.0008806347,0.00032892465,0.00012668449,0.00003434359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009955408,0.00013127274,0.0002977805,0.00006175255,0.00016701207,0.000005044146,0.0005920659,0.00008020086,0.000030480984],"category_scores_gemma":[0.00043963257,0.00006587025,0.00019796246,0.00022518019,0.00021386433,0.00008557524,0.000083044506,0.0009392954,0.0000013504422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006482792,0.00013473316,0.0015224129,0.0000132892355,0.00011226824,0.0000015045555,0.002213873,0.000010022481,0.00021792765,0.9955429,0.00004465507,0.00012162966],"study_design_scores_gemma":[0.0004609304,0.00029813376,0.0010581973,0.000046733672,0.00011130921,0.00008061983,0.0005885571,0.000012966486,0.0055869115,0.99159044,0.00009314352,0.00007208585],"about_ca_topic_score_codex":0.0000032830776,"about_ca_topic_score_gemma":0.000007972388,"teacher_disagreement_score":0.008829302,"about_ca_system_score_codex":0.00007709953,"about_ca_system_score_gemma":0.00010170737,"threshold_uncertainty_score":0.40808234},"labels":[],"label_agreement":null},{"id":"W1574374495","doi":"10.37236/4445","title":"Limits of Boolean Functions on $\\mathbb{F}_p^n$","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Limit (mathematics); Abelian group; Subspace topology; Sequence (biology); Affine transformation; Boolean function; Inverse limit; Discrete mathematics; Limit point; Pure mathematics; Mathematical analysis","score_opus":0.01753344308060332,"score_gpt":0.2714953866020699,"score_spread":0.25396194352146656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574374495","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.9574013,0.0009930804,0.026429422,0.0007826796,0.0014217844,0.00017361817,0.000002151611,0.000027942042,0.012768039],"genre_scores_gemma":[0.9989249,0.00014581643,0.000038012946,0.00013542514,0.00018105563,0.0000012243481,3.1119117e-7,0.000027277534,0.0005459738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813217,0.00035614666,0.0005562923,0.00008979386,0.0004797563,0.0003858187],"domain_scores_gemma":[0.99716276,0.0013892546,0.0006727968,0.0004406345,0.00026958136,0.000064997264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00315382,0.00016246634,0.00036169123,0.00013930965,0.00022390795,0.000015191537,0.0005769516,0.00008458975,0.000024132558],"category_scores_gemma":[0.0010359547,0.00009757941,0.00024247392,0.00026632682,0.00010005636,0.00006393249,0.00004069545,0.00079175294,0.000003232166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008686645,0.0001396695,0.000063318854,0.000024350058,0.00012571887,8.368612e-7,0.00032933353,0.000028275563,0.00012322469,0.994919,0.002389358,0.0017700385],"study_design_scores_gemma":[0.00061443564,0.0016187958,0.0001391196,0.000049928687,0.000117939104,0.000062461804,0.000120116136,0.000076997276,0.0014620482,0.9859803,0.009656173,0.00010168974],"about_ca_topic_score_codex":9.254373e-7,"about_ca_topic_score_gemma":0.0000014855812,"teacher_disagreement_score":0.04152362,"about_ca_system_score_codex":0.00010803969,"about_ca_system_score_gemma":0.00012015957,"threshold_uncertainty_score":0.3979173},"labels":[],"label_agreement":null},{"id":"W1574979076","doi":"10.37236/3007","title":"Unique Sequences Containing No $k$-Term Arithmetic Progressions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Generalization; Term (time); Sequence (biology); Simple (philosophy); Arithmetic progression; Discrete mathematics","score_opus":0.015600988080101566,"score_gpt":0.28380662618684754,"score_spread":0.26820563810674597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574979076","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.9897514,0.0022430094,0.002415479,0.0008048029,0.0008274277,0.00035406,5.600371e-7,0.000037956626,0.0035653003],"genre_scores_gemma":[0.99870473,0.0003638216,0.0002271907,0.00009700826,0.00014845734,0.000010685842,2.4865415e-7,0.000024948447,0.00042290837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981303,0.00028624653,0.0005206876,0.00009932592,0.00041360682,0.00054982887],"domain_scores_gemma":[0.9977004,0.00078043266,0.0005964522,0.00031091704,0.00051583495,0.00009597352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013660283,0.00018001109,0.00033230483,0.00010212098,0.00036918858,0.00007239521,0.00074645336,0.00009397307,0.000095628646],"category_scores_gemma":[0.0005045672,0.00009792614,0.00016526013,0.00024513763,0.00017040347,0.0002039508,0.00009700472,0.0010130992,0.000008353872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023130255,0.000064099644,0.00052236626,0.000018630833,0.00011622531,0.000007367663,0.0007267248,0.0000015839651,0.000206287,0.9969959,0.00063697144,0.0006807028],"study_design_scores_gemma":[0.0004468241,0.0006968187,0.00028474012,0.00008501749,0.000075277516,0.00032219655,0.0002850256,0.000052008578,0.0005685673,0.99620426,0.00085001334,0.00012923963],"about_ca_topic_score_codex":0.000004843074,"about_ca_topic_score_gemma":0.0000013564962,"teacher_disagreement_score":0.008953326,"about_ca_system_score_codex":0.0001710493,"about_ca_system_score_gemma":0.0003062305,"threshold_uncertainty_score":0.44014683},"labels":[],"label_agreement":null},{"id":"W1575622900","doi":"10.37236/1819","title":"Short Cycles in Random Regular Graphs","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":112,"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 Waterloo","funders":"Australian Research Council","keywords":"Mathematics; Combinatorics; Bipartite graph; Random regular graph; Random graph; Discrete mathematics; Degree (music); Poisson distribution; Random variable; Chordal graph; Graph; Statistics; 1-planar graph","score_opus":0.013362643966246686,"score_gpt":0.2724877291639331,"score_spread":0.2591250851976864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575622900","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.9914814,0.0034843986,0.0030602696,0.00044789482,0.00043662247,0.00015119357,3.541001e-7,0.000014892996,0.00092295784],"genre_scores_gemma":[0.99878585,0.0009726958,0.000058174646,0.000048676004,0.00006402356,0.000002139803,1.7629144e-7,0.0000241182,0.00004412642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825054,0.0001708189,0.0005586653,0.00009482702,0.0004364605,0.0004887057],"domain_scores_gemma":[0.9988929,0.00036477015,0.00024510513,0.00032154168,0.00012006833,0.000055603632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186886,0.00016374481,0.0003825908,0.00018820216,0.00016114577,0.000022626242,0.0006306351,0.00009001625,0.0000056208255],"category_scores_gemma":[0.00024190654,0.000099221565,0.00022738364,0.00041724212,0.0001116364,0.00011344567,0.000057698282,0.00089971314,6.5968385e-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.00015167531,0.00010810275,0.00035154208,0.000011408209,0.000087776425,0.00002164297,0.0006837862,0.00008989061,0.00009370601,0.99801576,0.0000633615,0.00032133362],"study_design_scores_gemma":[0.0025426548,0.00021385279,0.0006011384,0.000049664057,0.000068468784,0.00027173082,0.00018004506,0.0000028219456,0.0015739029,0.9940475,0.00033053057,0.00011765512],"about_ca_topic_score_codex":0.0000033338224,"about_ca_topic_score_gemma":0.000009130836,"teacher_disagreement_score":0.0073044533,"about_ca_system_score_codex":0.0002634398,"about_ca_system_score_gemma":0.0002264393,"threshold_uncertainty_score":0.40461382},"labels":[],"label_agreement":null},{"id":"W1576464478","doi":"10.37236/1937","title":"Erdős-Ko-Rado theorems for uniform set-partition systems","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":36,"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 Ottawa","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Cardinality (data modeling); Generalization; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.023660366305949452,"score_gpt":0.2953013095934258,"score_spread":0.27164094328747634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576464478","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.8998276,0.009891405,0.07810289,0.0023003567,0.0033566244,0.0011052134,0.000014463815,0.00009314545,0.005308331],"genre_scores_gemma":[0.9981463,0.00042870775,0.000091935966,0.00007698836,0.0006115247,0.000009677979,0.000001385347,0.000038639297,0.00059483835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.0001610756,0.0006367257,0.00010573894,0.0004276989,0.0005924154],"domain_scores_gemma":[0.9979117,0.0006405982,0.00067315734,0.0003531492,0.0003437653,0.000077615405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027157185,0.00019466429,0.00036628914,0.00010925706,0.00037576043,0.0000583466,0.000611888,0.00011334091,0.000014718651],"category_scores_gemma":[0.00026132478,0.00011652408,0.00025048517,0.00021203751,0.00009062696,0.0001956737,0.000047154645,0.0006060976,0.0000026688288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011524779,0.0000719017,0.000017854143,0.000043471824,0.00015419038,0.0000010766715,0.0007681506,0.0001226587,0.0000562177,0.9952343,0.002780231,0.0006346668],"study_design_scores_gemma":[0.0010344598,0.0004811487,0.000010890849,0.000042145224,0.00015468051,0.00025674622,0.00035815456,0.0008971107,0.0006037352,0.9631128,0.032903656,0.00014449486],"about_ca_topic_score_codex":0.0000014214908,"about_ca_topic_score_gemma":0.0000027840215,"teacher_disagreement_score":0.09831873,"about_ca_system_score_codex":0.00037786856,"about_ca_system_score_gemma":0.00019267846,"threshold_uncertainty_score":0.47517142},"labels":[],"label_agreement":null},{"id":"W1577585318","doi":"10.37236/768","title":"Circular Chromatic Index of Generalized Blanuša Snarks","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"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; Chromatic scale; Edge coloring; Index (typography); Type (biology); Discrete mathematics; Graph; Computer science","score_opus":0.02680915523668584,"score_gpt":0.2802457412350202,"score_spread":0.2534365859983344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577585318","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.92048883,0.002569726,0.07480181,0.0002293047,0.0007797207,0.00034445504,0.0000010051411,0.000039764458,0.000745391],"genre_scores_gemma":[0.99825937,0.00077940215,0.00049377105,0.000030175966,0.00015004454,0.0000061128185,4.972574e-7,0.00006509132,0.00021555058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964964,0.0002854471,0.0013282452,0.00014042277,0.0010823786,0.00066711433],"domain_scores_gemma":[0.99583393,0.0009156147,0.0018081914,0.0007167746,0.00061158533,0.00011391724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015548449,0.0002999936,0.00091820495,0.00019214279,0.00018553318,0.0000137585885,0.0010684391,0.00014866753,0.000032246666],"category_scores_gemma":[0.0010533895,0.00021161142,0.0003562022,0.00066426024,0.00020704484,0.00019144904,0.00010390453,0.0009147521,0.000005373964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068999194,0.00046879452,0.00017856424,0.00014179648,0.00029373195,0.00003550377,0.00096641335,0.0000942991,0.0011563333,0.9957387,0.0008009413,0.000055932178],"study_design_scores_gemma":[0.0022791207,0.0005682322,0.000072289426,0.000091796224,0.00017815875,0.0011600972,0.00013249026,0.0003874759,0.0049298955,0.9894078,0.0005831894,0.00020946575],"about_ca_topic_score_codex":0.0000036873148,"about_ca_topic_score_gemma":8.052441e-7,"teacher_disagreement_score":0.07777053,"about_ca_system_score_codex":0.0004565323,"about_ca_system_score_gemma":0.00071282656,"threshold_uncertainty_score":0.8629263},"labels":[],"label_agreement":null},{"id":"W1578234187","doi":"10.37236/2051","title":"Efficient Oracles for Generating Binary Bubble Languages","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":22,"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 Victoria; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Mathematics; Combinatorics; Amortized analysis; Oracle; Binary number; Object (grammar); Discrete mathematics; Simple (philosophy); Computer science; Data structure; Arithmetic; Programming language","score_opus":0.010715838502216083,"score_gpt":0.26557888174185246,"score_spread":0.2548630432396364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578234187","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.21260759,0.015329824,0.7705014,0.00053759495,0.00079618994,0.0001080744,0.0000010202741,0.000024043165,0.000094293035],"genre_scores_gemma":[0.9960575,0.00010967165,0.0033139153,0.000083738305,0.00033546178,0.0000033974252,7.912885e-7,0.00000963824,0.000085886786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874586,0.000081809696,0.00025784457,0.000082413644,0.00030163044,0.0005304416],"domain_scores_gemma":[0.99896204,0.00022046594,0.00028807527,0.00029237865,0.00015830397,0.000078757315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015025631,0.00010150915,0.00015414122,0.00006384004,0.00024555967,0.000073750634,0.00088565145,0.000035696597,0.000002357549],"category_scores_gemma":[0.00007075849,0.000061450184,0.00008736261,0.00023344003,0.00001950082,0.00024587446,0.0001697996,0.00028253288,0.0000035773592],"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.000017591847,0.00025454164,0.00010513508,0.000011387558,0.000041365834,0.0000027853148,0.0006592278,0.0027089904,0.002985238,0.98147786,0.0025496688,0.009186201],"study_design_scores_gemma":[0.0037492292,0.0028112135,0.0010929841,0.00015650415,0.00015541396,0.0010216344,0.0009552531,0.66307557,0.023270233,0.23020796,0.072643876,0.00086010183],"about_ca_topic_score_codex":0.0000029799185,"about_ca_topic_score_gemma":2.2528474e-7,"teacher_disagreement_score":0.7834499,"about_ca_system_score_codex":0.00012197568,"about_ca_system_score_gemma":0.00017783708,"threshold_uncertainty_score":0.25058657},"labels":[],"label_agreement":null},{"id":"W1578994341","doi":"10.37236/4915","title":"Mutually Unbiased Bush-type Hadamard Matrices and Association Schemes","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"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 Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Antipodal point; Hadamard transform; Association scheme; Bipartite graph; Complex Hadamard matrix; Upper and lower bounds; Mutually unbiased bases; Discrete mathematics; Hadamard matrix; Pure mathematics; Graph","score_opus":0.007296489678677821,"score_gpt":0.1924970514505779,"score_spread":0.18520056177190009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578994341","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.98045015,0.016478514,0.0008461197,0.00019756267,0.0010038841,0.00006476438,4.289503e-7,0.000041942018,0.00091664173],"genre_scores_gemma":[0.9986215,0.001033763,0.0000050814565,0.000019665726,0.00010773908,7.7918185e-7,4.5987693e-7,0.000016736027,0.0001942445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893856,0.00011164861,0.0002689639,0.000048041755,0.00033343068,0.0002993734],"domain_scores_gemma":[0.99921334,0.00015573036,0.00019606734,0.00010604677,0.0002503214,0.00007850848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017952295,0.000105632396,0.00019536378,0.000078794066,0.00005621462,0.000050171042,0.00021028046,0.000076445045,0.00000295124],"category_scores_gemma":[0.00015817686,0.00007664581,0.000048770682,0.00032713282,0.000015791205,0.00015838207,0.000014394927,0.0004490704,0.000006534021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020797734,0.000109844994,0.009400097,0.00009806507,0.00093652087,0.00001785576,0.0022917748,0.0026036068,0.0023401729,0.9671387,0.013689896,0.0011654819],"study_design_scores_gemma":[0.0033651013,0.0013781278,0.0013469935,0.00010171489,0.00032034962,0.00034178255,0.0015290908,0.0026497392,0.005473134,0.8913733,0.09163786,0.00048280903],"about_ca_topic_score_codex":0.0000023008217,"about_ca_topic_score_gemma":0.0000021885758,"teacher_disagreement_score":0.07794796,"about_ca_system_score_codex":0.00035793873,"about_ca_system_score_gemma":0.00014147122,"threshold_uncertainty_score":0.31255254},"labels":[],"label_agreement":null},{"id":"W1579093352","doi":"10.37236/3204","title":"Periodic Coefficients and Random Fibonacci Sequences","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Randomness; Sequence (biology); Bounded function; Discrete mathematics; Order (exchange); Statistics; Mathematical analysis","score_opus":0.005187308320797606,"score_gpt":0.2020730691152288,"score_spread":0.19688576079443118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579093352","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.987617,0.010294652,0.0005007068,0.00082818157,0.00039092608,0.00011741562,5.921224e-7,0.000008546305,0.00024194612],"genre_scores_gemma":[0.9989673,0.0006573872,0.0000065781205,0.00009710903,0.00006212893,0.000002396912,1.4251766e-7,0.0000075633297,0.0001994157],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886453,0.00012487906,0.00026814104,0.00007937547,0.00030639273,0.00035670522],"domain_scores_gemma":[0.9993414,0.00010435536,0.00022080001,0.00011368865,0.00015715572,0.00006259591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006940163,0.00010379615,0.00020016475,0.00003264774,0.0002199292,0.00016850267,0.0003568761,0.000036251047,0.00024066564],"category_scores_gemma":[0.000066245004,0.000053023374,0.000050928564,0.00010831015,0.00015560398,0.00020202117,0.000050696504,0.00025728185,0.00001749594],"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.0007187,0.0001997825,0.001630168,0.0001007224,0.00014847808,0.000018684786,0.0054519256,0.00051819,0.61959654,0.3559418,0.0049807713,0.010694224],"study_design_scores_gemma":[0.003221191,0.0017268907,0.0017650629,0.00006201896,0.0000822435,0.00089613703,0.0009187288,0.00030921458,0.060266327,0.9115277,0.01889991,0.00032459776],"about_ca_topic_score_codex":0.000058871832,"about_ca_topic_score_gemma":0.0000028002266,"teacher_disagreement_score":0.5593302,"about_ca_system_score_codex":0.00007301101,"about_ca_system_score_gemma":0.00015490725,"threshold_uncertainty_score":0.26351202},"labels":[],"label_agreement":null},{"id":"W1579884944","doi":"10.37236/4459","title":"Counting the Palstars","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","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":"University of Waterloo","funders":"","keywords":"Alphabet; Concatenation (mathematics); Combinatorics; Constant (computer programming); Palindrome; Mathematics; Alpha (finance); Discrete mathematics; Arithmetic; Computer science; Statistics; Biology; Philosophy; Genetics","score_opus":0.008666077975984345,"score_gpt":0.23485763773083845,"score_spread":0.2261915597548541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579884944","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.016736263,0.011192384,0.9623782,0.005180054,0.0037723295,0.00019244266,0.0000012378538,0.0000403854,0.00050668116],"genre_scores_gemma":[0.9970549,0.0017410368,0.00026252615,0.00032206852,0.00048023777,0.0000038005362,0.0000014943906,0.00001903435,0.00011491665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971681,0.0003923697,0.0006302805,0.00023264141,0.00094567135,0.0006308963],"domain_scores_gemma":[0.99618936,0.00051675685,0.0014065137,0.001371177,0.00044589513,0.00007030139],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0041930103,0.00026263457,0.00040706317,0.00008861715,0.0003758587,0.00044261862,0.00614367,0.00014896053,0.0000040553127],"category_scores_gemma":[0.00014304604,0.0001300039,0.00025172203,0.00027779397,0.0000780159,0.0002194402,0.002080672,0.0030975014,0.000009346542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011259213,0.00006572173,0.000037403737,0.000024978941,0.00013520407,0.000009173874,0.0004696553,0.001753311,0.000020334748,0.9824993,0.0076945797,0.0072790678],"study_design_scores_gemma":[0.00030331686,0.00018396918,0.00013331567,0.00011672162,0.00005797229,0.00018236728,0.00003287205,0.038405944,0.00012025705,0.90562403,0.054647513,0.00019169653],"about_ca_topic_score_codex":0.000018763973,"about_ca_topic_score_gemma":0.0000016677046,"teacher_disagreement_score":0.9803186,"about_ca_system_score_codex":0.00028534688,"about_ca_system_score_gemma":0.0010435311,"threshold_uncertainty_score":0.99923354},"labels":[],"label_agreement":null},{"id":"W1583473912","doi":"10.37236/322","title":"Forbidden Configurations: Exact Bounds Determined by Critical Substructures","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"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; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; University of South Carolina","keywords":"Combinatorics; Mathematics; Simple (philosophy); Matrix (chemical analysis); Substructure; Permutation (music); Integer (computer science); Multiset; Discrete mathematics; Physics; Computer science","score_opus":0.010095952164721837,"score_gpt":0.29832399491315575,"score_spread":0.28822804274843394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583473912","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.98938125,0.0013875599,0.004051197,0.0010620477,0.0019597888,0.00015107813,0.000005018026,0.000030298532,0.0019717303],"genre_scores_gemma":[0.9991432,0.00011472114,0.00010308631,0.0001232315,0.00026009022,0.0000030892468,9.911597e-7,0.00003157337,0.00022002058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981241,0.0001554557,0.00055932195,0.000116028845,0.00048160547,0.000563451],"domain_scores_gemma":[0.99723464,0.0015329047,0.00036147854,0.0004167991,0.00034063973,0.00011352035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012893381,0.00020264713,0.00033097048,0.00008972069,0.00046328214,0.000097452175,0.0007932354,0.00015780202,0.00013119243],"category_scores_gemma":[0.0016551444,0.00012362307,0.00019660513,0.00018918783,0.00028832818,0.00018889742,0.00005338682,0.0015732268,0.000001463919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004996233,0.00005634807,0.000069442336,0.000013290264,0.000079531885,0.000005476899,0.00034772945,2.5027637e-7,0.0056119123,0.9891168,0.00431353,0.00033572005],"study_design_scores_gemma":[0.0005697165,0.00029562783,0.00014001409,0.000010097051,0.00012236151,0.0006102246,0.00009882297,0.000026433028,0.007150129,0.9832351,0.0075911023,0.00015032526],"about_ca_topic_score_codex":0.000002320507,"about_ca_topic_score_gemma":0.0000090500025,"teacher_disagreement_score":0.009761915,"about_ca_system_score_codex":0.000081163314,"about_ca_system_score_gemma":0.00025563556,"threshold_uncertainty_score":0.6834975},"labels":[],"label_agreement":null},{"id":"W1584631835","doi":"10.37236/1832","title":"Pólya's Permanent Problem","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"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":"Invertible matrix; Mathematics; Sign (mathematics); Square (algebra); Combinatorics; Square matrix; Matrix (chemical analysis); Zero (linguistics); Polynomial; Discrete mathematics; Pure mathematics; Symmetric matrix; Mathematical analysis; Geometry","score_opus":0.0050381919843198895,"score_gpt":0.21421194865763105,"score_spread":0.20917375667331115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584631835","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.0632178,0.0058279764,0.9142156,0.009803955,0.0011997179,0.00020029815,3.2052952e-7,0.000061397026,0.005472922],"genre_scores_gemma":[0.9986728,0.00033508943,0.0003979048,0.0001472031,0.000109341476,0.000001359007,1.02251285e-7,0.000007081557,0.0003291244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862677,0.00009797694,0.00031248172,0.00009977634,0.0004074489,0.0004555421],"domain_scores_gemma":[0.99908704,0.000070346265,0.00028777332,0.00032530434,0.00015419317,0.000075347925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013647485,0.00011456382,0.00016853424,0.000077534656,0.00015806078,0.000084855266,0.0015633501,0.0000373643,0.000005360067],"category_scores_gemma":[0.000022271292,0.00007173193,0.000120615,0.00042307755,0.000040198516,0.00032535536,0.00011175183,0.000604378,0.000025809955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007749599,0.000095469106,0.0000042178563,0.0000042664683,0.000027941951,0.000016858463,0.0002998177,0.000415031,0.00009903941,0.9975734,0.00011017777,0.0013460333],"study_design_scores_gemma":[0.0007297694,0.0005034969,0.000026582484,0.00001749619,0.000014176118,0.00070236967,0.000026509004,0.000136563,0.0018400714,0.9875685,0.008341116,0.00009336321],"about_ca_topic_score_codex":0.000002955081,"about_ca_topic_score_gemma":7.086937e-7,"teacher_disagreement_score":0.935455,"about_ca_system_score_codex":0.00027529744,"about_ca_system_score_gemma":0.0005389503,"threshold_uncertainty_score":0.2925143},"labels":[],"label_agreement":null},{"id":"W1586008474","doi":"10.37236/4329","title":"The Generating Function for Total Displacement","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"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; Generating function; Permutation (music); Coxeter group; Statistic; Combinatorics; Displacement (psychology); Function (biology); Fraction (chemistry); Statistics","score_opus":0.014288411542603173,"score_gpt":0.28430925617755126,"score_spread":0.2700208446349481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586008474","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.113852866,0.00092717016,0.88053435,0.0010286944,0.0027527,0.00048146222,5.1818887e-7,0.00003065724,0.0003915646],"genre_scores_gemma":[0.9978928,0.000088651504,0.0005782584,0.00004201412,0.0006025064,0.000027051967,3.9374268e-7,0.000043585398,0.0007247594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793166,0.00019238176,0.0006844813,0.00010201384,0.0005133726,0.00057610875],"domain_scores_gemma":[0.99502724,0.0031868028,0.00090060645,0.00039963893,0.00042650115,0.000059185102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037243618,0.00018361294,0.00029685814,0.000037932918,0.0006292812,0.00008388604,0.00051096303,0.000061383296,0.000002630195],"category_scores_gemma":[0.0019953141,0.00009950709,0.00019593265,0.00018628196,0.00005724576,0.00012144728,0.00006191964,0.0005266256,0.0000024389904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010269637,0.00008590081,0.0000039147594,0.00002483775,0.0001027526,1.6123536e-7,0.0001313647,0.0001461892,0.00033233635,0.99634624,0.0013096587,0.0014139581],"study_design_scores_gemma":[0.0011855086,0.0011961274,0.0000036574663,0.000025467569,0.00015851563,0.000052701333,0.00018094832,0.003948846,0.00083858107,0.9795602,0.012731353,0.00011807694],"about_ca_topic_score_codex":3.7308553e-7,"about_ca_topic_score_gemma":0.0000021954645,"teacher_disagreement_score":0.88403994,"about_ca_system_score_codex":0.0003547753,"about_ca_system_score_gemma":0.00018002545,"threshold_uncertainty_score":0.4839986},"labels":[],"label_agreement":null},{"id":"W1586057070","doi":"10.37236/398","title":"Optimal Packings of 13 and 46 Unit Squares in a Square","year":2010,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Optimization and Packing Problems","field":"Engineering","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":"St. Francis Xavier University","funders":"","keywords":"Square (algebra); Unit square; Unit (ring theory); Combinatorics; Mathematics; Least-squares function approximation; Statistics; Geometry","score_opus":0.008462670007025372,"score_gpt":0.2243424269833705,"score_spread":0.21587975697634515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586057070","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.9795197,0.009289951,0.009033083,0.00037080896,0.0009026866,0.0002132617,0.0000046487226,0.000036219306,0.0006295892],"genre_scores_gemma":[0.99509776,0.004649938,0.0000901171,0.000010344056,0.000055798017,0.0000030523975,0.0000030861297,0.000043916356,0.0000459635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986358,0.000078448466,0.0005301478,0.000101363206,0.0002866989,0.00036751968],"domain_scores_gemma":[0.99893636,0.00013523825,0.0003881131,0.0002602714,0.00022006783,0.000059964725],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.000909617,0.00022698192,0.0004546327,0.00027468192,0.000034559238,0.00005201355,0.00045676646,0.00028340323,0.000016032036],"category_scores_gemma":[0.000066116234,0.00018095816,0.000105507046,0.0002712784,0.00006470781,0.000075611046,0.00011981617,0.0028760508,7.600301e-7],"study_design_candidate":"simulation_or_modeling","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.00006933661,0.00012407039,0.00350413,0.00067728414,0.00025966569,0.0000122341025,0.0030331598,0.88912684,0.00035341163,0.10150161,0.00031268696,0.0010255914],"study_design_scores_gemma":[0.0074151424,0.0020086805,0.007895992,0.0030849024,0.0006152676,0.0006854144,0.001149038,0.21901603,0.00779817,0.7320967,0.016232261,0.0020023924],"about_ca_topic_score_codex":0.000017308676,"about_ca_topic_score_gemma":0.000034742156,"teacher_disagreement_score":0.67011076,"about_ca_system_score_codex":0.00012459011,"about_ca_system_score_gemma":0.00027560204,"threshold_uncertainty_score":0.99942434},"labels":[],"label_agreement":null},{"id":"W1588217500","doi":"10.37236/2639","title":"Metric Dimension for Random Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research; National Science Foundation","keywords":"Metric dimension; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Packing dimension; Graph; Discrete mathematics; Metric (unit); Random graph; Minkowski–Bouligand dimension; Chordal graph; 1-planar graph","score_opus":0.006990342412215714,"score_gpt":0.21530067841576891,"score_spread":0.2083103360035532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588217500","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.40027326,0.015942683,0.5749079,0.005950332,0.0019782293,0.0006420271,2.4794255e-7,0.00007606761,0.00022922289],"genre_scores_gemma":[0.99862325,0.00045580606,0.0005453469,0.00019813223,0.00001273604,0.000010887094,2.1500465e-7,0.00001058324,0.0001430179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837327,0.000120225086,0.0004389278,0.00013216259,0.00041636976,0.00051901693],"domain_scores_gemma":[0.9979149,0.00055306463,0.00040810264,0.00036929417,0.00065905665,0.00009557977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018195934,0.00013180118,0.00025983225,0.00028460388,0.00021458235,0.00011688685,0.0010284048,0.00005300035,0.0000034313962],"category_scores_gemma":[0.00018377903,0.00007734321,0.00022107428,0.0010674676,0.000039366427,0.0003638247,0.00007914743,0.00038405138,0.000013243608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001824659,0.00007549295,0.000051540883,0.0000045076276,0.000052864347,5.5829423e-7,0.00007987514,0.00012868349,0.0008012035,0.99443537,0.0025070133,0.0018446671],"study_design_scores_gemma":[0.0022301977,0.00067776354,0.00006632039,0.000013074415,0.00003270206,0.00008360064,0.000020216989,0.004911378,0.0020440926,0.98864704,0.0011728,0.00010080007],"about_ca_topic_score_codex":0.0000089992045,"about_ca_topic_score_gemma":3.493123e-7,"teacher_disagreement_score":0.59835,"about_ca_system_score_codex":0.00007541386,"about_ca_system_score_gemma":0.00020995356,"threshold_uncertainty_score":0.31539646},"labels":[],"label_agreement":null},{"id":"W1588218227","doi":"10.37236/596","title":"Monomer-Dimer Tatami Tilings of Rectangular Regions","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":11,"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 Victoria","funders":"","keywords":"Combinatorics; Rectangle; Mathematics; Square (algebra); Function (biology); Constraint (computer-aided design); Discrete mathematics; Geometry","score_opus":0.05558431996814178,"score_gpt":0.2800777179696033,"score_spread":0.2244933980014615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588218227","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.8522537,0.0030284638,0.12393278,0.0005424262,0.0004587641,0.00036363347,0.0000032760875,0.00003341941,0.019383587],"genre_scores_gemma":[0.99834913,0.00042059176,0.0006281198,0.000025926587,0.0000345375,0.0000021496494,2.7934766e-7,0.000029593244,0.0005096703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982616,0.00011218845,0.0007353063,0.00008640056,0.00040948502,0.00039503194],"domain_scores_gemma":[0.99782336,0.00046669427,0.00089397974,0.00040036027,0.00033763412,0.00007798714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001882845,0.0001498146,0.00044350716,0.00010295485,0.00006777368,0.000009840697,0.00059121515,0.000091914684,0.000083407234],"category_scores_gemma":[0.00048083538,0.00009634538,0.00023295601,0.00029957265,0.00010323293,0.00009901195,0.000055715296,0.0006569614,0.0000057092643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003749283,0.00031277954,0.000035090034,0.000039818995,0.00015062475,0.0000049847245,0.00091855886,6.586085e-7,0.0002937416,0.9975488,0.00051976246,0.00013768794],"study_design_scores_gemma":[0.00037378373,0.00042807285,0.000039090282,0.000055081407,0.00016639932,0.00011407568,0.00019458077,0.00026925595,0.0019449966,0.99551076,0.0008021538,0.00010177237],"about_ca_topic_score_codex":0.000008382578,"about_ca_topic_score_gemma":0.0000022533538,"teacher_disagreement_score":0.14609548,"about_ca_system_score_codex":0.000101664235,"about_ca_system_score_gemma":0.00019903197,"threshold_uncertainty_score":0.39288506},"labels":[],"label_agreement":null},{"id":"W1588550780","doi":"10.37236/1987","title":"A Sperner-Type Theorem for Set-Partition Systems","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.026864058793790297,"score_gpt":0.29994456808964026,"score_spread":0.27308050929585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588550780","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.95455474,0.009471519,0.02892488,0.0011878408,0.0025471672,0.0006002108,0.0000041992016,0.000049362538,0.0026600831],"genre_scores_gemma":[0.9981635,0.00038429708,0.0000829849,0.000067440546,0.00061672705,0.00000432623,7.0973437e-7,0.000029964871,0.000650029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984928,0.00015894958,0.00048043346,0.00008671642,0.0003326174,0.00044849998],"domain_scores_gemma":[0.9981601,0.0006514196,0.00048655027,0.00027963912,0.00036579737,0.00005649852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021113702,0.00014831615,0.00029385448,0.00007774942,0.00025513885,0.000042866057,0.0004715267,0.000084205516,0.00001531283],"category_scores_gemma":[0.0003313431,0.000087262124,0.00017845974,0.00019313325,0.00006620591,0.00012669388,0.000035929395,0.00046207232,0.0000028157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001447986,0.000058622292,0.000018398341,0.000029629226,0.00012592738,9.561853e-7,0.00061183324,0.00009022973,0.00010719848,0.995197,0.0032725614,0.0003428516],"study_design_scores_gemma":[0.0007655824,0.000540616,0.000011009773,0.00003079936,0.00013172487,0.00022599098,0.0002258896,0.000509388,0.0007283742,0.9677494,0.028972337,0.000108880624],"about_ca_topic_score_codex":8.576189e-7,"about_ca_topic_score_gemma":0.0000015276801,"teacher_disagreement_score":0.043608785,"about_ca_system_score_codex":0.00024951377,"about_ca_system_score_gemma":0.00016707208,"threshold_uncertainty_score":0.35584462},"labels":[],"label_agreement":null},{"id":"W1588607283","doi":"10.37236/2444","title":"The $n$-Card Problem, Stochastic Matrices, and the Extreme Principle","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Permutation (music); Permutation matrix; Interval (graph theory); Matrix (chemical analysis); Discrete mathematics; Extreme point; Mathematical optimization","score_opus":0.008278334828841038,"score_gpt":0.20739113680537857,"score_spread":0.19911280197653752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588607283","genre_codex":"review","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.14502938,0.4185201,0.40684554,0.008539414,0.005816614,0.0019586768,0.0000030017036,0.0003000936,0.012987181],"genre_scores_gemma":[0.9946341,0.0048783384,0.000025026293,0.000030004394,0.00013172229,0.0000059120457,2.4068052e-7,0.000023415141,0.0002712573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988025,0.00011574083,0.00030566647,0.00003977605,0.00026289906,0.00047346114],"domain_scores_gemma":[0.99908715,0.0004046437,0.00017036311,0.0001841724,0.000091697046,0.00006199749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002182313,0.00011854918,0.00015484945,0.00003643841,0.00028191553,0.00008768042,0.00035223446,0.00004013971,0.0000045402944],"category_scores_gemma":[0.00006295677,0.000053260974,0.00006536397,0.00024647772,0.00009077356,0.0001369174,0.000038460377,0.0006187313,0.000005101051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004906701,0.000025352543,0.00015694716,0.000019179939,0.00015878482,2.9124502e-7,0.0010263494,0.03428745,0.000022516553,0.96229905,0.0008069668,0.0011480203],"study_design_scores_gemma":[0.007769093,0.00043855357,0.0010124655,0.00014178069,0.0006121588,0.0011754008,0.0006523077,0.08137183,0.00024552157,0.6571498,0.24875148,0.00067963597],"about_ca_topic_score_codex":0.0000015528684,"about_ca_topic_score_gemma":0.0000019219497,"teacher_disagreement_score":0.8496047,"about_ca_system_score_codex":0.00012118211,"about_ca_system_score_gemma":0.00006777951,"threshold_uncertainty_score":0.2688114},"labels":[],"label_agreement":null},{"id":"W1588622438","doi":"10.37236/3263","title":"Sparse Distance Sets in the Triangular Lattice","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","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":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Euclidean geometry; Plane (geometry); Planar; Euclidean distance; Lattice (music); Hexagonal lattice; Point (geometry); Function (biology); Discrete mathematics; Geometry; Physics","score_opus":0.00998602909444497,"score_gpt":0.23487174949504638,"score_spread":0.22488572040060142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588622438","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.34116444,0.0047783544,0.63938785,0.01308738,0.0006417761,0.00025575122,1.7722968e-7,0.000012254798,0.00067200896],"genre_scores_gemma":[0.99902594,0.00015980395,0.00018602322,0.00041747067,0.00007428572,0.0000049710065,3.562062e-7,0.0000036141496,0.0001275046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861383,0.0002779997,0.0002985691,0.00008498181,0.0004341682,0.00029041938],"domain_scores_gemma":[0.99891984,0.0003676206,0.00022612659,0.00026583124,0.00018901701,0.000031543954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328105,0.000082683146,0.00012027118,0.00008423353,0.00010847451,0.00014167096,0.0011499217,0.000027104305,0.0000062384056],"category_scores_gemma":[0.00009988642,0.000046307403,0.0000640284,0.0008371013,0.000022080498,0.00043926988,0.000043686934,0.00043824478,0.000017577237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058264236,0.00008072418,0.000059338432,0.000002208776,0.000012790673,0.0000057961715,0.0005541209,0.0009746693,0.00004855177,0.9930327,0.001135324,0.004087973],"study_design_scores_gemma":[0.00061504426,0.00022959487,0.003105515,0.000009639146,0.00001037028,0.00017888389,0.00008530487,0.014403386,0.00019448045,0.97067404,0.010413367,0.00008037224],"about_ca_topic_score_codex":0.000006784631,"about_ca_topic_score_gemma":0.0000049098894,"teacher_disagreement_score":0.65786153,"about_ca_system_score_codex":0.00012167447,"about_ca_system_score_gemma":0.000250158,"threshold_uncertainty_score":0.21368597},"labels":[],"label_agreement":null},{"id":"W1590128845","doi":"10.37236/2407","title":"Graphs with Large Distinguishing Chromatic Number","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multipartite; Chromatic scale; Graph; Discrete mathematics; Clique number; Automorphism; Quantum","score_opus":0.0037720654523230837,"score_gpt":0.19695430225689617,"score_spread":0.19318223680457308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590128845","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.88137555,0.0017404748,0.111625366,0.0026817773,0.00055623555,0.00018271971,1.5108441e-7,0.000078955636,0.0017587644],"genre_scores_gemma":[0.9991327,0.00007310374,0.00043634637,0.0001984197,0.000011336937,0.00000344654,1.6057756e-7,0.000011871556,0.00013263749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983117,0.000115380884,0.00035183766,0.00012063919,0.0005076518,0.0005927865],"domain_scores_gemma":[0.9985135,0.00016839255,0.00041779393,0.00039243497,0.00041066736,0.000097177515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163233,0.00013698879,0.0002131787,0.00007299249,0.00023654288,0.00021246314,0.0010711029,0.000037015092,0.00001541229],"category_scores_gemma":[0.000084711646,0.00007533423,0.00008645874,0.00069110375,0.000046005553,0.0004500447,0.0000961672,0.00058741577,0.000038791823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027240665,0.000088371584,0.000974986,0.000006846525,0.000049614344,0.0000061155556,0.00033196495,0.0000240547,0.000086112566,0.99713707,0.0010367547,0.00025539732],"study_design_scores_gemma":[0.00069113396,0.00031675922,0.0005695093,0.000053747248,0.000023391618,0.00042959448,0.00005302161,0.0018669708,0.0002323468,0.9950466,0.00059770053,0.000119183336],"about_ca_topic_score_codex":0.000018085626,"about_ca_topic_score_gemma":0.0000026243229,"teacher_disagreement_score":0.11775713,"about_ca_system_score_codex":0.0000765739,"about_ca_system_score_gemma":0.00023144844,"threshold_uncertainty_score":0.30720407},"labels":[],"label_agreement":null},{"id":"W1592551147","doi":"10.37236/2765","title":"Circular Nim Games","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"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":"Security token; Mathematics; Combinatorics; Combinatorial game theory; Discrete mathematics; Computer science; Sequential game; Game theory; Mathematical economics; Computer network","score_opus":0.010765171356181396,"score_gpt":0.23719402688060695,"score_spread":0.22642885552442554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592551147","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.2378969,0.006381801,0.7446369,0.007757462,0.0013237766,0.00019850777,7.181749e-8,0.000056491484,0.0017480947],"genre_scores_gemma":[0.99877477,0.0004046873,0.00013735631,0.0002575369,0.00010528527,0.0000038342414,4.4082757e-8,0.000010314946,0.00030616322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821836,0.00014021552,0.00043790735,0.00012164654,0.00051473576,0.00056711904],"domain_scores_gemma":[0.99836963,0.00023295746,0.0003622398,0.0004979129,0.00044927277,0.00008798507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097268017,0.00012816826,0.00020181935,0.000101066515,0.00013104879,0.00019243918,0.0022296219,0.000051995146,0.000037425354],"category_scores_gemma":[0.00015704484,0.00008305161,0.00014166038,0.0005058982,0.00008168764,0.00067543,0.0001410833,0.00063345325,0.000171007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020234218,0.000061610284,0.00017787267,0.000002600349,0.000042879852,0.0000058647515,0.00047110676,0.00009858103,0.00068273506,0.98668754,0.002073597,0.009693576],"study_design_scores_gemma":[0.00009057575,0.00030002222,0.00029685214,0.0000108336935,0.000011977787,0.00020519618,0.00012761644,0.0033818067,0.008187893,0.9787251,0.008551299,0.00011082739],"about_ca_topic_score_codex":0.000020287553,"about_ca_topic_score_gemma":0.0000011137167,"teacher_disagreement_score":0.76087785,"about_ca_system_score_codex":0.00021749036,"about_ca_system_score_gemma":0.00038410688,"threshold_uncertainty_score":0.41432294},"labels":[],"label_agreement":null},{"id":"W1593036127","doi":"10.37236/701","title":"Minimum Light Numbers in the $\\sigma$-Game and Lit-Only $\\sigma$-Game on Unicyclic and Grid Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; West Virginia University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Connectivity; Discrete mathematics","score_opus":0.011314398516359401,"score_gpt":0.21595381190169358,"score_spread":0.20463941338533417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593036127","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.95423,0.013050509,0.023803808,0.0048350426,0.001228254,0.00038668307,0.0000025934073,0.000042418465,0.0024207046],"genre_scores_gemma":[0.99625033,0.003114271,0.00009115271,0.0003869438,0.00008303892,0.0000026689133,5.4792116e-7,0.000013339586,0.0000577283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778855,0.00036342227,0.00044901427,0.000263667,0.00054031826,0.00059502677],"domain_scores_gemma":[0.99840236,0.0003555286,0.00038104795,0.00064987503,0.00009278587,0.00011842006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017376347,0.00023391773,0.00030952904,0.00019827748,0.00017316324,0.0001574224,0.0017593852,0.00009192093,0.000003816496],"category_scores_gemma":[0.000060153878,0.000130778,0.00008588302,0.00062697974,0.0001130054,0.0005593018,0.00028293292,0.001051994,0.0000023782725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009070106,0.00027784525,0.00089959125,0.000009870848,0.000049924987,0.00005990467,0.0045371945,0.000006971272,0.0000712046,0.9866158,0.0010527861,0.006328234],"study_design_scores_gemma":[0.0018972608,0.0020359277,0.008326557,0.000116022566,0.00005058287,0.0011765958,0.00037845527,0.001778082,0.0004203663,0.96677893,0.016714012,0.00032723148],"about_ca_topic_score_codex":0.00003787679,"about_ca_topic_score_gemma":0.00001634247,"teacher_disagreement_score":0.04202032,"about_ca_system_score_codex":0.000095468014,"about_ca_system_score_gemma":0.00023822961,"threshold_uncertainty_score":0.53329724},"labels":[],"label_agreement":null},{"id":"W1593178005","doi":"10.37236/5327","title":"The Total Acquisition Number of Random Graphs","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Michigan University","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Random graph; Discrete mathematics","score_opus":0.00841781867157016,"score_gpt":0.28211421866373076,"score_spread":0.2736963999921606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593178005","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.14766937,0.021507412,0.8200515,0.004554103,0.0034373924,0.00064587744,0.000005299696,0.0000490768,0.0020800005],"genre_scores_gemma":[0.99523526,0.0041066916,0.00006362262,0.000019393803,0.000114971095,0.000010669109,3.9660458e-7,0.00002253897,0.00042642676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605215,0.00087377254,0.0007957754,0.00023369807,0.001230197,0.0008144084],"domain_scores_gemma":[0.99470913,0.0016962612,0.0013063251,0.0012290619,0.00096082804,0.00009836365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005167373,0.00026440917,0.0005063005,0.00015590894,0.0003135099,0.00013868214,0.004235055,0.00015956633,0.0000087000835],"category_scores_gemma":[0.0002229982,0.0001294086,0.00051562133,0.0005490562,0.0003320609,0.00028276493,0.001135851,0.002049408,0.000009382656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025127153,0.00006402627,0.00005228177,0.000014739786,0.00018153554,0.000005866397,0.00014804568,0.000089957626,0.0002071365,0.99577737,0.0001876459,0.0030201464],"study_design_scores_gemma":[0.001456874,0.00024434205,0.00013008881,0.00010547603,0.00003574378,0.0003103561,0.000022051745,0.00023756955,0.0018794917,0.99492466,0.00050671695,0.00014662286],"about_ca_topic_score_codex":0.0000019814822,"about_ca_topic_score_gemma":4.985628e-7,"teacher_disagreement_score":0.8475659,"about_ca_system_score_codex":0.0003570402,"about_ca_system_score_gemma":0.0011034291,"threshold_uncertainty_score":0.89037716},"labels":[],"label_agreement":null},{"id":"W1593192935","doi":"10.37236/1763","title":"There Exist Binary Circular $5/2^+$ Power Free Words of Every Length","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Binary number; Power (physics); Discrete mathematics; Arithmetic","score_opus":0.005737579744329706,"score_gpt":0.2091109374382763,"score_spread":0.2033733576939466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593192935","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.8440346,0.023214966,0.12594739,0.0033227028,0.0011596022,0.00014424177,0.0000012583627,0.00006132038,0.002113907],"genre_scores_gemma":[0.99888694,0.0006566,0.00014471647,0.0001423957,0.000059055175,0.0000012082783,2.1932836e-7,0.000018840006,0.00009000946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795717,0.00015725764,0.0005129338,0.00015845677,0.00066753745,0.00054664095],"domain_scores_gemma":[0.998009,0.00017730233,0.000573698,0.0009443949,0.00021406061,0.00008152783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016430607,0.0001872896,0.00034112766,0.00014208602,0.00013045114,0.00005906828,0.0029767572,0.000080883256,0.000010741322],"category_scores_gemma":[0.00009230686,0.00012627368,0.00024197665,0.0006770786,0.00010784972,0.00045595848,0.00027762214,0.0007150414,0.0000070882134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022769615,0.00024013159,0.000055793967,0.0000108244985,0.0001062821,0.000041688712,0.0006367843,0.00024564873,0.0013051323,0.9964859,0.0003118057,0.0005372298],"study_design_scores_gemma":[0.0012569526,0.0008933551,0.0006229136,0.0000706694,0.00003015831,0.0003655373,0.00017909965,0.00010832126,0.0040606977,0.9909824,0.0012734822,0.00015640903],"about_ca_topic_score_codex":0.000010832783,"about_ca_topic_score_gemma":0.0000010792882,"teacher_disagreement_score":0.15485235,"about_ca_system_score_codex":0.000337224,"about_ca_system_score_gemma":0.00076753256,"threshold_uncertainty_score":0.5531605},"labels":[],"label_agreement":null},{"id":"W1595992363","doi":"10.37236/630","title":"Counting Words by Number of Occurrences of Some Patterns","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Binomial coefficient; Combinatorics; Integer (computer science); Binomial (polynomial); Order (exchange); Subfamily; Negative binomial distribution; Discrete mathematics; Statistics","score_opus":0.03080476269194281,"score_gpt":0.30192956076448363,"score_spread":0.2711247980725408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595992363","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.97561586,0.0012407184,0.021003429,0.000044176824,0.0008798687,0.00017360615,0.0000065528548,0.000017224638,0.0010185395],"genre_scores_gemma":[0.99903905,0.00046506745,0.00029518703,0.000009641202,0.000068531284,0.000002665995,3.9500748e-7,0.000034876663,0.00008456926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972711,0.00015004774,0.0012016804,0.000107975255,0.00076846615,0.00050072797],"domain_scores_gemma":[0.99570465,0.0008361022,0.0024449234,0.0004163016,0.0005344618,0.000063531494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016981786,0.00022121998,0.00068421615,0.00008133511,0.00006404501,0.000009885469,0.0009695746,0.00009851193,0.000058351536],"category_scores_gemma":[0.0006121676,0.00015566609,0.00020985462,0.00035395686,0.00013409213,0.0002804056,0.00009923448,0.00067398144,0.0000028382415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051068993,0.0005322862,0.0022476113,0.00017131472,0.00016428875,0.000002009684,0.0016219197,7.903825e-7,0.00033482123,0.9943651,0.0003537268,0.00015504367],"study_design_scores_gemma":[0.0007616397,0.00042115964,0.000038513164,0.00018509527,0.00016090537,0.00006588444,0.0005981425,0.000019416275,0.020660648,0.976783,0.00016142573,0.00014420283],"about_ca_topic_score_codex":0.000010509933,"about_ca_topic_score_gemma":0.0000012929277,"teacher_disagreement_score":0.023423184,"about_ca_system_score_codex":0.00015624388,"about_ca_system_score_gemma":0.00028990823,"threshold_uncertainty_score":0.63478786},"labels":[],"label_agreement":null},{"id":"W1596450573","doi":"10.37236/4019","title":"Additional Constructions to Solve the Generalized Russian Cards Problem using Combinatorial Designs","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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; Defense Advanced Research Projects Agency; Semiconductor Research Corporation","keywords":"Computer science; Leverage (statistics); Computer security; Theoretical computer science; Arithmetic; Discrete mathematics; Mathematical economics; Mathematics; Artificial intelligence","score_opus":0.013494369177216685,"score_gpt":0.2269681067281516,"score_spread":0.2134737375509349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596450573","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.34935015,0.014904859,0.5368851,0.0027486663,0.07400141,0.0059216954,0.0028106906,0.00080998597,0.012567443],"genre_scores_gemma":[0.9978925,0.00014141011,0.0002373004,0.00005025337,0.0014054084,0.000074039075,0.000053654985,0.000090077476,0.000055376982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701196,0.00035729588,0.0009237559,0.00020613286,0.00071065046,0.0007901809],"domain_scores_gemma":[0.99783415,0.00047130082,0.0005796829,0.00061084796,0.00032658785,0.00017745177],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018018401,0.00045694644,0.00071499695,0.00023562388,0.00046550372,0.00018355841,0.0012552291,0.00031744852,0.0003075161],"category_scores_gemma":[0.000075231976,0.000301965,0.0005094824,0.00043624372,0.00015397753,0.00008903384,0.00017630337,0.0026620436,0.000012696117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004403322,0.000036545865,0.0000043476825,0.000057132507,0.00065112044,0.0000039468214,0.00030234276,0.05654995,0.0001572188,0.92725766,0.014869556,0.00006615543],"study_design_scores_gemma":[0.00073013315,0.00019076339,0.000011514685,0.00025671357,0.0003188694,0.0005477376,0.0001244448,0.003463522,0.00026559774,0.96114486,0.032577597,0.00036822085],"about_ca_topic_score_codex":0.000015648784,"about_ca_topic_score_gemma":0.0000063730895,"teacher_disagreement_score":0.6485423,"about_ca_system_score_codex":0.0008872948,"about_ca_system_score_gemma":0.00086427614,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W1597739364","doi":"10.37236/682","title":"Strengthened Brooks' Theorem for Digraphs of Girth at least Three","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"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; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Digraph; Degree (music); Chromatic scale; Graph; Vertex (graph theory); Corollary; Delta; Discrete mathematics; Girth (graph theory); Physics","score_opus":0.037544311311885646,"score_gpt":0.26000391042211424,"score_spread":0.22245959911022858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597739364","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.9816463,0.0026654047,0.009829318,0.00006871961,0.0006190539,0.00032591095,0.000007749643,0.000020018813,0.0048175324],"genre_scores_gemma":[0.999148,0.00026479314,0.00022378993,0.000020185533,0.00007882121,0.000004339085,4.7384208e-7,0.00003935256,0.00022024878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818903,0.00012646304,0.0006600211,0.00011477734,0.000388948,0.00052074686],"domain_scores_gemma":[0.9973649,0.0008074502,0.00093140063,0.00047306248,0.00035301378,0.00007020843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016014677,0.00021180941,0.00046538023,0.00012947504,0.00025174834,0.000009468741,0.0008952161,0.000103041886,0.00004873555],"category_scores_gemma":[0.00028383362,0.00012406817,0.00042435495,0.00022165746,0.00022283666,0.000086802575,0.000111802474,0.00045590036,7.3434404e-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.00052630267,0.00015514268,0.00064138765,0.00004691793,0.0003295926,0.0000014199697,0.0017249899,0.0000018172145,0.00015668385,0.9955349,0.00026931392,0.00061154604],"study_design_scores_gemma":[0.0012591309,0.0010516156,0.00041669924,0.000036887053,0.00022874954,0.00009045324,0.00019154784,0.000027511216,0.006868692,0.9890883,0.0006015567,0.00013888047],"about_ca_topic_score_codex":0.00000279304,"about_ca_topic_score_gemma":0.000020381176,"teacher_disagreement_score":0.017501704,"about_ca_system_score_codex":0.00012133006,"about_ca_system_score_gemma":0.0001513531,"threshold_uncertainty_score":0.5059354},"labels":[],"label_agreement":null},{"id":"W1597940416","doi":"10.37236/1780","title":"Steiner Triple Systems Intersecting in Pairwise Disjoint Blocks","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"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 Waterloo","funders":"","keywords":"Disjoint sets; Pairwise comparison; Combinatorics; Mathematics; Steiner system; Order (exchange); Discrete mathematics; Statistics","score_opus":0.004361955931023079,"score_gpt":0.18012806763112676,"score_spread":0.1757661117001037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597940416","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.9810594,0.008235286,0.0071269497,0.00009007948,0.0021698065,0.0001675969,4.666089e-7,0.0000493389,0.0011010838],"genre_scores_gemma":[0.99952394,0.0002154389,0.0000012514411,0.00000794547,0.00012422598,0.0000056416775,2.6501036e-7,0.000029124982,0.00009217862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846846,0.00011528935,0.00058982347,0.00007448465,0.00025078954,0.0005011265],"domain_scores_gemma":[0.99941105,0.000081395636,0.00017635261,0.00020034458,0.0000693082,0.000061569895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001613925,0.00016212963,0.0003172985,0.00018323374,0.00005987306,0.00004265813,0.00036797152,0.00007099327,0.0000034537825],"category_scores_gemma":[0.00004488751,0.00011377024,0.00013147836,0.00046783636,0.000025426241,0.00013757702,0.000019903586,0.0009019332,0.0000047380818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000998453,0.00017940304,0.0005879199,0.00012699212,0.0002357678,0.000075633514,0.0032967082,0.189172,0.0026032429,0.8030234,0.00025427627,0.00034482311],"study_design_scores_gemma":[0.010402378,0.0019310032,0.0004917819,0.0013246891,0.00018763161,0.0028996058,0.0105275335,0.008440867,0.0089616375,0.946779,0.007089805,0.00096405955],"about_ca_topic_score_codex":0.0000225034,"about_ca_topic_score_gemma":0.000019204197,"teacher_disagreement_score":0.18073113,"about_ca_system_score_codex":0.0006773185,"about_ca_system_score_gemma":0.000103558596,"threshold_uncertainty_score":0.46394157},"labels":[],"label_agreement":null},{"id":"W1598065240","doi":"10.37236/3527","title":"A De Bruijn–Erdős Theorem for Chordal Graphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canada Research Chairs; Concordia University; National Science Foundation","keywords":"Mathematics; De Bruijn sequence; Generalization; Combinatorics; Chordal graph; Metric space; Discrete mathematics; Assertion; Graph; Computer science; Mathematical analysis","score_opus":0.01595044930320462,"score_gpt":0.2582220934261321,"score_spread":0.2422716441229275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598065240","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.07309765,0.0021510618,0.921455,0.002138336,0.00069544604,0.00011034783,3.1011564e-7,0.000017628972,0.00033416148],"genre_scores_gemma":[0.99795896,0.000076516386,0.0013340416,0.00023352771,0.00016491585,0.0000042577703,6.333914e-7,0.0000068264917,0.00022029827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998816,0.00012501897,0.00025191286,0.00009080535,0.00035045508,0.0003658051],"domain_scores_gemma":[0.99872035,0.00024737182,0.00023732739,0.0001853941,0.0005017507,0.00010779742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025136403,0.00009009636,0.00013579069,0.000117034666,0.00011505006,0.00010642147,0.00082799187,0.0000372357,0.0000010360519],"category_scores_gemma":[0.0001968057,0.00006280665,0.000114088776,0.0005222929,0.000024848303,0.00026852317,0.000053071522,0.00026855734,0.0000022677943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035444955,0.000057454814,0.000032499964,0.0000022350466,0.00003270157,0.0000015063679,0.00042546107,0.0019124857,0.000115847775,0.9920033,0.0014457038,0.0039353375],"study_design_scores_gemma":[0.0008460412,0.000713303,0.00007945806,0.000004893445,0.000017618944,0.00023945347,0.000040216008,0.012109605,0.0013925085,0.9713422,0.013139128,0.000075587486],"about_ca_topic_score_codex":0.0000023409941,"about_ca_topic_score_gemma":0.0000015590394,"teacher_disagreement_score":0.9248613,"about_ca_system_score_codex":0.00024551607,"about_ca_system_score_gemma":0.0012007059,"threshold_uncertainty_score":0.2561181},"labels":[],"label_agreement":null},{"id":"W1598186826","doi":"10.37236/1548","title":"Small Forbidden Configurations II","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Combinatorics; Mathematics; Notation; Permutation (music); Vertex (graph theory); Matrix (chemical analysis); Discrete mathematics; Graph; Physics; Arithmetic","score_opus":0.006646584142994286,"score_gpt":0.17528224717656196,"score_spread":0.16863566303356767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598186826","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.9657313,0.0055288104,0.002630554,0.0002455981,0.0005814539,0.00010142752,9.35863e-7,0.000057694942,0.025122177],"genre_scores_gemma":[0.9977624,0.0007212074,0.0000018026142,0.00002402271,0.00010339513,0.000002406576,4.997474e-7,0.000017454906,0.0013668289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991426,0.000064754466,0.0002903513,0.000039758503,0.00014290772,0.000319623],"domain_scores_gemma":[0.9995998,0.00006117129,0.00006462823,0.0001634695,0.00006261426,0.000048331483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058256957,0.000099280274,0.00015712928,0.000051418294,0.00015840125,0.000023255378,0.0003327868,0.00004745134,0.00015445823],"category_scores_gemma":[0.000009450527,0.00006997412,0.000103872866,0.00022237853,0.000025980564,0.00008768899,0.0000058795636,0.0004548754,0.00002520047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021290669,0.000041793002,0.000016424028,0.000010078027,0.00014543605,0.0000044594135,0.0006299495,0.0031832152,0.00096076453,0.9908716,0.0014473118,0.0026676627],"study_design_scores_gemma":[0.00082312233,0.0005032008,0.00015295445,0.00003425607,0.000085227766,0.00048702833,0.00019342951,0.0010719282,0.0031959466,0.86500704,0.12825453,0.00019135502],"about_ca_topic_score_codex":0.0000015496817,"about_ca_topic_score_gemma":0.000003541515,"teacher_disagreement_score":0.12680721,"about_ca_system_score_codex":0.00009521408,"about_ca_system_score_gemma":0.00006875927,"threshold_uncertainty_score":0.28534618},"labels":[],"label_agreement":null},{"id":"W1598672207","doi":"10.37236/2533","title":"A Note on Forbidding Clique Immersions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"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; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Digraph; Eulerian path; Clique; Discrete mathematics; Graph; Structured program theorem; Immersion (mathematics); Robertson–Seymour theorem; Extremal graph theory; Pathwidth; Line graph; Pure mathematics; Voltage graph","score_opus":0.011424469731928658,"score_gpt":0.2835691420794096,"score_spread":0.2721446723474809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598672207","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.10787873,0.0010322962,0.8788394,0.008759561,0.0006029226,0.00028120287,1.934112e-7,0.00003725239,0.0025684382],"genre_scores_gemma":[0.9987731,0.00033484877,0.00024020915,0.00026195895,0.000053314445,0.000005760587,7.5507074e-8,0.000012635653,0.00031810222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981011,0.00022889148,0.00029935237,0.0001299241,0.0005464817,0.0006942343],"domain_scores_gemma":[0.99812454,0.000667072,0.0002628816,0.0004964123,0.00032988068,0.00011920017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014038444,0.00012461467,0.00018292153,0.00019882369,0.00023972557,0.00009851113,0.0019222666,0.00004870895,0.00001444037],"category_scores_gemma":[0.00019652027,0.0000788614,0.00014237408,0.000727035,0.00006237766,0.0005500086,0.00017725785,0.0011693046,0.00007405001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001417344,0.00006143089,0.000020213005,0.0000019391882,0.00002281149,0.000005128576,0.00016575656,0.00010767533,0.0010244638,0.9941411,0.00051540154,0.0039198915],"study_design_scores_gemma":[0.00041959586,0.0008473566,0.00012216001,0.00002111573,0.0000056677254,0.00012307492,0.000044913813,0.0020211602,0.0036894833,0.99003804,0.0025736296,0.00009383049],"about_ca_topic_score_codex":0.0000041931935,"about_ca_topic_score_gemma":6.989105e-7,"teacher_disagreement_score":0.89089435,"about_ca_system_score_codex":0.00033322835,"about_ca_system_score_gemma":0.00036773496,"threshold_uncertainty_score":0.50801116},"labels":[],"label_agreement":null},{"id":"W1599440049","doi":"10.37236/1127","title":"From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":11,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially ordered set; Mathematics; Combinatorics; Omega; Order (exchange); Ordered set; Set (abstract data type); Discrete mathematics; Physics; Computer science","score_opus":0.013163943820404006,"score_gpt":0.26225922058319767,"score_spread":0.24909527676279367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599440049","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.9756934,0.0020644234,0.014248107,0.0050944462,0.00093884644,0.00035780392,0.0000092425435,0.000078326935,0.0015154153],"genre_scores_gemma":[0.9973168,0.000227461,0.00055785035,0.00040130463,0.00063233025,0.000008075712,0.000007709304,0.00010234736,0.0007461603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960998,0.00029806397,0.0011236438,0.00031764293,0.0009820585,0.0011787465],"domain_scores_gemma":[0.99706745,0.0007365509,0.0008822257,0.0007562392,0.00036020926,0.0001973008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013707838,0.00044836808,0.0007925577,0.00022766131,0.00029531162,0.00014815848,0.0011853531,0.00018807923,0.00011429838],"category_scores_gemma":[0.0002625995,0.000339673,0.00033761765,0.00056026666,0.000076313445,0.00024279504,0.00013766845,0.0012268467,0.00010553273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034049232,0.0026713207,0.00087798084,0.000084875806,0.0006664418,0.00011719637,0.0019459184,0.000078823476,0.0020195923,0.90954274,0.07720409,0.0044505163],"study_design_scores_gemma":[0.0018558763,0.0008826893,0.0005530067,0.0000975768,0.0002044989,0.0001476549,0.00024582286,0.00013748946,0.003552138,0.97526115,0.016663546,0.00039857713],"about_ca_topic_score_codex":0.00015500383,"about_ca_topic_score_gemma":0.0000958803,"teacher_disagreement_score":0.065718375,"about_ca_system_score_codex":0.000528584,"about_ca_system_score_gemma":0.00042751292,"threshold_uncertainty_score":0.9999055},"labels":[],"label_agreement":null},{"id":"W1599576919","doi":"10.37236/4080","title":"Crossings and Nestings for Arc-Coloured Permutations and Automation","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"Capilano University; Simon Fraser University","funders":"","keywords":"Bijection; Mathematics; Chen; Combinatorics; Generalization; Arc (geometry); Set (abstract data type); Series (stratigraphy); Discrete mathematics; Computer science","score_opus":0.04878634793981741,"score_gpt":0.33876615247840836,"score_spread":0.28997980453859096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599576919","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.8504282,0.0018557863,0.14513494,0.0014822885,0.00043669489,0.0004292895,0.0000012288576,0.000046674224,0.00018485649],"genre_scores_gemma":[0.99739075,0.00009987679,0.0021198164,0.000032111304,0.00009317759,0.00001188626,4.5214298e-7,0.00003222342,0.0002196935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867153,0.00007779358,0.00048340834,0.000100479476,0.00032225516,0.0003445083],"domain_scores_gemma":[0.99714214,0.0012616377,0.00068063126,0.00016056852,0.00063691486,0.00011808366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017516529,0.00015304532,0.0003159302,0.00008422367,0.00023198134,0.00010156165,0.00020606839,0.000072613155,6.3094774e-7],"category_scores_gemma":[0.0031449625,0.000111204055,0.000055156448,0.00020534398,0.00011989852,0.00026371898,0.00004995794,0.00034238037,4.5961477e-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.000048702324,0.00007340409,0.000046441368,0.0000566783,0.000039377166,0.0000012345342,0.0027235355,0.000008348978,0.00015129989,0.99579006,0.00077553,0.00028537386],"study_design_scores_gemma":[0.0019716553,0.0006459597,0.000046265617,0.000047390487,0.00014254109,0.00036270087,0.00065698405,0.0014390907,0.00031018496,0.992691,0.0015669933,0.00011925633],"about_ca_topic_score_codex":0.0000014688588,"about_ca_topic_score_gemma":0.0000014058012,"teacher_disagreement_score":0.14696251,"about_ca_system_score_codex":0.00024292234,"about_ca_system_score_gemma":0.00039720492,"threshold_uncertainty_score":0.45347697},"labels":[],"label_agreement":null},{"id":"W1600003812","doi":"10.37236/1962","title":"Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Mathematics; Generalization; Cartesian product; Hamming bound; Binary number; Combinatorics; Discrete mathematics; Perfect power; Metric (unit); Block code; Linear code; Algorithm; Arithmetic; Decoding methods","score_opus":0.0038938752042240923,"score_gpt":0.18445010385323013,"score_spread":0.18055622864900603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600003812","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.9824675,0.016249567,0.00017565348,0.00013972403,0.00020124848,0.000096714895,7.549355e-7,0.000013883424,0.0006550002],"genre_scores_gemma":[0.99859434,0.0012673491,0.0000048862776,0.000007836101,0.000074966636,0.0000018318291,2.2925018e-7,0.000017041646,0.000031490064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895597,0.00011593578,0.00038489344,0.00006061571,0.00017340179,0.00030917014],"domain_scores_gemma":[0.9994848,0.000106622254,0.00013211917,0.00015681503,0.000081607504,0.000038049737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012230235,0.00011859955,0.00027373928,0.00013814619,0.000033013177,0.000013075173,0.00020100512,0.000050882234,0.000002681145],"category_scores_gemma":[0.000051279225,0.00008676255,0.000050510997,0.00034862547,0.000043150783,0.00012487575,0.000013016113,0.00048481935,0.000001285986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012595534,0.00023954382,0.007873369,0.00034162428,0.00027190108,0.000020067751,0.0067412276,0.008689546,0.021185774,0.94689304,0.0003102993,0.00730763],"study_design_scores_gemma":[0.008208515,0.004072138,0.02054952,0.00095962314,0.00039667948,0.002329966,0.002975086,0.011092143,0.14072059,0.7761048,0.03121221,0.0013786914],"about_ca_topic_score_codex":0.000003388049,"about_ca_topic_score_gemma":0.000012810878,"teacher_disagreement_score":0.17078823,"about_ca_system_score_codex":0.00010771389,"about_ca_system_score_gemma":0.00008312875,"threshold_uncertainty_score":0.35380742},"labels":[],"label_agreement":null},{"id":"W1601736385","doi":"10.37236/638","title":"Chromatic Roots of a Ring of Four Cliques","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"University of Waterloo","funders":"Division of Mathematical Sciences; Isaac Newton Institute for Mathematical Sciences","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chromatic scale; Graph; Chromatic polynomial; Discrete mathematics","score_opus":0.0224879710711412,"score_gpt":0.21891899077507954,"score_spread":0.19643101970393834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601736385","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.941215,0.0040880824,0.0530859,0.00018518981,0.0003406707,0.000074073636,1.2453961e-7,0.000019320752,0.0009916751],"genre_scores_gemma":[0.9989059,0.00028595352,0.0007474629,0.000021330705,0.0000048084135,5.9474655e-7,2.5892774e-8,0.000006753488,0.000027180791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.00012655067,0.00057748536,0.00007837489,0.00037538054,0.00029198092],"domain_scores_gemma":[0.9982765,0.000120556746,0.0008222943,0.00036132184,0.00037015966,0.000049177102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599176,0.00009486525,0.00028257017,0.00014834752,0.000048482867,0.000010977799,0.0010294771,0.000039766426,0.0000033670663],"category_scores_gemma":[0.000078227495,0.00006189321,0.00013238305,0.00045828853,0.00006132838,0.00018600258,0.00010101828,0.00031126148,0.0000013090528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013509022,0.00013251748,0.00032541543,0.000026029089,0.000066388646,0.0000034055818,0.00073746144,0.000024716877,0.003166509,0.9949188,0.00004590968,0.0005393423],"study_design_scores_gemma":[0.00046171056,0.0009657744,0.0010237519,0.00009686136,0.00003265807,0.00011826883,0.00002942136,0.0010284914,0.034499094,0.96164775,0.000030188603,0.00006600377],"about_ca_topic_score_codex":0.000018271743,"about_ca_topic_score_gemma":0.0000017242147,"teacher_disagreement_score":0.057690926,"about_ca_system_score_codex":0.000046061217,"about_ca_system_score_gemma":0.00029604312,"threshold_uncertainty_score":0.2523932},"labels":[],"label_agreement":null},{"id":"W1601805893","doi":"10.37236/426","title":"Symmetric Laman Theorems for the Groups $\\mathcal{C}_2$ and $\\mathcal{C}_s$","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"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; Technische Universität Berlin; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Automorphism; Reflection symmetry; Type (biology); Center (category theory); Symmetry (geometry); Symmetry group; Geometry; Crystallography","score_opus":0.027117145144054822,"score_gpt":0.3175550522156717,"score_spread":0.2904379070716169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601805893","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.96587,0.005013723,0.019809673,0.0050666514,0.001311542,0.0011170704,0.0000066449034,0.000058031837,0.0017466238],"genre_scores_gemma":[0.9977707,0.0008301724,0.0001323853,0.000100537116,0.00043169642,0.000030364452,7.453817e-7,0.00008261682,0.000620728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996777,0.00035379184,0.0007285668,0.00020989368,0.0008688007,0.0010619418],"domain_scores_gemma":[0.98791665,0.009966232,0.0006099957,0.00077903015,0.000564417,0.00016367082],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.010283869,0.00030501364,0.0005087666,0.00028368083,0.0005869518,0.00018745328,0.0016013676,0.0001956188,0.000035757155],"category_scores_gemma":[0.0035174834,0.00016068212,0.00029014525,0.0008844618,0.00041387125,0.0001968746,0.00020859373,0.0027087925,0.000009476864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001823752,0.00018693758,0.00012294164,0.000055292054,0.00020541574,0.0000049891314,0.0005139009,0.0000010743647,0.00086873275,0.9944241,0.0010170285,0.0024172228],"study_design_scores_gemma":[0.0014486568,0.0008565307,0.00024276304,0.000024046458,0.0001950565,0.00057499256,0.00039613823,0.0007648909,0.0008982032,0.98637307,0.008027262,0.0001983803],"about_ca_topic_score_codex":0.00000478672,"about_ca_topic_score_gemma":0.000019777824,"teacher_disagreement_score":0.03190071,"about_ca_system_score_codex":0.00016786245,"about_ca_system_score_gemma":0.00035942264,"threshold_uncertainty_score":0.999592},"labels":[],"label_agreement":null},{"id":"W1603130817","doi":"10.37236/1075","title":"Tilings of the Sphere with Right Triangles II: The $(1,3,2)$, $(0,2,n)$ Subfamily","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Tile; Combinatorics; Mathematics; Subfamily; Enhanced Data Rates for GSM Evolution; Geometry; Computer science; Geography; Archaeology","score_opus":0.0025174302357997475,"score_gpt":0.16409603810161613,"score_spread":0.16157860786581638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603130817","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.9879228,0.008363783,0.00019440587,0.0017233393,0.00042535792,0.00015247756,0.0000021366714,0.00000803766,0.0012076639],"genre_scores_gemma":[0.9986865,0.00014132101,0.00000802164,0.00008392556,0.0001542694,0.0000014662114,1.6969341e-7,0.000015329711,0.0009090247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828595,0.00023060931,0.00041298722,0.00008926341,0.0005747199,0.00040648843],"domain_scores_gemma":[0.99863327,0.00014254275,0.00063403085,0.00033887924,0.0002257413,0.00002555753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061388,0.00014986924,0.00024964672,0.00001833234,0.00046359774,0.00005805498,0.0010679449,0.000049299957,0.00007730685],"category_scores_gemma":[0.00003691514,0.0000497665,0.00013729713,0.0002998494,0.00031103895,0.00010946669,0.000090019326,0.00046225297,0.0000018768303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007023487,0.00018415024,0.0005951089,0.00003714751,0.00007756223,0.000008077777,0.0010010232,0.0009244132,0.1508442,0.84098923,0.0042058993,0.0004308471],"study_design_scores_gemma":[0.0012757131,0.0012154705,0.0018340638,0.000075898766,0.00014961127,0.0004616489,0.00035177803,0.000028014609,0.2984111,0.6597462,0.036280707,0.00016976385],"about_ca_topic_score_codex":0.00013562865,"about_ca_topic_score_gemma":0.00010015686,"teacher_disagreement_score":0.18124299,"about_ca_system_score_codex":0.000110707944,"about_ca_system_score_gemma":0.0003882012,"threshold_uncertainty_score":0.35656658},"labels":[],"label_agreement":null},{"id":"W1607925521","doi":"10.37236/389","title":"Cyclic Permutations of Sequences and Uniform Partitions","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"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":"National Science Council","keywords":"Combinatorics; Mathematics; Permutation (music); Path (computing); Distribution (mathematics); Physics; Mathematical analysis","score_opus":0.016322459650125416,"score_gpt":0.3035851672877919,"score_spread":0.2872627076376665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607925521","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.9839204,0.00035582448,0.0128929755,0.00071772555,0.0005966025,0.0001650638,0.0000021952092,0.00001916656,0.0013300703],"genre_scores_gemma":[0.9988284,0.00025216574,0.0006973653,0.000011316636,0.00007311899,0.000004401717,3.1851107e-7,0.00001999169,0.0001129164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857765,0.00006668497,0.0005955855,0.000074201766,0.00037060794,0.00031524437],"domain_scores_gemma":[0.9974299,0.0010504145,0.0007597448,0.00028973384,0.00039722436,0.00007295635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010144787,0.00013333271,0.00031750786,0.000101073245,0.00015907585,0.00002233716,0.00039407954,0.00007350685,0.000020224516],"category_scores_gemma":[0.0010504165,0.00009078046,0.000096501135,0.00033625108,0.00021338393,0.00020136208,0.00004855092,0.00082998927,0.0000015197629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009186836,0.00014006766,0.00008637449,0.0000316579,0.000055937333,0.0000016743338,0.0005807915,0.00000899235,0.0030409284,0.9958532,0.00009255504,0.00009863062],"study_design_scores_gemma":[0.0004984418,0.0003030306,0.000066721106,0.000029909226,0.00012407849,0.00026006764,0.0004156849,0.000055863544,0.005006471,0.99256057,0.0005876079,0.000091573755],"about_ca_topic_score_codex":0.000002280333,"about_ca_topic_score_gemma":0.000014964444,"teacher_disagreement_score":0.014908029,"about_ca_system_score_codex":0.00007379517,"about_ca_system_score_gemma":0.00033004108,"threshold_uncertainty_score":0.37019196},"labels":[],"label_agreement":null},{"id":"W1611527593","doi":"10.37236/427","title":"A Formula for the Bivariate Map Asymptotics Constants in terms of the Univariate Map Asymptotics Constants","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Univariate; Combinatorics; Variety (cybernetics); Constant (computer programming); Multivariate statistics; Statistics","score_opus":0.01541570980983303,"score_gpt":0.2894333062836103,"score_spread":0.27401759647377727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611527593","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.66283387,0.0023348283,0.28306574,0.011543351,0.02849106,0.008147576,0.00013065059,0.0001707048,0.0032822085],"genre_scores_gemma":[0.9978836,0.00020092216,0.0011243338,0.000075593634,0.00018889879,0.000017838482,6.9234665e-7,0.00009903459,0.00040905614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955465,0.0003027563,0.0017727476,0.00022295477,0.0010313415,0.0011237027],"domain_scores_gemma":[0.98943627,0.0059820567,0.0025080214,0.0012690322,0.0006873883,0.000117219286],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0041423207,0.0004686037,0.0009285662,0.00017633189,0.00038159222,0.00008271522,0.0024550094,0.0002866739,0.0000171008],"category_scores_gemma":[0.0027816657,0.00025157828,0.000434583,0.00078045623,0.00049917516,0.00023756048,0.00031488598,0.0023356727,0.0000046607342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017922549,0.00045280802,0.0002992222,0.00015362214,0.00028324986,0.000004904524,0.0007876271,0.000089649155,0.0011917646,0.9959439,0.0004415501,0.00017248584],"study_design_scores_gemma":[0.0036820255,0.00037502826,0.00009268243,0.00023477746,0.0004126131,0.00015353515,0.0003236264,0.0014415268,0.0036850795,0.98597515,0.0033396755,0.0002842867],"about_ca_topic_score_codex":0.0000057070015,"about_ca_topic_score_gemma":0.00005506833,"teacher_disagreement_score":0.33504975,"about_ca_system_score_codex":0.00045346652,"about_ca_system_score_gemma":0.0010277018,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W1612117521","doi":"10.37236/1967","title":"Permanents of Hessenberg (0,1)-matrices","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"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 Victoria","funders":"","keywords":"Combinatorics; Mathematics; Matrix (chemical analysis); Chemistry","score_opus":0.005077674926159721,"score_gpt":0.22489663216416333,"score_spread":0.21981895723800363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612117521","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.60964364,0.024673173,0.3533332,0.0063797752,0.0014677775,0.00020446298,0.0000010505123,0.000059164573,0.004237728],"genre_scores_gemma":[0.9983699,0.00086803094,0.00023337334,0.00006927424,0.00014569829,5.0865566e-7,9.0273176e-8,0.0000063734215,0.00030680237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.00014116132,0.000421754,0.000084845684,0.00044419113,0.0003579359],"domain_scores_gemma":[0.9986909,0.00019233566,0.0005287118,0.00032876796,0.00020282852,0.00005647137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014005615,0.000105894476,0.00021966697,0.000110405446,0.00009046482,0.000037270922,0.0016505253,0.000038694587,0.000013092636],"category_scores_gemma":[0.000039000406,0.000067980225,0.00013130721,0.00047355468,0.000043947028,0.00042539157,0.00010726116,0.00041729555,0.000012063761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012739214,0.00012429141,0.000041709172,0.000008681764,0.00004507551,0.0000039772594,0.00033502854,0.0001853326,0.00023586095,0.9929539,0.00032198327,0.005731396],"study_design_scores_gemma":[0.0009402182,0.00061374344,0.00016098947,0.000035214718,0.000046818663,0.00047969556,0.000054589935,0.004511974,0.015713632,0.9452851,0.031988394,0.00016963731],"about_ca_topic_score_codex":0.0000016558486,"about_ca_topic_score_gemma":5.94736e-7,"teacher_disagreement_score":0.3887262,"about_ca_system_score_codex":0.00010690451,"about_ca_system_score_gemma":0.00024506808,"threshold_uncertainty_score":0.3067114},"labels":[],"label_agreement":null},{"id":"W1612749533","doi":"10.37236/3128","title":"Optimization Problems over Unit-Distance Representations of Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Hypersphere; Mathematics; Combinatorics; Ellipsoid; Homomorphism; Generalization; Graph; Discrete mathematics; Unit sphere; Unit (ring theory)","score_opus":0.0181356453415886,"score_gpt":0.29378667735360786,"score_spread":0.27565103201201924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612749533","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.019076029,0.006334672,0.9721239,0.0006761562,0.0006730251,0.00051331654,0.0000028472004,0.000031620857,0.0005684311],"genre_scores_gemma":[0.99307716,0.0045173275,0.0019626368,0.00002366901,0.000039502273,0.000023573537,0.0000035766595,0.000029349558,0.00032323343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965997,0.0005390878,0.0008865735,0.00029176,0.0010665387,0.0006163774],"domain_scores_gemma":[0.9949602,0.00045068294,0.0017509036,0.001287627,0.0014447322,0.00010586978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019090223,0.00025712553,0.0004789965,0.00044357992,0.0001605279,0.00014242764,0.0035991946,0.00015720278,0.00001739734],"category_scores_gemma":[0.0002270653,0.00019161368,0.00027815386,0.001339709,0.00021211943,0.00055398466,0.000841258,0.0021519805,0.0000022486445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014541868,0.00011012998,0.0001482725,0.000044861434,0.00012410739,0.000002177515,0.0003688423,0.18331724,0.00006456759,0.8154124,0.00013737382,0.0002554825],"study_design_scores_gemma":[0.00048098076,0.0002624946,0.0001597947,0.00011921131,0.00003711108,0.00003821969,0.000037453847,0.029012382,0.0004841321,0.9688862,0.0003135112,0.00016848303],"about_ca_topic_score_codex":0.000019130557,"about_ca_topic_score_gemma":0.0000037288917,"teacher_disagreement_score":0.9740011,"about_ca_system_score_codex":0.00027504103,"about_ca_system_score_gemma":0.001120275,"threshold_uncertainty_score":0.93494046},"labels":[],"label_agreement":null},{"id":"W1616478863","doi":"10.37236/585","title":"Counting the Number of Elements in the Mutation Classes of $\\tilde A_n-$Quivers","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","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":"Université du Québec à Montréal","funders":"","keywords":"Quiver; Mathematics; Cluster algebra; Type (biology); Equivalence (formal languages); Tilde; Combinatorics; Product (mathematics); Pure mathematics; Geometry; Physics","score_opus":0.03247813008759766,"score_gpt":0.296360763325456,"score_spread":0.2638826332378584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616478863","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.99637663,0.00040687632,0.0010029443,0.00016451172,0.00041532982,0.00020066393,5.163199e-7,0.0000038774147,0.0014286191],"genre_scores_gemma":[0.9996403,0.00018061715,0.000047340567,0.00003749879,0.00005361568,0.0000029753119,2.3123816e-7,0.00001550608,0.000021957685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782574,0.0003176725,0.00077342556,0.00007577268,0.0006705979,0.0003367992],"domain_scores_gemma":[0.9973256,0.0007404919,0.0012982445,0.00030862243,0.00030784952,0.000019220899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024813078,0.00013923697,0.00030625315,0.000056598543,0.00009759906,0.000014441157,0.0008901725,0.00006730467,0.000031185664],"category_scores_gemma":[0.00029439194,0.0000689305,0.00015037066,0.00039389197,0.00010968752,0.00012547745,0.000052295058,0.0005874747,7.590385e-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.000082158076,0.00015037465,0.0020129126,0.000026033289,0.000110720255,0.0000023414652,0.0048297513,0.000007664098,0.000050368413,0.992482,0.000103407285,0.00014228174],"study_design_scores_gemma":[0.00084767694,0.00025672282,0.0015623071,0.00004387274,0.00013930594,0.000074828815,0.0030175194,0.00004898496,0.0013386655,0.9925051,0.000096127485,0.00006892137],"about_ca_topic_score_codex":0.00004554659,"about_ca_topic_score_gemma":0.000009490656,"teacher_disagreement_score":0.0032635964,"about_ca_system_score_codex":0.00013522021,"about_ca_system_score_gemma":0.00026453394,"threshold_uncertainty_score":0.28109044},"labels":[],"label_agreement":null},{"id":"W1624196023","doi":"10.37236/2449","title":"The Canada Day Theorem","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet; Universities Space Research Association","keywords":"Mathematics; Abelian group; Combinatorics; Integrable system; Product (mathematics); Identity (music); Structured program theorem; Robertson–Seymour theorem; Graph; Discrete mathematics; Pure mathematics; Line graph; 1-planar graph","score_opus":0.0024172018073863825,"score_gpt":0.19280964241322257,"score_spread":0.19039244060583618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624196023","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.94776195,0.0038008622,0.004587848,0.014066958,0.0021331643,0.00033904074,0.0000052184787,0.000009192272,0.027295751],"genre_scores_gemma":[0.9976143,0.00006346688,0.0000017596947,0.000069526955,0.00037150507,0.0000020981045,6.0901334e-7,0.000010916687,0.0018657999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989037,0.00010963913,0.0002467171,0.00004699981,0.00025479877,0.00043818183],"domain_scores_gemma":[0.99899626,0.0003231785,0.00022333644,0.00021479573,0.0001780612,0.00006435371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005830527,0.000093123264,0.00012506853,0.0000108322,0.00032153339,0.00007515823,0.0005215835,0.000013650611,0.00007744334],"category_scores_gemma":[0.000014606132,0.00004378627,0.00009052036,0.00012088788,0.00005020445,0.000069007125,0.000035898523,0.0005455235,0.000008699677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030107797,0.000023021817,0.00055106945,4.806151e-7,0.00008520746,4.444872e-7,0.00005471063,0.000015665833,0.000024297444,0.9888393,0.007833275,0.002569502],"study_design_scores_gemma":[0.0002451592,0.000073146584,0.0006800058,0.0000043097334,0.000024526444,0.000008163147,0.00057098345,0.00016481412,0.0003602878,0.89516306,0.10263538,0.000070139904],"about_ca_topic_score_codex":0.019383147,"about_ca_topic_score_gemma":0.0026923674,"teacher_disagreement_score":0.09480211,"about_ca_system_score_codex":0.00013090161,"about_ca_system_score_gemma":0.0012135291,"threshold_uncertainty_score":0.98714685},"labels":[],"label_agreement":null},{"id":"W1629366369","doi":"10.37236/1893","title":"Matroid Inequalities from Electrical Network Theory","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"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 Waterloo","funders":"","keywords":"Matroid; Mathematics; Generalization; Combinatorics; Rank (graph theory); Logarithm; Class (philosophy); Graphic matroid; Property (philosophy); Discrete mathematics; Plane (geometry); Mathematical analysis; Geometry","score_opus":0.010880758061514501,"score_gpt":0.2616404004158826,"score_spread":0.2507596423543681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629366369","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.05500294,0.02331611,0.9169421,0.002907929,0.00045597058,0.00013237262,6.4077415e-7,0.000066551,0.0011753659],"genre_scores_gemma":[0.9966067,0.0010054499,0.0009296986,0.00035177285,0.0005959696,0.000003430439,4.314694e-7,0.000020336258,0.0004861769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965337,0.0008786849,0.00053720066,0.00018297927,0.0008041152,0.0010633214],"domain_scores_gemma":[0.9969243,0.0016465054,0.00039219146,0.0006280721,0.00027804417,0.00013087933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038343912,0.00018769524,0.00032651692,0.00013741029,0.00025301214,0.00012389026,0.0027506836,0.000073823154,0.000024170204],"category_scores_gemma":[0.00022963739,0.00012582408,0.00018723086,0.0009914389,0.00011270105,0.0006091659,0.00024550874,0.0014373091,0.00003349038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009537712,0.00007274938,0.0000764707,0.000001190913,0.00008642708,0.000007518992,0.0003007458,0.0007288376,0.00011361608,0.98940176,0.0008234043,0.008291902],"study_design_scores_gemma":[0.00056960597,0.0004675279,0.0001014509,0.000011645883,0.000018522089,0.0001156005,0.00004005371,0.0018799164,0.001003055,0.9848046,0.010846123,0.0001419111],"about_ca_topic_score_codex":0.0000025737256,"about_ca_topic_score_gemma":0.0000027958038,"teacher_disagreement_score":0.9416038,"about_ca_system_score_codex":0.0004308536,"about_ca_system_score_gemma":0.00054480816,"threshold_uncertainty_score":0.6244472},"labels":[],"label_agreement":null},{"id":"W1634002241","doi":"10.37236/621","title":"Further Applications of a Power Series Method for Pattern Avoidance","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":15,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Alphabet; Mathematics; Morphism; Combinatorics; Combinatorics on words; Sigma; Series (stratigraphy); Class (philosophy); Binary number; Word (group theory); Algebraic combinatorics; Discrete mathematics; Algebraic number; Power series; Arithmetic; Computer science; Geometry","score_opus":0.009534080433971958,"score_gpt":0.24123411333055647,"score_spread":0.2317000328965845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634002241","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.0044754706,0.0023336194,0.99191976,0.0005664947,0.00017398337,0.0001558124,0.0000011316051,0.00001676601,0.00035695665],"genre_scores_gemma":[0.9946303,0.00016751957,0.0049118265,0.000109819935,0.000030821055,0.000016488548,1.2194053e-7,0.000010988357,0.00012213492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989923,0.000104649174,0.00032449744,0.00009643887,0.0001934025,0.00028871262],"domain_scores_gemma":[0.99863863,0.00020446215,0.00047071447,0.00040127677,0.000248557,0.000036333702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014298462,0.000094968585,0.00019775641,0.00006418751,0.000072364026,0.000019911127,0.0012710594,0.00003640501,0.000009362131],"category_scores_gemma":[0.000025834386,0.000062893654,0.00012670264,0.00028063264,0.0000424429,0.00025381308,0.00007426975,0.00022895745,0.0000021722128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019616973,0.000104275605,0.000037867685,0.000009669582,0.000056536464,5.980955e-7,0.001656275,0.0000032438472,0.0005026062,0.9851894,0.00016064043,0.012259298],"study_design_scores_gemma":[0.00035231083,0.0005593053,0.00017241277,0.000013283945,0.00002341035,0.00011127603,0.00015532166,0.00052103435,0.0116859265,0.98085,0.0054729595,0.00008277752],"about_ca_topic_score_codex":0.0000044185585,"about_ca_topic_score_gemma":0.0000014459056,"teacher_disagreement_score":0.9901548,"about_ca_system_score_codex":0.000052823514,"about_ca_system_score_gemma":0.0001804908,"threshold_uncertainty_score":0.2564729},"labels":[],"label_agreement":null},{"id":"W1635722406","doi":"10.37236/6251","title":"Combinatorics of Exceptional Sequences in Type A","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"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":"National Security Agency; National Science Foundation","keywords":"Quiver; Bijection; Dynkin diagram; Mathematics; Type (biology); Combinatorics; Class (philosophy); Lattice (music); Simple (philosophy); Diagram; Pure mathematics; Computer science; Physics; Artificial intelligence; Biology; Lie algebra","score_opus":0.03224969220112932,"score_gpt":0.3069867123356726,"score_spread":0.27473702013454326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1635722406","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.9783463,0.0091150245,0.0013380457,0.00043569278,0.009365422,0.0005464629,0.000004799094,0.00001935765,0.0008289038],"genre_scores_gemma":[0.99695593,0.0023513795,0.000031201667,0.000025384237,0.00024094373,0.0000061458104,0.0000033270044,0.000060039514,0.00032563234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957359,0.00041028205,0.0015492315,0.00028347978,0.0013134179,0.0007077312],"domain_scores_gemma":[0.9946989,0.000984323,0.0024441339,0.0007805641,0.001007165,0.0000849429],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023953745,0.0004547222,0.0012852437,0.0003486907,0.00006708644,0.000048761656,0.0018487318,0.0005140934,0.000046468333],"category_scores_gemma":[0.00060867466,0.0003264792,0.0004389018,0.0006898603,0.00015685667,0.00012240474,0.0005114764,0.0033091672,0.000003790955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017447537,0.00027490212,0.00075773423,0.00024106677,0.0002529613,0.000008226239,0.0005487284,0.0007891168,0.00003113277,0.9962256,0.00063937384,0.00005666651],"study_design_scores_gemma":[0.0013086365,0.000751766,0.000268276,0.00034172094,0.00018561374,0.000077781544,0.00017953727,0.0001719748,0.00025791442,0.99576694,0.0003870693,0.00030276162],"about_ca_topic_score_codex":0.000036268626,"about_ca_topic_score_gemma":0.000008638365,"teacher_disagreement_score":0.018609654,"about_ca_system_score_codex":0.00097585394,"about_ca_system_score_gemma":0.003035189,"threshold_uncertainty_score":0.9999187},"labels":[],"label_agreement":null},{"id":"W1645694748","doi":"10.37236/3226","title":"Direct Bijective Computation of the Generating Series for 2 and 3-Connection Coefficients of the Symmetric Group","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"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":"Bijection; Mathematics; Connection (principal bundle); Series (stratigraphy); Symmetric group; Computation; Combinatorics; Group (periodic table); Algebraic number; Interpretation (philosophy); Tree (set theory); Basis (linear algebra); Discrete mathematics; Pure mathematics; Algebra over a field; Computer science; Algorithm","score_opus":0.020119333412644005,"score_gpt":0.28107491002093665,"score_spread":0.26095557660829266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1645694748","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.8880349,0.001981109,0.10506489,0.00018408342,0.0030133042,0.0016054903,0.0000106281705,0.000015996211,0.000089622],"genre_scores_gemma":[0.99885553,0.00023867968,0.00062831084,0.000008879468,0.00012758374,0.000030825388,9.221556e-7,0.00005278839,0.000056492663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712646,0.0004776461,0.0011303663,0.00018621107,0.0007158379,0.00036346522],"domain_scores_gemma":[0.9922893,0.0018714031,0.00406268,0.0005172741,0.0012233267,0.00003600684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017208359,0.0003114291,0.00078790094,0.00016511798,0.0002925329,0.000046096346,0.0008804232,0.0001870885,9.089571e-7],"category_scores_gemma":[0.002780431,0.00016748595,0.00036550898,0.0007613214,0.00019910275,0.00012105343,0.00050656265,0.0010593394,1.3422134e-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.000068545814,0.0003137596,0.00010403757,0.000737121,0.00038151958,1.2575325e-7,0.0013896344,0.0032295687,0.0007007295,0.9924395,0.00012602382,0.0005094455],"study_design_scores_gemma":[0.0008578441,0.0005155368,0.000160892,0.0004174308,0.00044820178,0.000038164493,0.0002892032,0.004156123,0.0097893905,0.9831333,0.000036607784,0.00015730163],"about_ca_topic_score_codex":0.000010264323,"about_ca_topic_score_gemma":0.000008678792,"teacher_disagreement_score":0.11082064,"about_ca_system_score_codex":0.00049257436,"about_ca_system_score_gemma":0.00040183624,"threshold_uncertainty_score":0.68298787},"labels":[],"label_agreement":null},{"id":"W1651530065","doi":"10.37236/1776","title":"Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Group (periodic table); Combinatorics; Class (philosophy); Block (permutation group theory); Resolution (logic); Block size; Discrete mathematics; Computer science","score_opus":0.008638205555097384,"score_gpt":0.1994477517754778,"score_spread":0.1908095462203804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651530065","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.8575116,0.031937964,0.094824836,0.00034009438,0.0033239129,0.00066200545,0.00000791327,0.00037301437,0.011018674],"genre_scores_gemma":[0.99796534,0.0012587551,0.00007145994,0.00005452876,0.00024061992,0.0000103577295,0.0000038228522,0.00009356083,0.0003015659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967769,0.00016015898,0.0008321197,0.0002041076,0.0007208299,0.0013059133],"domain_scores_gemma":[0.9984943,0.00019963615,0.0003411706,0.0006051642,0.00015923486,0.00020047718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020839074,0.00040849586,0.0005817723,0.00030112677,0.0004294064,0.00017740292,0.001178565,0.000206351,0.00003404225],"category_scores_gemma":[0.00005198046,0.0002999202,0.00030315528,0.0009817198,0.000106782616,0.0005787465,0.00007579937,0.0015292055,0.000023780061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009486835,0.00010391813,0.00013836565,0.00007103876,0.0002647677,0.000024875153,0.00036074567,0.022398118,0.0042935386,0.97107404,0.0009908902,0.00018483952],"study_design_scores_gemma":[0.0019718835,0.0011242068,0.00034589597,0.000115312585,0.00011423941,0.00034647033,0.00031279374,0.0004041568,0.0058972347,0.9737345,0.015252349,0.00038095767],"about_ca_topic_score_codex":0.000034519904,"about_ca_topic_score_gemma":0.00003737345,"teacher_disagreement_score":0.14045374,"about_ca_system_score_codex":0.00075827126,"about_ca_system_score_gemma":0.00018609589,"threshold_uncertainty_score":0.9999453},"labels":[],"label_agreement":null},{"id":"W1671837433","doi":"10.37236/789","title":"Derangements and Euler's difference table for $C_\\ell\\wr S_n$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Universitaire de la Francophonie","keywords":"Mathematics; Euler's formula; Combinatorics; Derangement; Sequence (biology); Table (database); Mathematical analysis","score_opus":0.03926295927043639,"score_gpt":0.2936949650589238,"score_spread":0.2544320057884874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1671837433","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.8174021,0.004163632,0.17508681,0.000608286,0.0013849499,0.0007166859,0.0000037407028,0.00005366412,0.0005801009],"genre_scores_gemma":[0.9963719,0.0011247072,0.0010962847,0.000046909765,0.00017700823,0.000019368756,5.463859e-7,0.000056720404,0.0011065439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782634,0.00009763139,0.0006738031,0.0001588391,0.0005407369,0.00070264755],"domain_scores_gemma":[0.99672085,0.0015621408,0.0007605187,0.00038066175,0.00045848527,0.00011732294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009826415,0.00026246475,0.00055334467,0.000094219395,0.00037780683,0.000035247063,0.0006111949,0.0000955997,0.000008404408],"category_scores_gemma":[0.0010070228,0.00018470827,0.00013159546,0.00029290744,0.000119838616,0.00018138984,0.000099300654,0.0005959473,0.0000023607809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094167764,0.00028617916,0.0001072274,0.00008319545,0.00014849417,0.000007447908,0.0006276493,0.0000074828217,0.0003542144,0.9961965,0.0017935507,0.00029388335],"study_design_scores_gemma":[0.0021909513,0.0007663145,0.00006358465,0.000060958264,0.00014271664,0.00037187268,0.00010145027,0.00020494244,0.0018949847,0.9903512,0.0036510706,0.00019998013],"about_ca_topic_score_codex":0.0000013873392,"about_ca_topic_score_gemma":0.000001864435,"teacher_disagreement_score":0.17896977,"about_ca_system_score_codex":0.00029282653,"about_ca_system_score_gemma":0.00031920586,"threshold_uncertainty_score":0.75321853},"labels":[],"label_agreement":null},{"id":"W1677629278","doi":"10.37236/369","title":"The Ladder Crystal","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","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":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Lambda; Crystal (programming language); Combinatorics; Isomorphism (crystallography); Regularization (linguistics); Crystal structure; Crystallography; Physics; Computer science; Chemistry; Quantum mechanics","score_opus":0.009076421127972769,"score_gpt":0.26432919067363186,"score_spread":0.2552527695456591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1677629278","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.9870561,0.0013890625,0.0019056798,0.0025487104,0.0050137797,0.00017422179,3.6597694e-7,0.000026297199,0.0018858194],"genre_scores_gemma":[0.99852455,0.00021150184,0.000016168711,0.00005680908,0.0005461127,0.000003008215,1.0125565e-7,0.000029131927,0.00061261194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812335,0.00011791202,0.00048051687,0.000089468376,0.0006006462,0.0005881069],"domain_scores_gemma":[0.99749845,0.0010891965,0.00051727385,0.0004818235,0.00033197284,0.00008127482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017653204,0.0001686347,0.00024261275,0.000037791015,0.00040552064,0.00010334898,0.0010873071,0.0001058795,0.00003239093],"category_scores_gemma":[0.00060701265,0.0000811169,0.00020838276,0.0002337256,0.00014335586,0.00010627705,0.000085660766,0.001827967,0.0000037583422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004320211,0.00004410201,0.000028155737,0.0000031385362,0.00009598643,0.0000022781721,0.00020176987,0.0000013930843,0.0002937501,0.99672604,0.002219288,0.00034087306],"study_design_scores_gemma":[0.00060273707,0.00022347734,0.000051129213,0.00000535431,0.000069466674,0.0002494642,0.00013717443,0.000022057746,0.00061833597,0.96492004,0.032999255,0.00010149666],"about_ca_topic_score_codex":0.000003354037,"about_ca_topic_score_gemma":0.000016870188,"teacher_disagreement_score":0.03180601,"about_ca_system_score_codex":0.000093591145,"about_ca_system_score_gemma":0.00045184503,"threshold_uncertainty_score":0.79417086},"labels":[],"label_agreement":null},{"id":"W1691710745","doi":"10.37236/745","title":"Coefficients of Functional Compositions Often Grow Smoothly","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"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":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Limit (mathematics); Exponential function; Combinatorics; Function (biology); Series (stratigraphy); Power series; Surface (topology); Settling; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Thermodynamics; Physics","score_opus":0.0400556478029029,"score_gpt":0.2778869474307531,"score_spread":0.2378312996278502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1691710745","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.7066098,0.0013378381,0.28733683,0.00074995187,0.0017063939,0.0003626799,0.000005672868,0.000052729974,0.0018381146],"genre_scores_gemma":[0.9988898,0.0001869334,0.0003719932,0.000040933133,0.00012821592,0.000004127554,0.0000012722742,0.000039933966,0.00033681284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735653,0.00016089593,0.0009343743,0.00011367713,0.0009507969,0.00048372883],"domain_scores_gemma":[0.9963876,0.0011108188,0.0011539321,0.00041997776,0.00083743484,0.00009023721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009389804,0.00021056464,0.0005349816,0.00016089082,0.0002713669,0.000010602409,0.0006421312,0.00009038603,0.000025531643],"category_scores_gemma":[0.00056314,0.00015270263,0.0002600611,0.00058926956,0.00022310135,0.0001672258,0.000082946295,0.00075675215,0.0000075070925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008850754,0.000791014,0.00006985855,0.000035611643,0.00015735422,0.000009878547,0.00038219965,0.0002233998,0.000777492,0.99498916,0.002436814,0.000038730555],"study_design_scores_gemma":[0.0015350565,0.00066314224,0.0001308674,0.000059615395,0.00014037805,0.0007043746,0.00010535973,0.00014996596,0.002761612,0.9924635,0.0011405363,0.00014554823],"about_ca_topic_score_codex":0.0000015072911,"about_ca_topic_score_gemma":5.8196144e-7,"teacher_disagreement_score":0.29228,"about_ca_system_score_codex":0.00036277244,"about_ca_system_score_gemma":0.00052947353,"threshold_uncertainty_score":0.62270325},"labels":[],"label_agreement":null},{"id":"W1712117507","doi":"10.37236/3053","title":"Nested Recursions, Simultaneous Parameters and Tree Superpositions","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Arity; Recursion (computer science); Tree (set theory); Sequence (biology); Combinatorics; Natural number; Mathematics; Order (exchange); Discrete mathematics; Algorithm","score_opus":0.008347747079386849,"score_gpt":0.23257732825101787,"score_spread":0.22422958117163103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712117507","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.09338638,0.011062342,0.8895824,0.0035132673,0.0019427999,0.00029259027,0.0000056202034,0.000062024454,0.00015256368],"genre_scores_gemma":[0.9936128,0.004157962,0.0018626681,0.00015353803,0.00011139702,0.000004461754,0.0000061166575,0.000018873045,0.000072174626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977455,0.0003685055,0.0005449999,0.00028931274,0.0005404838,0.00051116926],"domain_scores_gemma":[0.99701476,0.00092997623,0.00066603324,0.0009077041,0.000327089,0.00015442449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087657134,0.00027655627,0.0004610752,0.00016878125,0.00027938728,0.0002932329,0.0021783758,0.00019745617,0.0000015833842],"category_scores_gemma":[0.0002089528,0.0001840689,0.00016691057,0.00025459926,0.00008739019,0.00022937453,0.0010975052,0.0019673195,0.000003384788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008136236,0.00039792023,0.00006203543,0.000074593736,0.0003487329,0.00010903022,0.0009519779,0.007739943,0.00013597417,0.9264471,0.0040609716,0.059590366],"study_design_scores_gemma":[0.00066959945,0.0007998717,0.00009040669,0.00024564698,0.00013460428,0.00081954605,0.000036262983,0.12933227,0.00017976777,0.8609818,0.00638059,0.00032963618],"about_ca_topic_score_codex":0.000017794244,"about_ca_topic_score_gemma":0.0000031614816,"teacher_disagreement_score":0.9002264,"about_ca_system_score_codex":0.00024136768,"about_ca_system_score_gemma":0.0005831475,"threshold_uncertainty_score":0.8547134},"labels":[],"label_agreement":null},{"id":"W1735124671","doi":"10.37236/2345","title":"The 1/3-2/3 Conjecture for $N$-Free Ordered Sets","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Interval (graph theory); Ordered set; Partially ordered set; Set (abstract data type); Total order; Finite set; Discrete mathematics; Mathematical analysis","score_opus":0.004945317641066587,"score_gpt":0.20236732236204444,"score_spread":0.19742200472097785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1735124671","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.8135847,0.13597135,0.034072183,0.0021309864,0.010013364,0.0008327286,0.000008880667,0.00014505415,0.0032407406],"genre_scores_gemma":[0.9989196,0.00060915353,0.000004228333,0.000024798806,0.0002489618,0.000009389024,4.4532993e-7,0.000029060238,0.00015433274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987077,0.000096953336,0.0003035273,0.000037430535,0.00020466675,0.00064972835],"domain_scores_gemma":[0.99888635,0.00048282745,0.00014351934,0.00032033343,0.0000977838,0.00006916555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018725822,0.00013256304,0.00018388766,0.000036663565,0.0002468272,0.000038357695,0.00069217494,0.00006833021,0.0000038083065],"category_scores_gemma":[0.000112719805,0.0000699025,0.00015278831,0.00019044911,0.000041852574,0.000117262825,0.000021289721,0.0005189661,0.000003664284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004338065,0.000024095836,0.0000775059,0.000019762034,0.0002046494,4.1368688e-7,0.00040211566,0.00031133168,0.00023575664,0.9901583,0.0077517563,0.00077093556],"study_design_scores_gemma":[0.0010221595,0.00023318313,0.0001134209,0.000015830867,0.00008022685,0.0002402293,0.00029758623,0.00033603687,0.0017934986,0.8398713,0.15586647,0.00013004606],"about_ca_topic_score_codex":5.8364515e-7,"about_ca_topic_score_gemma":0.0000030491094,"teacher_disagreement_score":0.18533492,"about_ca_system_score_codex":0.0001316211,"about_ca_system_score_gemma":0.00006697991,"threshold_uncertainty_score":0.2850541},"labels":[],"label_agreement":null},{"id":"W1736115221","doi":"10.37236/2552","title":"Balanced Vertex Decomposable Simplicial Complexes and their h-vectors","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":3,"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":"Simplicial complex; Betti number; Abstract simplicial complex; Combinatorics; Corollary; h-vector; Mathematics; Vertex (graph theory); Conjecture; Simplicial manifold; Simplicial approximation theorem; Simplicial homology; Flag (linear algebra); Simplicial set; Pure mathematics; Algebra over a field; Graph; Homotopy","score_opus":0.024758855952427463,"score_gpt":0.2960239477387935,"score_spread":0.27126509178636604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1736115221","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.9780807,0.0045742877,0.013701799,0.0017185303,0.00044003638,0.0005620934,0.000010815435,0.00003895821,0.0008727648],"genre_scores_gemma":[0.99834,0.001140245,0.000090542504,0.000077376026,0.00014359455,0.000024700177,0.0000045594725,0.000050746814,0.00012825191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979714,0.00024857445,0.00072214653,0.00019805542,0.0003061897,0.0005536141],"domain_scores_gemma":[0.9962763,0.0015162802,0.001047353,0.00059270556,0.00045705258,0.00011029661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000884449,0.0003683406,0.00076680764,0.00012134723,0.00027284198,0.000133582,0.0010466396,0.00017349083,0.00004936207],"category_scores_gemma":[0.00020629882,0.00023081776,0.00023246786,0.00020906086,0.00015087133,0.00009555548,0.0005292929,0.0019620347,0.0000074626687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002534109,0.0001616599,0.000143531,0.000062329076,0.00034169108,6.4997624e-7,0.0008498726,0.000014895088,0.00053515093,0.99184227,0.005413568,0.0006090536],"study_design_scores_gemma":[0.0005425896,0.00024101992,0.00056404993,0.00008094383,0.00013891175,0.00008053019,0.00023479982,0.0005179879,0.001042487,0.99361,0.0027095887,0.0002370936],"about_ca_topic_score_codex":0.000026035092,"about_ca_topic_score_gemma":0.000019434592,"teacher_disagreement_score":0.020259269,"about_ca_system_score_codex":0.00033464876,"about_ca_system_score_gemma":0.00052990334,"threshold_uncertainty_score":0.9412475},"labels":[],"label_agreement":null},{"id":"W1737347830","doi":"10.37236/1785","title":"Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"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; Class (philosophy); Virial expansion; Enumeration; Cluster (spacecraft); Homogeneous space; Cluster expansion; Imperfect; Discrete mathematics; Virial coefficient; Computer science; Physics; Geometry; Quantum mechanics","score_opus":0.01686202179759467,"score_gpt":0.2683087266909238,"score_spread":0.25144670489332915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1737347830","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.92415166,0.0029062424,0.068551816,0.0019982953,0.00016007911,0.00046434454,0.000006581009,0.000024321187,0.00173667],"genre_scores_gemma":[0.9991796,0.00026197833,0.00007618024,0.00008239797,0.000028675282,0.000011646783,9.816292e-7,0.000022698903,0.00033582546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841446,0.00027574121,0.0005903737,0.000089181056,0.0002952921,0.00033495828],"domain_scores_gemma":[0.9980618,0.00056916324,0.00074323843,0.00029486473,0.00027730345,0.000053650925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022009243,0.00015601322,0.00033085738,0.000082203536,0.00012674723,0.000017838569,0.0005618539,0.00007477395,0.00001843445],"category_scores_gemma":[0.00021648333,0.00009748491,0.00017825108,0.00037171275,0.00015259194,0.00012723311,0.000039513896,0.00066764024,0.0000041078697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006509337,0.00035918909,0.000010657123,0.000020147663,0.00016051474,4.6019665e-7,0.0014604309,0.00003877362,0.0020143,0.99509037,0.0005658396,0.00021421855],"study_design_scores_gemma":[0.0011129248,0.0004907324,0.000007929389,0.00006556352,0.0001093608,0.00005748956,0.00044267427,0.0000038332687,0.024538955,0.97177416,0.0012990905,0.00009730332],"about_ca_topic_score_codex":0.0000026048415,"about_ca_topic_score_gemma":0.0000025803886,"teacher_disagreement_score":0.075027965,"about_ca_system_score_codex":0.00017476412,"about_ca_system_score_gemma":0.00025877162,"threshold_uncertainty_score":0.39753193},"labels":[],"label_agreement":null},{"id":"W1747715124","doi":"10.37236/1914","title":"Splitting Numbers of Grids","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"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 Calgary","funders":"","keywords":"Antichain; Combinatorics; Mathematics; Partially ordered set; Crystallography; Chemistry","score_opus":0.004558685025001118,"score_gpt":0.20918134240293912,"score_spread":0.204622657377938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747715124","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.87083983,0.010187258,0.108523875,0.006719303,0.0010149701,0.00010639464,2.1383785e-7,0.000051174076,0.002556954],"genre_scores_gemma":[0.99873245,0.0002814605,0.00067736476,0.00012858158,0.000025084051,3.7437025e-7,5.611432e-8,0.000006539941,0.00014810037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985403,0.000092060596,0.00047656655,0.000088720204,0.00042860763,0.00037376184],"domain_scores_gemma":[0.9986635,0.00015196174,0.000510314,0.00032481246,0.00028950835,0.000059933398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018555067,0.00009316758,0.0001973038,0.00010035958,0.000093533716,0.000032209093,0.0010332498,0.000038585953,0.0000033668705],"category_scores_gemma":[0.00007107619,0.00006144752,0.00012640795,0.0005309681,0.000049935923,0.00024601107,0.00008838775,0.00046460805,0.000005881386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060683615,0.00007387033,0.0001395823,0.0000041770136,0.000034259898,0.0000013757402,0.00031384148,0.000448821,0.0007471924,0.9944074,0.00050170545,0.0033217203],"study_design_scores_gemma":[0.00067230844,0.00037807136,0.000085120395,0.00003343687,0.000023780209,0.00019533113,0.00004208006,0.0026324904,0.008727594,0.9824697,0.0046448214,0.00009529346],"about_ca_topic_score_codex":0.000005365503,"about_ca_topic_score_gemma":0.0000012057912,"teacher_disagreement_score":0.12789258,"about_ca_system_score_codex":0.00009613394,"about_ca_system_score_gemma":0.0003068613,"threshold_uncertainty_score":0.25057572},"labels":[],"label_agreement":null},{"id":"W1762497644","doi":"10.37236/4373","title":"On Obstacle Numbers","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Obstacle; Upper and lower bounds; Combinatorics; Omega; Mathematics; Graph; Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.033886102808367485,"score_gpt":0.3135568381593907,"score_spread":0.27967073535102327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762497644","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.9632647,0.0043345564,0.0024161772,0.0008418179,0.0061840294,0.00038200518,0.000005839421,0.0000529313,0.02251791],"genre_scores_gemma":[0.9980663,0.0004858671,0.00003751339,0.00012487112,0.00032631643,0.0000032142705,0.0000011040996,0.00006081382,0.0008940149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720865,0.0003822187,0.00070123875,0.00017571589,0.0009257835,0.0006063667],"domain_scores_gemma":[0.9963324,0.00097372464,0.0011994059,0.0008270926,0.0005387598,0.00012863238],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0030814738,0.00034595208,0.00065084704,0.00015193409,0.000195935,0.00005980795,0.0015311863,0.00030474886,0.000028722465],"category_scores_gemma":[0.00094276795,0.0002085685,0.0004157413,0.0001869516,0.000120519464,0.00005147843,0.0004616497,0.003809912,0.0000048818706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012825616,0.00011871393,0.000015987745,0.000046754034,0.00033006503,0.000014053009,0.0011643474,0.000116807976,0.0000019961692,0.98231053,0.015566224,0.00018624245],"study_design_scores_gemma":[0.0006804303,0.00047582257,0.000010154124,0.00011519383,0.00023082356,0.0001769105,0.00013399191,0.000028929497,0.00012436,0.99471235,0.003088419,0.0002226358],"about_ca_topic_score_codex":0.000003362742,"about_ca_topic_score_gemma":0.0000019779022,"teacher_disagreement_score":0.03480155,"about_ca_system_score_codex":0.0007960234,"about_ca_system_score_gemma":0.0009580266,"threshold_uncertainty_score":0.99848837},"labels":[],"label_agreement":null},{"id":"W1764008429","doi":"10.37236/161","title":"Counting Abelian Squares","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"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 Waterloo","funders":"","keywords":"Mathematics; Abelian group; Combinatorics; Permutation (music); Concatenation (mathematics); Discrete mathematics; String (physics)","score_opus":0.005164885710695032,"score_gpt":0.22530736828466943,"score_spread":0.2201424825739744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764008429","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.049712326,0.008017497,0.93398356,0.005858945,0.00094957993,0.00008771118,3.7876146e-7,0.000054856802,0.001335125],"genre_scores_gemma":[0.99871093,0.00041867158,0.000354957,0.0003053957,0.00012491099,2.6154024e-7,2.402068e-7,0.000004421849,0.0000802275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861956,0.000073132884,0.00030717652,0.000101367805,0.00046961874,0.00042913784],"domain_scores_gemma":[0.99891543,0.00009696269,0.00033908905,0.00038210917,0.00020516611,0.000061260354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010363372,0.00010470307,0.0001641792,0.00008065792,0.00020037095,0.00014591508,0.0016181224,0.00003709589,0.0000031639443],"category_scores_gemma":[0.00004968691,0.00006395208,0.00008057549,0.0004153573,0.000019476718,0.0005584849,0.00008852357,0.00052914803,0.0000071507648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007104604,0.00007107596,0.00003904235,0.0000013861195,0.000013078558,0.000010098409,0.00014154657,0.000052176754,0.00024363073,0.9813357,0.0020412195,0.016043944],"study_design_scores_gemma":[0.0004974971,0.00077628,0.0009576939,0.000031379266,0.000013071277,0.0002623958,0.000027117447,0.0061695413,0.0008033909,0.96778,0.022560706,0.00012091361],"about_ca_topic_score_codex":0.0000034370257,"about_ca_topic_score_gemma":4.4353814e-7,"teacher_disagreement_score":0.9489986,"about_ca_system_score_codex":0.0001259581,"about_ca_system_score_gemma":0.00027649035,"threshold_uncertainty_score":0.3006901},"labels":[],"label_agreement":null},{"id":"W1766429383","doi":"10.37236/5095","title":"Graphs with Induced-Saturation Number Zero","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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":"National Science Foundation","keywords":"Combinatorics; Mathematics; Saturation (graph theory); Vertex (graph theory); Induced subgraph; Graph; Discrete mathematics","score_opus":0.01403695763189795,"score_gpt":0.2792874026438186,"score_spread":0.2652504450119207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766429383","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.10994492,0.0016501172,0.8814927,0.0037289977,0.0012494918,0.00036892015,0.000001236191,0.00006278025,0.0015008433],"genre_scores_gemma":[0.9985829,0.0006117689,0.00025124685,0.00006497937,0.000102908016,0.000011472974,6.727278e-7,0.000035005174,0.00033901713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645627,0.0005020347,0.00054645416,0.00033672363,0.0012729623,0.0008855646],"domain_scores_gemma":[0.99616563,0.00042582737,0.0010887843,0.0012057096,0.00097147474,0.00014256977],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002265814,0.0003410827,0.00046319567,0.00026276175,0.0002130919,0.00022113541,0.003802266,0.00021471753,0.0000065149966],"category_scores_gemma":[0.00011547342,0.00018119569,0.0002285983,0.0007659743,0.00013549061,0.00057273137,0.00079586596,0.003339744,0.000017697901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008908159,0.000069769405,0.00013522853,0.000015237798,0.00017667803,0.000022909922,0.00019770484,0.000058234644,0.0002636957,0.9964076,0.00028414314,0.0022797177],"study_design_scores_gemma":[0.00068967947,0.00055322057,0.00012654679,0.00014007595,0.00003415034,0.00044969376,0.0000120309205,0.0001106592,0.002294299,0.99444765,0.0008948353,0.00024718227],"about_ca_topic_score_codex":0.0000026477787,"about_ca_topic_score_gemma":0.0000023577647,"teacher_disagreement_score":0.888638,"about_ca_system_score_codex":0.00060343504,"about_ca_system_score_gemma":0.001844402,"threshold_uncertainty_score":0.9989596},"labels":[],"label_agreement":null},{"id":"W1767752187","doi":"10.37236/4642","title":"Power of $k$ Choices and Rainbow Spanning Trees in Random Graphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Spanning tree; Random graph; Graph; Tree (set theory); Discrete mathematics; Physics","score_opus":0.01874576018923169,"score_gpt":0.27745429318003983,"score_spread":0.25870853299080815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767752187","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.98942965,0.00819038,0.00038035028,0.00015580711,0.0002945961,0.00009781468,4.0849812e-7,0.0000057786856,0.0014452337],"genre_scores_gemma":[0.99934334,0.00046452568,0.000047987505,0.000022828697,0.000027750879,8.7854824e-7,7.798552e-8,0.000014483897,0.00007811664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985603,0.0002228632,0.00048259913,0.000071994844,0.00035470145,0.0003075043],"domain_scores_gemma":[0.9983555,0.0007142068,0.0005026045,0.00018653963,0.00017578498,0.000065334956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028234068,0.00012768566,0.00040248586,0.0001869138,0.00006431182,0.000016356762,0.00035152843,0.00006540546,0.0000051041],"category_scores_gemma":[0.0005914922,0.00007586009,0.00010362882,0.00029683489,0.00013139268,0.0001180673,0.000062828294,0.0005277033,1.01690304e-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.00028477985,0.00006429903,0.0024898986,0.000012178591,0.00008813168,0.0000049601376,0.0037218907,0.000016645585,0.00007532673,0.99295944,0.00014519297,0.00013725016],"study_design_scores_gemma":[0.003473048,0.00044889582,0.00086666114,0.000050819195,0.00005018363,0.00010718191,0.0008541296,0.000020605676,0.0004679231,0.9930048,0.0005723065,0.000083452265],"about_ca_topic_score_codex":0.000005001034,"about_ca_topic_score_gemma":0.0000069440844,"teacher_disagreement_score":0.00991372,"about_ca_system_score_codex":0.00006719494,"about_ca_system_score_gemma":0.0001811244,"threshold_uncertainty_score":0.30934846},"labels":[],"label_agreement":null},{"id":"W1787172169","doi":"10.37236/2742","title":"Integral Cayley Multigraphs over Abelian and Hamiltonian Groups","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"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; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Mathematics; Abelian group; Multigraph; Cayley graph; Combinatorics; Converse; Cayley's theorem; Cayley transform; Hamiltonian (control theory); Character (mathematics); Discrete mathematics; Pure mathematics; Algebra over a field; Graph; Voltage graph; Line graph","score_opus":0.008445332578899789,"score_gpt":0.24754603429603086,"score_spread":0.23910070171713108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1787172169","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.99443084,0.0028868609,0.0007267734,0.0004748732,0.0005195239,0.00018887906,8.1274624e-7,0.000020165637,0.00075129885],"genre_scores_gemma":[0.99857026,0.00077033776,0.00011932378,0.00014885725,0.00010172829,0.0000038199673,2.179201e-7,0.000029155322,0.00025629072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983319,0.00016809719,0.00046766744,0.000118851436,0.00036776945,0.00054572365],"domain_scores_gemma":[0.9984816,0.00045573758,0.00040092596,0.00032846592,0.00021475783,0.00011854902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009782431,0.00021221173,0.00034297555,0.0001480158,0.00028307716,0.000070988295,0.0005253077,0.00010679382,0.000052262643],"category_scores_gemma":[0.00021972897,0.00012022487,0.0001717627,0.0002602538,0.00018662045,0.00021567477,0.00009804484,0.0010227447,0.0000026511816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024202098,0.000058792193,0.0013040894,0.000016712602,0.00014358648,0.0000036136955,0.0012282828,6.065067e-7,0.00021376008,0.994704,0.0011705623,0.0011317715],"study_design_scores_gemma":[0.00084981724,0.00034441546,0.0052827294,0.000032080217,0.000082958046,0.00022777927,0.00035303034,0.000079371086,0.00025413578,0.9911866,0.0011570613,0.00014999825],"about_ca_topic_score_codex":0.00003335365,"about_ca_topic_score_gemma":0.00001670592,"teacher_disagreement_score":0.004139457,"about_ca_system_score_codex":0.000112695445,"about_ca_system_score_gemma":0.00009385112,"threshold_uncertainty_score":0.49026278},"labels":[],"label_agreement":null},{"id":"W1798981749","doi":"10.37236/999","title":"On the Quantum Chromatic Number of a Graph","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of Bristol","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Critical graph; Windmill graph; Friendship graph; Graph; Clique number; Quantum; Brooks' theorem; Graph power; Line graph; Quantum mechanics; Physics","score_opus":0.008306689640085747,"score_gpt":0.23958491300243911,"score_spread":0.23127822336235337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798981749","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.9095691,0.0014054046,0.084789366,0.0025444492,0.0006063349,0.0000965058,1.0548036e-7,0.000020250263,0.00096850167],"genre_scores_gemma":[0.99948514,0.00013738222,0.000061413455,0.00025013858,0.000008492238,6.1070506e-7,4.240193e-8,0.0000075209055,0.000049254857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822783,0.00014156074,0.000495997,0.00008926017,0.0006106902,0.0004346424],"domain_scores_gemma":[0.9978218,0.00082959974,0.0005523761,0.00047935676,0.0002602292,0.000056640492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004197172,0.00011373876,0.00020224742,0.000105910556,0.00015012326,0.00003480129,0.0012697042,0.000041967676,0.0000069577823],"category_scores_gemma":[0.00014522288,0.00005611205,0.0001576924,0.00087146455,0.00008845272,0.000103961764,0.000066803615,0.00058431784,0.000012116885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014853634,0.000118248994,0.00006357295,0.0000047164676,0.000047236088,0.0000040821947,0.00028615206,0.0000372082,0.00039533924,0.99813175,0.00069734774,0.00019950721],"study_design_scores_gemma":[0.00037908248,0.0004605622,0.00016817843,0.000045650904,0.000019277755,0.00018801795,0.000046432167,0.0006698661,0.003135105,0.9946373,0.00018402188,0.000066506356],"about_ca_topic_score_codex":0.0000062796553,"about_ca_topic_score_gemma":0.0000012079178,"teacher_disagreement_score":0.089916065,"about_ca_system_score_codex":0.00006609964,"about_ca_system_score_gemma":0.00021151912,"threshold_uncertainty_score":0.25386027},"labels":[],"label_agreement":null},{"id":"W1801749230","doi":"10.37236/2497","title":"Recognition and Characterization of Chronological Interval Digraphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Simon Fraser University; University of Victoria","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Interval (graph theory); Characterization (materials science); Interval graph; Vertex (graph theory); Discrete mathematics; Time complexity; Graph; Class (philosophy); Pathwidth; Line graph; Computer science; Artificial intelligence","score_opus":0.01725302464268015,"score_gpt":0.24430010431113044,"score_spread":0.22704707966845028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801749230","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.8224703,0.0004273975,0.1762236,0.00061376026,0.000101742444,0.00009818585,2.7179985e-7,0.000009200681,0.000055502074],"genre_scores_gemma":[0.9990104,0.0008232328,0.00008257459,0.000031257714,0.000020010706,0.0000032365838,6.463028e-7,0.000004540174,0.000024135888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998941,0.00017780071,0.0002817654,0.00008562132,0.00024500297,0.00026879742],"domain_scores_gemma":[0.99906856,0.00014609376,0.00031079477,0.00017678809,0.00025001768,0.00004775843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072092004,0.00007479318,0.00015882571,0.00012848126,0.000058437778,0.000045722303,0.0006104761,0.000039895665,0.000009359585],"category_scores_gemma":[0.00007335802,0.000047748752,0.00005663415,0.00039501378,0.00010847364,0.00058406836,0.00011000909,0.00040365467,0.0000056861513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047382015,0.00016448965,0.0005181091,0.000014561232,0.00007114604,0.00000260805,0.00045363145,0.0000017282089,0.055979155,0.8640396,0.000023176004,0.07868443],"study_design_scores_gemma":[0.00036372917,0.00091367273,0.0046258187,0.000019583396,0.0000070240826,0.00010887678,0.000026805797,0.00050823827,0.011041908,0.98217946,0.0001449812,0.000059905447],"about_ca_topic_score_codex":0.0000017654769,"about_ca_topic_score_gemma":2.4930344e-7,"teacher_disagreement_score":0.17654003,"about_ca_system_score_codex":0.000059479516,"about_ca_system_score_gemma":0.000085721775,"threshold_uncertainty_score":0.19471376},"labels":[],"label_agreement":null},{"id":"W1802444145","doi":"10.37236/2698","title":"Product Dimension of Forests and Bounded Treewidth Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","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":"Dalhousie University","funders":"Microsoft Research","keywords":"Combinatorics; Treewidth; Mathematics; Bounded function; Dimension (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Product (mathematics); Partial k-tree; Chordal graph; Pathwidth; 1-planar graph; Line graph; Geometry","score_opus":0.009660454865182485,"score_gpt":0.22381918689416724,"score_spread":0.21415873202898475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802444145","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.95787454,0.030434957,0.007884265,0.0019053546,0.0014328293,0.0003427214,6.310654e-7,0.00003511464,0.0000895929],"genre_scores_gemma":[0.9966078,0.0027348658,0.00047553718,0.00004757236,0.000016149586,0.0000048374386,8.6017656e-7,0.00001935184,0.000093049486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973381,0.00025147063,0.00081201986,0.00032381536,0.00072741054,0.0005471502],"domain_scores_gemma":[0.99652964,0.00017726776,0.0014474755,0.0009423591,0.000782838,0.000120427474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020314106,0.00029697389,0.0006077669,0.0003262639,0.00014626986,0.0001428503,0.0015428849,0.00014729465,0.0000016079645],"category_scores_gemma":[0.000115842246,0.00018987419,0.00022301417,0.00047935604,0.00017095744,0.0002221949,0.0008204235,0.0015063916,0.0000016613269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000179592,0.00013912353,0.00038750394,0.000066801804,0.00014634198,0.0000036292586,0.00034491663,0.000145486,0.00041350175,0.9962704,0.0005930896,0.0014712375],"study_design_scores_gemma":[0.00061946874,0.00059201923,0.0006085626,0.00017293016,0.00008582542,0.00015638123,0.0000102617205,0.0014372848,0.0028690954,0.9930759,0.00018304246,0.00018919852],"about_ca_topic_score_codex":0.00004473817,"about_ca_topic_score_gemma":0.000006229554,"teacher_disagreement_score":0.038733244,"about_ca_system_score_codex":0.00010593901,"about_ca_system_score_gemma":0.0007963225,"threshold_uncertainty_score":0.7742845},"labels":[],"label_agreement":null},{"id":"W1803081995","doi":"10.37236/215","title":"Counting Fixed-Height Tatami Tilings","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Rectangle; Row; Set (abstract data type); Decomposition; Discrete mathematics; Geometry","score_opus":0.016466940944550527,"score_gpt":0.2959507814855373,"score_spread":0.27948384054098674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803081995","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.80612296,0.006310391,0.16893941,0.004555837,0.0034857802,0.0008198099,0.0000022211766,0.00025404294,0.009509549],"genre_scores_gemma":[0.998005,0.00032703538,0.00064131315,0.00015910882,0.00032567687,0.000001987152,4.1136727e-7,0.000046010835,0.0004934857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698126,0.00014226905,0.0009839371,0.00015554216,0.0008945392,0.00084244175],"domain_scores_gemma":[0.9963711,0.001093631,0.001286864,0.0005488242,0.00059028494,0.00010927863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023528507,0.00029586922,0.000590474,0.00013386914,0.00024605243,0.000072537005,0.0010793703,0.000120207726,0.000018121726],"category_scores_gemma":[0.0014856732,0.00020404081,0.00024127791,0.0005841266,0.000070863935,0.00032546849,0.000062767576,0.001307284,0.000014120237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042955573,0.00026064098,0.0000146626135,0.000023297978,0.00006756096,0.00001441981,0.0004235519,0.000013171999,0.00044986472,0.9963186,0.0017331954,0.000638122],"study_design_scores_gemma":[0.0010619871,0.0007464649,0.000019878144,0.00008657551,0.00014362723,0.00032297033,0.0001730612,0.0001551711,0.003320933,0.9879861,0.005765897,0.00021732613],"about_ca_topic_score_codex":7.0796057e-7,"about_ca_topic_score_gemma":6.960219e-7,"teacher_disagreement_score":0.19188201,"about_ca_system_score_codex":0.0005293555,"about_ca_system_score_gemma":0.00041061983,"threshold_uncertainty_score":0.8320543},"labels":[],"label_agreement":null},{"id":"W1809103853","doi":"10.37236/356","title":"Winning Positions in Simplicial Nim","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"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 Prince Edward Island","funders":"","keywords":"Mathematics; Simplicial complex; Generalization; Combinatorics; Abstract simplicial complex; Simplicial approximation theorem; Face (sociological concept); h-vector; Simplicial manifold; Simplicial homology; Simplicial set; Pure mathematics","score_opus":0.007879893342489633,"score_gpt":0.2623076644510787,"score_spread":0.2544277711085891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809103853","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.74793375,0.00042225348,0.24334824,0.005547077,0.0014947392,0.00008974226,1.4768594e-7,0.000026388525,0.0011376425],"genre_scores_gemma":[0.99939126,0.00005704935,0.00019358659,0.00015173023,0.00015409701,0.0000014956079,6.950629e-8,0.0000075351013,0.000043192464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986157,0.00008276317,0.00040620513,0.00010082824,0.00032694376,0.0004675799],"domain_scores_gemma":[0.9989082,0.0002662829,0.00025301657,0.0003235992,0.00019225114,0.000056602155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295278,0.00009685754,0.00015676346,0.00015640729,0.00013946007,0.0000969403,0.0015380424,0.00006119405,0.000009718811],"category_scores_gemma":[0.00017667441,0.000071194445,0.00008208616,0.00066857715,0.000069051544,0.0004010615,0.0001115305,0.0013862267,0.000015207587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060946527,0.00007741559,0.00053024,7.6895066e-7,0.000009397221,0.000010169743,0.00058918534,0.0001541153,0.0040403795,0.99115807,0.000142178,0.003282014],"study_design_scores_gemma":[0.00012092638,0.0002481711,0.00080044294,0.000010371553,0.0000070849414,0.0002322848,0.00007729517,0.0031110565,0.0104514975,0.9822122,0.0026322461,0.00009644446],"about_ca_topic_score_codex":0.00001903917,"about_ca_topic_score_gemma":0.00006602833,"teacher_disagreement_score":0.25145748,"about_ca_system_score_codex":0.00014091647,"about_ca_system_score_gemma":0.0004571331,"threshold_uncertainty_score":0.6022543},"labels":[],"label_agreement":null},{"id":"W1821109783","doi":"10.37236/3357","title":"A Note on the Acquaintance Time of Random Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Random graph; Graph; Vertex (graph theory); Binary logarithm; Discrete mathematics","score_opus":0.012237505266824057,"score_gpt":0.2604109990754838,"score_spread":0.24817349380865977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1821109783","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.14813979,0.0013859401,0.84283006,0.0049720407,0.00041486113,0.0006331425,0.0000039398547,0.000021078416,0.0015991484],"genre_scores_gemma":[0.99928904,0.00016014646,0.00013219248,0.00015591757,0.000033596585,0.000008001395,1.146267e-7,0.000018576784,0.00020243782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839693,0.00013210058,0.00050391944,0.00007495982,0.0005125302,0.00037954783],"domain_scores_gemma":[0.9944094,0.0042592883,0.0005837247,0.00028724145,0.0004061284,0.00005423954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013410698,0.00014080599,0.00035926068,0.000048939946,0.00010500833,0.000024589313,0.00062931137,0.000053645497,0.000119355755],"category_scores_gemma":[0.0021337173,0.000067283516,0.00014936486,0.00030156155,0.000074386306,0.000057094534,0.00003560994,0.00061383133,0.00003144776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109928464,0.00011365461,6.503242e-7,0.000018405299,0.00006947678,0.0000013498907,0.00021712619,0.000004862495,0.00035811914,0.99718773,0.0013391684,0.000579505],"study_design_scores_gemma":[0.0009773779,0.00079457916,0.0000052819364,0.0000676709,0.00008700573,0.0000487273,0.00007502633,0.0019060432,0.0015391372,0.99429435,0.0001288463,0.0000759429],"about_ca_topic_score_codex":0.0000025948846,"about_ca_topic_score_gemma":5.1891794e-7,"teacher_disagreement_score":0.8511492,"about_ca_system_score_codex":0.000092654205,"about_ca_system_score_gemma":0.00019757758,"threshold_uncertainty_score":0.27437422},"labels":[],"label_agreement":null},{"id":"W1822573676","doi":"10.37236/1064","title":"Tensorial Square of the Hyperoctahedral Group Coinvariant Space","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"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; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Square (algebra); Tensor (intrinsic definition); Space (punctuation); Pure mathematics; Combinatorics; Representation (politics); Decomposition; Representation theory; Group (periodic table); Algebra over a field; Geometry; Computer science","score_opus":0.011582620344119514,"score_gpt":0.2511922943898387,"score_spread":0.23960967404571917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822573676","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.9585089,0.002196177,0.029758036,0.0031266015,0.0026528751,0.00040458562,0.0000034226302,0.000031644726,0.0033177307],"genre_scores_gemma":[0.99831265,0.00008144918,0.00034030256,0.00003077954,0.0005633584,0.000002039257,2.9898533e-7,0.000034389286,0.00063474267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977833,0.00021940014,0.00067722745,0.000104944535,0.0007166551,0.0004984679],"domain_scores_gemma":[0.99743116,0.0006706615,0.0010298426,0.0005182628,0.00031275782,0.00003733505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401701,0.00018552925,0.00038860357,0.000059009406,0.00017001714,0.00002061544,0.00090169196,0.0000976457,0.000014786971],"category_scores_gemma":[0.0004963972,0.000102434504,0.00026435786,0.00040054994,0.00015203659,0.00011360257,0.000110707886,0.00097425515,0.000002126709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005859042,0.00019993896,0.00023348606,0.000022708457,0.000057772428,0.0000046754603,0.00010752883,0.000038546383,0.001076122,0.9968598,0.0012988391,0.000042026455],"study_design_scores_gemma":[0.0011943516,0.00032929468,0.00032959634,0.00004918162,0.000125881,0.00023768486,0.00010616493,0.000022443071,0.0044917497,0.9882504,0.0047499877,0.00011326942],"about_ca_topic_score_codex":0.000011527649,"about_ca_topic_score_gemma":0.000020399117,"teacher_disagreement_score":0.039803714,"about_ca_system_score_codex":0.0003548325,"about_ca_system_score_gemma":0.00036163162,"threshold_uncertainty_score":0.4232708},"labels":[],"label_agreement":null},{"id":"W1828251690","doi":"10.37236/4139","title":"Schubert Polynomials and $k$-Schur Functions","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Schur polynomial; Schur algebra; Mathematics; Schubert calculus; Grassmannian; Schur's theorem; Schubert polynomial; Schur's lemma; Combinatorics; Partially ordered set; Schur product theorem; Pure mathematics; Schur decomposition; Schur complement; Macdonald polynomials; Orthogonal polynomials; Classical orthogonal polynomials; Gegenbauer polynomials","score_opus":0.022776055960704866,"score_gpt":0.29852473724673034,"score_spread":0.2757486812860255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828251690","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.65136904,0.017489355,0.30708447,0.003961541,0.01312394,0.0017326801,0.000015134021,0.00025148693,0.0049723773],"genre_scores_gemma":[0.9959228,0.0013628897,0.00053190376,0.00006539801,0.0008150184,0.000019446468,0.0000017434736,0.00012193589,0.0011588886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615854,0.000443914,0.001412663,0.0003021298,0.00085263315,0.00083009654],"domain_scores_gemma":[0.99346864,0.002092018,0.0024820515,0.0010661377,0.00070217473,0.00018898024],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003397303,0.0005530324,0.001277405,0.00025260996,0.00027805453,0.00013821929,0.0012500408,0.00043463326,0.000015221677],"category_scores_gemma":[0.0022533438,0.00039520004,0.0003816655,0.00027054577,0.00018236622,0.00014644118,0.00075037335,0.003670232,0.00000953303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005996473,0.00020651809,0.000027970318,0.0002371075,0.00039852352,0.0000051055968,0.00028272453,0.00006535028,0.00006461264,0.9939209,0.004369968,0.0003612451],"study_design_scores_gemma":[0.0010349322,0.0004844483,0.000013459179,0.00027539648,0.0006337991,0.00033391104,0.00012559035,0.00018439944,0.0003110594,0.9881516,0.008079614,0.00037177614],"about_ca_topic_score_codex":0.000006047685,"about_ca_topic_score_gemma":0.000004311319,"teacher_disagreement_score":0.34455377,"about_ca_system_score_codex":0.00069356896,"about_ca_system_score_gemma":0.001003997,"threshold_uncertainty_score":0.99985},"labels":[],"label_agreement":null},{"id":"W1828710639","doi":"10.37236/4571","title":"Permutations Generated by a Depth 2 Stack and an Infinite Stack in Series are Algebraic","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"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 British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Generating function; Mathematics; Permutation (music); Bijection; Context (archaeology); Sequence (biology); Algebraic number; Stack (abstract data type); Series (stratigraphy); String (physics); Integer sequence; Simple (philosophy); Function (biology); Discrete mathematics; Physics","score_opus":0.04137858773290495,"score_gpt":0.3223715726196214,"score_spread":0.2809929848867164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828710639","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.9882874,0.0029545156,0.0072301175,0.0006164199,0.00034959032,0.00028533695,0.0000050956883,0.00004006361,0.00023144404],"genre_scores_gemma":[0.99870783,0.0004930998,0.00038176464,0.000047494967,0.00008355379,0.000009076239,0.0000029870696,0.000056776673,0.00021738815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758846,0.000353159,0.00076182856,0.00015696666,0.000571001,0.00056856597],"domain_scores_gemma":[0.99755216,0.0004419621,0.0008250383,0.00037110277,0.0006029335,0.00020679121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015390464,0.00026083013,0.0005173663,0.00016244406,0.00011854233,0.00009081803,0.00046179272,0.00011324117,0.0000044402905],"category_scores_gemma":[0.0011904029,0.00019745706,0.000057860605,0.0006457197,0.00010858931,0.00063617073,0.00007775904,0.00086072553,0.0000027856372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010692363,0.00040064685,0.00047030393,0.00003807939,0.000071853465,0.000018585974,0.0028908397,0.00010061432,0.00024085121,0.99411625,0.0014375419,0.00010749602],"study_design_scores_gemma":[0.0020519395,0.0010168272,0.000061118015,0.000051457122,0.00007347295,0.00021775965,0.0025662296,0.0003324301,0.0008386595,0.9912876,0.0012842593,0.00021828506],"about_ca_topic_score_codex":0.000005145617,"about_ca_topic_score_gemma":0.0000702025,"teacher_disagreement_score":0.010420443,"about_ca_system_score_codex":0.0005192936,"about_ca_system_score_gemma":0.0006009071,"threshold_uncertainty_score":0.80520654},"labels":[],"label_agreement":null},{"id":"W1829221457","doi":"10.37236/214","title":"Perfect Matchings for the Three-Term Gale-Robinson Sequences","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"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 Victoria","funders":"","keywords":"Interpretation (philosophy); Conjecture; Mathematics; Term (time); Combinatorics; Rational function; Mathematical proof; Integer (computer science); Sequence (biology); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.025962522233056458,"score_gpt":0.3125430935161118,"score_spread":0.28658057128305536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829221457","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.4972391,0.011564724,0.47313,0.010957126,0.0032129732,0.0022415905,0.000004388789,0.0001757627,0.0014743161],"genre_scores_gemma":[0.9978709,0.0006914542,0.0005187398,0.00014979769,0.0004066314,0.000016233054,3.6783482e-7,0.000049371807,0.0002964803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731785,0.00013033334,0.00082728703,0.00016819916,0.00073051936,0.0008257956],"domain_scores_gemma":[0.9944738,0.0032157998,0.0011363953,0.0006259467,0.000463036,0.000085021704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028440307,0.00032743625,0.0005699026,0.00008869875,0.0004956115,0.000109930006,0.0015554765,0.00011524607,0.000011409995],"category_scores_gemma":[0.0010428325,0.00017621445,0.00039251134,0.00039192548,0.00011230637,0.00028361627,0.000057569458,0.0010835327,0.000004608613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010618303,0.00019758116,0.000018263652,0.00004046335,0.00013149907,0.000004063713,0.00056941254,0.000039842784,0.0006199592,0.9950951,0.0016300809,0.0015476008],"study_design_scores_gemma":[0.0012109454,0.0014723657,0.00004565645,0.0000890056,0.00030032423,0.00032725793,0.00017729541,0.00041318848,0.0019960385,0.99169415,0.0020598245,0.0002139352],"about_ca_topic_score_codex":0.0000017762584,"about_ca_topic_score_gemma":0.00000472536,"teacher_disagreement_score":0.5006318,"about_ca_system_score_codex":0.0004862758,"about_ca_system_score_gemma":0.0004105305,"threshold_uncertainty_score":0.7185817},"labels":[],"label_agreement":null},{"id":"W1836341359","doi":"10.37236/2475","title":"Recurrence Relations and Splitting Formulas for the Domination Polynomial","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"European Social Fund","keywords":"Mathematics; Combinatorics; Graph; Polynomial; Reduction (mathematics); Recurrence relation; Discrete mathematics; Mathematical analysis","score_opus":0.01530257340099532,"score_gpt":0.28800492155899604,"score_spread":0.2727023481580007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1836341359","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.05011444,0.008816547,0.9368216,0.0032561773,0.0005578571,0.0002587562,4.01052e-7,0.000010226835,0.0001640213],"genre_scores_gemma":[0.99872965,0.0003677979,0.0005653241,0.000033434648,0.0001423561,0.000008325567,1.3472525e-7,0.000006837218,0.00014615181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875885,0.00013201637,0.0002492927,0.00007380047,0.00028479513,0.00050121435],"domain_scores_gemma":[0.99725646,0.0019177155,0.00028704177,0.00024650752,0.00022985917,0.000062395346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003887279,0.00008037292,0.00010777837,0.0000821301,0.0004742397,0.00007156511,0.0008000335,0.000032804768,0.000001087546],"category_scores_gemma":[0.000514367,0.000045771958,0.00006960663,0.0003910238,0.000076884084,0.00077688263,0.0001139725,0.0005085122,0.000001587721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025850968,0.000026560065,0.00027408666,0.0000027324231,0.000022068285,1.061084e-7,0.000576132,0.00003139284,0.000085423984,0.9851201,0.00018257991,0.013652935],"study_design_scores_gemma":[0.0006943279,0.00031052888,0.0013072836,0.000013060501,0.000027792603,0.00013607455,0.00012977667,0.0070834938,0.00093720335,0.97941566,0.00985931,0.00008550094],"about_ca_topic_score_codex":8.7621913e-7,"about_ca_topic_score_gemma":7.525136e-7,"teacher_disagreement_score":0.9486152,"about_ca_system_score_codex":0.00017034466,"about_ca_system_score_gemma":0.00018514272,"threshold_uncertainty_score":0.36475164},"labels":[],"label_agreement":null},{"id":"W1840291388","doi":"10.37236/4745","title":"Uniform Mixing and Association Schemes","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"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 Waterloo","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Mixing (physics); Diagonal; Discrete mathematics; Graph; Quantum mechanics; Geometry; Physics","score_opus":0.007948124513210116,"score_gpt":0.23997232220906423,"score_spread":0.2320241976958541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840291388","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.471703,0.020270552,0.48850638,0.013840806,0.0047010845,0.000241469,0.0000016021211,0.00008313497,0.0006519824],"genre_scores_gemma":[0.99708986,0.0016275931,0.0006747554,0.000062947336,0.00031090196,9.821829e-7,4.3705546e-7,0.000013464667,0.00021907635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981486,0.00014168191,0.0003920756,0.0001988501,0.0006008502,0.00051792274],"domain_scores_gemma":[0.9969051,0.00027884,0.0017864386,0.0006247128,0.00033217535,0.00007271771],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026786502,0.00021419665,0.0003840866,0.00012159687,0.00041959924,0.0005624737,0.0023313935,0.00018834435,5.019044e-7],"category_scores_gemma":[0.00028130988,0.00014575625,0.00016221438,0.00010841737,0.00003711409,0.00017167801,0.0011860608,0.0026759156,0.000001140363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010824148,0.0000833664,0.0006920657,0.00007027683,0.000417717,0.000023189423,0.0011617567,0.0017121695,0.000035712845,0.9630305,0.00068199506,0.032080434],"study_design_scores_gemma":[0.00037442797,0.00019482635,0.0005383307,0.00015082514,0.00005178792,0.00016059523,0.000010544745,0.064939514,0.00020077093,0.9267949,0.006391822,0.00019169529],"about_ca_topic_score_codex":0.00000864444,"about_ca_topic_score_gemma":0.000001618408,"teacher_disagreement_score":0.52538687,"about_ca_system_score_codex":0.00047789305,"about_ca_system_score_gemma":0.0008587677,"threshold_uncertainty_score":0.99962497},"labels":[],"label_agreement":null},{"id":"W1840644905","doi":"10.37236/319","title":"The Cyclic Sieving Phenomenon for Faces of Cyclic Polytopes","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"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":"National Science Council","keywords":"Combinatorics; Mathematics; Polytope; Automorphism group; Automorphism; Convex hull; Regular polygon; Cyclic group; Convex polytope; Dimension (graph theory); Order (exchange); Convex set; Geometry","score_opus":0.016078162267208318,"score_gpt":0.3148507517144157,"score_spread":0.29877258944720736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840644905","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.959257,0.0030883863,0.031102061,0.001674036,0.0028870136,0.00084402075,0.000003218706,0.000044652814,0.0010996183],"genre_scores_gemma":[0.9981035,0.0005058193,0.00062098965,0.000019703897,0.0002927905,0.00001785292,2.7311316e-7,0.000063168576,0.00037590734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726206,0.0001332566,0.0010843298,0.00013336452,0.00063094945,0.000756066],"domain_scores_gemma":[0.9918111,0.0050768377,0.0017957973,0.0006740557,0.0005558418,0.00008634547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030960503,0.00026302852,0.0005926701,0.0000950788,0.00042260642,0.00006540301,0.0014597577,0.0001192942,0.000006040213],"category_scores_gemma":[0.0029219044,0.00014945005,0.00029505562,0.0003778557,0.00020389773,0.0001927534,0.00011471488,0.0011807664,0.0000020761108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077929035,0.00019037735,0.000027368153,0.00006479703,0.00015584177,6.488391e-7,0.0005410524,0.000008266968,0.009144898,0.9884352,0.00026034017,0.0010932698],"study_design_scores_gemma":[0.0010411849,0.0006201889,0.000016771466,0.0000466326,0.00016476223,0.000066263274,0.00047968622,0.00008151338,0.016394313,0.97306687,0.0078626005,0.00015924212],"about_ca_topic_score_codex":0.0000018769465,"about_ca_topic_score_gemma":0.000012711075,"teacher_disagreement_score":0.038846504,"about_ca_system_score_codex":0.00017896661,"about_ca_system_score_gemma":0.00036831986,"threshold_uncertainty_score":0.6094396},"labels":[],"label_agreement":null},{"id":"W1858133485","doi":"10.37236/2299","title":"On the Cartesian Product of Non Well-Covered Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Simons Foundation","keywords":"Cartesian product; Combinatorics; Vertex (graph theory); Mathematics; Cardinality (data modeling); Graph; Product (mathematics); Maximal independent set; Discrete mathematics; Chordal graph; 1-planar graph; Computer science; Geometry; Data mining","score_opus":0.011681149696567873,"score_gpt":0.26048168492128465,"score_spread":0.2488005352247168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858133485","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.7468236,0.0122735845,0.21072558,0.016291818,0.0038078346,0.0039191307,0.0000062100385,0.000086056054,0.006066195],"genre_scores_gemma":[0.99821526,0.0011103367,0.000082413724,0.00009443034,0.00008550084,0.000032614225,6.315499e-7,0.000033350927,0.00034545953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995701,0.00076979864,0.0007878563,0.00037116976,0.0014691219,0.0009010309],"domain_scores_gemma":[0.99420047,0.0009851902,0.0015027453,0.002288022,0.00091336813,0.000110208566],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004031396,0.0003693083,0.00063247286,0.00036292028,0.00021966561,0.00016018398,0.006943045,0.00014143609,0.00001713261],"category_scores_gemma":[0.00035828305,0.0002017757,0.0004526171,0.0009800751,0.00026390044,0.0002413729,0.00103028,0.0041028475,0.000020672705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055403907,0.0001700451,0.000024605497,0.000039019105,0.00020190292,0.0000058182577,0.00036848607,0.0009487722,0.00044071252,0.9954843,0.001296778,0.0009641903],"study_design_scores_gemma":[0.0003884221,0.000860343,0.00013783187,0.00015586824,0.000034546527,0.000065973625,0.000036164798,0.0010561561,0.008597458,0.9878625,0.00061199185,0.00019270781],"about_ca_topic_score_codex":0.000015599557,"about_ca_topic_score_gemma":0.0000019638253,"teacher_disagreement_score":0.25139168,"about_ca_system_score_codex":0.00038161967,"about_ca_system_score_gemma":0.0014264184,"threshold_uncertainty_score":0.9984299},"labels":[],"label_agreement":null},{"id":"W1858499400","doi":"10.37236/1975","title":"Rank–Three Matroids are Rayleigh","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"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","keywords":"Matroid; Mathematics; Combinatorics; Rank (graph theory); Monotonic function; Set (abstract data type); Graphic matroid; Property (philosophy); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.025276663000951327,"score_gpt":0.2897159135556395,"score_spread":0.2644392505546882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858499400","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.9503221,0.0036140434,0.03496797,0.0078266775,0.00024090125,0.00028483232,0.0000027961157,0.00006406058,0.0026766],"genre_scores_gemma":[0.99798733,0.00032682423,0.00023610234,0.0001255686,0.0002738887,0.000008206705,5.8785025e-7,0.0000330795,0.0010084363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982592,0.00013642138,0.0005556085,0.00010781369,0.00041299965,0.00052797096],"domain_scores_gemma":[0.9979386,0.00054733816,0.0006839742,0.00048610175,0.000253122,0.0000909129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017085939,0.00018351035,0.00033610896,0.00010717301,0.00027326265,0.000040495695,0.0007804202,0.00008297437,0.000086646534],"category_scores_gemma":[0.000203511,0.00012429115,0.000248075,0.00042685022,0.00008995585,0.0001473278,0.000048708145,0.0008975557,0.00006110366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004932132,0.00024264735,0.00013906379,0.000011388016,0.00010140168,0.0000012633336,0.00016994083,0.000019580155,0.00030175768,0.9927999,0.005699451,0.00046430246],"study_design_scores_gemma":[0.0008336258,0.00011857244,0.00014304952,0.000025879592,0.00013685891,0.00021388833,0.00007557659,0.000022787144,0.0010144925,0.9349856,0.062299207,0.00013047163],"about_ca_topic_score_codex":9.3996886e-7,"about_ca_topic_score_gemma":0.00002470933,"teacher_disagreement_score":0.057814293,"about_ca_system_score_codex":0.00022241005,"about_ca_system_score_gemma":0.0001809828,"threshold_uncertainty_score":0.50684464},"labels":[],"label_agreement":null},{"id":"W1860548633","doi":"10.37236/2666","title":"A Superlocal Version of Reed's Conjecture","year":2014,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Combinatorics; Neighbourhood (mathematics); Mathematics; Omega; Vertex (graph theory); Upper and lower bounds; Locality; Independent set; Graph; Chromatic scale; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.008571330437597833,"score_gpt":0.2618029617354574,"score_spread":0.2532316312978596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860548633","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.1392454,0.008235466,0.8476192,0.0023363105,0.0016613394,0.00030471978,0.000002481565,0.000035672918,0.0005594339],"genre_scores_gemma":[0.99836266,0.0010704758,0.00024350938,0.000048617818,0.00012228168,0.0000024915075,0.0000011110907,0.000023239752,0.00012561513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646294,0.0006745111,0.00067835615,0.00027182943,0.0011963217,0.0007160234],"domain_scores_gemma":[0.99623615,0.000656365,0.0009967616,0.0012261136,0.00075964275,0.00012494955],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035779718,0.00027984855,0.0006649593,0.00032352944,0.00012330053,0.000071330964,0.0048864675,0.00026322983,0.00000815416],"category_scores_gemma":[0.00028270754,0.000188943,0.00039412588,0.0005572623,0.00022230779,0.0001840997,0.0014343755,0.0037172635,0.000006370422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010037996,0.000095503754,0.00004358582,0.00006576928,0.00014840643,0.00001271668,0.00030540462,0.002148451,0.00027568487,0.994874,0.0004720243,0.001458092],"study_design_scores_gemma":[0.0007875395,0.0011421263,0.0000541482,0.00013377213,0.000045586057,0.00020164362,0.000030424253,0.0034437126,0.00281238,0.9877649,0.0034042103,0.00017956922],"about_ca_topic_score_codex":0.000005971705,"about_ca_topic_score_gemma":0.0000014371504,"teacher_disagreement_score":0.85911727,"about_ca_system_score_codex":0.00045741914,"about_ca_system_score_gemma":0.0015363855,"threshold_uncertainty_score":0.99858123},"labels":[],"label_agreement":null},{"id":"W1863689192","doi":"10.37236/2126","title":"Poset Pinball, Highest Forms, and $(n-2,2)$ Springer Varieties","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Partially ordered set; Variety (cybernetics); Equivariant map; Bijection; Nilpotent; Equivariant cohomology; Type (biology); Symmetric function; Dimension (graph theory); Cohomology; Nilpotent matrix; Partition (number theory); Rank (graph theory); Pure mathematics; Square matrix; Symmetric matrix","score_opus":0.015944195118463424,"score_gpt":0.27648969835886067,"score_spread":0.26054550324039727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863689192","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.9682341,0.014493897,0.014413384,0.0010805203,0.00054314086,0.00011228433,8.373904e-7,0.000025408777,0.0010964161],"genre_scores_gemma":[0.9980761,0.001158673,0.000090548565,0.000082427076,0.000197738,0.0000014929129,2.879676e-7,0.0000245314,0.00036821215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985331,0.000060168695,0.00035216336,0.00006499021,0.00034222612,0.0006473492],"domain_scores_gemma":[0.9987331,0.00043547925,0.00037243357,0.00021572031,0.00012823651,0.000115027935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012345212,0.00015649905,0.00028022868,0.00008731491,0.00014946183,0.000030922496,0.0002973332,0.000071361144,0.000018081604],"category_scores_gemma":[0.00024309992,0.00009660897,0.000085583764,0.00023740996,0.00007257298,0.0004003973,0.00008325,0.0006737379,0.000005513392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029606079,0.0001282501,0.0012952733,0.000022990916,0.00008487148,0.0000015379105,0.00034474,7.6970207e-7,0.00009424647,0.99680287,0.0007550604,0.00043978242],"study_design_scores_gemma":[0.0005025,0.00027081484,0.0014482894,0.000015578707,0.000090942944,0.0002959293,0.0002063371,0.0000029386006,0.0009223072,0.98232794,0.013792303,0.00012414575],"about_ca_topic_score_codex":5.2559795e-7,"about_ca_topic_score_gemma":8.3450817e-7,"teacher_disagreement_score":0.029841978,"about_ca_system_score_codex":0.00015189801,"about_ca_system_score_gemma":0.000094517956,"threshold_uncertainty_score":0.39395997},"labels":[],"label_agreement":null},{"id":"W1864460033","doi":"10.37236/2248","title":"Canonical Decompositions of Affine Permutations, Affine Codes, and Split $k$-Schur Functions","year":2012,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Affine transformation; Affine hull; Affine geometry; Combinatorics; Affine coordinate system; Affine combination; Permutation (music); Affine group; Discrete mathematics; Affine space; Pure mathematics","score_opus":0.026514627112830924,"score_gpt":0.31565922663654167,"score_spread":0.28914459952371074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864460033","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.73993886,0.023982363,0.22343607,0.0030511096,0.0049712714,0.0016883265,0.00012900133,0.00014246943,0.0026605316],"genre_scores_gemma":[0.9953757,0.0014711607,0.0020058479,0.000017417517,0.0004434824,0.000028563969,0.000016278027,0.000092616014,0.00054897007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961242,0.00036175214,0.0016663927,0.00024789167,0.0008363974,0.0007633383],"domain_scores_gemma":[0.99332976,0.0022035611,0.0023606333,0.00087672495,0.0010190025,0.00021028872],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020844191,0.0004946004,0.0012451358,0.00027901822,0.00026627202,0.00006208195,0.0009048197,0.00036620005,0.00006389532],"category_scores_gemma":[0.001064662,0.00038397434,0.00038279875,0.00043172223,0.00023960098,0.00018307124,0.0005588855,0.002776736,0.0000046615437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007918076,0.00084310165,0.00005422365,0.00032855012,0.0005263336,0.000004303774,0.000627322,0.00015774864,0.00030771393,0.9957648,0.0010895804,0.00021712057],"study_design_scores_gemma":[0.0011920588,0.00040566825,0.00009986754,0.00031108657,0.0012866613,0.0004534222,0.00024567338,0.0001873732,0.00051363197,0.9933331,0.0016379071,0.00033355903],"about_ca_topic_score_codex":0.000013870429,"about_ca_topic_score_gemma":0.000024085624,"teacher_disagreement_score":0.2554368,"about_ca_system_score_codex":0.0008465788,"about_ca_system_score_gemma":0.0014682658,"threshold_uncertainty_score":0.99986124},"labels":[],"label_agreement":null},{"id":"W1866581231","doi":"10.37236/391","title":"Crystal Rules for $(\\ell,0)$-JM Partitions","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Interpretation (philosophy); Lambda; Crystal (programming language); Section (typography); Hecke algebra; Algebra over a field; Physics; Pure mathematics; Quantum mechanics; Computer science","score_opus":0.021516468932989002,"score_gpt":0.3103574520440467,"score_spread":0.28884098311105766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866581231","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.69911915,0.0006875547,0.28989434,0.0021075066,0.004902861,0.0009308204,0.000013891569,0.000113320304,0.0022305897],"genre_scores_gemma":[0.9963226,0.00008821261,0.0024808515,0.000036021727,0.0004970786,0.000026830166,0.0000013846588,0.000063876745,0.0004831784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978333,0.00007840142,0.0007620158,0.00012881246,0.00049699267,0.000700459],"domain_scores_gemma":[0.99595976,0.0019070152,0.00084632315,0.00052148284,0.00064518076,0.00012024961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017685452,0.00023194816,0.00044744211,0.00010633034,0.00030294008,0.0000596045,0.0008283182,0.0001332493,0.0000332022],"category_scores_gemma":[0.0020713247,0.00016229098,0.00030157843,0.00025831617,0.00012678967,0.00022002328,0.00006740028,0.0012505103,0.00000954443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047553156,0.0003181563,0.0000097898255,0.000042162323,0.000095647476,0.0000021932944,0.00023539027,0.000008236683,0.0020328555,0.994541,0.0025214744,0.00014553314],"study_design_scores_gemma":[0.0012688292,0.00051992043,0.0000065240724,0.000027910568,0.00017546047,0.00022180492,0.00014587979,0.000106278436,0.0035629107,0.97401214,0.0197721,0.00018022237],"about_ca_topic_score_codex":6.5306057e-7,"about_ca_topic_score_gemma":0.000007726967,"teacher_disagreement_score":0.29720345,"about_ca_system_score_codex":0.00017888745,"about_ca_system_score_gemma":0.00046310542,"threshold_uncertainty_score":0.6618034},"labels":[],"label_agreement":null},{"id":"W1871629701","doi":"10.37236/380","title":"Logconcave Random Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"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 Waterloo","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Random graph; Random regular graph; Bounded function; Graph; Discrete mathematics; Unit cube; Chordal graph; 1-planar graph","score_opus":0.004298915434445819,"score_gpt":0.21050635183446573,"score_spread":0.2062074364000199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871629701","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.10638813,0.0016506428,0.87368464,0.0065027936,0.005697282,0.00022760415,6.6609897e-7,0.00007486693,0.0057733804],"genre_scores_gemma":[0.9987532,0.00033392687,0.00024037737,0.00016546236,0.00010929593,0.0000011642446,3.5646738e-7,0.0000068438803,0.0003893787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871325,0.00007258022,0.00028541757,0.00010560365,0.00039716344,0.0004260019],"domain_scores_gemma":[0.99883974,0.00016267871,0.00029742726,0.0004850525,0.00015059246,0.000064517866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018159212,0.00010846976,0.00017901511,0.00011903478,0.00013370044,0.00016926261,0.0023474072,0.000037799895,0.00001033295],"category_scores_gemma":[0.000071796116,0.0000672213,0.00012530794,0.00047884104,0.000055157896,0.0006057294,0.0001849876,0.0009285498,0.000016124963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009667401,0.000048056052,0.000047776983,0.000001589807,0.000045735418,0.000009701604,0.00006695064,0.0000030104563,0.00021160762,0.991921,0.0014250946,0.0062098135],"study_design_scores_gemma":[0.0014066085,0.00022543638,0.00015641777,0.0000037317682,0.00002509286,0.00013307725,0.00001612458,0.0010219895,0.0007415754,0.9614579,0.03471624,0.000095802694],"about_ca_topic_score_codex":0.0000023715793,"about_ca_topic_score_gemma":0.0000033973702,"teacher_disagreement_score":0.89236504,"about_ca_system_score_codex":0.00003834725,"about_ca_system_score_gemma":0.00018716883,"threshold_uncertainty_score":0.43621054},"labels":[],"label_agreement":null},{"id":"W1874608777","doi":"10.37236/2456","title":"Expansions of k-Schur Functions in the Affine nilCoxeter Algebra","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Affine transformation; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.0289987676990772,"score_gpt":0.30249313502917885,"score_spread":0.27349436733010163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874608777","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.96264195,0.0028156007,0.027947547,0.001400694,0.001731876,0.00047518782,0.0000020701102,0.000025702935,0.002959349],"genre_scores_gemma":[0.99903995,0.000132061,0.00020012926,0.000055315773,0.000251143,0.000012043315,4.578223e-7,0.000035859928,0.00027301494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720854,0.000361815,0.00092344475,0.00008346275,0.00071249733,0.0007102581],"domain_scores_gemma":[0.99607706,0.0020951245,0.00086070626,0.00061392767,0.00027818984,0.00007500642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032225917,0.00021334735,0.00046859594,0.00016654709,0.00013613908,0.000018414066,0.0008916606,0.00009595187,0.00003753133],"category_scores_gemma":[0.0011716465,0.00011929439,0.00021935714,0.00080571265,0.00009103014,0.00030680795,0.0000848824,0.0011305654,0.000009041036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036236608,0.00082323083,0.00024186082,0.00003120969,0.00006972559,0.0000020656228,0.0024031932,0.000012167381,0.000386393,0.9946066,0.0012610736,0.00012620396],"study_design_scores_gemma":[0.0009937416,0.00038803255,0.00022924069,0.000058502297,0.0001628677,0.000218265,0.0015695797,0.000019549474,0.00084605475,0.992481,0.0029051034,0.00012807609],"about_ca_topic_score_codex":0.0000029417342,"about_ca_topic_score_gemma":0.0000053135777,"teacher_disagreement_score":0.036398,"about_ca_system_score_codex":0.0003034601,"about_ca_system_score_gemma":0.00023705211,"threshold_uncertainty_score":0.49118072},"labels":[],"label_agreement":null},{"id":"W1878158968","doi":"10.37236/689","title":"A New Upper Bound on the Global Defensive Alliance Number in Trees","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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":"Combinatorics; Upper and lower bounds; Mathematics; Alliance; Vertex (graph theory); Graph; Tree (set theory); Order (exchange); Dominating set; Discrete mathematics; Geography","score_opus":0.02319584475108637,"score_gpt":0.2794500783205623,"score_spread":0.2562542335694759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878158968","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.7403447,0.005777708,0.2260836,0.008867888,0.0010701611,0.0005208097,9.3717955e-7,0.00005019349,0.017283995],"genre_scores_gemma":[0.9985897,0.00045503216,0.00022923668,0.0003350775,0.000046140773,0.000002887669,4.027321e-8,0.000009986926,0.00033193175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778825,0.00035937343,0.00032221002,0.00016853036,0.00062136864,0.0007402414],"domain_scores_gemma":[0.99843144,0.00040024542,0.00025721232,0.00059403275,0.00021193703,0.000105136096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014477506,0.0001608819,0.00021211988,0.000048879854,0.00014575174,0.00007518162,0.0025667262,0.00005184405,0.000031715626],"category_scores_gemma":[0.00019364875,0.00008912318,0.00013182631,0.0010937745,0.00010736636,0.0003407628,0.00017329265,0.0009948029,0.00005475127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009741267,0.00007958349,0.0019441305,9.824353e-7,0.000037048794,0.000025872,0.00067141646,0.000024514055,0.000012668407,0.99526125,0.0004924225,0.0013526862],"study_design_scores_gemma":[0.0005551201,0.00044270634,0.0036170734,0.000026502319,0.0000067924434,0.00020983958,0.000108831504,0.0001185097,0.00060615706,0.99233735,0.001869207,0.00010192215],"about_ca_topic_score_codex":0.000022780043,"about_ca_topic_score_gemma":0.00005362155,"teacher_disagreement_score":0.25824496,"about_ca_system_score_codex":0.0005282087,"about_ca_system_score_gemma":0.00074204203,"threshold_uncertainty_score":0.47696587},"labels":[],"label_agreement":null},{"id":"W1884798717","doi":"10.37236/218","title":"Trees and Meta-Fibonacci Sequences","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"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 Toronto","funders":"","keywords":"Fibonacci number; Recursion (computer science); Combinatorics; Mathematics; Interpretation (philosophy); Integer (computer science); Tree (set theory); Constraint (computer-aided design); Discrete mathematics; Algorithm; Computer science","score_opus":0.01110436457372468,"score_gpt":0.23296925799772986,"score_spread":0.22186489342400517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884798717","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.4904828,0.11040627,0.35375395,0.041494377,0.000833257,0.0002531595,8.324805e-7,0.00015626091,0.0026190802],"genre_scores_gemma":[0.9982116,0.00095061335,0.00016898611,0.0004811513,0.000040396226,5.732248e-7,5.288107e-8,0.0000036264614,0.00014297786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885887,0.00012145188,0.00025978664,0.0001033359,0.00031034986,0.00034619492],"domain_scores_gemma":[0.99916077,0.0001710341,0.0002589224,0.00025992777,0.00008917672,0.000060150036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012714311,0.000118795375,0.0002745753,0.00007312673,0.00012297294,0.00011999638,0.0010590173,0.000033083783,0.000005366494],"category_scores_gemma":[0.000035504043,0.00006450731,0.0001211142,0.0003051539,0.000042704254,0.00043166752,0.000053903164,0.00035410884,0.0000018884934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049382184,0.000034957287,0.00000980836,9.4038e-7,0.00014248875,0.000008508078,0.00017845104,0.000013209149,0.0002865151,0.9942255,0.00021955161,0.0048751403],"study_design_scores_gemma":[0.00023877833,0.0006055422,0.0004831292,0.00000292528,0.00022185242,0.00046223958,0.00003326746,0.00057802105,0.0013086874,0.9937408,0.0022399486,0.000084824904],"about_ca_topic_score_codex":0.0000024209146,"about_ca_topic_score_gemma":0.0000011631896,"teacher_disagreement_score":0.5077288,"about_ca_system_score_codex":0.000062889965,"about_ca_system_score_gemma":0.00016630595,"threshold_uncertainty_score":0.26305318},"labels":[],"label_agreement":null},{"id":"W1897354905","doi":"10.37236/4419","title":"On Maltsev Digraphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Constraint satisfaction problem; Time complexity; Discrete mathematics; Disjoint sets; Semilattice; Directed graph; Homomorphism; Series (stratigraphy)","score_opus":0.01895759023653225,"score_gpt":0.2791022268054558,"score_spread":0.26014463656892356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897354905","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.1886577,0.006361288,0.7892704,0.0056449506,0.0015375867,0.0002340098,3.426366e-7,0.00007872181,0.008215019],"genre_scores_gemma":[0.9991192,0.00019298367,0.00009052079,0.00016671585,0.00004931918,0.0000017018158,7.497284e-8,0.000011076841,0.0003683899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978065,0.000279271,0.0002798819,0.00012522185,0.00088951434,0.00061959994],"domain_scores_gemma":[0.998299,0.00039950915,0.00025405534,0.0005617483,0.0003019834,0.00018367765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027088053,0.0001230827,0.00018700302,0.0002132143,0.00011094892,0.00007743164,0.0022931015,0.000039706298,0.0000020131151],"category_scores_gemma":[0.00031638623,0.000076725504,0.00011623336,0.00097307994,0.00007987419,0.00037386426,0.000142646,0.00095815706,0.000029272429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063274885,0.0000862876,0.000041444368,0.0000011042044,0.00002898841,0.000016949672,0.00020225439,0.00016938345,0.000025512696,0.99628127,0.0011121157,0.0019714262],"study_design_scores_gemma":[0.00076112594,0.0015692813,0.00003694106,0.00000993707,0.0000057054217,0.00020567571,0.00004372322,0.0004457635,0.0007937354,0.9888464,0.0071951174,0.00008658195],"about_ca_topic_score_codex":0.0000010369716,"about_ca_topic_score_gemma":6.804075e-7,"teacher_disagreement_score":0.8104615,"about_ca_system_score_codex":0.00029431193,"about_ca_system_score_gemma":0.0006346838,"threshold_uncertainty_score":0.42611912},"labels":[],"label_agreement":null},{"id":"W1907059769","doi":"10.37236/165","title":"Distinguishing Chromatic Numbers of Bipartite Graphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"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 Calgary","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Chromatic scale; Delta; Graph; Discrete mathematics; Physics","score_opus":0.005713564834732197,"score_gpt":0.218584882256818,"score_spread":0.2128713174220858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907059769","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.94271874,0.0060794987,0.046286482,0.002799646,0.0007486606,0.00010225954,1.8714776e-7,0.000052193624,0.001212338],"genre_scores_gemma":[0.99922705,0.00020432145,0.00038450884,0.00013414689,0.000007227345,3.2170294e-7,1.09518254e-7,0.000005223251,0.000037069152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837047,0.000111775866,0.0005290752,0.00010065107,0.0004820399,0.00040599666],"domain_scores_gemma":[0.99846923,0.0001556833,0.0006492266,0.00037079098,0.00028222933,0.00007283023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015939861,0.00011379945,0.00025551132,0.00013700346,0.00012304107,0.000060725313,0.0010910571,0.00003794342,0.0000015487406],"category_scores_gemma":[0.00017556135,0.00007517031,0.000149918,0.0008618353,0.000052406827,0.00023710799,0.000047416095,0.00043231383,0.0000022444692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005723487,0.0000944688,0.000134448,0.000006347004,0.000030089304,0.000004355244,0.00039199897,0.00016527191,0.0011544933,0.9968465,0.00027676823,0.0008895591],"study_design_scores_gemma":[0.00042993663,0.00061204337,0.00037269018,0.00006593899,0.000027039008,0.00012698099,0.000023090406,0.0012997579,0.002252372,0.9944866,0.0002191129,0.0000844482],"about_ca_topic_score_codex":0.0000067268834,"about_ca_topic_score_gemma":9.4626625e-7,"teacher_disagreement_score":0.056508336,"about_ca_system_score_codex":0.00006463117,"about_ca_system_score_gemma":0.00022657144,"threshold_uncertainty_score":0.30653563},"labels":[],"label_agreement":null},{"id":"W1916405817","doi":"10.37236/1878","title":"$P$-Partitions and a Multi-Parameter Klyachko Idempotent","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Université du Québec à Montréal","funders":"","keywords":"Idempotence; Mathematics; Generalization; Symmetric group; Element (criminal law); Idempotent matrix; Pure mathematics; Combinatorics; Symmetric function; Group (periodic table); Field (mathematics); Algebra over a field; Discrete mathematics; Law","score_opus":0.03551202598444986,"score_gpt":0.32005893492537846,"score_spread":0.2845469089409286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916405817","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.7179668,0.005213915,0.2697918,0.0047849305,0.0009066949,0.0005618993,0.0000023129824,0.0000913151,0.0006803096],"genre_scores_gemma":[0.99345315,0.00051952194,0.0052724383,0.00010003893,0.00019194625,0.000008853233,2.233785e-7,0.00004301674,0.00041083767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979251,0.00015768665,0.0007462418,0.00013076712,0.0004627481,0.00057744427],"domain_scores_gemma":[0.9973508,0.001174136,0.00066708756,0.0003876517,0.0002933952,0.00012690118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013413175,0.00022385996,0.0004324521,0.0001116803,0.00019596286,0.000051273477,0.00046994578,0.00009071588,0.000015204042],"category_scores_gemma":[0.0012184272,0.00015270438,0.00015924046,0.00027989442,0.00011340161,0.00027779138,0.00009903033,0.0008772866,0.0000116798765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026190763,0.0003991528,0.000035486475,0.000023008759,0.00010989028,0.000004221367,0.0005177116,0.000038501235,0.00018743996,0.997173,0.00072501216,0.0007603516],"study_design_scores_gemma":[0.0014282535,0.00035911676,0.00002909004,0.00004590579,0.00016557585,0.00039262997,0.00015384136,0.0008659533,0.0011364997,0.9906622,0.0045920974,0.00016884571],"about_ca_topic_score_codex":9.566347e-7,"about_ca_topic_score_gemma":0.0000054653647,"teacher_disagreement_score":0.27548632,"about_ca_system_score_codex":0.00036719907,"about_ca_system_score_gemma":0.0001954902,"threshold_uncertainty_score":0.62271035},"labels":[],"label_agreement":null},{"id":"W1916472382","doi":"10.37236/449","title":"Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"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":"Australian Research Council; Canada Research Chairs; University of Melbourne; Macquarie University","keywords":"Combinatorics; Mathematics; Heuristics; Bounding overwatch; Maximal independent set; Cubic graph; Vertex (graph theory); Greedy algorithm; Discrete mathematics; Graph; Chordal graph; Algorithm; Computer science; 1-planar graph; Line graph; Mathematical optimization","score_opus":0.009681412868531011,"score_gpt":0.2806493101126358,"score_spread":0.27096789724410475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916472382","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.8369772,0.0018210191,0.15898377,0.0014607899,0.00035588475,0.00028036343,7.7892986e-7,0.000021759743,0.00009846288],"genre_scores_gemma":[0.99888045,0.00034132766,0.0006417098,0.00004093584,0.000035618174,0.0000047464678,1.9550635e-7,0.00001103189,0.000043985092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769,0.00038626537,0.00046023953,0.00017797109,0.00068745564,0.000598025],"domain_scores_gemma":[0.9970473,0.0011711569,0.0005312,0.0007159086,0.000429063,0.00010538768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053407555,0.00015917377,0.00041748915,0.00054566824,0.00031057445,0.00008156255,0.0015369358,0.00006134694,0.0000030726967],"category_scores_gemma":[0.00024580787,0.00008400839,0.00029625997,0.00320982,0.0004737219,0.00023723027,0.00021134614,0.0016777552,8.978349e-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.00010216549,0.0001081526,0.00024933525,0.000003972634,0.0005431474,0.00005244702,0.00053328223,0.00017251875,0.0001252342,0.9851881,0.000004674267,0.012916918],"study_design_scores_gemma":[0.0015220436,0.00079628435,0.00021394432,0.000010734932,0.0003532639,0.0010379918,0.00014359063,0.022449642,0.0009747736,0.97197163,0.00040053297,0.00012555688],"about_ca_topic_score_codex":0.0000137125835,"about_ca_topic_score_gemma":0.000021392263,"teacher_disagreement_score":0.16190328,"about_ca_system_score_codex":0.000049531416,"about_ca_system_score_gemma":0.00018783662,"threshold_uncertainty_score":0.72891045},"labels":[],"label_agreement":null},{"id":"W1921367233","doi":"10.37236/717","title":"Genetic Algorithms Applied to Problems of Forbidden Configurations","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Matrix (chemical analysis); Combinatorics; Mathematics; Permutation (music); Algorithm; SIMPLE algorithm; Column (typography); Discrete mathematics; Geometry; Connection (principal bundle); Physics","score_opus":0.01169907123761127,"score_gpt":0.18765395701796503,"score_spread":0.17595488578035376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921367233","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.8376367,0.0046086716,0.1344847,0.00005452097,0.0010771184,0.0005730083,0.000002793994,0.000064272084,0.021498209],"genre_scores_gemma":[0.99966425,0.00015467322,0.00004748816,0.000009571842,0.00004689156,0.000009516391,2.0800086e-7,0.000020936981,0.000046449582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990047,0.000038452883,0.00041608486,0.00005076645,0.00019212198,0.00029787733],"domain_scores_gemma":[0.99944055,0.000041655345,0.00014453667,0.00019377205,0.00011539441,0.00006409914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004995752,0.00010726927,0.00021692012,0.00010413304,0.00004677418,0.000009136058,0.00038528166,0.000046375466,0.000020614483],"category_scores_gemma":[0.000009593332,0.00007802438,0.000080027894,0.00031324715,0.00002789837,0.00004693745,0.000012559927,0.00028439454,0.000009323023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026707246,0.00007145923,0.00006327481,0.000048569113,0.00021718224,0.0000020018583,0.0029093868,0.0032665576,0.010066292,0.9819325,0.00029297857,0.0011030749],"study_design_scores_gemma":[0.0008594491,0.00084511144,0.0013886557,0.00006478167,0.00013021058,0.00018032706,0.00062389567,0.0006660056,0.03325145,0.9582872,0.003458678,0.00024428155],"about_ca_topic_score_codex":0.0000039865618,"about_ca_topic_score_gemma":0.0000032491503,"teacher_disagreement_score":0.16202755,"about_ca_system_score_codex":0.00006700144,"about_ca_system_score_gemma":0.00006953048,"threshold_uncertainty_score":0.31817418},"labels":[],"label_agreement":null},{"id":"W1923351770","doi":"10.37236/5583","title":"Words with many Palindrome Pair Factors","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Palindrome; Property (philosophy); Conjecture; Mathematics; Class (philosophy); Combinatorics; Word (group theory); Product (mathematics); Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.013935371001254302,"score_gpt":0.23112483982238996,"score_spread":0.21718946882113566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923351770","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.568811,0.00964069,0.41608244,0.0021016363,0.0024495197,0.0002689191,0.0000028087625,0.00013453176,0.0005084384],"genre_scores_gemma":[0.9987909,0.0003793238,0.00018128239,0.000089571666,0.00017158352,0.000004001858,0.000002197686,0.00003761706,0.00034352436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967852,0.00034851834,0.0006214979,0.00030996464,0.0011093792,0.00082543463],"domain_scores_gemma":[0.99658835,0.0002651255,0.00124878,0.0012104829,0.00048985117,0.00019738924],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002927855,0.0004215525,0.0006763241,0.00021951062,0.00013557782,0.0002947223,0.004501489,0.0002244572,0.0000066834473],"category_scores_gemma":[0.00007096004,0.00023687663,0.00025793753,0.0005140296,0.000099445475,0.00030315344,0.00097399304,0.0028875356,0.000007949472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046990317,0.00020332818,0.000532307,0.00003844828,0.00040526214,0.00008493295,0.001839669,0.00072484114,0.000012634616,0.9930216,0.0017948666,0.0012951134],"study_design_scores_gemma":[0.0007013665,0.0009437081,0.0004011835,0.00015861512,0.00009952671,0.00047216713,0.0001953807,0.0021443688,0.00028696374,0.9895667,0.004659923,0.0003701221],"about_ca_topic_score_codex":0.000013301227,"about_ca_topic_score_gemma":0.0000024462931,"teacher_disagreement_score":0.42997986,"about_ca_system_score_codex":0.00075008394,"about_ca_system_score_gemma":0.0023309004,"threshold_uncertainty_score":0.99941283},"labels":[],"label_agreement":null},{"id":"W1923956842","doi":"10.37236/393","title":"Characteristic Points of Recursive Systems","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rogers Communications (Canada); University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Antichain; Power series; Radius of convergence; Combinatorics; Series (stratigraphy); Jacobian matrix and determinant; Generating function; Mathematical analysis; Mathematical physics; Partially ordered set; Applied mathematics","score_opus":0.013013189347920402,"score_gpt":0.28182065584329,"score_spread":0.26880746649536963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923956842","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.87076515,0.0003629056,0.12652643,0.00017729707,0.0016050094,0.00018918759,0.0000030722026,0.000009865185,0.00036105618],"genre_scores_gemma":[0.9995035,0.00006728865,0.000060706017,0.0000050844947,0.00013723702,0.000002810823,7.4233645e-7,0.000016830481,0.00020580462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984921,0.00012061228,0.0006573807,0.00006680665,0.00037344673,0.00028965887],"domain_scores_gemma":[0.997547,0.0006167992,0.0010549749,0.00026956302,0.00044937053,0.000062313986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009892931,0.00011297699,0.0003714276,0.00007094713,0.000070588,0.000019794626,0.00037971733,0.000075279786,0.0000147369365],"category_scores_gemma":[0.0007341966,0.00006980986,0.00012539998,0.00019908375,0.000061512146,0.000087316286,0.00002829176,0.0007174621,0.0000038086812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031550207,0.00013800687,0.00006474617,0.000036754074,0.00006389654,0.0000014674785,0.0001219523,0.0000049212986,0.0034053437,0.9959428,0.00006552196,0.00012309063],"study_design_scores_gemma":[0.0004949889,0.00030466364,0.0001572832,0.000056721485,0.00008358911,0.00012927927,0.00011741853,0.00032224337,0.0005508722,0.9970216,0.00068140123,0.0000799096],"about_ca_topic_score_codex":0.000006336761,"about_ca_topic_score_gemma":0.0000032255134,"teacher_disagreement_score":0.12873833,"about_ca_system_score_codex":0.00009834682,"about_ca_system_score_gemma":0.00016763134,"threshold_uncertainty_score":0.3117056},"labels":[],"label_agreement":null},{"id":"W1924533234","doi":"10.37236/1778","title":"Decomposing Infinite 2-Connected Graphs into 3-Connected Components","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Modular decomposition; Planar graph; Chordal graph; Connected component; Indifference graph; 1-planar graph; Pathwidth; Strongly connected component; Discrete mathematics; Clique-sum; Graph; Line graph","score_opus":0.011773604596896615,"score_gpt":0.26508313271587697,"score_spread":0.25330952811898033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924533234","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.6356875,0.0021255875,0.35957086,0.0016543177,0.00053955143,0.00017163718,2.779378e-7,0.000078349636,0.00017193521],"genre_scores_gemma":[0.9983691,0.00040807927,0.0009578814,0.00016665256,0.000045615197,0.0000036819363,0.0000010540934,0.000027615104,0.000020339154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670887,0.00040993257,0.00068234635,0.00026005236,0.0009112692,0.0010275388],"domain_scores_gemma":[0.9971504,0.00063486176,0.0005857544,0.0007405663,0.00068526017,0.00020311233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019094208,0.00026791624,0.0004095145,0.0005234179,0.0004798771,0.0001784214,0.0030227876,0.0000919426,0.000004109983],"category_scores_gemma":[0.00030348828,0.00019704178,0.00023063856,0.0023051642,0.00018349294,0.00081787235,0.00032759868,0.0015077192,0.00001902292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008333065,0.00018886635,0.00013142942,0.000007875755,0.00012138962,0.000037475464,0.0006952454,0.0010171521,0.009497493,0.987064,0.000016363278,0.0011394001],"study_design_scores_gemma":[0.0022596512,0.00077757216,0.00052385434,0.000059114212,0.000022208356,0.00047469087,0.00005578482,0.000684202,0.011506097,0.98278064,0.0006350605,0.00022113581],"about_ca_topic_score_codex":0.0000191957,"about_ca_topic_score_gemma":0.000010285164,"teacher_disagreement_score":0.3626816,"about_ca_system_score_codex":0.00067004666,"about_ca_system_score_gemma":0.0007061109,"threshold_uncertainty_score":0.8035131},"labels":[],"label_agreement":null},{"id":"W1926352835","doi":"10.37236/1101","title":"Grothendieck Bialgebras, Partition Lattices, and Symmetric Functions in Noncommutative Variables","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bialgebra; Mathematics; Noncommutative geometry; Symmetric function; Pure mathematics; Partition (number theory); Hopf algebra; Basis (linear algebra); Symmetrization; Lattice (music); Combinatorics; Algebra over a field","score_opus":0.012935569705696369,"score_gpt":0.2537020866813878,"score_spread":0.2407665169756914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926352835","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.9848978,0.00406262,0.0074336086,0.0006147735,0.00073094375,0.00025864854,0.0000017012972,0.000023090992,0.0019768444],"genre_scores_gemma":[0.999274,0.00023954154,0.000044564065,0.000022322189,0.0002226463,0.000008163239,0.0000012031624,0.000024077197,0.000163482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982446,0.00024001037,0.0005820679,0.000122033074,0.00036825513,0.00044305567],"domain_scores_gemma":[0.9981416,0.0009333677,0.0005109543,0.0001975905,0.00016857605,0.00004791763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010059307,0.00017789303,0.0003528161,0.00025208027,0.00017285976,0.000058141955,0.0002809818,0.00009780079,0.000017240875],"category_scores_gemma":[0.00022157424,0.00012404445,0.00008829965,0.00081487815,0.000077533725,0.00020791743,0.000051456384,0.0006947485,0.0000016347797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051041003,0.00015787862,0.0008004962,0.000016804099,0.000054668533,0.000005548043,0.00016776187,0.00004888979,0.00002069933,0.99809974,0.00041991723,0.0001565544],"study_design_scores_gemma":[0.0013333068,0.00036908794,0.0010491789,0.00003814231,0.00011142269,0.00012352156,0.00019918483,0.0001590243,0.00014021451,0.99583924,0.0005051168,0.00013258027],"about_ca_topic_score_codex":0.00008870564,"about_ca_topic_score_gemma":0.00005497079,"teacher_disagreement_score":0.0143762315,"about_ca_system_score_codex":0.00031909609,"about_ca_system_score_gemma":0.00021850309,"threshold_uncertainty_score":0.50583863},"labels":[],"label_agreement":null},{"id":"W1927650282","doi":"10.37236/331","title":"The $t$-Stability Number of a Random Graph","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Commonwealth Scholarship Commission; University of Oxford; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Degree (music); Discrete mathematics; Random graph","score_opus":0.010337783308994763,"score_gpt":0.27857065461001973,"score_spread":0.26823287130102497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927650282","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.9933027,0.00076821964,0.0012723601,0.0004604686,0.0012709831,0.00015604332,9.810152e-7,0.000009811015,0.002758426],"genre_scores_gemma":[0.999306,0.0004012332,0.000042832944,0.000021070075,0.000106499414,0.0000021412438,7.794862e-8,0.0000175977,0.00010255383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807996,0.000295122,0.0006366445,0.00007720118,0.0004911301,0.00041994103],"domain_scores_gemma":[0.99558234,0.00264223,0.00072936865,0.0005805059,0.0004103431,0.000055190372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048920256,0.00014352189,0.0003401897,0.00003663491,0.0004110471,0.000025791738,0.00094511104,0.000090399335,0.00005457542],"category_scores_gemma":[0.0011763716,0.000065462285,0.00033121,0.00028520887,0.00038121062,0.000072560644,0.00008450694,0.00145777,8.563391e-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.00024023729,0.00008319696,0.0007731288,0.000013620202,0.00014316934,9.3743245e-7,0.0005721159,4.16428e-7,0.0004614667,0.9970081,0.00036540983,0.00033819428],"study_design_scores_gemma":[0.0012671932,0.00012236788,0.0002308529,0.000008377052,0.00010410232,0.00020035941,0.00017854419,0.000008221503,0.0034461443,0.99170256,0.0026555047,0.000075791795],"about_ca_topic_score_codex":0.0000029030216,"about_ca_topic_score_gemma":0.0000139793865,"teacher_disagreement_score":0.006003286,"about_ca_system_score_codex":0.00004368326,"about_ca_system_score_gemma":0.00021797004,"threshold_uncertainty_score":0.63333666},"labels":[],"label_agreement":null},{"id":"W1930520427","doi":"10.37236/4971","title":"Tokuyama's Identity for Factorial Schur $P$ and $Q$ Functions","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Mathematics; Vandermonde matrix; Combinatorics; Factorial; Partition (number theory); Identity (music); Product (mathematics); Lattice (music); Vertex (graph theory); Extension (predicate logic); Mathematical analysis; Graph; Geometry; Computer science","score_opus":0.06856880706982962,"score_gpt":0.34966352541704865,"score_spread":0.281094718347219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930520427","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.30558768,0.002111066,0.682797,0.0008483635,0.0071197245,0.0006967598,0.000005500769,0.000067864275,0.0007660216],"genre_scores_gemma":[0.9978917,0.00011496028,0.0006724995,0.000020380552,0.00071764376,0.000012675925,6.3852514e-7,0.000043626776,0.00052583957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803746,0.000116810705,0.000610504,0.0001245032,0.0006090371,0.00050166086],"domain_scores_gemma":[0.9967287,0.001228203,0.00068672496,0.00033000953,0.00085561664,0.0001707258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023317502,0.0002008252,0.00043629864,0.000099838515,0.0001919606,0.0000850461,0.00050015614,0.00010554139,0.0000037694122],"category_scores_gemma":[0.0033962221,0.0001415608,0.00015048502,0.00030527357,0.00008032739,0.0005200376,0.0000971562,0.0006068173,0.000003890478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012624278,0.00015786591,0.00003502214,0.00003246079,0.000109745546,0.0000014324937,0.00039697622,0.000007379714,0.00007256102,0.9953482,0.0035679745,0.00014412294],"study_design_scores_gemma":[0.0025533077,0.0009549975,0.000006985892,0.000024125342,0.00020614715,0.00013176324,0.00046118352,0.00006489386,0.00032103638,0.98311704,0.012009012,0.00014951201],"about_ca_topic_score_codex":0.000002172636,"about_ca_topic_score_gemma":0.000005664474,"teacher_disagreement_score":0.6923041,"about_ca_system_score_codex":0.0004856224,"about_ca_system_score_gemma":0.0005619957,"threshold_uncertainty_score":0.5772682},"labels":[],"label_agreement":null},{"id":"W1934564046","doi":"10.37236/2902","title":"On the Relationship between Pipe Dreams and Permutation Words","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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 Waterloo","funders":"St. Olaf College","keywords":"Bijection; Permutation (music); Polyomino; Mathematics; Combinatorics; Word (group theory); Set (abstract data type); Distributive property; Lattice (music); Discrete mathematics; Pure mathematics; Geometry; Computer science; Regular polygon","score_opus":0.037897819155354034,"score_gpt":0.29920500481418394,"score_spread":0.26130718565882993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934564046","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.97093385,0.00036459358,0.023560055,0.0035994272,0.0003144669,0.00042416915,4.9544497e-7,0.000027766228,0.0007751614],"genre_scores_gemma":[0.99923843,0.00005200745,0.00009668253,0.00006186555,0.00015559552,0.000014738191,4.1296423e-7,0.000037755275,0.0003425146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801254,0.00029482093,0.00058941566,0.000105858875,0.00058143894,0.00041591827],"domain_scores_gemma":[0.98774207,0.010782487,0.00072621775,0.0003901085,0.00028261408,0.000076484466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017361233,0.00019577901,0.00031327613,0.000090893824,0.00031855764,0.00008876173,0.0005064691,0.000092422466,0.000021954422],"category_scores_gemma":[0.004254505,0.00010701163,0.0000987761,0.000381205,0.00010663327,0.00024211245,0.00005856725,0.0011390988,0.000024104613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010565402,0.00006458353,0.0010932762,0.000017196795,0.00005019921,6.953833e-7,0.00078430015,0.000004109351,0.000022333115,0.9970682,0.00068120175,0.00020330749],"study_design_scores_gemma":[0.00055297086,0.0004277155,0.0022648128,0.000064499305,0.000101709644,0.000047477573,0.0004335113,0.000052282274,0.00022188565,0.99559575,0.00011744909,0.000119955235],"about_ca_topic_score_codex":0.0000023940863,"about_ca_topic_score_gemma":7.4138813e-7,"teacher_disagreement_score":0.028304562,"about_ca_system_score_codex":0.0002918075,"about_ca_system_score_gemma":0.00015663696,"threshold_uncertainty_score":0.50933474},"labels":[],"label_agreement":null},{"id":"W1937228677","doi":"10.37236/5031","title":"Spectrally Extremal Vertices, Strong Cospectrality, and State Transfer","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","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 Waterloo","funders":"Ministério da Educação; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Wheel graph; Path graph; Discrete mathematics; Graph; Partition (number theory); Frequency partition of a graph; Graph power; Line graph","score_opus":0.029728523338030558,"score_gpt":0.2959702899511272,"score_spread":0.2662417666130966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1937228677","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.9245759,0.0047869054,0.064705454,0.0032265885,0.00058687176,0.0005471267,0.000024664545,0.00004998354,0.0014964667],"genre_scores_gemma":[0.99658823,0.002627915,0.000043609456,0.00003371048,0.00014167193,0.000011662086,0.0000011843338,0.000050052127,0.0005019779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743986,0.0003206009,0.0008019094,0.00023974817,0.00050182623,0.0006960536],"domain_scores_gemma":[0.99791706,0.0006614165,0.00049593474,0.00057265715,0.00023670589,0.00011624717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021782448,0.00035116135,0.000604659,0.00012103772,0.00018616382,0.00009803073,0.00091736286,0.00016654181,0.000031475036],"category_scores_gemma":[0.00008932363,0.00021893164,0.00029428626,0.00015644333,0.0001993056,0.00012043737,0.00016461717,0.0019588843,0.0000033489866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010205314,0.00018164485,0.00007240364,0.00008875671,0.0003530242,0.000006987683,0.00040561668,0.0000056486247,0.0004179321,0.9977221,0.0003670421,0.0002767885],"study_design_scores_gemma":[0.0008565891,0.0002753846,0.00018968132,0.0001582841,0.0003847284,0.00015265324,0.0000530821,0.00001765581,0.0017504384,0.9949126,0.0009974864,0.00025137953],"about_ca_topic_score_codex":0.0000034639588,"about_ca_topic_score_gemma":0.000016736893,"teacher_disagreement_score":0.07201228,"about_ca_system_score_codex":0.0003026132,"about_ca_system_score_gemma":0.0005690469,"threshold_uncertainty_score":0.8927773},"labels":[],"label_agreement":null},{"id":"W1941981067","doi":"10.37236/1100","title":"Fractional Biclique Covers and Partitions of Graphs","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University","funders":"","keywords":"Combinatorics; Complete bipartite graph; Mathematics; Bipartite graph; Partition (number theory); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.00994000341867928,"score_gpt":0.2605890001975506,"score_spread":0.2506489967788713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941981067","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.98779064,0.0007361647,0.009070397,0.00087781897,0.00006959485,0.00008523328,0.0000033255485,0.000008521386,0.0013582857],"genre_scores_gemma":[0.9995275,0.00025505072,0.000042141284,0.000020001728,0.000028541224,0.000003469139,7.014147e-7,0.000007655105,0.000114912225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992223,0.00007569991,0.00031093854,0.000046650162,0.00017703384,0.00016739228],"domain_scores_gemma":[0.9987841,0.00052973843,0.0003759651,0.00012639268,0.00015760626,0.000026180202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006747337,0.00006831589,0.0001454692,0.0000752111,0.00012237113,0.000009543024,0.00014292171,0.000037207625,0.000014822291],"category_scores_gemma":[0.00006451752,0.00004853953,0.00009005315,0.00025982087,0.00010641907,0.00007860162,0.000012729535,0.0003079328,8.461842e-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.000018757879,0.00017125148,0.00033026276,0.0000066048783,0.00004255525,4.3076912e-7,0.00003730254,0.000027457245,0.00085508573,0.9975432,0.0009496835,0.000017365668],"study_design_scores_gemma":[0.00035825424,0.00012915119,0.0006117152,0.000011466434,0.00007593106,0.000086866006,0.000070405215,0.000009033045,0.002629374,0.9937442,0.0022266163,0.000047007918],"about_ca_topic_score_codex":0.0000055624614,"about_ca_topic_score_gemma":0.0000056187673,"teacher_disagreement_score":0.011736869,"about_ca_system_score_codex":0.000040395174,"about_ca_system_score_gemma":0.00011669927,"threshold_uncertainty_score":0.19793846},"labels":[],"label_agreement":null},{"id":"W1945551230","doi":"10.37236/292","title":"Distinguishing Number of Countable Homogeneous Relational Structures","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":26,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Mathematics; Countable set; Combinatorics; Conjecture; Homogeneous; Automorphism; Discrete mathematics; Graph","score_opus":0.006701448224600764,"score_gpt":0.2318128234633887,"score_spread":0.22511137523878794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945551230","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.9648225,0.0012988043,0.030132381,0.00066575024,0.0016803857,0.00005791158,8.5612675e-7,0.000023973726,0.001317467],"genre_scores_gemma":[0.9981672,0.000057822035,0.0015913494,0.000046473517,0.000023950262,4.1468635e-7,3.5561334e-7,0.000007460197,0.000104953164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986407,0.000059284386,0.00039023056,0.00009475555,0.0005109536,0.00030406172],"domain_scores_gemma":[0.99836963,0.00024028566,0.0005168139,0.00031301906,0.0005049644,0.000055275625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012385081,0.00009536582,0.00017583364,0.000059239414,0.00016226161,0.000054421478,0.00086637656,0.00005940138,0.000016035774],"category_scores_gemma":[0.00022878265,0.000063166255,0.00009031953,0.00037035602,0.00007035836,0.00018675468,0.00008521117,0.00081985065,0.0000033684469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006322467,0.00003864701,0.0013682777,0.0000036575057,0.000030555468,0.0000029951816,0.00015020205,0.00023067291,0.0020083913,0.9956789,0.00026686655,0.00021449378],"study_design_scores_gemma":[0.00033391867,0.000092620554,0.000391121,0.0000100357565,0.000018349538,0.00063946866,0.000009163704,0.001428669,0.002688952,0.99230236,0.0020115431,0.0000737824],"about_ca_topic_score_codex":0.000017393955,"about_ca_topic_score_gemma":0.0000053728513,"teacher_disagreement_score":0.033344753,"about_ca_system_score_codex":0.000042459178,"about_ca_system_score_gemma":0.00042281995,"threshold_uncertainty_score":0.35618886},"labels":[],"label_agreement":null},{"id":"W1947634890","doi":"10.37236/5483","title":"Avoidability Index for Binary Patterns with Reversal","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Universities Space Research Association","keywords":"Index (typography); Binary number; Mathematics; Computer science; World Wide Web; Arithmetic","score_opus":0.007817291661901503,"score_gpt":0.23007325315529695,"score_spread":0.22225596149339544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947634890","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.15617797,0.0015934301,0.8366438,0.0037162558,0.0012906431,0.00042277627,0.000008630678,0.000053344676,0.000093113915],"genre_scores_gemma":[0.99890494,0.00033426948,0.00014554571,0.00014558171,0.00025763724,0.000022098717,0.0000012895575,0.00003069003,0.00015791845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743265,0.00028815272,0.0005782856,0.0003453533,0.00061751145,0.000738041],"domain_scores_gemma":[0.9964358,0.0006756604,0.0011271969,0.0011577825,0.00049624615,0.00010730517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029451768,0.0003270903,0.00053820084,0.00014651456,0.00016881774,0.00015792777,0.0034619628,0.00019853722,0.0000054828774],"category_scores_gemma":[0.000094603085,0.00017293292,0.00030555518,0.00020625586,0.00009218165,0.00029392625,0.0007817279,0.0015272293,0.0000022025717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025929368,0.000267193,0.0014364097,0.00015006548,0.0003588656,0.000023005798,0.00042589396,0.00016958635,0.00008230736,0.9918585,0.0011920913,0.0037767943],"study_design_scores_gemma":[0.0012046268,0.0011844978,0.0010824292,0.00027738302,0.00007142211,0.00017074794,0.000035945483,0.0021106766,0.0004734279,0.9914491,0.0016543731,0.00028532973],"about_ca_topic_score_codex":0.000006373114,"about_ca_topic_score_gemma":0.0000032877665,"teacher_disagreement_score":0.842727,"about_ca_system_score_codex":0.0006945605,"about_ca_system_score_gemma":0.0017264943,"threshold_uncertainty_score":0.7052},"labels":[],"label_agreement":null},{"id":"W1947791825","doi":"10.37236/85","title":"Character Polynomials, their q-Analogs and the Kronecker Product","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Kronecker product; Kronecker delta; Mathematics; Character (mathematics); Product (mathematics); Algebra over a field; Computation; Simplicity; Pure mathematics; Combinatorics; Relation (database); Orthogonal polynomials; Algorithm; Computer science","score_opus":0.014787503170240624,"score_gpt":0.2665904366547461,"score_spread":0.25180293348450544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1947791825","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.9278463,0.018299296,0.014320593,0.033019584,0.0022877934,0.0015260346,0.0000027671238,0.0000833097,0.0026143377],"genre_scores_gemma":[0.99745125,0.0012663987,0.00012393555,0.00026133528,0.00044151468,0.0000048095185,3.0391615e-7,0.00003533554,0.0004151262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997375,0.0003855371,0.00086019514,0.0001723095,0.0005431154,0.000663817],"domain_scores_gemma":[0.9963912,0.0014056212,0.0010982133,0.000674728,0.00034185336,0.000088393484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037726315,0.00031055138,0.000721991,0.00009268759,0.00027624986,0.00008661732,0.0008813969,0.00008010219,0.000011181411],"category_scores_gemma":[0.0012783719,0.00014752573,0.00023152419,0.0003581095,0.00023295965,0.00024668316,0.000083416475,0.0012266976,0.00000559233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002051297,0.00018259331,0.000008711793,0.000010618186,0.00014283141,0.0000034421325,0.0010529258,0.0000016774557,0.00026625046,0.99581593,0.0007743944,0.0015354787],"study_design_scores_gemma":[0.0025355846,0.00041395467,0.00008960743,0.00003833051,0.00021114195,0.0004407634,0.00018160878,0.00004320393,0.0015309248,0.98831105,0.0060282503,0.00017557772],"about_ca_topic_score_codex":0.0000011207981,"about_ca_topic_score_gemma":9.740357e-7,"teacher_disagreement_score":0.069604956,"about_ca_system_score_codex":0.00023927391,"about_ca_system_score_gemma":0.00027406233,"threshold_uncertainty_score":0.6015925},"labels":[],"label_agreement":null},{"id":"W1951580418","doi":"10.37236/3571","title":"The Range of a Random Walk on a Comb","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Hungarian Scientific Research Fund; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Random walk; Graph; Integer (computer science); Discrete mathematics; Statistics","score_opus":0.014843352358863398,"score_gpt":0.27133293653881696,"score_spread":0.25648958417995354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951580418","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.18047942,0.008563066,0.79711807,0.0072362656,0.0014733046,0.0012356589,0.0000053700023,0.000037235568,0.0038515897],"genre_scores_gemma":[0.99897677,0.00053413666,0.00006956302,0.000067173576,0.00005728377,0.000010822801,8.3033605e-8,0.00001909519,0.0002650908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822813,0.00013485666,0.0005764501,0.00006845793,0.00055886555,0.00043322955],"domain_scores_gemma":[0.9939353,0.00464792,0.00058939605,0.00028303402,0.00047794293,0.00006639418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014845238,0.00013761842,0.00036465665,0.000040985622,0.00017278659,0.00003825312,0.00062753604,0.000053335385,0.000029464418],"category_scores_gemma":[0.00220338,0.00006450592,0.00014599224,0.00022758968,0.00007878259,0.000053165175,0.000041051302,0.0006352243,0.000012299134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020949439,0.00013733571,0.0000027700119,0.000024608322,0.00009809509,0.000001599046,0.00016574835,0.000002599869,0.000041256277,0.99539876,0.0020990605,0.001818689],"study_design_scores_gemma":[0.0020566208,0.0011560316,0.000017452705,0.000054065855,0.000098890065,0.00006124032,0.00016848359,0.0008752061,0.00034217752,0.9943722,0.000724404,0.00007323113],"about_ca_topic_score_codex":0.0000050442322,"about_ca_topic_score_gemma":0.0000023407356,"teacher_disagreement_score":0.8184973,"about_ca_system_score_codex":0.000107971835,"about_ca_system_score_gemma":0.0002276013,"threshold_uncertainty_score":0.27597687},"labels":[],"label_agreement":null},{"id":"W1953770551","doi":"10.37236/550","title":"Hamiltonicity of $k$-Traceable Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Graph; Path (computing); Vertex (graph theory); Induced path; Integer (computer science); Discrete mathematics; Longest path problem; Shortest path problem; Computer science","score_opus":0.02183922895665276,"score_gpt":0.2527308645314063,"score_spread":0.23089163557475356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953770551","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.41773978,0.0075512137,0.56793815,0.00032291736,0.0005982402,0.00020211794,5.525454e-7,0.00003809318,0.0056089587],"genre_scores_gemma":[0.9984186,0.0008329661,0.00053691963,0.00002737042,0.000012587523,0.0000014380431,4.71239e-8,0.000010491299,0.00015954285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979584,0.00024851278,0.00045246654,0.00012479191,0.00060176715,0.0006140272],"domain_scores_gemma":[0.99805206,0.00023565604,0.00051029655,0.0006226251,0.0004899693,0.00008937272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025072244,0.00012473077,0.00027119217,0.00021429636,0.000117584925,0.000020260546,0.0026246605,0.0000508844,0.00001275603],"category_scores_gemma":[0.00011872837,0.0000835074,0.0001815055,0.0010841959,0.00017171657,0.00048084988,0.00019666737,0.00082356634,0.000004879744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048803406,0.00016267782,0.00033920986,0.000007200082,0.0000619392,0.0000074897553,0.0005370694,0.000019822644,0.00061714236,0.99734503,0.00005895389,0.0007946763],"study_design_scores_gemma":[0.00044432937,0.0008600932,0.0006039864,0.000015646927,0.000014117694,0.000136231,0.00005257505,0.00019345924,0.023491887,0.97369134,0.00041270725,0.00008364842],"about_ca_topic_score_codex":0.00000877927,"about_ca_topic_score_gemma":0.0000023596142,"teacher_disagreement_score":0.5806789,"about_ca_system_score_codex":0.00012303157,"about_ca_system_score_gemma":0.0004832663,"threshold_uncertainty_score":0.48773158},"labels":[],"label_agreement":null},{"id":"W1956715345","doi":"10.37236/3000","title":"Permutations Destroying Arithmetic Structure","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Permutation (music); Abelian group; Arithmetic progression; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.040530509911866554,"score_gpt":0.30660721040063416,"score_spread":0.2660767004887676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956715345","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.9823203,0.0021908376,0.013340265,0.00043371553,0.0008903999,0.000109675624,0.0000016656489,0.000021331596,0.00069177477],"genre_scores_gemma":[0.9993063,0.000057948953,0.00024894456,0.000060862505,0.0001726858,8.887566e-7,4.2248104e-7,0.000023842129,0.00012810365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984209,0.00019663264,0.0004013141,0.000078263576,0.0004997285,0.00040319652],"domain_scores_gemma":[0.99845326,0.00037794694,0.0004139895,0.00027491682,0.00037046755,0.00010942367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170444,0.00013912693,0.00025512438,0.0001137418,0.00020260962,0.00004122488,0.0005699043,0.00007389705,0.000012059116],"category_scores_gemma":[0.000720327,0.00008642218,0.0001283433,0.0003232103,0.00011585704,0.00012518295,0.00006639376,0.0008591039,9.636757e-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.000026573798,0.000032705128,0.00020298063,0.0000066257585,0.000093434704,0.000009215506,0.0018052108,0.00006722522,0.000042648528,0.9967791,0.00065551867,0.0002787808],"study_design_scores_gemma":[0.00070837454,0.0002908381,0.00019208585,0.000013822469,0.00013439114,0.0006761261,0.0006331656,0.00006168586,0.00023356079,0.9956241,0.0013308582,0.00010094561],"about_ca_topic_score_codex":0.0000016371765,"about_ca_topic_score_gemma":0.0000024925437,"teacher_disagreement_score":0.016985966,"about_ca_system_score_codex":0.0002539152,"about_ca_system_score_gemma":0.00042302866,"threshold_uncertainty_score":0.37324268},"labels":[],"label_agreement":null},{"id":"W2099300815","doi":"10.37236/500","title":"Asymptotic Enumeration of Labelled Graphs by Genus","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Genus; Bivariate analysis; Surface (topology); Discrete mathematics; Geometry; Statistics","score_opus":0.02782625941167506,"score_gpt":0.26156534403851905,"score_spread":0.233739084626844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099300815","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.15124488,0.003330075,0.8436323,0.00011493875,0.0004391803,0.00018365675,0.000005057082,0.000014992425,0.0010349331],"genre_scores_gemma":[0.99907535,0.0003248727,0.00043099953,0.000023182038,0.000020016912,0.0000021843157,4.883105e-7,0.000018284873,0.00010461733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858975,0.000080531936,0.00054574164,0.000073831085,0.0003854465,0.00032470608],"domain_scores_gemma":[0.99829525,0.00048677452,0.0006015243,0.00018424181,0.00037140958,0.000060819944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008647822,0.00012320394,0.00031059163,0.000059964663,0.000073251256,0.000009206788,0.0003789067,0.00006386502,0.00004715146],"category_scores_gemma":[0.00070164056,0.000081934035,0.000096788564,0.00027124377,0.000044579072,0.00006818474,0.000028121687,0.00039795396,0.0000029860107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007045963,0.00022806319,0.000010670854,0.000034583,0.00010371596,0.0000022805514,0.00044681912,5.8436876e-7,0.0004691877,0.99734,0.00075733924,0.00053625926],"study_design_scores_gemma":[0.0006609924,0.0010499744,0.0000097793545,0.000028023831,0.00017711864,0.00006807202,0.00009051371,0.00027149718,0.0064057843,0.9910137,0.00014032991,0.00008422268],"about_ca_topic_score_codex":0.0000041186454,"about_ca_topic_score_gemma":0.000001338263,"teacher_disagreement_score":0.8478305,"about_ca_system_score_codex":0.00007890902,"about_ca_system_score_gemma":0.00020965959,"threshold_uncertainty_score":0.3341173},"labels":[],"label_agreement":null},{"id":"W2099497492","doi":"10.37236/841","title":"On Subsequence Sums of a Zero-sum Free Sequence II","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Subsequence; Mathematics; Combinatorics; Zero (linguistics); Longest increasing subsequence; Sequence (biology); Exponent; Abelian group; Group (periodic table); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.011784111557570576,"score_gpt":0.198925030962174,"score_spread":0.18714091940460342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099497492","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.99092776,0.0040045395,0.0026814835,0.000083093364,0.00062467734,0.00008600428,0.000002180426,0.000034501263,0.001555742],"genre_scores_gemma":[0.9986788,0.0010827378,0.0000041177004,0.000019084619,0.000040874722,0.0000021840353,2.9914546e-7,0.000023675448,0.00014820011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998529,0.00010144196,0.00045315627,0.00007299342,0.00041074952,0.0004326323],"domain_scores_gemma":[0.99899167,0.00016718089,0.0002283908,0.00040649725,0.00014088351,0.00006536387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081648864,0.00015891375,0.00030713293,0.00011189004,0.00014829077,0.0000068001023,0.00082249445,0.00007163182,0.000009155291],"category_scores_gemma":[0.00008385517,0.00011362793,0.00015141146,0.00042033172,0.00011847722,0.00012710935,0.000030687388,0.0007108577,0.0000049063756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005233192,0.000052934392,0.0001339132,0.000027805174,0.00011196548,0.000029748215,0.00058714254,0.0030166525,0.0123929735,0.98249465,0.0010349131,0.000064951324],"study_design_scores_gemma":[0.00080732093,0.0010768883,0.00015066766,0.00009609305,0.000036491765,0.00093788386,0.00005672516,0.00036875467,0.036359232,0.9589149,0.0010246749,0.00017036291],"about_ca_topic_score_codex":0.000005522213,"about_ca_topic_score_gemma":0.0000017650328,"teacher_disagreement_score":0.02396626,"about_ca_system_score_codex":0.00021583513,"about_ca_system_score_gemma":0.00016510405,"threshold_uncertainty_score":0.46336126},"labels":[],"label_agreement":null},{"id":"W2100090688","doi":"10.37236/3285","title":"Packing Tree Factors in Random and Pseudo-Random Graphs","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"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":"Israel Science Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Random graph; Random regular graph; Graph; Divisibility rule; Discrete mathematics; 1-planar graph; Chordal graph","score_opus":0.011325572189483928,"score_gpt":0.2509437857393936,"score_spread":0.23961821354990964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100090688","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.992944,0.0014539876,0.0036743463,0.0001708845,0.0004183966,0.00013689067,3.4552068e-7,0.000012751494,0.0011884035],"genre_scores_gemma":[0.9990609,0.00072746177,0.000027615255,0.000040840507,0.00006570661,0.0000013738121,1.871014e-7,0.000024474944,0.000051429794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809456,0.00042723108,0.0005377748,0.00010996956,0.0003530881,0.00047740698],"domain_scores_gemma":[0.9970736,0.0020658607,0.0004396787,0.00025520442,0.0000952103,0.00007042735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029783281,0.00019562563,0.0005099674,0.00019972186,0.00020284406,0.000039746654,0.00041997794,0.000098015626,0.0000074248474],"category_scores_gemma":[0.00077145745,0.00011136075,0.00017592766,0.00028990218,0.00011479531,0.00011821397,0.000063578285,0.00090972526,2.2705981e-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.00023646967,0.000047795325,0.0043188506,0.000018432413,0.00008130856,0.0000025514355,0.0013693387,0.000005073162,0.000092317496,0.9931581,0.000071078015,0.0005986571],"study_design_scores_gemma":[0.005544504,0.00029416406,0.0015948425,0.000042985837,0.000088538596,0.00009673419,0.00022806953,0.00007394618,0.00048387566,0.9909665,0.00045329003,0.00013257047],"about_ca_topic_score_codex":0.000004867328,"about_ca_topic_score_gemma":0.00001827444,"teacher_disagreement_score":0.0061169164,"about_ca_system_score_codex":0.00008912009,"about_ca_system_score_gemma":0.000082069215,"threshold_uncertainty_score":0.45411596},"labels":[],"label_agreement":null},{"id":"W2100702681","doi":"10.37236/775","title":"The Map Asymptotics Constant $t_g$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Recursion (computer science); Mathematics; Constant (computer programming); Combinatorics; Variety (cybernetics); Genus; Surface (topology); Pure mathematics; Geometry; Algorithm; Statistics","score_opus":0.024987830748915797,"score_gpt":0.27724561722927316,"score_spread":0.25225778648035735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100702681","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.019690711,0.0087864045,0.9634073,0.0036372787,0.0017695335,0.000283487,0.0000041877374,0.00003857863,0.0023825164],"genre_scores_gemma":[0.99706846,0.0018163814,0.00023819417,0.00008532172,0.00013173184,0.0000027128058,1.8294708e-7,0.000026104097,0.00063091627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978779,0.00010820817,0.0006118182,0.00008923732,0.00067245675,0.0006404038],"domain_scores_gemma":[0.99549186,0.0030728362,0.0005258093,0.00031676592,0.00049305044,0.00009966006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014081183,0.00016848026,0.00030828427,0.000036032452,0.00060403306,0.00003928133,0.0007430823,0.00006737664,0.000012639368],"category_scores_gemma":[0.0018217735,0.00008530006,0.00013359931,0.00025213158,0.00019305105,0.00005939185,0.000067434645,0.00089325313,0.000013930106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005867165,0.00008620109,0.000006154254,0.000013812296,0.00009573832,0.000026342115,0.0001843701,0.0000037753377,0.00001754271,0.9948183,0.0043476815,0.00034141954],"study_design_scores_gemma":[0.00058979896,0.00059560366,0.00000612705,0.000025907155,0.000100322446,0.0010457429,0.00019576133,0.00056483975,0.00020442763,0.9886928,0.007868715,0.00010990945],"about_ca_topic_score_codex":9.137931e-7,"about_ca_topic_score_gemma":0.0000023815328,"teacher_disagreement_score":0.9773778,"about_ca_system_score_codex":0.00022766204,"about_ca_system_score_gemma":0.00076950394,"threshold_uncertainty_score":0.46457952},"labels":[],"label_agreement":null},{"id":"W2102196430","doi":"10.37236/1498","title":"Composition sum identities related to the distribution of coordinate values in a discrete simplex","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Bijection; Simplex; Combinatorics; Parameterized complexity; Bounded function; Algebraic number; Integer (computer science); Order (exchange); Class (philosophy); Exponential function; Distribution (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.0029624258169966017,"score_gpt":0.2030677088282066,"score_spread":0.20010528301121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102196430","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.9952264,0.0022917553,0.0014231014,0.00028352323,0.00025316598,0.00013261888,0.000005288382,0.000017764856,0.00036639682],"genre_scores_gemma":[0.9993428,0.00048118472,4.2141542e-7,0.000007781291,0.000020333779,0.0000032566234,0.000004621429,0.000012491161,0.00012711942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878305,0.00020818305,0.00045352365,0.00004851567,0.00021825384,0.00028849574],"domain_scores_gemma":[0.9995376,0.00009712701,0.00010981255,0.00015750832,0.0000674524,0.000030498008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011636951,0.00010350791,0.00020769208,0.0000623791,0.000085056956,0.000023360573,0.00032608263,0.000045244335,0.000022312468],"category_scores_gemma":[0.0000134738575,0.000065654465,0.000096972784,0.0004977116,0.000041711184,0.00012556909,0.0000119212045,0.00041336234,0.0000060800207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018954127,0.0000828154,0.00039695067,0.000048156126,0.00024616587,0.000009037285,0.002207236,0.065633066,0.0015379762,0.9271847,0.0008785751,0.0015857669],"study_design_scores_gemma":[0.0009783542,0.00043089798,0.0040074284,0.00014015877,0.000085770844,0.0001944047,0.000520516,0.0036114997,0.006264936,0.98126763,0.0023259472,0.00017245131],"about_ca_topic_score_codex":0.000008031623,"about_ca_topic_score_gemma":0.000002938932,"teacher_disagreement_score":0.06202157,"about_ca_system_score_codex":0.00017656902,"about_ca_system_score_gemma":0.000027483064,"threshold_uncertainty_score":0.26773113},"labels":[],"label_agreement":null},{"id":"W2103213553","doi":"10.37236/652","title":"Quantum Walks on Regular Graphs and Eigenvalues","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"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 Waterloo","funders":"","keywords":"Quantum walk; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Spectrum (functional analysis); Stochastic matrix; Strongly regular graph; Matrix (chemical analysis); Quantum; Discrete mathematics; Random walk; Graph; Quantum algorithm; Pathwidth; Line graph; Quantum mechanics; Markov chain; Physics","score_opus":0.011295949816812496,"score_gpt":0.2079735669755661,"score_spread":0.1966776171587536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103213553","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.9016551,0.005185573,0.09024865,0.0012461295,0.0008998351,0.00009991737,2.2269195e-7,0.000063372754,0.00060120766],"genre_scores_gemma":[0.9989011,0.00049916154,0.0003476982,0.00015064063,0.00004560071,6.2162803e-7,5.9337562e-8,0.000011458192,0.000043618264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850786,0.00016674734,0.00029995854,0.00016141403,0.00038801334,0.0004760184],"domain_scores_gemma":[0.9989409,0.00014289473,0.00030054283,0.00040129773,0.00012222677,0.00009217073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011968799,0.00015867625,0.00022090894,0.00014397624,0.00022127302,0.00006364048,0.001136604,0.00005108974,0.0000019191273],"category_scores_gemma":[0.00004090658,0.000096754,0.00011049044,0.00037996942,0.00008052729,0.00013345489,0.00013536388,0.000751551,0.0000030119947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001750161,0.00007869662,0.000057294306,0.000003637874,0.000044480043,0.000017783817,0.0010346276,0.00003996841,0.000061772655,0.99191946,0.00014830945,0.006576442],"study_design_scores_gemma":[0.000377294,0.0015541391,0.0011304432,0.00003035834,0.000017790977,0.00040680228,0.000034315734,0.012455368,0.0012592445,0.98172694,0.0008803905,0.00012688119],"about_ca_topic_score_codex":0.00000648176,"about_ca_topic_score_gemma":5.3255513e-7,"teacher_disagreement_score":0.09724605,"about_ca_system_score_codex":0.000054198248,"about_ca_system_score_gemma":0.00016365969,"threshold_uncertainty_score":0.39455137},"labels":[],"label_agreement":null},{"id":"W2103626912","doi":"10.37236/278","title":"Large Bounded Degree Trees in Expanding Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"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 Waterloo","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Mathematics; Bounded function; Combinatorics; Degree (music); Embedding; Dense graph; Random graph; Discrete mathematics; Graph; Spanning tree; Spectral gap; 1-planar graph; Chordal graph; Computer science","score_opus":0.01994977074148044,"score_gpt":0.29448391381877775,"score_spread":0.2745341430772973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103626912","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.99485815,0.0008170702,0.0010568867,0.00020599471,0.0010970988,0.00010395078,7.285439e-7,0.00001552205,0.001844617],"genre_scores_gemma":[0.9993958,0.00023864211,0.000055011405,0.00004671391,0.00010399718,0.000002029495,2.090396e-7,0.000025500123,0.00013208597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982143,0.00015206964,0.0005079175,0.00009788157,0.00039357625,0.0006342765],"domain_scores_gemma":[0.9984417,0.00060961215,0.00041340847,0.00034922292,0.00012130652,0.00006474091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026971686,0.0001675557,0.00032951345,0.00022995722,0.00026597138,0.00004149857,0.00072156946,0.00011915826,0.00003698967],"category_scores_gemma":[0.00046786442,0.000102930775,0.00018998835,0.00042193325,0.00009280108,0.00014228393,0.00008341784,0.0017960508,9.5050814e-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.000054603457,0.00011988339,0.0016122081,0.0000071394556,0.00005874528,0.000010802298,0.0012697072,6.61981e-7,0.00072724273,0.9957668,0.00016463801,0.00020754604],"study_design_scores_gemma":[0.00125639,0.00019035552,0.001249818,0.00002105971,0.00004701947,0.00020902374,0.00036248416,0.000014772216,0.001137078,0.9940065,0.0013817698,0.00012370238],"about_ca_topic_score_codex":0.000002578086,"about_ca_topic_score_gemma":0.00015347783,"teacher_disagreement_score":0.0045376797,"about_ca_system_score_codex":0.00010730925,"about_ca_system_score_gemma":0.00017651008,"threshold_uncertainty_score":0.7803047},"labels":[],"label_agreement":null},{"id":"W2104397519","doi":"10.37236/2921","title":"The Capture Time of the Hypercube","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Combinatorics; Graph; Mathematics; Discrete mathematics","score_opus":0.011257930311298856,"score_gpt":0.25731674485433814,"score_spread":0.2460588145430393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104397519","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.961322,0.012648543,0.003688768,0.01014636,0.0013423376,0.0006860714,0.0000015669732,0.000019740244,0.010144577],"genre_scores_gemma":[0.9933316,0.0006060622,0.000064740154,0.00011379318,0.000102382626,0.000004594905,6.578676e-8,0.000023839812,0.005752886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980259,0.00049426814,0.00049509865,0.00006625848,0.0004930785,0.00042542623],"domain_scores_gemma":[0.9968634,0.0014220297,0.00065675256,0.0005571298,0.00045083757,0.000049830764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002810583,0.00014239499,0.00029109526,0.000028030356,0.00022573514,0.000034497232,0.001091027,0.000078119185,0.000020269663],"category_scores_gemma":[0.0008098973,0.00005510817,0.00027824176,0.0002691402,0.00013354348,0.00007193027,0.00010564332,0.0008785805,5.9393045e-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.00002415254,0.00009318569,0.000052927397,0.000018816543,0.0001674234,8.982746e-7,0.0007976874,0.0000054863326,0.0022883748,0.9748819,0.019826062,0.0018430944],"study_design_scores_gemma":[0.00047401641,0.00020034683,0.000115209594,0.00003809605,0.00012989304,0.00016374358,0.0005577296,0.00021267659,0.0029387039,0.98042613,0.014645984,0.000097465985],"about_ca_topic_score_codex":0.000013126286,"about_ca_topic_score_gemma":0.0000058775845,"teacher_disagreement_score":0.0320096,"about_ca_system_score_codex":0.0001553105,"about_ca_system_score_gemma":0.0003026595,"threshold_uncertainty_score":0.3817044},"labels":[],"label_agreement":null},{"id":"W2104925482","doi":"10.37236/1495","title":"Restricted permutations, continued fractions, and Chebyshev polynomials","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":77,"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":"Combinatorics; Mathematics; Chebyshev polynomials; Discrete mathematics; Mathematical analysis","score_opus":0.016269772135018186,"score_gpt":0.2823365822993558,"score_spread":0.26606681016433764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104925482","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.9850316,0.002996201,0.0038039035,0.0024517893,0.00025710685,0.00026407055,0.0000034837778,0.000036071946,0.0051557934],"genre_scores_gemma":[0.9934191,0.0016947355,0.0001226931,0.00008797296,0.00016620284,0.0000061837577,7.8752817e-7,0.000022854265,0.004479473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983469,0.00021712873,0.00067472196,0.00009710406,0.00029520015,0.00036894472],"domain_scores_gemma":[0.99766946,0.0014098479,0.00038769355,0.00025778322,0.0001801612,0.00009502798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001427,0.00015238831,0.00037157012,0.000102367834,0.0002594151,0.00006913804,0.00024072426,0.000088631874,0.0006040618],"category_scores_gemma":[0.00071579526,0.000100838064,0.0001194186,0.0003272456,0.00006942418,0.00015666717,0.000017351927,0.0005891555,0.000022760076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010402679,0.0002393322,0.000063078885,0.000024002224,0.00016087986,0.000003930438,0.00044841153,0.000004705458,0.00034713393,0.98297876,0.012966224,0.0026594894],"study_design_scores_gemma":[0.0009262197,0.0002919552,0.00032984762,0.00003377319,0.00020122292,0.00037440233,0.00022470829,0.00006677377,0.00042775227,0.961982,0.03501363,0.00012767542],"about_ca_topic_score_codex":0.0000082293,"about_ca_topic_score_gemma":0.0000034156133,"teacher_disagreement_score":0.022047408,"about_ca_system_score_codex":0.0001327533,"about_ca_system_score_gemma":0.00024480524,"threshold_uncertainty_score":0.6614053},"labels":[],"label_agreement":null},{"id":"W2105335308","doi":"10.37236/1074","title":"Tilings of the Sphere with Right Triangles I: The Asymptotically Right Families","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Tile; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Spherical trigonometry; Geometry; Pure mathematics; Computer science","score_opus":0.002305915727975238,"score_gpt":0.16949124276119906,"score_spread":0.16718532703322384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105335308","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.989198,0.005220358,0.0004491844,0.0021530886,0.00039334822,0.00015982235,0.000002243351,0.000009406009,0.0024144948],"genre_scores_gemma":[0.99894387,0.00015352595,0.000014647156,0.00007677032,0.00013995358,0.000001456353,1.657872e-7,0.0000146638595,0.0006549619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981722,0.00026151162,0.00043934345,0.0000947758,0.0006197599,0.00041237695],"domain_scores_gemma":[0.9986249,0.00022911072,0.00053216063,0.0003307067,0.00025515226,0.000027965632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010449341,0.00015850218,0.00026820492,0.00002080469,0.00034474113,0.00007865692,0.001051384,0.000055386354,0.0001130399],"category_scores_gemma":[0.000050466235,0.000051006486,0.00013856422,0.0002786998,0.00043111213,0.00011184055,0.00007119725,0.00048018273,0.000003036651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041569592,0.00010680802,0.00034648823,0.00002804962,0.000060385253,0.000006858298,0.0004500058,0.0006389933,0.048018016,0.9483158,0.0013876833,0.0002252278],"study_design_scores_gemma":[0.0010004498,0.0008465298,0.0015720878,0.00007448115,0.00015095071,0.00042096907,0.00027769315,0.00003562111,0.23520635,0.7373253,0.022936124,0.00015342796],"about_ca_topic_score_codex":0.00008989709,"about_ca_topic_score_gemma":0.00012072702,"teacher_disagreement_score":0.21099047,"about_ca_system_score_codex":0.00010203123,"about_ca_system_score_gemma":0.00038648758,"threshold_uncertainty_score":0.2651505},"labels":[],"label_agreement":null},{"id":"W2105749797","doi":"10.37236/831","title":"Distinct Distances in Graph Drawings","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Mathematics; Treewidth; 1-planar graph; Bounded function; Pathwidth; Discrete mathematics; Bipartite graph; Indifference graph; Partial k-tree; Chordal graph; Clique-sum; Degree (music); Tree-depth; Graph; Line graph","score_opus":0.008631698698195259,"score_gpt":0.2169544812141173,"score_spread":0.20832278251592207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105749797","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.51771504,0.0030669132,0.47717607,0.0011386484,0.000444724,0.000046414345,1.0621926e-7,0.000011073869,0.00040098836],"genre_scores_gemma":[0.9992006,0.0004160725,0.00011577056,0.000061633975,0.000068022135,0.0000011592975,3.2569534e-7,0.0000034944585,0.00013296417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888086,0.000092264956,0.00029978037,0.00008904526,0.00036926533,0.0002687522],"domain_scores_gemma":[0.99927884,0.0001680489,0.00021906642,0.00015121605,0.00014448309,0.000038360802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007500495,0.00007951408,0.0001358248,0.00014798988,0.00015422593,0.000035279958,0.0006925002,0.000022942839,0.0000018636941],"category_scores_gemma":[0.00006363196,0.000055145232,0.0000716399,0.0009705054,0.000041719184,0.00034876296,0.000045864508,0.0003411156,0.0000025510722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013305564,0.00009192715,0.0013533189,0.0000024540084,0.000014083415,0.000024024106,0.0005086887,0.0008024252,0.000071527094,0.9951892,0.00035936263,0.0015696787],"study_design_scores_gemma":[0.0005837782,0.0002936207,0.014844175,0.00001219182,0.000005536926,0.0004772936,0.000019330384,0.0024383524,0.0005345364,0.97563106,0.005056951,0.00010315633],"about_ca_topic_score_codex":0.000003836742,"about_ca_topic_score_gemma":0.000007521596,"teacher_disagreement_score":0.48148552,"about_ca_system_score_codex":0.0001414689,"about_ca_system_score_gemma":0.0003779353,"threshold_uncertainty_score":0.22487572},"labels":[],"label_agreement":null},{"id":"W2106108365","doi":"10.37236/2264","title":"Perfect 1-Factorisations of Circulants with Small Degree","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Circulant matrix; Combinatorics; Factorization; Degree (music); Trivially perfect graph; Circulant graph; Discrete mathematics; Graph; Chordal graph; Line graph; 1-planar graph; Algorithm","score_opus":0.011802458463249732,"score_gpt":0.16899199817899188,"score_spread":0.15718953971574215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106108365","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.98514926,0.0022615285,0.010473274,0.000039873685,0.00030633245,0.00012365368,4.6283677e-7,0.000021904098,0.0016236914],"genre_scores_gemma":[0.99968493,0.00018570598,0.0000072390835,0.0000044284443,0.000041863266,0.000004041295,3.1353116e-7,0.000020279625,0.000051205796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910015,0.000075684016,0.00029004476,0.000043113014,0.0001974859,0.00029352505],"domain_scores_gemma":[0.9993047,0.00012011977,0.00016142301,0.00019047559,0.00017325656,0.000050011113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004379941,0.00011177973,0.00021732839,0.00008320424,0.000052649764,0.00001787633,0.000307671,0.00004445211,0.000023637751],"category_scores_gemma":[0.00001777158,0.00006790877,0.00008382793,0.0002620224,0.000037177655,0.00010726584,0.00000809797,0.0004046798,0.000008239464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066928485,0.0002217718,0.010266759,0.0001914361,0.0012756241,0.000009402729,0.002491825,0.0064860913,0.017014576,0.9571678,0.00081810274,0.0039896695],"study_design_scores_gemma":[0.003357071,0.002679807,0.03011513,0.00030538047,0.00043071955,0.0012900103,0.0016209537,0.0024279766,0.026858887,0.9266252,0.003598164,0.0006907355],"about_ca_topic_score_codex":0.000011779158,"about_ca_topic_score_gemma":0.000004969729,"teacher_disagreement_score":0.030542647,"about_ca_system_score_codex":0.00010660822,"about_ca_system_score_gemma":0.00009223392,"threshold_uncertainty_score":0.27692392},"labels":[],"label_agreement":null},{"id":"W2108020523","doi":"10.37236/351","title":"On the Possible Orders of a Basis for a Finite Cyclic Group","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Mathematics; Combinatorics; Basis (linear algebra); Cyclic group; Order (exchange); Integer (computer science); Group (periodic table); Constant (computer programming); Graph; Discrete mathematics; Geometry","score_opus":0.014115936398471156,"score_gpt":0.2691865574192624,"score_spread":0.25507062102079125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108020523","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.9903806,0.00029787736,0.005799156,0.0012602773,0.0007991137,0.00029179564,0.000003523076,0.000010090408,0.0011576051],"genre_scores_gemma":[0.9993758,0.00010227656,0.00010614485,0.000159759,0.00009273708,0.000007205971,1.9807015e-7,0.000026663407,0.00012922383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985973,0.00013237764,0.00043951513,0.000081322,0.00035787723,0.000391578],"domain_scores_gemma":[0.99372107,0.0049606166,0.00061769603,0.00043366218,0.00022491688,0.00004201513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023820861,0.00014874862,0.00029066933,0.00010027437,0.00029086124,0.000022349857,0.0008046996,0.000090049456,0.00003692677],"category_scores_gemma":[0.0019442897,0.00007138445,0.000287107,0.00028479964,0.00014737301,0.000055150544,0.000049275415,0.0010173549,5.752128e-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.00016111137,0.00011869063,0.000030622803,0.00002194289,0.00015240604,5.9194394e-7,0.0005764843,0.0000066680946,0.00062839495,0.99714804,0.00090723264,0.00024783835],"study_design_scores_gemma":[0.0006713745,0.0008341821,0.000058256333,0.000029453908,0.00011777205,0.000038739763,0.00016319074,0.000084928535,0.0022666554,0.9939577,0.0016930449,0.000084716565],"about_ca_topic_score_codex":0.0000022898803,"about_ca_topic_score_gemma":0.000009118193,"teacher_disagreement_score":0.008995229,"about_ca_system_score_codex":0.00005166549,"about_ca_system_score_gemma":0.00015631082,"threshold_uncertainty_score":0.44199574},"labels":[],"label_agreement":null},{"id":"W2109104984","doi":"10.37236/1545","title":"Hadamard Matrices and Strongly Regular Graphs with the $3$-e.c. Adjacency Property","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"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 Lethbridge; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Strongly regular graph; Adjacency matrix; Two-graph; Hadamard transform; Chordal graph; Discrete mathematics; Hadamard matrix; Graph; Pathwidth; Line graph; Graph power","score_opus":0.0025382133385621055,"score_gpt":0.15605113986195523,"score_spread":0.15351292652339313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109104984","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.9718133,0.024201026,0.00035440834,0.0005541504,0.0001525578,0.00017769403,6.3401563e-7,0.000041127638,0.0027050513],"genre_scores_gemma":[0.9959457,0.0031678467,0.000002960502,0.000017191707,0.000052176827,0.000004497706,2.0340116e-7,0.000025684238,0.00078377227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883777,0.00013543379,0.00024660007,0.00007486449,0.00030002565,0.00040529156],"domain_scores_gemma":[0.9994567,0.00007495151,0.0001039716,0.00023568569,0.0000715374,0.000057159723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086851435,0.00016398629,0.00021382346,0.00005587083,0.00018498872,0.00006076944,0.00041918567,0.00004745471,0.000025367435],"category_scores_gemma":[0.0000047601757,0.00006576413,0.000072490904,0.0003732647,0.00009596795,0.00016346315,0.000010052436,0.00060035917,0.0000037462007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049950037,0.00014169174,0.0010955533,0.00014120052,0.0010639145,0.00004005595,0.0022106874,0.007585478,0.00090270175,0.9646654,0.0066699814,0.014983799],"study_design_scores_gemma":[0.0043691196,0.003875505,0.0027581735,0.00032902177,0.00077464257,0.0035131287,0.002553973,0.0021599147,0.0028032898,0.7217638,0.25411993,0.000979523],"about_ca_topic_score_codex":0.0000046902196,"about_ca_topic_score_gemma":0.0000062784684,"teacher_disagreement_score":0.24744995,"about_ca_system_score_codex":0.00006412111,"about_ca_system_score_gemma":0.0000680438,"threshold_uncertainty_score":0.26817834},"labels":[],"label_agreement":null},{"id":"W2109725035","doi":"10.37236/401","title":"List Coloring Hypergraphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":21,"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 California, Los Angeles; National Science Foundation","keywords":"Combinatorics; Hypergraph; Mathematics; Chromatic scale; Discrete mathematics","score_opus":0.010698217182173017,"score_gpt":0.2714133043577276,"score_spread":0.2607150871755546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109725035","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.9916436,0.00066806015,0.0006368899,0.00040012592,0.002125911,0.000084143416,4.430482e-7,0.000021574646,0.0044192728],"genre_scores_gemma":[0.9990195,0.00021592087,0.000075642834,0.000064180116,0.00027451295,0.0000014399511,9.849644e-8,0.000024867188,0.00032381923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985902,0.000094150455,0.00040116382,0.000080140795,0.00038153082,0.00045286736],"domain_scores_gemma":[0.99831015,0.0006172798,0.00040908108,0.00036183943,0.00022816047,0.00007346515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017912876,0.0001437758,0.00026140097,0.00010504791,0.00033838724,0.00003561537,0.00076620583,0.000094672025,0.00004377389],"category_scores_gemma":[0.00048841443,0.00008502356,0.00020095281,0.00029375814,0.00013327682,0.000104195584,0.00008111253,0.0016870011,0.0000013944515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036306777,0.000057965513,0.00039005216,0.000008576137,0.000087270215,0.0000055528685,0.0003425382,7.702874e-7,0.0015662491,0.9965253,0.00069909135,0.00028032262],"study_design_scores_gemma":[0.00047260147,0.00022948002,0.00021303215,0.000009572665,0.00008000614,0.00040124592,0.000096547694,0.000009288687,0.0020320609,0.9841586,0.012193539,0.00010402199],"about_ca_topic_score_codex":0.0000021207063,"about_ca_topic_score_gemma":0.000010022459,"teacher_disagreement_score":0.012366702,"about_ca_system_score_codex":0.00006293226,"about_ca_system_score_gemma":0.00016862371,"threshold_uncertainty_score":0.73292744},"labels":[],"label_agreement":null},{"id":"W2110393165","doi":"10.37236/3153","title":"Nonrepetitive Colourings of Planar Graphs with $O(\\log n)$ Colours","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Australian Government","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Chromatic scale; Graph; Bounded function; Outerplanar graph; Upper and lower bounds; Path (computing); Discrete mathematics; Pathwidth; Line graph; Computer science","score_opus":0.006035786116298683,"score_gpt":0.22902869584575372,"score_spread":0.22299290972945504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110393165","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.76693,0.0015839611,0.22703795,0.0024148545,0.00022259519,0.00044115647,8.6778215e-7,0.00003165739,0.0013369869],"genre_scores_gemma":[0.99880767,0.00031108342,0.00056374155,0.00006900048,0.000016059797,0.000008782958,1.6500947e-7,0.0000147211695,0.00020878887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775803,0.00025778764,0.0003888784,0.00015804888,0.00075191236,0.0006853459],"domain_scores_gemma":[0.99733996,0.0005884452,0.00059922226,0.00046873876,0.0008819348,0.00012172032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862426,0.00016186445,0.00033121824,0.0002407427,0.00014080566,0.00005657435,0.0019655437,0.000054168802,0.000012359171],"category_scores_gemma":[0.000102284175,0.000098875906,0.000118080905,0.0010523344,0.00027536624,0.00054544694,0.00011302298,0.0008643873,0.000009076234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008345984,0.00012019766,0.0007602755,0.000007962475,0.000117200725,0.000015008281,0.00036194926,0.000057856465,0.0006486512,0.9972009,0.00022192845,0.0004046079],"study_design_scores_gemma":[0.00091329525,0.0027691566,0.001787916,0.000037910388,0.000020189838,0.00032336643,0.00020137434,0.00015100221,0.0059784628,0.9873274,0.00036433514,0.00012559337],"about_ca_topic_score_codex":0.000014904246,"about_ca_topic_score_gemma":0.000005051697,"teacher_disagreement_score":0.23187768,"about_ca_system_score_codex":0.00018518032,"about_ca_system_score_gemma":0.0005832276,"threshold_uncertainty_score":0.40320423},"labels":[],"label_agreement":null},{"id":"W2110444749","doi":"10.37236/893","title":"A Note on Palindromic $\\delta$-Vectors for Certain Rational Polytopes","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":30,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Polytope; Palindrome; Combinatorics; Lattice (music); Mathematics; Convex polytope; Regular polygon; Convex set; Physics; Geometry; Convex optimization; Chemistry","score_opus":0.034399333505233075,"score_gpt":0.3126438170031136,"score_spread":0.27824448349788056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110444749","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.805142,0.0008084706,0.1877031,0.0022574589,0.0023089321,0.0010339308,0.000010039766,0.00008318067,0.00065287726],"genre_scores_gemma":[0.9977332,0.00020180164,0.00095967716,0.00010611525,0.00039503153,0.000021793197,0.0000018910634,0.00007278045,0.00050770835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731326,0.0001580337,0.0008856526,0.00016970868,0.00077556923,0.0006977458],"domain_scores_gemma":[0.99490666,0.0030524137,0.0009870392,0.00043866114,0.00050630845,0.000108903536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013454866,0.00030073017,0.0005842554,0.00016529273,0.00040055366,0.000024753823,0.0007670657,0.00013098134,0.0000137282],"category_scores_gemma":[0.0019497839,0.00020893673,0.0003384286,0.00036064218,0.00013317949,0.00016890347,0.00004893358,0.0008335079,0.000008366649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002488255,0.00037911226,0.000018915944,0.000031149375,0.00011573198,0.000010295812,0.0007090961,0.000116450145,0.00027779888,0.99589217,0.0021046859,0.00009577132],"study_design_scores_gemma":[0.0022448783,0.0014726752,0.000021578973,0.000055867786,0.00010402736,0.00042263,0.00009922899,0.00036569565,0.004476247,0.9872763,0.0032337988,0.00022702894],"about_ca_topic_score_codex":0.0000017198413,"about_ca_topic_score_gemma":0.0000028070149,"teacher_disagreement_score":0.19259119,"about_ca_system_score_codex":0.00070692284,"about_ca_system_score_gemma":0.00084598263,"threshold_uncertainty_score":0.85201925},"labels":[],"label_agreement":null},{"id":"W2111980485","doi":"10.37236/273","title":"Asymptotics of Some Convolutional Recurrences","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"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; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Binomial coefficient; Combinatorics; Product (mathematics); Binomial (polynomial); Recurrence relation; Enumeration; Constant (computer programming); Statistics; Geometry","score_opus":0.01634684291770393,"score_gpt":0.29858520366557306,"score_spread":0.2822383607478691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111980485","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.97102386,0.0016474089,0.019691909,0.00081333885,0.0053179893,0.00030472616,0.0000042311394,0.000039273833,0.0011572419],"genre_scores_gemma":[0.998347,0.00026430198,0.0008719158,0.00001751562,0.0003175642,0.0000025945517,4.0781936e-7,0.000030507155,0.00014819115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974319,0.0001228383,0.00096946105,0.00010857748,0.0008555057,0.000511751],"domain_scores_gemma":[0.9954222,0.0017360055,0.001501083,0.00045508277,0.0007938138,0.00009180371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020967463,0.00020838775,0.0005265545,0.00012896363,0.00012248996,0.00002029821,0.0010095425,0.00013380493,0.000029359475],"category_scores_gemma":[0.0021711602,0.00014236943,0.00021870708,0.00038384934,0.0002569025,0.00025703732,0.00009179823,0.0015387952,0.000005099876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035954374,0.00032450675,0.00008455795,0.000044296325,0.00010323992,0.0000020755501,0.00022943129,0.000008016446,0.0014776092,0.99701196,0.0005173574,0.00016099674],"study_design_scores_gemma":[0.0008436546,0.0005121243,0.000036160916,0.000047562542,0.00012258324,0.0001825149,0.00012398633,0.000089789704,0.005919251,0.9902257,0.0017527078,0.00014401549],"about_ca_topic_score_codex":0.0000010545488,"about_ca_topic_score_gemma":0.000002527061,"teacher_disagreement_score":0.027323121,"about_ca_system_score_codex":0.00015122331,"about_ca_system_score_gemma":0.0007882548,"threshold_uncertainty_score":0.6685385},"labels":[],"label_agreement":null},{"id":"W2113147502","doi":"10.37236/874","title":"A Traceability Conjecture for Oriented Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Discrete mathematics","score_opus":0.014957630602982191,"score_gpt":0.27097078705346084,"score_spread":0.2560131564504786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113147502","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.27076235,0.0028460564,0.72386533,0.0016381743,0.0004215946,0.00031781287,9.552388e-7,0.000048961352,0.000098759985],"genre_scores_gemma":[0.9987768,0.00035106376,0.0005925617,0.00006994351,0.000040041235,0.000008867562,2.661861e-7,0.000012312373,0.00014815868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979716,0.00023956582,0.0003795736,0.00017417285,0.0005447109,0.00069040497],"domain_scores_gemma":[0.9977444,0.0007256037,0.00031051063,0.000547691,0.0005645938,0.00010720107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020290234,0.00014447507,0.0002696776,0.00015112718,0.00036579257,0.000026559183,0.0016478143,0.000060541206,0.0000029372973],"category_scores_gemma":[0.0003474764,0.00009295737,0.0002445032,0.0009990346,0.00019156082,0.00035391457,0.00009023773,0.0008296053,0.0000018368636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009537568,0.00013081727,0.0002270691,0.00000615865,0.00005277101,0.000009678177,0.00042935295,0.00006608302,0.0001481859,0.99788195,0.00030783346,0.00064474705],"study_design_scores_gemma":[0.0011929795,0.0012261976,0.00028020702,0.0000058563223,0.000011711575,0.0006953352,0.000032706877,0.0007682278,0.0017536102,0.9885284,0.0054011513,0.00010363149],"about_ca_topic_score_codex":0.0000010228057,"about_ca_topic_score_gemma":0.0000013166566,"teacher_disagreement_score":0.7280144,"about_ca_system_score_codex":0.00022903699,"about_ca_system_score_gemma":0.0007132834,"threshold_uncertainty_score":0.37906915},"labels":[],"label_agreement":null},{"id":"W2113228236","doi":"10.37236/897","title":"A Note on Polynomials and $f$-Factors of Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Graph","score_opus":0.025599897312096373,"score_gpt":0.2815963136296713,"score_spread":0.2559964163175749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113228236","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.9979343,0.00055121386,0.00057259714,0.00028707494,0.000073398915,0.00009326818,0.0000013136427,0.000007354289,0.00047950356],"genre_scores_gemma":[0.9991688,0.00065985316,0.000021863267,0.000023215884,0.00001888843,0.000001336778,1.5726239e-7,0.000012242246,0.00009360387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990456,0.00010218022,0.00035271337,0.000059755366,0.0002192971,0.00022047186],"domain_scores_gemma":[0.9983519,0.0008298519,0.00045511356,0.00021043057,0.00010426901,0.000048445876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723357,0.000102888174,0.00025781032,0.00010473529,0.00014937673,0.0000050052795,0.00025802714,0.00004711527,0.0000060991733],"category_scores_gemma":[0.00017682038,0.00006405486,0.00012051197,0.00025854938,0.00013244829,0.00004891605,0.000019205096,0.0003832041,8.429868e-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.00004411788,0.00015849576,0.00034370204,0.000007806488,0.00005091258,0.0000011080747,0.00058796816,0.000002033749,0.0009570811,0.997564,0.0002318954,0.00005086843],"study_design_scores_gemma":[0.0004356248,0.000465049,0.0007725089,0.0000173893,0.0000590157,0.0001087017,0.00008259579,0.000003381965,0.011805877,0.9857165,0.0004717983,0.00006150779],"about_ca_topic_score_codex":0.0000019857018,"about_ca_topic_score_gemma":8.8308747e-7,"teacher_disagreement_score":0.011847461,"about_ca_system_score_codex":0.000043894877,"about_ca_system_score_gemma":0.00012739086,"threshold_uncertainty_score":0.26120815},"labels":[],"label_agreement":null},{"id":"W2113436588","doi":"10.37236/3025","title":"Crossings in Grid Drawings","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Omega; Vertex (graph theory); Grid; Crossing number (knot theory); Matching (statistics); Integer (computer science); Graph; Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.0031886454561910584,"score_gpt":0.20650493789445723,"score_spread":0.20331629243826618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113436588","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.26087195,0.0008513418,0.73371285,0.0026092082,0.0011968353,0.000042425425,4.259263e-8,0.00001244312,0.00070292735],"genre_scores_gemma":[0.9990677,0.000056436,0.00021915881,0.00024105482,0.0002451716,7.1138817e-7,2.1273188e-7,0.0000040687514,0.00016546017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888515,0.00012239108,0.00029445402,0.00008690187,0.00032614288,0.00028495654],"domain_scores_gemma":[0.9991937,0.00020058484,0.00022857598,0.00016832563,0.00016991094,0.00003890151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185317,0.000074868454,0.0001305508,0.00014682172,0.00011357844,0.00012912467,0.0007276608,0.000029634386,0.0000017614674],"category_scores_gemma":[0.00012791397,0.000053524087,0.000059366543,0.0006853552,0.000025632824,0.0003618065,0.000060706723,0.00038489368,0.0000052459864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069841303,0.00004791719,0.00015418055,0.0000022747588,0.0000071916293,0.0000017836919,0.0003259549,0.0019368611,0.0002613586,0.99127656,0.0006611372,0.0053177844],"study_design_scores_gemma":[0.0007193408,0.0003626138,0.0022593318,0.0000151301565,0.0000057268157,0.00015879126,0.000010313226,0.017916083,0.0015894437,0.935631,0.041236293,0.00009593577],"about_ca_topic_score_codex":0.0000037732448,"about_ca_topic_score_gemma":0.000002721884,"teacher_disagreement_score":0.7381958,"about_ca_system_score_codex":0.0001556366,"about_ca_system_score_gemma":0.00031406316,"threshold_uncertainty_score":0.2182649},"labels":[],"label_agreement":null},{"id":"W2113748290","doi":"10.37236/145","title":"On the Total Weight of Weighted Matchings of Segment Graphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Austrian Science Fund; Österreichischen Akademie der Wissenschaften","keywords":"Mathematics; Combinatorics; Chebyshev polynomials; Bipartite graph; Chebyshev filter; Node (physics); Discrete mathematics; Graph","score_opus":0.01135441300166301,"score_gpt":0.26123582525709926,"score_spread":0.24988141225543625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113748290","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.98579156,0.000910816,0.009057029,0.0017163516,0.00065615115,0.00039218165,0.0000019480394,0.000022108346,0.001451822],"genre_scores_gemma":[0.99915695,0.0002636262,0.00027020436,0.00005374539,0.000060673246,0.00000265438,2.5518676e-7,0.00003132783,0.00016053303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691457,0.00024032748,0.0011518593,0.000118462296,0.0010697346,0.0005050489],"domain_scores_gemma":[0.994878,0.0019985046,0.0019244498,0.000651385,0.0004805285,0.00006715054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019444972,0.00027185678,0.00068503147,0.00015552856,0.00012284698,0.000015155133,0.000978882,0.00009835778,0.000025510644],"category_scores_gemma":[0.00057241344,0.00014717945,0.00034817203,0.0006228786,0.00011886277,0.00011695101,0.000060159815,0.000962659,0.0000023941898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014184268,0.00071777555,0.0000046398795,0.000040501593,0.00016609873,0.0000030632557,0.0007217592,0.000022175836,0.0021124207,0.9952221,0.0006298507,0.0002177777],"study_design_scores_gemma":[0.0010496605,0.0019518387,0.000028648034,0.00017271494,0.00016234162,0.000092954164,0.00017104858,0.00007434332,0.02837786,0.96769536,0.00008728078,0.00013593733],"about_ca_topic_score_codex":0.0000012090034,"about_ca_topic_score_gemma":2.3713872e-7,"teacher_disagreement_score":0.027526723,"about_ca_system_score_codex":0.00025866283,"about_ca_system_score_gemma":0.0002594821,"threshold_uncertainty_score":0.6001804},"labels":[],"label_agreement":null},{"id":"W2115412864","doi":"10.37236/844","title":"Laplacian Integral Graphs with Maximum Degree $3$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Laplacian matrix; Degree (music); Isomorphism (crystallography); Laplace operator; Graph isomorphism; Algebraic connectivity; Graph; Integral graph; Resistance distance; Discrete mathematics; Line graph; Graph power; Mathematical analysis","score_opus":0.03708730122675955,"score_gpt":0.2623539621124441,"score_spread":0.22526666088568456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115412864","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.9837187,0.000714914,0.010808072,0.0008635425,0.00011352438,0.00016005682,9.587807e-7,0.00003260906,0.00358765],"genre_scores_gemma":[0.9989727,0.00032107107,0.00014891589,0.00005927231,0.00004065626,0.0000059999406,4.3587224e-7,0.000024478184,0.00042648526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867195,0.00011830647,0.0003436451,0.00008746277,0.00035101027,0.00042765212],"domain_scores_gemma":[0.9986395,0.00032413166,0.00039143115,0.00033095918,0.00023637265,0.0000775914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000813617,0.00015607348,0.00025895826,0.000110614536,0.0003137928,0.00001540299,0.0005755634,0.00005544386,0.000018003435],"category_scores_gemma":[0.00007785342,0.00008841034,0.00014905211,0.00055227504,0.00018407215,0.00011192325,0.000024889287,0.00084217504,0.0000073238325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008709852,0.00017989188,0.00038290542,0.000005841689,0.00010557883,0.0000139932245,0.00039796016,0.0000021713745,0.00005915883,0.9974687,0.0010835172,0.0002131586],"study_design_scores_gemma":[0.0007250605,0.000558699,0.00027268354,0.000021289676,0.00009182611,0.0015769002,0.00022808662,0.00000515339,0.00086348737,0.9925362,0.0030060958,0.00011450836],"about_ca_topic_score_codex":0.000002406806,"about_ca_topic_score_gemma":0.000011271495,"teacher_disagreement_score":0.015254013,"about_ca_system_score_codex":0.00010220287,"about_ca_system_score_gemma":0.000285003,"threshold_uncertainty_score":0.36588782},"labels":[],"label_agreement":null},{"id":"W2116052752","doi":"10.37236/728","title":"The Minor Crossing Number of Graphs with an Excluded Minor","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"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 Waterloo","funders":"","keywords":"Minor (academic); Combinatorics; Mathematics; Crossing number (knot theory); Graph; Robertson–Seymour theorem; Graph minor; Coxeter graph; Discrete mathematics; 1-planar graph; Line graph; Graph power; Voltage graph","score_opus":0.016644143679760092,"score_gpt":0.2882565633769669,"score_spread":0.27161241969720684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116052752","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.9284553,0.0022083605,0.06807878,0.00042520682,0.00019743979,0.00013662077,2.9638693e-7,0.000019343908,0.00047868543],"genre_scores_gemma":[0.99874085,0.00034423752,0.00049119414,0.000038839218,0.00003395811,0.0000027880865,8.921234e-8,0.000017188606,0.00033084393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735117,0.00036813045,0.00043968935,0.00016092641,0.0009220397,0.00075805915],"domain_scores_gemma":[0.99737173,0.0005699483,0.0005539308,0.0007634292,0.00062079186,0.000120174496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018732034,0.0001661,0.00026806755,0.00010214224,0.000932769,0.00013131459,0.0025589543,0.000045972272,0.0000033097708],"category_scores_gemma":[0.00009100868,0.0000852954,0.00013055251,0.0011078803,0.0007524176,0.0006134391,0.00013568117,0.00082725176,0.0000029715568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002454982,0.00016446889,0.0019557714,0.0000055118153,0.00008805962,0.000033343244,0.0010229851,0.00006140281,0.0005990625,0.9941183,0.000075933225,0.0016297166],"study_design_scores_gemma":[0.0011298228,0.0013680785,0.0011634835,0.000022577777,0.000019029903,0.0022498285,0.00012759877,0.00045533528,0.007279606,0.9846528,0.0013799707,0.00015186067],"about_ca_topic_score_codex":0.000007305012,"about_ca_topic_score_gemma":0.000005937176,"teacher_disagreement_score":0.070285596,"about_ca_system_score_codex":0.00013871815,"about_ca_system_score_gemma":0.0010002066,"threshold_uncertainty_score":0.71741986},"labels":[],"label_agreement":null},{"id":"W2116562963","doi":"10.37236/1621","title":"Relaxed Graceful Labellings of Trees","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"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 Toronto","funders":"","keywords":"Bijection; Vertex (graph theory); Combinatorics; Mathematics; Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.010711134484280299,"score_gpt":0.19398446871472116,"score_spread":0.18327333423044087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116562963","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.8398716,0.049162265,0.096588336,0.010658679,0.0016174141,0.00018987377,5.0133474e-7,0.0000919864,0.001819377],"genre_scores_gemma":[0.9970942,0.0021015892,0.00021233025,0.00008973161,0.000009926517,5.93578e-7,5.7525053e-8,0.0000086219825,0.0004829323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836546,0.00012000089,0.00050717103,0.000111258945,0.0004989106,0.00039719275],"domain_scores_gemma":[0.99836385,0.00020061138,0.0005905958,0.0004203272,0.00035610216,0.000068488174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012714127,0.000117197036,0.00025282634,0.00014607256,0.00011153823,0.000037045087,0.0012010634,0.00005429836,0.00000916031],"category_scores_gemma":[0.00007699198,0.000075785974,0.00014642788,0.000780656,0.00007238019,0.00022053497,0.00007637502,0.0005413182,0.000010513546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006713487,0.00016083596,0.00012883126,0.000004724521,0.00004913309,0.0000045819174,0.00047964658,0.00016972423,0.0009951709,0.9948494,0.0018958444,0.0012554057],"study_design_scores_gemma":[0.0007705772,0.0007988713,0.00006335105,0.0000337493,0.00003110161,0.00015033425,0.000024474897,0.003962647,0.0067893118,0.98419064,0.0030828973,0.000102032005],"about_ca_topic_score_codex":0.000004444009,"about_ca_topic_score_gemma":0.0000017405793,"teacher_disagreement_score":0.15722264,"about_ca_system_score_codex":0.000060146278,"about_ca_system_score_gemma":0.00009413613,"threshold_uncertainty_score":0.30904624},"labels":[],"label_agreement":null},{"id":"W2117973853","doi":"10.37236/951","title":"A Characterization of Balanced Episturmian Sequences","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"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","keywords":"Aperiodic graph; Alphabet; Generalization; Mathematics; Conjecture; Combinatorics; Characterization (materials science); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.005130220948648043,"score_gpt":0.22026096969268613,"score_spread":0.2151307487440381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117973853","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.5950762,0.0004479365,0.4033513,0.0004907775,0.00035489057,0.000041279574,2.0659327e-7,0.000013169275,0.00022423729],"genre_scores_gemma":[0.9994723,0.00023333513,0.00007142794,0.000091926835,0.00006166884,3.321599e-7,3.776327e-7,0.0000051568127,0.00006342582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877644,0.00007811707,0.0004000563,0.00007549116,0.0003389647,0.00033093974],"domain_scores_gemma":[0.99877125,0.0001484537,0.000600258,0.00024943496,0.0001871946,0.00004341269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023115997,0.00008392768,0.00018340393,0.00009643068,0.0000667537,0.00003122505,0.0010618553,0.000037933263,0.0000028548227],"category_scores_gemma":[0.000045629396,0.000054356085,0.000075684846,0.0005038321,0.000051217656,0.00031317928,0.00005526996,0.0002804298,0.0000017447236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015635764,0.00003951416,0.00017687386,0.0000053943595,0.000024517934,0.000006093691,0.0004751417,0.00000388697,0.061669998,0.9341195,0.000011089827,0.0034523443],"study_design_scores_gemma":[0.00054088567,0.00058083894,0.006512554,0.000043933553,0.000017995118,0.00027250915,0.000093777904,0.0007464217,0.12269132,0.8670471,0.0013288668,0.00012380118],"about_ca_topic_score_codex":0.0000027279082,"about_ca_topic_score_gemma":0.0000012514643,"teacher_disagreement_score":0.40439615,"about_ca_system_score_codex":0.000117973934,"about_ca_system_score_gemma":0.00023338011,"threshold_uncertainty_score":0.22165768},"labels":[],"label_agreement":null},{"id":"W2118970668","doi":"10.37236/1538","title":"Colouring Planar Mixed Hypergraphs","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Bipartite graph; Chromatic polynomial; Vertex (graph theory); Planar graph; Graph; Planar; Chromatic scale; Computer science","score_opus":0.008014680410700175,"score_gpt":0.2406045820898491,"score_spread":0.23258990167914895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118970668","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.82798725,0.008496966,0.15358303,0.0036784275,0.0007433054,0.00023371368,6.03211e-7,0.0000916607,0.0051850453],"genre_scores_gemma":[0.9976075,0.0013065233,0.00017479378,0.000091832255,0.000054806256,0.00000214246,1.19205936e-7,0.0000130640965,0.000749193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997869,0.00027486446,0.00034312895,0.00014175914,0.0006264531,0.0007447832],"domain_scores_gemma":[0.9986951,0.0003277231,0.00018800073,0.00049852027,0.00017669862,0.00011396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017196918,0.00013642975,0.00022361215,0.00016756145,0.0002456501,0.00008133773,0.0023554557,0.000048339072,0.000027158443],"category_scores_gemma":[0.00005737491,0.00009321357,0.00014553445,0.00097282435,0.000090788686,0.00042052736,0.000063059786,0.00093801675,0.000031409443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054885306,0.000075333264,0.000079495934,0.0000027559047,0.00005576959,0.000028537384,0.00015622182,0.00020924494,0.00029489346,0.98932755,0.0003700105,0.00934532],"study_design_scores_gemma":[0.0006574003,0.0005988073,0.0002686422,0.000013094895,0.000011157908,0.0004928537,0.000030488467,0.00050524477,0.001982563,0.9807109,0.014612236,0.00011660705],"about_ca_topic_score_codex":0.0000020144814,"about_ca_topic_score_gemma":0.0000018988401,"teacher_disagreement_score":0.16962029,"about_ca_system_score_codex":0.0001934547,"about_ca_system_score_gemma":0.00033562424,"threshold_uncertainty_score":0.4377062},"labels":[],"label_agreement":null},{"id":"W2123221405","doi":"10.37236/1659","title":"The Number of Labeled 2-Connected Planar Graphs","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Chordal graph; 1-planar graph; Clique-sum; Discrete mathematics; Indifference graph; Graph","score_opus":0.016423206286779457,"score_gpt":0.2645024867667231,"score_spread":0.24807928047994365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123221405","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.988877,0.0049046227,0.0003304895,0.0007622265,0.00070139946,0.00014028167,0.00000159607,0.000018646606,0.004263746],"genre_scores_gemma":[0.99715704,0.0020827393,0.000028332175,0.00004684695,0.000064163134,0.000001578325,1.4153957e-7,0.000024289338,0.0005948835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998008,0.00029637912,0.0006218314,0.00007855947,0.0005045128,0.00049070927],"domain_scores_gemma":[0.996682,0.0017465121,0.0007634301,0.00043738307,0.00031688975,0.000053808708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543184,0.00016365814,0.00033878372,0.000057955982,0.00042263157,0.000024690245,0.00090523117,0.000084542546,0.000074078984],"category_scores_gemma":[0.00052968157,0.0000802781,0.00023829883,0.00043856894,0.00019398071,0.00007105669,0.00004725749,0.00082122284,0.0000031794311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000604631,0.00008915253,0.00031063095,0.0000125595225,0.0002725389,0.0000037925572,0.00064696535,9.391431e-7,0.00009711909,0.99552333,0.0026626028,0.0003199095],"study_design_scores_gemma":[0.00082136097,0.00020969455,0.000107161904,0.000021564556,0.00012612656,0.00029325276,0.00018594532,0.000031940683,0.0008861713,0.9940214,0.0031976476,0.000097732496],"about_ca_topic_score_codex":0.0000020247028,"about_ca_topic_score_gemma":0.00000308952,"teacher_disagreement_score":0.008280034,"about_ca_system_score_codex":0.00008203099,"about_ca_system_score_gemma":0.00006385277,"threshold_uncertainty_score":0.35678503},"labels":[],"label_agreement":null},{"id":"W2123338985","doi":"10.37236/939","title":"Truncations of Random Unitary Matrices and Young Tableaux","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Unitary matrix; Young tableau; Unitary state; Unitary group; Haar measure; Random matrix; Matrix (chemical analysis); Unitary transformation; Lattice (music); Simple (philosophy); Eigenvalues and eigenvectors; Quantum mechanics; Physics","score_opus":0.008453647387334947,"score_gpt":0.25255839356037607,"score_spread":0.24410474617304112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123338985","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.95705163,0.0150754005,0.022849,0.0010966731,0.0001508604,0.00029059098,0.000003824692,0.000017175767,0.0034648222],"genre_scores_gemma":[0.9972594,0.0020114172,0.00015143951,0.000007309196,0.00008259236,0.000004889445,9.571392e-7,0.0000136559765,0.00046836236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988429,0.00007909076,0.0005251183,0.00006120619,0.00026046054,0.00023123207],"domain_scores_gemma":[0.9982369,0.00066676905,0.0006279418,0.00019083533,0.0002471231,0.000030447105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935921,0.00009959286,0.00028474387,0.00010373159,0.0001451974,0.000024245131,0.00028058543,0.000041244777,0.000008759268],"category_scores_gemma":[0.00008756788,0.00006462886,0.00009382186,0.00044588678,0.00006116774,0.00011087342,0.000025405856,0.0002829822,9.325791e-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.00005838097,0.00014443453,0.00032673022,0.000029519098,0.000055084303,6.2308186e-7,0.00012539304,0.000038390663,0.00023645768,0.99692625,0.0019482602,0.000110482884],"study_design_scores_gemma":[0.0023655382,0.00011798811,0.00036410193,0.000017759243,0.0002350509,0.00010524397,0.00019884865,0.00018724895,0.00049508346,0.9932281,0.0026136353,0.000071427516],"about_ca_topic_score_codex":0.000059089616,"about_ca_topic_score_gemma":0.00001897633,"teacher_disagreement_score":0.040207725,"about_ca_system_score_codex":0.000064524545,"about_ca_system_score_gemma":0.00017302072,"threshold_uncertainty_score":0.26354885},"labels":[],"label_agreement":null},{"id":"W2126337683","doi":"10.37236/1777","title":"Class-Uniformly Resolvable Group Divisible Structures II: Frames.","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Class (philosophy); Closure (psychology); Combinatorics; Group (periodic table); Frame (networking); Type (biology); Resolution (logic); Discrete mathematics; Lambda; Computer science","score_opus":0.003767506700162956,"score_gpt":0.18282210849146194,"score_spread":0.17905460179129898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126337683","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.9645429,0.014832345,0.013732931,0.0002599318,0.0016770441,0.00015757584,0.0000015765897,0.00010958238,0.0046861167],"genre_scores_gemma":[0.99890643,0.0007098556,0.000014856981,0.000042231397,0.00015365364,0.0000025297466,8.7020106e-7,0.000038266713,0.0001313275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983962,0.000060204286,0.00043926746,0.00008340955,0.00038371724,0.0006371881],"domain_scores_gemma":[0.9992763,0.00006538226,0.00017235785,0.00030409262,0.000091105714,0.000090774905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008851794,0.00019849803,0.00029897396,0.00013466415,0.00025876245,0.00005673189,0.0006357008,0.000115592506,0.000017855971],"category_scores_gemma":[0.00002893964,0.00013650124,0.00016866159,0.00045346064,0.000056902343,0.0002417653,0.000040249768,0.0010939761,0.000007954015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026417409,0.000040766587,0.00004003197,0.00002328129,0.00014012751,0.000008062722,0.00037710214,0.014417953,0.0009939182,0.9832119,0.00052488846,0.00019556102],"study_design_scores_gemma":[0.0009824757,0.0006084017,0.00016713835,0.00004333674,0.00004802712,0.00025220195,0.0001848664,0.00014163519,0.0035280113,0.9733207,0.020555025,0.00016813821],"about_ca_topic_score_codex":0.000007663534,"about_ca_topic_score_gemma":0.0000075799617,"teacher_disagreement_score":0.034363512,"about_ca_system_score_codex":0.00038722277,"about_ca_system_score_gemma":0.00013153431,"threshold_uncertainty_score":0.5566359},"labels":[],"label_agreement":null},{"id":"W2126591495","doi":"10.37236/563","title":"Product and Puzzle Formulae for $GL_n$ Belkale-Kumar Coefficients","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"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; National Science Foundation","keywords":"Mathematics; Combinatorics; Product (mathematics); Flag (linear algebra); Dimension (graph theory); Structure constants; Constant (computer programming); Cohomology ring; Cup product; Generalized flag variety; Cohomology; Pure mathematics; Algebra over a field; Equivariant cohomology; Geometry; Lie group; De Rham cohomology","score_opus":0.051167719097219504,"score_gpt":0.29607131384172714,"score_spread":0.24490359474450762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126591495","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.67346984,0.0050773546,0.31343505,0.00059330347,0.002743118,0.0021129467,0.000006317632,0.00011204809,0.002449993],"genre_scores_gemma":[0.9972146,0.00024738774,0.0018591225,0.000026115333,0.00015576667,0.000019353083,4.715382e-7,0.00006777209,0.00040937177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977875,0.000091827686,0.00074421644,0.00018015956,0.00047313227,0.00072320324],"domain_scores_gemma":[0.9972023,0.00074735074,0.0008790161,0.0004851554,0.0005721993,0.00011398507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019561436,0.0002623354,0.0005186606,0.00011868418,0.0002780473,0.000031867705,0.0007006548,0.00008207591,0.00000836949],"category_scores_gemma":[0.0013804412,0.00018018307,0.00016546315,0.0003105545,0.000113366375,0.00023452868,0.00011263312,0.00057349843,0.0000025999648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014432918,0.00043503902,0.000035391582,0.00010609759,0.00012454244,0.0000027259553,0.0012269751,0.0000018793052,0.00015141476,0.99654734,0.0005483606,0.0006759003],"study_design_scores_gemma":[0.0017881502,0.0010378776,0.000018847673,0.00005733503,0.00020710955,0.0002008869,0.00021073126,0.000088791334,0.0061404593,0.9859949,0.004053796,0.00020111386],"about_ca_topic_score_codex":0.0000013721727,"about_ca_topic_score_gemma":0.0000024444266,"teacher_disagreement_score":0.32374477,"about_ca_system_score_codex":0.00025811407,"about_ca_system_score_gemma":0.00022462224,"threshold_uncertainty_score":0.73476523},"labels":[],"label_agreement":null},{"id":"W2131179276","doi":"10.37236/323","title":"Enumeration of Alternating Sign Matrices of Even Size (Quasi-)Invariant under a Quarter-Turn Rotation","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Enumeration; Mathematics; Invariant (physics); Sign (mathematics); Quarter (Canadian coin); Combinatorics; Mathematical analysis; Mathematical physics; Geography","score_opus":0.010672850432898768,"score_gpt":0.2671178473046206,"score_spread":0.25644499687172184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131179276","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.9729798,0.00043748206,0.02477785,0.0003977848,0.0010425431,0.00020345917,0.00000116997,0.000010628537,0.00014932749],"genre_scores_gemma":[0.9993709,0.000091485155,0.00023485297,0.000016572632,0.00022425194,0.0000030469148,4.8433463e-7,0.000025888978,0.00003253424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977111,0.00019637973,0.00095144176,0.000113672126,0.0006983828,0.00032899674],"domain_scores_gemma":[0.9958208,0.0012929454,0.001946386,0.0003143308,0.00057134865,0.000054142965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015607945,0.00018022474,0.0004504516,0.000103202656,0.00009992529,0.000031747368,0.00054540456,0.00012662545,0.000031370164],"category_scores_gemma":[0.00063384935,0.00012585218,0.0001945458,0.00031302628,0.00005874449,0.00021274317,0.000039323615,0.00079715444,6.437176e-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.0000863302,0.00019263472,0.000093599665,0.000049441198,0.00015548311,0.0000011058355,0.00097215886,0.00009007447,0.011497027,0.9865101,0.00005836718,0.00029367194],"study_design_scores_gemma":[0.0011249393,0.00085439166,0.00026650424,0.000049806622,0.00016022527,0.00006622056,0.00039238064,0.00054190925,0.013173654,0.98323125,0.00002106765,0.000117677235],"about_ca_topic_score_codex":0.000030269499,"about_ca_topic_score_gemma":0.000012983215,"teacher_disagreement_score":0.026391128,"about_ca_system_score_codex":0.00010941051,"about_ca_system_score_gemma":0.0004201664,"threshold_uncertainty_score":0.5132103},"labels":[],"label_agreement":null},{"id":"W2131533920","doi":"10.37236/4842","title":"Semiregular Automorphisms of Cubic Vertex-Transitive Graphs and the Abelian Normal Quotient Method","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"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 Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Automorphisms of the symmetric and alternating groups; Automorphism; Abelian group; Quotient; Vertex (graph theory); Normal subgroup; Transitive relation; Symmetric graph; Cubic graph; Graph; Discrete mathematics; Order (exchange); Group (periodic table); Line graph; Voltage graph; Physics","score_opus":0.030098804578945215,"score_gpt":0.31335142671356203,"score_spread":0.2832526221346168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131533920","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.9706192,0.007518839,0.015962342,0.0030853397,0.00045481237,0.00060169515,0.000004161811,0.00002902294,0.0017245575],"genre_scores_gemma":[0.9990299,0.0003923014,0.00024383396,0.000044760367,0.000025189838,0.000005228945,4.2978075e-7,0.000033663,0.00022474326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961509,0.001428678,0.00065279653,0.00012564803,0.0010364875,0.0006055025],"domain_scores_gemma":[0.9958677,0.0022470895,0.0005803092,0.00042300514,0.0007307786,0.00015107884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011647884,0.00020468824,0.00057608535,0.00018927835,0.00013175074,0.00003222683,0.0007712621,0.000094787625,0.000008445384],"category_scores_gemma":[0.0007975163,0.0001115895,0.00020203249,0.00062985346,0.0005095635,0.00012547297,0.000112505295,0.0011309461,0.000001705519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006753025,0.00016482177,0.00005925568,0.00003510586,0.0003167145,0.000010156162,0.0037887937,0.000019685927,0.00038637038,0.9937137,0.00039500283,0.0004351067],"study_design_scores_gemma":[0.0043125465,0.0010685165,0.000045402827,0.000056152283,0.0002453233,0.00045828932,0.0009650956,0.0013982538,0.0045234635,0.9865169,0.00029855114,0.00011151491],"about_ca_topic_score_codex":0.000021451582,"about_ca_topic_score_gemma":0.0000065692043,"teacher_disagreement_score":0.02841062,"about_ca_system_score_codex":0.00023778038,"about_ca_system_score_gemma":0.0006281416,"threshold_uncertainty_score":0.4913461},"labels":[],"label_agreement":null},{"id":"W2131811358","doi":"10.37236/2541","title":"Common Edges in Rooted Trees and Polygonal Triangulations","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Combinatorics; Rotation (mathematics); Polygon mesh; Computation; Subdivision; Enhanced Data Rates for GSM Evolution; Time complexity; Distribution (mathematics); Similarity (geometry); Geometry; Algorithm; Computer science; Image (mathematics); Mathematical analysis","score_opus":0.008062309830648522,"score_gpt":0.22125009576519425,"score_spread":0.21318778593454574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131811358","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.80731165,0.0072688297,0.16571067,0.017249571,0.00071392336,0.0003639654,8.7203927e-7,0.000041076244,0.0013394209],"genre_scores_gemma":[0.9992716,0.00028264386,0.00008935847,0.000070769776,0.00003977729,0.0000022035008,6.1604163e-7,0.0000041536114,0.00023889427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990616,0.0000914106,0.00026365777,0.00008007011,0.0002202207,0.0002830331],"domain_scores_gemma":[0.99938065,0.00013241195,0.0001720571,0.00021072928,0.00006280557,0.00004132627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062800164,0.000080394995,0.00014924115,0.00015264895,0.00007896236,0.00016436836,0.0007837098,0.000024040388,0.0000065218173],"category_scores_gemma":[0.000028699997,0.000053954354,0.00003681301,0.00044920022,0.000031867283,0.00074388593,0.00013949742,0.00031038985,0.0000053224194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037766542,0.00009246298,0.0015687892,0.0000023698155,0.000030590094,0.0000043145737,0.00018724604,0.00003330946,0.00005357775,0.95582503,0.0011820595,0.041016478],"study_design_scores_gemma":[0.0012600649,0.0003160561,0.06751017,0.000017819693,0.000016214319,0.00005841531,0.0000752113,0.013463387,0.00014486595,0.91412324,0.0028945592,0.0001200109],"about_ca_topic_score_codex":0.00003262083,"about_ca_topic_score_gemma":0.000025680416,"teacher_disagreement_score":0.19195992,"about_ca_system_score_codex":0.0000730925,"about_ca_system_score_gemma":0.00008307662,"threshold_uncertainty_score":0.22001947},"labels":[],"label_agreement":null},{"id":"W2132052310","doi":"10.37236/839","title":"Compression of Root Systems and the $E$-Sequence","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Root (linguistics); Mathematics; Sequence (biology); Root system; Pure mathematics; Discrete mathematics; Combinatorics; Algebra over a field; Botany; Biology","score_opus":0.013622498070892204,"score_gpt":0.2218310289784053,"score_spread":0.2082085309075131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132052310","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.80306625,0.02335802,0.17089668,0.0011869624,0.00069208315,0.0001533827,2.608749e-7,0.00001948445,0.00062684534],"genre_scores_gemma":[0.9986333,0.0012504819,0.000016538137,0.000026193633,0.00003255506,0.000001272581,3.355806e-8,0.0000039165693,0.000035663277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986318,0.00037502171,0.00032156642,0.00007667633,0.00035677198,0.00023818146],"domain_scores_gemma":[0.99849445,0.0005161818,0.00043766043,0.0003392978,0.00017384086,0.000038569968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019056485,0.000087699074,0.00022953865,0.0000688395,0.00024589294,0.00003405329,0.0011865457,0.00002998298,6.861157e-7],"category_scores_gemma":[0.00005292272,0.000042906275,0.00009889227,0.000413103,0.00029949693,0.00018154977,0.00012264223,0.00042050047,5.31669e-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.00006146374,0.000030865725,0.00024164833,0.0000065242057,0.000033528628,0.0000042711113,0.0006075205,0.00008430256,0.0002483001,0.9982634,0.00009821437,0.0003199497],"study_design_scores_gemma":[0.0015676212,0.00048355982,0.0006060829,0.00006590682,0.000030026771,0.0014715659,0.000072021845,0.0033974494,0.0011435872,0.9893066,0.0017658597,0.000089711975],"about_ca_topic_score_codex":0.0000074682885,"about_ca_topic_score_gemma":4.6181538e-7,"teacher_disagreement_score":0.19556706,"about_ca_system_score_codex":0.000035230933,"about_ca_system_score_gemma":0.00016758553,"threshold_uncertainty_score":0.22049168},"labels":[],"label_agreement":null},{"id":"W2132071928","doi":"10.37236/1600","title":"The Game of End-Nim","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; String (physics); Mathematics; Combinatorial game theory; Stack (abstract data type); Sequential game; Computer science; Mathematical economics; Game theory; Mathematical physics; Operating system","score_opus":0.012692526359330792,"score_gpt":0.2589302169930107,"score_spread":0.24623769063367992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132071928","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.33239865,0.016215442,0.63254386,0.012224689,0.0022330368,0.00020458536,2.3328367e-7,0.000041257394,0.0041382425],"genre_scores_gemma":[0.99630874,0.0030508696,0.000037078993,0.00007241068,0.00009005035,0.0000011376326,2.7163958e-8,0.000007779938,0.0004318982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980924,0.00017398674,0.00054249365,0.00009110104,0.0005863019,0.00051370217],"domain_scores_gemma":[0.99771327,0.00073345425,0.00057997083,0.0005293,0.00038978452,0.00005422656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020257395,0.000108391396,0.0001904959,0.00006496274,0.00017486043,0.00008301326,0.0026606577,0.000041177438,0.000008145776],"category_scores_gemma":[0.00022867926,0.00005813695,0.00014379156,0.00062867324,0.00016811036,0.00025740475,0.0001474945,0.00058909657,0.000013777411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001977907,0.000054634416,0.00017996047,0.0000011714637,0.000038067752,0.0000065973722,0.00047837742,0.00013968733,0.0002775662,0.9815277,0.00035640012,0.016920095],"study_design_scores_gemma":[0.00010994717,0.0004976746,0.00019180482,0.000012466803,0.0000149424195,0.00028465764,0.0001497172,0.0022387896,0.011333193,0.950024,0.035067108,0.00007570055],"about_ca_topic_score_codex":0.00001100587,"about_ca_topic_score_gemma":0.000010784803,"teacher_disagreement_score":0.6639101,"about_ca_system_score_codex":0.00016581685,"about_ca_system_score_gemma":0.00047817905,"threshold_uncertainty_score":0.49442083},"labels":[],"label_agreement":null},{"id":"W2132890123","doi":"10.37236/4976","title":"Backward Jeu de Taquin Slides for Composition Tableaux and a Noncommutative Pieri Rule","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"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":"Noncommutative geometry; Mathematics; Combinatorics; Operator (biology); Composition (language); Partially ordered set; Young tableau; Symmetric function; Pure mathematics; Philosophy","score_opus":0.044608823788215235,"score_gpt":0.33719218359915665,"score_spread":0.2925833598109414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132890123","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.5408881,0.002832651,0.4526265,0.0013149243,0.00074824673,0.0006900386,0.000005772363,0.000055217075,0.0008386049],"genre_scores_gemma":[0.9917475,0.0001990333,0.007596108,0.00006160091,0.00016681215,0.000022075163,0.0000013175104,0.000056152818,0.00014942075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979735,0.00024162732,0.0006130073,0.00012185382,0.00043387522,0.0006161368],"domain_scores_gemma":[0.996216,0.0017906477,0.00080774125,0.0002841067,0.00072117645,0.00018030893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027572708,0.00023402952,0.0005363313,0.0000988768,0.00018187659,0.00006627766,0.00047929896,0.0001028016,0.0000024472595],"category_scores_gemma":[0.0012191597,0.00017314705,0.00012713742,0.00026859978,0.00011083561,0.00026979906,0.000092510076,0.00063244236,0.0000023521982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002445717,0.00025324017,0.000030635387,0.00007680577,0.0001390536,0.0000048969227,0.0023643333,0.000053499134,0.00051954633,0.9945018,0.0014794143,0.000332159],"study_design_scores_gemma":[0.002832257,0.0014044787,0.000006739042,0.000089448076,0.00020274172,0.00036104917,0.0012544598,0.0006470438,0.0045740395,0.98670566,0.001735459,0.00018660398],"about_ca_topic_score_codex":0.000002625326,"about_ca_topic_score_gemma":0.000001714145,"teacher_disagreement_score":0.45085943,"about_ca_system_score_codex":0.0008200422,"about_ca_system_score_gemma":0.0006223366,"threshold_uncertainty_score":0.7060732},"labels":[],"label_agreement":null},{"id":"W2133973319","doi":"10.37236/1651","title":"Toida's Conjecture is True","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":13,"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 Lethbridge","funders":"Oklahoma State University","keywords":"Mathematics; Combinatorics; Conjecture; Circulant matrix; Circulant graph; Graph; Order (exchange); Automorphism; Automorphism group; Generalization; Discrete mathematics; Voltage graph; Line graph","score_opus":0.049781590023279185,"score_gpt":0.3009344233896633,"score_spread":0.2511528333663841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133973319","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.945036,0.014368168,0.0070728627,0.013255135,0.0008932262,0.00049361953,0.0000043714235,0.000075180105,0.018801462],"genre_scores_gemma":[0.99448216,0.00083485997,0.000028109565,0.00019980878,0.00017560508,0.000002444735,1.52296e-7,0.000041420626,0.0042354264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997541,0.00032189052,0.00049778813,0.00011392744,0.0007769094,0.00074848],"domain_scores_gemma":[0.9975841,0.0011423626,0.0003989742,0.000488886,0.00028136058,0.0001043351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021443733,0.00018652725,0.00036466212,0.00014497363,0.00017371005,0.000058856822,0.0009809722,0.000114195966,0.00068925484],"category_scores_gemma":[0.000622116,0.000117854186,0.0002159965,0.00052056403,0.00010995681,0.00012869536,0.0000768474,0.0016097411,0.00007312866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004314146,0.00019542461,0.00004909984,0.000020969595,0.00014169642,0.000021257703,0.0011275144,0.0000020091777,0.00015135753,0.9756864,0.02174962,0.0008115672],"study_design_scores_gemma":[0.0010083356,0.000770695,0.000015534157,0.000023539884,0.00006428818,0.0005579764,0.00014769474,0.00017128387,0.0018297303,0.97505665,0.02022512,0.0001291307],"about_ca_topic_score_codex":0.0000014600504,"about_ca_topic_score_gemma":0.0000016609249,"teacher_disagreement_score":0.0494462,"about_ca_system_score_codex":0.000353741,"about_ca_system_score_gemma":0.00015200101,"threshold_uncertainty_score":0.7546857},"labels":[],"label_agreement":null},{"id":"W2136104372","doi":"10.37236/1567","title":"The Rectilinear Crossing Number of $K_{10}$ is $62$","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Crossing number (knot theory); Graph; Enhanced Data Rates for GSM Evolution; Line (geometry); Discrete mathematics; Geometry; Computer science; Intersection (aeronautics)","score_opus":0.009994745284637953,"score_gpt":0.274939942040069,"score_spread":0.26494519675543104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136104372","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.56662697,0.005363792,0.41941088,0.0049412367,0.0013202835,0.00011012257,3.2405762e-7,0.000020796188,0.0022055695],"genre_scores_gemma":[0.9974463,0.0005162601,0.00018576333,0.00014812575,0.0001496782,7.705498e-7,1.596454e-7,0.000006021347,0.0015469134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855155,0.00013694924,0.00041134714,0.00009267417,0.00049317203,0.00031430335],"domain_scores_gemma":[0.99827594,0.00040303558,0.0004472738,0.00028645917,0.0005443656,0.000042953616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016295357,0.00009233156,0.0001441861,0.000052878953,0.00046940165,0.00019575129,0.0008941057,0.000036915942,0.000017131906],"category_scores_gemma":[0.00012719602,0.00005477708,0.00011719073,0.000847513,0.00007538004,0.00027408433,0.00007914718,0.0003638301,0.000012325402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007751116,0.00013100546,0.00047203267,0.0000048661113,0.000096678334,0.000005831752,0.0008240548,0.0009583243,0.000381171,0.96854204,0.004088995,0.024417488],"study_design_scores_gemma":[0.000692949,0.00036207357,0.0006996483,0.000020189273,0.000026933265,0.00080706994,0.000050819905,0.014036606,0.006471966,0.8177788,0.158928,0.00012492001],"about_ca_topic_score_codex":0.000003985702,"about_ca_topic_score_gemma":0.0000018788911,"teacher_disagreement_score":0.4308193,"about_ca_system_score_codex":0.00013064503,"about_ca_system_score_gemma":0.0006618363,"threshold_uncertainty_score":0.36103055},"labels":[],"label_agreement":null},{"id":"W2136210216","doi":"10.37236/1571","title":"A One–Sided Zimin Construction","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"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 Waterloo","funders":"","keywords":"Mathematics; Abelian group; Substring; Combinatorics; Square (algebra); Alphabet; String (physics); Discrete mathematics; Geometry; Computer science; Linguistics; Data structure","score_opus":0.01286402042136128,"score_gpt":0.22879972740132148,"score_spread":0.2159357069799602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136210216","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.41281763,0.0025034514,0.5786092,0.003411404,0.0010451766,0.00009146013,2.008823e-7,0.00006925633,0.0014521765],"genre_scores_gemma":[0.9978688,0.00095772406,0.0005843951,0.00020527032,0.00013529682,0.0000013437092,2.927283e-7,0.0000105065765,0.00023640534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983213,0.00017638593,0.0003990961,0.00012892281,0.00046481704,0.0005094838],"domain_scores_gemma":[0.99856985,0.000260935,0.00043559188,0.0004513751,0.00020202696,0.00008020227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013922959,0.00012814469,0.00023225314,0.00012790524,0.00017723677,0.000118042015,0.0012970897,0.00005880097,0.000019185372],"category_scores_gemma":[0.0001147319,0.00009465741,0.00013003389,0.0006352168,0.00007683845,0.0004281953,0.00011012861,0.0006130752,0.000027467984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002052767,0.00008575916,0.00009564726,0.000002230766,0.00005122018,0.000007709113,0.00021998776,0.000024832038,0.0006632406,0.98453707,0.00038852592,0.0139032295],"study_design_scores_gemma":[0.00066999433,0.0002819718,0.0003372651,0.000029871744,0.000028126871,0.0016649353,0.000062775645,0.00065462507,0.0011888042,0.98087806,0.014075033,0.00012852927],"about_ca_topic_score_codex":0.000005409809,"about_ca_topic_score_gemma":0.0000030656079,"teacher_disagreement_score":0.5850511,"about_ca_system_score_codex":0.000249225,"about_ca_system_score_gemma":0.00037189017,"threshold_uncertainty_score":0.3860017},"labels":[],"label_agreement":null},{"id":"W2136323716","doi":"10.37236/358","title":"Yet Another Hat Game","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"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","keywords":"Combinatorial game theory; Publicity; Game theory; Sequential game; Mathematical economics; Mathematics; Simple (philosophy); Argument (complex analysis); Computer science; Epistemology","score_opus":0.00525230628632309,"score_gpt":0.21575739318894596,"score_spread":0.21050508690262287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136323716","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.3142592,0.0017939534,0.6692267,0.0069418685,0.0054432834,0.00021975658,4.2569607e-7,0.00010675232,0.002008035],"genre_scores_gemma":[0.99838865,0.000097220945,0.000669965,0.00029237595,0.0002066503,0.0000017282317,1.0171609e-7,0.000016786737,0.0003265176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978392,0.00017200463,0.000450521,0.00020117182,0.00064580864,0.0006912674],"domain_scores_gemma":[0.99787307,0.000395164,0.00041188128,0.00085275027,0.00036742742,0.000099727535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00217143,0.00018914577,0.00029344592,0.00012252467,0.00012487125,0.00017445812,0.0028802843,0.0000939992,0.000029639448],"category_scores_gemma":[0.00018846567,0.00012426199,0.00018646411,0.00063988974,0.00010912978,0.00041110849,0.0002884293,0.0016034489,0.000029964413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009875914,0.00019024771,0.00025119618,0.0000035431992,0.000042324456,0.000012679153,0.00040194034,0.000055176126,0.0012936678,0.988001,0.000669672,0.00906871],"study_design_scores_gemma":[0.00065150566,0.0005440653,0.0010982235,0.000006782571,0.000018245177,0.0006749188,0.000014504346,0.005406246,0.002585731,0.9588507,0.029969083,0.00018001742],"about_ca_topic_score_codex":0.0000071688605,"about_ca_topic_score_gemma":0.00001413203,"teacher_disagreement_score":0.6841295,"about_ca_system_score_codex":0.00019876174,"about_ca_system_score_gemma":0.0006368773,"threshold_uncertainty_score":0.6966277},"labels":[],"label_agreement":null},{"id":"W2136528759","doi":"10.37236/787","title":"Determinant Expressions for $q$-Harmonic Congruences and Degenerate Bernoulli Numbers","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":16,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Congruence relation; Mathematics; Harmonic number; Bernoulli number; Congruence (geometry); Degenerate energy levels; Binomial coefficient; Combinatorics; Bernoulli's principle; Binomial (polynomial); Discrete mathematics; Pure mathematics; Riemann hypothesis; Statistics; Physics; Geometry","score_opus":0.05228985578254844,"score_gpt":0.3211626674405128,"score_spread":0.2688728116579644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136528759","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.9578441,0.0029920745,0.03765307,0.00046942796,0.0003107877,0.00029793486,0.0000021677731,0.000022859553,0.0004076185],"genre_scores_gemma":[0.99476516,0.0021149316,0.0009893004,0.000026294278,0.00007710661,0.00001657627,2.6619526e-7,0.00002971575,0.0019806416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985028,0.00008002406,0.000516694,0.00010872441,0.00032242562,0.00046936708],"domain_scores_gemma":[0.9976044,0.001346356,0.00048561525,0.00020919178,0.0002601443,0.00009424159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007182062,0.00016766631,0.0003788095,0.000062077765,0.00036933186,0.00002944899,0.00037448018,0.000060401268,0.000008121274],"category_scores_gemma":[0.00068468763,0.00010548679,0.0001308096,0.0001294057,0.00022367827,0.0002225837,0.00006001159,0.0003877857,0.0000017256608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003680912,0.00009721501,0.000073691044,0.000054599503,0.00007312629,0.000012588379,0.0006634447,0.0000040013892,0.0010181236,0.99684817,0.0010570295,0.00006119294],"study_design_scores_gemma":[0.0007274025,0.0003225145,0.000024683843,0.00006535854,0.00011035887,0.00080983783,0.0003160132,0.000085389715,0.011075007,0.9854421,0.00089194224,0.00012941369],"about_ca_topic_score_codex":0.0000024510584,"about_ca_topic_score_gemma":0.000006368803,"teacher_disagreement_score":0.03692111,"about_ca_system_score_codex":0.00013818269,"about_ca_system_score_gemma":0.00027035407,"threshold_uncertainty_score":0.43016264},"labels":[],"label_agreement":null},{"id":"W2136895944","doi":"10.37236/1633","title":"The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Simon Fraser University","funders":"Mitacs; Simon Fraser University","keywords":"Mathematics; Degree (music); Combinatorics; Factorization; Decomposition; Order (exchange); Factor (programming language); Decomposition method (queueing theory); Discrete mathematics; Algorithm; Computer science","score_opus":0.010447136009190892,"score_gpt":0.1896535593282815,"score_spread":0.17920642331909062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136895944","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.94783187,0.03979625,0.007011411,0.00028240014,0.0020589686,0.0003421541,0.000014433376,0.00018639416,0.002476094],"genre_scores_gemma":[0.9952614,0.004528835,0.000006631452,0.0000038586413,0.000043013075,0.0000035715896,0.0000017842115,0.000030087833,0.00012087673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798304,0.00027298008,0.00079690013,0.00007872711,0.0004030839,0.00046527584],"domain_scores_gemma":[0.9982304,0.00040840387,0.00047937522,0.0003573024,0.00046746354,0.000057046338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007265236,0.00018493134,0.0004180918,0.0001414269,0.00024261727,0.000020409965,0.0005660808,0.0000829911,0.000027293829],"category_scores_gemma":[0.00011484133,0.00011845707,0.00020028141,0.0014216407,0.00014247063,0.0001094858,0.000023589453,0.0005645248,0.0000029035705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054656517,0.0003688665,0.002579696,0.0001320428,0.001356777,0.0000036236754,0.0014831236,0.0036793998,0.025865782,0.9606534,0.0026551923,0.0011673938],"study_design_scores_gemma":[0.006038345,0.0018888398,0.023802744,0.0006554942,0.0011187759,0.00057954196,0.00087618746,0.056350663,0.030527042,0.8268174,0.05000617,0.0013388302],"about_ca_topic_score_codex":0.000007904299,"about_ca_topic_score_gemma":0.000009338139,"teacher_disagreement_score":0.13383608,"about_ca_system_score_codex":0.000095272975,"about_ca_system_score_gemma":0.000051852818,"threshold_uncertainty_score":0.48305392},"labels":[],"label_agreement":null},{"id":"W2137217287","doi":"10.37236/1588","title":"Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Plane (geometry); Graph; Spectrum (functional analysis); Colored; Face (sociological concept); Complete coloring; Fractional coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","score_opus":0.01033061752458155,"score_gpt":0.26003673892479384,"score_spread":0.24970612140021228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137217287","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.88730294,0.004378978,0.10119846,0.004957932,0.00026123982,0.00031970048,6.693401e-7,0.000019354884,0.001560759],"genre_scores_gemma":[0.9987655,0.0010258607,0.000055401873,0.00006568222,0.00002259066,0.000002766551,2.210683e-7,0.000008625834,0.00005334745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973777,0.00049824856,0.00052813155,0.0001250147,0.000781241,0.00068965484],"domain_scores_gemma":[0.99807227,0.00075644825,0.0004233345,0.000591109,0.000101804115,0.000055032604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003397999,0.0001460798,0.00029825122,0.00030468675,0.000107929845,0.00004949352,0.0029211063,0.000046032623,0.000008840669],"category_scores_gemma":[0.00013668109,0.00008290875,0.00013608618,0.0018250139,0.00019015445,0.0002931575,0.00009914082,0.0010188334,0.0000041942785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042050793,0.00014808646,0.00042479113,0.000008760343,0.000037850925,0.000050153045,0.0008778473,0.00016008486,0.00044556212,0.997137,0.000042424555,0.00062537874],"study_design_scores_gemma":[0.0008567662,0.00082612736,0.0010906394,0.0000324812,0.000010817869,0.0011366477,0.0003044423,0.0005714256,0.0013069317,0.9934509,0.0003239613,0.00008890254],"about_ca_topic_score_codex":0.0000059215763,"about_ca_topic_score_gemma":0.000012326723,"teacher_disagreement_score":0.11146259,"about_ca_system_score_codex":0.0001464902,"about_ca_system_score_gemma":0.00038640975,"threshold_uncertainty_score":0.5428191},"labels":[],"label_agreement":null},{"id":"W2139572946","doi":"10.37236/1953","title":"Asymptotics of Generating the Symmetric and Alternating Groups","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Symmetric group; Alternating group; Group (periodic table); Physics","score_opus":0.015572134248169917,"score_gpt":0.26789669982978787,"score_spread":0.252324565581618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139572946","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.9776156,0.007899756,0.011886354,0.0017482723,0.00022724191,0.00008992847,3.4989196e-7,0.000007653412,0.00052486645],"genre_scores_gemma":[0.99814194,0.0009393592,0.00036151527,0.000085107175,0.00028173556,8.279502e-7,9.54076e-8,0.000016523389,0.00017289602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998357,0.0001706805,0.00060753553,0.00007715034,0.00039445225,0.00039318172],"domain_scores_gemma":[0.99699825,0.0016914874,0.0008440355,0.00021087627,0.00021098003,0.000044357723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023840647,0.00012604197,0.00030427126,0.00019539296,0.0001706093,0.000024938035,0.00048285731,0.000057146957,0.000009926198],"category_scores_gemma":[0.0011998316,0.000068389025,0.000097909884,0.0007355626,0.000102931706,0.00008362624,0.00009050721,0.00067241496,0.0000010851938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073734964,0.000075808646,0.00043699433,0.000014199204,0.00010625984,0.0000014045751,0.0004519277,0.00008377067,0.0001269865,0.99333495,0.00019049554,0.0051698172],"study_design_scores_gemma":[0.00079395005,0.00047605613,0.00029918257,0.000021273392,0.00015181935,0.00050314044,0.00051593175,0.0020241824,0.0014908505,0.992611,0.0010117816,0.000100850324],"about_ca_topic_score_codex":0.0000042421984,"about_ca_topic_score_gemma":0.0000037375737,"teacher_disagreement_score":0.020526363,"about_ca_system_score_codex":0.00012114593,"about_ca_system_score_gemma":0.00014278982,"threshold_uncertainty_score":0.29213458},"labels":[],"label_agreement":null},{"id":"W2144900670","doi":"10.37236/106","title":"Automorphism Groups of Wreath Product Digraphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":26,"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 Lethbridge","funders":"","keywords":"Wreath product; Combinatorics; Mathematics; Automorphism; Automorphism group; Vertex (graph theory); Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.026173459986637768,"score_gpt":0.3063965851523656,"score_spread":0.28022312516572784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144900670","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.9877918,0.0043280916,0.0024757825,0.0016484899,0.00026615005,0.00032220018,0.0000013939974,0.000036266265,0.0031298331],"genre_scores_gemma":[0.99875253,0.00052811,0.00006566012,0.00003960965,0.00011892613,0.0000016175974,4.887218e-7,0.000026682477,0.0004663994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971833,0.00035002342,0.0007229803,0.00013225719,0.00091687596,0.00069451105],"domain_scores_gemma":[0.9974695,0.0007287469,0.0007246399,0.000588214,0.00039732378,0.00009156418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040999353,0.00019598285,0.0005008605,0.00025670175,0.000114118615,0.00002640481,0.0010365135,0.00006945401,0.000023909903],"category_scores_gemma":[0.0008437566,0.0001268955,0.0002502775,0.0008166078,0.00014085887,0.000167589,0.000049783543,0.0011603563,0.000005282029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016765282,0.0005015296,0.0001358631,0.000024615905,0.00012013403,0.0000140313705,0.00051969115,0.0000030892886,0.0015184985,0.9944328,0.0013507779,0.001211288],"study_design_scores_gemma":[0.00090804585,0.0018441275,0.00053366134,0.00004991669,0.00009692369,0.00033762472,0.00009274424,0.00003204935,0.006028514,0.9890749,0.0008783753,0.00012314168],"about_ca_topic_score_codex":0.0000018936042,"about_ca_topic_score_gemma":0.0000011167489,"teacher_disagreement_score":0.010960714,"about_ca_system_score_codex":0.0002511041,"about_ca_system_score_gemma":0.00045433128,"threshold_uncertainty_score":0.5174648},"labels":[],"label_agreement":null},{"id":"W2146999606","doi":"10.37236/9485","title":"Diameter and Stationary Distribution of Random $r$-Out Digraphs","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Multigraph; Mathematics; Distribution (mathematics); Pi; Upper and lower bounds; Physics; Discrete mathematics; Mathematical analysis; Geometry; Graph","score_opus":0.031695572920484215,"score_gpt":0.30077987329967887,"score_spread":0.2690843003791947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146999606","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.024874143,0.0045803385,0.96863645,0.0008737792,0.00062324386,0.0002687619,0.00007498661,0.000011796488,0.00005652348],"genre_scores_gemma":[0.9975804,0.0018955178,0.00034232266,0.000026718384,0.00007906568,0.0000064782803,0.000014408942,0.000024203411,0.000030901097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808186,0.00013988948,0.0007847376,0.00014882983,0.000541794,0.00030288758],"domain_scores_gemma":[0.9962068,0.0019712402,0.0011428815,0.00021652495,0.00036894376,0.00009357374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246997,0.00021863387,0.0006722006,0.00005419984,0.00006423578,0.00003252223,0.00041145162,0.00014203791,0.000005574018],"category_scores_gemma":[0.0022698794,0.00014787252,0.00018378218,0.00014768333,0.00008591139,0.000046827903,0.00020653596,0.0012582836,6.479051e-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.00027650932,0.000105656,0.000007655164,0.00033198466,0.00026957478,0.000005705056,0.0004159405,0.000008242452,0.000032361648,0.9966891,0.00087461754,0.0009826887],"study_design_scores_gemma":[0.001231238,0.0005718958,0.000031947853,0.00017198545,0.00047522102,0.000041911742,0.00008602566,0.0013782299,0.00023931103,0.9953502,0.00028560858,0.00013642728],"about_ca_topic_score_codex":0.0000020709874,"about_ca_topic_score_gemma":0.0000012499239,"teacher_disagreement_score":0.97270626,"about_ca_system_score_codex":0.00013172092,"about_ca_system_score_gemma":0.00053848093,"threshold_uncertainty_score":0.6030066},"labels":[],"label_agreement":null},{"id":"W2147161887","doi":"10.37236/1909","title":"Generating Function for $K$-Restricted Jagged Partitions","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Lambda; Partition (number theory); Generalization; Generating function; Interpretation (philosophy); Discrete mathematics; Physics","score_opus":0.030646241975829314,"score_gpt":0.3108343208109319,"score_spread":0.28018807883510255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147161887","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.20178665,0.0015841201,0.7930724,0.0019194827,0.00044698193,0.00038785877,0.0000022938057,0.00006181451,0.0007383851],"genre_scores_gemma":[0.99513304,0.00013469128,0.0024879584,0.00006646726,0.00044729275,0.00002157186,0.000001126208,0.000030971543,0.0016768972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985294,0.000076831195,0.00057594886,0.000076663484,0.00031715984,0.00042405157],"domain_scores_gemma":[0.9977072,0.0009953246,0.000522099,0.00020265779,0.0005174634,0.000055288045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078109035,0.0001266528,0.00025107665,0.000079450976,0.000257424,0.000047835874,0.00026416476,0.00005485168,0.000024425752],"category_scores_gemma":[0.0014642805,0.000087580855,0.00014045127,0.00028772245,0.00004365323,0.00027100625,0.000025957743,0.0004217941,0.0000063384614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003302651,0.00015393687,0.0000032410226,0.000024265657,0.00008477488,4.27882e-7,0.00013773007,0.0004109823,0.0009418652,0.99382055,0.0040827566,0.00030644104],"study_design_scores_gemma":[0.0007764348,0.00037374278,0.0000064641995,0.000027034526,0.00018668942,0.000055405664,0.00016643335,0.001541489,0.0016515433,0.9891167,0.006002612,0.00009540635],"about_ca_topic_score_codex":4.6951806e-7,"about_ca_topic_score_gemma":0.000007641292,"teacher_disagreement_score":0.79334635,"about_ca_system_score_codex":0.00031732614,"about_ca_system_score_gemma":0.00021967456,"threshold_uncertainty_score":0.3571444},"labels":[],"label_agreement":null},{"id":"W2147461090","doi":"10.37236/2212","title":"Periodic Rigidity on a Variable Torus Using Inductive Constructions","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; University of Bristol","keywords":"Torus; Rigidity (electromagnetism); Mathematics; Lattice (music); Combinatorics; Pure mathematics; Geometry; Physics; Quantum mechanics","score_opus":0.01904847326597803,"score_gpt":0.22264986934674816,"score_spread":0.20360139608077013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147461090","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.96765596,0.0018205263,0.027592288,0.000049849124,0.0011186339,0.000060252994,0.0000010286641,0.000026340404,0.0016750969],"genre_scores_gemma":[0.99950135,0.00012815472,0.00018973961,0.000011791286,0.00013868455,5.4934634e-7,6.9653356e-7,0.000011682374,0.000017334543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992128,0.000048864193,0.00022229318,0.000051456424,0.000234308,0.00023030025],"domain_scores_gemma":[0.99939215,0.000032260243,0.000120708944,0.000114166425,0.000276798,0.00006391966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024180433,0.00009994215,0.00017436472,0.00008598379,0.00011108425,0.000038011294,0.00016054571,0.000040350507,0.000013344951],"category_scores_gemma":[0.000045859048,0.00006713142,0.00006511488,0.0004053537,0.000036245456,0.0001412942,0.000011324447,0.000446849,0.0000022977772],"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.000036127352,0.000024738963,0.00025957375,0.000007193861,0.00022117465,0.0000028903821,0.0007535624,0.6438086,0.0005150097,0.35357553,0.0003076663,0.00048795977],"study_design_scores_gemma":[0.0030024243,0.0012247098,0.00029512198,0.00007670352,0.000731854,0.0010547979,0.004283023,0.1461009,0.0060741366,0.8262738,0.010279746,0.00060279656],"about_ca_topic_score_codex":0.000010298243,"about_ca_topic_score_gemma":0.0000013734714,"teacher_disagreement_score":0.4977077,"about_ca_system_score_codex":0.0007652404,"about_ca_system_score_gemma":0.0002594203,"threshold_uncertainty_score":0.273754},"labels":[],"label_agreement":null},{"id":"W2148713750","doi":"10.37236/1708","title":"A Discontinuity in the Distribution of Fixed Point Sums","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","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":"University of Waterloo","funders":"","keywords":"Mathematics; Classification of discontinuities; Combinatorics; Discontinuity (linguistics); Fixed point; Graph; Set (abstract data type); Distribution (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.013936505854175243,"score_gpt":0.26983294129258945,"score_spread":0.2558964354384142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148713750","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.992359,0.0013007156,0.0045196633,0.00037889372,0.00026475865,0.00015197197,0.0000021635176,0.000003732951,0.0010191373],"genre_scores_gemma":[0.99968755,0.00019203134,0.000011212466,0.000027415814,0.000027221467,0.0000017028574,5.355783e-7,0.000008590767,0.0000437214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981391,0.0005810265,0.00050923973,0.0000615852,0.00037657862,0.00033249514],"domain_scores_gemma":[0.9982622,0.00077477744,0.00049882405,0.00030955108,0.00013138498,0.000023217195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041157585,0.0001129264,0.00027104936,0.00004548571,0.00011544118,0.000015824782,0.00053244934,0.000055790708,0.000009602992],"category_scores_gemma":[0.000896491,0.000054481094,0.00016579461,0.00034715416,0.0001028184,0.00007709877,0.000029609886,0.0007081913,2.3014974e-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.000038954156,0.00013409091,0.00059482106,0.0000130379885,0.000040896455,0.000002890982,0.0014180155,0.0000044559883,0.000039683015,0.9972394,0.00037223275,0.00010150982],"study_design_scores_gemma":[0.00065378944,0.0002475506,0.0013739385,0.000025010004,0.000059781116,0.00013862993,0.00070459367,0.00000823962,0.0011526676,0.9945929,0.0009792417,0.00006366582],"about_ca_topic_score_codex":0.0000036131416,"about_ca_topic_score_gemma":0.000008765205,"teacher_disagreement_score":0.0073286053,"about_ca_system_score_codex":0.0001431814,"about_ca_system_score_gemma":0.00014705567,"threshold_uncertainty_score":0.3076778},"labels":[],"label_agreement":null},{"id":"W2149489229","doi":"10.37236/1720","title":"Binary Gray Codes with Long Bit Runs","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Gray code; Combinatorics; Subsequence; Hamming distance; Binary number; Hamming code; Gray (unit); Discrete mathematics; Arithmetic; Algorithm; Block code; Decoding methods","score_opus":0.005235754770155271,"score_gpt":0.2027874407928435,"score_spread":0.19755168602268822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149489229","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.35636464,0.007481368,0.63135266,0.0009927199,0.00077790924,0.00012481998,2.1299577e-7,0.00006314934,0.0028424927],"genre_scores_gemma":[0.99921024,0.0003725084,0.00017685232,0.00008918033,0.000034300694,0.0000015383921,9.208674e-8,0.000011361705,0.00010392248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836123,0.00030296575,0.0002617173,0.00013107648,0.0004176118,0.00052538933],"domain_scores_gemma":[0.9987514,0.00023236114,0.000300462,0.00043584604,0.00019328872,0.00008661823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017971871,0.00015433192,0.00021538162,0.00016489977,0.00025073343,0.00010632716,0.0012394044,0.00004134137,0.0000075455255],"category_scores_gemma":[0.000042535452,0.00009103895,0.00013100087,0.001082631,0.000091227215,0.0003352697,0.00005131245,0.0006467851,0.000004972134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000319944,0.00011687382,0.00093779963,0.000004778644,0.00008273413,0.000021546975,0.00021772804,0.0000837365,0.000107908316,0.99778455,0.00018011927,0.00043022828],"study_design_scores_gemma":[0.0008091916,0.0018750505,0.00061203755,0.00004051337,0.000051340958,0.0010060383,0.00006894457,0.00011411462,0.0020952118,0.983494,0.009647385,0.00018621687],"about_ca_topic_score_codex":0.0000011899392,"about_ca_topic_score_gemma":0.0000023508103,"teacher_disagreement_score":0.64284563,"about_ca_system_score_codex":0.00007583398,"about_ca_system_score_gemma":0.00043523757,"threshold_uncertainty_score":0.37124607},"labels":[],"label_agreement":null},{"id":"W2149698442","doi":"10.37236/1013","title":"Nonexistence of Permutation Binomials of Certain Shapes","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"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 Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Prime (order theory); Discrete mathematics","score_opus":0.008703562126573168,"score_gpt":0.24210384104737448,"score_spread":0.2334002789208013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149698442","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.59281135,0.0015244514,0.40440434,0.00022509949,0.00020791365,0.000058151512,2.436991e-7,0.000008404579,0.0007600333],"genre_scores_gemma":[0.9995555,0.00016113365,0.00020173594,0.000025221763,0.000029705692,3.068908e-7,7.854104e-8,0.0000047998487,0.000021461525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985683,0.00013113742,0.0005443587,0.00007989725,0.0003783943,0.00029791842],"domain_scores_gemma":[0.9981516,0.00050086295,0.0007722385,0.00021851312,0.00031500586,0.000041780313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036125656,0.00008861375,0.00023398173,0.00020443017,0.000065181295,0.00001636257,0.001087089,0.000040744577,0.0000037775903],"category_scores_gemma":[0.000102559774,0.00006264055,0.00016320798,0.0007510932,0.000089643705,0.00018571442,0.00006264477,0.00027556036,7.4646425e-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.00006392328,0.00009513843,0.00024558438,0.000012318707,0.00004304717,0.000002430927,0.0008734456,0.0000771449,0.007260448,0.98724395,0.000013634745,0.0040689292],"study_design_scores_gemma":[0.0004945321,0.0010349511,0.0019424079,0.000039898463,0.00003290107,0.000087763154,0.00019693657,0.00043013188,0.038547732,0.95679027,0.0003173124,0.00008515417],"about_ca_topic_score_codex":0.000004316524,"about_ca_topic_score_gemma":0.0000021262097,"teacher_disagreement_score":0.40674418,"about_ca_system_score_codex":0.000069006885,"about_ca_system_score_gemma":0.00023822376,"threshold_uncertainty_score":0.25544077},"labels":[],"label_agreement":null},{"id":"W2153847184","doi":"10.37236/1511","title":"Asymptotics for the Probability of Connectedness and the Distribution of Number of Components","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Social connectedness; Vertex (graph theory); Fraction (chemistry); Tree (set theory); Giant component; Series (stratigraphy); Discrete mathematics; Graph; Random graph","score_opus":0.021609686398760448,"score_gpt":0.29221563930386674,"score_spread":0.2706059529051063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153847184","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.96777976,0.00083387905,0.02968502,0.00048377743,0.00026783012,0.0008246394,0.000014343773,0.0000069170815,0.00010385626],"genre_scores_gemma":[0.99925166,0.00047124413,0.00015608908,0.0000058855785,0.000037016398,0.000010111723,0.000001348093,0.000020245834,0.000046374105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976548,0.00029370174,0.0011153022,0.00008964483,0.00053634413,0.00031020245],"domain_scores_gemma":[0.9911784,0.005922838,0.0015172849,0.0005001154,0.00084734155,0.00003402477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030536116,0.00017315472,0.0006844016,0.000019670693,0.00012984764,0.000010290548,0.00067882263,0.00008087942,0.000010792037],"category_scores_gemma":[0.0015939659,0.000084864216,0.00022725285,0.00031320725,0.0005902704,0.00008381939,0.000062771884,0.00042175734,2.907879e-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.0006230625,0.00041286388,0.00012998939,0.0002385538,0.00023627708,1.3578075e-7,0.00067417545,0.00008645112,0.00010381667,0.99713683,0.000058700367,0.00029916057],"study_design_scores_gemma":[0.0033968568,0.00033209744,0.00015154215,0.000089835245,0.00042145414,0.00005494105,0.00019788007,0.0010207897,0.0033183675,0.99069864,0.00023783364,0.00007974218],"about_ca_topic_score_codex":0.0000063728344,"about_ca_topic_score_gemma":0.0000013992094,"teacher_disagreement_score":0.03147195,"about_ca_system_score_codex":0.0001426536,"about_ca_system_score_gemma":0.00020289092,"threshold_uncertainty_score":0.34606624},"labels":[],"label_agreement":null},{"id":"W2154125058","doi":"10.37236/4283","title":"Partial List Colouring of Certain Graphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Chromatic scale; Chordal graph; Graph; Discrete mathematics","score_opus":0.023696122225726795,"score_gpt":0.28696886160853197,"score_spread":0.26327273938280515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154125058","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.5968964,0.0050169905,0.39413083,0.0018615461,0.00084281364,0.0001866987,4.907703e-7,0.00003382281,0.0010303933],"genre_scores_gemma":[0.9994472,0.0001758915,0.0001518403,0.000029211207,0.000041970303,0.0000017486879,9.271484e-8,0.000010302922,0.00014168733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977349,0.0003483371,0.00042788743,0.000114471295,0.0007905925,0.00058382854],"domain_scores_gemma":[0.99803823,0.00031121334,0.00044991795,0.0004571332,0.00058456906,0.00015891752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033127822,0.000115538605,0.00026028874,0.00018953868,0.0000946968,0.00004504056,0.0019928985,0.000044538872,0.0000023751595],"category_scores_gemma":[0.00030930366,0.00007992462,0.00013322182,0.0009821694,0.0001377645,0.0003691048,0.00021530567,0.0007109269,0.0000029569999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007460968,0.00009362292,0.0003228158,0.000004630856,0.000045588687,0.000011929411,0.0004293911,0.00033495747,0.0004138221,0.9972379,0.00015795216,0.00087278517],"study_design_scores_gemma":[0.0008549841,0.0010374015,0.000051269864,0.000014451021,0.000012265088,0.00014512807,0.000106877575,0.0010195652,0.009801299,0.9844875,0.002384501,0.00008475373],"about_ca_topic_score_codex":0.000006617096,"about_ca_topic_score_gemma":0.000002783564,"teacher_disagreement_score":0.40255085,"about_ca_system_score_codex":0.00022952895,"about_ca_system_score_gemma":0.00082381256,"threshold_uncertainty_score":0.37033343},"labels":[],"label_agreement":null},{"id":"W2157882570","doi":"10.37236/1802","title":"Partition Identities I: Sandwich Theorems and Logical 0–1 Laws","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"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 Waterloo","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Identity (music); Partition function (quantum field theory); Function (biology); Discrete mathematics; Physics; Quantum mechanics","score_opus":0.03425596884997151,"score_gpt":0.3151625725292277,"score_spread":0.2809066036792562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157882570","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.83493805,0.0041642804,0.15566139,0.0013687946,0.00038347347,0.00023463872,0.0000015113206,0.000059343893,0.0031885046],"genre_scores_gemma":[0.99688596,0.0013736195,0.00036911003,0.00004800422,0.000119199176,0.000004870637,4.870273e-7,0.000026371543,0.0011723739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982308,0.00011258085,0.0005554519,0.0001077874,0.0005188086,0.0004745617],"domain_scores_gemma":[0.99841934,0.00060956576,0.0004265994,0.00024169324,0.00021958024,0.00008322806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012815696,0.00017946366,0.00037871275,0.00008019446,0.00020075138,0.000095020354,0.0003429391,0.00008095637,0.00003999912],"category_scores_gemma":[0.000764288,0.000113596834,0.00012701796,0.00019150692,0.00026260864,0.00032680112,0.00008514408,0.0006359883,0.00001400636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002931346,0.00014745268,0.000021386171,0.000047303623,0.0000659382,0.000007425408,0.00060067134,0.00002182134,0.000251967,0.9984779,0.00029281055,0.000036016114],"study_design_scores_gemma":[0.00090094574,0.0002902382,0.000032415155,0.00007774941,0.00011710146,0.0005364313,0.00040681678,0.000003855225,0.0013148634,0.9955183,0.0006701208,0.00013111263],"about_ca_topic_score_codex":0.000002139336,"about_ca_topic_score_gemma":0.000012832722,"teacher_disagreement_score":0.1619479,"about_ca_system_score_codex":0.0002792562,"about_ca_system_score_gemma":0.00015239642,"threshold_uncertainty_score":0.46323445},"labels":[],"label_agreement":null},{"id":"W2158786496","doi":"10.37236/133","title":"Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"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","keywords":"Mixing (physics); Combinatorics; Mathematics; Distribution (mathematics); Limiting; Random graph; Convergence (economics); Upper and lower bounds; Discrete mathematics; Graph; Physics; Mathematical analysis; Engineering; Quantum mechanics","score_opus":0.006845715348464086,"score_gpt":0.24323822253586894,"score_spread":0.23639250718740484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158786496","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.99347615,0.0025273236,0.0032015422,0.00026794718,0.00026955886,0.0001567955,0.0000048273114,0.000004868956,0.00009097569],"genre_scores_gemma":[0.99913245,0.00077584083,0.0000076252213,0.000027715236,0.000016150549,7.3904977e-7,0.0000012896699,0.000008828207,0.000029344606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819624,0.00041560328,0.0006804013,0.000079305064,0.0003189711,0.0003094748],"domain_scores_gemma":[0.9985581,0.00027994908,0.0005873483,0.00030647786,0.00023814024,0.000029978715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00232288,0.00013152516,0.0003807961,0.000057709625,0.00011749405,0.000007843579,0.0005778959,0.000072209245,0.000005587597],"category_scores_gemma":[0.0002810082,0.00007347587,0.00019622192,0.0005747408,0.00012663602,0.00007609002,0.000037103917,0.0005271026,4.9557432e-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.00020439034,0.000113892085,0.00056348037,0.0000156479,0.00006930924,0.000001269487,0.00030453387,0.000104341176,0.010526516,0.9874198,0.00047988503,0.00019695896],"study_design_scores_gemma":[0.0011525273,0.00020217863,0.0009917602,0.000053165357,0.00007889973,0.00002754836,0.00006923643,0.00029329804,0.06932508,0.9276409,0.00009150704,0.000073858806],"about_ca_topic_score_codex":0.000004211821,"about_ca_topic_score_gemma":0.0000017170389,"teacher_disagreement_score":0.05977884,"about_ca_system_score_codex":0.00011442089,"about_ca_system_score_gemma":0.00015918833,"threshold_uncertainty_score":0.2996259},"labels":[],"label_agreement":null},{"id":"W2158866396","doi":"10.37236/840","title":"Subsums of a Zero-sum Free Subset of an Abelian Group","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Brock University; National Science Foundation","keywords":"Mathematics; Combinatorics; Abelian group; Zero (linguistics); Multiplicity (mathematics); Group (periodic table); Free abelian group; Cyclic group; Sequence (biology); Discrete mathematics; Free group; Elementary abelian group; Rank of an abelian group","score_opus":0.022454115667807414,"score_gpt":0.2539444686465083,"score_spread":0.2314903529787009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158866396","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.99440813,0.002360095,0.0022432895,0.0001782341,0.0002686292,0.00013297892,0.0000039367937,0.00001596645,0.00038871448],"genre_scores_gemma":[0.9982416,0.0012380237,0.00020973991,0.000022389466,0.00009403291,0.0000014836975,0.0000011740871,0.000040326686,0.00015121896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975312,0.00018082508,0.00090494636,0.00012306648,0.00072636444,0.00053364376],"domain_scores_gemma":[0.9973341,0.00032052808,0.0011798484,0.0006941395,0.00036474701,0.00010661614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015225777,0.00020519721,0.0006185538,0.00017161058,0.0001189852,0.000010359087,0.0011497049,0.000103328515,0.000017063248],"category_scores_gemma":[0.0003066669,0.00014453533,0.00025191702,0.00041859577,0.00019936176,0.00022850953,0.00007255916,0.00068402546,0.00000196779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013299433,0.00089380535,0.0010640251,0.000085762025,0.0002142545,0.000020236064,0.0013076619,0.0000079989595,0.0033813536,0.99085724,0.0018121864,0.00022247418],"study_design_scores_gemma":[0.0016610848,0.0014931704,0.0014058114,0.00006859584,0.0001235014,0.00043955958,0.00015272191,0.000038499467,0.018561095,0.97543114,0.00047357674,0.00015124626],"about_ca_topic_score_codex":0.000025836294,"about_ca_topic_score_gemma":0.00002436762,"teacher_disagreement_score":0.0154261105,"about_ca_system_score_codex":0.00014982982,"about_ca_system_score_gemma":0.00035128146,"threshold_uncertainty_score":0.58939797},"labels":[],"label_agreement":null},{"id":"W2164275177","doi":"10.37236/786","title":"The MacNeille Completion of the Poset of Partial Injective Functions","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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":"Bijection; Partially ordered set; Mathematics; Injective function; Combinatorics; Lattice (music); Bijection, injection and surjection; Order (exchange); Discrete mathematics","score_opus":0.008656765092015992,"score_gpt":0.2079197260052317,"score_spread":0.19926296091321571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164275177","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.6789513,0.0034846263,0.31193894,0.003018828,0.0014578298,0.00021923115,0.0000019027624,0.000015634678,0.00091169396],"genre_scores_gemma":[0.999316,0.00041231659,0.000023559616,0.000043668704,0.00004812411,0.0000015944795,1.386947e-7,0.000004772553,0.00014983314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985733,0.00023929836,0.00038223027,0.00007685464,0.00043984715,0.0002884711],"domain_scores_gemma":[0.9982132,0.00035972573,0.0006559507,0.00039620185,0.00034635875,0.00002856167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067381555,0.00009007285,0.00018426492,0.000038876195,0.00046927304,0.000011590914,0.0011939764,0.00003164623,0.000002037743],"category_scores_gemma":[0.000107644155,0.000041544285,0.00016200711,0.00059376314,0.0002273275,0.00015224708,0.00013581164,0.0004884655,0.0000015687328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037093683,0.000097395365,0.0004601757,0.0000021109736,0.000055202527,0.000001032314,0.00043578426,0.00061128347,0.0005217948,0.9967352,0.0004993878,0.0005435089],"study_design_scores_gemma":[0.0010927116,0.0015638096,0.01173396,0.000023502702,0.000054227454,0.00063606806,0.00029380477,0.0019348308,0.012346335,0.96295416,0.007230194,0.00013642195],"about_ca_topic_score_codex":0.000005815148,"about_ca_topic_score_gemma":0.000003221759,"teacher_disagreement_score":0.32036465,"about_ca_system_score_codex":0.00012424051,"about_ca_system_score_gemma":0.00040550198,"threshold_uncertainty_score":0.36093163},"labels":[],"label_agreement":null},{"id":"W2167078769","doi":"10.37236/818","title":"Generating Random Elements in Finite Groups","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Cube (algebra); Order (exchange); Product (mathematics); Distribution (mathematics); Random variable; Geometry; Mathematical analysis; Statistics","score_opus":0.042229366751203416,"score_gpt":0.307844554762813,"score_spread":0.2656151880116096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167078769","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.98986155,0.0014664454,0.007285843,0.00027830864,0.000213004,0.00021763952,5.5898334e-7,0.00001371091,0.0006629364],"genre_scores_gemma":[0.9984974,0.00066559395,0.00014766959,0.000049695438,0.00014241364,0.0000065333834,5.936607e-7,0.000035212946,0.0004548624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968513,0.0006141432,0.000863366,0.0001136007,0.00077680335,0.00078074797],"domain_scores_gemma":[0.9968157,0.002065897,0.00049155095,0.00031697602,0.00023605987,0.00007380779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053690765,0.0001705984,0.00041077356,0.00023868312,0.00021415323,0.000026580681,0.00072993734,0.00007319959,0.000044620774],"category_scores_gemma":[0.0016515612,0.000117574426,0.00014789602,0.0006330927,0.00009042723,0.0001709243,0.00009230113,0.0013747609,0.000012664716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004994115,0.00048253892,0.0041048336,0.00003342136,0.00015204049,0.0001151783,0.002002882,0.0003808617,0.0007326028,0.99015254,0.00097537815,0.00036832047],"study_design_scores_gemma":[0.004971112,0.00053665123,0.00018376177,0.00004084071,0.000027718426,0.00032319367,0.00018837661,0.0023450968,0.00064515084,0.9900309,0.0005651352,0.00014208532],"about_ca_topic_score_codex":0.0000034702653,"about_ca_topic_score_gemma":0.000010196731,"teacher_disagreement_score":0.008635872,"about_ca_system_score_codex":0.0004565134,"about_ca_system_score_gemma":0.00044522402,"threshold_uncertainty_score":0.5972729},"labels":[],"label_agreement":null},{"id":"W2167520368","doi":"10.37236/1108","title":"Binary Words Containing Infinitely Many Overlaps","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"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 Waterloo; University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Binary number; Discrete mathematics; Arithmetic","score_opus":0.005592234311851341,"score_gpt":0.21008657108623313,"score_spread":0.20449433677438178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167520368","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.69244266,0.010430046,0.28812337,0.0023174505,0.0013886921,0.00012510415,5.5535116e-7,0.000114701135,0.0050574085],"genre_scores_gemma":[0.9988917,0.00021367116,0.00011375941,0.00024339248,0.00018966147,0.0000014757753,4.3471732e-7,0.000014947943,0.00033093456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808246,0.000170571,0.00048704032,0.000137096,0.0004972604,0.0006255912],"domain_scores_gemma":[0.99849176,0.00036368505,0.00049894577,0.00043223213,0.00015441368,0.00005895768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017532813,0.00016759681,0.0002668449,0.0001553155,0.00019340796,0.00015282724,0.0016501584,0.000062940286,0.00000914833],"category_scores_gemma":[0.000046190296,0.00011503922,0.0001552717,0.00064152526,0.000058158992,0.00049256015,0.00017651152,0.0007239631,0.000014001046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024557958,0.0000882518,0.00024293091,0.0000032745493,0.00003143075,0.000038651313,0.00016807523,0.00014436236,0.00039019054,0.99624985,0.0009848608,0.0016335589],"study_design_scores_gemma":[0.00085264316,0.0008179268,0.0017548543,0.000033434168,0.000022942233,0.00048005697,0.00009325633,0.0038285577,0.0007915665,0.9793375,0.01181292,0.00017434028],"about_ca_topic_score_codex":0.00001572387,"about_ca_topic_score_gemma":0.0000016500907,"teacher_disagreement_score":0.30644903,"about_ca_system_score_codex":0.00025476512,"about_ca_system_score_gemma":0.00039652715,"threshold_uncertainty_score":0.4691163},"labels":[],"label_agreement":null},{"id":"W2167682233","doi":"10.37236/310","title":"On a Rado Type Problem for Homogeneous Second Order Linear Recurrences","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Homogeneous; Monochromatic color; Type (biology); Order (exchange); Class (philosophy); Sequence (biology); Function (biology); Generating function; Discrete mathematics; Physics; Computer science","score_opus":0.014624137019942968,"score_gpt":0.29164984536154404,"score_spread":0.27702570834160106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167682233","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.99140483,0.0010814945,0.0023030401,0.00032234183,0.0024172345,0.00036702733,0.0000038486605,0.000021206455,0.0020789623],"genre_scores_gemma":[0.9980617,0.00014044385,0.00070100214,0.00008454162,0.0002650528,0.0000043313707,5.568515e-7,0.000028802442,0.0007135629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998716,0.00008161067,0.00038404597,0.00010595038,0.00028844815,0.00042393344],"domain_scores_gemma":[0.99766636,0.0010345385,0.00043512808,0.00029655287,0.00050746446,0.000059979622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014425599,0.00016126799,0.00027599797,0.00008625511,0.00027704355,0.000027387723,0.0006017533,0.000111090856,0.00008000441],"category_scores_gemma":[0.0007129251,0.00009256138,0.00014243257,0.00027467957,0.00008464689,0.000055979042,0.000038924518,0.0011216853,0.0000020122463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018464967,0.00010404572,0.000015032413,0.000029406525,0.00010871015,0.000002111529,0.00046363758,0.00000706181,0.00024950155,0.9957757,0.0022067137,0.00085341826],"study_design_scores_gemma":[0.0006927426,0.0014191329,0.0000056979657,0.000018921555,0.00007416623,0.0002058772,0.000045747624,0.000058957892,0.0016071411,0.9770371,0.01871446,0.000120055505],"about_ca_topic_score_codex":4.587531e-7,"about_ca_topic_score_gemma":0.000010529614,"teacher_disagreement_score":0.01873861,"about_ca_system_score_codex":0.000052041927,"about_ca_system_score_gemma":0.00034036455,"threshold_uncertainty_score":0.48732266},"labels":[],"label_agreement":null},{"id":"W2169650883","doi":"10.37236/1694","title":"Bent Hamilton Cycles in $d$-Dimensional Grid Graphs","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":30,"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 Victoria; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bent molecular geometry; Combinatorics; Mathematics; Hamiltonian path; Dimension (graph theory); Graph; Grid; Path (computing); Discrete mathematics; Geometry; Computer science","score_opus":0.029576155375452277,"score_gpt":0.30822040826432284,"score_spread":0.27864425288887057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169650883","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.99422324,0.0026407165,0.00037312694,0.0003207669,0.0004493329,0.00018322263,8.986725e-7,0.000012939124,0.0017957401],"genre_scores_gemma":[0.9991183,0.00044433214,0.00006498775,0.00004856215,0.000044057822,0.000004044747,4.7499412e-7,0.0000334162,0.00024178802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693,0.00068943005,0.0006280046,0.00012628328,0.00084803824,0.0007782363],"domain_scores_gemma":[0.9976447,0.001324817,0.00034428498,0.00034805015,0.00024443254,0.0000936671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051870937,0.0001815364,0.0003581323,0.00030487828,0.00012057471,0.00003107687,0.00058450585,0.000088299086,0.00006257056],"category_scores_gemma":[0.00078934216,0.00012286182,0.00017367706,0.00069619756,0.00010447052,0.0001299616,0.00004228045,0.0014092562,0.000012845416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000883849,0.00036152566,0.00063947536,0.000016519398,0.00006495169,0.000027710617,0.00032580507,0.000043198466,0.00032316952,0.9973125,0.0007272313,0.00006951892],"study_design_scores_gemma":[0.0012392928,0.00047044252,0.00032617743,0.000046364992,0.000030221092,0.00032163836,0.00015743388,0.000034964352,0.0022300056,0.99300295,0.0020128353,0.00012764627],"about_ca_topic_score_codex":0.000003770195,"about_ca_topic_score_gemma":0.000015063765,"teacher_disagreement_score":0.00489508,"about_ca_system_score_codex":0.00048738305,"about_ca_system_score_gemma":0.00048236758,"threshold_uncertainty_score":0.61225957},"labels":[],"label_agreement":null},{"id":"W2173879057","doi":"10.37236/5741","title":"A Hopf Algebraic Approach to Schur Function Identities","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"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 Waterloo","funders":"","keywords":"Hopf algebra; Schur's theorem; Mathematics; Pure mathematics; Algebraic number; Function (biology); Schur algebra; Algebra over a field; Mathematical analysis; Orthogonal polynomials","score_opus":0.04252571557234849,"score_gpt":0.3185492930964872,"score_spread":0.27602357752413875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173879057","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.1813278,0.008383765,0.7732212,0.0013579981,0.017593697,0.0023841304,0.000011812428,0.00024335836,0.015476219],"genre_scores_gemma":[0.994372,0.0007220227,0.0012768488,0.00006644057,0.0010019307,0.00006269808,0.0000033400636,0.00017043875,0.0023242845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952703,0.0002824113,0.0014073851,0.00039596416,0.0015749265,0.0010690122],"domain_scores_gemma":[0.9924847,0.00070704485,0.0033926982,0.0020647864,0.0011287095,0.00022209492],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035696498,0.0006675877,0.0013726387,0.0004022468,0.0005181316,0.00043174688,0.003377617,0.00045890373,0.00001147318],"category_scores_gemma":[0.0027254412,0.0004994433,0.0006215019,0.00029779228,0.00014803866,0.0003341664,0.0012468293,0.0039782305,0.000029764931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012128611,0.00046109807,0.0000060493912,0.00040262952,0.0005497001,0.0000068474415,0.00084592856,0.00018239424,0.00003157227,0.99130636,0.0058571133,0.00022901701],"study_design_scores_gemma":[0.0009572283,0.000607441,0.00001537325,0.00036751406,0.00071716856,0.00020956932,0.00030978105,0.000116084055,0.00022878288,0.9934214,0.0025677588,0.0004819183],"about_ca_topic_score_codex":0.0000046582704,"about_ca_topic_score_gemma":0.0000022937586,"teacher_disagreement_score":0.8130442,"about_ca_system_score_codex":0.0013179159,"about_ca_system_score_gemma":0.0014243517,"threshold_uncertainty_score":0.9997457},"labels":[],"label_agreement":null},{"id":"W2174316934","doi":"10.37236/5725","title":"Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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 Regina","funders":"","keywords":"Eigenvalues and eigenvectors; Diagonal; Multiplicity (mathematics); Combinatorics; Mathematics; Property (philosophy); Graph; Graph theory; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.03057293810492978,"score_gpt":0.3075423517524653,"score_spread":0.2769694136475355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174316934","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.9882129,0.0030735112,0.0045186663,0.0013161682,0.00028311103,0.00080361083,0.00003217667,0.0000070281762,0.0017528485],"genre_scores_gemma":[0.9981223,0.0012796662,0.00005381286,0.0000070493347,0.000046782494,0.0000202909,0.0000013430588,0.000025654806,0.00044314703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766845,0.00053489377,0.0009354933,0.0001282426,0.0004724805,0.0002604295],"domain_scores_gemma":[0.99418163,0.00067294075,0.0033820202,0.0011489345,0.00057952676,0.000034943896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024271817,0.00022259499,0.0006836304,0.00006160582,0.0003050458,0.000027879749,0.0016175883,0.00013225674,0.000009290333],"category_scores_gemma":[0.0005404435,0.000091049,0.0004602425,0.00020516338,0.0009690871,0.000047798057,0.00041860988,0.0009590544,1.8609471e-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.00007692674,0.0002270751,0.00091618166,0.00019237003,0.00043391786,1.4611497e-7,0.0009043875,0.000053196567,0.00015706972,0.996726,0.00024380528,0.00006892564],"study_design_scores_gemma":[0.0008197812,0.00006579345,0.0004948239,0.0002531029,0.00075334054,0.00003790609,0.00017853583,0.00013467582,0.0024246979,0.9945486,0.00019043163,0.00009826242],"about_ca_topic_score_codex":0.0000352696,"about_ca_topic_score_gemma":0.000015683658,"teacher_disagreement_score":0.009909374,"about_ca_system_score_codex":0.00004979403,"about_ca_system_score_gemma":0.0005277137,"threshold_uncertainty_score":0.41666675},"labels":[],"label_agreement":null},{"id":"W2216988477","doi":"10.37236/4141","title":"Thin Edges in Braces","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Graph; Isomorphism (crystallography); Matching (statistics); Brace; Discrete mathematics; Physics; Crystallography","score_opus":0.025499532920950443,"score_gpt":0.2907831718446497,"score_spread":0.26528363892369927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216988477","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.49108157,0.02691381,0.4671889,0.009914276,0.0014384135,0.00025781634,2.8358e-7,0.00005968197,0.0031452456],"genre_scores_gemma":[0.99909824,0.00037368765,0.00013970803,0.000069672395,0.000046123525,0.0000013723361,3.738426e-8,0.000007791235,0.00026338233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980769,0.00034192886,0.00030229427,0.00010596375,0.00062986417,0.0005430113],"domain_scores_gemma":[0.9986892,0.0003146361,0.00021741072,0.00037286838,0.00029702473,0.00010888528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030887797,0.00009776919,0.00018681263,0.0002154325,0.000058895363,0.00007178329,0.002137177,0.000038952567,0.000001719464],"category_scores_gemma":[0.00033358327,0.0000634274,0.00006109055,0.0010245031,0.00006933528,0.00060290383,0.00019523018,0.0009261155,0.000011313638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028714003,0.000069002795,0.0004089428,0.0000018428855,0.00001325262,0.000019528874,0.000768345,0.00035251497,0.000053228672,0.9951822,0.000278658,0.0028237524],"study_design_scores_gemma":[0.0006906152,0.0004851349,0.00025275297,0.00001162265,0.0000022578024,0.00016674798,0.00012286958,0.0011149509,0.001422704,0.9926404,0.0030153587,0.00007459531],"about_ca_topic_score_codex":0.000003421959,"about_ca_topic_score_gemma":0.0000072543726,"teacher_disagreement_score":0.50801665,"about_ca_system_score_codex":0.00034189076,"about_ca_system_score_gemma":0.0008130921,"threshold_uncertainty_score":0.40235627},"labels":[],"label_agreement":null},{"id":"W2235120461","doi":"10.37236/5417","title":"Guaranteed Scoring Games","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior; Killam Trusts","keywords":"Monoid; Congruence (geometry); Quotient; Mathematics; Combinatorial game theory; Class (philosophy); Property (philosophy); Combinatorics; Order (exchange); Characterization (materials science); Inverse; Discrete mathematics; Computer science; Mathematical economics; Game theory; Sequential game; Artificial intelligence","score_opus":0.019575124930690267,"score_gpt":0.2739163162272167,"score_spread":0.25434119129652644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235120461","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.04462467,0.012461594,0.92946446,0.005141897,0.006178419,0.00023491081,0.0000010261269,0.000086175285,0.0018068643],"genre_scores_gemma":[0.99704075,0.0017919621,0.00014069179,0.0001369265,0.00047345512,0.0000054257325,1.18254086e-7,0.000028002192,0.00038267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996682,0.00028288018,0.00093531265,0.00031265692,0.0008997871,0.00088736037],"domain_scores_gemma":[0.99620044,0.0005209719,0.001400215,0.0011885923,0.0005897086,0.000100086894],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0024654043,0.00033392097,0.0005498096,0.0002476664,0.0001640417,0.00028415478,0.0057846806,0.00020370165,0.0000092306545],"category_scores_gemma":[0.00031750798,0.00019899652,0.0003892738,0.00035664043,0.00014542585,0.0003176434,0.0013660553,0.0022698233,0.00004056543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018503584,0.00006118261,0.00011236971,0.000017092563,0.00013841421,0.000022032818,0.00066631666,0.00021629273,0.00021169001,0.98885083,0.0006311564,0.009054097],"study_design_scores_gemma":[0.00013719332,0.00025651566,0.000037353715,0.00027024155,0.000042068103,0.00020230634,0.000049209168,0.0013374815,0.009584923,0.9826143,0.0052242097,0.00024423102],"about_ca_topic_score_codex":0.000008536292,"about_ca_topic_score_gemma":0.0000027701199,"teacher_disagreement_score":0.95241606,"about_ca_system_score_codex":0.00070550037,"about_ca_system_score_gemma":0.0017209706,"threshold_uncertainty_score":0.9995945},"labels":[],"label_agreement":null},{"id":"W2255180715","doi":"10.37236/5642","title":"Symmetric Graphs with Respect to Graph Entropy","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":"Google (Canada); Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Windmill graph; Circulant graph; Vertex (graph theory); Discrete mathematics; Regular graph; Symmetric graph; Graph power; Graph; Line graph; Voltage graph","score_opus":0.021390075938804196,"score_gpt":0.29134162780386147,"score_spread":0.26995155186505726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255180715","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.9615182,0.012958139,0.010763153,0.0022794334,0.0044101896,0.0011881863,0.000014103016,0.000085050495,0.006783545],"genre_scores_gemma":[0.9964724,0.0022939146,0.00025260638,0.00010444136,0.00031098616,0.00001234135,0.0000010535917,0.000095002215,0.0004572173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961143,0.00040422214,0.0008611136,0.0003414562,0.0012824856,0.0009964127],"domain_scores_gemma":[0.9940786,0.00086671795,0.0022091186,0.001859406,0.0007614355,0.00022472914],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031979177,0.0005597249,0.001076079,0.0009163404,0.000724857,0.00022852425,0.0033531468,0.00031069136,0.000016617209],"category_scores_gemma":[0.001058418,0.00031418097,0.00061245926,0.0006541607,0.00022226744,0.00010151898,0.00080834766,0.003906203,0.0000025860911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039856348,0.00009334468,0.00018250302,0.00008844234,0.00087465515,0.000049380407,0.00065954623,0.00003759438,0.000014804719,0.99497765,0.0022861725,0.00033734037],"study_design_scores_gemma":[0.00093705446,0.0012601556,0.00024012283,0.0002747317,0.0006106043,0.00038643682,0.000086764485,0.0000062170643,0.0004096851,0.9932162,0.0021625445,0.00040944596],"about_ca_topic_score_codex":0.000010693736,"about_ca_topic_score_gemma":0.000010541576,"teacher_disagreement_score":0.03495424,"about_ca_system_score_codex":0.00047194635,"about_ca_system_score_gemma":0.00087246683,"threshold_uncertainty_score":0.99993104},"labels":[],"label_agreement":null},{"id":"W2256344519","doi":"10.37236/5752","title":"Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"","keywords":"Palindrome; Sequence (biology); Fibonacci number; Palindromic sequence; Function (biology); Order (exchange); Mathematics; Generating function; Prefix; Property (philosophy); Combinatorics; Discrete mathematics; Algorithm; Arithmetic","score_opus":0.007368100112925745,"score_gpt":0.2320644672937312,"score_spread":0.22469636718080546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256344519","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.8968421,0.016143946,0.081421696,0.00329438,0.0016097653,0.00034283032,0.000002752462,0.00008068261,0.00026181122],"genre_scores_gemma":[0.9950719,0.0043530227,0.00020578182,0.00012436266,0.00014000347,0.000012316402,6.0449344e-7,0.000025653912,0.000066375374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966253,0.0005160447,0.00095500814,0.00038404283,0.0006717322,0.0008478858],"domain_scores_gemma":[0.9970711,0.0006368681,0.0012109614,0.00082339556,0.00013985005,0.00011783554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032175898,0.0003974078,0.00077952305,0.00033479155,0.00011958556,0.0002558258,0.0031124428,0.00025985288,0.000007543511],"category_scores_gemma":[0.00011699937,0.00024366028,0.00018678443,0.0004442616,0.00015728954,0.00037803504,0.00076904264,0.0019665028,0.0000050606905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034828012,0.00019991663,0.0014704915,0.00013448678,0.00023117379,0.00010288566,0.0019302202,0.00012295357,0.00051285356,0.97784686,0.00018394901,0.017229352],"study_design_scores_gemma":[0.0011819937,0.0002999676,0.0022918095,0.00052377186,0.000040427018,0.00036898183,0.00006953617,0.008378665,0.00056669605,0.9857185,0.00022782336,0.00033185637],"about_ca_topic_score_codex":0.000008472399,"about_ca_topic_score_gemma":0.0000075919984,"teacher_disagreement_score":0.09822974,"about_ca_system_score_codex":0.00055714196,"about_ca_system_score_gemma":0.0012844335,"threshold_uncertainty_score":0.9936178},"labels":[],"label_agreement":null},{"id":"W2258815095","doi":"10.37236/5982","title":"Quantum Walks on Generalized Quadrangles","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"","keywords":"Quantum walk; Conjecture; Mathematics; Intersection (aeronautics); Spectrum (functional analysis); Combinatorics; Matrix (chemical analysis); Order (exchange); Quantum; Random walk; Stochastic matrix; Line (geometry); Discrete mathematics; Pure mathematics; Quantum algorithm; Physics; Quantum mechanics; Geometry","score_opus":0.014372640308647162,"score_gpt":0.2607498908650877,"score_spread":0.24637725055644055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258815095","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.42038393,0.021305379,0.5220007,0.020256624,0.014224938,0.0005159998,0.000005249027,0.00019882749,0.0011083876],"genre_scores_gemma":[0.9969055,0.0015154016,0.0003786288,0.00022077294,0.0007238757,0.0000038063536,0.0000013678563,0.000038075745,0.00021256994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647576,0.00044932208,0.0007253686,0.00040590105,0.0010309156,0.0009127209],"domain_scores_gemma":[0.99519515,0.0003537359,0.001963298,0.001952237,0.000390203,0.00014538232],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024016427,0.00046646287,0.0007714268,0.00025384268,0.0005899215,0.00062300643,0.007066326,0.00026404296,0.0000027801786],"category_scores_gemma":[0.0002018052,0.00029427712,0.00057069544,0.00018545825,0.000112944406,0.00012988754,0.0012943171,0.004255802,0.000011396668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003818783,0.00016185784,0.000009672042,0.000029840774,0.00021466165,0.0000642119,0.00052721926,0.00972901,0.00003171313,0.9778924,0.001565815,0.009735409],"study_design_scores_gemma":[0.0007284114,0.0007337761,0.0001184259,0.00022451201,0.000053625772,0.0002688573,0.0000073791416,0.09876815,0.0002774381,0.89105695,0.0074339854,0.00032849947],"about_ca_topic_score_codex":0.000027168106,"about_ca_topic_score_gemma":0.0000029358573,"teacher_disagreement_score":0.5765216,"about_ca_system_score_codex":0.00035734946,"about_ca_system_score_gemma":0.0015267449,"threshold_uncertainty_score":0.99995095},"labels":[],"label_agreement":null},{"id":"W2273053682","doi":"10.37236/5330","title":"A Note on Maxima in Random Walks","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Mathematics; Combinatorics; Maxima; Asymptotically optimal algorithm; Discrete mathematics; Statistics; Algorithm","score_opus":0.017376812268350868,"score_gpt":0.2937531362308181,"score_spread":0.27637632396246725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273053682","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.036108114,0.00055221206,0.95831656,0.0031095261,0.00046539024,0.00017626474,0.0000022709526,0.000014311871,0.0012553183],"genre_scores_gemma":[0.9991886,0.00029384522,0.00012424598,0.00008197643,0.00006675715,0.0000038127953,5.0044946e-8,0.000019934632,0.00022075413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843675,0.000095303105,0.0004729958,0.00009232779,0.00042637312,0.00047625165],"domain_scores_gemma":[0.9964343,0.002836718,0.00030705202,0.00020222184,0.00015568195,0.00006404622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013806161,0.0001348884,0.00033232474,0.0000921854,0.00005039922,0.000014876486,0.00040230935,0.00006484195,0.00002792116],"category_scores_gemma":[0.002591183,0.00006389097,0.00009231459,0.00022959191,0.0000332608,0.000058802078,0.000031163647,0.00049122534,0.000014915662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041939795,0.00014524703,0.0000038885614,0.000012605899,0.000023577235,0.00001848873,0.00009589653,0.0000013258976,0.00017964613,0.9938954,0.00028551466,0.0049190107],"study_design_scores_gemma":[0.0038161448,0.00091135764,0.000015408206,0.0001390248,0.00003963642,0.000103507926,0.00002240514,0.0001341494,0.0007212603,0.99311644,0.0008861448,0.000094528026],"about_ca_topic_score_codex":0.0000011337788,"about_ca_topic_score_gemma":0.0000049740547,"teacher_disagreement_score":0.9630805,"about_ca_system_score_codex":0.00034563272,"about_ca_system_score_gemma":0.0003373325,"threshold_uncertainty_score":0.31020752},"labels":[],"label_agreement":null},{"id":"W2276776477","doi":"10.37236/5949","title":"Antipode Formulas for some Combinatorial Hopf Algebras","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"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":"Noncommutative geometry; Bialgebra; Hopf algebra; Mathematics; Symmetric function; Grassmannian; Combinatorics; Pure mathematics; Algebra over a field","score_opus":0.029605613807303113,"score_gpt":0.3183074453619741,"score_spread":0.288701831554671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276776477","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.3758177,0.015260537,0.5269933,0.006822427,0.06520664,0.007352513,0.0001528845,0.0005360928,0.0018579295],"genre_scores_gemma":[0.99338657,0.0014822829,0.00072710443,0.00008295216,0.0032883903,0.000117814605,0.0000067070905,0.00033882982,0.00056933024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930836,0.00040109377,0.0024616069,0.0005301474,0.0016492945,0.0018742816],"domain_scores_gemma":[0.9869397,0.00474936,0.004693857,0.0017540896,0.0015883081,0.0002746624],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004476992,0.0010208526,0.0021766773,0.00038475826,0.00047221273,0.00017764175,0.0034088283,0.00070585706,0.000014168869],"category_scores_gemma":[0.0037648743,0.0006659128,0.0013080675,0.00034629388,0.00024341358,0.0004620008,0.0010135729,0.0033107295,0.000012239275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039607345,0.0006001645,0.000007452677,0.00054326525,0.00082218583,0.000013587594,0.0003203267,0.000015013302,0.00015532486,0.9915531,0.005244777,0.00032867191],"study_design_scores_gemma":[0.005357373,0.0013615714,0.0000019901524,0.00066045485,0.00089070474,0.00017718162,0.00007643264,0.00010728641,0.004476573,0.97902393,0.0071012224,0.00076527416],"about_ca_topic_score_codex":0.0000017728026,"about_ca_topic_score_gemma":0.0000013409792,"teacher_disagreement_score":0.6175689,"about_ca_system_score_codex":0.0019913295,"about_ca_system_score_gemma":0.0025284393,"threshold_uncertainty_score":0.9995792},"labels":[],"label_agreement":null},{"id":"W2284773806","doi":"10.37236/6004","title":"A $q$-Analog of Foulkes' Conjecture","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Statement (logic); Mathematics; Homogeneous; Combinatorics; Pure mathematics; Discrete mathematics; Law","score_opus":0.04542585235629472,"score_gpt":0.349933419510371,"score_spread":0.3045075671540763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284773806","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.6130057,0.043394554,0.29439566,0.005582768,0.023963472,0.0040113106,0.000069988746,0.00024985865,0.015326668],"genre_scores_gemma":[0.99694014,0.0013487502,0.00056143635,0.000018612403,0.0004557276,0.000011450842,0.0000018218457,0.00011733422,0.0005447317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953542,0.0003593999,0.0018079359,0.00027811626,0.0013502621,0.0008501017],"domain_scores_gemma":[0.9870673,0.0017316762,0.007630343,0.002201189,0.0012351255,0.00013437096],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003363797,0.0006043427,0.0019351534,0.00024955985,0.00023452005,0.00009540887,0.0037360915,0.00057617656,0.00002141652],"category_scores_gemma":[0.0036404203,0.00041242433,0.0008742061,0.00020389321,0.0003078043,0.00014407015,0.000924057,0.0044969227,0.0000038583294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008510859,0.0003488157,0.000021657328,0.0005358321,0.0008128481,0.000024623683,0.00064815785,0.00009889142,0.00006782562,0.9956196,0.0015071345,0.00022952298],"study_design_scores_gemma":[0.0012876565,0.0006648755,0.000008740573,0.0005857736,0.0009464382,0.00026735835,0.00010481629,0.00008044058,0.0018266954,0.99213666,0.0017364298,0.00035411518],"about_ca_topic_score_codex":0.0000069381845,"about_ca_topic_score_gemma":0.0000061721626,"teacher_disagreement_score":0.3839344,"about_ca_system_score_codex":0.0007375524,"about_ca_system_score_gemma":0.0022198863,"threshold_uncertainty_score":0.99983275},"labels":[],"label_agreement":null},{"id":"W2290281988","doi":"10.37236/5517","title":"Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Necklace; Concatenation (mathematics); Combinatorics; Mathematics; De Bruijn sequence; Lexicographical order; Morphism; Alphabet; Integer (computer science); Class (philosophy); Intersection (aeronautics); Suffix; Word (group theory); String (physics); Discrete mathematics; Computer science","score_opus":0.00749060686263108,"score_gpt":0.21755430299060532,"score_spread":0.21006369612797424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290281988","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.67933804,0.005670181,0.30999967,0.004627482,0.00021774812,0.000050382758,0.0000013146641,0.0000095722435,0.00008562086],"genre_scores_gemma":[0.99636096,0.0030313996,0.0004937314,0.000030427122,0.000038547634,3.1469384e-7,4.0923016e-8,0.0000032999967,0.000041274245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992002,0.0001330647,0.00017671035,0.000082140825,0.00018618796,0.000221648],"domain_scores_gemma":[0.9991382,0.00026988293,0.00025765752,0.00019019414,0.00009599328,0.000048087364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062690716,0.000073091054,0.0001214538,0.000048270245,0.00020145708,0.00004888443,0.0005590794,0.000029136267,0.0000012707538],"category_scores_gemma":[0.000031030293,0.00003285989,0.000030733387,0.00016462596,0.00023722385,0.00036918095,0.00016393884,0.00019731912,1.8700617e-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.000008499348,0.000013339811,0.0010062227,0.0000029547246,0.000032077358,0.0000028142229,0.00028518258,0.000012418249,0.0034510775,0.98107076,0.00017497838,0.013939683],"study_design_scores_gemma":[0.0010684717,0.00049952837,0.0040408224,0.00010053162,0.00005466508,0.0015852613,0.00044567135,0.005054657,0.004020416,0.97910184,0.0038914862,0.00013662441],"about_ca_topic_score_codex":0.00002717769,"about_ca_topic_score_gemma":0.0000057269867,"teacher_disagreement_score":0.31702295,"about_ca_system_score_codex":0.00008016562,"about_ca_system_score_gemma":0.00030401789,"threshold_uncertainty_score":0.15494654},"labels":[],"label_agreement":null},{"id":"W2292684665","doi":"10.37236/1154","title":"On the Proof of a Theorem of Pálfy","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Lethbridge","keywords":"Combinatorics; Mathematics; Isomorphism (crystallography); Order (exchange); Group (periodic table); Vertex (graph theory); Cayley graph; Automorphism; Center (category theory); Discrete mathematics; Graph; Crystallography","score_opus":0.022646722752257955,"score_gpt":0.28673370441467266,"score_spread":0.26408698166241473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292684665","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.98408926,0.0011611152,0.0030927202,0.0011797681,0.000115863455,0.00033535258,0.0000023325315,0.000007780927,0.010015785],"genre_scores_gemma":[0.9992802,0.000052696956,0.000016052336,0.000019362635,0.000058933612,0.000003525181,2.251885e-7,0.000029015064,0.0005399852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725217,0.0005696528,0.00071373436,0.00007837985,0.0009228248,0.00046323217],"domain_scores_gemma":[0.99414957,0.0038713284,0.0009219452,0.00053215754,0.00049481157,0.000030177805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005595328,0.00014757788,0.00039038362,0.00013934636,0.000087356246,0.000013707617,0.0010631911,0.00006932462,0.000056634526],"category_scores_gemma":[0.0010680791,0.00007286493,0.00022339073,0.0005464567,0.0002791067,0.00005562975,0.00007486775,0.00095900276,0.0000028078248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024791306,0.0004649613,0.00003816493,0.00004736395,0.00010245675,0.0000025556233,0.00030844766,0.000031209416,0.0011649508,0.996062,0.0013980543,0.00013196368],"study_design_scores_gemma":[0.0006249532,0.0012489114,0.000039515522,0.000074885415,0.00005860031,0.000052156207,0.0001923014,0.00007212621,0.043737855,0.9535902,0.00024336777,0.000065092],"about_ca_topic_score_codex":0.00000560937,"about_ca_topic_score_gemma":0.0000036397798,"teacher_disagreement_score":0.042572904,"about_ca_system_score_codex":0.00017953655,"about_ca_system_score_gemma":0.00039466823,"threshold_uncertainty_score":0.41664433},"labels":[],"label_agreement":null},{"id":"W2296004905","doi":"10.37236/6003","title":"A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Square-free integer; Lexicographical order; Square (algebra); Mathematics; Combinatorics; Word (group theory); Sequence (biology); Arithmetic; Discrete mathematics; Computer science; Geometry; Chemistry","score_opus":0.01972710738274241,"score_gpt":0.2509052272474111,"score_spread":0.23117811986466869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296004905","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.5475905,0.0010035392,0.44440955,0.0057562185,0.0008857927,0.0001062177,0.0000014230715,0.000061270686,0.00018548069],"genre_scores_gemma":[0.9989073,0.0002803285,0.00011975241,0.00024918772,0.00011439334,0.0000024869155,8.180008e-8,0.000017902548,0.0003085664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975967,0.0002626584,0.0004578949,0.00021024789,0.00068398385,0.00078851543],"domain_scores_gemma":[0.9976537,0.0006981096,0.00038287326,0.00090014416,0.00018388093,0.00018128162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020617982,0.00020640295,0.00027545734,0.0001706085,0.00021978756,0.00011196676,0.0038816137,0.00005419295,0.000013200266],"category_scores_gemma":[0.00037443134,0.00010534434,0.00017506491,0.0005162025,0.000052274205,0.0006132627,0.0005531859,0.0005048131,0.000025671296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021499678,0.000071876624,0.00050632964,0.0000058213354,0.00005203906,0.000026500957,0.0007217896,0.000016382282,0.013578502,0.97928417,0.0010371853,0.0046779336],"study_design_scores_gemma":[0.00078808836,0.0010434097,0.0006056471,0.00014700787,0.000020680583,0.00032500338,0.000119145436,0.00030705146,0.01631068,0.9764149,0.0036773786,0.00024098778],"about_ca_topic_score_codex":0.000006735075,"about_ca_topic_score_gemma":0.0000013847147,"teacher_disagreement_score":0.4513168,"about_ca_system_score_codex":0.0006398373,"about_ca_system_score_gemma":0.00039074145,"threshold_uncertainty_score":0.72130686},"labels":[],"label_agreement":null},{"id":"W2322634158","doi":"10.37236/4634","title":"Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Disjoint sets; Complete bipartite graph; Cograph; Edge-transitive graph; Matching (statistics); Graph; Discrete mathematics; Robertson–Seymour theorem; Line graph; 1-planar graph; Voltage graph","score_opus":0.004331584858769278,"score_gpt":0.18632258496039925,"score_spread":0.18199100010162997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322634158","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.96562815,0.008473733,0.024267215,0.0002856918,0.00073777075,0.00011255215,0.000004126525,0.000044517637,0.00044626548],"genre_scores_gemma":[0.99894404,0.0009394971,0.000010727706,0.000009797787,0.000036669124,0.0000032244855,4.9409255e-7,0.000024134162,0.00003139928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00014204749,0.0005212515,0.00006730106,0.00027316553,0.00038756328],"domain_scores_gemma":[0.9990288,0.00020696498,0.00022390859,0.00029595278,0.00016859699,0.00007580385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008669215,0.00014744153,0.00030533175,0.00021284507,0.00009537551,0.000012911867,0.0004925059,0.000056604902,0.00001603908],"category_scores_gemma":[0.00001951334,0.000085854066,0.00023621011,0.0005018586,0.00012309126,0.00015035235,0.000019800134,0.00027534823,0.0000075963612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003101347,0.000046349065,0.00039794398,0.000027933711,0.00024783064,0.0000027196845,0.00020077977,0.00021117089,0.06417644,0.9338657,0.00034867483,0.00044339744],"study_design_scores_gemma":[0.0007891192,0.0003366461,0.00041358595,0.00011042713,0.00008406172,0.00013555166,0.0000705133,0.000089301786,0.02372713,0.96917254,0.004934395,0.00013675068],"about_ca_topic_score_codex":0.0000030610297,"about_ca_topic_score_gemma":0.000005553842,"teacher_disagreement_score":0.04044931,"about_ca_system_score_codex":0.00010538861,"about_ca_system_score_gemma":0.000058923288,"threshold_uncertainty_score":0.35010272},"labels":[],"label_agreement":null},{"id":"W2345682233","doi":"10.37236/2978","title":"Ramsey Properties of Permutations","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Universidade de São Paulo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023035830866079857,"score_gpt":0.2688919380432629,"score_spread":0.24585610717718304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345682233","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.97851044,0.0028813612,0.016091486,0.0011377285,0.00020190714,0.00015596548,2.60406e-7,0.000011483785,0.0010093615],"genre_scores_gemma":[0.9988824,0.0002064764,0.000059029244,0.000037125974,0.000036443394,0.000004188093,1.01042104e-7,0.0000123112595,0.0007618946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989901,0.00014763404,0.00037685255,0.000043632564,0.00018287002,0.00025888535],"domain_scores_gemma":[0.9987393,0.00030045884,0.0004109527,0.00017473643,0.00034374182,0.000030798292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062783324,0.000084476655,0.00022431822,0.000057435973,0.00009629786,0.0000073772617,0.0003199339,0.000051585706,0.00005411935],"category_scores_gemma":[0.0004120356,0.0000486419,0.00009298927,0.00014199533,0.00015679358,0.00015100889,0.000025833284,0.00046578885,0.000009382572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022760389,0.000104789775,0.000034473473,0.000017206019,0.0000770026,6.946933e-7,0.0008058006,0.000015763533,0.0020115767,0.99640644,0.00031826494,0.00018525592],"study_design_scores_gemma":[0.00036108514,0.00024867666,0.000046672794,0.000024266214,0.000054084554,0.000106476306,0.00077068806,0.000033592492,0.00849153,0.98954177,0.00026723923,0.000053941243],"about_ca_topic_score_codex":0.000002585366,"about_ca_topic_score_gemma":0.0000011796318,"teacher_disagreement_score":0.020371985,"about_ca_system_score_codex":0.00007855535,"about_ca_system_score_gemma":0.00020670274,"threshold_uncertainty_score":0.20236467},"labels":[],"label_agreement":null},{"id":"W2400293693","doi":"10.37236/5714","title":"Embedding Factorizations for 3-Uniform Hypergraphs II: $r$-Factorizations into $s$-Factorizations","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Embedding; Combinatorics; Factorization; Discrete mathematics; Computer science; Algorithm","score_opus":0.005711901721585466,"score_gpt":0.2157531010495806,"score_spread":0.21004119932799512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400293693","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.17310512,0.0010524656,0.8213871,0.0004548714,0.0029828625,0.00035683895,0.000023688015,0.00015317793,0.00048386503],"genre_scores_gemma":[0.9983751,0.00078236597,0.000048104706,0.000012665635,0.00025501012,0.000024748255,0.0000068905683,0.000065372515,0.00042970566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982501,0.00007262567,0.00063675584,0.00012243896,0.00031924673,0.00059882726],"domain_scores_gemma":[0.99838525,0.00045608648,0.00026794328,0.00033202578,0.00043004632,0.000128647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750144,0.00024831368,0.0003197212,0.00028153436,0.0006398505,0.000054367374,0.0005825746,0.00012857863,0.000024904684],"category_scores_gemma":[0.0002112097,0.00015410547,0.00024829805,0.00077028567,0.0000657699,0.0004629244,0.00003241475,0.00033418337,0.000005135156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015501808,0.00006686264,0.00038899353,0.000027790766,0.00026224786,5.237944e-7,0.0009422198,0.0030594775,0.0120595945,0.98218435,0.00052501506,0.0004673996],"study_design_scores_gemma":[0.001381388,0.0005492871,0.0001358144,0.00011230974,0.00018902512,0.000056183908,0.0003722593,0.0016009241,0.008140586,0.9472832,0.03978532,0.0003936809],"about_ca_topic_score_codex":0.0000017000498,"about_ca_topic_score_gemma":0.0000066410303,"teacher_disagreement_score":0.82527,"about_ca_system_score_codex":0.00040602213,"about_ca_system_score_gemma":0.00021582823,"threshold_uncertainty_score":0.62842387},"labels":[],"label_agreement":null},{"id":"W2406950345","doi":"10.37236/6145","title":"Quantum State Transfer in Coronas","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Institut Henri Poincaré; National Science Foundation","keywords":"Generalization; Corona (planetary geology); State (computer science); Product (mathematics); Transfer (computing); Combinatorics; Adjacency matrix; Quantum walk; Mathematics; Physics; Quantum; Quantum mechanics; Geometry; Mathematical analysis; Computer science; Quantum computer; Graph; Algorithm","score_opus":0.011538880585942728,"score_gpt":0.24913124623899627,"score_spread":0.23759236565305353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406950345","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.4483298,0.010756689,0.5309098,0.004542845,0.0049547167,0.0002681418,0.0000025135107,0.000047389676,0.0001881289],"genre_scores_gemma":[0.9975317,0.0019311255,0.00011023299,0.000076919016,0.00021050964,0.0000029485084,6.7996746e-7,0.000027236452,0.00010866513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688995,0.00035013663,0.00077298505,0.00033481143,0.00074591796,0.0009061972],"domain_scores_gemma":[0.9974751,0.00025150512,0.00067963335,0.0012292729,0.00025616682,0.00010833904],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027436437,0.00036430164,0.0006725678,0.00026455504,0.00023766427,0.00038603856,0.0055979732,0.00017528613,0.0000017087089],"category_scores_gemma":[0.00008403801,0.00024797296,0.0003299817,0.00022805315,0.00010137806,0.00017852931,0.0008243552,0.004599101,0.000003975304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006067529,0.00031061337,0.00016748738,0.00008067933,0.00021575815,0.00023914556,0.0030073705,0.02812415,0.000037801063,0.94769764,0.0003736066,0.019685056],"study_design_scores_gemma":[0.0007638849,0.00042024002,0.0008313513,0.00022171055,0.000023509116,0.00026651987,0.000009913208,0.10317345,0.00014838942,0.8913736,0.002487684,0.00027975507],"about_ca_topic_score_codex":0.00004802304,"about_ca_topic_score_gemma":0.000022175102,"teacher_disagreement_score":0.5492019,"about_ca_system_score_codex":0.00039796624,"about_ca_system_score_gemma":0.0020016283,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2471383395","doi":"10.37236/6225","title":"Large Deviations for Permutations Avoiding Monotone Patterns","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; York University","funders":"","keywords":"Combinatorics; Physics; Permutation (music); Lambda; Sigma; Limiting; Monotone polygon; Limit (mathematics); Mathematics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.016772908903515654,"score_gpt":0.2932536271257783,"score_spread":0.2764807182222626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471383395","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.0029357423,0.0037122464,0.98654574,0.0046338546,0.001539378,0.0003923584,0.000021009813,0.0000327791,0.00018691472],"genre_scores_gemma":[0.99645317,0.0017128641,0.0009947435,0.00015840626,0.0003146039,0.00004036438,0.0000027962374,0.000028405966,0.00029466453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761295,0.0004213105,0.00062601356,0.00025332204,0.0003922555,0.00069411885],"domain_scores_gemma":[0.99689275,0.00073902775,0.00096091453,0.0006721909,0.0006344051,0.00010069044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003288037,0.0002497591,0.00043073762,0.00019566716,0.00041268373,0.00018163658,0.0020034336,0.00018167443,0.000003294334],"category_scores_gemma":[0.00025747778,0.00015892224,0.00039517207,0.00020433805,0.000021719496,0.00025340045,0.00044533916,0.0014617805,0.0000022257527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063188445,0.000074665906,0.000025526835,0.000028229957,0.00012911603,0.0000019374927,0.00079588644,0.00002273348,0.000068175745,0.9978518,0.00045542928,0.0005402029],"study_design_scores_gemma":[0.0006353561,0.00016634313,0.000058751008,0.000117746975,0.000099872595,0.00006211939,0.000027978194,0.003741049,0.00056013523,0.99135816,0.002976503,0.00019597399],"about_ca_topic_score_codex":0.0000015980637,"about_ca_topic_score_gemma":0.000003846252,"teacher_disagreement_score":0.9935174,"about_ca_system_score_codex":0.0004747376,"about_ca_system_score_gemma":0.0012264714,"threshold_uncertainty_score":0.6480661},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2496042530","doi":"10.37236/5885","title":"Minimal Orbits of Promotion","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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 Waterloo","funders":"","keywords":"Promotion (chess); Business; Political science","score_opus":0.057784292020219,"score_gpt":0.34938225178446264,"score_spread":0.29159795976424363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496042530","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.9087712,0.007105009,0.066073015,0.0018362949,0.00944754,0.0017194198,0.000015809583,0.000093551665,0.004938118],"genre_scores_gemma":[0.99742717,0.0008658534,0.0006588204,0.000004853914,0.00041385146,0.000012323205,0.0000016591459,0.000095550866,0.0005199168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958875,0.00030748753,0.00161976,0.00023556614,0.001246184,0.00070345536],"domain_scores_gemma":[0.98919016,0.00090448663,0.0068510985,0.0015628601,0.0013858138,0.00010558233],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0032540385,0.0004717918,0.001358028,0.00020942451,0.00019665735,0.000077806646,0.002696727,0.0004222187,0.000014251499],"category_scores_gemma":[0.0032173735,0.00033625338,0.00055522966,0.00016936552,0.00020927055,0.0001835286,0.0007630851,0.0030197648,0.000003897654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093144576,0.00069848483,0.000028384742,0.0006398017,0.000404974,0.000012953033,0.00051107665,0.000033937104,0.00019794899,0.99623024,0.0008909683,0.00025806145],"study_design_scores_gemma":[0.0010351589,0.00097296276,0.00002316064,0.0007294934,0.00053537794,0.00022351417,0.000062605046,0.000093722956,0.004648128,0.9909719,0.00042097337,0.00028297055],"about_ca_topic_score_codex":0.0000030816427,"about_ca_topic_score_gemma":0.0000023787024,"teacher_disagreement_score":0.088655934,"about_ca_system_score_codex":0.00069159456,"about_ca_system_score_gemma":0.0017345296,"threshold_uncertainty_score":0.9999089},"labels":[],"label_agreement":null},{"id":"W2506307253","doi":"10.37236/6410","title":"Majority Colourings of Digraphs","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Digraph; Conjecture; Combinatorics; Vertex (graph theory); Mathematics; Discrete mathematics; Graph","score_opus":0.028599359921106047,"score_gpt":0.3161045587006525,"score_spread":0.28750519877954644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506307253","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.98101324,0.00902896,0.0018046072,0.0004770928,0.0031464833,0.00035082377,0.00000935432,0.000022258633,0.004147167],"genre_scores_gemma":[0.99635446,0.002892656,0.00007245255,0.000017526258,0.00023641852,0.0000033280198,7.224437e-7,0.000043600478,0.00037882477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971998,0.00028318094,0.00097465824,0.00017855184,0.00079184066,0.0005720229],"domain_scores_gemma":[0.99371386,0.0007082327,0.0037133526,0.00129038,0.0004893087,0.00008487454],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003357435,0.0003457432,0.0009935565,0.00020112682,0.00038884627,0.00006348391,0.0027511583,0.00036627214,0.0000136083745],"category_scores_gemma":[0.0008891611,0.0002198644,0.0007170337,0.00011345032,0.0003470752,0.00008255956,0.00087526935,0.0032918977,4.6132376e-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.000115391886,0.00014214763,0.00036935534,0.00021789358,0.0006156178,0.000010022452,0.00093700987,0.0000073079987,0.000022680142,0.99613136,0.0011551861,0.00027600484],"study_design_scores_gemma":[0.0006381719,0.00034502454,0.00032699434,0.0002274692,0.00047027195,0.00012496115,0.000075382,0.000011568476,0.0011458704,0.9944017,0.002023667,0.00020890974],"about_ca_topic_score_codex":0.000013511442,"about_ca_topic_score_gemma":0.000005262445,"teacher_disagreement_score":0.015341218,"about_ca_system_score_codex":0.00024241248,"about_ca_system_score_gemma":0.0007700084,"threshold_uncertainty_score":0.9990075},"labels":[],"label_agreement":null},{"id":"W2509306978","doi":"10.37236/6392","title":"Note on a Ramsey Theorem for Posets with Linear Extensions","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"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 Manitoba","funders":"","keywords":"Ramsey theory; Ramsey's theorem; Mathematics; Combinatorics; Star product; Discrete mathematics; Mathematical economics","score_opus":0.03230411287242256,"score_gpt":0.3492203507950404,"score_spread":0.3169162379226178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509306978","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.23761196,0.0061553605,0.73335606,0.0109340185,0.0045620664,0.002578248,0.000054837412,0.00013409367,0.0046133725],"genre_scores_gemma":[0.99637395,0.0008290942,0.00097398966,0.00016628377,0.00038920005,0.000020997719,0.0000045606816,0.000087738736,0.001154158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780405,0.0002744596,0.0005591949,0.00024454566,0.0004157792,0.0007019622],"domain_scores_gemma":[0.9938686,0.0023622806,0.0018750578,0.0011674424,0.0006294554,0.0000971469],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025380687,0.0003956378,0.00082612346,0.00012915491,0.00054771826,0.000039771985,0.0013910104,0.00039001013,0.00000871515],"category_scores_gemma":[0.0015823032,0.0002256446,0.0003717625,0.00006203983,0.00030196947,0.00007084261,0.00021709915,0.0034022862,0.0000046345576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013047209,0.00025763505,0.0000034366658,0.000064881766,0.00034615168,0.000027214968,0.00040237937,0.00028791817,0.00002022031,0.9961567,0.0005914478,0.0005373048],"study_design_scores_gemma":[0.0015877722,0.001769897,0.00000904478,0.00034721565,0.0004540208,0.0003145872,0.00007312455,0.00020335625,0.00062229746,0.991312,0.003046012,0.00026064005],"about_ca_topic_score_codex":0.0000011555419,"about_ca_topic_score_gemma":0.0000066840357,"teacher_disagreement_score":0.758762,"about_ca_system_score_codex":0.00034257764,"about_ca_system_score_gemma":0.0011658571,"threshold_uncertainty_score":0.9988969},"labels":[],"label_agreement":null},{"id":"W2514085586","doi":"10.37236/6958","title":"Simplicial Complexes are Game Complexes","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Darmstadt; Killam Trusts","keywords":"Simplicial complex; Mathematics; Flag (linear algebra); Abstract simplicial complex; Invariant (physics); Combinatorics; Simplicial approximation theorem; Class (philosophy); Combinatorial game theory; Simplicial homology; h-vector; Pure mathematics; Sequential game; Game theory; Computer science; Simplicial set; Algebra over a field; Mathematical economics; Artificial intelligence; Homotopy","score_opus":0.0278143150206662,"score_gpt":0.2876050605225206,"score_spread":0.2597907455018544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514085586","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.17559691,0.01016207,0.7984273,0.0067537124,0.007266649,0.0006840233,0.000009055231,0.0001451418,0.000955139],"genre_scores_gemma":[0.9976364,0.0009914715,0.00014844269,0.0003481769,0.0005689632,0.00000618273,0.0000019551783,0.000044942317,0.00025346287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954225,0.0004573524,0.0012694002,0.00045240964,0.0012596294,0.0011387015],"domain_scores_gemma":[0.9939898,0.00077175617,0.0025598384,0.0015705375,0.0009622832,0.0001457404],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019079027,0.0005141272,0.001041874,0.00030004946,0.00021049511,0.00050146127,0.007323454,0.00030522697,0.000020148616],"category_scores_gemma":[0.00025472092,0.0003780209,0.0005577424,0.0005346208,0.00022819692,0.00035230414,0.0020730316,0.0036855864,0.00009596937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003976497,0.00020230531,0.00047117658,0.00005328378,0.00023744853,0.000022517224,0.0009867131,0.008539226,0.00024679984,0.9838799,0.0034660622,0.00185476],"study_design_scores_gemma":[0.00020810735,0.00045916846,0.00056028384,0.00016949761,0.00007611103,0.00019096366,0.00017275398,0.010305977,0.0033383234,0.9735239,0.0105665205,0.00042838216],"about_ca_topic_score_codex":0.000045741286,"about_ca_topic_score_gemma":0.000027611315,"teacher_disagreement_score":0.8220395,"about_ca_system_score_codex":0.0008330546,"about_ca_system_score_gemma":0.0017486869,"threshold_uncertainty_score":0.9998672},"labels":[],"label_agreement":null},{"id":"W2520022270","doi":"10.37236/6450","title":"Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Unary operation; Mathematics; Combinatorics; Identity (music); Multiplicative function; Upper and lower bounds; Inverse; Identity function; Function (biology); Discrete mathematics; Constant (computer programming); Mathematical analysis; Geometry","score_opus":0.011733497705416334,"score_gpt":0.2718810865264232,"score_spread":0.26014758882100686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520022270","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.93368113,0.001701704,0.055774108,0.0028175933,0.0012602806,0.00012748902,5.6839843e-7,0.00002962652,0.0046075103],"genre_scores_gemma":[0.9988751,0.0006010682,0.00000878193,0.00012431435,0.00010188693,0.0000032807975,3.4789696e-7,0.000009414099,0.0002758255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984885,0.00011335859,0.00039451252,0.000114836424,0.0004994038,0.0003893736],"domain_scores_gemma":[0.998707,0.00010001332,0.00041986647,0.00061748613,0.00011184648,0.000043805678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016589493,0.00014397969,0.00022707587,0.00012173207,0.0003995012,0.00053841446,0.0018727637,0.000067814966,0.000007685495],"category_scores_gemma":[0.000045736368,0.00009938624,0.00011852869,0.00017430971,0.00006447924,0.0014398092,0.000066445406,0.00061519665,0.000008866217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040620056,0.00011702746,0.00058928714,0.000007976542,0.00003240181,0.000029402028,0.001124314,0.00013901205,0.000056025052,0.9950564,0.00036098677,0.0024465497],"study_design_scores_gemma":[0.0008137249,0.00062344735,0.0107426355,0.00013780774,0.000018431248,0.0001723935,0.00038631307,0.0041410555,0.0013416848,0.9793035,0.0021141886,0.0002048169],"about_ca_topic_score_codex":0.00000537105,"about_ca_topic_score_gemma":0.000026368889,"teacher_disagreement_score":0.06519396,"about_ca_system_score_codex":0.0002955636,"about_ca_system_score_gemma":0.00019320015,"threshold_uncertainty_score":0.5191943},"labels":[],"label_agreement":null},{"id":"W2523214650","doi":"10.37236/6460","title":"A Note on Intersecting Hypergraphs with Large Cover Number","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"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 Waterloo","funders":"","keywords":"Conjecture; Cover (algebra); Combinatorics; Mathematics; Value (mathematics); Discrete mathematics; Statistics; Engineering","score_opus":0.017122847585079985,"score_gpt":0.3065194671261294,"score_spread":0.2893966195410494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523214650","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.9615959,0.0011913708,0.012050175,0.00064624933,0.0038309982,0.00046440033,0.000011922471,0.000051124305,0.020157864],"genre_scores_gemma":[0.9981462,0.00051379047,0.00007533407,0.00012544515,0.00037272408,0.0000052898286,0.0000011246697,0.00008581064,0.0006743317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720913,0.00029465114,0.00062452565,0.0002518476,0.00082699204,0.00079287257],"domain_scores_gemma":[0.9952865,0.0008371988,0.0021562104,0.0012045288,0.000421353,0.00009416603],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025473505,0.00045630476,0.000791434,0.00014925694,0.0006636366,0.00015222849,0.0017788268,0.00031609496,0.0000457318],"category_scores_gemma":[0.00059810246,0.00025369172,0.00047954387,0.00011706558,0.00015217549,0.00009888586,0.00057426136,0.0048063938,0.0000061247674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004161077,0.00017664528,0.0003777748,0.000096672215,0.000656258,0.00004346156,0.0017075568,0.000043733216,0.0000051259713,0.99500483,0.0012863966,0.00018546339],"study_design_scores_gemma":[0.001306089,0.0005545062,0.00008392969,0.00052658806,0.00038991854,0.00047377532,0.00013898815,0.000051848794,0.00021466937,0.992121,0.003824714,0.00031401194],"about_ca_topic_score_codex":0.0000049278483,"about_ca_topic_score_gemma":0.000008799936,"teacher_disagreement_score":0.036550254,"about_ca_system_score_codex":0.00043759434,"about_ca_system_score_gemma":0.0005988085,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W2528390864","doi":"10.37236/6624","title":"On Ehrhart Polynomials of Lattice Triangles","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Lattice (music); Polygon (computer graphics); Boundary (topology); Integer lattice; Polynomial","score_opus":0.029241814725923944,"score_gpt":0.3246703685208574,"score_spread":0.29542855379493344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528390864","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.9560155,0.0011163534,0.03126339,0.0010680596,0.002851129,0.0005098753,0.0000035020742,0.000054836615,0.0071173264],"genre_scores_gemma":[0.9985295,0.00011691009,0.0003957588,0.000059184727,0.00040226246,0.000002800571,1.665446e-7,0.000050002338,0.00044342928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973036,0.0002551989,0.0010250435,0.00012378272,0.00073873426,0.0005536652],"domain_scores_gemma":[0.99424404,0.0027792333,0.0015733674,0.00059940695,0.00071850664,0.00008542866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024424242,0.00023403332,0.00066440745,0.00016478323,0.00013862064,0.000022224931,0.00091242197,0.00011267981,0.000046654157],"category_scores_gemma":[0.0030245695,0.00015548016,0.00023636463,0.0004996969,0.00020433698,0.00014539607,0.00007812754,0.00068073545,0.000021306883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025686854,0.00039007879,0.0000075048297,0.000037135324,0.0001460419,0.000003088447,0.00048059816,0.0000034004572,0.00057130586,0.9957617,0.0021204853,0.00022179613],"study_design_scores_gemma":[0.0017064272,0.0025776038,0.000007268911,0.000113090784,0.0001655243,0.000081384336,0.00014201073,0.000033067932,0.02418386,0.9689261,0.0019196201,0.00014407479],"about_ca_topic_score_codex":0.00000130361,"about_ca_topic_score_gemma":0.0000015936669,"teacher_disagreement_score":0.042513955,"about_ca_system_score_codex":0.00032069703,"about_ca_system_score_gemma":0.00041127892,"threshold_uncertainty_score":0.6340297},"labels":[],"label_agreement":null},{"id":"W2528938086","doi":"10.37236/6504","title":"Some Families of Trees Arising in Permutation Analysis","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche","keywords":"Mathematics; Permutation (music); Arity; Enumeration; Limit (mathematics); Interval (graph theory); Tree (set theory); Combinatorics; Set (abstract data type); Binary tree; Simple (philosophy); Filtration (mathematics); Discrete mathematics; Statistics; Computer science; Mathematical analysis","score_opus":0.03324716057032338,"score_gpt":0.32139567892637355,"score_spread":0.28814851835605015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528938086","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.9109269,0.0067495434,0.079253845,0.0009770601,0.0012656453,0.0005583793,0.0000062504837,0.00004362736,0.00021874494],"genre_scores_gemma":[0.9971103,0.001954745,0.000611184,0.000016390086,0.0002038774,0.000007781218,0.000003710816,0.00006044642,0.000031554882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958486,0.00041148998,0.001917744,0.0002483025,0.0010384844,0.00053540064],"domain_scores_gemma":[0.99371797,0.001574371,0.0034131208,0.0006716368,0.00054336217,0.00007955654],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019750723,0.00040908647,0.0017314452,0.0007685695,0.00006557142,0.00004881052,0.001248024,0.00028223646,0.000004658157],"category_scores_gemma":[0.0018349477,0.00031613713,0.00070836925,0.0015036095,0.00010886431,0.00019344936,0.00038675737,0.0025715202,0.0000011483215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088164,0.00033743714,0.00030246994,0.00028909376,0.0013802436,0.000013950636,0.003136561,0.0047157537,0.00021902728,0.9893408,0.000050345418,0.00012614741],"study_design_scores_gemma":[0.0008294646,0.00031305934,0.00023422971,0.00023506058,0.0020384155,0.000014851005,0.000918976,0.0024312178,0.0013382273,0.99136305,0.000030031635,0.00025342827],"about_ca_topic_score_codex":0.000014798185,"about_ca_topic_score_gemma":0.000040458395,"teacher_disagreement_score":0.08618341,"about_ca_system_score_codex":0.00090975105,"about_ca_system_score_gemma":0.0009311274,"threshold_uncertainty_score":0.9999291},"labels":[],"label_agreement":null},{"id":"W2553758132","doi":"10.37236/6632","title":"The Total Acquisition Number of Random Geometric Graphs","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Random graph; Computer science; Combinatorics; Statistics; Graph","score_opus":0.007836276950320244,"score_gpt":0.25487018652043686,"score_spread":0.24703390957011662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553758132","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.6734738,0.012934736,0.3025031,0.0067631095,0.001582138,0.0001662702,0.0000030625183,0.00002322552,0.0025505982],"genre_scores_gemma":[0.9972892,0.0022282535,0.000033263263,0.000026216314,0.000051164432,0.0000011728337,2.924062e-7,0.0000035889946,0.00036687593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998236,0.00015673545,0.0004445266,0.00011202285,0.0006300351,0.00042066153],"domain_scores_gemma":[0.9969966,0.0007084099,0.0010119583,0.0008675739,0.00035151673,0.00006393043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026341164,0.000109142056,0.00029237688,0.00018234145,0.0007582973,0.00026292182,0.0032005445,0.000050323535,0.000015710315],"category_scores_gemma":[0.00062621094,0.000051556395,0.0002897291,0.0013408853,0.00018028052,0.00045663427,0.00031737547,0.0004409916,0.000010782143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004361112,0.000085645246,0.0009836067,0.0000016946243,0.0001267629,0.000004600752,0.000027345824,0.000022551349,0.00001981767,0.98631763,0.00038943792,0.011977271],"study_design_scores_gemma":[0.0012716561,0.00032786292,0.015402471,0.0000065393533,0.0000791897,0.00020111576,0.000023719687,0.00035784964,0.0004533762,0.97970486,0.002082537,0.000088847046],"about_ca_topic_score_codex":0.000022983384,"about_ca_topic_score_gemma":0.0000012599431,"teacher_disagreement_score":0.32381544,"about_ca_system_score_codex":0.00007475073,"about_ca_system_score_gemma":0.00013902037,"threshold_uncertainty_score":0.5947461},"labels":[],"label_agreement":null},{"id":"W2554943969","doi":"10.37236/6741","title":"Parabolic Double Cosets in Coxeter Groups","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"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 Waterloo","funders":"Javna Agencija za Raziskovalno Dejavnost RS; National Science Foundation","keywords":"Coxeter group; Mathematics; Longest element of a Coxeter group; Coxeter element; Coset; Combinatorics; Coxeter complex; Weyl group; Affine transformation; Artin group; Pure mathematics; Discrete mathematics","score_opus":0.037558778165099005,"score_gpt":0.3312482774140295,"score_spread":0.2936894992489305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554943969","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.9614118,0.0052681277,0.02075184,0.00090261106,0.0075021456,0.001415558,0.000005763335,0.000098503064,0.0026436867],"genre_scores_gemma":[0.9972222,0.0012035307,0.00033140992,0.00005368786,0.0007296595,0.000037264672,0.0000024688104,0.00014541995,0.0002743652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948626,0.0004002179,0.0019090369,0.0003571687,0.0012093154,0.0012616325],"domain_scores_gemma":[0.9938233,0.0011661998,0.0027140803,0.0013520445,0.00078513846,0.00015923212],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0038395594,0.0006519279,0.0014943747,0.00038765167,0.00013871012,0.00011855337,0.0024140573,0.00054239476,0.000032372795],"category_scores_gemma":[0.0007589339,0.00047816677,0.0004562603,0.00059980445,0.00020895837,0.00019408084,0.00085472764,0.0045576696,0.000026583539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025953352,0.00061181764,0.00007659494,0.00024264755,0.00023073952,0.00003812782,0.0011387819,0.00006364486,0.00002374172,0.9954239,0.001808915,0.00008155374],"study_design_scores_gemma":[0.0032153188,0.0005680878,0.000030048304,0.00049667154,0.00024815978,0.00022891068,0.00012266255,0.00015099546,0.000893529,0.9916668,0.0019190721,0.0004597249],"about_ca_topic_score_codex":0.0000078296225,"about_ca_topic_score_gemma":0.000021192749,"teacher_disagreement_score":0.03581043,"about_ca_system_score_codex":0.001655938,"about_ca_system_score_gemma":0.0013667773,"threshold_uncertainty_score":0.999767},"labels":[],"label_agreement":null},{"id":"W2562777866","doi":"10.37236/6658","title":"Ideals and Quotients of Diagonally Quasi-Symmetric Functions","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Mechanics and Non-Hermitian Physics","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Quotient; Diagonal; Basis (linear algebra); Ring (chemistry); Hilbert space; Ideal (ethics)","score_opus":0.009938220475994252,"score_gpt":0.24929209700219113,"score_spread":0.23935387652619688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562777866","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.9814298,0.0012161313,0.012554726,0.00044667657,0.00066217,0.00011102766,0.000010196869,0.0000036205313,0.0035656109],"genre_scores_gemma":[0.9993025,0.00017730884,0.000004257402,0.000010880706,0.00017768245,0.0000017547474,0.0000011775627,0.000015872185,0.000308553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988536,0.000061928535,0.00036572915,0.00009224649,0.00029778597,0.00032868778],"domain_scores_gemma":[0.99819106,0.00014632462,0.00095911126,0.00036173334,0.00026484398,0.00007695455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061719195,0.00012989611,0.0002946826,0.0000838255,0.00034767023,0.00006844127,0.0005237196,0.000030447352,0.00001844671],"category_scores_gemma":[0.000039454324,0.000093387345,0.00015588765,0.000150957,0.0000731723,0.0001959763,0.00008826672,0.00043932878,0.0000046627915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026125146,0.00030784783,0.004590492,0.00000672569,0.00016655064,9.569659e-7,0.000060800132,0.0000027900012,0.0001959564,0.9894499,0.00025946528,0.004932364],"study_design_scores_gemma":[0.00093361177,0.0008412612,0.004292307,0.000030454807,0.00012446701,0.000012990786,0.00011576425,0.00019877258,0.00122393,0.9906581,0.0014540025,0.00011435764],"about_ca_topic_score_codex":0.00002971431,"about_ca_topic_score_gemma":0.0000015784802,"teacher_disagreement_score":0.017872673,"about_ca_system_score_codex":0.000045122375,"about_ca_system_score_gemma":0.00028290914,"threshold_uncertainty_score":0.38082254},"labels":[],"label_agreement":null},{"id":"W2566019243","doi":"10.37236/7375","title":"Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Australian Research Council; Pacific Institute for the Mathematical Sciences","keywords":"Polyomino; Catalan number; Mathematics; Parallelogram; Combinatorics; Conjecture; Algebraic number; Discrete mathematics; Regular polygon; Computer science; Geometry","score_opus":0.03301480773904028,"score_gpt":0.3184425543845896,"score_spread":0.2854277466455494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566019243","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.9431495,0.020036522,0.0298778,0.00087526644,0.0033929194,0.0013811631,0.000019985819,0.00007856186,0.0011882713],"genre_scores_gemma":[0.9962277,0.002175794,0.00083192304,0.00005840665,0.0001962146,0.000011973838,0.0000014156429,0.00011052018,0.0003860682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960302,0.00032109156,0.0015725872,0.00031573494,0.0009730691,0.00078732165],"domain_scores_gemma":[0.99298507,0.0016278665,0.0036161134,0.001068079,0.00057941047,0.0001234732],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024908797,0.00056771387,0.0015259386,0.00026204207,0.00010428155,0.00007892313,0.0016176247,0.0004269085,0.000012569508],"category_scores_gemma":[0.0008873258,0.0003922913,0.00037607006,0.00030252352,0.0002971774,0.0001525349,0.00064109184,0.0025531782,0.000004006104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009566634,0.00031610046,0.0003317675,0.0008716646,0.0005538447,0.0000072890093,0.0018128993,0.00010377684,0.00022080923,0.99498826,0.00047443638,0.00022347106],"study_design_scores_gemma":[0.0012303123,0.0007099968,0.000017371663,0.000703708,0.000447799,0.00026668722,0.00040974453,0.0001644249,0.0018099496,0.9924456,0.001424902,0.0003695011],"about_ca_topic_score_codex":0.00004205683,"about_ca_topic_score_gemma":0.000007916138,"teacher_disagreement_score":0.053078175,"about_ca_system_score_codex":0.00042243194,"about_ca_system_score_gemma":0.0011923134,"threshold_uncertainty_score":0.9998529},"labels":[],"label_agreement":null},{"id":"W2566154556","doi":"10.37236/5435","title":"Resolvable Group Divisible Designs with Large Groups","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Divisibility rule; Group (periodic table); Multipartite; Transversal (combinatorics); Graph; Recursion (computer science); Product (mathematics); Discrete mathematics; Algorithm","score_opus":0.005410453130396551,"score_gpt":0.17726924697395124,"score_spread":0.17185879384355468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566154556","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.71522987,0.008007287,0.27237126,0.00023897756,0.00079750083,0.0001859278,0.0000023061132,0.0001142814,0.0030525888],"genre_scores_gemma":[0.9989231,0.00059568364,0.0000065768836,0.000016276741,0.000098715034,0.000004487822,2.1967318e-7,0.00003837883,0.00031652435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985332,0.00012409152,0.00030242954,0.00007622216,0.00030986738,0.00065417145],"domain_scores_gemma":[0.99924165,0.0001890618,0.00013655805,0.00026612586,0.00008771914,0.00007890697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014781426,0.00015912789,0.0002425005,0.00009491947,0.00012175313,0.000029973487,0.00045542815,0.00005828075,0.000024343988],"category_scores_gemma":[0.000019727862,0.000076212804,0.00009231437,0.00034853906,0.000039623366,0.00023799718,0.000019431101,0.00039025076,0.000017065735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081809565,0.0000614965,0.00057342363,0.00001843157,0.00017487636,0.000012835509,0.00015519756,0.00011699737,0.003466502,0.9941218,0.000945598,0.0002710667],"study_design_scores_gemma":[0.0033196006,0.0018114569,0.00054983725,0.00023458175,0.000119699274,0.00056274957,0.0002569288,0.00017542117,0.00742976,0.9516269,0.033552255,0.00036083665],"about_ca_topic_score_codex":9.3199924e-7,"about_ca_topic_score_gemma":0.000006470786,"teacher_disagreement_score":0.28369325,"about_ca_system_score_codex":0.00020955286,"about_ca_system_score_gemma":0.000065509164,"threshold_uncertainty_score":0.31078678},"labels":[],"label_agreement":null},{"id":"W2581376465","doi":"10.37236/6762","title":"Linear Bound for Majority Colourings of Digraphs","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Computer science","score_opus":0.02842287939724369,"score_gpt":0.32021916566133807,"score_spread":0.2917962862640944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581376465","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.97747535,0.0044131833,0.0133230155,0.00031319982,0.0030677302,0.00067681936,0.00002264624,0.000023713272,0.00068435335],"genre_scores_gemma":[0.997567,0.0010346165,0.00046026008,0.000032802498,0.0005719414,0.000009945157,0.0000019728295,0.00005903712,0.00026243768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972714,0.00021349998,0.0010820878,0.0001981594,0.00061279134,0.0006220172],"domain_scores_gemma":[0.994753,0.001213681,0.0023442789,0.00074291264,0.0008643506,0.000081750426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035904013,0.0003447815,0.00092396396,0.00020706256,0.0002888927,0.000036723646,0.0015825481,0.0003798388,0.000012649221],"category_scores_gemma":[0.0008334311,0.0002256285,0.0007722321,0.00021098721,0.00035296238,0.000059436083,0.0004781201,0.0018830396,3.6929728e-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.0003125547,0.0001766699,0.00011949649,0.00038057362,0.0007211677,0.0000018546425,0.00094974344,0.0000074646514,0.00003318395,0.9945136,0.0026865834,0.000097137214],"study_design_scores_gemma":[0.0009408782,0.0010274987,0.000052976047,0.000173092,0.0005725187,0.000066976885,0.000080560916,0.000066859066,0.0026550896,0.98977286,0.004371776,0.0002189411],"about_ca_topic_score_codex":0.000005297989,"about_ca_topic_score_gemma":0.0000042033885,"teacher_disagreement_score":0.020091647,"about_ca_system_score_codex":0.00026174044,"about_ca_system_score_gemma":0.00078131334,"threshold_uncertainty_score":0.92008626},"labels":[],"label_agreement":null},{"id":"W2585241149","doi":"10.37236/7958","title":"A Note on Counting Flows in Signed Graphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Abelian group; Signed graph; Zero (linguistics); Graph; Polynomial; Order (exchange); Discrete mathematics; Integer (computer science); Mathematical analysis; Computer science; Linguistics","score_opus":0.019125018630733386,"score_gpt":0.2942883673323062,"score_spread":0.2751633487015728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585241149","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.98635197,0.0012043637,0.0075159953,0.001059084,0.00086268067,0.000672174,0.0000043687437,0.000030066201,0.002299285],"genre_scores_gemma":[0.99911857,0.00042502143,0.0000544177,0.0000794709,0.00008313315,0.000018609953,0.0000018614395,0.00004806548,0.00017082733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753886,0.00032691038,0.00082463626,0.00020280867,0.0005372248,0.00056958344],"domain_scores_gemma":[0.9963599,0.0014136671,0.0012161678,0.0007224695,0.00023707995,0.000050739978],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035625894,0.0003002005,0.0006213786,0.00032021574,0.00011135501,0.00005724489,0.0011540579,0.00025686788,0.000013206438],"category_scores_gemma":[0.0003474119,0.00021558326,0.0003571805,0.00045547914,0.000046443452,0.00005641043,0.0001758697,0.003408149,0.000015761516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082058796,0.00029477666,0.00004609567,0.00007975039,0.000091676906,0.000004351546,0.0004576046,0.00066633755,0.00014817965,0.99775267,0.00024569817,0.00013080823],"study_design_scores_gemma":[0.0007467489,0.0002548106,0.000040286235,0.00029210842,0.0001264119,0.000032057007,0.000079263955,0.0004084161,0.0004079399,0.9966186,0.0007850839,0.00020823108],"about_ca_topic_score_codex":0.0000052055548,"about_ca_topic_score_gemma":0.000013619116,"teacher_disagreement_score":0.01276661,"about_ca_system_score_codex":0.0004505387,"about_ca_system_score_gemma":0.0006744569,"threshold_uncertainty_score":0.99889106},"labels":[],"label_agreement":null},{"id":"W2585272104","doi":"10.37236/7400","title":"Connected Chord Diagrams and Bridgeless Maps","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"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":"Institut des sciences de l'information et de leurs interactions; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Chord (peer-to-peer); Computer science; Distributed computing","score_opus":0.024940668390156403,"score_gpt":0.2954134028923069,"score_spread":0.2704727345021505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585272104","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.9032339,0.015241397,0.067633934,0.0014467669,0.008560003,0.0019328564,0.000022329752,0.00016856917,0.0017602817],"genre_scores_gemma":[0.9954541,0.0031460284,0.0002529795,0.000045953202,0.0004305429,0.000016954336,0.0000047858093,0.00014854265,0.0005001325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580234,0.0004278334,0.0013936518,0.0003570013,0.0010374864,0.0009816836],"domain_scores_gemma":[0.9926012,0.0024718626,0.0026965174,0.0011919136,0.0008653235,0.00017315701],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024912006,0.0006418756,0.0015241414,0.00021392835,0.00015952927,0.00016356597,0.0016346608,0.00048516563,0.000008597186],"category_scores_gemma":[0.00169461,0.00046399946,0.00037607047,0.0003587018,0.00016813795,0.0001528444,0.0009244732,0.0043129306,0.000009960883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084253574,0.00028191897,0.00008553411,0.00050602196,0.00045581875,0.000016818794,0.000514844,0.00007013222,0.00004053246,0.9959097,0.0016424387,0.00039199393],"study_design_scores_gemma":[0.00166987,0.000537988,0.000040833267,0.00044101017,0.0005027658,0.00033191507,0.0001837165,0.00021488467,0.0005154945,0.99258,0.0025032945,0.00047825542],"about_ca_topic_score_codex":0.000004658619,"about_ca_topic_score_gemma":0.000004592775,"teacher_disagreement_score":0.092220224,"about_ca_system_score_codex":0.000820113,"about_ca_system_score_gemma":0.001074684,"threshold_uncertainty_score":0.9997812},"labels":[],"label_agreement":null},{"id":"W2585527963","doi":"10.37236/6915","title":"Counting Lyndon Factors","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Fibonacci number; Mathematics; Word (group theory); Counterexample; Golden ratio; Upper and lower bounds; Combinatorics on words; Alphabet; Word length; Discrete mathematics; Computer science; Philosophy","score_opus":0.010469131315584097,"score_gpt":0.2396999400641482,"score_spread":0.22923080874856408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585527963","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.8507998,0.0019624736,0.14069691,0.0022212116,0.0017433616,0.00006682024,2.3320797e-7,0.000041463336,0.0024677145],"genre_scores_gemma":[0.9994045,0.0002250386,0.000032269458,0.000067703964,0.00009844943,3.7232735e-7,7.6905216e-8,0.000008527878,0.00016307364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987184,0.000072793664,0.00026917754,0.00009724058,0.00039429902,0.00044808237],"domain_scores_gemma":[0.9980558,0.00018731257,0.000788055,0.0007610205,0.00015325373,0.000054538286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016337695,0.000114262606,0.00019244231,0.00005482805,0.0006329364,0.00041687308,0.0033698084,0.000040666444,0.0000049993146],"category_scores_gemma":[0.00019789491,0.00006912109,0.000119695505,0.00009883665,0.00006564105,0.00074382377,0.00023835101,0.0005209421,0.0000064493656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003905968,0.000032773696,0.0011152639,0.0000024901765,0.000033438093,0.0000072820917,0.00024486546,0.0000051868524,0.00022673613,0.99608636,0.00036442696,0.0018772831],"study_design_scores_gemma":[0.0005025955,0.0002413607,0.0054885093,0.000025354573,0.0000197783,0.00014957908,0.0000757366,0.0023567642,0.003422025,0.98179567,0.005792228,0.00013039849],"about_ca_topic_score_codex":0.000010743498,"about_ca_topic_score_gemma":0.0000015057042,"teacher_disagreement_score":0.14860468,"about_ca_system_score_codex":0.00014728912,"about_ca_system_score_gemma":0.0002593108,"threshold_uncertainty_score":0.62619984},"labels":[],"label_agreement":null},{"id":"W2588224742","doi":"10.37236/8747","title":"The Maximum Number of Cycles in a Graph with Fixed Number of Edges","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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 Manitoba","funders":"","keywords":"Multigraph; Combinatorics; Multiple edges; Mathematics; Graph; Complement graph; Upper and lower bounds; Graph power; Strength of a graph; Discrete mathematics; Line graph","score_opus":0.016726757068476514,"score_gpt":0.29760050254431675,"score_spread":0.2808737454758402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588224742","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.99283993,0.0013062988,0.0022567979,0.00051204866,0.00022920812,0.00045641925,0.000006930769,0.000009347603,0.0023830337],"genre_scores_gemma":[0.9978979,0.001653871,0.0001023797,0.000008901986,0.00003360675,0.000019613239,0.0000012440019,0.000039858718,0.00024259169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758536,0.0003483595,0.0009498017,0.00014907641,0.0005303011,0.00043712408],"domain_scores_gemma":[0.9951551,0.0014984278,0.0020117967,0.0008443696,0.0004488821,0.000041444535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021469004,0.0002655661,0.00070402655,0.00009787063,0.00009469255,0.00002544187,0.0012744702,0.00018313479,0.000018391518],"category_scores_gemma":[0.00014842907,0.00014508044,0.00031839582,0.00047033554,0.00026799497,0.00005312906,0.00019797016,0.0017659565,0.000004222091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018895956,0.00036565482,0.0047513274,0.00016964883,0.00036354165,0.0000012881092,0.00050114526,0.00007997391,0.000057233578,0.9930757,0.00027418643,0.00017133879],"study_design_scores_gemma":[0.0007678783,0.0001196964,0.00070020545,0.0003251666,0.00023050624,0.00011875268,0.00046735216,0.0000112215575,0.0018252439,0.99494094,0.00034260342,0.00015042475],"about_ca_topic_score_codex":0.000015050123,"about_ca_topic_score_gemma":0.00002417308,"teacher_disagreement_score":0.005058018,"about_ca_system_score_codex":0.00012491488,"about_ca_system_score_gemma":0.0006266183,"threshold_uncertainty_score":0.76723003},"labels":[],"label_agreement":null},{"id":"W2588376139","doi":"10.37236/7159","title":"Clique Colourings of Geometric Graphs","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Clique number; Chromatic scale; Vertex (graph theory); Euclidean geometry; Clique; Discrete mathematics; Graph; Random graph; Clique graph; Graph power; Line graph; Geometry","score_opus":0.02056167142032056,"score_gpt":0.29325566807325076,"score_spread":0.2726939966529302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588376139","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.9827061,0.0068044243,0.005467831,0.00021685351,0.0026020752,0.00035915748,0.000007858187,0.000025242685,0.0018104388],"genre_scores_gemma":[0.99634355,0.0029317313,0.00014230722,0.000041317482,0.0002590344,0.00000435116,0.0000010850349,0.000060199036,0.00021639754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996556,0.0004041468,0.0012808774,0.000205699,0.0008841922,0.0006691158],"domain_scores_gemma":[0.99372053,0.0012169098,0.0030202891,0.00088427926,0.0010614716,0.000096523385],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004376589,0.00037938662,0.0010169402,0.00073073053,0.0002053768,0.000035922516,0.0020527856,0.00043609724,0.000039748003],"category_scores_gemma":[0.0010869266,0.00024243651,0.0007122534,0.00083572225,0.00034639335,0.0000635701,0.0007960182,0.0030209923,0.000001104897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012843603,0.00016635798,0.0002566669,0.00023972282,0.00065135764,0.000006325804,0.0005961085,0.00001597059,0.00001840442,0.9955589,0.0022070685,0.00015464223],"study_design_scores_gemma":[0.0006234136,0.0008845145,0.0002330342,0.00018435925,0.0004430767,0.0001674547,0.000067182686,0.000011721512,0.0024180054,0.9935962,0.0011397717,0.00023125726],"about_ca_topic_score_codex":0.000006562237,"about_ca_topic_score_gemma":0.0000019815222,"teacher_disagreement_score":0.013637458,"about_ca_system_score_codex":0.000343028,"about_ca_system_score_gemma":0.0008214332,"threshold_uncertainty_score":0.9992791},"labels":[],"label_agreement":null},{"id":"W2604316954","doi":"10.37236/7148","title":"A Euclidean Ramsey Result in the Plane","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"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 Manitoba","funders":"","keywords":"Euclidean geometry; Plane (geometry); Combinatorics; Unit (ring theory); Mathematics; Line (geometry); Euclidean distance; Ramsey theory; Geometry; Mathematics education","score_opus":0.038481450273841096,"score_gpt":0.3276938492511555,"score_spread":0.28921239897731443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604316954","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.9585782,0.013782088,0.0011037978,0.0060403706,0.0045855106,0.0009634816,0.00001570022,0.00003519615,0.014895616],"genre_scores_gemma":[0.9964374,0.0025191328,0.000028059178,0.00014395498,0.00046976472,0.0000072793687,0.0000022191887,0.000042908297,0.000349307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633527,0.00086518395,0.00096584024,0.00020292646,0.00091089995,0.0007198717],"domain_scores_gemma":[0.9942978,0.0016664505,0.002104845,0.0016318859,0.0002422408,0.000056773635],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00822462,0.00036724945,0.00073335186,0.00018621284,0.00048780613,0.00019374487,0.00429277,0.00034667738,0.000010971857],"category_scores_gemma":[0.0015573892,0.00018270036,0.0003997709,0.00014321276,0.00021026573,0.00007697465,0.0006149709,0.0057951924,0.0000017528786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015040436,0.000114210576,0.00009301227,0.00007200891,0.00020560037,0.00006140829,0.0035067126,0.000024232073,0.000003851237,0.9914022,0.0039922227,0.00037411126],"study_design_scores_gemma":[0.00089165627,0.00025474516,0.0003267796,0.00021338156,0.0002046296,0.00043990999,0.0003277457,0.000022552947,0.000046228004,0.99074686,0.0063163633,0.00020915254],"about_ca_topic_score_codex":0.00002090527,"about_ca_topic_score_gemma":0.000031615535,"teacher_disagreement_score":0.037859134,"about_ca_system_score_codex":0.0003185408,"about_ca_system_score_gemma":0.00067731756,"threshold_uncertainty_score":0.99649847},"labels":[],"label_agreement":null},{"id":"W2605281015","doi":"10.37236/6937","title":"Minimum Degree Conditions for Small Percolating Sets in Bootstrap Percolation","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":7,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Degree (music); Graph; Path graph; Independent set; Discrete mathematics; Graph power; Physics; Line graph","score_opus":0.15673898180911394,"score_gpt":0.372856197925765,"score_spread":0.21611721611665108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605281015","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.094742544,0.0011778767,0.9001177,0.001881817,0.000678802,0.0010478932,0.000047904563,0.000029247236,0.00027624166],"genre_scores_gemma":[0.99724704,0.0001551642,0.0021887526,0.00007365954,0.00017825374,0.00005330563,0.000013116992,0.000055701654,0.000035031837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758494,0.00013123263,0.0010495082,0.00023190035,0.00041409596,0.0005882964],"domain_scores_gemma":[0.99541515,0.002636917,0.0010308924,0.00026302072,0.00054152444,0.00011248466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013733419,0.00030345717,0.0006920778,0.00014140787,0.0001506525,0.00007994028,0.00068599556,0.00027154855,0.000011942504],"category_scores_gemma":[0.0034654553,0.0002410864,0.00026512402,0.00024727546,0.00003836473,0.00006352267,0.00016771039,0.0021117807,0.0000015701077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010426485,0.00015259824,0.000012860876,0.00043071283,0.00012574521,0.000009707584,0.00078978844,0.0001231298,0.00013268263,0.99725366,0.00045126604,0.00041358013],"study_design_scores_gemma":[0.0010582488,0.0006675731,0.00007736515,0.0003089554,0.00032181593,0.000070100556,0.0003871222,0.034282986,0.000053247422,0.96246654,0.00007883167,0.00022720544],"about_ca_topic_score_codex":0.0000053460417,"about_ca_topic_score_gemma":0.000038053866,"teacher_disagreement_score":0.90250444,"about_ca_system_score_codex":0.00058945623,"about_ca_system_score_gemma":0.0013571634,"threshold_uncertainty_score":0.9831218},"labels":[],"label_agreement":null},{"id":"W2706631011","doi":"10.37236/6402","title":"Longest Monotone Subsequences and Rare Regions of Pattern-Avoiding Permutations","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"York University","funders":"","keywords":"Combinatorics; Mathematics; Unit square; Permutation (music); Monotone polygon; Diagonal; Complement (music); Boundary (topology); Square (algebra); Lipschitz continuity; Unit (ring theory); Class (philosophy); Distribution (mathematics); Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis; Computer science; Physics","score_opus":0.055902470335729156,"score_gpt":0.3402813221758966,"score_spread":0.2843788518401674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2706631011","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.8344904,0.01693054,0.14181341,0.002482495,0.0025076766,0.0010165827,0.000023267316,0.00005873458,0.0006768781],"genre_scores_gemma":[0.9924552,0.006816561,0.00023091113,0.00000941848,0.00021747132,0.000019078288,0.0000024239898,0.00007460062,0.00017434057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967859,0.0003629296,0.0012343194,0.00025300687,0.0007853956,0.0005784577],"domain_scores_gemma":[0.9915742,0.001975429,0.0042946897,0.0011383857,0.00089499203,0.00012226829],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022420527,0.00043083078,0.0011291305,0.00018380581,0.0004753986,0.00012661182,0.0016445484,0.0002984172,0.000005458269],"category_scores_gemma":[0.0025973052,0.00032265842,0.00031708734,0.00016217193,0.00034862955,0.00023202643,0.0005768393,0.0028708635,0.0000010666621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025389978,0.00021003658,0.0001566224,0.0004869457,0.00034669007,0.000022210947,0.002023292,0.00008643052,0.00010790636,0.9959995,0.00025863378,0.00027630047],"study_design_scores_gemma":[0.00069966225,0.00033528445,0.00006414749,0.0008490258,0.00053738826,0.00030721255,0.0007164843,0.0002210781,0.00109907,0.99473786,0.00014488121,0.0002879238],"about_ca_topic_score_codex":0.000015325939,"about_ca_topic_score_gemma":0.000016599659,"teacher_disagreement_score":0.15796478,"about_ca_system_score_codex":0.0004521898,"about_ca_system_score_gemma":0.0009924257,"threshold_uncertainty_score":0.9999226},"labels":[],"label_agreement":null},{"id":"W2745422027","doi":"10.37236/6361","title":"Quasi-Eulerian Hypergraphs","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"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 Ottawa","funders":"","keywords":"Hypergraph; Eulerian path; Mathematics; Combinatorics; Euler's formula; Traverse; Connected component; Euler characteristic; Graph; Discrete mathematics; Pure mathematics; Lagrangian; Mathematical analysis","score_opus":0.014251556329555026,"score_gpt":0.28635943656400586,"score_spread":0.2721078802344508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745422027","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.1905855,0.0061512073,0.7804871,0.012807091,0.0024383806,0.00026297412,6.220681e-7,0.000068134206,0.0071989526],"genre_scores_gemma":[0.9985219,0.0007141004,0.00015739977,0.000065303626,0.000093957846,0.0000019199267,5.556162e-8,0.000012955506,0.0004323743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979957,0.00020028879,0.00031315154,0.0001469648,0.00063665165,0.0007072701],"domain_scores_gemma":[0.9972997,0.00020927553,0.00061471225,0.0014163303,0.00033868165,0.00012132582],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0024065333,0.00013692852,0.00023860982,0.0001450091,0.00082326937,0.00033967005,0.0058189845,0.000049981114,0.0000051049356],"category_scores_gemma":[0.00035209462,0.000089782756,0.00017383734,0.0002797177,0.00020431087,0.00091602537,0.00037774423,0.00093370094,0.000016101681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023686773,0.00011268571,0.00026078193,0.0000025057616,0.00004728792,0.000018101815,0.00011726769,0.00000891714,0.00025374486,0.9950911,0.0001693043,0.0038946285],"study_design_scores_gemma":[0.0006028693,0.00085503416,0.0007219394,0.000012701205,0.0000096817685,0.00023892875,0.00002756647,0.00034127737,0.0014676987,0.9879957,0.0076187225,0.000107887114],"about_ca_topic_score_codex":0.000004174935,"about_ca_topic_score_gemma":0.0000034815248,"teacher_disagreement_score":0.80793643,"about_ca_system_score_codex":0.00015289847,"about_ca_system_score_gemma":0.00045730258,"threshold_uncertainty_score":0.99956},"labels":[],"label_agreement":null},{"id":"W2749551738","doi":"10.37236/6738","title":"On $t$-Common List-Colorings","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Graph; Integer (computer science); Chromatic scale; Upper and lower bounds; Discrete mathematics","score_opus":0.014894760056865311,"score_gpt":0.3002501605083333,"score_spread":0.285355400451468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749551738","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.81335527,0.0021454121,0.14568822,0.014670437,0.0020703895,0.00032613953,5.1444573e-7,0.000075607015,0.021668022],"genre_scores_gemma":[0.9988038,0.00029605272,0.000043413274,0.0001119803,0.000060642444,0.0000023048879,4.1761947e-8,0.00001252123,0.000669263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980852,0.00015862928,0.00028306138,0.00014951512,0.0006773162,0.00064628554],"domain_scores_gemma":[0.99731374,0.00041260186,0.00060849683,0.0013352952,0.00022744585,0.000102414524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022246586,0.00013521568,0.00023174673,0.00012995584,0.0007481066,0.00030628665,0.005352647,0.000048034042,0.0000049763894],"category_scores_gemma":[0.00041961356,0.00008842185,0.00013996928,0.00021134915,0.00014657676,0.0006665121,0.00036793758,0.0012013355,0.000019925139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053690826,0.00007412974,0.00016985825,0.000002349382,0.000030597923,0.000023870321,0.0000814166,0.00004424768,0.00015790944,0.99638414,0.00024284334,0.0027349344],"study_design_scores_gemma":[0.00058184896,0.0010179447,0.00068821537,0.00001994525,0.0000071608115,0.000117207856,0.000009127555,0.0003447369,0.003019095,0.98983896,0.0042586992,0.00009705384],"about_ca_topic_score_codex":0.0000047820336,"about_ca_topic_score_gemma":0.000003220804,"teacher_disagreement_score":0.18544853,"about_ca_system_score_codex":0.0002882671,"about_ca_system_score_gemma":0.00029350055,"threshold_uncertainty_score":0.9946639},"labels":[],"label_agreement":null},{"id":"W2750861906","doi":"10.37236/7992","title":"Greene–Kleitman Invariants for Sulzgruber Insertion","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Bijection, injection and surjection; Partition (number theory); Mathematics; Combinatorics; Diagonal; Hook; Equivalence (formal languages); Plane (geometry); Pure mathematics; Discrete mathematics; Geometry; Bijection","score_opus":0.05092117577482457,"score_gpt":0.335497312852516,"score_spread":0.2845761370776914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750861906","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.38688523,0.0047436836,0.5842483,0.0023219497,0.015759915,0.0042532245,0.000028746334,0.00016442126,0.0015945132],"genre_scores_gemma":[0.99582535,0.00071825314,0.0012869032,0.000076741846,0.00070613564,0.000059151043,0.0000074277614,0.00019387061,0.0011261681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955432,0.00032459007,0.001676848,0.00035387735,0.0010621139,0.0010394049],"domain_scores_gemma":[0.99145967,0.0022844407,0.0034353063,0.0013540683,0.0013340187,0.0001324975],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036296244,0.0006193571,0.0013693614,0.00025630416,0.00019443526,0.000120495526,0.0020932986,0.00056468905,0.000017253631],"category_scores_gemma":[0.0022570956,0.00045508464,0.0006911441,0.00030589828,0.00008532725,0.00022544763,0.00060924626,0.0029932584,0.000018163924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022095349,0.00040226147,0.0000327718,0.00061531446,0.00049314054,0.0000046307778,0.0004052542,0.00045124177,0.00008007848,0.9939184,0.0031732884,0.00020267446],"study_design_scores_gemma":[0.0022068308,0.0008570721,0.000021998221,0.00043263685,0.0006238011,0.00011866594,0.0001023587,0.0009768113,0.00078534614,0.9902676,0.0031451364,0.00046179027],"about_ca_topic_score_codex":0.0000045413976,"about_ca_topic_score_gemma":0.0000055292353,"teacher_disagreement_score":0.6089401,"about_ca_system_score_codex":0.0013788079,"about_ca_system_score_gemma":0.0018219368,"threshold_uncertainty_score":0.9997901},"labels":[],"label_agreement":null},{"id":"W2755482418","doi":"10.37236/7311","title":"Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Degenerate energy levels; Graph; Planar graph; Degree (music); Induced subgraph; Planar; Discrete mathematics; Physics; Computer science; Quantum mechanics; Vertex (graph theory)","score_opus":0.025519931330893145,"score_gpt":0.2824454042820947,"score_spread":0.25692547295120155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755482418","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.7529243,0.01683037,0.22189844,0.0021091697,0.0042904564,0.0008301322,0.000015864825,0.00009317117,0.0010080546],"genre_scores_gemma":[0.99668384,0.0024151066,0.00048813826,0.000055066328,0.00018430792,0.000010857671,0.000002113259,0.000048377802,0.000112180474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99430186,0.0010883126,0.001303941,0.00045813265,0.0016661844,0.001181591],"domain_scores_gemma":[0.9925089,0.00066718867,0.002314163,0.0027475024,0.0015468503,0.00021543428],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0062582744,0.00047565854,0.0010755756,0.0010186564,0.00022194792,0.00014361936,0.010624571,0.0003546471,0.000007989849],"category_scores_gemma":[0.0005760815,0.00034093528,0.0007190309,0.00185109,0.00033143812,0.00034368408,0.001662477,0.0037018815,0.000005455403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019616123,0.00019607089,0.000085228225,0.00005246639,0.00044399637,0.000025091786,0.00043813718,0.00008639576,0.0014741886,0.9953021,0.0007768345,0.00092337275],"study_design_scores_gemma":[0.001552679,0.0015958626,0.000093711315,0.00012559175,0.00007880602,0.00014632914,0.000030446625,0.0002888672,0.019408273,0.9759068,0.00046589694,0.00030673153],"about_ca_topic_score_codex":0.000016065305,"about_ca_topic_score_gemma":0.000011104516,"teacher_disagreement_score":0.24375951,"about_ca_system_score_codex":0.00038573958,"about_ca_system_score_gemma":0.0021505079,"threshold_uncertainty_score":0.9999043},"labels":[],"label_agreement":null},{"id":"W2755572401","doi":"10.37236/2571","title":"Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Multiplicity (mathematics); Poisson distribution; Combinatorics; Asymptotically optimal algorithm; Discrete mathematics; Mathematical analysis; Statistics; Algorithm","score_opus":0.021941474752891755,"score_gpt":0.28097205566234357,"score_spread":0.2590305809094518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755572401","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.7847928,0.0047007105,0.20393178,0.0022381325,0.00046041093,0.00036786214,0.000014696691,0.0000459107,0.0034476977],"genre_scores_gemma":[0.9989201,0.00038008564,0.00025375056,0.00007941451,0.0001321141,0.000004033593,0.0000013608843,0.00002971445,0.0001994487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796987,0.00018122216,0.000563988,0.000082261395,0.0004675852,0.00073506276],"domain_scores_gemma":[0.9977315,0.0009422517,0.00046412626,0.00042258392,0.00024726937,0.00019227019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015884577,0.00017657632,0.00038266525,0.00008428303,0.00022830085,0.00006608632,0.0005041021,0.00009981432,0.000032311124],"category_scores_gemma":[0.0005574845,0.000117111114,0.00011751592,0.00029826793,0.0000767777,0.00023395458,0.00013511445,0.00072850985,0.0000053858184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028702141,0.00050553156,0.0003478896,0.000038712027,0.00009917838,0.0000043738883,0.00029906764,0.0000016402096,0.00009235124,0.9969053,0.0015912809,0.00008594111],"study_design_scores_gemma":[0.0010806501,0.00030350522,0.00080870965,0.00005568721,0.00016825361,0.00029434447,0.00009751787,0.0008377208,0.00006803119,0.9940876,0.0020546732,0.00014332517],"about_ca_topic_score_codex":0.000003151509,"about_ca_topic_score_gemma":0.000005180936,"teacher_disagreement_score":0.21412727,"about_ca_system_score_codex":0.00013480199,"about_ca_system_score_gemma":0.00014531506,"threshold_uncertainty_score":0.4775653},"labels":[],"label_agreement":null},{"id":"W2756975744","doi":"10.37236/5357","title":"Internally Fair Factorizations and Internally Fair Holey Factorizations with Prescribed Regularity","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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 Ottawa","funders":"","keywords":"Multigraph; Mathematics; Combinatorics; Factorization; Multipartite; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Decomposition; Algorithm; Computer science; Graph","score_opus":0.004012664316105553,"score_gpt":0.18156756950863237,"score_spread":0.1775549051925268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756975744","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.789021,0.0017280243,0.20572014,0.0003905286,0.0012488265,0.00022242853,0.000008284694,0.000082453174,0.001578328],"genre_scores_gemma":[0.99907327,0.00027848498,0.000013973002,0.000011879897,0.000117493146,0.000004328475,0.000001708871,0.000038630358,0.0004602319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986716,0.00009223245,0.00039573686,0.000115487754,0.00032695997,0.00039798146],"domain_scores_gemma":[0.99866456,0.000082621336,0.00038861303,0.0004894067,0.00025897616,0.00011583065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051768014,0.00021714061,0.0003003122,0.00010953386,0.00042047273,0.00028547854,0.0009160118,0.00008706762,0.000008374061],"category_scores_gemma":[0.00009313299,0.00014781408,0.00009434288,0.00012782915,0.0001301097,0.00052215595,0.00007096946,0.00078399543,0.000002174842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014593297,0.00013920583,0.019174619,0.00008632665,0.0010341282,0.000027561638,0.0023772279,0.0016136552,0.0030100385,0.9708647,0.00065009337,0.00087652385],"study_design_scores_gemma":[0.0061783106,0.0027285577,0.08118519,0.000940325,0.0007580914,0.0014218964,0.0010604654,0.0040469724,0.010610548,0.84280777,0.04683654,0.0014253274],"about_ca_topic_score_codex":0.0000139753365,"about_ca_topic_score_gemma":0.0000474272,"teacher_disagreement_score":0.21005228,"about_ca_system_score_codex":0.0001668956,"about_ca_system_score_gemma":0.00012804708,"threshold_uncertainty_score":0.6027683},"labels":[],"label_agreement":null},{"id":"W2757261819","doi":"10.37236/5641","title":"Relative Difference Sets Partitioned by Cosets","year":2017,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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 Victoria","funders":"","keywords":"Coset; Mathematics; Intersection (aeronautics); Combinatorics; Group (periodic table); Diophantine equation; Class (philosophy); Quadratic equation; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.006520478916777124,"score_gpt":0.21377201144028207,"score_spread":0.20725153252350495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757261819","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.97887164,0.0060336147,0.009182702,0.0004014358,0.001173518,0.00010865763,0.000004189241,0.00003990811,0.004184335],"genre_scores_gemma":[0.9989993,0.0006223469,9.666052e-7,0.000011777079,0.000039685856,0.0000029048629,7.691063e-7,0.000016095082,0.0003061422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905026,0.00008734216,0.00025935855,0.000053842625,0.00021373149,0.00033549286],"domain_scores_gemma":[0.9991729,0.0000990346,0.00026325558,0.00032240228,0.000082316226,0.00006004632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389679,0.00011758643,0.00019910665,0.00003157221,0.00033426288,0.00007212161,0.0005926235,0.000058278132,0.0000093065555],"category_scores_gemma":[0.00006414978,0.00008127747,0.00008695895,0.000060347757,0.0000716664,0.00021678356,0.000021530526,0.0005824994,0.000012037151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035298865,0.00005685183,0.00059756596,0.000017938342,0.00024087414,0.000008157775,0.00045690584,0.00015444832,0.0023992714,0.9919289,0.003460885,0.00064290146],"study_design_scores_gemma":[0.0007208721,0.00024394807,0.0019934408,0.00005222891,0.00005483514,0.00009819586,0.00006967226,0.0005196485,0.0045389687,0.9868288,0.0047336784,0.00014573081],"about_ca_topic_score_codex":0.000001908476,"about_ca_topic_score_gemma":0.0000020515113,"teacher_disagreement_score":0.020127673,"about_ca_system_score_codex":0.0001306084,"about_ca_system_score_gemma":0.000046901572,"threshold_uncertainty_score":0.33143988},"labels":[],"label_agreement":null},{"id":"W2766400344","doi":"10.37236/7399","title":"Continuants, Run Lengths, and Barry's Modified Pascal Triangle","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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; Austrian Science Fund","keywords":"Pascal (unit); Diagonal; Binary number; Representation (politics)","score_opus":0.014732854594018786,"score_gpt":0.27038442508363214,"score_spread":0.25565157048961334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766400344","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.9775419,0.0034802095,0.012702214,0.001251544,0.0017108732,0.00059978676,0.000001651773,0.000056506153,0.002655289],"genre_scores_gemma":[0.99765074,0.000596669,0.00018969162,0.000048136633,0.00016432897,0.0000047195526,3.4726824e-7,0.00006001791,0.0012853686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973224,0.0002495988,0.00087402517,0.00017866852,0.0006743526,0.0007010013],"domain_scores_gemma":[0.9962683,0.0017796549,0.0009418653,0.00054448907,0.00033373883,0.00013197087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022711647,0.00028821896,0.00080996996,0.00012329126,0.00013235387,0.00006346595,0.00069883844,0.00014808863,0.000029538576],"category_scores_gemma":[0.0010578013,0.00019695346,0.00020574279,0.00032440713,0.00008294268,0.000258713,0.0001332743,0.0008714624,0.00001704328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001334859,0.00020223217,0.000058034344,0.000058552552,0.00014526307,0.000006971106,0.0005109182,0.000009405893,0.0003346542,0.9973306,0.000786593,0.00042327176],"study_design_scores_gemma":[0.0036261512,0.000803209,0.000031539963,0.00007883339,0.00014500452,0.0002608103,0.00042671704,0.0002760105,0.0010229234,0.9891723,0.0039324444,0.0002240735],"about_ca_topic_score_codex":0.000001998901,"about_ca_topic_score_gemma":0.0000020103112,"teacher_disagreement_score":0.020108795,"about_ca_system_score_codex":0.00029752785,"about_ca_system_score_gemma":0.00031339112,"threshold_uncertainty_score":0.8031529},"labels":[],"label_agreement":null},{"id":"W2767562605","doi":"10.37236/109","title":"On a Problem of Marco Buratti","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01356816524068383,"score_gpt":0.2845898947932947,"score_spread":0.2710217295526109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767562605","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.98107576,0.0008245581,0.0066141835,0.0034464067,0.00006975018,0.00026446948,0.0000010565575,0.000019664283,0.0076841493],"genre_scores_gemma":[0.99938416,0.00012334196,0.00009293496,0.00007498479,0.000027565116,0.0000018640686,1.6643052e-7,0.000008773616,0.00028617703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989294,0.00010066368,0.00038728857,0.000056137975,0.00026975342,0.0002567576],"domain_scores_gemma":[0.99863166,0.00043055107,0.00048188426,0.00024920443,0.00016861761,0.00003808508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011257358,0.00009551231,0.00021581828,0.000077739904,0.00008113871,0.000009527738,0.00042026857,0.00004087093,0.000014394455],"category_scores_gemma":[0.000085010455,0.000059939415,0.0001315912,0.00032884334,0.000041561834,0.000049885028,0.000010776488,0.00048121318,0.000003440699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058313555,0.0003559095,0.000005463623,0.000008434577,0.000039040337,9.278958e-7,0.0001574189,0.000009890953,0.0008222917,0.99671793,0.0011947614,0.0006296456],"study_design_scores_gemma":[0.00045194212,0.0010609021,0.00005562344,0.000037261827,0.000058328475,0.000059193786,0.00004844038,0.000008369113,0.0039736284,0.99316317,0.0010245623,0.00005856522],"about_ca_topic_score_codex":3.347572e-7,"about_ca_topic_score_gemma":3.23383e-7,"teacher_disagreement_score":0.01830843,"about_ca_system_score_codex":0.000072714894,"about_ca_system_score_gemma":0.00013173438,"threshold_uncertainty_score":0.24442583},"labels":[],"label_agreement":null},{"id":"W2767999306","doi":"10.37236/1898","title":"Sequentially Perfect and Uniform One-Factorizations of the Complete Graph","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"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; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Factorization; Disjoint sets; Graph; Hamiltonian path; Complete graph; Discrete mathematics; Perfect power; Integer (computer science); Algorithm; Computer science","score_opus":0.007111906554473927,"score_gpt":0.17972801566762212,"score_spread":0.17261610911314818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767999306","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.9831001,0.004413578,0.009527541,0.00024632085,0.00057529815,0.00014101,0.0000035063003,0.00002345604,0.001969163],"genre_scores_gemma":[0.9992205,0.00062176806,0.0000058398423,0.000013117858,0.0000686175,9.927271e-7,3.36632e-7,0.000015556703,0.00005325306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990699,0.0000936178,0.00032420558,0.00004244115,0.00022532475,0.00024446775],"domain_scores_gemma":[0.9994332,0.000075507014,0.00016929432,0.00018532827,0.00009920646,0.000037418537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868995,0.000102294725,0.00018796281,0.00007007319,0.00012259523,0.000018996696,0.0003479777,0.000043169566,0.000009108058],"category_scores_gemma":[0.000017667417,0.00006257041,0.00011484964,0.00033676554,0.00007067228,0.00011000374,0.00002231139,0.00042769703,0.0000010377014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010987306,0.00003461542,0.00040694152,0.000028043585,0.00018016527,2.909948e-7,0.00046931018,0.004734904,0.006371077,0.98747176,0.00007427903,0.00021761715],"study_design_scores_gemma":[0.0020139646,0.0006430244,0.004503774,0.00018534971,0.00041207857,0.0004459748,0.0004369079,0.004261492,0.023247022,0.9439142,0.019548021,0.00038818843],"about_ca_topic_score_codex":0.000002337071,"about_ca_topic_score_gemma":0.000011995914,"teacher_disagreement_score":0.043557566,"about_ca_system_score_codex":0.00010554903,"about_ca_system_score_gemma":0.000083749765,"threshold_uncertainty_score":0.25515473},"labels":[],"label_agreement":null},{"id":"W2769849793","doi":"10.37236/7524","title":"Necessary Conditions for Schur-Maximality","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"Conjecture; Mathematics; Row; Combinatorics; Skew; Order (exchange); Physics; Computer science","score_opus":0.05002670505778937,"score_gpt":0.3660458249375915,"score_spread":0.31601911987980214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769849793","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.40121302,0.0067816186,0.5606361,0.0045548147,0.018406231,0.004398021,0.00016022139,0.0003210323,0.0035289202],"genre_scores_gemma":[0.9959453,0.0005183832,0.0014595187,0.00007265683,0.001299038,0.000090147005,0.0000121991925,0.00015295652,0.0004498063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572814,0.00034037672,0.001638741,0.00032802697,0.00094341533,0.0010213073],"domain_scores_gemma":[0.99029416,0.002907554,0.003300145,0.0012919324,0.002046195,0.00015998684],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0038930483,0.0005666853,0.0012567346,0.0002141541,0.00039828135,0.0001251232,0.0022177687,0.0004786575,0.00003257549],"category_scores_gemma":[0.0032505484,0.00042045838,0.00074506213,0.00034509003,0.00028844495,0.00019617863,0.0006140913,0.0028085108,0.000009759603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110547204,0.0004742973,0.000010040973,0.0004531487,0.00051707565,0.000004422619,0.0002912907,0.00004004626,0.00004876308,0.9856557,0.0123465285,0.000048138998],"study_design_scores_gemma":[0.0014743492,0.0008246125,0.000007835182,0.00034441196,0.00075917033,0.00013385707,0.00015247794,0.0003099878,0.001128431,0.990272,0.0041800444,0.00041285233],"about_ca_topic_score_codex":0.000002121687,"about_ca_topic_score_gemma":0.0000029331945,"teacher_disagreement_score":0.5947323,"about_ca_system_score_codex":0.0011634477,"about_ca_system_score_gemma":0.001997115,"threshold_uncertainty_score":0.9998247},"labels":[],"label_agreement":null},{"id":"W2770859862","doi":"10.37236/1671","title":"There Are Ternary Circular Square-Free Words of Length $n$ for $n\\ge 18$","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Ternary operation; Combinatorics; Square (algebra); Geometry; Computer science","score_opus":0.01556969058956936,"score_gpt":0.22256243941455833,"score_spread":0.20699274882498897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770859862","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.426359,0.04720258,0.5182015,0.0051313927,0.0014220522,0.00041977345,0.0000062726394,0.00008588729,0.0011715736],"genre_scores_gemma":[0.998369,0.00092634157,0.0001516479,0.000120286466,0.00012189679,0.00000434163,2.2114409e-7,0.000021279648,0.0002850133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981364,0.00015941495,0.00049695815,0.00015748198,0.00050582393,0.00054393517],"domain_scores_gemma":[0.9976894,0.00038157616,0.00077244936,0.0008542462,0.00023009065,0.000072226925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014113376,0.00017755378,0.0003608244,0.0001177849,0.00013417032,0.000060960516,0.0028893473,0.00007455754,0.000027394193],"category_scores_gemma":[0.00010391018,0.00012127749,0.00028133058,0.00041494946,0.00006403985,0.0003334704,0.00017767471,0.00048569642,0.000004075478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003187917,0.0003273418,0.00040546677,0.00005685428,0.00023499649,0.000023947667,0.0010266895,0.00009428849,0.0004675711,0.9873982,0.004669967,0.005262808],"study_design_scores_gemma":[0.00176814,0.001040239,0.00050709804,0.00010030192,0.00007079644,0.0002806936,0.00026455717,0.013874369,0.002579047,0.97371423,0.0055915164,0.00020898902],"about_ca_topic_score_codex":0.0000034367836,"about_ca_topic_score_gemma":0.0000010568015,"teacher_disagreement_score":0.57201,"about_ca_system_score_codex":0.00017019839,"about_ca_system_score_gemma":0.0001219732,"threshold_uncertainty_score":0.53691745},"labels":[],"label_agreement":null},{"id":"W2785057641","doi":"10.37236/3797","title":"A Large Set of Torus Obstructions and How They Were Discovered","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":13,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Torus; Embedding; Mathematics; Set (abstract data type); Planar graph; Graph; Book embedding; Quadratic equation; Graph embedding; Combinatorics; Discrete mathematics; Algorithm; Theoretical computer science; 1-planar graph; Computer science; Chordal graph; Artificial intelligence; Geometry","score_opus":0.007030571926645761,"score_gpt":0.21445783552149023,"score_spread":0.20742726359484445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785057641","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.93394536,0.0018085585,0.05659018,0.0042478186,0.0011368471,0.00009368069,0.000008976414,0.00001817084,0.0021504287],"genre_scores_gemma":[0.99932766,0.00018041565,0.000037034017,0.000038138987,0.00010038125,2.869621e-7,3.3721602e-7,0.0000058733585,0.00030985754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905586,0.00004860493,0.00018003827,0.00008817117,0.00029548022,0.00033181778],"domain_scores_gemma":[0.99907756,0.00006941627,0.00028803773,0.00027698715,0.0002301029,0.000057919813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004139702,0.00009566119,0.00017856594,0.000050907907,0.00012013266,0.0001098925,0.0006738962,0.000033161385,0.0000016001676],"category_scores_gemma":[0.00004191777,0.00005933829,0.00007742835,0.00023406032,0.00010865877,0.0005118898,0.00016342805,0.00025502584,0.0000015151822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010604943,0.000036071644,0.00016090073,0.000003465146,0.00004840631,0.0000017049512,0.00070901087,0.0000012483555,0.00007768379,0.9967092,0.0005700442,0.0016716602],"study_design_scores_gemma":[0.00055408606,0.0008680538,0.00053676753,0.000017961223,0.000023932567,0.00029181206,0.0002560272,0.00028105872,0.0014891928,0.98418677,0.011406649,0.00008768093],"about_ca_topic_score_codex":0.000002868566,"about_ca_topic_score_gemma":0.000012714711,"teacher_disagreement_score":0.06538234,"about_ca_system_score_codex":0.000064909655,"about_ca_system_score_gemma":0.00022110579,"threshold_uncertainty_score":0.24197453},"labels":[],"label_agreement":null},{"id":"W2789042343","doi":"10.37236/6898","title":"Fixed Points of the Evacuation of Maximal Chains on Fuss Shapes","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Partially ordered set; Lambda; Partition (number theory); Fixed point; Involution (esoterism); Hasse diagram; Antichain; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.025733569720509473,"score_gpt":0.30077942800239,"score_spread":0.2750458582818805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789042343","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.9790363,0.00031210703,0.016192285,0.001219709,0.0012052676,0.00043580055,0.000003162935,0.000018883038,0.0015765392],"genre_scores_gemma":[0.99924576,0.00007420389,0.00021417349,0.000043639684,0.00018521801,0.0000028983304,1.5983134e-7,0.000037828944,0.00019614334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972516,0.00027492925,0.00095978664,0.000111468245,0.0009769102,0.00042531767],"domain_scores_gemma":[0.99517053,0.0013383684,0.0019964857,0.0005446191,0.0009007992,0.00004916459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019613365,0.00021108365,0.0005221596,0.0001157569,0.00014072594,0.000011754872,0.0010808799,0.000102864135,0.00002554738],"category_scores_gemma":[0.002379123,0.000120911995,0.00025497194,0.0005707398,0.00023333669,0.00011632398,0.00012257976,0.000641536,0.0000045538327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015872107,0.00040045535,0.00004542418,0.000060260933,0.00011946774,6.0609165e-7,0.00087142905,0.000012578167,0.0018202772,0.99593544,0.00033660428,0.00023874213],"study_design_scores_gemma":[0.0011633758,0.0016198497,0.00017003789,0.00018169635,0.0001410179,0.00003979486,0.0001846101,0.00031479882,0.048291888,0.9475347,0.00025040784,0.00010781481],"about_ca_topic_score_codex":0.0000015705043,"about_ca_topic_score_gemma":0.0000032734076,"teacher_disagreement_score":0.048400726,"about_ca_system_score_codex":0.0003169508,"about_ca_system_score_gemma":0.00039509966,"threshold_uncertainty_score":0.49306482},"labels":[],"label_agreement":null},{"id":"W2792181057","doi":"10.37236/8278","title":"Split Graphs: Combinatorial Species and Asymptotics","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":"York University","funders":"","keywords":"Combinatorics; Split graph; Mathematics; Chordal graph; Conjecture; Clique-sum; Indifference graph; Clique; Graph; Cograph; 1-planar graph; Pathwidth; Discrete mathematics; Block graph; Line graph","score_opus":0.013820382609624227,"score_gpt":0.26091308678651526,"score_spread":0.24709270417689103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792181057","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.3523484,0.04372682,0.57205516,0.005252424,0.020439535,0.0016238054,0.000011329232,0.0001801256,0.0043624104],"genre_scores_gemma":[0.9923949,0.0065037315,0.0002347421,0.000066917266,0.00023577684,0.0000051071247,0.0000013783925,0.00004299994,0.0005144447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956005,0.0005878413,0.0008230014,0.00044971338,0.001431361,0.0011075507],"domain_scores_gemma":[0.9954225,0.0009227123,0.001140306,0.0014843121,0.0008349979,0.00019517209],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003595712,0.00045956904,0.00083492865,0.00046871908,0.00023859869,0.00044233835,0.0047461195,0.0003112619,0.0000056412127],"category_scores_gemma":[0.00029781536,0.00033437173,0.0003555791,0.00074959244,0.0003251074,0.000409601,0.0025622023,0.0046193684,0.000010787156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008106357,0.00011433369,0.00037035585,0.00006526703,0.00022790885,0.000015113244,0.00031588215,0.0002831689,0.000037669983,0.99763656,0.00036279362,0.0004899114],"study_design_scores_gemma":[0.0011662504,0.0009660709,0.00046841096,0.00010295821,0.00006477275,0.00021756257,0.000058050304,0.0012026436,0.00034187568,0.99064744,0.004429709,0.00033427117],"about_ca_topic_score_codex":0.0000032728292,"about_ca_topic_score_gemma":0.000001050973,"teacher_disagreement_score":0.64004654,"about_ca_system_score_codex":0.00054516795,"about_ca_system_score_gemma":0.0015892895,"threshold_uncertainty_score":0.99991083},"labels":[],"label_agreement":null},{"id":"W2794722099","doi":"10.37236/8594","title":"On Essentially 4-Edge-Connected Cubic Bricks","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Mato Grosso do Sul; Universidade Estadual de Campinas; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Fundação de Amparo à Pesquisa do Estado de São Paulo; Universität Wien; Massey University","keywords":"Combinatorics; Bipartite graph; Mathematics; Cubic graph; Conjecture; Invariant (physics); Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01661771185908935,"score_gpt":0.2803089121190195,"score_spread":0.26369120025993015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794722099","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.039454132,0.005388606,0.9416559,0.00857524,0.0028720717,0.00048464484,0.0000024622873,0.00013644695,0.0014305145],"genre_scores_gemma":[0.99777186,0.0011771125,0.00018770825,0.0003161552,0.00025571298,0.000008830219,0.0000020195164,0.000051927054,0.00022866052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514675,0.00084073324,0.0008249806,0.0005148007,0.0015530715,0.0011196866],"domain_scores_gemma":[0.9951733,0.0010758819,0.0012160158,0.0014365352,0.0008370608,0.00026121514],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022797764,0.00045060387,0.0007433481,0.00040436248,0.00024718387,0.0003214696,0.0072763376,0.00024830966,0.000015470532],"category_scores_gemma":[0.0007715442,0.0003306718,0.0005039959,0.0012746903,0.0001478429,0.0002661161,0.0018513794,0.006398019,0.00004815698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012918012,0.00016845182,0.0000062274357,0.00003635415,0.00027370863,0.00009540613,0.0003192153,0.0010955404,0.00049206475,0.9949157,0.001060706,0.0014074459],"study_design_scores_gemma":[0.0008091451,0.0011072762,0.000046208366,0.00010630559,0.000055406737,0.00017582267,0.00001794428,0.0027204524,0.003586377,0.9895763,0.0014846142,0.00031416325],"about_ca_topic_score_codex":0.0000037988473,"about_ca_topic_score_gemma":0.0000018462408,"teacher_disagreement_score":0.95831776,"about_ca_system_score_codex":0.000740271,"about_ca_system_score_gemma":0.002665348,"threshold_uncertainty_score":0.9999145},"labels":[],"label_agreement":null},{"id":"W2798759115","doi":"10.37236/7799","title":"Vertically Constrained Motzkin-Like Paths Inspired by Bobbin Lace","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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; National Science Foundation","keywords":"Bijection; Combinatorics; Mathematics; Discrete mathematics","score_opus":0.017537944467560875,"score_gpt":0.28430572663771503,"score_spread":0.2667677821701542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798759115","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.4637587,0.021003548,0.47077653,0.005948518,0.024511337,0.0050413203,0.00010118165,0.0005629658,0.008295891],"genre_scores_gemma":[0.9959449,0.0013067329,0.000604969,0.00016370938,0.00028684922,0.000024466775,0.000008460677,0.00021356801,0.0014463265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99360895,0.00059052085,0.0021359746,0.00046959668,0.0017574261,0.0014375169],"domain_scores_gemma":[0.99138737,0.002510625,0.003041264,0.0016971574,0.0011002666,0.00026332022],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031159292,0.0008727213,0.0018456448,0.00021561846,0.0001887787,0.00016815974,0.0027931745,0.00073209545,0.000040521285],"category_scores_gemma":[0.0023184887,0.0006588082,0.0006936505,0.00045898842,0.00026310357,0.00019835113,0.0009082278,0.0053506596,0.00003735037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377304,0.0008409338,0.0000238585,0.00044512624,0.00070896343,0.000029458843,0.00059823407,0.00024876697,0.00037857296,0.98253226,0.013774715,0.00023532726],"study_design_scores_gemma":[0.002582885,0.0010103371,0.0000029889873,0.00044880866,0.0006372108,0.00020835809,0.00015963448,0.00091849087,0.0009307785,0.98631406,0.006142497,0.00064392714],"about_ca_topic_score_codex":0.000005742759,"about_ca_topic_score_gemma":0.0000023250238,"teacher_disagreement_score":0.5321862,"about_ca_system_score_codex":0.0017544655,"about_ca_system_score_gemma":0.002735896,"threshold_uncertainty_score":0.99958634},"labels":[],"label_agreement":null},{"id":"W2805347351","doi":"10.37236/7985","title":"Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Repetition (rhetorical device); Mathematics; Infimum and supremum; Word (group theory); Exponent; Physics; Geometry; Philosophy","score_opus":0.012828629700556458,"score_gpt":0.22911369206267942,"score_spread":0.21628506236212297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805347351","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.90117294,0.022429116,0.069391616,0.0018936808,0.004125349,0.0004806282,0.000011780771,0.00008238281,0.00041247928],"genre_scores_gemma":[0.99714684,0.0021661627,0.000057031626,0.00029055102,0.00020752993,0.0000045753045,0.0000054251695,0.00003663828,0.000085255815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969323,0.0003527666,0.00086307613,0.00038108838,0.00082316506,0.00064759067],"domain_scores_gemma":[0.99561155,0.00059060135,0.0018321816,0.0014933822,0.00038662885,0.000085636595],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002276358,0.00040387444,0.0007992514,0.000298695,0.00010744491,0.00014359051,0.0031017205,0.00033138,0.000008101072],"category_scores_gemma":[0.00014953825,0.0002832683,0.00048103757,0.0003591901,0.00010176229,0.00022947307,0.00068152556,0.0024513863,0.000010026588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004534432,0.00025414358,0.00007181694,0.00014074543,0.00028337684,0.00007887266,0.0002561543,0.0034854012,0.0004341924,0.9934029,0.00043677085,0.0011102651],"study_design_scores_gemma":[0.000890743,0.0016039681,0.00020198543,0.00054534024,0.00012206584,0.000958177,0.000057747504,0.0015110802,0.0068211057,0.98577994,0.0011667219,0.00034110463],"about_ca_topic_score_codex":0.000013609907,"about_ca_topic_score_gemma":0.0000028673592,"teacher_disagreement_score":0.095973864,"about_ca_system_score_codex":0.00052608416,"about_ca_system_score_gemma":0.0012747565,"threshold_uncertainty_score":0.999962},"labels":[],"label_agreement":null},{"id":"W2810042661","doi":"10.37236/8040","title":"$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Hamming graph; Corollary; Transitive closure; Partition (number theory); Alphabet; Affine transformation; Discrete mathematics; Hamming distance; Hamming code; Block code; Algorithm; Pure mathematics; Decoding methods","score_opus":0.015017993378834263,"score_gpt":0.21669026466686267,"score_spread":0.2016722712880284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810042661","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.17307399,0.0027461164,0.8205726,0.002107716,0.00047622548,0.00021823005,0.000005248524,0.00004502566,0.0007548292],"genre_scores_gemma":[0.9985619,0.00068819325,0.00050562544,0.00010539167,0.00009824081,0.000003936916,9.2751304e-7,0.000021335638,0.0000144434225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974104,0.0004896187,0.0005972463,0.0003103814,0.0006295542,0.000562781],"domain_scores_gemma":[0.99668485,0.0005453184,0.0012932332,0.00071640924,0.0006274885,0.00013272396],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001904138,0.00035195556,0.0007676881,0.00019680902,0.00013487316,0.000107380074,0.0028821293,0.00016952454,0.0000042661627],"category_scores_gemma":[0.000065576,0.00023148599,0.00044653984,0.00069050386,0.00020643733,0.00013770255,0.00056521175,0.0027390232,8.151417e-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.00024894808,0.00021978992,0.00012652879,0.00007378012,0.0006115952,0.00003829651,0.00155717,0.00030650134,0.0006363233,0.9939612,0.000044158773,0.0021757036],"study_design_scores_gemma":[0.0007859913,0.0020316385,0.00036803744,0.00022700457,0.00026112865,0.00021321607,0.00008466894,0.0007178666,0.009417141,0.98525524,0.0003472655,0.00029078338],"about_ca_topic_score_codex":0.000011361602,"about_ca_topic_score_gemma":0.000009161955,"teacher_disagreement_score":0.8254879,"about_ca_system_score_codex":0.00016824444,"about_ca_system_score_gemma":0.0015580184,"threshold_uncertainty_score":0.9995617},"labels":[],"label_agreement":null},{"id":"W2810611251","doi":"10.37236/6149","title":"Binary Covering Arrays on Tournaments","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"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 Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Alphabet; Tournament; Partition (number theory); Graph; Arc (geometry); Transitive relation; Discrete mathematics; Geometry","score_opus":0.00865639612589671,"score_gpt":0.2467909626199264,"score_spread":0.23813456649402967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810611251","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.9930302,0.00082966365,0.0032830976,0.0003234095,0.0005026888,0.000046537814,3.2211972e-7,0.000004163476,0.0019799154],"genre_scores_gemma":[0.99843985,0.00030899548,0.000011825394,0.0003720253,0.00062384177,4.458996e-7,0.0000010753998,0.000009379214,0.00023254273],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990851,0.0000831564,0.00021469349,0.00009983911,0.00017115733,0.0003460383],"domain_scores_gemma":[0.9994025,0.000027405276,0.00021319157,0.00016725385,0.00014082917,0.000048776354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059144147,0.00010434784,0.00012228312,0.000028702363,0.00014166873,0.000020445113,0.00038946304,0.00006830439,0.000008164457],"category_scores_gemma":[0.00009434306,0.00006174917,0.00009864741,0.00010920353,0.000069914684,0.0000031943143,0.000080708334,0.00030286814,0.000008855565],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014419063,0.0006738393,0.0035645324,0.000013483477,0.0005018857,0.000028660188,0.00015915658,0.00035245944,0.85986394,0.11642038,0.009069267,0.007910493],"study_design_scores_gemma":[0.003628761,0.041565843,0.004358417,0.00012439975,0.00011230208,0.0006235216,0.00023639982,0.00029970572,0.53430367,0.17965806,0.23440605,0.00068287377],"about_ca_topic_score_codex":7.6447486e-7,"about_ca_topic_score_gemma":5.8799463e-7,"teacher_disagreement_score":0.32556027,"about_ca_system_score_codex":0.000060869017,"about_ca_system_score_gemma":0.00011229043,"threshold_uncertainty_score":0.2518058},"labels":[],"label_agreement":null},{"id":"W2810681272","doi":"10.37236/7969","title":"Decomposable Twofold Triple Systems with Non-Hamiltonian 2-Block Intersection Graphs","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Western Canada Research Grid; Compute Canada","keywords":"Bipartite graph; Combinatorics; Mathematics; Conjecture; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.006071709927877415,"score_gpt":0.19170719501893446,"score_spread":0.18563548509105704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810681272","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.9372506,0.015749259,0.029842576,0.00023590752,0.012218783,0.001001263,0.000010091881,0.0002596218,0.0034318855],"genre_scores_gemma":[0.9984025,0.0010103915,0.000005572911,0.000016173446,0.00029958703,0.00002634537,0.000004558809,0.000105200794,0.00012969734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974192,0.00024262222,0.0008599597,0.00022536707,0.00054198416,0.00071090256],"domain_scores_gemma":[0.99830735,0.000103032755,0.00064769597,0.0005239408,0.00024850696,0.00016945039],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012191064,0.00048053727,0.00086578104,0.000279876,0.00014674924,0.00017735161,0.0010433961,0.0002705032,0.000003950238],"category_scores_gemma":[0.000017109056,0.00033795668,0.00035832217,0.000593251,0.000057692716,0.00013482093,0.00011046338,0.0031776433,0.000010581347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087387906,0.00030177855,0.00068714056,0.0022277888,0.005056054,0.00016202922,0.0036947138,0.3609552,0.0024149122,0.6152267,0.008219228,0.00018058783],"study_design_scores_gemma":[0.00503077,0.0036767838,0.00028602767,0.002461462,0.0014634051,0.0032281042,0.002466226,0.047255483,0.0036672165,0.9124409,0.01620052,0.0018231298],"about_ca_topic_score_codex":0.000029922334,"about_ca_topic_score_gemma":0.000016111453,"teacher_disagreement_score":0.31369975,"about_ca_system_score_codex":0.0006964644,"about_ca_system_score_gemma":0.00036543186,"threshold_uncertainty_score":0.99990726},"labels":[],"label_agreement":null},{"id":"W2846791473","doi":"10.37236/8033","title":"Axioms for Shifted Tableau Crystals","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Axiom; Characterization (materials science); Axiomatic system; Mathematics; Function (biology); Pure mathematics; Algebra over a field; Physics; Geometry","score_opus":0.03100247335834345,"score_gpt":0.306622779798564,"score_spread":0.27562030644022056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2846791473","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.741748,0.019214317,0.21052088,0.0026012147,0.020515526,0.0037236786,0.00002882517,0.00012863494,0.0015189355],"genre_scores_gemma":[0.9971136,0.0007062469,0.00008729057,0.00007500148,0.0008576106,0.000038375267,0.0000061084907,0.00013171752,0.0009840414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621034,0.0001885466,0.0012742259,0.00033012574,0.0009431052,0.0010536476],"domain_scores_gemma":[0.9943967,0.0011383814,0.0023459957,0.0010568886,0.0009366919,0.00012538415],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024384765,0.00055615616,0.0012915232,0.00019523619,0.00019363147,0.0001574391,0.0020545719,0.0005704594,0.000030345358],"category_scores_gemma":[0.00046593655,0.00037658223,0.00085155317,0.0002725176,0.0000805587,0.0001147551,0.0005012229,0.0027529418,0.0000035299695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039350113,0.00013579025,0.000008474434,0.00028051046,0.00066718645,0.0000026657528,0.0003906845,0.0002737486,0.000022180697,0.9952451,0.0024756966,0.00010447147],"study_design_scores_gemma":[0.0027608303,0.0007464274,0.000008415341,0.00018690173,0.00060843996,0.00007526839,0.00013959162,0.00033770275,0.00049634604,0.990205,0.0040313425,0.00040372406],"about_ca_topic_score_codex":0.0000117873215,"about_ca_topic_score_gemma":0.0000024318804,"teacher_disagreement_score":0.2553656,"about_ca_system_score_codex":0.0008812589,"about_ca_system_score_gemma":0.00209873,"threshold_uncertainty_score":0.99986863},"labels":[],"label_agreement":null},{"id":"W2884590416","doi":"10.37236/8024","title":"Exact Solution of Some Quarter Plane Walks with Interacting Boundaries","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Context (archaeology); Boundary (topology); Plane (geometry); Generating function; Mathematics; Function (biology); Set (abstract data type); Quarter (Canadian coin); Algebraic number; Kernel (algebra); Geometry; Statistical physics; Combinatorics; Mathematical analysis; Computer science; Statistics; Physics; Geography","score_opus":0.01809380028792302,"score_gpt":0.2864883722384019,"score_spread":0.2683945719504789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884590416","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.8183835,0.0052946247,0.16400667,0.0009940749,0.008828871,0.0013760681,0.000013644016,0.000097191856,0.001005321],"genre_scores_gemma":[0.99841446,0.00033728455,0.0005971396,0.000015308071,0.00032521997,0.000009220216,0.0000039957663,0.00010481616,0.00019255438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959484,0.00030460925,0.0015192899,0.00025734678,0.0011789554,0.00079144974],"domain_scores_gemma":[0.99128234,0.0019683337,0.0047933655,0.0010125369,0.0008592836,0.00008413578],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021402645,0.000534198,0.0013955397,0.0002523559,0.00019439866,0.0001640411,0.0012846449,0.00032890972,0.0000145177555],"category_scores_gemma":[0.0008709615,0.000353445,0.0003426438,0.00023615485,0.00023724743,0.0003657185,0.00040388928,0.0036647539,0.000005936062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043303304,0.0004262368,0.00005486424,0.00095889025,0.0007641757,0.000012402802,0.0027702958,0.00024314297,0.00021782976,0.9930503,0.00095127086,0.00011760273],"study_design_scores_gemma":[0.0013678428,0.0014970525,0.000011007396,0.0012623406,0.0004887886,0.00029635525,0.0005716302,0.0003646495,0.0020602671,0.9908019,0.00091628503,0.000361884],"about_ca_topic_score_codex":0.000010975012,"about_ca_topic_score_gemma":0.0000066580465,"teacher_disagreement_score":0.18003093,"about_ca_system_score_codex":0.0010683839,"about_ca_system_score_gemma":0.002152562,"threshold_uncertainty_score":0.99989176},"labels":[],"label_agreement":null},{"id":"W2885679157","doi":"10.37236/8211","title":"Classes of Graphs with $e$-Positive Chromatic Symmetric Function","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"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; Wilfrid Laurier University","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Combinatorics; Mathematics; Conjecture; Interval graph; Chromatic scale; Discrete mathematics; Graph; Comparability graph; Pathwidth; Cograph; Indifference graph; Complement (music); Line graph","score_opus":0.009679500078962637,"score_gpt":0.2523303625708365,"score_spread":0.24265086249187387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885679157","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.17085552,0.01217931,0.8137792,0.00041703723,0.0010904773,0.0006033548,0.0000023366258,0.000034433288,0.0010383363],"genre_scores_gemma":[0.99792224,0.0015942366,0.0002455782,0.000029044688,0.000040090294,0.000007468554,0.0000013278027,0.000030624215,0.00012940138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963493,0.00057249767,0.00068955985,0.00030396975,0.001382911,0.000701764],"domain_scores_gemma":[0.9947955,0.0009932921,0.0017785497,0.0011066004,0.0012322187,0.00009381123],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023221537,0.00032385366,0.0007214006,0.00095254526,0.00011490909,0.0001052993,0.0030137969,0.0001702228,0.000003286659],"category_scores_gemma":[0.00015178142,0.00020366855,0.00029734906,0.0022879404,0.00018127328,0.0003928803,0.00068126596,0.0027212366,0.0000055567775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018061014,0.00018478718,0.00023016849,0.00013240814,0.00052394444,0.000009583267,0.00019129337,0.0024313696,0.00013420271,0.9947063,0.00006139841,0.0012139367],"study_design_scores_gemma":[0.0008413183,0.0034136586,0.0011409114,0.00031484404,0.00014984093,0.00019384583,0.00006273441,0.0019599719,0.0018899958,0.98973465,0.00007845864,0.00021975198],"about_ca_topic_score_codex":0.00000599708,"about_ca_topic_score_gemma":0.0000018101922,"teacher_disagreement_score":0.8270667,"about_ca_system_score_codex":0.00054470636,"about_ca_system_score_gemma":0.0020588173,"threshold_uncertainty_score":0.99957955},"labels":[],"label_agreement":null},{"id":"W2887076282","doi":"10.37236/7387","title":"An Orthosymplectic Pieri Rule","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"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 Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Symmetric function; Schur polynomial; Character (mathematics); Symplectic geometry; Product (mathematics); Partition (number theory); Pure mathematics; Macdonald polynomials; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.021484748313457678,"score_gpt":0.33358339597049297,"score_spread":0.31209864765703527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887076282","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.86692864,0.0006846949,0.1266854,0.00044512114,0.0023556561,0.0003169139,9.23698e-7,0.00010711084,0.002475531],"genre_scores_gemma":[0.9979542,0.00009120003,0.0008328726,0.000066818735,0.00070828275,0.000004750846,3.1551534e-7,0.000072524526,0.00026904448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972174,0.00027044362,0.00080080243,0.00016450125,0.0007370251,0.00080982974],"domain_scores_gemma":[0.99648863,0.00071695965,0.00095287495,0.0007887536,0.0008941728,0.00015859763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021828762,0.00026579888,0.00049761,0.00013917343,0.00032641328,0.00006797804,0.0012069636,0.00011205784,0.00005643584],"category_scores_gemma":[0.0010672626,0.00018220296,0.00017175876,0.00067205715,0.00019964465,0.00037490253,0.00007682649,0.0008930049,0.000029360155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006808272,0.00037814397,0.00007564184,0.000019487054,0.00009778898,0.0000068134127,0.00059825514,0.0000028780023,0.0005679271,0.9971103,0.0006147079,0.00045997967],"study_design_scores_gemma":[0.0009343321,0.002242313,0.00003437589,0.000036660178,0.00014562912,0.00039060495,0.00020085754,0.0001490244,0.004362175,0.98787993,0.0034157953,0.00020832832],"about_ca_topic_score_codex":0.000002598963,"about_ca_topic_score_gemma":0.000008681159,"teacher_disagreement_score":0.13102554,"about_ca_system_score_codex":0.00047532373,"about_ca_system_score_gemma":0.0004866446,"threshold_uncertainty_score":0.7430021},"labels":[],"label_agreement":null},{"id":"W2890118465","doi":"10.37236/10479","title":"Some Remarks on Combinatorial Wall-Crossing","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","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":"Perimeter Institute","funders":"National Science Foundation","keywords":"Simple (philosophy); Representation (politics); Mathematics; Algebra over a field; Combinatorics; Computer science; Pure mathematics; Law","score_opus":0.023423320161291176,"score_gpt":0.29950855947351346,"score_spread":0.2760852393122223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890118465","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.92961705,0.013031543,0.0010205839,0.0032812634,0.049646754,0.0012730961,0.000012545579,0.000164816,0.00195237],"genre_scores_gemma":[0.99539465,0.0010675399,0.000024350411,0.00026056278,0.0025219794,0.000030322117,0.0000068929876,0.000178505,0.00051521126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930975,0.00091036473,0.0016981728,0.0005212085,0.002431024,0.0013417214],"domain_scores_gemma":[0.9931494,0.0015724254,0.0030209539,0.0015337768,0.0005129666,0.00021047537],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0038847663,0.0008154416,0.0014983816,0.00033980267,0.0010559978,0.0004375486,0.0031854634,0.00057540456,0.00013364805],"category_scores_gemma":[0.0008489121,0.00059877074,0.0010223743,0.0004431012,0.00024172728,0.0001848761,0.0013299199,0.009106937,0.000004515551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004763416,0.00043275615,0.000018042188,0.000105572435,0.00061361305,0.000041251933,0.0007219158,0.00039858193,0.000011601554,0.9930367,0.0039948924,0.00014872226],"study_design_scores_gemma":[0.0024004353,0.0014287465,0.000022337332,0.00018910402,0.00046501623,0.00012957891,0.00015969966,0.00009414787,0.00020464469,0.98538435,0.008941058,0.00058085856],"about_ca_topic_score_codex":0.000025871388,"about_ca_topic_score_gemma":0.0000016305094,"teacher_disagreement_score":0.06577761,"about_ca_system_score_codex":0.0028076402,"about_ca_system_score_gemma":0.003393197,"threshold_uncertainty_score":0.99964637},"labels":[],"label_agreement":null},{"id":"W2893324291","doi":"10.37236/8193","title":"Non-Monochromatic Triangles in a 2-Edge-Coloured Graph","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Monochromatic color; Partition (number theory); Graph; Simple graph; Graph factorization; Generalization; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.018228233782680427,"score_gpt":0.28590507024476786,"score_spread":0.26767683646208745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893324291","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.9829554,0.007935928,0.00281336,0.00048587684,0.0033751272,0.0008960481,0.0000039016736,0.000026156327,0.0015081802],"genre_scores_gemma":[0.9976069,0.0016164614,0.00008895083,0.00006263116,0.00021045173,0.0000151638615,0.0000016637612,0.00007715774,0.00032065378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962516,0.00048818093,0.001396196,0.0002636132,0.0007443486,0.00085605256],"domain_scores_gemma":[0.99535733,0.001271041,0.0019636666,0.0010219262,0.0002969263,0.00008909788],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0040145605,0.0004908183,0.0013189971,0.00055806874,0.0001541288,0.00008055312,0.002010804,0.00049605157,0.000024093897],"category_scores_gemma":[0.0006088229,0.0003165046,0.0006803791,0.00051449606,0.00013486283,0.00009213731,0.0005845749,0.004188079,0.000004041395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024014588,0.00030303682,0.00032670336,0.0004379618,0.00060502806,0.00003595223,0.0029956293,0.00039911666,0.000029763856,0.992493,0.0019007719,0.0002329034],"study_design_scores_gemma":[0.002011919,0.00047950374,0.0004773591,0.00047719767,0.0003240176,0.00015525444,0.0002653609,0.00028328874,0.00018465682,0.9947616,0.00024736815,0.00033249735],"about_ca_topic_score_codex":0.0000074746326,"about_ca_topic_score_gemma":0.0000133726835,"teacher_disagreement_score":0.014651444,"about_ca_system_score_codex":0.00067689025,"about_ca_system_score_gemma":0.0011473052,"threshold_uncertainty_score":0.9999287},"labels":[],"label_agreement":null},{"id":"W2896217906","doi":"10.37236/8261","title":"Bijections between Łukasiewicz Walks and Generalized Tandem Walks","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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 Waterloo","funders":"","keywords":"Bijection, injection and surjection; Tandem; Mathematics; Combinatorics; Bijection; Engineering","score_opus":0.04996640571233362,"score_gpt":0.30450358644291436,"score_spread":0.25453718073058074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896217906","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.8552132,0.0056979307,0.12727071,0.008729466,0.0011133022,0.00065130845,0.00000451383,0.00016443757,0.0011551183],"genre_scores_gemma":[0.9977068,0.0007944348,0.00061457965,0.0001533361,0.00053429656,0.0000054830316,6.348048e-7,0.00006568862,0.00012477847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973782,0.00027316494,0.0009105155,0.00018297443,0.00062669226,0.0006284578],"domain_scores_gemma":[0.99684775,0.0013301634,0.0008911242,0.0003342214,0.00035478658,0.00024196108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012549736,0.00029119637,0.0007746377,0.00009359167,0.0002791739,0.00006625021,0.0006422468,0.00014015693,0.000017009803],"category_scores_gemma":[0.0014766903,0.00020712132,0.00021085133,0.00063341705,0.00010649607,0.0002174085,0.00014664835,0.0012664379,0.00000680256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003301851,0.00008946511,0.00022590853,0.000050632447,0.00025907444,0.000006698263,0.0011314742,0.000008940941,0.0003884638,0.99573666,0.0014832336,0.0005864137],"study_design_scores_gemma":[0.0016846209,0.0007514637,0.00006213857,0.000037847134,0.00038143434,0.00013495954,0.00025976653,0.00015261903,0.0011092068,0.98880553,0.0063986955,0.00022174064],"about_ca_topic_score_codex":0.0000021009878,"about_ca_topic_score_gemma":0.0000014898188,"teacher_disagreement_score":0.14249355,"about_ca_system_score_codex":0.0002964664,"about_ca_system_score_gemma":0.00031937793,"threshold_uncertainty_score":0.8446163},"labels":[],"label_agreement":null},{"id":"W2897168502","doi":"10.37236/8240","title":"Chromatic Polynomials of Oriented Graphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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 Saskatchewan; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Discrete mathematics; Chromatic scale; Foster graph; Graph; Friendship graph; Windmill graph; Line graph; Voltage graph","score_opus":0.012053478142036595,"score_gpt":0.2763215363540942,"score_spread":0.26426805821205757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897168502","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.37238437,0.016608495,0.6051625,0.0011019452,0.003167747,0.0007572725,0.000004433823,0.00004842046,0.000764836],"genre_scores_gemma":[0.99756795,0.0017775315,0.00030045406,0.00003375907,0.000056358003,0.000005633124,0.0000010153335,0.0000307196,0.00022656213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578834,0.00068576593,0.0010899812,0.00029571605,0.0012837428,0.00085643335],"domain_scores_gemma":[0.9944296,0.00078050554,0.0021245233,0.0016717757,0.00087608345,0.00011750689],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0039755623,0.00032625685,0.00090410333,0.0005729828,0.00009961267,0.00007747911,0.0053243935,0.00020394297,0.0000083609775],"category_scores_gemma":[0.00032913196,0.00022670253,0.00050469424,0.0010893572,0.0001916826,0.00027972128,0.0014635818,0.002749605,0.000010344141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005571045,0.00015380348,0.00010872083,0.000117011994,0.00029256567,0.000007858403,0.0003603549,0.0010637278,0.00060259196,0.9964957,0.00018819577,0.0005537437],"study_design_scores_gemma":[0.0007482447,0.00077787996,0.00013689463,0.00019569063,0.000059322432,0.000120214,0.00003991487,0.001248048,0.005072957,0.9909055,0.00049156847,0.00020371366],"about_ca_topic_score_codex":0.00000656683,"about_ca_topic_score_gemma":9.993167e-7,"teacher_disagreement_score":0.6251836,"about_ca_system_score_codex":0.00049106916,"about_ca_system_score_gemma":0.0023913123,"threshold_uncertainty_score":0.9995511},"labels":[],"label_agreement":null},{"id":"W2902948030","doi":"10.37236/8363","title":"Nearly-Regular Hypergraphs and Saturation of Berge Stars","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"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":"Hypergraph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Saturation (graph theory)","score_opus":0.012966714581636384,"score_gpt":0.2614189277328903,"score_spread":0.24845221315125393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902948030","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.98100793,0.0144599555,0.0020311894,0.00026545694,0.0014694721,0.00030521472,0.0000061816513,0.000011506686,0.00044307995],"genre_scores_gemma":[0.99577856,0.0037396667,0.00010979597,0.0000249887,0.000111036505,0.0000017631261,0.000001850546,0.00004019564,0.00019214461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774367,0.00029693395,0.0007903388,0.0001679592,0.0006117097,0.00038937447],"domain_scores_gemma":[0.9967944,0.0005381137,0.0015484683,0.00062871777,0.00043139284,0.000058898215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018838001,0.00028646793,0.0007206979,0.00020111953,0.00013212,0.00004161196,0.0007338577,0.00029819677,0.000009575238],"category_scores_gemma":[0.00024933953,0.0001836003,0.00032399336,0.00018548779,0.00016456416,0.00009056534,0.00037379735,0.0019000352,3.1503123e-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.000105348976,0.00006279523,0.00026195438,0.00022381806,0.00046001907,0.0000022246586,0.0009766403,0.00007098696,0.0002283315,0.99680275,0.00045161287,0.00035349347],"study_design_scores_gemma":[0.0006023871,0.00040145326,0.00044039538,0.00015054904,0.0003770646,0.00009483474,0.0001496356,0.00008891169,0.0010773424,0.9959126,0.0005243599,0.00018043006],"about_ca_topic_score_codex":0.000005987682,"about_ca_topic_score_gemma":0.0000028127163,"teacher_disagreement_score":0.014770616,"about_ca_system_score_codex":0.0001503251,"about_ca_system_score_gemma":0.0004347131,"threshold_uncertainty_score":0.8254813},"labels":[],"label_agreement":null},{"id":"W2911019483","doi":"10.37236/8930","title":"Schur and $e$-Positivity of Trees and Cut Vertices","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"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; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Symmetric function; Graph; Chromatic scale; Discrete mathematics","score_opus":0.03273519531832711,"score_gpt":0.30732792695610245,"score_spread":0.2745927316377753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911019483","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.9684066,0.012081789,0.016077021,0.001559904,0.0008658331,0.0004887346,0.0000072287794,0.00003779982,0.00047506197],"genre_scores_gemma":[0.9959715,0.0032988072,0.00047791927,0.000020397361,0.00013256635,0.0000048282277,5.260001e-7,0.00005522407,0.000038257833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742705,0.00028985186,0.0009634545,0.00022867258,0.0006549588,0.00043601697],"domain_scores_gemma":[0.99535763,0.001679858,0.0019462632,0.00047547606,0.00040288898,0.00013787945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013931146,0.0003759908,0.0011293271,0.00012070696,0.00010495242,0.000064296946,0.0007038975,0.00023294066,0.000002352636],"category_scores_gemma":[0.0014436274,0.00027319178,0.00018099048,0.00021170484,0.00022361471,0.00015152297,0.00074216764,0.00202556,4.96546e-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.00011931616,0.00020306921,0.00013068915,0.0006825941,0.0003974253,0.00001048071,0.0010905921,0.000010891381,0.00051329826,0.9963402,0.00017837177,0.00032305473],"study_design_scores_gemma":[0.000967128,0.00072578504,0.00013097396,0.00038641365,0.000620737,0.00013900347,0.00021187217,0.00024834814,0.0029197836,0.9932723,0.00014395802,0.00023370484],"about_ca_topic_score_codex":0.000004541238,"about_ca_topic_score_gemma":0.000010206814,"teacher_disagreement_score":0.027564846,"about_ca_system_score_codex":0.00021034479,"about_ca_system_score_gemma":0.00052344863,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W2917246580","doi":"10.37236/8451","title":"Concatenating Bipartite Graphs","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Waterloo","funders":"Army Research Office; Office of Naval Research; Air Force Office of Scientific Research; Leverhulme Trust; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Disjoint sets; Neighbourhood (mathematics); Graph; Integer (computer science); Discrete mathematics","score_opus":0.018320853673882705,"score_gpt":0.27191957654834714,"score_spread":0.25359872287446444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917246580","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.99155194,0.0031852962,0.0010433965,0.0006659011,0.0012376073,0.0001253328,0.0000016822802,0.000025343134,0.0021634772],"genre_scores_gemma":[0.9992436,0.00014663882,0.00002442325,0.00015623345,0.0000682107,0.0000050058306,2.7874754e-7,0.000023944238,0.0003316652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980516,0.00036471235,0.00045956156,0.00008090742,0.00059029646,0.00045296169],"domain_scores_gemma":[0.99830383,0.00062293315,0.0006115766,0.00026509882,0.00014760844,0.00004895446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027616106,0.00012390819,0.0002490953,0.00012787906,0.00085375085,0.00002142264,0.00077670236,0.000027818338,0.00009581106],"category_scores_gemma":[0.00025045255,0.00007944751,0.00020229397,0.000474917,0.00007606305,0.0000742021,0.00021575796,0.001220732,6.573515e-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.00004351286,0.000063868654,0.00018622537,0.00000720846,0.000117894444,0.000009191811,0.0009538458,0.00004554093,0.00010706316,0.9968598,0.0013521628,0.00025368313],"study_design_scores_gemma":[0.0005779332,0.00046411567,0.000046428788,0.0000051703337,0.000077884055,0.0004536179,0.0006012507,0.000040522737,0.0003632845,0.98730135,0.009969884,0.00009857814],"about_ca_topic_score_codex":0.0000015549848,"about_ca_topic_score_gemma":6.2145386e-7,"teacher_disagreement_score":0.009558472,"about_ca_system_score_codex":0.0002295803,"about_ca_system_score_gemma":0.00019728534,"threshold_uncertainty_score":0.65664476},"labels":[],"label_agreement":null},{"id":"W2921552912","doi":"10.37236/8504","title":"On the Weight of Berge-$F$-Free Hypergraphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":"Toronto Metropolitan University","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia; University of Montana","keywords":"Hypergraph; Combinatorics; Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.01596647273150778,"score_gpt":0.2570298645835043,"score_spread":0.24106339185199652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921552912","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.9643607,0.0110638505,0.0019454453,0.0031766242,0.0063716364,0.0007642753,0.000020412997,0.00002945057,0.012267586],"genre_scores_gemma":[0.9963807,0.0025332212,0.000031487776,0.00014338286,0.00024155166,0.000005294688,8.8195435e-7,0.00006554741,0.00059792784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996494,0.00058261893,0.0010158519,0.00020283254,0.0011038758,0.0006008415],"domain_scores_gemma":[0.99207777,0.003149539,0.0021349215,0.0020849598,0.00049169286,0.00006113236],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003446749,0.0004177443,0.0008841685,0.00022555854,0.00023149383,0.0000364179,0.003727556,0.00033712643,0.00006870214],"category_scores_gemma":[0.0011406858,0.0001992629,0.0008240664,0.0003093427,0.0002375691,0.000045010023,0.0009213836,0.0039324267,0.0000026940922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014382208,0.00015304278,0.00005541547,0.00011680913,0.0007555504,0.0000033765693,0.00061321043,0.00009796115,0.000026935657,0.986751,0.011195648,0.00008723668],"study_design_scores_gemma":[0.00069095416,0.0005445582,0.0000525461,0.00023547979,0.000403188,0.00007062029,0.00009334638,0.00004212098,0.0010702722,0.99467385,0.0019103718,0.00021271915],"about_ca_topic_score_codex":0.0000039545566,"about_ca_topic_score_gemma":0.0000020777345,"teacher_disagreement_score":0.032019988,"about_ca_system_score_codex":0.00023752116,"about_ca_system_score_gemma":0.00062166643,"threshold_uncertainty_score":0.9983655},"labels":[],"label_agreement":null},{"id":"W2922085044","doi":"10.37236/8895","title":"Maximum $k$-Sum $\\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; Hankuk University of Foreign Studies; National Research Foundation; University of Warwick","keywords":"Combinatorics; Integer (computer science); Lattice (music); Homogeneous; Integer lattice; Mathematics; Physics; Half-integer; Condensed matter physics","score_opus":0.02516353995218488,"score_gpt":0.2799450805489465,"score_spread":0.2547815405967616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922085044","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.9572116,0.010913518,0.004184653,0.013154614,0.009328985,0.0010319683,0.00005720978,0.00006597465,0.004051485],"genre_scores_gemma":[0.9985154,0.00040563385,0.0002121551,0.0003073851,0.00026143144,0.000004245388,0.0000013690652,0.00007468204,0.00021768846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586457,0.00065822515,0.001246508,0.0002553422,0.001346311,0.00062902545],"domain_scores_gemma":[0.9939373,0.001327363,0.002392085,0.0015740108,0.00065678044,0.00011246109],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024518794,0.00046394186,0.00096648384,0.00012356204,0.0002902289,0.00004333549,0.0038403233,0.00036898511,0.000045284934],"category_scores_gemma":[0.00169407,0.00024387315,0.00087716844,0.0003698341,0.0003243561,0.00006886686,0.0027591959,0.0048614964,0.0000020366897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001536436,0.00013744431,0.00006637933,0.00023332874,0.0007281313,0.000008062968,0.0011603615,0.000091524686,0.000070742935,0.9893428,0.007863999,0.00014357004],"study_design_scores_gemma":[0.0008350487,0.0002447746,0.00015789983,0.00029295316,0.0006354206,0.00024920073,0.0001198677,0.00015635705,0.0011968213,0.99430686,0.0015588207,0.00024597187],"about_ca_topic_score_codex":0.0000057744533,"about_ca_topic_score_gemma":0.0000038495223,"teacher_disagreement_score":0.041303817,"about_ca_system_score_codex":0.00035119627,"about_ca_system_score_gemma":0.0011239424,"threshold_uncertainty_score":0.9974343},"labels":[],"label_agreement":null},{"id":"W2922137268","doi":"10.37236/8584","title":"On Density-Critical Matroids","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","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; Marsden Fund; National Science Foundation","keywords":"Matroid; Graphic matroid; Matroid partitioning; Rank (graph theory); Simple (philosophy)","score_opus":0.01426340436832554,"score_gpt":0.2810035618421438,"score_spread":0.2667401574738183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922137268","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.057666358,0.0012328116,0.9120791,0.02780209,0.00035645912,0.00008465869,2.0490326e-7,0.000043176937,0.00073514035],"genre_scores_gemma":[0.99853945,0.000120812554,0.00018687517,0.001008942,0.00008999044,8.2263216e-7,5.099124e-8,0.000011378127,0.000041688694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980005,0.00027690965,0.0002727783,0.00014538808,0.0007130281,0.00059141684],"domain_scores_gemma":[0.99820536,0.0008534782,0.00012510321,0.00034681082,0.00027896816,0.0001902848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010759083,0.00011820575,0.00020789522,0.00008020733,0.0001614829,0.0000832357,0.0019211941,0.000039308947,0.000007375142],"category_scores_gemma":[0.00079233805,0.00007909353,0.00012787916,0.0007178874,0.000104295956,0.0002888535,0.00019232025,0.0012817855,0.000045980454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000696718,0.000054253433,0.000018748353,0.0000045263896,0.000022870143,0.000038675837,0.0001733135,0.00007299973,0.00039477323,0.99787736,0.00056474446,0.00070807943],"study_design_scores_gemma":[0.00040391026,0.0016824164,0.000035183508,0.000008766354,0.000008683876,0.00017825939,0.00002510884,0.0017121837,0.0030124686,0.99140626,0.00144152,0.00008521145],"about_ca_topic_score_codex":2.7506127e-7,"about_ca_topic_score_gemma":1.4065485e-7,"teacher_disagreement_score":0.9408731,"about_ca_system_score_codex":0.00016014601,"about_ca_system_score_gemma":0.00033004128,"threshold_uncertainty_score":0.55687916},"labels":[],"label_agreement":null},{"id":"W2948412854","doi":"10.37236/5967","title":"Two Partial Orders for Standard Young Tableaux","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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; Simons Foundation","keywords":"Linear subspace; Mathematical proof; Mathematics; Young tableau; Invariant (physics); Equivalence (formal languages); Combinatorics; Cover (algebra); Order (exchange); Nilpotent; Equivalence relation; Algebra over a field; Pure mathematics; Geometry","score_opus":0.028513253288387008,"score_gpt":0.3372570586970619,"score_spread":0.3087438054086749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948412854","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.08018803,0.0056723207,0.8914165,0.0012658392,0.016644228,0.0030699596,0.000044723387,0.00013552383,0.0015629012],"genre_scores_gemma":[0.9952597,0.00069706456,0.002196517,0.000040817045,0.0008795836,0.00006401689,0.000005666804,0.00021700255,0.00063964527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949965,0.00029449826,0.0016826569,0.00036655986,0.0013412992,0.0013184698],"domain_scores_gemma":[0.9914867,0.0022164995,0.0032778915,0.0012930807,0.001577463,0.00014834586],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004072266,0.00066426804,0.0016362462,0.00021040259,0.00023868227,0.00016492377,0.0020631799,0.00038894883,0.000019801879],"category_scores_gemma":[0.0023476004,0.0004915598,0.00075602677,0.00033335155,0.00012170567,0.00018856386,0.0005820062,0.0033118827,0.000007883098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043221013,0.00023080083,0.000027484512,0.00049555796,0.0006032498,0.000005487993,0.0004773683,0.0012942969,0.00003254233,0.9925345,0.0037125705,0.00015388323],"study_design_scores_gemma":[0.0037692327,0.0011362735,7.260603e-7,0.0003339639,0.00081528793,0.00012008295,0.00026733606,0.0011784929,0.0013266582,0.9822054,0.008345017,0.00050152495],"about_ca_topic_score_codex":0.000006323306,"about_ca_topic_score_gemma":0.000006876208,"teacher_disagreement_score":0.91507167,"about_ca_system_score_codex":0.0018324163,"about_ca_system_score_gemma":0.0031232473,"threshold_uncertainty_score":0.9997536},"labels":[],"label_agreement":null},{"id":"W2948592123","doi":"10.37236/8935","title":"A Combinatorial Model for the Decomposition of Multivariate Polynomial Rings as $S_n$-Modules","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Partition (number theory); Multiset; Lambda; Invariant (physics); Multiplicity (mathematics); Combinatorics; Polynomial ring; Ring (chemistry); Polynomial; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.04223306576836299,"score_gpt":0.35127415955056895,"score_spread":0.30904109378220596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948592123","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.10644621,0.0026466749,0.87479293,0.0040129772,0.008599698,0.003052111,0.000046159686,0.00010826216,0.00029495088],"genre_scores_gemma":[0.99568486,0.0005145379,0.0024169004,0.00006175551,0.000956865,0.000092900525,0.0000059249087,0.00018242579,0.00008381493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948344,0.0003493424,0.0021694226,0.00040859546,0.0013082365,0.00092996313],"domain_scores_gemma":[0.9879994,0.0045738067,0.0047212476,0.0011411544,0.0013898932,0.00017451958],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0029320382,0.0007270649,0.00167926,0.00018002979,0.0003763189,0.00011862219,0.0028730656,0.0005093844,0.0000048559477],"category_scores_gemma":[0.0030638902,0.00048207983,0.0010646554,0.00035641805,0.00023933093,0.00018983426,0.0009109841,0.0032238897,0.0000026485168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001020881,0.00055568,0.0000018193635,0.0004988657,0.0009487674,0.000003697213,0.0019519845,0.0042742467,0.0008787779,0.98867697,0.0010225379,0.00016577689],"study_design_scores_gemma":[0.0036912847,0.0009537518,0.000002916496,0.00031606367,0.0012846412,0.00006349503,0.00015281548,0.0779532,0.004018111,0.91073644,0.00041894367,0.00040831318],"about_ca_topic_score_codex":0.000017344371,"about_ca_topic_score_gemma":0.000003430762,"teacher_disagreement_score":0.88923866,"about_ca_system_score_codex":0.0009864679,"about_ca_system_score_gemma":0.0018840678,"threshold_uncertainty_score":0.9997631},"labels":[],"label_agreement":null},{"id":"W2950318982","doi":"10.37236/1020","title":"On Directed Triangles in Digraphs","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"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 Waterloo","funders":"Purdue University; American Institute of Mathematics; National Science Foundation","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Vertex (graph theory); Directed graph; Discrete mathematics; Graph","score_opus":0.013332598025477487,"score_gpt":0.2875840749563781,"score_spread":0.27425147693090063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950318982","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.9923702,0.0015326588,0.0012984624,0.00018211176,0.0005875789,0.00011782229,3.1085372e-7,0.000023639732,0.0038872492],"genre_scores_gemma":[0.99939704,0.00025059225,0.000025447614,0.00007369031,0.00007877083,6.772296e-7,1.3738489e-7,0.000019848387,0.0001537775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982908,0.00016823036,0.00053830293,0.00008088234,0.00040455378,0.00051726686],"domain_scores_gemma":[0.99734455,0.0018762493,0.00038604392,0.00025355362,0.00008512395,0.000054449145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035183993,0.00014297444,0.00029433615,0.00028360868,0.00012743032,0.0000153829,0.0004848714,0.00008447139,0.000011309035],"category_scores_gemma":[0.0007420416,0.000083431,0.00016433441,0.00058570754,0.00006639655,0.00005991996,0.000031983585,0.00093531446,8.9674387e-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.00029995514,0.00014202132,0.000288939,0.000005746329,0.000060153474,0.0000213308,0.0006020244,0.0000039009965,0.00003272755,0.997085,0.0004399441,0.001018261],"study_design_scores_gemma":[0.0012301682,0.00047878324,0.00108576,0.00003549997,0.00003381324,0.00008131108,0.00013810273,0.000008688366,0.0008055627,0.994861,0.0011440734,0.00009724327],"about_ca_topic_score_codex":0.000001880454,"about_ca_topic_score_gemma":0.000018011246,"teacher_disagreement_score":0.007026892,"about_ca_system_score_codex":0.0002089086,"about_ca_system_score_gemma":0.00009821714,"threshold_uncertainty_score":0.4063528},"labels":[],"label_agreement":null},{"id":"W2950545301","doi":"10.37236/5003","title":"On-line List Colouring of Random Graphs","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Combinatorics; Line (geometry); Mathematics; Random graph; Computer science; Graph","score_opus":0.03752218687408864,"score_gpt":0.3135732293580333,"score_spread":0.27605104248394463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950545301","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.98100376,0.007963748,0.003964525,0.0003580046,0.003123607,0.00044615337,0.000011042394,0.000027635147,0.0031015256],"genre_scores_gemma":[0.9979767,0.0014000407,0.00005224153,0.00004356406,0.0002023947,0.0000042834017,0.0000015401135,0.000057390607,0.00026184312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966506,0.000486904,0.0011693919,0.00018025572,0.0009648556,0.0005480029],"domain_scores_gemma":[0.99421716,0.0016653051,0.0023143657,0.00080956845,0.0008776927,0.00011590612],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0049578245,0.0003799364,0.0011349785,0.00029627365,0.00016668615,0.000035919566,0.00156417,0.0003136512,0.000020769936],"category_scores_gemma":[0.0013484529,0.00023267414,0.0006226683,0.00027545044,0.00020647244,0.000046194833,0.000495479,0.003215539,6.308737e-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.00077153556,0.00022085867,0.000023065715,0.00015879117,0.000621875,0.000011126098,0.0008240556,0.00071433885,0.000016025962,0.99439967,0.0021255966,0.00011308529],"study_design_scores_gemma":[0.0028176962,0.0009833195,0.000005954466,0.00029363215,0.0004336519,0.00011023797,0.00009253276,0.00011329942,0.0008947719,0.99360806,0.00043001497,0.00021683006],"about_ca_topic_score_codex":0.000005646975,"about_ca_topic_score_gemma":0.0000035174705,"teacher_disagreement_score":0.016972942,"about_ca_system_score_codex":0.00037336204,"about_ca_system_score_gemma":0.00088198663,"threshold_uncertainty_score":0.99908406},"labels":[],"label_agreement":null},{"id":"W2952258958","doi":"10.37236/2049","title":"Bivariate Identities for Values of the Hurwitz Zeta Function and Supercongruences","year":2012,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Identity (music); Bivariate analysis; Mathematics; Markov chain; Pure mathematics; Riemann zeta function; Function (biology); Extension (predicate logic); Combinatorics; Statistics; Physics; Computer science","score_opus":0.035810547031908974,"score_gpt":0.3085389908063356,"score_spread":0.2727284437744266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952258958","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.8561175,0.027741052,0.10740963,0.0011350721,0.0053136987,0.0013973573,0.000023006958,0.00004406016,0.00081864226],"genre_scores_gemma":[0.995726,0.0016796504,0.00024248307,0.000013952637,0.00024343727,0.00001900444,7.6023133e-7,0.00004425612,0.0020304818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975947,0.0002260318,0.00092295394,0.00013811054,0.0006328002,0.00048537052],"domain_scores_gemma":[0.99572515,0.0016111508,0.0015204845,0.00050671055,0.0005829699,0.00005355247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025442904,0.00028058965,0.00070864445,0.0001089014,0.00020590564,0.0000879831,0.00090101745,0.00018317594,0.000013942117],"category_scores_gemma":[0.0012097034,0.0001573652,0.00036841512,0.00013971416,0.0003195302,0.00029581337,0.00046749628,0.001066102,6.9796334e-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.00004415608,0.00011098244,0.00010712441,0.0007441206,0.00037491426,1.9222747e-7,0.0007888145,0.000020083828,0.00019012621,0.99714154,0.00044074765,0.00003719102],"study_design_scores_gemma":[0.00044907,0.00019526652,0.0001707117,0.0003327683,0.0010581025,0.00005511826,0.0007890554,0.000053163487,0.0013992899,0.9952219,0.00011676482,0.00015879735],"about_ca_topic_score_codex":0.000008686456,"about_ca_topic_score_gemma":0.000008132231,"teacher_disagreement_score":0.1396085,"about_ca_system_score_codex":0.0002149527,"about_ca_system_score_gemma":0.0003979823,"threshold_uncertainty_score":0.6417166},"labels":[],"label_agreement":null},{"id":"W2956003067","doi":"10.37236/8847","title":"A Lower Bound on the Average Degree Forcing a Minor","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Lambda; Upper and lower bounds; Mathematics; Minor (academic); Degree (music); Constant (computer programming); Graph; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics; Humanities","score_opus":0.04443103041596586,"score_gpt":0.26581109311380885,"score_spread":0.221380062697843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956003067","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.97858804,0.0014247247,0.0050955364,0.008301946,0.0007202605,0.00024291548,0.0000011689643,0.000024045652,0.0056013283],"genre_scores_gemma":[0.9979329,0.00014284448,0.000015353127,0.0013641765,0.00027432104,0.000002061073,9.0558686e-8,0.000029689296,0.00023852351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829334,0.00022189047,0.0004033875,0.00010349391,0.0005095655,0.00046832752],"domain_scores_gemma":[0.9977658,0.0012502498,0.00043060884,0.00033446032,0.00013597254,0.000082953615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012986355,0.00018211133,0.0002832875,0.00004288056,0.00042304845,0.000060624592,0.0008816342,0.00006610083,0.000061664025],"category_scores_gemma":[0.0007550853,0.000086092,0.00025523908,0.00028261694,0.00009171034,0.000074301635,0.00009799449,0.0012108632,0.000005223685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017288279,0.00005084195,0.000024215411,0.000014012119,0.00014838559,0.000015645055,0.0016875895,0.000014074543,0.00008041806,0.99391025,0.003613289,0.00026840414],"study_design_scores_gemma":[0.000575002,0.0008847317,0.000034223354,0.000029348965,0.00009051098,0.00010560173,0.0002016832,0.00013388583,0.0007676475,0.9908888,0.0061781784,0.000110387286],"about_ca_topic_score_codex":9.036846e-7,"about_ca_topic_score_gemma":0.0000013596654,"teacher_disagreement_score":0.019344866,"about_ca_system_score_codex":0.00014089546,"about_ca_system_score_gemma":0.00018020933,"threshold_uncertainty_score":0.52606654},"labels":[],"label_agreement":null},{"id":"W2963023230","doi":"10.37236/175","title":"Squishing Dimers on the Hexagon Lattice","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Orbifold; Combinatorics; Lattice (music); Algebraic number; Generating function; Partition (number theory); Pure mathematics; Mathematical analysis; Physics","score_opus":0.030185998953230275,"score_gpt":0.302906022833403,"score_spread":0.27272002388017275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963023230","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.9221174,0.0025826474,0.027560476,0.02775261,0.0031272892,0.0009323467,0.0000011446151,0.00015395331,0.015772143],"genre_scores_gemma":[0.9983952,0.00022237701,0.0001400254,0.00055057195,0.00027403436,0.000002917044,1.449858e-7,0.0000398139,0.00037489453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714667,0.00032612862,0.00071901095,0.00013678911,0.0009395547,0.00073187985],"domain_scores_gemma":[0.99462795,0.0033071127,0.00096857996,0.000685681,0.00032002368,0.00009064428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003072047,0.00027721142,0.00044128145,0.00009308314,0.00034358408,0.00008824635,0.0013041804,0.00009908251,0.000018070765],"category_scores_gemma":[0.002417508,0.00014871282,0.00023947125,0.00055040227,0.000077490055,0.00021309852,0.000055523844,0.0017513434,0.000017388938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000662035,0.0002740763,0.0000032546718,0.000009639943,0.00007823321,0.000007809388,0.0005902837,0.000030756753,0.00015285194,0.9961782,0.0021238136,0.0004848696],"study_design_scores_gemma":[0.00068247097,0.0011597847,0.000017437522,0.00008912385,0.00013546746,0.00012766432,0.00036940284,0.00008457492,0.0020950143,0.99165475,0.0034152672,0.00016905724],"about_ca_topic_score_codex":7.652981e-7,"about_ca_topic_score_gemma":6.037598e-7,"teacher_disagreement_score":0.07627783,"about_ca_system_score_codex":0.00053343445,"about_ca_system_score_gemma":0.0002683199,"threshold_uncertainty_score":0.76088125},"labels":[],"label_agreement":null},{"id":"W2963047229","doi":"10.37236/7591","title":"Counting Compositions over Finite Abelian Groups","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Carleton University","funders":"","keywords":"Mathematics; Bijection, injection and surjection; Abelian group; Type (biology); Combinatorics; Finite field; Group (periodic table); Matrix (chemical analysis); Transfer (computing); Discrete mathematics; Pure mathematics; Bijection","score_opus":0.006386209221983236,"score_gpt":0.24084554787247342,"score_spread":0.23445933865049018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963047229","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.98494005,0.0014976105,0.011495138,0.0003925463,0.00038235474,0.000050800623,0.0000010325773,0.0000061343744,0.0012343223],"genre_scores_gemma":[0.9985244,0.00022598554,0.000021806703,0.00040971866,0.00067915325,5.479626e-7,0.0000041169574,0.0000094346415,0.00012479062],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904484,0.00008910067,0.00025216435,0.00009921654,0.00015307807,0.00036158913],"domain_scores_gemma":[0.9992642,0.00005531282,0.00023638704,0.00015904453,0.00023956705,0.00004547943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006621741,0.00010216975,0.00012662636,0.000029886265,0.00022464078,0.000031236134,0.00036401206,0.0000780804,0.000011962628],"category_scores_gemma":[0.00009567965,0.00006424085,0.00010713891,0.00016251516,0.00011645702,0.000004753139,0.00008872104,0.00030105756,0.0000068904747],"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.0004752992,0.000553194,0.009893292,0.000019580008,0.00055974803,0.000015248601,0.00023554279,0.00014556292,0.6002268,0.3762607,0.008316326,0.003298685],"study_design_scores_gemma":[0.0045607393,0.016795196,0.015100606,0.00013612125,0.0002959634,0.0008880689,0.0003142035,0.0014982797,0.172625,0.4503165,0.3364371,0.001032233],"about_ca_topic_score_codex":0.0000024009055,"about_ca_topic_score_gemma":0.0000039392876,"teacher_disagreement_score":0.4276018,"about_ca_system_score_codex":0.00004076439,"about_ca_system_score_gemma":0.00011871319,"threshold_uncertainty_score":0.26196656},"labels":[],"label_agreement":null},{"id":"W2963074859","doi":"10.37236/3345","title":"Repeated Columns and an Old Chestnut","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Disjoint sets; Combinatorics; Mathematics; Conjecture; Multiplicity (mathematics); Integer (computer science); Bounded function; Family of sets; Matrix (chemical analysis); Discrete mathematics; Set (abstract data type); Geometry; Computer science","score_opus":0.013004428093068673,"score_gpt":0.2703333824382416,"score_spread":0.25732895434517294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963074859","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.99647915,0.0009540571,0.00065575703,0.00041427967,0.0002636435,0.00016061211,3.4215776e-7,0.000020600512,0.0010515767],"genre_scores_gemma":[0.9988632,0.00022258866,0.00005491221,0.00011293575,0.00011358863,0.0000027497595,2.2135816e-7,0.000022908614,0.00060689764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986768,0.00018209005,0.00037715788,0.0000928794,0.00027945457,0.00039166154],"domain_scores_gemma":[0.99864,0.00032130777,0.0003625771,0.0003284402,0.00024639713,0.00010125889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011278202,0.0001357212,0.0002611697,0.00006864385,0.00024284463,0.00006122646,0.00042074273,0.00007968247,0.000046660105],"category_scores_gemma":[0.00022649074,0.00008216624,0.0000782847,0.00017903646,0.0001097951,0.00021550224,0.00006584337,0.0006492717,0.0000017163778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001997658,0.0000626682,0.00030222832,0.000011184234,0.000079022786,0.000002837319,0.0006441377,0.0000011394901,0.00015577397,0.99711007,0.0010321202,0.00057881733],"study_design_scores_gemma":[0.0005554788,0.0005640549,0.0008264527,0.000014900152,0.00007257046,0.0002867156,0.00023359306,0.00007700926,0.0007645997,0.995779,0.0007202207,0.000105416606],"about_ca_topic_score_codex":0.000011832269,"about_ca_topic_score_gemma":0.0000033997826,"teacher_disagreement_score":0.002384066,"about_ca_system_score_codex":0.00009227019,"about_ca_system_score_gemma":0.000092512586,"threshold_uncertainty_score":0.3350642},"labels":[],"label_agreement":null},{"id":"W2963083471","doi":"10.37236/8833","title":"Fractional Decompositions and the Smallest-eigenvalue Separation","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Canada Research Chairs","keywords":"Bipartite graph; Mathematics; Eigenvalues and eigenvectors; Bounding overwatch; Combinatorics; Generalization; Discrete mathematics; Graph; Mathematical analysis; Computer science","score_opus":0.020715950168881236,"score_gpt":0.3224050803431109,"score_spread":0.30168913017422966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963083471","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.8130464,0.008801593,0.15877408,0.012406973,0.0014031241,0.0015657264,0.000016733515,0.000040449482,0.0039449534],"genre_scores_gemma":[0.9975875,0.0016091173,0.00008617995,0.00009673763,0.00017582734,0.000035691904,0.0000056101626,0.000022800097,0.0003805524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982119,0.0004390457,0.00055973534,0.00013807256,0.0003748996,0.00027629684],"domain_scores_gemma":[0.9962164,0.0019083006,0.001019003,0.00048878655,0.00032214462,0.000045354947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026159843,0.00020417805,0.00038605824,0.00008979522,0.00038597293,0.000094410745,0.0006204069,0.00016093648,0.000024514538],"category_scores_gemma":[0.00016385976,0.00011690022,0.00026695445,0.00016097332,0.00018461017,0.000060322713,0.0001791924,0.0020289745,0.000008423717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019070627,0.00009645886,0.000025752244,0.000024734567,0.00026337485,4.7071876e-7,0.00034187653,0.0006023091,0.000019588879,0.9973516,0.001056285,0.000026835623],"study_design_scores_gemma":[0.0009882487,0.00012453941,0.00009591833,0.00004830098,0.00042515836,0.00017756027,0.00012795742,0.00068725547,0.00008854556,0.9953805,0.0017340196,0.00012197818],"about_ca_topic_score_codex":0.0000044720946,"about_ca_topic_score_gemma":0.0000052654423,"teacher_disagreement_score":0.18454112,"about_ca_system_score_codex":0.00018278757,"about_ca_system_score_gemma":0.0005522271,"threshold_uncertainty_score":0.8814997},"labels":[],"label_agreement":null},{"id":"W2963088540","doi":"10.37236/2678","title":"Partitions and Compositions over Finite Fields","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Order (exchange); Field (mathematics); Combinatorics; Finite set; Algebraic number field; Finite element method; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.005151596893328243,"score_gpt":0.20179915786150818,"score_spread":0.19664756096817992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963088540","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.66671646,0.0057511395,0.30539453,0.020175815,0.0007179934,0.00018112376,5.614756e-7,0.00005753978,0.0010048432],"genre_scores_gemma":[0.9988894,0.00038678563,0.00015816835,0.00043648598,0.000009077226,0.000003011823,1.9293186e-7,0.0000036698364,0.00011323191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919075,0.000069069094,0.00022209398,0.00007132982,0.0001878577,0.0002588942],"domain_scores_gemma":[0.99917364,0.0002143057,0.00014528772,0.00021174613,0.00018460046,0.00007039496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036054038,0.00007031242,0.00010775905,0.00007212124,0.00019903215,0.00011476251,0.00038130497,0.000034530698,0.000014116061],"category_scores_gemma":[0.000029875739,0.0000460619,0.000053743384,0.00027541554,0.000049055663,0.0002972059,0.000069816546,0.0003769922,0.000012093597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010835633,0.000049837217,0.00009966576,0.0000016715953,0.000022063783,0.0000011950098,0.00014212435,0.00016981446,0.00017368572,0.99512947,0.003975412,0.00023395645],"study_design_scores_gemma":[0.00031838263,0.00025758863,0.0006420035,0.000012849649,0.000014316971,0.00009364342,0.000014001928,0.0043450957,0.00022118165,0.9929302,0.0010902988,0.000060466027],"about_ca_topic_score_codex":0.000013600582,"about_ca_topic_score_gemma":0.0000017725683,"teacher_disagreement_score":0.3321729,"about_ca_system_score_codex":0.000027883792,"about_ca_system_score_gemma":0.00010016733,"threshold_uncertainty_score":0.18783498},"labels":[],"label_agreement":null},{"id":"W2963151262","doi":"10.37236/7224","title":"More Turán-Type Theorems for Triangles in Convex Point Sets","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Regular polygon; Type (biology); Point (geometry); General position; Set (abstract data type); Position (finance); Geometry; Computer science","score_opus":0.007912578110471075,"score_gpt":0.25405777358528264,"score_spread":0.24614519547481156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963151262","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.70942307,0.0042268503,0.2789511,0.0047935676,0.0019128937,0.0004130924,5.762392e-7,0.000017459182,0.00026136116],"genre_scores_gemma":[0.9990803,0.0001616862,0.0002353803,0.00021864839,0.000070911236,0.0000022857928,0.0000014403324,0.0000068475215,0.0002225202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998862,0.0001019072,0.0003261768,0.0001131262,0.00029183365,0.0003049564],"domain_scores_gemma":[0.9987825,0.00040851967,0.0002587771,0.00020959313,0.00030227238,0.000038330887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101472,0.000096442986,0.0001983764,0.0001532742,0.000055577017,0.000059985483,0.00067224784,0.000043946955,0.000005968106],"category_scores_gemma":[0.00011307513,0.00006624292,0.00009121616,0.0006045071,0.0000174064,0.0002827229,0.000050110855,0.0003020418,0.000007310637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007979218,0.00007442715,0.000107281936,0.000009780132,0.000028139739,0.0000019860836,0.0004591036,0.0038850566,0.00033783296,0.9918923,0.00040114843,0.0027231537],"study_design_scores_gemma":[0.0018016654,0.0009512839,0.0004963606,0.000019391391,0.000010971822,0.000105464875,0.00008023576,0.035557598,0.0018591923,0.95302594,0.005978312,0.000113598595],"about_ca_topic_score_codex":0.0000012717683,"about_ca_topic_score_gemma":0.0000013758572,"teacher_disagreement_score":0.2896572,"about_ca_system_score_codex":0.00017973669,"about_ca_system_score_gemma":0.00050091615,"threshold_uncertainty_score":0.27013078},"labels":[],"label_agreement":null},{"id":"W2963157859","doi":"10.37236/2364","title":"A Plethysm Formula on the Characteristic Map of Induced Linear Characters from $U_n(\\mathbb F_q)$ to $GL(\\mathbb F_q)$","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Unipotent; Finite field; Symmetric function; Discrete mathematics","score_opus":0.02697840850375969,"score_gpt":0.28136168691008984,"score_spread":0.2543832784063301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963157859","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.98976326,0.0002922088,0.0032733276,0.005221059,0.0006510712,0.00061579805,0.000009832758,0.000031982003,0.00014143405],"genre_scores_gemma":[0.9983216,0.00010629357,0.000089255234,0.0006635233,0.0003280051,0.000026612794,0.0000037569569,0.000072655814,0.00038828005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967093,0.00023561846,0.0010751153,0.00022494802,0.0008800936,0.0008749514],"domain_scores_gemma":[0.99518996,0.0019836833,0.0013219484,0.0008201121,0.00049655966,0.0001877129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012860072,0.00039425495,0.0007828081,0.00023338415,0.0002120089,0.00006445208,0.001256397,0.00016439756,0.00015397316],"category_scores_gemma":[0.0009337296,0.00022843269,0.00029870993,0.00054580014,0.00007228609,0.00028682663,0.00015422844,0.0015654495,0.00021623056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025656848,0.00067051384,0.00009216036,0.000075842036,0.00047202356,0.000012615231,0.00241484,0.000009744324,0.025857907,0.9667349,0.0017691922,0.0016337346],"study_design_scores_gemma":[0.0009949306,0.0012882757,0.0016545852,0.00019542343,0.00012964245,0.000037943963,0.00044899643,0.00010858844,0.015453505,0.9779678,0.001420166,0.00030015767],"about_ca_topic_score_codex":0.000014764827,"about_ca_topic_score_gemma":0.0000027832466,"teacher_disagreement_score":0.0112329265,"about_ca_system_score_codex":0.00034927836,"about_ca_system_score_gemma":0.000284851,"threshold_uncertainty_score":0.9315215},"labels":[],"label_agreement":null},{"id":"W2963199462","doi":"10.37236/6276","title":"On the Additive Bases Problem in Finite Fields","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Abelian group; Combinatorics; Prime (order theory); Additive group; Finite field; Group (periodic table); Vector space; Discrete mathematics; Pure mathematics","score_opus":0.014462194633739722,"score_gpt":0.2532164183811899,"score_spread":0.2387542237474502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963199462","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.9648157,0.000998085,0.008563489,0.0122437095,0.00074419135,0.00042171855,0.0000070782044,0.000023543687,0.012182517],"genre_scores_gemma":[0.9985547,0.0004842085,0.000012457047,0.00031469663,0.000077498895,0.000004997002,7.326864e-8,0.000014842378,0.00053651194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985712,0.00030843593,0.0003491525,0.00007647375,0.000321752,0.00037297176],"domain_scores_gemma":[0.9927497,0.006497441,0.00032529162,0.0002803374,0.00011683858,0.000030411988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016327586,0.00012879203,0.00020311993,0.00008356727,0.00015337225,0.000015336898,0.00056339375,0.000066371686,0.00010398665],"category_scores_gemma":[0.0011942325,0.00004695162,0.00012388262,0.0002140263,0.000094636154,0.00007084974,0.000056782297,0.0006715623,0.0000032490038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008794451,0.00006414178,0.000041216106,0.0000040129485,0.00005174971,0.000005974358,0.00046751514,0.0000047038584,0.000014600684,0.99477273,0.0034365451,0.0010488885],"study_design_scores_gemma":[0.0005967757,0.00051140063,0.000074367665,0.000109171684,0.00002529796,0.000035470566,0.00010521486,0.000008024583,0.0009314057,0.99494255,0.0025832239,0.00007709936],"about_ca_topic_score_codex":0.000001330978,"about_ca_topic_score_gemma":0.0000062825966,"teacher_disagreement_score":0.033739045,"about_ca_system_score_codex":0.00015300373,"about_ca_system_score_gemma":0.00014395139,"threshold_uncertainty_score":0.2917641},"labels":[],"label_agreement":null},{"id":"W2963459968","doi":"10.37236/5282","title":"Cluster Algebras of Type D: Pseudotriangulations Approach","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Agence Nationale de la Recherche; York University; Ministerio de Ciencia e Innovación; Government of Canada","keywords":"Cluster algebra; Cluster (spacecraft); Interpretation (philosophy); Type (biology); Computation; Combinatorics; Mathematics; Graph; Computer science; Physics; Algorithm; Statistical physics","score_opus":0.045851378480070974,"score_gpt":0.29726250972672813,"score_spread":0.25141113124665715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963459968","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.96919125,0.002544727,0.022976767,0.00050654024,0.0017370408,0.00026639306,6.6607777e-7,0.000021767353,0.0027548557],"genre_scores_gemma":[0.99912876,0.000057499612,0.00023659809,0.00003535031,0.00022323556,0.0000016076933,6.762975e-7,0.000027697368,0.00028858072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980802,0.00019381392,0.0006212037,0.00009428642,0.0006443116,0.00036618076],"domain_scores_gemma":[0.99772435,0.0003399557,0.00069174176,0.00037116208,0.0007652187,0.0001075706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015013091,0.00015835653,0.00040359015,0.00010480554,0.00007049511,0.00002169417,0.0006088309,0.000106090716,0.000010930568],"category_scores_gemma":[0.0005386901,0.0001012528,0.00016138403,0.0005163356,0.00007382222,0.0001277218,0.00007532888,0.0005506974,0.000002161768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012118765,0.0001370236,0.00009279022,0.000013956126,0.0001339281,7.368734e-7,0.0006545286,0.00016283005,0.00001649177,0.99587536,0.002729223,0.00006195698],"study_design_scores_gemma":[0.0014832515,0.00054404413,0.000038986185,0.000013390392,0.00014961432,0.00012996697,0.0003016209,0.00034548968,0.0002393642,0.99592865,0.000719155,0.0001064749],"about_ca_topic_score_codex":0.000005015409,"about_ca_topic_score_gemma":7.8551204e-7,"teacher_disagreement_score":0.029937511,"about_ca_system_score_codex":0.00022533297,"about_ca_system_score_gemma":0.0007435222,"threshold_uncertainty_score":0.41289693},"labels":[],"label_agreement":null},{"id":"W2963667528","doi":"10.37236/4777","title":"Containment Game Played on Random Graphs: Another Zig-Zag Theorem","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Multiplicative function; Upper and lower bounds; Zigzag; Graph; Discrete mathematics; Geometry","score_opus":0.03522527851301638,"score_gpt":0.2953483111529574,"score_spread":0.260123032639941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963667528","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.050240707,0.0020221756,0.94209224,0.00152459,0.0011000125,0.0004015704,0.0000044407957,0.00003845113,0.0025758292],"genre_scores_gemma":[0.99899524,0.00016077457,0.000116125266,0.0002887547,0.00010070634,0.000006756824,4.7180058e-7,0.00003870703,0.00029247924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773693,0.00017928127,0.0005637037,0.00012766609,0.0008242725,0.0005681603],"domain_scores_gemma":[0.997341,0.0013223091,0.0005017478,0.0003015986,0.00038487275,0.0001484751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022902638,0.00022159977,0.00047752648,0.00008480747,0.00007976738,0.000044126762,0.000551928,0.00008534117,0.000026273552],"category_scores_gemma":[0.0017096407,0.00012992641,0.0001531785,0.0002613485,0.00007440582,0.00007937759,0.000041246847,0.0007190466,0.000014852353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009863196,0.00026397267,0.0000026848836,0.000013712272,0.0001530096,0.000016074146,0.0005319585,0.000021769487,0.000035377714,0.99537826,0.0021722233,0.00042466653],"study_design_scores_gemma":[0.0050241267,0.0024632062,0.0000026494042,0.000057434056,0.00015460944,0.00014337437,0.00035019824,0.000592289,0.0005652481,0.98824656,0.002245811,0.00015449514],"about_ca_topic_score_codex":0.0000021322965,"about_ca_topic_score_gemma":0.0000022217555,"teacher_disagreement_score":0.9487545,"about_ca_system_score_codex":0.00038749902,"about_ca_system_score_gemma":0.0004506392,"threshold_uncertainty_score":0.52982455},"labels":[],"label_agreement":null},{"id":"W2963865676","doi":"10.37236/7867","title":"A New Perspective on the Average Mixing Matrix","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"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; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Adjacency matrix; Mathematics; Quantum walk; Centralizer and normalizer; Mixing (physics); Combinatorics; Diagonal matrix; Matrix (chemical analysis); Graph energy; Graph; Discrete mathematics; Diagonal; Pure mathematics; Quantum; Voltage graph; Line graph; Quantum computer; Geometry","score_opus":0.006463072534604405,"score_gpt":0.24793409973938782,"score_spread":0.24147102720478342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963865676","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.09840636,0.0021134652,0.86516714,0.030498007,0.0014700866,0.0001390781,1.8381314e-7,0.000052932726,0.002152762],"genre_scores_gemma":[0.9979584,0.0000584464,0.0004248909,0.00043890323,0.00067946,4.1467658e-7,2.2040439e-8,0.000011397993,0.00042806147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983133,0.00026779156,0.00024803865,0.0001522873,0.0005037712,0.00051478605],"domain_scores_gemma":[0.9982652,0.0005877527,0.00031383176,0.0004699805,0.00028485814,0.00007836943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690269,0.00015093206,0.00017451409,0.000091228765,0.00043379885,0.00016928751,0.0019908354,0.00003841259,0.000010155343],"category_scores_gemma":[0.0001703337,0.00007512904,0.00014669355,0.0006267995,0.00006667286,0.00011160222,0.00017132626,0.0010401926,0.000025097317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021289892,0.000031140335,0.000003735332,7.641632e-7,0.00004860789,0.0000075979465,0.0020414342,0.00034925548,0.00006382978,0.9930917,0.0019267102,0.0024139488],"study_design_scores_gemma":[0.00041606463,0.0014392252,0.00009312833,0.000034250283,0.000013567987,0.00037429505,0.00012641073,0.030286469,0.001230149,0.95932734,0.006540779,0.000118319775],"about_ca_topic_score_codex":0.00001763606,"about_ca_topic_score_gemma":0.0000021759356,"teacher_disagreement_score":0.89955205,"about_ca_system_score_codex":0.0003086512,"about_ca_system_score_gemma":0.0006213021,"threshold_uncertainty_score":0.45191768},"labels":[],"label_agreement":null},{"id":"W2964092672","doi":"10.37236/7280","title":"On the Stability of Independence Polynomials","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Independence (probability theory); Combinatorics; Discrete mathematics; Independence number; Polynomial; Graph; Tutte polynomial; Line graph; Voltage graph; Mathematical analysis; Statistics","score_opus":0.019542479260622428,"score_gpt":0.2822583539937257,"score_spread":0.26271587473310326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964092672","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.79928017,0.0008393197,0.19439386,0.0033112126,0.0004775872,0.00020355376,6.0245003e-7,0.000014545476,0.0014791692],"genre_scores_gemma":[0.9996316,0.000099518955,0.000038964707,0.000115410745,0.000058196114,0.0000016713897,2.1340437e-8,0.0000072406474,0.000047385325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974364,0.00060130446,0.00040220097,0.00013348278,0.00092178665,0.00050481415],"domain_scores_gemma":[0.9962896,0.0016045283,0.00047814543,0.0008678844,0.0006992652,0.000060574323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062265308,0.00011198788,0.00021328173,0.000099373035,0.00021245646,0.000042253305,0.0031585419,0.00004787172,0.000026800697],"category_scores_gemma":[0.000801285,0.00005722556,0.00011597664,0.0008212461,0.00040960385,0.0002570954,0.00024054205,0.0009550333,0.000011338473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080775215,0.00008467062,0.00010566965,0.000002425503,0.000031059408,0.0000012855397,0.0003569261,0.0000074199243,0.0018134805,0.996609,0.0001434298,0.00076386984],"study_design_scores_gemma":[0.00026377858,0.0014335198,0.00023033388,0.0000135811315,0.0000057898806,0.00004010551,0.000060573384,0.00022489087,0.07012683,0.92723393,0.000309435,0.000057227207],"about_ca_topic_score_codex":0.0000037221766,"about_ca_topic_score_gemma":0.0000033763552,"teacher_disagreement_score":0.20035143,"about_ca_system_score_codex":0.00021195791,"about_ca_system_score_gemma":0.00069693016,"threshold_uncertainty_score":0.5869409},"labels":[],"label_agreement":null},{"id":"W2964111661","doi":"10.37236/3840","title":"Ramsey Precompact Expansions of Homogeneous Directed Graphs","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":19,"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 Calgary","funders":"Hausdorff Research Institute for Mathematics; Natural Sciences and Engineering Research Council of Canada; Association Neurofibromatoses et Recklinghause; Agence Nationale de la Recherche","keywords":"Homogeneous; Invariant (physics); Mathematics; Graph; Directed graph; Ramsey theory; Representation (politics); Context (archaeology); Combinatorics; Discrete mathematics; Geography","score_opus":0.013181568911588754,"score_gpt":0.28120299748459393,"score_spread":0.26802142857300515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964111661","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.9596364,0.0021400242,0.035491295,0.00030937418,0.00051422213,0.00013585453,0.0000013556111,0.000043522574,0.0017279467],"genre_scores_gemma":[0.9990088,0.00043837947,0.00016744417,0.000032393575,0.00005041207,0.000001546521,4.8398084e-7,0.000023558687,0.00027698957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823844,0.00045762007,0.00053065835,0.00008536277,0.00026178043,0.0004261055],"domain_scores_gemma":[0.9970047,0.0016159987,0.0006946973,0.00035813227,0.0002568921,0.0000695776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438556,0.0001522406,0.0004491759,0.00011895536,0.00014080717,0.000006025451,0.00051299465,0.00009714418,0.000033495882],"category_scores_gemma":[0.0008572259,0.00009860794,0.00020858302,0.00030488666,0.00015878925,0.000074193835,0.00003793785,0.0007104574,0.0000027239332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108718865,0.0002216472,0.00009723076,0.000014881477,0.0001516486,0.000002505194,0.0003770935,0.00004957401,0.0007332115,0.99718153,0.0003279311,0.00073399855],"study_design_scores_gemma":[0.0007467433,0.0006823814,0.000107550884,0.000031526528,0.00013122801,0.0002505731,0.000108200635,0.0000741422,0.0052682916,0.991481,0.0010179173,0.00010041214],"about_ca_topic_score_codex":0.0000017880732,"about_ca_topic_score_gemma":0.0000049714445,"teacher_disagreement_score":0.03937239,"about_ca_system_score_codex":0.00008945038,"about_ca_system_score_gemma":0.00018044247,"threshold_uncertainty_score":0.40211153},"labels":[],"label_agreement":null},{"id":"W2964193954","doi":"10.37236/5540","title":"Chromatic Bases for Symmetric Functions","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":22,"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":"National Research Foundation of Korea; Ajou University; National Research Foundation","keywords":"Mathematics; Chromatic scale; Combinatorics; Symmetric function; Discrete mathematics; Set (abstract data type); Computer science","score_opus":0.02946120092152956,"score_gpt":0.3021382678988326,"score_spread":0.27267706697730304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964193954","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.09996982,0.0015179963,0.8908955,0.0032955012,0.0024516396,0.0007502406,0.0000069834473,0.000090538,0.0010217996],"genre_scores_gemma":[0.9970218,0.00022967134,0.0006482991,0.00003469497,0.00029827657,0.000029759862,2.573278e-7,0.00006158897,0.001675656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977142,0.00013046936,0.0008154761,0.00013039992,0.00054260925,0.0006668133],"domain_scores_gemma":[0.99191374,0.0058881836,0.0009821416,0.0004970902,0.0006195999,0.00009922636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014659509,0.00022909146,0.0004932792,0.0002312217,0.00021784668,0.000029970073,0.0006963622,0.00008509245,0.000025812462],"category_scores_gemma":[0.0048892153,0.00011831299,0.00030116885,0.0006791775,0.00008349876,0.0002507621,0.000058452537,0.0003332131,0.000016240374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053935208,0.00025070866,0.000011969708,0.000060529714,0.00014679415,0.000002154136,0.00006488176,0.0000016844072,0.00048523294,0.9935029,0.004109023,0.0013101466],"study_design_scores_gemma":[0.001992119,0.0010318056,0.0000072102616,0.00012341986,0.00025468736,0.00022860225,0.000101083104,0.000039614595,0.0020924788,0.9847669,0.009194646,0.00016741267],"about_ca_topic_score_codex":4.2225702e-7,"about_ca_topic_score_gemma":0.0000010610563,"teacher_disagreement_score":0.897052,"about_ca_system_score_codex":0.0006686807,"about_ca_system_score_gemma":0.00043367385,"threshold_uncertainty_score":0.58532006},"labels":[],"label_agreement":null},{"id":"W2964341975","doi":"10.37236/8905","title":"Queens in Exile: Non-attacking Queens on Infinite Chess Boards","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Quadrant (abdomen); Square (algebra); Queen (butterfly); Order (exchange); Mathematics; Word (group theory); Spiral (railway); Geometry; Mathematical analysis; Biology; Zoology","score_opus":0.01603099815686654,"score_gpt":0.2611772959522399,"score_spread":0.24514629779537334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964341975","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.555227,0.008676477,0.3977866,0.02257181,0.008574239,0.0010139459,0.000010130853,0.0002779637,0.0058618593],"genre_scores_gemma":[0.9974227,0.0011568851,0.00011880722,0.00078791624,0.000375048,0.000009094425,0.0000021840272,0.000045921963,0.000081457896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961611,0.00045027476,0.0009968848,0.0004529108,0.00097423827,0.0009645881],"domain_scores_gemma":[0.99666715,0.0005687727,0.0012540388,0.0010963291,0.00025081044,0.0001629187],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028815034,0.000473892,0.000854883,0.00037990502,0.0001323811,0.00031219266,0.0043664775,0.00029931052,0.0000065375957],"category_scores_gemma":[0.00018828335,0.00035679224,0.00036796197,0.00085187383,0.000075002274,0.00026855984,0.0012864996,0.0051403246,0.000020524127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006256103,0.00023804218,0.00024606826,0.00007964514,0.00016940219,0.0001687238,0.0022936354,0.0026982585,0.00013139249,0.9899111,0.0012662516,0.00273495],"study_design_scores_gemma":[0.0010551393,0.00074369623,0.001389175,0.000574709,0.000051139556,0.000121965364,0.00009971027,0.015727134,0.0013611871,0.974901,0.0034873951,0.0004877402],"about_ca_topic_score_codex":0.000032747303,"about_ca_topic_score_gemma":0.000009893503,"teacher_disagreement_score":0.4421957,"about_ca_system_score_codex":0.0010047394,"about_ca_system_score_gemma":0.0017977218,"threshold_uncertainty_score":0.9998884},"labels":[],"label_agreement":null},{"id":"W2969368018","doi":"10.37236/8954","title":"On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Hrvatska Zaklada za Znanost","keywords":"Combinatorics; Mathematics; Antipodal point; Hamming graph; Bipartite graph; Strongly regular graph; Vertex (graph theory); Graph; Discrete mathematics; Line graph; Pathwidth; Geometry; Hamming code; Block code; Algorithm","score_opus":0.04629424485708431,"score_gpt":0.30317444348995815,"score_spread":0.2568801986328738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969368018","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.9594618,0.0141912615,0.01020623,0.011269811,0.0008878971,0.0011657686,0.00002565107,0.000044959645,0.0027465862],"genre_scores_gemma":[0.99710006,0.0022530057,0.000025564308,0.00010878401,0.000077018914,0.000012462469,0.0000015997929,0.00008439837,0.00033712937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574524,0.0009747313,0.00093512825,0.00027538554,0.0013604789,0.00070906035],"domain_scores_gemma":[0.99328154,0.003726848,0.0013564618,0.0010001474,0.0004999904,0.00013500534],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004551722,0.00041576347,0.0009048348,0.00017384755,0.00018216773,0.000086780885,0.0019213675,0.00026028647,0.00004555771],"category_scores_gemma":[0.0017689212,0.00023611853,0.00042121697,0.00047774942,0.0004445922,0.000064840686,0.00063473574,0.0045772847,0.0000055779897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037557055,0.00022011707,0.000037504124,0.00026930906,0.00060398947,0.000015003641,0.0009861435,0.000015298663,0.00019754727,0.99382824,0.0032362372,0.00021501428],"study_design_scores_gemma":[0.00078753446,0.0008745966,0.00005992632,0.00032814566,0.00026468624,0.000047140227,0.00032546752,0.00025127374,0.0011606438,0.99487007,0.00081389624,0.00021664039],"about_ca_topic_score_codex":0.000005508516,"about_ca_topic_score_gemma":0.000005244548,"teacher_disagreement_score":0.037638202,"about_ca_system_score_codex":0.00034882143,"about_ca_system_score_gemma":0.0008495918,"threshold_uncertainty_score":0.99771917},"labels":[],"label_agreement":null},{"id":"W2972297693","doi":"10.37236/8992","title":"The Smallest Matroids with no Large Independent Flat","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Element (criminal law); Simple (philosophy); Pairwise comparison; Binary number; Discrete mathematics; Statistics; Arithmetic","score_opus":0.008361064287272681,"score_gpt":0.25411332881074344,"score_spread":0.24575226452347076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972297693","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.12790008,0.035126608,0.8264515,0.004830922,0.003134859,0.0006873179,0.0000026576986,0.000072605784,0.0017934635],"genre_scores_gemma":[0.99278486,0.005563559,0.00027390436,0.000085212996,0.00018752327,0.000016855198,0.0000015103682,0.000042734147,0.0010438616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948521,0.0007852123,0.0006759306,0.0003969813,0.0018576776,0.001432092],"domain_scores_gemma":[0.99463737,0.00076831045,0.0009989475,0.0018801832,0.0015385413,0.00017663985],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0052374164,0.00039534323,0.0005394213,0.00016762293,0.00067044725,0.0007971647,0.0068229465,0.00019657335,0.000010393318],"category_scores_gemma":[0.00021710228,0.00020696562,0.00033698286,0.0007454347,0.00018115375,0.00026430242,0.0026528463,0.005964436,0.000014116562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012811269,0.00010037423,0.00017439474,0.000024986739,0.0003789212,0.00012592386,0.00035393375,0.0004907466,0.00006597575,0.9973286,0.00024112464,0.00058694475],"study_design_scores_gemma":[0.0011720966,0.0009604974,0.00021415605,0.0001537361,0.00006427254,0.0009047893,0.00025639022,0.001510232,0.0007253451,0.98626024,0.0074284915,0.00034974617],"about_ca_topic_score_codex":0.000004919535,"about_ca_topic_score_gemma":0.000044980374,"teacher_disagreement_score":0.86488473,"about_ca_system_score_codex":0.0008243613,"about_ca_system_score_gemma":0.0034376543,"threshold_uncertainty_score":0.9985506},"labels":[],"label_agreement":null},{"id":"W2980045536","doi":"10.37236/11660","title":"Tree Automata and Pigeonhole Classes of Matroids: II","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"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 Ottawa; Douglas College","funders":"Royal Society Te Apārangi","keywords":"Matroid; Pigeonhole principle; Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Class (philosophy); Tree (set theory); Computer science","score_opus":0.006619691375914248,"score_gpt":0.22282454320529904,"score_spread":0.2162048518293848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980045536","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.963181,0.0049030017,0.026627108,0.003659824,0.0005810642,0.00009576252,0.0000011312763,0.00012919937,0.0008219168],"genre_scores_gemma":[0.998019,0.0015113552,0.000075765245,0.000056288827,0.000040835745,0.0000011058961,3.1158797e-7,0.000010476295,0.00028489734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857575,0.000109366,0.00037736044,0.00011503767,0.0003993614,0.00042312316],"domain_scores_gemma":[0.99874705,0.0002922705,0.00037721646,0.00040463338,0.0001201474,0.000058677564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016103963,0.00011795186,0.00025902482,0.00017153869,0.00015822794,0.000053360516,0.00124704,0.00004523105,0.000003057642],"category_scores_gemma":[0.00007607181,0.00007838453,0.000091647285,0.00081240135,0.00007702606,0.0003295878,0.00035316782,0.00034447634,0.0000057509815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011110354,0.00006689381,0.00010906557,0.000013746731,0.000053014835,0.000009747916,0.00045800177,0.000016760923,0.0013521627,0.9876726,0.0022342964,0.008002549],"study_design_scores_gemma":[0.0007884375,0.0009412237,0.002106271,0.00004144832,0.000029838737,0.00026210098,0.0002065905,0.00886353,0.0036766448,0.9789929,0.003971303,0.00011971396],"about_ca_topic_score_codex":0.0000037205086,"about_ca_topic_score_gemma":0.0000014615864,"teacher_disagreement_score":0.034837972,"about_ca_system_score_codex":0.000056285022,"about_ca_system_score_gemma":0.00026046863,"threshold_uncertainty_score":0.31964287},"labels":[],"label_agreement":null},{"id":"W2993394850","doi":"10.37236/1637","title":"Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"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","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Path (computing); Homogeneous space; Generating function; Critical point (mathematics); Graph; Geometry; Computer science","score_opus":0.03158084590770291,"score_gpt":0.260208681313554,"score_spread":0.2286278354058511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993394850","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.9316705,0.030400869,0.034592494,0.00052773464,0.0006105072,0.00049095467,0.0000030974575,0.00003198793,0.0016718867],"genre_scores_gemma":[0.99439853,0.005166773,0.0002001101,0.00002013864,0.00004780732,0.0000053851913,1.7500368e-7,0.000035896446,0.00012516028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784476,0.00018640197,0.0008208483,0.0001191114,0.0005605817,0.0004682812],"domain_scores_gemma":[0.99762046,0.0008431062,0.00086385506,0.00032505428,0.00027978327,0.000067731555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201232,0.00021025845,0.00057020574,0.0003064593,0.000054764147,0.000019106259,0.0004001532,0.00011072043,0.00002036201],"category_scores_gemma":[0.00046163402,0.00015483832,0.00011653088,0.0006606838,0.000118499745,0.00030572448,0.00007581521,0.0006545795,0.000001262797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037067854,0.00033864038,0.000057824964,0.00011543592,0.000055810742,0.0000040349305,0.0014296614,0.00002744772,0.00024027097,0.9970398,0.00026032233,0.00039370538],"study_design_scores_gemma":[0.0014882799,0.0005628465,0.000014722386,0.00011763912,0.000080668724,0.00008962628,0.00037076187,0.0020021333,0.002361892,0.9926603,0.000107791304,0.00014333939],"about_ca_topic_score_codex":0.0000046531013,"about_ca_topic_score_gemma":0.0000037010282,"teacher_disagreement_score":0.062728085,"about_ca_system_score_codex":0.00021813372,"about_ca_system_score_gemma":0.00006610601,"threshold_uncertainty_score":0.6314123},"labels":[],"label_agreement":null},{"id":"W2994065064","doi":"10.37236/1690","title":"Pattern Avoidance in Permutations: Linear and Cyclic Orders","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"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 Waterloo","funders":"Chalmers Tekniska Högskola","keywords":"Mathematics; Bijection, injection and surjection; Combinatorics; Generating function; Euler's totient function; Lemma (botany); Permutation (music); Simple (philosophy); Bijection; Discrete mathematics; Euler's formula","score_opus":0.01831435443319612,"score_gpt":0.2991734189737368,"score_spread":0.28085906454054066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994065064","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.90731424,0.0027830717,0.08785549,0.0005671337,0.0005312842,0.00029573924,5.156798e-7,0.000023198094,0.0006293137],"genre_scores_gemma":[0.9987535,0.0006471616,0.0003570094,0.000050103798,0.000040766074,0.0000066127573,1.3499256e-7,0.000036942827,0.00010779741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980793,0.0002690132,0.00065742596,0.00011990422,0.0003893342,0.0004850357],"domain_scores_gemma":[0.997763,0.0011382898,0.00054694555,0.00028415935,0.00020136427,0.0000662366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016194073,0.00018760853,0.00038100185,0.00013524856,0.0001084732,0.000025596884,0.00032981017,0.00007726511,0.000008345405],"category_scores_gemma":[0.0019501514,0.00013874745,0.000075668766,0.00046380027,0.000077493845,0.00018398828,0.000032626693,0.00089011283,0.0000035483947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001174682,0.00018053695,0.00042391324,0.00004020272,0.00003601262,0.00000973869,0.00077303156,0.000045242225,0.00006995186,0.99811953,0.00005673195,0.00023336247],"study_design_scores_gemma":[0.0013748264,0.0002520782,0.00006240735,0.00007146324,0.000045795612,0.0002344411,0.0004954939,0.00017533114,0.000569866,0.9955337,0.0010395374,0.00014506489],"about_ca_topic_score_codex":0.0000025714005,"about_ca_topic_score_gemma":0.000010769926,"teacher_disagreement_score":0.09143922,"about_ca_system_score_codex":0.00030444618,"about_ca_system_score_gemma":0.0002726196,"threshold_uncertainty_score":0.56579566},"labels":[],"label_agreement":null},{"id":"W2994108360","doi":"10.37236/2018","title":"Christoffel Words and the Calkin-Wilf Tree","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"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; Christoffel symbols; Noncommutative geometry; Tree (set theory); Combinatorics; Duality (order theory); Rational number; Pure mathematics","score_opus":0.0079640133193285,"score_gpt":0.1884078611678091,"score_spread":0.1804438478484806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994108360","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.45495886,0.048350867,0.47388864,0.008548685,0.002334494,0.00037347907,5.2960615e-7,0.000112056376,0.011432387],"genre_scores_gemma":[0.9981734,0.001137212,0.000077756304,0.00032436437,0.00007677225,0.0000020543152,4.524559e-8,0.000009194899,0.00019918097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985746,0.00025444594,0.00031283306,0.000110440655,0.0003304029,0.00041724558],"domain_scores_gemma":[0.99869823,0.0003630521,0.0003371727,0.0004518938,0.000085720654,0.00006392672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025730578,0.00013002647,0.00023315632,0.000062820334,0.00019896585,0.00007806302,0.0017251073,0.00004390176,0.0000064610613],"category_scores_gemma":[0.000075364114,0.00006266367,0.00011301957,0.0003371635,0.0002026348,0.00026319426,0.00019280764,0.0006372264,0.000005185296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004784086,0.00004454254,0.000047093225,0.0000021917197,0.00004700069,0.0000073814535,0.0023479122,7.712705e-7,0.000023910881,0.9897751,0.00038544225,0.0072707813],"study_design_scores_gemma":[0.0014576032,0.00028764154,0.00076133216,0.000013482122,0.000037200374,0.00047960508,0.00015202843,0.0012802988,0.00052179507,0.9918897,0.0030230153,0.00009630939],"about_ca_topic_score_codex":0.000016730952,"about_ca_topic_score_gemma":0.000003595475,"teacher_disagreement_score":0.54321456,"about_ca_system_score_codex":0.00008654644,"about_ca_system_score_gemma":0.00019964266,"threshold_uncertainty_score":0.32057074},"labels":[],"label_agreement":null},{"id":"W2996497546","doi":"10.37236/8019","title":"On Walks Avoiding a Quadrant","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Commission","keywords":"Quadrant (abdomen); Mathematics; Regular polygon; Random walk; Queueing theory; Invariant (physics); Mathematical analysis; Discrete mathematics; Applied mathematics; Geometry","score_opus":0.014408614951177378,"score_gpt":0.2837067818284772,"score_spread":0.2692981668772998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996497546","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.9652182,0.00068946753,0.025249828,0.00070998387,0.0025113893,0.00045047124,6.029082e-7,0.000058668043,0.0051114303],"genre_scores_gemma":[0.9986652,0.00012786596,0.00010486047,0.00007780428,0.00013591818,0.0000036342456,1.643747e-7,0.00006329744,0.0008212671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724764,0.0002745162,0.0007543396,0.00014903436,0.0008702722,0.00070417725],"domain_scores_gemma":[0.9949165,0.0031018686,0.0009508271,0.00063124835,0.0003094942,0.000090050184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026388227,0.00026269065,0.00056979776,0.00014757158,0.00016527106,0.000043643748,0.000898347,0.00010526351,0.000052848092],"category_scores_gemma":[0.001473242,0.0001695869,0.00025362032,0.00042688634,0.00004223594,0.0001767401,0.000079697675,0.0017349985,0.00009070857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010423646,0.00026125085,0.00001687326,0.000046850517,0.00010424144,0.0000076009273,0.00050286105,0.000052885713,0.0005724416,0.9976023,0.0006249471,0.00010351819],"study_design_scores_gemma":[0.001528985,0.0012743326,0.000007148589,0.0001380222,0.000081341306,0.00017008655,0.0003137962,0.00015174528,0.0020765248,0.9925154,0.001549739,0.00019291998],"about_ca_topic_score_codex":7.613009e-7,"about_ca_topic_score_gemma":6.437862e-7,"teacher_disagreement_score":0.033447027,"about_ca_system_score_codex":0.00064588233,"about_ca_system_score_gemma":0.00032355875,"threshold_uncertainty_score":0.7537802},"labels":[],"label_agreement":null},{"id":"W2998876001","doi":"10.37236/7879","title":"Maximum Number of Colourings: 5-Chromatic Case","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Conjecture; Chromatic scale; Graph; Discrete mathematics","score_opus":0.00709010829855287,"score_gpt":0.27021139719077947,"score_spread":0.2631212888922266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998876001","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.9257202,0.00088443415,0.07084988,0.00041137493,0.00038254634,0.00018712619,2.9593681e-7,0.000016728154,0.0015474142],"genre_scores_gemma":[0.99917555,0.00012394246,0.0002836991,0.00003197255,0.000020624788,0.0000016165317,5.306364e-8,0.000013011314,0.0003495482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802494,0.00024514468,0.0004497482,0.00012234875,0.0006039157,0.00055392657],"domain_scores_gemma":[0.9979208,0.0004998764,0.00052009604,0.00061019225,0.00036899225,0.000080043086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019939202,0.00012481726,0.00030506283,0.00012326901,0.0000842674,0.000039072595,0.0015906862,0.000047743026,0.000034702927],"category_scores_gemma":[0.00010324347,0.0000852739,0.00014345153,0.0007810605,0.00008290571,0.00039702453,0.00021769026,0.0007215611,0.00004713302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030367195,0.000105195446,0.0006399753,0.000027780283,0.00007147508,0.0001603077,0.0003174973,0.00009485448,0.00044358493,0.99737096,0.00007406343,0.0006639604],"study_design_scores_gemma":[0.0007951999,0.0005964732,0.00007382175,0.00003253315,0.000015332836,0.010132276,0.00011708048,0.00096832117,0.0032022588,0.98343396,0.00053507107,0.000097658936],"about_ca_topic_score_codex":0.0000044100557,"about_ca_topic_score_gemma":0.0000011544901,"teacher_disagreement_score":0.073455326,"about_ca_system_score_codex":0.00022222902,"about_ca_system_score_gemma":0.00037739807,"threshold_uncertainty_score":0.34773687},"labels":[],"label_agreement":null},{"id":"W2998895846","doi":"10.37236/930","title":"On the Genus Distribution of $(p,q,n)$-Dipoles","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Black Holes and Theoretical Physics","field":"Physics and Astronomy","cited_by":29,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Torus; Feynman diagram; Genus; Combinatorics; Enumeration; Type (biology); String (physics); Class (philosophy); String theory; Field (mathematics); Discrete mathematics; Mathematical physics; Pure mathematics; Geometry; Computer science","score_opus":0.004517359008021139,"score_gpt":0.22113563516882367,"score_spread":0.21661827616080254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998895846","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.9108853,0.00030328677,0.08294671,0.00071830605,0.00019253808,0.000080646416,0.0000057748935,0.0000033167446,0.004864174],"genre_scores_gemma":[0.9997119,0.000016242666,7.862665e-7,0.00003163684,0.00017931731,4.972675e-7,0.0000026862551,0.000009613818,0.000047367103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892986,0.0000694115,0.00031279481,0.000053527085,0.00029200656,0.00034238817],"domain_scores_gemma":[0.99885446,0.0003876633,0.00034440952,0.00020335564,0.00016807074,0.000042061853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012360911,0.00010020146,0.00016546404,0.000017859309,0.00011236566,0.0000146649045,0.00037654475,0.000024900686,0.000027571423],"category_scores_gemma":[0.000022655418,0.000051282324,0.0001668545,0.00022575387,0.00013119345,0.00003982022,0.000030153778,0.00058158324,0.000005990967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057591773,0.00015884324,0.00017833376,0.0000018644885,0.00008220916,4.0930237e-7,0.000060887272,0.000025493182,0.000054060376,0.9970601,0.00036525526,0.00195491],"study_design_scores_gemma":[0.0003015808,0.0003097674,0.00044843543,0.000015817152,0.000051528015,0.0000030839838,0.00018110553,0.000019232903,0.009272795,0.98729765,0.0020424624,0.000056550845],"about_ca_topic_score_codex":0.000006865377,"about_ca_topic_score_gemma":2.9909165e-7,"teacher_disagreement_score":0.088826604,"about_ca_system_score_codex":0.000071081384,"about_ca_system_score_gemma":0.00011095045,"threshold_uncertainty_score":0.2526722},"labels":[],"label_agreement":null},{"id":"W2999031880","doi":"10.37236/7133","title":"Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Rank (graph theory); Random graph; Limiting; Distribution (mathematics); Graph; Asymptotic distribution; Discrete mathematics; Polynomial; Statistics; Mathematical analysis","score_opus":0.020871246361832543,"score_gpt":0.29655726252902237,"score_spread":0.27568601616718985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999031880","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.8766687,0.000440421,0.12203481,0.00015720351,0.00019038872,0.0003401,0.000021265296,0.000005940966,0.00014118187],"genre_scores_gemma":[0.9997152,0.00011439922,0.000042049334,0.000007807702,0.000047526457,0.000006762206,0.0000029222974,0.000011701921,0.000051619318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986707,0.0001296076,0.0006332736,0.000066407876,0.00023438345,0.00026560386],"domain_scores_gemma":[0.9971679,0.00087747164,0.0009747788,0.00026116776,0.000681839,0.00003685479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024287826,0.00009874464,0.00036429174,0.00007034822,0.00012117555,0.0000068013287,0.00040003745,0.00005483852,0.000009418957],"category_scores_gemma":[0.000506525,0.00006709683,0.00024422555,0.00037659795,0.00021507582,0.000053006173,0.000021045993,0.00017568268,7.909372e-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.00055967143,0.00033225454,0.0000358542,0.000029678527,0.00011663679,6.83679e-8,0.0001825875,0.0000038578874,0.0031355852,0.9944622,0.00097492617,0.0001666896],"study_design_scores_gemma":[0.002871312,0.00069340266,0.000056596047,0.000035608875,0.00021007253,0.000014713082,0.00007513403,0.000046262627,0.058115453,0.93667656,0.0011474708,0.000057437206],"about_ca_topic_score_codex":0.0000014999775,"about_ca_topic_score_gemma":0.0000011681757,"teacher_disagreement_score":0.123046525,"about_ca_system_score_codex":0.00005623811,"about_ca_system_score_gemma":0.00016287675,"threshold_uncertainty_score":0.27361292},"labels":[],"label_agreement":null},{"id":"W2999040677","doi":"10.37236/1158","title":"The Circular Chromatic Index of Flower Snarks","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Technische Universität Berlin; National Science Foundation","keywords":"Mathematics; Combinatorics; Integer (computer science); Chromatic scale; Edge coloring; Index (typography); Graph","score_opus":0.002675496058256494,"score_gpt":0.18386389701004804,"score_spread":0.18118840095179156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999040677","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.767444,0.031976953,0.19269106,0.0046929987,0.0016313872,0.00021319055,2.3052353e-7,0.000046005458,0.0013041607],"genre_scores_gemma":[0.9994896,0.00027005945,0.00004231791,0.000052822696,0.000016832835,0.000001178302,1.04367096e-7,0.000007997608,0.00011910153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981738,0.00015660147,0.0005457073,0.00009238248,0.00060351874,0.000427999],"domain_scores_gemma":[0.9982892,0.0002750252,0.000548401,0.0005098049,0.0003375427,0.000040008064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020645463,0.000113002876,0.00020528391,0.00008607009,0.00024286784,0.00007616772,0.0014016464,0.000049073464,0.0000018028712],"category_scores_gemma":[0.00005999566,0.00005960656,0.00015416334,0.00062441727,0.00010134726,0.00014775828,0.000091104404,0.0004927058,0.0000030959789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006585763,0.00008623831,0.00015906044,0.000006175294,0.000046212346,0.000003825121,0.0000789354,0.00068612193,0.0008163129,0.9967519,0.00096834876,0.0003902985],"study_design_scores_gemma":[0.0005118595,0.00022862168,0.00042806705,0.000025166635,0.000023149176,0.00014900808,0.000019549489,0.004886479,0.0019475116,0.98992133,0.00178354,0.0000757295],"about_ca_topic_score_codex":0.000017165296,"about_ca_topic_score_gemma":0.0000039574793,"teacher_disagreement_score":0.23204558,"about_ca_system_score_codex":0.00009129387,"about_ca_system_score_gemma":0.00037101278,"threshold_uncertainty_score":0.2604631},"labels":[],"label_agreement":null},{"id":"W2999048296","doi":"10.37236/9286","title":"Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Vertex (graph theory); Graph; Multiple edges; Discrete mathematics; Computer science","score_opus":0.015869783863050754,"score_gpt":0.26760887986465953,"score_spread":0.25173909600160876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999048296","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.89560544,0.0131859835,0.082076654,0.0065905508,0.0010589131,0.00073599775,0.0000133732265,0.000086194756,0.0006468939],"genre_scores_gemma":[0.9958059,0.0030103396,0.00090839545,0.00013186721,0.000028519255,0.0000037030718,5.6204925e-7,0.000041309246,0.00006940089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955432,0.0006525676,0.00091712945,0.0005104597,0.0014211269,0.0009555235],"domain_scores_gemma":[0.99553007,0.0012796219,0.0012423283,0.0010329448,0.00063803745,0.00027699233],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025651318,0.0004594535,0.0009074288,0.00028284464,0.00016993543,0.00014482484,0.004017235,0.00023894783,0.000004201746],"category_scores_gemma":[0.00042347686,0.00034367928,0.00043769745,0.0011220017,0.0004304701,0.00022676295,0.0015040878,0.0040400815,0.0000028379047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044114233,0.00019580568,0.0002223279,0.00009947139,0.00029920734,0.00006373492,0.0005482012,0.0008648696,0.00087081426,0.9952156,0.00013184796,0.0010470029],"study_design_scores_gemma":[0.0010594147,0.0028325482,0.0008310678,0.0001619082,0.000059399612,0.00018014158,0.000046748333,0.0017240541,0.0022441535,0.9903267,0.00023790638,0.0002959322],"about_ca_topic_score_codex":0.000008272764,"about_ca_topic_score_gemma":0.000003203981,"teacher_disagreement_score":0.10020046,"about_ca_system_score_codex":0.00024944486,"about_ca_system_score_gemma":0.0015399023,"threshold_uncertainty_score":0.99990153},"labels":[],"label_agreement":null},{"id":"W2999464824","doi":"10.37236/742","title":"Maximal Nontraceable Graphs with Toughness less than One","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"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 Victoria","funders":"University of South Africa; National Research Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Vertex (graph theory); Graph; Pancyclic graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.019663318482678476,"score_gpt":0.24054955255475927,"score_spread":0.2208862340720808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999464824","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.5504813,0.0029754012,0.4442638,0.0010808745,0.0002075908,0.00015640302,3.203375e-7,0.000039222792,0.000795079],"genre_scores_gemma":[0.99806005,0.0008310092,0.000520411,0.000043704058,0.000049078844,0.000004657463,1.8308529e-7,0.000021870057,0.00046906408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971634,0.00024682487,0.00035163664,0.00020207094,0.0010624802,0.0009735722],"domain_scores_gemma":[0.99803317,0.0002752821,0.00036117737,0.00065638486,0.0005264095,0.00014757551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001437776,0.00019254201,0.00034021607,0.00021676946,0.00044201082,0.000070616385,0.0024667839,0.00005689091,0.0000041933836],"category_scores_gemma":[0.000047349753,0.00012289753,0.00012745647,0.0014484875,0.00024977498,0.00076088106,0.0001644987,0.0012011213,0.000006843674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001782932,0.00023890665,0.00079104066,0.000006241768,0.00010199872,0.00013069496,0.00035850596,0.00023325314,0.0002249459,0.9969169,0.000072126626,0.0007471278],"study_design_scores_gemma":[0.0014237995,0.001687678,0.0013998705,0.000031140196,0.000021718355,0.0031542548,0.00009366485,0.00041944493,0.0043714345,0.98642933,0.0007555545,0.00021209777],"about_ca_topic_score_codex":0.000007969609,"about_ca_topic_score_gemma":0.0000076754295,"teacher_disagreement_score":0.4475787,"about_ca_system_score_codex":0.00023560366,"about_ca_system_score_gemma":0.0008531327,"threshold_uncertainty_score":0.5218341},"labels":[],"label_agreement":null},{"id":"W2999610782","doi":"10.37236/8247","title":"Regularity and $h$-Polynomials of Edge Ideals","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Banff International Research Station for Mathematical Innovation and Discovery; Compute Canada","keywords":"Mathematics; Combinatorics; Graph; Degree (music); Ideal (ethics); Polynomial; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.015439595546316279,"score_gpt":0.28806927914855646,"score_spread":0.27262968360224016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999610782","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.99170816,0.0028333801,0.0026264163,0.00086018664,0.00009393806,0.00018779784,0.0000012143421,0.000005811764,0.0016831202],"genre_scores_gemma":[0.9990667,0.0004139016,0.00008174675,0.00002680479,0.000031582866,0.0000016223489,1.8636706e-7,0.000012254057,0.00036521463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890125,0.00012137782,0.00045553275,0.00006434682,0.00023652936,0.00022097066],"domain_scores_gemma":[0.9979866,0.00083163474,0.0005912127,0.00030330443,0.00024743943,0.000039821378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452055,0.000091971706,0.0003233006,0.000060155704,0.000059788952,0.000013668003,0.0003379893,0.00004471729,0.000027738875],"category_scores_gemma":[0.00020971936,0.00006103657,0.000086084714,0.00020152758,0.00006722642,0.00008507378,0.000066425775,0.0003740396,0.0000037668656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022325643,0.00008116634,0.00048173615,0.000027356191,0.000076723714,2.5282495e-7,0.000327335,6.4877077e-7,0.0024583912,0.9953174,0.0007914774,0.00041516297],"study_design_scores_gemma":[0.00057136326,0.0003231374,0.0014398986,0.000024203566,0.00007378751,0.000060487182,0.00014731156,0.00001668115,0.0063982178,0.98853356,0.0023479103,0.0000634477],"about_ca_topic_score_codex":0.0000034169393,"about_ca_topic_score_gemma":0.000002053601,"teacher_disagreement_score":0.007358552,"about_ca_system_score_codex":0.00008158769,"about_ca_system_score_gemma":0.00020397833,"threshold_uncertainty_score":0.24889989},"labels":[],"label_agreement":null},{"id":"W2999629773","doi":"10.37236/8787","title":"A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Higher Education Discipline Innovation Project; Ministry of Education of the People's Republic of China","keywords":"Conjecture; Mathematics; Combinatorics; Function (biology)","score_opus":0.006156846074635527,"score_gpt":0.24260107635663378,"score_spread":0.23644423028199826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999629773","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.98060155,0.00574461,0.0028326234,0.003195965,0.0021328866,0.00063100545,0.0000034454938,0.000034946555,0.0048229643],"genre_scores_gemma":[0.99789876,0.00058874086,0.000009331944,0.00068148604,0.00022189428,0.0000027004148,5.226986e-7,0.00003689037,0.00055969297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785167,0.00044402253,0.00047307802,0.00015769874,0.00056759163,0.00050594495],"domain_scores_gemma":[0.99663866,0.0019998013,0.0006342645,0.0005040968,0.0001559108,0.00006727394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023156307,0.0002664661,0.00049780536,0.00010492406,0.00035623348,0.00006901771,0.00054523075,0.00015553512,0.000044762714],"category_scores_gemma":[0.00032434514,0.000121381745,0.00023033253,0.00026171605,0.00023296678,0.00009310137,0.000093291834,0.0015959598,0.0000046398122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094544794,0.00004192568,0.00008045616,0.000026281841,0.00021893617,0.0000029413923,0.0009540403,0.000024079367,0.00004783186,0.99616164,0.00088918273,0.00060726627],"study_design_scores_gemma":[0.003897573,0.0012055502,0.00015785135,0.000042847907,0.00022468797,0.00033430595,0.00020760427,0.00006159364,0.0002947889,0.9860133,0.00740635,0.00015357236],"about_ca_topic_score_codex":0.0000048101992,"about_ca_topic_score_gemma":0.0000044479702,"teacher_disagreement_score":0.017297188,"about_ca_system_score_codex":0.0001644078,"about_ca_system_score_gemma":0.000196355,"threshold_uncertainty_score":0.693374},"labels":[],"label_agreement":null},{"id":"W2999823167","doi":"10.37236/1990","title":"Pan-Factorial Property in Regular Graphs","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Combinatorics; Property (philosophy); Graph; Enhanced Data Rates for GSM Evolution; Factorial; Strongly regular graph; Order (exchange); Discrete mathematics; Line graph; Pathwidth; Computer science","score_opus":0.004129565124336749,"score_gpt":0.1804684884641493,"score_spread":0.17633892333981258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999823167","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.987793,0.006876597,0.00096571515,0.00022406023,0.0017104967,0.00014824618,4.027288e-7,0.000046179015,0.0022352897],"genre_scores_gemma":[0.9988361,0.00065452006,0.000002412042,0.000013460652,0.00027528728,0.0000029517003,2.4366864e-7,0.000023002634,0.0001919978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.00011735459,0.00042022005,0.000059714177,0.00026741117,0.00044644257],"domain_scores_gemma":[0.99952924,0.00006057886,0.000107146145,0.00019321518,0.000063129286,0.000046665453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011896541,0.000135766,0.00023805522,0.00013381528,0.000049276237,0.000024289218,0.00040559637,0.00007649843,0.000008837285],"category_scores_gemma":[0.000025751684,0.00007595114,0.000117592,0.0003981505,0.000029584673,0.00018747483,0.0000125071465,0.0007522146,0.000008802823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083491155,0.000101585465,0.00038686994,0.000023762635,0.000121348094,0.000009561955,0.00073189795,0.0031291998,0.0030838512,0.988108,0.0012064342,0.0030140406],"study_design_scores_gemma":[0.0016659708,0.00035545958,0.00032263267,0.00006093523,0.000040758692,0.00020969016,0.00016124306,0.00068020064,0.0066268,0.90946,0.08017824,0.00023808857],"about_ca_topic_score_codex":0.0000041554795,"about_ca_topic_score_gemma":0.000015053844,"teacher_disagreement_score":0.0789718,"about_ca_system_score_codex":0.00028950782,"about_ca_system_score_gemma":0.00008964848,"threshold_uncertainty_score":0.32680398},"labels":[],"label_agreement":null},{"id":"W2999855170","doi":"10.37236/766","title":"Codes from Cubic Curves and their Extensions","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"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 Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Code (set theory); Prime (order theory); Linear code; Combinatorics; Plane curve; Range (aeronautics); Plane (geometry); Discrete mathematics; Pure mathematics; Block code; Algorithm; Geometry; Computer science; Set (abstract data type); Decoding methods","score_opus":0.010323897206391932,"score_gpt":0.1986178620096991,"score_spread":0.18829396480330718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999855170","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.7550561,0.06016622,0.18114565,0.002783792,0.00041304898,0.00006860376,9.825524e-7,0.000040134757,0.00032551456],"genre_scores_gemma":[0.9856695,0.013852923,0.000061028924,0.00033050182,0.000047324655,8.177406e-7,2.0919674e-7,0.0000059741474,0.000031732303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989718,0.00018675513,0.00022737077,0.00010954277,0.00020370478,0.00030079964],"domain_scores_gemma":[0.9987663,0.00048901193,0.00020345087,0.00033044693,0.00013985693,0.00007090285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074207666,0.00011598555,0.00021156645,0.000077505734,0.00030091175,0.000033183966,0.00088065566,0.000031401283,0.0000044900817],"category_scores_gemma":[0.000060808456,0.000068249414,0.000111018744,0.00039859893,0.00012045561,0.00024309797,0.000122109,0.00047542536,0.000002079316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014600379,0.0000711866,0.00027078364,0.0000033156755,0.000070156304,0.000011520552,0.00074134103,0.0000042302668,0.00059051614,0.995828,0.0010120383,0.0013823112],"study_design_scores_gemma":[0.0003287035,0.00033040644,0.0015130201,0.000058130365,0.000019225303,0.00057221856,0.00004923074,0.0002984586,0.0015154694,0.9919212,0.0032949506,0.000099006866],"about_ca_topic_score_codex":0.000004539766,"about_ca_topic_score_gemma":0.0000016879645,"teacher_disagreement_score":0.23061343,"about_ca_system_score_codex":0.000034004734,"about_ca_system_score_gemma":0.0001898688,"threshold_uncertainty_score":0.27831304},"labels":[],"label_agreement":null},{"id":"W2999935146","doi":"10.37236/1973","title":"Extending Arcs: An Elementary Proof","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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 New Brunswick","funders":"","keywords":"Mathematical proof; Mathematics; Combinatorial proof; Elementary proof; Projective plane; Combinatorics; Plane (geometry); Direct proof; Projective test; Discrete mathematics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.004973517383678192,"score_gpt":0.20796259034543835,"score_spread":0.20298907296176016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999935146","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.9801521,0.0105368765,0.0067452374,0.00019454549,0.00068344903,0.00012284092,6.410025e-7,0.000055762415,0.001508567],"genre_scores_gemma":[0.9991104,0.00040378832,0.000012023926,0.000036062935,0.00032258563,0.0000028904176,6.7636404e-7,0.000026916005,0.00008466748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877346,0.00009999102,0.0003665842,0.000058900325,0.00025222474,0.00044881794],"domain_scores_gemma":[0.9995025,0.00004817761,0.00011760782,0.00020139069,0.00005656007,0.00007376177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012159399,0.0001278699,0.00018153503,0.000096345895,0.00009570862,0.000029636036,0.0004345555,0.00004015865,0.000029622246],"category_scores_gemma":[0.0000089109335,0.00009102288,0.00009183732,0.00021205164,0.00002376866,0.00030264704,0.000013356117,0.00057480787,0.000007728187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045458968,0.0001454507,0.00022547126,0.00003178192,0.00024387975,0.000009282073,0.00086735457,0.008260877,0.0048155226,0.97219026,0.0009531429,0.0122114895],"study_design_scores_gemma":[0.0015715865,0.0011782947,0.00026898374,0.00008341991,0.00014483741,0.00090459635,0.00094157003,0.0065638945,0.032592807,0.874192,0.081138305,0.00041968178],"about_ca_topic_score_codex":9.15811e-7,"about_ca_topic_score_gemma":0.0000049095875,"teacher_disagreement_score":0.09799826,"about_ca_system_score_codex":0.0002714966,"about_ca_system_score_gemma":0.000056831923,"threshold_uncertainty_score":0.3711805},"labels":[],"label_agreement":null},{"id":"W3000054795","doi":"10.37236/1742","title":"A Note on the Edge-Connectivity of Cages","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Cage; Discrete mathematics","score_opus":0.010755351900277177,"score_gpt":0.22938730937232962,"score_spread":0.21863195747205244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000054795","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.3896498,0.0024729683,0.5900436,0.0046647647,0.0035800664,0.00023700455,3.096227e-7,0.000023255503,0.009328235],"genre_scores_gemma":[0.9993997,0.00011981185,0.00001088288,0.00015302471,0.000077970435,0.0000018555935,1.6591127e-8,0.000006749786,0.00022998083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982379,0.0005861022,0.00036157685,0.00009610029,0.00038093544,0.0003373882],"domain_scores_gemma":[0.9978416,0.00091650645,0.00049440813,0.0004367859,0.00027465337,0.00003606606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003330424,0.000110028064,0.00022556787,0.00006817343,0.0001726671,0.00005398501,0.0009683084,0.000047544934,0.0000069855496],"category_scores_gemma":[0.00028792236,0.00005553161,0.00016219291,0.00045623299,0.000043969747,0.00014097635,0.000037244306,0.00064448116,0.000005005463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010638774,0.00006951924,0.000045888482,0.000002771491,0.000039429153,0.0000020214925,0.0004058392,0.0002645026,0.00013407803,0.9975844,0.00104578,0.00039512865],"study_design_scores_gemma":[0.0006725914,0.001520547,0.00024369502,0.00006570959,0.000025450447,0.00044402492,0.00016573654,0.0035017456,0.013196499,0.9581319,0.021879924,0.00015216049],"about_ca_topic_score_codex":0.0000076188585,"about_ca_topic_score_gemma":0.0000069419034,"teacher_disagreement_score":0.6097499,"about_ca_system_score_codex":0.00018070028,"about_ca_system_score_gemma":0.00032094447,"threshold_uncertainty_score":0.27999857},"labels":[],"label_agreement":null},{"id":"W3000117337","doi":"10.37236/1155","title":"The Induced Subgraph Order on Unlabelled Graphs","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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","keywords":"Partially ordered set; Mathematics; Combinatorics; Induced subgraph; Rank (graph theory); Enumeration; Order (exchange); Discrete mathematics; Graph","score_opus":0.015283403699793236,"score_gpt":0.27627523320467323,"score_spread":0.26099182950488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000117337","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.9820688,0.0019865953,0.006653299,0.0026668636,0.002453702,0.00059614336,8.4368025e-7,0.00008834624,0.0034854528],"genre_scores_gemma":[0.9984757,0.00039456572,0.00009370512,0.000054264612,0.0002089338,0.000011582194,3.720726e-7,0.0000725836,0.000688327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996495,0.0003362947,0.001020089,0.0001612578,0.0010650742,0.0009222896],"domain_scores_gemma":[0.99386,0.0032898558,0.0012448144,0.00078405376,0.0007426732,0.000078586905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025265808,0.0003407812,0.0005047092,0.00015880649,0.00065087917,0.00009779769,0.0012973123,0.00013715182,0.0000074083578],"category_scores_gemma":[0.0011687287,0.0001834049,0.00028143064,0.001226083,0.00013753283,0.00013594718,0.000083987055,0.0015414923,0.000012940218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011177322,0.00037264518,0.00003148349,0.000012557585,0.00012781935,0.0000074616696,0.00009595768,0.00002413001,0.0003166814,0.99561274,0.0031360392,0.00015069694],"study_design_scores_gemma":[0.0016404557,0.0008906781,0.0000365435,0.00004493452,0.00013236621,0.00009879202,0.00013848893,0.00003365464,0.0025458932,0.9902375,0.0039901948,0.0002105226],"about_ca_topic_score_codex":0.0000072464713,"about_ca_topic_score_gemma":0.0000181514,"teacher_disagreement_score":0.016406912,"about_ca_system_score_codex":0.00040257588,"about_ca_system_score_gemma":0.00042027506,"threshold_uncertainty_score":0.74790347},"labels":[],"label_agreement":null},{"id":"W3000216555","doi":"10.37236/478","title":"A Classification of Ramanujan Unitary Cayley Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University","keywords":"Mathematics; Combinatorics; Cayley graph; Ramanujan's sum; Vertex (graph theory); Multiplicative function; Modulo; Graph; Discrete mathematics","score_opus":0.018746582183908244,"score_gpt":0.2853144750696924,"score_spread":0.26656789288578414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000216555","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.99538976,0.00023303245,0.0019411158,0.0007967799,0.00021654773,0.00013382845,0.0000013015015,0.000013479251,0.0012741603],"genre_scores_gemma":[0.99960095,0.00012309158,0.000078941935,0.00001913704,0.000040271694,0.0000047049803,8.665768e-7,0.00001542624,0.000116635856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882376,0.000121304794,0.00046519644,0.00006905631,0.00026840725,0.00025225666],"domain_scores_gemma":[0.9980254,0.00052779773,0.0006430916,0.00041737038,0.0003332171,0.000053080905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017510569,0.000103261205,0.00021199753,0.00012608262,0.0001255943,0.0000111986155,0.00057752844,0.000075355274,0.000020563266],"category_scores_gemma":[0.00023052485,0.00007034695,0.00015127471,0.00048625408,0.00013495651,0.000086923435,0.000023526187,0.0009532086,0.000002813979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002674974,0.00022580802,0.00023990839,0.00001234067,0.000061320374,4.6526546e-7,0.00024474625,9.073415e-7,0.015337163,0.9832911,0.00033262963,0.00022685132],"study_design_scores_gemma":[0.00038209718,0.00017193967,0.00096111366,0.0000112365,0.00010506858,0.00008374623,0.00023507256,0.000022267648,0.0053874566,0.99100655,0.0015638976,0.00006954578],"about_ca_topic_score_codex":0.0000028078255,"about_ca_topic_score_gemma":0.000012224112,"teacher_disagreement_score":0.0099497065,"about_ca_system_score_codex":0.00003559921,"about_ca_system_score_gemma":0.00021130775,"threshold_uncertainty_score":0.414127},"labels":[],"label_agreement":null},{"id":"W3000238327","doi":"10.37236/7874","title":"The Chromatic Number of Finite Group Cayley Tables","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Abelian group; Conjecture; Upper and lower bounds; Group (periodic table); Chromatic scale; Finite group; Sylow theorems; Cover (algebra); Discrete mathematics; Physics","score_opus":0.0023096900750067158,"score_gpt":0.1815914334554968,"score_spread":0.17928174338049008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000238327","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.986838,0.0072911363,0.0011253187,0.000057719815,0.0011235314,0.00012379659,8.083913e-7,0.000019139577,0.0034205944],"genre_scores_gemma":[0.99866605,0.0009259272,0.0000016696833,0.0000073175233,0.00004960896,0.0000021190017,3.3526322e-7,0.00002204503,0.00032495055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875766,0.00012400963,0.0004263505,0.000044664783,0.00027894936,0.00036835403],"domain_scores_gemma":[0.9988609,0.0005047468,0.00023137523,0.00028576617,0.00008300181,0.00003424323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013723279,0.000118240794,0.00024910574,0.00003627762,0.00008301215,0.000026256537,0.0005206285,0.00004948464,0.00003226001],"category_scores_gemma":[0.000035137713,0.00006571474,0.00013318814,0.00028660247,0.0000436806,0.00010102095,0.000019544468,0.00046976563,0.000033487737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028094606,0.000033698016,0.0010118354,0.00007999781,0.0002467873,0.0000015690229,0.00036999298,0.0020841083,0.0015845379,0.99394643,0.0003879774,0.000224989],"study_design_scores_gemma":[0.0010708659,0.00037970583,0.0006000879,0.00015762355,0.000102254315,0.00029000296,0.00067222357,0.0029864667,0.0033755242,0.97261477,0.017547466,0.00020302771],"about_ca_topic_score_codex":0.000003876204,"about_ca_topic_score_gemma":0.0000035023445,"teacher_disagreement_score":0.02133166,"about_ca_system_score_codex":0.00010206101,"about_ca_system_score_gemma":0.000059971462,"threshold_uncertainty_score":0.26797694},"labels":[],"label_agreement":null},{"id":"W3000349095","doi":"10.37236/909","title":"For each $\\alpha > 2$ there is an Infinite Binary Word with Critical Exponent $\\alpha$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Infimum and supremum; Exponent; Mathematics; Alpha (finance); Combinatorics; Word (group theory); Binary number; Critical exponent; Discrete mathematics; Arithmetic; Statistics; Geometry","score_opus":0.019762076447317534,"score_gpt":0.25544231610733475,"score_spread":0.23568023966001722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000349095","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.7132585,0.0063607353,0.27470046,0.0045740767,0.000567938,0.00022206621,0.000001990618,0.00007657329,0.0002376865],"genre_scores_gemma":[0.9974561,0.0006969534,0.0007913649,0.00062385807,0.00017779312,0.000010762042,8.543878e-7,0.000032589112,0.00020977689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753684,0.00021938917,0.00048670653,0.00025178722,0.0006583589,0.0008469371],"domain_scores_gemma":[0.9978097,0.00060516095,0.00032765613,0.0006801068,0.00039997153,0.00017740941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014027131,0.00025647995,0.0003747897,0.00014852604,0.00046358927,0.00011782642,0.0018905106,0.00008901354,0.000011964766],"category_scores_gemma":[0.00007870525,0.00015864136,0.00017988979,0.0005283744,0.00018100624,0.00083255675,0.00012527478,0.000724128,0.000008643049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024596,0.0005969151,0.0002507167,0.000018849985,0.0001222469,0.000112556314,0.002050286,0.00003459122,0.0005958565,0.99094546,0.0021898642,0.002836725],"study_design_scores_gemma":[0.0032190722,0.007921333,0.0019884033,0.00011280938,0.00010281046,0.0036949757,0.00040843798,0.011699282,0.0041714935,0.9488877,0.017220654,0.0005730269],"about_ca_topic_score_codex":0.0000035988007,"about_ca_topic_score_gemma":0.0000011964332,"teacher_disagreement_score":0.28419757,"about_ca_system_score_codex":0.00020580324,"about_ca_system_score_gemma":0.00067226996,"threshold_uncertainty_score":0.6469207},"labels":[],"label_agreement":null},{"id":"W3000378593","doi":"10.37236/8498","title":"Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Fundamental Research Funds for the Central Universities; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory)","score_opus":0.013398487517632509,"score_gpt":0.26743787978295636,"score_spread":0.25403939226532385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000378593","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.9982899,0.0003054402,0.0005236687,0.00028133558,0.00019435037,0.00017910771,0.0000048081324,0.000012913004,0.00020851403],"genre_scores_gemma":[0.999708,0.00016278616,0.000004056858,0.000020312316,0.000007526237,0.000002497823,0.000004937039,0.000013875465,0.000076021235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989071,0.00012568301,0.0003646906,0.00008998681,0.00022834736,0.00028423202],"domain_scores_gemma":[0.99835026,0.0009979816,0.0003152012,0.00017968527,0.00009910223,0.00005778988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051477,0.00013609648,0.0002559565,0.00016147853,0.00013111097,0.000022052543,0.00023492951,0.00006769458,0.000067122026],"category_scores_gemma":[0.000065495435,0.0000893108,0.000103929655,0.0003436517,0.00006034396,0.00014260045,0.000024924086,0.00072130415,0.000004767674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023388935,0.00020540551,0.019869424,0.000007795459,0.00007346329,6.375666e-7,0.00031174143,0.000008658869,0.00086024555,0.97849923,0.00013549546,0.000004509405],"study_design_scores_gemma":[0.000660742,0.00019773695,0.021322517,0.000023092107,0.00004642731,0.0000420417,0.00045569157,0.00006315003,0.0003918741,0.9761884,0.000512404,0.00009588291],"about_ca_topic_score_codex":0.000007365856,"about_ca_topic_score_gemma":0.000006840129,"teacher_disagreement_score":0.0023107931,"about_ca_system_score_codex":0.00012640195,"about_ca_system_score_gemma":0.00010777424,"threshold_uncertainty_score":0.36419886},"labels":[],"label_agreement":null},{"id":"W3000454462","doi":"10.37236/284","title":"The Planarity Theorems of MacLane and Whitney for Graph-like Continua","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"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","keywords":"Mathematics; Planarity testing; Disjoint sets; Combinatorics; Compactification (mathematics); Discrete mathematics; Graph; Pure mathematics","score_opus":0.006040515383384084,"score_gpt":0.2553896335600363,"score_spread":0.24934911817665223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000454462","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.5113861,0.007726049,0.47081366,0.006664893,0.0019693004,0.00070192467,0.0000050319654,0.00003507227,0.0006979787],"genre_scores_gemma":[0.99873656,0.00080682395,0.00019384653,0.00004397969,0.00004788189,0.0000049103387,2.1513198e-7,0.000010524388,0.0001552339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983398,0.00018027067,0.00036174577,0.00012642836,0.0004316668,0.0005601199],"domain_scores_gemma":[0.9968428,0.0016651349,0.00042651064,0.0005254302,0.00045244474,0.000087699875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043154256,0.00012289999,0.000234911,0.00009324431,0.00034252065,0.000085730535,0.0018942201,0.00006103768,0.0000012873893],"category_scores_gemma":[0.00030742685,0.00006593671,0.000119654374,0.00040237626,0.0003879684,0.0002149063,0.00014912218,0.0010548937,4.315733e-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.00011389444,0.000041430805,0.00020995802,0.000006451133,0.000056575067,0.0000013917772,0.00017407558,0.0000041637395,0.001900843,0.9941102,0.00023309323,0.0031479232],"study_design_scores_gemma":[0.0007738706,0.00065235596,0.00026119244,0.0000074447557,0.00001576706,0.00017212048,0.000058337635,0.0005238566,0.0033579431,0.98626155,0.00783915,0.000076396536],"about_ca_topic_score_codex":0.0000032894188,"about_ca_topic_score_gemma":0.0000258106,"teacher_disagreement_score":0.4873505,"about_ca_system_score_codex":0.000032376673,"about_ca_system_score_gemma":0.00029150513,"threshold_uncertainty_score":0.4583047},"labels":[],"label_agreement":null},{"id":"W3000656034","doi":"10.37236/8251","title":"Uniform Generation of Spanning Regular Subgraphs of a Dense Graph","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Degree (music); Graph; Discrete mathematics; Distribution (mathematics)","score_opus":0.02018908723099646,"score_gpt":0.25973158636619137,"score_spread":0.2395424991351949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000656034","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.9927351,0.0028908704,0.0031631116,0.000060689556,0.0004465828,0.00014363736,8.934572e-7,0.000006021514,0.0005530838],"genre_scores_gemma":[0.99907863,0.0005702092,0.00013868642,0.000014836887,0.000054260447,6.1238495e-7,4.1260776e-7,0.000020434187,0.00012188749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826676,0.00015832922,0.0006959303,0.00008058172,0.00049463724,0.00030376855],"domain_scores_gemma":[0.99769974,0.00029880585,0.0011326484,0.0003993461,0.00043188903,0.000037558402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019410145,0.00013830797,0.00043154735,0.00022114464,0.000085399144,0.000008794582,0.00046804806,0.00008848896,0.000018230296],"category_scores_gemma":[0.00016214662,0.00008839486,0.00027849196,0.00043974526,0.00009880817,0.00010787819,0.000052552165,0.00046490278,3.5746407e-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.00008412957,0.000070619615,0.0008367376,0.00006408332,0.0001997174,0.0000013931187,0.0008829971,0.00007396445,0.0065838806,0.9909113,0.00013840554,0.00015279281],"study_design_scores_gemma":[0.0007696945,0.0006516956,0.00020858253,0.00006861804,0.00013683354,0.00009470994,0.0002399108,0.00012784003,0.02941887,0.96806353,0.00012997762,0.00008972543],"about_ca_topic_score_codex":0.0000032862326,"about_ca_topic_score_gemma":0.0000021155959,"teacher_disagreement_score":0.022847738,"about_ca_system_score_codex":0.00007255201,"about_ca_system_score_gemma":0.00017927439,"threshold_uncertainty_score":0.36046377},"labels":[],"label_agreement":null},{"id":"W3000691650","doi":"10.37236/765","title":"Induced Trees in Triangle-Free Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.03444147800655427,"score_gpt":0.27377389937797797,"score_spread":0.2393324213714237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000691650","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.99485683,0.002036881,0.00023940924,0.00041828968,0.000531036,0.00012869669,5.610479e-7,0.000015496058,0.0017727952],"genre_scores_gemma":[0.99874204,0.00087324675,0.000029121638,0.000061947394,0.000085948624,0.000002212625,1.3339947e-7,0.00002491858,0.00018045174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799407,0.0002884718,0.0006284396,0.000096897784,0.00047871,0.0005134451],"domain_scores_gemma":[0.9980728,0.0007491519,0.00047927778,0.00049691997,0.00014002669,0.000061806844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017441025,0.00017401086,0.00044197458,0.00027081973,0.00023160539,0.00001226167,0.0010568107,0.000107112,0.000016328624],"category_scores_gemma":[0.00082053745,0.00010621951,0.00024330588,0.00061648554,0.000102553815,0.00012483477,0.00010037962,0.0011024192,8.814928e-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.00012273509,0.00013349907,0.0006962824,0.0000054516254,0.000080974554,0.000039008257,0.0013765616,0.000003388613,0.00016008203,0.9963245,0.00083361065,0.0002238979],"study_design_scores_gemma":[0.0023568638,0.00048468277,0.0015736072,0.000023079076,0.000043848748,0.0005989355,0.00016197725,0.000006958708,0.00090469734,0.993211,0.0005105584,0.00012384224],"about_ca_topic_score_codex":0.000005940302,"about_ca_topic_score_gemma":0.000021773138,"teacher_disagreement_score":0.003885184,"about_ca_system_score_codex":0.00018757027,"about_ca_system_score_gemma":0.00028115395,"threshold_uncertainty_score":0.4789524},"labels":[],"label_agreement":null},{"id":"W3005922675","doi":"10.37236/9376","title":"On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"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":"Digraph; Traverse; Orientation (vector space); Combinatorics; Mathematics; Hamiltonian path; Geometry; Geodesy; Geography; Graph","score_opus":0.02509770828158007,"score_gpt":0.26708230116877113,"score_spread":0.24198459288719107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005922675","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.9906338,0.0027977852,0.003781131,0.0012500957,0.00034087058,0.00049190817,0.0000054418806,0.000012299016,0.000686664],"genre_scores_gemma":[0.9982779,0.0014135351,0.00001892618,0.00014640686,0.000066713954,0.000013070421,6.161844e-7,0.000041612595,0.000021242868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712676,0.0006018895,0.00081888423,0.0002010119,0.0008022788,0.00044919434],"domain_scores_gemma":[0.9956568,0.0019267856,0.0014641581,0.00069342804,0.00020228732,0.00005653571],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019816575,0.00035118562,0.0008625977,0.00017535912,0.00015375711,0.000049378392,0.0015553592,0.00016389698,0.000011784381],"category_scores_gemma":[0.00039965313,0.00016118992,0.00037670578,0.00034904183,0.0002916432,0.00003906865,0.00024145425,0.003154273,3.9063184e-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.00083387474,0.00014412004,0.0003797796,0.00018236134,0.00035763424,0.000026453328,0.006676276,0.00009160012,0.000021407242,0.99094385,0.000117840726,0.00022479625],"study_design_scores_gemma":[0.0017850682,0.0007942002,0.00040361972,0.0006452558,0.00019637033,0.00008601769,0.00048513623,0.00009611076,0.0003419526,0.9949054,0.00007919614,0.00018163375],"about_ca_topic_score_codex":0.000014433156,"about_ca_topic_score_gemma":0.000022826835,"teacher_disagreement_score":0.0076440712,"about_ca_system_score_codex":0.00017900065,"about_ca_system_score_gemma":0.00053526455,"threshold_uncertainty_score":0.9991455},"labels":[],"label_agreement":null},{"id":"W3008717233","doi":"10.37236/9489","title":"Transversals and Bipancyclicity in Bipartite Graph Families","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Degree (music); Graph; Discrete mathematics; Complete bipartite graph; Physics","score_opus":0.01907249066705321,"score_gpt":0.2805400169020348,"score_spread":0.2614675262349816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008717233","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.975247,0.021035729,0.0017451638,0.00039288236,0.0009321242,0.00020126985,0.000003934613,0.000014645918,0.0004272448],"genre_scores_gemma":[0.97854143,0.021187125,0.00005567688,0.00005633855,0.00008815336,0.0000047791173,9.906025e-7,0.000034475186,0.000031022544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744314,0.00048096568,0.0008303843,0.00021031221,0.00047796272,0.0005572206],"domain_scores_gemma":[0.9978026,0.0007293406,0.00069966435,0.0004843153,0.00020919825,0.000074868934],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002203643,0.00031903604,0.0008150992,0.00030292795,0.0001487168,0.00007750848,0.00069177354,0.00028741345,0.000012378074],"category_scores_gemma":[0.00031209877,0.00021486093,0.00032791702,0.00038298982,0.00018350875,0.0000968192,0.00032195103,0.0027940099,1.2188582e-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.0000774985,0.00013590683,0.001181623,0.00021910347,0.0003425532,0.000033005974,0.0055916305,0.00003754642,0.000120286386,0.99178773,0.00009350482,0.00037959806],"study_design_scores_gemma":[0.00073683733,0.00014184433,0.0007517683,0.00024497198,0.00021709118,0.00012966525,0.0009025433,0.000029968784,0.0011516415,0.995227,0.00024949852,0.00021721113],"about_ca_topic_score_codex":0.000020155247,"about_ca_topic_score_gemma":0.000071035276,"teacher_disagreement_score":0.004689087,"about_ca_system_score_codex":0.00018247023,"about_ca_system_score_gemma":0.00039793865,"threshold_uncertainty_score":0.9995066},"labels":[],"label_agreement":null},{"id":"W3010722852","doi":"10.37236/9448","title":"Cooperative Conditions for the Existence of Rainbow Matchings","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Kootenay Association for Science & Technology","funders":"Institute for Basic Science; Israel Science Foundation; National Research Foundation of Korea; National Research Foundation; Ministry of Science and ICT, South Korea; European Commission","keywords":"Rainbow; Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Simple (philosophy); Graph; Discrete mathematics; Physics","score_opus":0.015961273720455953,"score_gpt":0.29370876417904584,"score_spread":0.2777474904585899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010722852","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.050138526,0.005129469,0.9334713,0.00959394,0.0007013155,0.0006257259,0.000011894888,0.00002053511,0.00030728793],"genre_scores_gemma":[0.9990423,0.00017687757,0.0001362956,0.0001606915,0.000024755025,0.000037880614,4.465746e-7,0.000009155058,0.0004116246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823284,0.0003474178,0.00032234305,0.000104224586,0.0005901972,0.00040297068],"domain_scores_gemma":[0.99680376,0.0018797234,0.000413524,0.00040348424,0.000460334,0.000039189046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030059463,0.000091034206,0.00018570639,0.00009731125,0.0008329567,0.000039321403,0.0025585599,0.000014521196,0.000013528596],"category_scores_gemma":[0.00020920721,0.00005395859,0.00014655452,0.0008263916,0.00017248547,0.00023833127,0.00031157676,0.000826085,7.0984476e-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.00005053569,0.00007234121,0.000008808836,0.00000378968,0.000067515335,0.0000019093209,0.0009812118,0.0021761546,0.0006792202,0.9951344,0.00048121216,0.00034287205],"study_design_scores_gemma":[0.00059871294,0.0011050777,0.000036486712,0.000005327309,0.000017806064,0.00019014318,0.00067722815,0.0038880573,0.001643803,0.98596936,0.0058034984,0.0000644711],"about_ca_topic_score_codex":0.0000022297477,"about_ca_topic_score_gemma":8.7003326e-7,"teacher_disagreement_score":0.94890374,"about_ca_system_score_codex":0.00023458553,"about_ca_system_score_gemma":0.00067068374,"threshold_uncertainty_score":0.64065135},"labels":[],"label_agreement":null},{"id":"W3010904431","doi":"10.37236/9008","title":"Maximal Arcs, Codes, and New Links Between Projective Planes of Order 16","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Projective plane; Conjecture; Upper and lower bounds; Order (exchange); Incidence (geometry); Finite geometry; Binary code; Discrete mathematics; Minimum distance; Rank (graph theory); Dual (grammatical number); Binary number; Geometry; Arithmetic","score_opus":0.013515703878677104,"score_gpt":0.2035715332085311,"score_spread":0.19005582932985401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010904431","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.96884686,0.012688628,0.016168702,0.0007025227,0.00027446373,0.00020118477,0.0000060826546,0.000044267093,0.001067271],"genre_scores_gemma":[0.9992621,0.00047769962,0.000008056229,0.000022206263,0.00017541955,7.166443e-7,0.0000010764146,0.000019174428,0.000033572443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990581,0.00008110586,0.00033332093,0.00006377706,0.00019539558,0.0002682593],"domain_scores_gemma":[0.9994264,0.00013963091,0.0001583001,0.00009144407,0.00008819864,0.0000959874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042473737,0.0001261752,0.000322682,0.000053339343,0.000040348954,0.000015553725,0.00025070092,0.00009604946,0.0000059117647],"category_scores_gemma":[0.00004532368,0.00008938891,0.00005989037,0.0002966183,0.00004121361,0.00007848848,0.00002112556,0.00083620514,0.000001514735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043635594,0.00008199651,0.009327816,0.00041231827,0.0017049168,0.00001890434,0.007656882,0.001603337,0.0028599517,0.96626675,0.00424627,0.005384529],"study_design_scores_gemma":[0.0035852974,0.0032840094,0.0029155323,0.00018598471,0.00046733292,0.0003603451,0.001576244,0.001072497,0.018959368,0.9432924,0.023765426,0.00053558435],"about_ca_topic_score_codex":0.000010433079,"about_ca_topic_score_gemma":0.0000028142629,"teacher_disagreement_score":0.030415202,"about_ca_system_score_codex":0.00006805799,"about_ca_system_score_gemma":0.00015830247,"threshold_uncertainty_score":0.3645174},"labels":[],"label_agreement":null},{"id":"W3012810501","doi":"10.37236/9456","title":"On the Intersection Distribution of Degree Three Polynomials and Related Topics","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences; Universität Rostock; Pacific Institute for the Mathematical Sciences; Alexander von Humboldt-Stiftung","keywords":"Monomial; Conjecture; Intersection (aeronautics); Mathematics; Combinatorics; Degree (music); Affine transformation; Distribution (mathematics); Polynomial; Complete intersection; Interpretation (philosophy); Affine space; Field (mathematics); Discrete mathematics; Pure mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.014862534747300586,"score_gpt":0.22313194988496887,"score_spread":0.20826941513766828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012810501","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.7784591,0.0034218687,0.21296677,0.003003568,0.0016682814,0.00014049775,0.000001344473,0.000015762498,0.00032280097],"genre_scores_gemma":[0.9992887,0.00057401194,0.000012865805,0.0000352556,0.000055576413,0.000002246131,0.0000016706903,0.0000068149643,0.000022857794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838114,0.00039122012,0.00047815533,0.00016275926,0.0003337623,0.0002529716],"domain_scores_gemma":[0.99783623,0.00046627503,0.0008224858,0.0005743912,0.00026423493,0.000036364327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021996247,0.0001661876,0.00030461344,0.00006954079,0.00015117021,0.00012515344,0.0011717533,0.00014657591,0.000005063825],"category_scores_gemma":[0.00021060396,0.00009974375,0.0002514315,0.00038838168,0.0000996108,0.00010402039,0.0004811023,0.0016102326,3.6493373e-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.00003730944,0.000063501655,0.000049693183,0.000013977539,0.0001715225,0.0000034355198,0.00039016525,0.00008028186,0.000065443666,0.9941017,0.000110272296,0.0049126805],"study_design_scores_gemma":[0.00025411183,0.00050538516,0.001280297,0.00015962738,0.000075802855,0.00012450524,0.00007466409,0.0008438534,0.0012130769,0.99522126,0.00014790283,0.00009954424],"about_ca_topic_score_codex":0.000007727947,"about_ca_topic_score_gemma":0.000006926341,"teacher_disagreement_score":0.2208296,"about_ca_system_score_codex":0.00022492393,"about_ca_system_score_gemma":0.0003863932,"threshold_uncertainty_score":0.6995749},"labels":[],"label_agreement":null},{"id":"W3012954974","doi":"10.37236/9536","title":"The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Korea Advanced Institute of Science and Technology; Institute for Basic Science; POSCO TJ Park Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Minor (academic); Discrete mathematics; Integer (computer science); Disjoint sets; Graph; Computer science","score_opus":0.010092850023676879,"score_gpt":0.2584122330902902,"score_spread":0.24831938306661333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012954974","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.9710328,0.007413957,0.005581177,0.00434258,0.0019327872,0.00090368045,0.0000059484423,0.000053629923,0.00873342],"genre_scores_gemma":[0.99515444,0.00061059656,0.00018979152,0.00017866296,0.00016964733,0.000015747746,6.7252296e-7,0.00004448467,0.0036359625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979065,0.00024024826,0.00047849468,0.0001471343,0.00055078004,0.0006768402],"domain_scores_gemma":[0.99671185,0.0012908991,0.0005050284,0.00049703935,0.00090916565,0.00008602759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016110385,0.0002189044,0.00035087403,0.000048481084,0.0008795031,0.00009995105,0.0007522828,0.00008132831,0.000022581402],"category_scores_gemma":[0.0007542547,0.000084783984,0.0002834855,0.00034182484,0.00017907644,0.0001040661,0.00009004986,0.0008065835,0.0000024296007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005092444,0.000120348566,0.000044363518,0.000031886855,0.0003817262,0.000015300535,0.0005924239,0.000006032087,0.00015458207,0.9949289,0.002528782,0.0006864225],"study_design_scores_gemma":[0.0014863613,0.0011516991,0.000030209454,0.00004386807,0.00021472231,0.0007691977,0.00040446708,0.00006275527,0.0017725473,0.9697172,0.024191277,0.00015572041],"about_ca_topic_score_codex":0.0000029112643,"about_ca_topic_score_gemma":0.00001682856,"teacher_disagreement_score":0.025211712,"about_ca_system_score_codex":0.00016115497,"about_ca_system_score_gemma":0.0008657974,"threshold_uncertainty_score":0.67645156},"labels":[],"label_agreement":null},{"id":"W3024316797","doi":"10.37236/9617","title":"Zero-Sum Squares in Bounded Discrepancy $\\{-1,1\\}$-Matrices","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Zero (linguistics); Square matrix; Diagonal; Mathematics; Combinatorics; Matrix (chemical analysis); Square (algebra); Diagonal matrix; Bounded function; Main diagonal; Symmetric matrix; Physics; Mathematical analysis; Eigenvalues and eigenvectors; Geometry; Quantum mechanics","score_opus":0.02904234464443128,"score_gpt":0.31562764032402135,"score_spread":0.28658529567959007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024316797","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.79195863,0.010205596,0.18624093,0.004240547,0.0013352098,0.0008180372,0.00000375994,0.00006383442,0.005133439],"genre_scores_gemma":[0.9959881,0.0018110062,0.0014206939,0.00005390246,0.00012379092,0.000023068975,0.000007854793,0.00004764881,0.0005239857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964791,0.0004619361,0.0013444865,0.00022896248,0.0009164874,0.00056906044],"domain_scores_gemma":[0.99625814,0.0008670332,0.0016205974,0.0006121282,0.00055741833,0.0000846889],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002590434,0.00036144807,0.0009039425,0.00026234845,0.00009981665,0.00027397042,0.00095158356,0.00030036533,0.000085038395],"category_scores_gemma":[0.0015870893,0.00023390347,0.00041987406,0.00049011194,0.00006915439,0.00021497703,0.00027744938,0.0027479664,0.0000053741132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003254251,0.0004804045,0.0000368818,0.0003958241,0.00012946177,0.000012125698,0.001306702,0.000010602787,0.000024647705,0.9963061,0.0009563649,0.00030833777],"study_design_scores_gemma":[0.00060381443,0.00018016035,0.00003096649,0.0006488033,0.00015551643,0.00009060247,0.0006453599,0.0011577342,0.000735568,0.9948504,0.0006645116,0.00023654809],"about_ca_topic_score_codex":0.000014222346,"about_ca_topic_score_gemma":0.00006266041,"teacher_disagreement_score":0.2040294,"about_ca_system_score_codex":0.00074533874,"about_ca_system_score_gemma":0.0011421094,"threshold_uncertainty_score":0.9995527},"labels":[],"label_agreement":null},{"id":"W3036334018","doi":"10.37236/9659","title":"Tight Bounds on the Clique Chromatic Number","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"Fonds De La Recherche Scientifique - FNRS; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Mathematics; Clique number; Monochromatic color; Corollary; Chromatic scale; Vertex (graph theory); Clique; Graph; Clique graph; Discrete mathematics; Simplex graph; Graph power; Physics; Line graph","score_opus":0.01911237087500364,"score_gpt":0.2870108141828546,"score_spread":0.267898443307851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036334018","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.9730081,0.001576064,0.0012505223,0.004854166,0.0010935161,0.00013511951,8.678287e-7,0.000020690248,0.018060984],"genre_scores_gemma":[0.99718064,0.0005038989,0.000026578131,0.00058545795,0.00020587032,0.000002745921,2.7107419e-7,0.00002942767,0.0014650865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979254,0.0005025543,0.00047338463,0.00009858471,0.0005439436,0.00045613636],"domain_scores_gemma":[0.996877,0.0017898254,0.0004406484,0.00056107756,0.00027740307,0.000054020198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972721,0.00017535321,0.00030708272,0.00003577996,0.00045370567,0.00006766563,0.00068737013,0.00008674655,0.00023300198],"category_scores_gemma":[0.0007308576,0.000083201834,0.00025621548,0.00035549636,0.00011625468,0.00006795776,0.00009178903,0.0012205455,0.000012453946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026845086,0.00010502268,0.000059523256,0.000016606991,0.00019135972,0.000021856018,0.0006609838,0.000002392994,0.000072604846,0.9930749,0.005676537,0.00009139534],"study_design_scores_gemma":[0.0003970193,0.00018596624,0.00010882044,0.000053546264,0.00010531987,0.0007137256,0.00020851953,0.000017887603,0.003061835,0.98449737,0.010544073,0.000105940046],"about_ca_topic_score_codex":6.5142746e-7,"about_ca_topic_score_gemma":0.0000023642735,"teacher_disagreement_score":0.024172593,"about_ca_system_score_codex":0.00022028659,"about_ca_system_score_gemma":0.00043542095,"threshold_uncertainty_score":0.5302731},"labels":[],"label_agreement":null},{"id":"W3036393604","doi":"10.37236/9703","title":"Extremal Overlap-Free and Extremal $\\beta$-Free Binary Words","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Word (group theory); BETA (programming language); Binary number; Combinatorics; Exponent; Mathematics; Sigma; Alphabet; Physics; Arithmetic; Geometry; Computer science; Quantum mechanics; Philosophy; Linguistics","score_opus":0.013599943502214476,"score_gpt":0.2272958911095833,"score_spread":0.21369594760736882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036393604","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.4144422,0.11589835,0.41269383,0.04468706,0.007988944,0.0009115973,0.00002660491,0.0004529725,0.0028984111],"genre_scores_gemma":[0.9946071,0.0034906357,0.0006611234,0.00041766895,0.000551427,0.000007025046,0.00000216251,0.000055776338,0.00020711067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958065,0.00047047337,0.0009500561,0.0005714802,0.001188438,0.001013047],"domain_scores_gemma":[0.995195,0.0005380585,0.0013034842,0.002419117,0.0002618265,0.00028254942],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002373688,0.0005746134,0.0009220746,0.00025721284,0.0002516809,0.00046354462,0.008755612,0.0003212414,0.000013838997],"category_scores_gemma":[0.00031691298,0.00042057823,0.00043413707,0.00059552287,0.00018428202,0.00049580255,0.006654124,0.0036815586,0.0000072198427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087984685,0.00016093883,0.00014109562,0.000090882706,0.0002832823,0.00018465237,0.00083644467,0.00008912724,0.00027660513,0.9891698,0.005512188,0.0031670013],"study_design_scores_gemma":[0.0015114665,0.0007930696,0.0006927688,0.00019169576,0.00015048032,0.00072984316,0.00011426868,0.007733838,0.00031510156,0.98435247,0.002949798,0.00046521847],"about_ca_topic_score_codex":0.000010649194,"about_ca_topic_score_gemma":0.0000033610718,"teacher_disagreement_score":0.58016485,"about_ca_system_score_codex":0.00044375128,"about_ca_system_score_gemma":0.0014420731,"threshold_uncertainty_score":0.9998246},"labels":[],"label_agreement":null},{"id":"W3038021689","doi":"10.37236/444","title":"Honeycomb Arrays","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Honeycomb; Golomb coding; Honeycomb structure; Combinatorics; Mathematics; Grid; Hexagonal crystal system; Discrete mathematics; Computer science; Geometry; Materials science; Crystallography; Composite material; Artificial intelligence","score_opus":0.003704780689912189,"score_gpt":0.20950913473386448,"score_spread":0.20580435404395228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038021689","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.16005816,0.0006897427,0.8304433,0.0055976347,0.0010245838,0.000085751264,1.9040485e-7,0.00004912617,0.0020514757],"genre_scores_gemma":[0.99917394,0.00010296592,0.00032317982,0.00009794818,0.000095659074,0.0000019095585,1.8975598e-7,0.0000066211687,0.00019757917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.000038142647,0.00023920386,0.00008413037,0.00029176747,0.0003244935],"domain_scores_gemma":[0.99890953,0.00011020326,0.00023962634,0.0005257681,0.00014751735,0.00006732926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008110355,0.00008215114,0.00012280792,0.000059847687,0.00015412184,0.000089553105,0.0017453276,0.0000402846,0.000008677941],"category_scores_gemma":[0.000037496204,0.000053993932,0.0000957767,0.00042708562,0.000041276267,0.00021978845,0.0000920144,0.0008850936,0.000027774702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012504111,0.00006299741,0.000028050974,9.652315e-7,0.0000141865985,0.0000020738137,0.00010858849,0.0000062939475,0.008830274,0.98846245,0.00074198627,0.0017408866],"study_design_scores_gemma":[0.00031763667,0.00012521286,0.00029052974,0.0000026627235,0.00001385491,0.0004181883,0.000012959355,0.001968386,0.009371169,0.92650646,0.060885496,0.000087450615],"about_ca_topic_score_codex":0.0000021245046,"about_ca_topic_score_gemma":0.0000030659362,"teacher_disagreement_score":0.8391158,"about_ca_system_score_codex":0.000047363115,"about_ca_system_score_gemma":0.0003412155,"threshold_uncertainty_score":0.38453403},"labels":[],"label_agreement":null},{"id":"W3043148448","doi":"10.37236/9725","title":"Hadamard Diagonalizable Graphs of Order at Most 36","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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 Waterloo; Ontario Tech University","funders":"National Science Foundation","keywords":"Diagonalizable matrix; Hadamard matrix; Mathematics; Hadamard transform; Hadamard three-lines theorem; Complex Hadamard matrix; Combinatorics; Hadamard's inequality; Hadamard's maximal determinant problem; Hadamard product; Laplacian matrix; Hadamard three-circle theorem; Eigenvalues and eigenvectors; Graph; Discrete mathematics; Symmetric matrix; Physics; Mathematical analysis","score_opus":0.0035089089068579857,"score_gpt":0.17306635063278916,"score_spread":0.16955744172593118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043148448","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.9747402,0.019221894,0.00134675,0.0001167168,0.001488973,0.00013271475,0.00000568704,0.000036113626,0.0029109628],"genre_scores_gemma":[0.99881524,0.00056314515,0.0000018286474,0.000025877582,0.000028815743,0.000007354265,0.0000015055919,0.000029690424,0.00052656303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984811,0.00017853241,0.00042642618,0.00006195705,0.00045183877,0.00040014758],"domain_scores_gemma":[0.9992384,0.00013410486,0.00022383177,0.00023076785,0.00012284197,0.000050099028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234182,0.00012933442,0.00027884202,0.00012644308,0.0002009209,0.000009958551,0.0005343508,0.00003299873,0.00013987451],"category_scores_gemma":[0.000023029797,0.000100890284,0.00014305236,0.0008328524,0.00004189238,0.000072229624,0.00007535211,0.0006256818,0.0000028561778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013694982,0.00011167621,0.0005555092,0.00005804142,0.0003598805,0.000012046898,0.00059935806,0.034292024,0.0026010254,0.9546999,0.0064155944,0.00015800673],"study_design_scores_gemma":[0.0011449482,0.00071518664,0.00016731338,0.00002049113,0.0001308337,0.0005334893,0.00042133682,0.0010481881,0.0046979934,0.9273659,0.0635367,0.00021759636],"about_ca_topic_score_codex":0.0000063657167,"about_ca_topic_score_gemma":0.0000054845473,"teacher_disagreement_score":0.05712111,"about_ca_system_score_codex":0.00032985242,"about_ca_system_score_gemma":0.00012982394,"threshold_uncertainty_score":0.41141865},"labels":[],"label_agreement":null},{"id":"W3044049558","doi":"10.37236/9785","title":"Chromatic Polynomials of 2-Edge-Coloured Graphs","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mount Saint Vincent University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Friendship graph; Windmill graph; Discrete mathematics; Homomorphism; 1-planar graph; Graph; Chordal graph; Line graph; Voltage graph","score_opus":0.013926403745023656,"score_gpt":0.2787152718307317,"score_spread":0.26478886808570806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044049558","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.9118166,0.0039820164,0.079528324,0.002723743,0.0009579594,0.00031696042,0.0000010639686,0.000099807774,0.000573533],"genre_scores_gemma":[0.99880284,0.00076146954,0.00008590319,0.000032151496,0.000030535786,0.000003702666,2.3663397e-7,0.000015449652,0.00026771004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974284,0.000367651,0.0005731937,0.00013464867,0.0007646215,0.0007314876],"domain_scores_gemma":[0.9975834,0.00078395597,0.0005808529,0.0006092628,0.00034632412,0.000096197255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003622113,0.00013980918,0.0003686064,0.0004748717,0.000149079,0.00004355372,0.0025597075,0.000057085133,0.0000060025022],"category_scores_gemma":[0.00033991667,0.00009575112,0.00021236735,0.0028332004,0.00014746781,0.00033359925,0.0002519313,0.00065331545,0.00002226874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029620553,0.00006615629,0.00009781209,0.000016480293,0.00009043849,0.000013422959,0.00038625888,0.00013516625,0.0040345644,0.99333024,0.00061383145,0.0011860227],"study_design_scores_gemma":[0.0006627013,0.00071757537,0.00067480246,0.000027554692,0.000017128292,0.00010503882,0.0000698706,0.0007929302,0.010925373,0.9854069,0.0005056059,0.00009455571],"about_ca_topic_score_codex":0.0000020539728,"about_ca_topic_score_gemma":0.0000010525168,"teacher_disagreement_score":0.08698625,"about_ca_system_score_codex":0.00016835188,"about_ca_system_score_gemma":0.0006235402,"threshold_uncertainty_score":0.4756616},"labels":[],"label_agreement":null},{"id":"W3047746738","doi":"10.37236/9801","title":"Sign Variation and Descents","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Eulerian path; Sign (mathematics); Bounded function; Equivalence (formal languages); Interpretation (philosophy); Type (biology); Variation (astronomy)","score_opus":0.03089264351403811,"score_gpt":0.2769744413099855,"score_spread":0.24608179779594738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047746738","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.5682584,0.0022239326,0.42166647,0.0056619653,0.00094695674,0.00050227676,0.0000010285783,0.00008234076,0.0006565907],"genre_scores_gemma":[0.99890333,0.00027434065,0.00044622703,0.00013261582,0.00017413269,0.0000017243027,1.17993075e-7,0.000030634623,0.000036866095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984621,0.00014178256,0.0005021379,0.000098631725,0.00044649836,0.0003488537],"domain_scores_gemma":[0.9981783,0.00065181416,0.000634041,0.00017839673,0.0002396603,0.00011776647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086046505,0.00015361937,0.00032547512,0.0000402193,0.00010855189,0.0000373783,0.00040084665,0.000064357424,0.000007730852],"category_scores_gemma":[0.0013973023,0.00010714198,0.00007736828,0.00030622078,0.00004250946,0.00018315503,0.00007387602,0.0006272262,0.0000044429685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051760526,0.0000862542,0.00002872273,0.000042441545,0.00007088163,0.0000042460747,0.0015826718,0.000007735048,0.00056046987,0.9969287,0.00039013074,0.00024597294],"study_design_scores_gemma":[0.0010216293,0.0005893867,0.000056632412,0.000026216956,0.00011574317,0.000076663826,0.00013320627,0.00028208073,0.00094765436,0.99588954,0.0007512417,0.00010997838],"about_ca_topic_score_codex":5.3263346e-7,"about_ca_topic_score_gemma":1.8825462e-7,"teacher_disagreement_score":0.4306449,"about_ca_system_score_codex":0.00017258187,"about_ca_system_score_gemma":0.00018806048,"threshold_uncertainty_score":0.43691233},"labels":[],"label_agreement":null},{"id":"W3080853710","doi":"10.37236/9819","title":"Synchronizing Times for $k$-sets in Automata","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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":"University of Victoria","funders":"","keywords":"Word (group theory); Synchronizing; Mathematics; Combinatorics; Automaton; State (computer science); Conjecture; Upper and lower bounds; Discrete mathematics; Word length; Algorithm; Computer science; Topology (electrical circuits); Geometry; Theoretical computer science","score_opus":0.007389085431190077,"score_gpt":0.23200268580022293,"score_spread":0.22461360036903286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080853710","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.4221678,0.02048668,0.5395549,0.012372776,0.0032852138,0.00070825627,0.0000051585166,0.00017221524,0.001246985],"genre_scores_gemma":[0.9993122,0.00011551004,0.00019336666,0.00019840036,0.000037098427,0.000014305239,5.5383845e-7,0.000012175187,0.000116352654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984036,0.00019934871,0.00036166506,0.00012546589,0.00039769834,0.0005122269],"domain_scores_gemma":[0.9988056,0.0004091852,0.0003249088,0.00035711494,0.0000656796,0.00003754375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029499026,0.000105808314,0.00020878656,0.00015877395,0.0002663389,0.00006548244,0.0019743342,0.00002218464,0.000012440927],"category_scores_gemma":[0.00006601265,0.00008012959,0.00011140274,0.00056453753,0.000022880826,0.00027652076,0.00032509552,0.0005908768,0.0000017899687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019608004,0.00011567612,0.000028861303,0.0000058681167,0.000024763709,0.000011795841,0.000402042,0.0005730422,0.000111574314,0.9923465,0.0013468539,0.005013418],"study_design_scores_gemma":[0.0010966458,0.0007260963,0.00010332187,0.000011810302,0.000011359545,0.00037801405,0.00016421489,0.051867966,0.00037267967,0.9342052,0.010947995,0.000114712144],"about_ca_topic_score_codex":0.0000038183193,"about_ca_topic_score_gemma":0.0000011573512,"teacher_disagreement_score":0.57714444,"about_ca_system_score_codex":0.0005713496,"about_ca_system_score_gemma":0.0005529994,"threshold_uncertainty_score":0.3668837},"labels":[],"label_agreement":null},{"id":"W3082642148","doi":"10.37236/9239","title":"Counting Triangles in Power-Law Uniform Random Graphs","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"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 Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Australian Government","keywords":"Mathematics; Combinatorics; Random graph; Vertex (graph theory); Exponent; Degree distribution; Degree (music); Clustering coefficient; Discrete mathematics; Random regular graph; Graph; Chordal graph; Cluster analysis; 1-planar graph; Complex network; Statistics","score_opus":0.008283163270076962,"score_gpt":0.231851790648206,"score_spread":0.22356862737812902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082642148","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.92895216,0.0037908845,0.044903908,0.0059086382,0.00023196975,0.00040776,0.0000024953208,0.00005736333,0.015744839],"genre_scores_gemma":[0.99956197,0.00006128805,0.00001609342,0.00019109056,0.000129454,0.0000026062035,0.0000014096976,0.000016970662,0.000019132014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984703,0.00013566948,0.0005563192,0.00010062021,0.00030103,0.00043606866],"domain_scores_gemma":[0.9989274,0.00020948178,0.00048093303,0.00015909779,0.00015458663,0.000068460715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001076123,0.00014977383,0.0004108864,0.00008110831,0.00010683813,0.00005597263,0.00054133125,0.000029061373,0.000055492208],"category_scores_gemma":[0.000021500307,0.00010696252,0.00026600616,0.00073330774,0.000049944705,0.00015221727,0.000056895886,0.0008127386,0.0000031586121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011275887,0.0000733901,0.0015997714,0.0000023895384,0.00013402055,0.000002849389,0.00026201882,0.00017267003,0.00010293152,0.99660695,0.00041826433,0.0005119989],"study_design_scores_gemma":[0.0025633508,0.0003162405,0.00008006276,0.000023668483,0.000091342925,0.000005862807,0.00032827957,0.00073983055,0.0009369646,0.9833449,0.011425616,0.00014384136],"about_ca_topic_score_codex":0.000044258497,"about_ca_topic_score_gemma":0.0000091580305,"teacher_disagreement_score":0.070609815,"about_ca_system_score_codex":0.00010828585,"about_ca_system_score_gemma":0.00020146549,"threshold_uncertainty_score":0.4361805},"labels":[],"label_agreement":null},{"id":"W3089292598","doi":"10.37236/10055","title":"Planar Lattice Subsets with Minimal Vertex Boundary","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Azrieli Foundation; Israel Science Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Discrete mathematics; Planar graph; Graph","score_opus":0.012933440177614941,"score_gpt":0.2646560003340228,"score_spread":0.25172256015640787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089292598","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.36850065,0.03801856,0.58453083,0.0050026868,0.0021503256,0.00046287765,0.0000039260935,0.000088112596,0.0012420132],"genre_scores_gemma":[0.9964082,0.0020167888,0.0010123969,0.00016389233,0.0001026823,0.0000076094166,0.0000033119384,0.000043120926,0.00024196981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995659,0.0006624086,0.00060407096,0.00042497154,0.0015278107,0.0011217705],"domain_scores_gemma":[0.9959564,0.0006881136,0.00084710337,0.0013793953,0.0009294131,0.00019954437],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025226402,0.00038763002,0.00065495004,0.00027580382,0.00029857032,0.00052163936,0.004762479,0.00020077324,0.000009706438],"category_scores_gemma":[0.00016645934,0.00026177804,0.0002700932,0.00089801726,0.00023822256,0.00050263753,0.0009577552,0.0047640833,0.000007829559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023393643,0.00024027149,0.00017374828,0.000068289184,0.00052370963,0.0005077854,0.0008940876,0.0003262056,0.00009172233,0.99479926,0.0005302701,0.001610712],"study_design_scores_gemma":[0.0009579967,0.0010181508,0.00038750505,0.0002458811,0.00009397615,0.0015830998,0.00016352528,0.00093086367,0.00069593923,0.99100584,0.0025578013,0.0003594105],"about_ca_topic_score_codex":0.000006472746,"about_ca_topic_score_gemma":0.000014036538,"teacher_disagreement_score":0.6279076,"about_ca_system_score_codex":0.0007173613,"about_ca_system_score_gemma":0.005183657,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W3092653029","doi":"10.37236/9982","title":"An Order on Circular Permutations","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially ordered set; Mathematics; Combinatorics; Affine transformation; Lattice (music); Rank (graph theory); Order (exchange); Interval (graph theory); Discrete mathematics; Pure mathematics; Physics","score_opus":0.03037655802564984,"score_gpt":0.33748018279349745,"score_spread":0.3071036247678476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092653029","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.7017241,0.0032164764,0.28664687,0.0013678264,0.0050139097,0.0007812114,0.0000062981576,0.00012108374,0.0011222279],"genre_scores_gemma":[0.9975575,0.00064994115,0.00092670735,0.00009131839,0.00044345832,0.000021890157,0.0000083925925,0.00014492073,0.0001558282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995693,0.00062328216,0.0012300456,0.00033715466,0.0013336062,0.00078286073],"domain_scores_gemma":[0.9932385,0.00122507,0.0019208652,0.0016192172,0.0018207349,0.00017561878],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020629717,0.0005303815,0.0010344953,0.00023204579,0.00025799806,0.00021447788,0.0017986604,0.00039090938,0.000042491713],"category_scores_gemma":[0.0020713473,0.000399297,0.00045295357,0.0005953215,0.000099172314,0.00020579153,0.00028995948,0.0042361333,0.0000070374676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003285704,0.0010484612,0.000008926345,0.00018003209,0.00041618722,0.000053944736,0.0012848437,0.002004387,0.0001400985,0.9944137,0.0002932148,0.00012337233],"study_design_scores_gemma":[0.0008245759,0.0007724958,0.000012100557,0.0003088607,0.00050394,0.00025438642,0.0007803983,0.0005966086,0.00071263284,0.99436307,0.0004815766,0.00038936918],"about_ca_topic_score_codex":0.0000032907171,"about_ca_topic_score_gemma":0.0000038779513,"teacher_disagreement_score":0.29583347,"about_ca_system_score_codex":0.0012033925,"about_ca_system_score_gemma":0.002514244,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W3097083683","doi":"10.37236/10015","title":"An Equivariant Quantum Pieri Rule for the Grassmannian on Cylindric Shapes","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; University of Waterloo; University of Minnesota; National Science Foundation","keywords":"Grassmannian; Equivariant map; Quantum cohomology; Flag (linear algebra); Quantum; Schubert calculus; Mathematics; Pure mathematics; Generalization; Physics; Equivariant cohomology; Cohomology; Algebra over a field; Quantum mechanics; Mathematical analysis","score_opus":0.049290316521525164,"score_gpt":0.35415566864406883,"score_spread":0.3048653521225437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097083683","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.22106536,0.0148139205,0.71150756,0.013862422,0.027650088,0.008430573,0.00014183004,0.0004796646,0.0020485902],"genre_scores_gemma":[0.9962414,0.001159954,0.0005621888,0.00019693232,0.0009925993,0.00023933838,0.000008161735,0.00025792004,0.00034154416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99424154,0.0006676463,0.0016514024,0.00046150078,0.0016741554,0.0013037723],"domain_scores_gemma":[0.9884462,0.005615564,0.0032736768,0.0017988351,0.00068397244,0.00018176534],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005953509,0.00075394596,0.0012742325,0.00027603586,0.00095557893,0.00023199368,0.0047374964,0.0003387514,0.000059953978],"category_scores_gemma":[0.0018121774,0.00046228975,0.0008256677,0.00051380036,0.00015263476,0.00017274039,0.0008025329,0.005290264,0.0000050693525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031229362,0.0009853984,0.0000026824373,0.00020015506,0.0005976921,0.000015067654,0.0010088254,0.0028134654,0.00006132871,0.9921298,0.0014444295,0.00042888618],"study_design_scores_gemma":[0.0014453375,0.002762482,0.0000125607185,0.0001475215,0.0008145249,0.00012585253,0.0007929922,0.0060303654,0.00018855816,0.97896594,0.008211561,0.00050231966],"about_ca_topic_score_codex":0.0000064820324,"about_ca_topic_score_gemma":0.0000036151378,"teacher_disagreement_score":0.775176,"about_ca_system_score_codex":0.0017364322,"about_ca_system_score_gemma":0.0016921902,"threshold_uncertainty_score":0.99978286},"labels":[],"label_agreement":null},{"id":"W3104969395","doi":"10.37236/10011","title":"$H$-Chromatic Symmetric Functions","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Chromatic scale; Bipartite graph; Combinatorics; Uniqueness; Mathematics; Graph; Symmetric function; Friendship graph; Discrete mathematics; Mathematical analysis; Line graph; Graph power","score_opus":0.032903942093759304,"score_gpt":0.31481335122347404,"score_spread":0.28190940912971474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104969395","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.51718944,0.040755685,0.35455254,0.005629247,0.050158978,0.004867397,0.00006366357,0.00074313756,0.026039949],"genre_scores_gemma":[0.99546224,0.0010407373,0.0004442606,0.000038914044,0.0005143861,0.00007077222,0.0000052807136,0.00017576106,0.0022476637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99424595,0.0006906914,0.0018440362,0.0003200516,0.0018722868,0.0010269773],"domain_scores_gemma":[0.9907658,0.0031660805,0.0036613422,0.0015549996,0.00069220905,0.00015953019],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003281849,0.0006047973,0.0013263617,0.00065149734,0.00049287383,0.00011788744,0.0026887022,0.00029366938,0.00021950314],"category_scores_gemma":[0.0031030872,0.00045405905,0.000779274,0.0014723613,0.000118651136,0.00015659248,0.0014355063,0.006417101,0.000019119701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004234126,0.00061768503,0.000013628556,0.0003315517,0.0005871187,0.000032267813,0.00044355082,0.00037006542,0.000011884681,0.99278516,0.0045741545,0.00019059532],"study_design_scores_gemma":[0.00094346446,0.0007356783,0.000008551146,0.00015027022,0.0009047071,0.00051319227,0.000570407,0.0002615569,0.00006258274,0.9883696,0.0070638317,0.0004161924],"about_ca_topic_score_codex":0.0000044367807,"about_ca_topic_score_gemma":0.0000018715496,"teacher_disagreement_score":0.4782728,"about_ca_system_score_codex":0.0028713027,"about_ca_system_score_gemma":0.0020892613,"threshold_uncertainty_score":0.9997911},"labels":[],"label_agreement":null},{"id":"W3108105039","doi":"10.37236/10585","title":"Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Probabilistic logic; Zero (linguistics); Forcing (mathematics); Combinatorics; Mathematics; Graph; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.016887275113576482,"score_gpt":0.2793944889790109,"score_spread":0.26250721386543446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108105039","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.75276035,0.016052322,0.21162757,0.007094043,0.005314553,0.0015305221,0.000008590193,0.00017634837,0.0054356996],"genre_scores_gemma":[0.997652,0.0014430019,0.00009300639,0.00015808105,0.00010426011,0.000023885885,0.0000012176016,0.00003812412,0.0004864427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961561,0.00066617085,0.00054101343,0.0004409881,0.0013295254,0.0008662229],"domain_scores_gemma":[0.9967551,0.001153985,0.00057011907,0.0011110652,0.00026455033,0.0001451313],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0034634923,0.00035415828,0.00052038115,0.000420318,0.00052518636,0.00027532675,0.003237927,0.00012650312,0.000010759264],"category_scores_gemma":[0.00036557426,0.0002483841,0.00022492617,0.0005864474,0.00016630901,0.00019571689,0.0015424616,0.0049836985,0.0000037732225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011641216,0.00016533273,0.000036914673,0.00004713611,0.000099151504,0.000033609234,0.00034996105,0.005062053,0.000037631366,0.99177253,0.00022737616,0.0020518904],"study_design_scores_gemma":[0.0005028446,0.0025486941,0.000104785526,0.00010723367,0.000033223845,0.00019691074,0.00003085667,0.002159176,0.00024367655,0.99034667,0.003481608,0.00024432395],"about_ca_topic_score_codex":0.0000032255623,"about_ca_topic_score_gemma":0.0000011994649,"teacher_disagreement_score":0.24489163,"about_ca_system_score_codex":0.0012671839,"about_ca_system_score_gemma":0.001161314,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W3124686630","doi":"10.37236/10206","title":"Permutations Avoiding Certain Partially-Ordered Patterns","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection, injection and surjection; Combinatorics; Mathematics; Permutation (music); Set (abstract data type); Order (exchange); Subsequence; Sigma; Fibonacci number; Simple (philosophy); Bijection; Discrete mathematics; Computer science","score_opus":0.029634295342398243,"score_gpt":0.31064422865128344,"score_spread":0.2810099333088852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124686630","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.51167375,0.0017918891,0.4812505,0.002130502,0.0016670363,0.00025160462,0.0000032818346,0.00006852246,0.0011629052],"genre_scores_gemma":[0.9983535,0.00043497348,0.00023845825,0.00006691994,0.00022625737,0.000007729813,0.000001574885,0.000060790317,0.0006098315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970426,0.00049048295,0.0008916347,0.00016050831,0.00071261177,0.00070217164],"domain_scores_gemma":[0.9956769,0.0019854496,0.00082989875,0.00053800317,0.00085467985,0.00011512047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016243105,0.00024378367,0.0005047027,0.0000930479,0.00035757062,0.00008196657,0.00061392295,0.000100364894,0.00006207432],"category_scores_gemma":[0.0030641558,0.00018553965,0.00026181122,0.00056666957,0.000049391412,0.0002216905,0.00011543278,0.0012855453,0.000009781836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019014702,0.00030687265,0.00010590166,0.000051734383,0.00016469568,0.000049964437,0.0010354656,0.00008257564,0.0006273522,0.9971129,0.0003232159,0.000120349076],"study_design_scores_gemma":[0.0010865232,0.00021866447,0.000028954139,0.00008962638,0.00019742802,0.0005319394,0.0015961893,0.00019951287,0.006697841,0.9875341,0.001620968,0.000198228],"about_ca_topic_score_codex":0.0000018218525,"about_ca_topic_score_gemma":0.000019750474,"teacher_disagreement_score":0.4866797,"about_ca_system_score_codex":0.000500431,"about_ca_system_score_gemma":0.0009168449,"threshold_uncertainty_score":0.7566087},"labels":[],"label_agreement":null},{"id":"W3126227703","doi":"10.37236/10253","title":"Mating of Discrete Trees and Walks in the Quarter-Plane","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Quarter (Canadian coin); Mating; Plane (geometry); Mathematics; Biology; Geography; Ecology; Geometry; Archaeology","score_opus":0.015454286164715012,"score_gpt":0.28740892474204477,"score_spread":0.27195463857732977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126227703","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.98459387,0.0033301353,0.008792707,0.0015979557,0.00035119208,0.00020685089,0.0000015395148,0.000011020249,0.0011147158],"genre_scores_gemma":[0.9991183,0.00038997614,0.00031849407,0.000027387792,0.00006258463,0.0000031519828,4.2079142e-7,0.000020834235,0.000058811424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978358,0.00036534268,0.0007772612,0.0000970521,0.0005358334,0.0003887024],"domain_scores_gemma":[0.9964231,0.0021607038,0.000770535,0.00039260654,0.00021717219,0.000035862467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020329657,0.00016453813,0.00046415886,0.000071594935,0.00008696564,0.000036018806,0.0005120513,0.000065605396,0.000006683701],"category_scores_gemma":[0.00095413,0.00009532759,0.00010210368,0.00043380883,0.0000775553,0.00013085098,0.0000688388,0.00078279286,6.71893e-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.000025116797,0.00017030646,0.00014911275,0.00008102553,0.000056767458,0.000024744788,0.0028576013,0.000009250916,0.0006444071,0.99564236,0.00012569055,0.00021362283],"study_design_scores_gemma":[0.0009594551,0.00036913867,0.0001686073,0.0001357396,0.000082458144,0.00054299214,0.0034199166,0.000096434494,0.0019822957,0.9919383,0.00020460668,0.000100068784],"about_ca_topic_score_codex":0.0000026654952,"about_ca_topic_score_gemma":0.000019467056,"teacher_disagreement_score":0.014524455,"about_ca_system_score_codex":0.000116879855,"about_ca_system_score_gemma":0.00021622934,"threshold_uncertainty_score":0.38873464},"labels":[],"label_agreement":null},{"id":"W3130171556","doi":"10.37236/8219","title":"Cycle Decompositions of Complete Digraphs","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Directed graph; BETA (programming language); Graph; Decomposition; Complete graph; Alpha (finance); Discrete mathematics; Computer science; Statistics","score_opus":0.004021153063682866,"score_gpt":0.18460727969830887,"score_spread":0.180586126634626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130171556","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.9682151,0.014288132,0.01263648,0.00019524724,0.00081833464,0.000056056346,0.0000037194984,0.000029641067,0.0037572577],"genre_scores_gemma":[0.9992725,0.0006145667,0.000008269099,0.000016222819,0.000037810696,0.000001024399,0.0000010921166,0.000014473411,0.000034019165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990542,0.00010267961,0.0003534967,0.000042069034,0.00018903866,0.00025853325],"domain_scores_gemma":[0.9993793,0.00013378292,0.00012591622,0.00019214138,0.00012572414,0.00004316546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041378464,0.00008825996,0.00022420974,0.00006919814,0.000068468544,0.000014266481,0.0002579432,0.000035922647,0.00001457349],"category_scores_gemma":[0.000015311789,0.000068156136,0.00017074701,0.00041245538,0.00003817291,0.00007203485,0.000014626324,0.00037609087,0.0000033342824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012076428,0.00007440092,0.000115188304,0.00002895981,0.0002478956,0.000011381239,0.00024768375,0.003002581,0.015497087,0.98015213,0.0004373509,0.0001732513],"study_design_scores_gemma":[0.0007071706,0.0002099571,0.00041459143,0.000059293132,0.00010738205,0.0006700225,0.00028226292,0.0007616206,0.027246473,0.95864636,0.0107567245,0.00013812631],"about_ca_topic_score_codex":0.0000010775875,"about_ca_topic_score_gemma":0.0000030640033,"teacher_disagreement_score":0.03105739,"about_ca_system_score_codex":0.00006492099,"about_ca_system_score_gemma":0.00008411839,"threshold_uncertainty_score":0.27793264},"labels":[],"label_agreement":null},{"id":"W3134322783","doi":"10.37236/10328","title":"Resolutions of Convex Geometries","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Convex analysis; Convex hull; Convex set; Mathematics; Affine transformation; Subderivative; Convex polytope; Regular polygon; Convex combination; Convex geometry; Geometry; Resolution (logic); Pure mathematics; Convex body; Combinatorics; Proper convex function; Convex optimization; Computer science; Artificial intelligence","score_opus":0.03154710341471175,"score_gpt":0.3241554176278077,"score_spread":0.29260831421309597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134322783","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.7346556,0.06361123,0.19346759,0.0019385957,0.0029654861,0.000354288,0.000012928451,0.000038059556,0.0029562344],"genre_scores_gemma":[0.99454415,0.0042830906,0.00019442436,0.000032135944,0.000114026276,0.0000033349404,0.0000028886993,0.000029223786,0.00079671654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977195,0.00037509302,0.0008792516,0.00013635626,0.00042663983,0.00046312634],"domain_scores_gemma":[0.9952669,0.0016659633,0.001610711,0.00062503194,0.00077678065,0.000054596476],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002274709,0.000224141,0.00082954776,0.00021944742,0.000135965,0.000018091601,0.00087325106,0.00031053592,0.000061652245],"category_scores_gemma":[0.0018129736,0.00016257928,0.00038804134,0.0003818943,0.0003435509,0.00007232607,0.00038100255,0.002844923,0.0000012580194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007083238,0.00020815192,0.0000399827,0.00011646172,0.00047439756,0.0000139453105,0.0006205566,0.00011344038,0.000079432044,0.9975722,0.00060323573,0.00008739548],"study_design_scores_gemma":[0.00045187725,0.00025150893,0.000034611065,0.00014651331,0.00033258882,0.0002054418,0.00076059496,0.000014595158,0.0025368207,0.99384624,0.0012821354,0.00013705526],"about_ca_topic_score_codex":0.000003534804,"about_ca_topic_score_gemma":0.0000061757514,"teacher_disagreement_score":0.25988856,"about_ca_system_score_codex":0.00031608235,"about_ca_system_score_gemma":0.0015187355,"threshold_uncertainty_score":0.9994556},"labels":[],"label_agreement":null},{"id":"W3154860730","doi":"10.37236/10018","title":"A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"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":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Tutte polynomial; Chromatic scale; Symmetric function; Vertex (graph theory); Spanning tree; Discrete mathematics; Graph; Line graph","score_opus":0.006401905112446869,"score_gpt":0.19128108511107558,"score_spread":0.1848791799986287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154860730","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.759703,0.022079295,0.21545132,0.0007745841,0.0013252241,0.00013261402,2.9481703e-7,0.00007813755,0.0004555756],"genre_scores_gemma":[0.99877346,0.0005606068,0.00038415732,0.00019881756,0.000013719457,0.0000022919185,7.4009347e-7,0.000015575031,0.000050665443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976791,0.00026587266,0.0005365481,0.00025953425,0.0007005114,0.00055839063],"domain_scores_gemma":[0.99761117,0.0004950326,0.00057763915,0.00039427276,0.0007874176,0.0001344601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013881498,0.0002089387,0.00035122104,0.00062638405,0.00035702367,0.00021556171,0.00042960473,0.000076761746,0.0000046673094],"category_scores_gemma":[0.00018166358,0.00013771483,0.00010377745,0.00519624,0.000095137,0.00044256542,0.00011035699,0.00075690274,0.0000040436216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002997445,0.00012275104,0.0014262198,0.000022366645,0.00018563383,0.000020118796,0.00007913747,0.00002420636,0.00033115738,0.9935243,0.00009027779,0.004143834],"study_design_scores_gemma":[0.0019318227,0.0016300416,0.0012794608,0.00008142746,0.0002174526,0.0023450335,0.00014359003,0.0031162614,0.0006092973,0.9882565,0.00019495963,0.00019415481],"about_ca_topic_score_codex":0.0000057607153,"about_ca_topic_score_gemma":0.0000018266899,"teacher_disagreement_score":0.23907048,"about_ca_system_score_codex":0.00013340882,"about_ca_system_score_gemma":0.00069563114,"threshold_uncertainty_score":0.5615848},"labels":[],"label_agreement":null},{"id":"W3158160756","doi":"10.37236/9148","title":"The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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 Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Pseudorandom number generator; Vertex (graph theory); Partition (number theory); Matching (statistics); Complete bipartite graph; Graph; Discrete mathematics; Algorithm","score_opus":0.011114089322099677,"score_gpt":0.25889803763410435,"score_spread":0.24778394831200468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158160756","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.9777063,0.018048832,0.0011271066,0.001376011,0.00052287546,0.00019461053,4.6771936e-7,0.00001089489,0.0010129114],"genre_scores_gemma":[0.9915646,0.007824042,0.000035847588,0.000079132755,0.00004690446,0.0000042198085,1.5619122e-7,0.000019193849,0.00042593264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978865,0.0006067172,0.0005759432,0.0001004213,0.0003601431,0.00047027096],"domain_scores_gemma":[0.99751514,0.0015852677,0.00035772976,0.00029279815,0.00019606626,0.000052981683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035734342,0.00015381021,0.0003785036,0.00006897139,0.0004884696,0.0000928486,0.00039681568,0.00006175038,0.0000069147154],"category_scores_gemma":[0.0005651114,0.00006287579,0.00015863669,0.00037800905,0.00013311092,0.0001218179,0.000112227135,0.000896914,3.321917e-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.0005377219,0.0000514962,0.0002806018,0.000024859526,0.00012417109,0.000023651568,0.0012921201,0.000008804178,0.00020695622,0.9966674,0.00016733554,0.0006149096],"study_design_scores_gemma":[0.005123625,0.00009936777,0.00011332835,0.000049098566,0.00007992185,0.0005254874,0.00041926646,0.000037460257,0.0007081017,0.98905814,0.003687495,0.00009873113],"about_ca_topic_score_codex":0.000006744146,"about_ca_topic_score_gemma":0.00004056255,"teacher_disagreement_score":0.013858281,"about_ca_system_score_codex":0.00007499562,"about_ca_system_score_gemma":0.00027554092,"threshold_uncertainty_score":0.38966948},"labels":[],"label_agreement":null},{"id":"W3180803402","doi":"10.37236/10582","title":"Integer Decomposition Property of Polytopes","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polytope; Decomposition; Integer (computer science); Property (philosophy); Polytope model; Mathematics; Integer factorization; Combinatorics; Computer science; Chemistry; Philosophy","score_opus":0.025530307382630405,"score_gpt":0.3303483906337839,"score_spread":0.3048180832511535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180803402","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.7429767,0.05750728,0.18203434,0.00581785,0.0020012872,0.0003554459,0.0000061692294,0.00009171124,0.009209203],"genre_scores_gemma":[0.9973384,0.0009221698,0.000041855557,0.000026205587,0.00010759403,0.0000014914121,3.3133657e-7,0.000016281196,0.001545643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987198,0.0000809549,0.00050286663,0.00006296873,0.00035952,0.0002738702],"domain_scores_gemma":[0.99871296,0.00056105765,0.0002536589,0.00013865976,0.00030396346,0.000029699519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015558037,0.0001036413,0.00025689846,0.00020767756,0.000050242128,0.000043450236,0.0003190725,0.00004575822,0.00003282896],"category_scores_gemma":[0.00029858528,0.00004863251,0.00014664506,0.00063152774,0.000043848944,0.00018441987,0.00003616377,0.00048754903,0.000003994507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035607914,0.00009283549,0.000009865847,0.0002183695,0.00013626495,0.0000052797936,0.0005960659,0.000004261997,0.00028955683,0.9953085,0.0018245289,0.0014788379],"study_design_scores_gemma":[0.00019542451,0.00055838434,0.000007172786,0.00018851845,0.000103609826,0.00024268332,0.0002885882,0.00018665966,0.0075446367,0.98277056,0.007840906,0.00007287008],"about_ca_topic_score_codex":0.000008050477,"about_ca_topic_score_gemma":0.0000016776956,"teacher_disagreement_score":0.25436172,"about_ca_system_score_codex":0.00016017786,"about_ca_system_score_gemma":0.00040057822,"threshold_uncertainty_score":0.2118185},"labels":[],"label_agreement":null},{"id":"W3181497812","doi":"10.37236/9940","title":"On Automorphisms of Direct Products of Cayley Graphs on Abelian Groups","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":11,"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 Lethbridge","funders":"","keywords":"Mathematics; Automorphism; Combinatorics; Abelian group; Cayley graph; Direct product; Prime (order theory); Cyclic group; Discrete mathematics; Graph","score_opus":0.017413738974182743,"score_gpt":0.26644849811630034,"score_spread":0.2490347591421176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181497812","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.9946626,0.0010679561,0.0002370335,0.0012018615,0.00023499638,0.00016942552,0.0000051830093,0.000014937544,0.0024060116],"genre_scores_gemma":[0.9992206,0.00035416646,0.000052322204,0.000039446353,0.000026901229,0.0000040606515,0.0000011071816,0.000022110904,0.0002792547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831814,0.00024391476,0.0005619304,0.00012543841,0.00045289219,0.00029768876],"domain_scores_gemma":[0.9972887,0.0008211478,0.0007831649,0.0005454716,0.0005138243,0.000047680813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014096475,0.00014656234,0.00041235605,0.00014002249,0.000093128554,0.000008243331,0.0004261379,0.000060420803,0.00001832304],"category_scores_gemma":[0.0005607178,0.0001014831,0.00019686755,0.0008845057,0.00010267894,0.000045096265,0.00002891596,0.00055823394,0.0000027938124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727266,0.00089658133,0.000026872696,0.000052796433,0.00015755784,0.0000043635227,0.0002834655,0.000024268356,0.0066623166,0.9907397,0.00091506005,0.00016425992],"study_design_scores_gemma":[0.0004928882,0.0007826995,0.00009886717,0.0000949127,0.00011325673,0.00004838082,0.00006944371,0.0000057054795,0.15380934,0.8439502,0.00046232488,0.00007197473],"about_ca_topic_score_codex":0.0000016357792,"about_ca_topic_score_gemma":0.0000021314897,"teacher_disagreement_score":0.14714701,"about_ca_system_score_codex":0.00008530659,"about_ca_system_score_gemma":0.00034382826,"threshold_uncertainty_score":0.41383606},"labels":[],"label_agreement":null},{"id":"W3185109750","doi":"10.37236/10146","title":"Laplacian Fractional Revival on Graphs","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"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 Toronto; York University","funders":"","keywords":"Mathematics; Combinatorics; Laplacian matrix; Laplace operator; Hamiltonian (control theory); Discrete mathematics; Graph; Mathematical analysis","score_opus":0.006271930519176048,"score_gpt":0.22671079615421216,"score_spread":0.22043886563503612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185109750","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.35736972,0.008405964,0.5986497,0.027409183,0.004784757,0.00012084188,0.0000010517513,0.000095933654,0.0031628665],"genre_scores_gemma":[0.9984266,0.00031933177,0.00029329793,0.0005612392,0.00018652667,4.6134562e-7,3.2074232e-7,0.000008534927,0.0002036441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983867,0.00020326336,0.00028948946,0.00014561166,0.000568702,0.00040622306],"domain_scores_gemma":[0.99869466,0.00031484445,0.0002782393,0.00036142807,0.00027750648,0.00007335123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008526306,0.00012307601,0.00019446276,0.00008941659,0.00023091842,0.00010701532,0.0009071446,0.000043424137,0.0000073286465],"category_scores_gemma":[0.00011178901,0.000081586004,0.00018107843,0.0006543963,0.000029823334,0.00012560087,0.000104483035,0.0010969922,0.00001012107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009400126,0.00010527582,0.00002974625,0.000002941496,0.00004857108,0.000054984794,0.00010572057,0.0012328938,0.000080841084,0.9921308,0.0007019735,0.0054968586],"study_design_scores_gemma":[0.00045902372,0.0005099553,0.0004098771,0.00003948837,0.00001431584,0.0012481267,0.000018590677,0.0070383367,0.0011827584,0.9639386,0.025023106,0.00011784755],"about_ca_topic_score_codex":9.183605e-7,"about_ca_topic_score_gemma":7.1603534e-7,"teacher_disagreement_score":0.64105695,"about_ca_system_score_codex":0.00012111874,"about_ca_system_score_gemma":0.0006523418,"threshold_uncertainty_score":0.4765946},"labels":[],"label_agreement":null},{"id":"W3187703777","doi":"10.37236/10637","title":"Plethysms of Chromatic and Tutte Symmetric Functions","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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","keywords":"Symmetric function; Mathematics; Chromatic polynomial; Chromatic scale; Combinatorics; Interpretation (philosophy); Simple (philosophy); Mathematical proof; Stanley symmetric function; Complete homogeneous symmetric polynomial; Graph; Discrete mathematics; Ring of symmetric functions; Computer science; Geometry","score_opus":0.016613366072609215,"score_gpt":0.26713190958123345,"score_spread":0.25051854350862424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187703777","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.96168184,0.0054642973,0.028693978,0.0008275496,0.0015568369,0.00045698325,0.0000055396968,0.000041718802,0.0012712254],"genre_scores_gemma":[0.9990876,0.00019842155,0.00019617008,0.000020009124,0.000063006046,0.000013146767,4.3561639e-7,0.000039158356,0.00038209945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975029,0.00028982217,0.00082773337,0.000110394154,0.0008357361,0.0004333651],"domain_scores_gemma":[0.9963108,0.0017136162,0.0012463396,0.00040639658,0.0002535167,0.00006938621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018156576,0.00018102172,0.00052651844,0.00028638166,0.00032999713,0.000017231536,0.0006130708,0.000041715684,0.00003931824],"category_scores_gemma":[0.0009718771,0.00013670835,0.00015776354,0.0011839425,0.00009725528,0.00012819933,0.00024334142,0.0010213504,0.0000015216393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003884681,0.00033923707,0.00003832844,0.00008402971,0.00015167816,0.000005852954,0.0005211272,0.000054165685,0.0003362578,0.9975617,0.00062376587,0.00024500414],"study_design_scores_gemma":[0.0011154222,0.0012608673,0.000030630465,0.000024951147,0.00023061427,0.0006587578,0.00087682594,0.0002151715,0.0005051949,0.99342626,0.0015269964,0.00012829754],"about_ca_topic_score_codex":0.0000022492475,"about_ca_topic_score_gemma":6.342992e-7,"teacher_disagreement_score":0.03740568,"about_ca_system_score_codex":0.0004705793,"about_ca_system_score_gemma":0.00035661817,"threshold_uncertainty_score":0.55748045},"labels":[],"label_agreement":null},{"id":"W3188681872","doi":"10.37236/10655","title":"On Automorphisms of the Double Cover of a Circulant Graph","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"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 Lethbridge","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Circulant matrix; Automorphism; Combinatorics; Circulant graph; Mathematics; Modulo; Prime (order theory); Graph; Cover (algebra); Order (exchange); Discrete mathematics; Line graph; Voltage graph","score_opus":0.04256794565999561,"score_gpt":0.31111700235554224,"score_spread":0.26854905669554663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188681872","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.9901857,0.003214046,0.002602033,0.0006616402,0.0011148244,0.00058317184,0.000012041745,0.000012787369,0.0016137671],"genre_scores_gemma":[0.99870265,0.0007112226,0.000027250691,0.000029451381,0.000059715803,0.000007790358,0.0000018756692,0.00006064064,0.00039941494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953502,0.00081673905,0.0011873442,0.00020944548,0.0018094237,0.00062689185],"domain_scores_gemma":[0.9932979,0.0017491357,0.002363977,0.0014647379,0.0010507263,0.00007356702],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004720606,0.00032702056,0.0010310636,0.00025619954,0.000102882565,0.00004422502,0.0023674385,0.00029015378,0.000092428025],"category_scores_gemma":[0.00078535156,0.0001893048,0.000877255,0.0007116593,0.00030170972,0.00005322117,0.00078911416,0.0038006175,0.0000026037296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003387798,0.0007028811,0.00007315951,0.00042718495,0.0007773489,0.000015403557,0.00086920627,0.0005167967,0.0013079562,0.9940273,0.0009060189,0.000037937116],"study_design_scores_gemma":[0.0015419782,0.00057564856,0.00012056412,0.000698524,0.00031086776,0.00015399285,0.0001354848,0.00010843702,0.014976945,0.98111427,0.00011062197,0.00015264802],"about_ca_topic_score_codex":0.00001804795,"about_ca_topic_score_gemma":0.000004717205,"teacher_disagreement_score":0.013668989,"about_ca_system_score_codex":0.00057847355,"about_ca_system_score_gemma":0.0025392612,"threshold_uncertainty_score":0.99849766},"labels":[],"label_agreement":null},{"id":"W3188938205","doi":"10.37236/9671","title":"The Unit Acquisition Number of Binomial Random Graphs","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Random regular graph; Graph; Discrete mathematics; Random graph; Line graph; 1-planar graph","score_opus":0.017165757305316123,"score_gpt":0.30386163154886375,"score_spread":0.28669587424354764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188938205","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.26620072,0.005160716,0.7234957,0.0017330972,0.0013492611,0.00021498361,0.000007240191,0.000017519675,0.0018207203],"genre_scores_gemma":[0.99852544,0.0009718598,0.00015126706,0.0000369714,0.00007034039,0.0000023531977,6.087647e-7,0.00001626013,0.00022490573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983543,0.0001788358,0.0005595962,0.00007242819,0.00047431,0.0003604932],"domain_scores_gemma":[0.99571264,0.0027062045,0.00052579417,0.0002428425,0.0007587057,0.00005380777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013957818,0.00011630592,0.00031223302,0.000025995707,0.00020075936,0.00003631115,0.00038981243,0.000060332215,0.000043363012],"category_scores_gemma":[0.0014000644,0.00006430172,0.00016478023,0.00039981533,0.000072630966,0.00005399045,0.000052725252,0.0005205362,0.0000039133756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021705977,0.000106419466,0.000012393555,0.000025745956,0.00012888068,0.000008629362,0.00010266835,0.0000030709425,0.00017418333,0.9982665,0.00037865556,0.000575775],"study_design_scores_gemma":[0.0017435406,0.00021644599,0.0000152066905,0.00004010859,0.00018615484,0.00036893092,0.00024061886,0.000198471,0.0024676172,0.99373114,0.0007201455,0.00007159429],"about_ca_topic_score_codex":0.0000013108717,"about_ca_topic_score_gemma":0.0000030461524,"teacher_disagreement_score":0.7323247,"about_ca_system_score_codex":0.000078336605,"about_ca_system_score_gemma":0.00056578906,"threshold_uncertainty_score":0.26221478},"labels":[],"label_agreement":null},{"id":"W3189029205","doi":"10.37236/10808","title":"Linear Bounds for Cycle-Free Saturation Games","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Simon Fraser University; National Science Foundation","keywords":"Combinatorics; Graph; Mathematics; Saturation (graph theory); Discrete mathematics; Order (exchange)","score_opus":0.014884470986452328,"score_gpt":0.28082531278704087,"score_spread":0.2659408418005885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189029205","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.9566663,0.0067051123,0.027696595,0.0035153048,0.0032881573,0.00057923066,0.0000160184,0.000051106563,0.0014821587],"genre_scores_gemma":[0.998687,0.00014768948,0.00017844321,0.00013479752,0.00025024617,0.000013008739,0.0000012983116,0.00002837953,0.0005590932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845815,0.0001945913,0.00040952925,0.0000848219,0.00047566686,0.0003772191],"domain_scores_gemma":[0.9981571,0.0007225046,0.00051164115,0.00038224203,0.00018859735,0.000037959773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020787444,0.00012405559,0.00023877561,0.00009473142,0.00076644256,0.000026372643,0.000884708,0.000040166364,0.00003195854],"category_scores_gemma":[0.00051329954,0.00008263365,0.00022227607,0.00023641215,0.00005261342,0.000090097696,0.00017594677,0.0007993583,2.1925231e-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.00016981596,0.00007309628,0.000017120548,0.000014645354,0.00010958744,0.0000015820964,0.0007674856,0.00009109622,0.000069277805,0.9927097,0.0055317916,0.00044482294],"study_design_scores_gemma":[0.0010899607,0.000832719,0.000021773585,0.000004863134,0.000104405524,0.00019711882,0.0003314789,0.00031095877,0.00033911498,0.96277523,0.033893816,0.00009854325],"about_ca_topic_score_codex":7.881125e-7,"about_ca_topic_score_gemma":0.0000013827597,"teacher_disagreement_score":0.042020727,"about_ca_system_score_codex":0.0003060524,"about_ca_system_score_gemma":0.0002459445,"threshold_uncertainty_score":0.5894934},"labels":[],"label_agreement":null},{"id":"W3189696750","doi":"10.37236/12319","title":"The Chromatic Symmetric Function of a Graph Centred at a Vertex","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Vertex (graph theory); Windmill graph; Combinatorics; Graph; Friendship graph; Mathematics; Line graph; Graph power","score_opus":0.017176886253788673,"score_gpt":0.26539995958936075,"score_spread":0.2482230733355721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189696750","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.8030534,0.119377315,0.057314556,0.0024105716,0.012573662,0.001448855,0.0000051824245,0.00025493797,0.0035615368],"genre_scores_gemma":[0.9972921,0.0017752916,0.000047668855,0.000012049268,0.00010950937,0.000008170654,3.810649e-7,0.00005766544,0.0006971664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700123,0.00023961531,0.0010333983,0.00013865546,0.0009562626,0.00063085195],"domain_scores_gemma":[0.9940209,0.004138854,0.0008325085,0.00055838807,0.00036929414,0.0000800633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017303288,0.00025049335,0.0004931116,0.0002547432,0.0002908028,0.000074276926,0.0008055582,0.000097538425,0.000015088478],"category_scores_gemma":[0.0013522741,0.00013715796,0.00037154614,0.0017140743,0.0001364694,0.00017887946,0.00012661493,0.0008288625,0.000015301477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009715666,0.00015547677,0.0000055979267,0.00021347307,0.00041998614,0.000007594718,0.00046633158,0.000010218994,0.00043159287,0.99486196,0.0023429468,0.0009876516],"study_design_scores_gemma":[0.0007138577,0.0007934903,0.0000165907,0.00022718776,0.0004651066,0.00020736526,0.00029523688,0.00062294764,0.0014562327,0.9913366,0.0037298996,0.00013547868],"about_ca_topic_score_codex":0.000001338606,"about_ca_topic_score_gemma":0.0000032592754,"teacher_disagreement_score":0.19423872,"about_ca_system_score_codex":0.00085894857,"about_ca_system_score_gemma":0.00044865077,"threshold_uncertainty_score":0.55931395},"labels":[],"label_agreement":null},{"id":"W3199832108","doi":"10.37236/11859","title":"Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"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; Narodowe Centrum Nauki","keywords":"Generalization; Random graph; Induced subgraph isomorphism problem; Graph; Process (computing); Mathematics; Combinatorics; Computer science; Theoretical computer science; Discrete mathematics; Line graph; Voltage graph; Programming language","score_opus":0.024049792321890272,"score_gpt":0.34112266150921117,"score_spread":0.3170728691873209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199832108","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.96919584,0.014248231,0.008711099,0.006906963,0.00021021157,0.0002428571,0.0000013808842,0.000011766619,0.00047163363],"genre_scores_gemma":[0.9982665,0.0011963577,0.0000015633809,0.00026946422,0.000057115885,0.000015633146,3.3253437e-7,0.0000088745655,0.00018416898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783516,0.00040806658,0.0005037661,0.00016565966,0.00079043565,0.00029690703],"domain_scores_gemma":[0.9980651,0.0012020757,0.00016132391,0.00024259291,0.00027152422,0.000057356687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006584874,0.000113715585,0.00020027296,0.00040460072,0.00016520772,0.00026609428,0.0009743997,0.000041929106,0.000012310305],"category_scores_gemma":[0.000464723,0.00005445794,0.00010088833,0.0032661315,0.00005581857,0.00023450196,0.000031065425,0.0004593943,0.000011355258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044986096,0.00004674668,0.00030726285,0.0000054102184,0.000021101843,0.000003604763,0.002425573,0.0006693382,0.00043585157,0.9941352,0.00074623,0.0011587174],"study_design_scores_gemma":[0.00031470627,0.00016403213,0.00070584257,0.000025689786,0.000032576154,0.00015439636,0.0009254297,0.0006384007,0.00072373694,0.9883843,0.007856821,0.000074042524],"about_ca_topic_score_codex":0.0000017510692,"about_ca_topic_score_gemma":0.000011238249,"teacher_disagreement_score":0.029070633,"about_ca_system_score_codex":0.00002694884,"about_ca_system_score_gemma":0.0001788076,"threshold_uncertainty_score":0.2565953},"labels":[],"label_agreement":null},{"id":"W3202874536","doi":"10.37236/10781","title":"Density Maximizers of Layered Permutations","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","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 Victoria","funders":"Masarykova Univerzita; Grantová Agentura České Republiky; Leverhulme Trust","keywords":"Permutation (music); Bounded function; Combinatorics; Mathematics; Infinity; Sigma; Conjecture; Order (exchange); Cyclic permutation; Random permutation; Complement (music); Discrete mathematics; Symmetric group; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.026909736447748876,"score_gpt":0.30513536184795154,"score_spread":0.2782256254002027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202874536","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.97829247,0.0039832448,0.01228152,0.0005412564,0.002475118,0.00035529363,0.000017981074,0.000024426297,0.0020286897],"genre_scores_gemma":[0.99843705,0.00096355943,0.00011678035,0.00003531131,0.0000972333,0.000005501866,0.0000028604168,0.000042052143,0.00029964763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721247,0.00053211604,0.000883631,0.00015158507,0.0008019267,0.00041828328],"domain_scores_gemma":[0.9959699,0.00090217905,0.0019019063,0.00069710956,0.00046775833,0.00006118103],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024130847,0.00025728272,0.0007121966,0.0002118181,0.00034257345,0.000023285378,0.0013641609,0.00016795596,0.00013064645],"category_scores_gemma":[0.0005647522,0.00017934786,0.0005622382,0.0002691622,0.00014961082,0.00004553411,0.00078633724,0.002979418,3.40449e-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.00011202047,0.00013525107,0.00013212701,0.00010993989,0.0005615204,0.000010006605,0.0019644117,0.00056997855,0.000033794142,0.9953047,0.0009331918,0.0001330316],"study_design_scores_gemma":[0.00057872327,0.0002577136,0.00021406135,0.000042597112,0.0004192829,0.00015013645,0.00054486847,0.00007897597,0.00032384833,0.99654526,0.0006781278,0.00016639312],"about_ca_topic_score_codex":0.000008379425,"about_ca_topic_score_gemma":0.0000032387857,"teacher_disagreement_score":0.020144584,"about_ca_system_score_codex":0.0004844669,"about_ca_system_score_gemma":0.0009322861,"threshold_uncertainty_score":0.99932075},"labels":[],"label_agreement":null},{"id":"W3206558031","doi":"10.37236/10799","title":"Congruence Properties of Combinatorial Sequences via Walnut and the Rowland-Yassawi-Zeilberger Automaton","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"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; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modulo; Catalan number; Congruence (geometry); Automaton; Combinatorics; Prime (order theory); Discrete mathematics; Congruence relation; Theoretical computer science; Computer science","score_opus":0.005608120209821498,"score_gpt":0.19187676655686822,"score_spread":0.18626864634704673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206558031","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.9622311,0.018814912,0.009801708,0.0057354583,0.002740253,0.0003429792,0.0000013337823,0.000056295474,0.00027595766],"genre_scores_gemma":[0.99919116,0.00047046554,0.00002042775,0.00014374034,0.000065763605,0.000013905856,2.1854936e-7,0.000012178219,0.000082150655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970348,0.0008205693,0.0006019447,0.00017389035,0.0008869157,0.00048187427],"domain_scores_gemma":[0.9979868,0.0004643578,0.000786831,0.00047756906,0.00022444375,0.000059982256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004417279,0.00018425286,0.0004278276,0.0001016788,0.00055955094,0.00010388636,0.002295425,0.000040410465,0.000010065963],"category_scores_gemma":[0.00011426103,0.000096043535,0.00015125645,0.00058052083,0.000418066,0.0003778767,0.0005525646,0.00086242874,0.0000010812983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001390442,0.00009826408,0.00013926784,0.0000148891595,0.00010050983,0.000007721694,0.0016090887,0.000102454345,0.0016606626,0.9952727,0.0002206237,0.00063477276],"study_design_scores_gemma":[0.0026944587,0.00075778534,0.00012519544,0.00003270039,0.000062536026,0.00091557374,0.00044316432,0.014403247,0.0072795944,0.97136843,0.0017332801,0.000184046],"about_ca_topic_score_codex":0.000064952066,"about_ca_topic_score_gemma":0.0000014031044,"teacher_disagreement_score":0.036960047,"about_ca_system_score_codex":0.00019663012,"about_ca_system_score_gemma":0.000604617,"threshold_uncertainty_score":0.43036702},"labels":[],"label_agreement":null},{"id":"W3211215452","doi":"10.37236/9556","title":"The Erdős-Ko-Rado Theorem for 2-Pointwise and 2-Setwise Intersecting Permutations","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pointwise; Combinatorics; Mathematics; Sigma; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.015803472235806658,"score_gpt":0.2921658446297687,"score_spread":0.27636237239396205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211215452","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.949054,0.012546314,0.031074306,0.0039571235,0.0015570392,0.00034191934,0.000004553884,0.00002718653,0.001437543],"genre_scores_gemma":[0.9981547,0.000993128,0.00012192706,0.00009793606,0.00016314701,0.0000059443305,5.4217986e-7,0.000028799628,0.0004338492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984606,0.00026291402,0.00046142758,0.000110958565,0.00025756445,0.00044652927],"domain_scores_gemma":[0.9953108,0.0034400944,0.000429758,0.0003078753,0.00045072686,0.00006078493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022378277,0.00015181676,0.00024830524,0.000048891234,0.00096614205,0.0001054163,0.00040703014,0.000061055536,0.000007588114],"category_scores_gemma":[0.0017062383,0.00008101555,0.00020968654,0.00021652109,0.00016732827,0.000096294374,0.000111421796,0.0006764713,3.0675153e-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.00007323523,0.00003706342,0.000047485202,0.000021905276,0.00018678007,0.0000049484124,0.0024008334,0.000005321779,0.000104759514,0.9952085,0.0004946448,0.00141453],"study_design_scores_gemma":[0.0007557787,0.00022216784,0.000055482295,0.00003443714,0.00017459568,0.00060793414,0.003372917,0.00016395857,0.0008512192,0.9894683,0.0041919793,0.00010126705],"about_ca_topic_score_codex":6.4131643e-7,"about_ca_topic_score_gemma":0.000011230261,"teacher_disagreement_score":0.049100712,"about_ca_system_score_codex":0.0001320655,"about_ca_system_score_gemma":0.0002740253,"threshold_uncertainty_score":0.7430881},"labels":[],"label_agreement":null},{"id":"W3213907940","doi":"10.37236/11259","title":"Hopf Structures in the Representation Theory of Direct Products","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":1,"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":"Categorification; Hopf algebra; Mathematics; Noncommutative geometry; Representation theory; Quantum group; Representation (politics); Algebraic structure; Product (mathematics); Algebra over a field; Group (periodic table); Representation theory of Hopf algebras; Character (mathematics); Pure mathematics; Combinatorics; Discrete mathematics; Algebra representation; Division algebra","score_opus":0.028771980543300026,"score_gpt":0.2866485844429504,"score_spread":0.25787660389965034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213907940","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.99317735,0.0030835532,0.00032542847,0.001051806,0.0010424568,0.00034207638,0.0000013448916,0.000009036144,0.00096695346],"genre_scores_gemma":[0.99953943,0.00012392578,0.000010319297,0.00006151424,0.00012889977,0.000011719737,6.8664275e-7,0.000019621755,0.00010386501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968535,0.0011845713,0.00058754615,0.00012427609,0.00090228755,0.0003478593],"domain_scores_gemma":[0.997393,0.0011425021,0.0007889499,0.00047401403,0.00018129258,0.000020229449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003668589,0.00014172621,0.00033667005,0.00012209342,0.00021315117,0.000021416372,0.0010636447,0.000036701626,0.000033804317],"category_scores_gemma":[0.00071049173,0.00007994039,0.00013758057,0.0008037105,0.00007268615,0.00008909625,0.00011995818,0.0010032726,1.5798953e-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.00019020012,0.0001267495,0.00011748867,0.000016152288,0.00007840165,0.0000051666507,0.002968856,0.00022768592,0.00010586644,0.99518734,0.0006735623,0.00030250775],"study_design_scores_gemma":[0.00071858417,0.00050998415,0.00045312927,0.000007231141,0.000084361454,0.00015522235,0.0021694037,0.00001358669,0.0013843249,0.99377346,0.0006463115,0.00008440938],"about_ca_topic_score_codex":0.000011188785,"about_ca_topic_score_gemma":0.0000021113333,"teacher_disagreement_score":0.006362103,"about_ca_system_score_codex":0.0002332055,"about_ca_system_score_gemma":0.00037830498,"threshold_uncertainty_score":0.4358776},"labels":[],"label_agreement":null},{"id":"W3215138631","doi":"10.37236/11946","title":"Almost Every Matroid has an $M(K_4)$- or a $\\mathcal{W}^3$-Minor","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matroid; Minor (academic); Discrete mathematics; Humanities","score_opus":0.04081058879379447,"score_gpt":0.3119434884356311,"score_spread":0.2711328996418366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215138631","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.630517,0.003489472,0.35112816,0.010908842,0.0020439075,0.00060644204,0.0000033165434,0.00046935093,0.0008335234],"genre_scores_gemma":[0.99690473,0.0006948044,0.00021927842,0.00014779672,0.00014714045,0.000008097719,9.23723e-7,0.00003573477,0.0018414855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963898,0.00046519988,0.00053359487,0.00026684336,0.0010876791,0.0012568483],"domain_scores_gemma":[0.99735343,0.000674577,0.00037944593,0.00095311005,0.00040782455,0.00023158411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035326825,0.00022915618,0.00035836126,0.0004187539,0.00045775366,0.00027584806,0.0036529684,0.00008468449,0.00001977969],"category_scores_gemma":[0.00030251802,0.00014381387,0.00018100339,0.0027956073,0.00017907865,0.0010451633,0.00041400577,0.00124634,0.00011401488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016136322,0.00015509463,0.00010724594,0.000013048872,0.000080479535,0.00017294197,0.0006444392,0.00020208133,0.00097176724,0.99174416,0.0017736895,0.003973658],"study_design_scores_gemma":[0.00089481653,0.0018825912,0.00041010618,0.0000251428,0.00001899892,0.0009775491,0.00020210881,0.0043536406,0.0017459809,0.97781813,0.011453079,0.00021785518],"about_ca_topic_score_codex":0.0000037830378,"about_ca_topic_score_gemma":0.000007689876,"teacher_disagreement_score":0.36638775,"about_ca_system_score_codex":0.00034944803,"about_ca_system_score_gemma":0.0013290527,"threshold_uncertainty_score":0.6788185},"labels":[],"label_agreement":null},{"id":"W3216107441","doi":"10.37236/9849","title":"Biconed Graphs, Weighted Forests, and $h$-Vectors of Matroid Complexes","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"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 Waterloo","funders":"Texas State University; National Science Foundation","keywords":"Combinatorics; Matroid; Mathematics; Graphic matroid; Conjecture; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.007220578002477035,"score_gpt":0.21947755174072303,"score_spread":0.212256973738246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216107441","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.87048763,0.019858513,0.10669826,0.0024755371,0.00025254968,0.00004957529,0.0000030500396,0.000017583643,0.00015729794],"genre_scores_gemma":[0.9974583,0.0021372132,0.00023016392,0.000060782666,0.000019200872,4.7392518e-7,0.0000014411384,0.000004207649,0.00008826464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985003,0.00016952002,0.00043260364,0.00014101637,0.0004046785,0.00035187928],"domain_scores_gemma":[0.998469,0.00034400434,0.00041467207,0.00035770735,0.00033252712,0.00008211944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070888374,0.0001163245,0.00036831686,0.00023125597,0.00010869157,0.00006389544,0.0009139836,0.000046398705,0.000016884733],"category_scores_gemma":[0.00013421942,0.0000702503,0.00016218927,0.0021396384,0.0001065634,0.00022242745,0.0002275378,0.00035243342,0.0000014226163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009927288,0.000112374524,0.0026736,0.0000067428364,0.00015388853,0.000016295013,0.000055606386,0.0000061387905,0.0004655389,0.99464977,0.00028252747,0.0015676025],"study_design_scores_gemma":[0.00057402893,0.00048282876,0.009218248,0.000011148899,0.00008512156,0.00028740265,0.00005349966,0.00049319334,0.0061368733,0.980135,0.0024184908,0.00010413962],"about_ca_topic_score_codex":0.000015110454,"about_ca_topic_score_gemma":0.0000123018635,"teacher_disagreement_score":0.12697062,"about_ca_system_score_codex":0.000048263984,"about_ca_system_score_gemma":0.00021479824,"threshold_uncertainty_score":0.2864724},"labels":[],"label_agreement":null},{"id":"W4205569143","doi":"10.37236/10225","title":"Paths of Length Three are $K_{r+1}$-Turán-Good","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"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 Manitoba","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Path (computing); Discrete mathematics; Computer science","score_opus":0.017063377106575683,"score_gpt":0.26180194345081675,"score_spread":0.24473856634424107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205569143","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.976992,0.013089622,0.0044253636,0.00070079317,0.0010530727,0.00012029253,0.00000394175,0.000019135465,0.0035957892],"genre_scores_gemma":[0.9983648,0.0009948749,0.000095710115,0.000061332525,0.00014787671,0.0000011431601,3.9488242e-7,0.000031539923,0.00030231068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979041,0.00023011515,0.00066232414,0.00011828488,0.0006098516,0.0004752728],"domain_scores_gemma":[0.9970562,0.00073255674,0.0009800456,0.00054019206,0.00062211225,0.00006890979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014091876,0.00019036516,0.000521198,0.00008454312,0.00019139568,0.000023218658,0.0006782138,0.00011586794,0.000053339518],"category_scores_gemma":[0.0006050803,0.0001202461,0.0003310971,0.00040260752,0.00010821136,0.00009919786,0.00014249417,0.0009987114,0.0000011032644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046206726,0.00017762973,0.0007608865,0.00005276135,0.0002746121,0.000031680873,0.00051084365,0.000006172443,0.00023964357,0.9967647,0.00053145323,0.00060340314],"study_design_scores_gemma":[0.00082871265,0.0003044537,0.0007096115,0.00007603794,0.00019340163,0.00043833192,0.00044549306,0.000016246413,0.0065897587,0.9883298,0.0019377574,0.0001303954],"about_ca_topic_score_codex":0.0000014710481,"about_ca_topic_score_gemma":0.000013520621,"teacher_disagreement_score":0.021372829,"about_ca_system_score_codex":0.0001435336,"about_ca_system_score_gemma":0.00044243474,"threshold_uncertainty_score":0.49034938},"labels":[],"label_agreement":null},{"id":"W4210253911","doi":"10.37236/9858","title":"Slide Multiplicity Free Key Polynomials","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"Ajou University","keywords":"Multiplicity (mathematics); Mathematics; Polynomial; Key (lock); Combinatorics; Symmetric polynomial; Discrete mathematics; Algebra over a field; Pure mathematics; Matrix polynomial; Computer science; Geometry; Mathematical analysis","score_opus":0.021912945965397612,"score_gpt":0.2830913429359265,"score_spread":0.2611783969705289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210253911","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.9107429,0.0041254773,0.07034424,0.004150256,0.0055554365,0.0010882636,0.000018400893,0.00018700046,0.0037880368],"genre_scores_gemma":[0.99823594,0.000117432275,0.00048062933,0.00011421849,0.0002533102,0.000024190142,5.4345657e-7,0.00007564546,0.000698119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616736,0.0005252246,0.0010509156,0.00017215835,0.0012531187,0.00083120033],"domain_scores_gemma":[0.9951279,0.0019578962,0.0014841545,0.000992767,0.00031676303,0.00012049464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036633424,0.00028387987,0.0006515371,0.0001672693,0.00061494554,0.000041839732,0.0023110108,0.00006766877,0.000094595875],"category_scores_gemma":[0.0023178428,0.00021649567,0.0003203817,0.00065478677,0.0000784667,0.00018609146,0.0006789588,0.0019259002,0.0000062194445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011600361,0.0004678202,0.00003401897,0.000023169225,0.0001480832,0.000016923877,0.0008041307,0.00017777873,0.00048090974,0.9913569,0.006255591,0.000118670454],"study_design_scores_gemma":[0.0021080982,0.000811697,0.000011518366,0.000014901104,0.0001408444,0.00045360107,0.00058892235,0.00011218532,0.001986339,0.9801226,0.013423394,0.00022589855],"about_ca_topic_score_codex":0.000005937545,"about_ca_topic_score_gemma":0.0000031991694,"teacher_disagreement_score":0.087493025,"about_ca_system_score_codex":0.0013725128,"about_ca_system_score_gemma":0.00062632497,"threshold_uncertainty_score":0.8828437},"labels":[],"label_agreement":null},{"id":"W4213422038","doi":"10.37236/10556","title":"The Tree Alternative Conjecture Under the Topological Minor Relation","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"York University","funders":"","keywords":"Mathematics; Conjecture; Equivalence relation; Minor (academic); Combinatorics; Isomorphism (crystallography); Tree (set theory); Relation (database); Equivalence (formal languages); Class (philosophy); Equivalence class (music); Discrete mathematics; Aleph; Computer science","score_opus":0.014602869886890812,"score_gpt":0.27517264728094887,"score_spread":0.26056977739405807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213422038","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.26652148,0.017646557,0.62752444,0.08276348,0.0024804778,0.0006286015,0.0000014763506,0.000055171284,0.0023783045],"genre_scores_gemma":[0.99842954,0.0003626411,0.000019874107,0.0002973218,0.00007971675,0.000012307524,1.8996826e-7,0.000008449471,0.0007899799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683106,0.0012564085,0.00029920522,0.0001359152,0.000928671,0.0005487117],"domain_scores_gemma":[0.99688613,0.001976741,0.00039427404,0.0005252773,0.00017082262,0.00004677111],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037043889,0.00011855486,0.00014206393,0.00006412928,0.0015812664,0.000111089415,0.0033794162,0.000029746492,0.000014678034],"category_scores_gemma":[0.00014584181,0.000051451978,0.00014054369,0.000774168,0.00023495671,0.00018969609,0.00051626464,0.0020657405,0.0000033777335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006015411,0.00004099357,0.00003420259,4.2769094e-7,0.00006134106,0.000007888984,0.0004263958,0.0027013526,0.000052710355,0.99448174,0.000324472,0.0018083352],"study_design_scores_gemma":[0.00044071666,0.0008493054,0.0004020013,0.0000015812733,0.000012152153,0.00038360455,0.0005772533,0.002343702,0.00024549133,0.98324627,0.011429757,0.00006819688],"about_ca_topic_score_codex":0.0000032107794,"about_ca_topic_score_gemma":0.000005892868,"teacher_disagreement_score":0.731908,"about_ca_system_score_codex":0.0005208185,"about_ca_system_score_gemma":0.00038622096,"threshold_uncertainty_score":0.99971855},"labels":[],"label_agreement":null},{"id":"W4224305675","doi":"10.37236/10803","title":"Diagonal Hooks and a Schmidt-Type Partition Identity","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"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","funders":"Killam Trusts; Michigan Technological University; Simons Foundation","keywords":"Mathematics; Diagonal; Partition (number theory); Combinatorics; Identity (music); Type (biology); Combinatorial proof; Discrete mathematics; Geometry","score_opus":0.028329912523917263,"score_gpt":0.3128888972910232,"score_spread":0.28455898476710595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224305675","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.97475994,0.0041676904,0.018350968,0.00087954744,0.0005743834,0.00020124667,0.0000017555726,0.000034196935,0.00103026],"genre_scores_gemma":[0.9982346,0.0003866052,0.00008617124,0.000044819873,0.0000676033,0.000007646613,4.3480662e-7,0.000020678677,0.0011513949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982969,0.00019289437,0.0004093371,0.0000849173,0.0006617053,0.00035420695],"domain_scores_gemma":[0.99859935,0.0005485344,0.00042729665,0.00019073696,0.00017504321,0.000059039477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016421112,0.000114320705,0.00025465558,0.00008353744,0.00036010542,0.000051336803,0.00037580874,0.0000258531,0.0001177388],"category_scores_gemma":[0.00059085083,0.0000870613,0.00008519714,0.00028514286,0.00008893337,0.00033289246,0.00021225482,0.0008366026,0.0000041696367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004200486,0.00013535324,0.000071200295,0.00002928365,0.00006193459,0.000009398809,0.00031790877,0.000015697331,0.00016730581,0.99819833,0.00090302806,0.000048578397],"study_design_scores_gemma":[0.00046958734,0.00047754977,0.00006689851,0.000014020485,0.000098995275,0.00034970054,0.0005614896,0.000062301675,0.00029525947,0.99592084,0.0015904123,0.00009296739],"about_ca_topic_score_codex":0.0000018168563,"about_ca_topic_score_gemma":0.000003530672,"teacher_disagreement_score":0.023474693,"about_ca_system_score_codex":0.00034531925,"about_ca_system_score_gemma":0.00020654355,"threshold_uncertainty_score":0.36346686},"labels":[],"label_agreement":null},{"id":"W4225784836","doi":"10.37236/11794","title":"Upper Bounds on Chromatic Number of $\\mathbb{E}^n$ in Low Dimensions","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Combinatorics; Chromatic scale; Mathematics; Euclidean space; Space (punctuation); Unit (ring theory); Computer science","score_opus":0.01020809048327118,"score_gpt":0.29749140988231737,"score_spread":0.28728331939904617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225784836","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.9922551,0.0022728213,0.00031375582,0.0003207811,0.0008772936,0.00011543111,0.0000012389295,0.000015423113,0.0038281423],"genre_scores_gemma":[0.99896485,0.0004884429,0.000036891055,0.000047935664,0.0000726131,0.0000020780697,2.0724148e-7,0.000032671374,0.00035430407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820846,0.00018226774,0.0006313631,0.00010095899,0.0004734104,0.0004035657],"domain_scores_gemma":[0.9981637,0.0011048004,0.0002574472,0.0003276735,0.00009973375,0.000046658963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176553,0.00016816576,0.00038278746,0.00018749047,0.00010008101,0.000030006519,0.00042853592,0.00008951443,0.0000745236],"category_scores_gemma":[0.0002485264,0.000098235934,0.0002282217,0.0005076188,0.00010190336,0.00009427216,0.000062118284,0.00096645276,0.000009022607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003844144,0.00015144797,0.00015609317,0.00012839648,0.00013239107,0.000020186293,0.0011511194,0.000013127493,0.00010036837,0.9973583,0.0006271352,0.00012294724],"study_design_scores_gemma":[0.00041819652,0.00028574228,0.00017269888,0.00047759648,0.00008608136,0.00028873037,0.00018621757,0.00027943173,0.0007306512,0.99631786,0.00065320014,0.00010359481],"about_ca_topic_score_codex":0.0000021098979,"about_ca_topic_score_gemma":0.0000021400415,"teacher_disagreement_score":0.0067097438,"about_ca_system_score_codex":0.0003496534,"about_ca_system_score_gemma":0.0002797085,"threshold_uncertainty_score":0.41988102},"labels":[],"label_agreement":null},{"id":"W4225848310","doi":"10.37236/10418","title":"Further Approximations for Aharoni's Rainbow Generalization of the Caccetta-Häggkvist Conjecture","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"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","keywords":"Conjecture; Combinatorics; Rainbow; Digraph; Mathematics; Generalization; Omega; Graph; Constant (computer programming); Physics; Computer science; Mathematical analysis","score_opus":0.015413620237446208,"score_gpt":0.2672277642578714,"score_spread":0.25181414402042523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225848310","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.90481246,0.0050103827,0.076670356,0.0074355276,0.003256879,0.0016449161,0.00006284668,0.00003742944,0.0010692355],"genre_scores_gemma":[0.99898887,0.00005080218,0.000090616595,0.00015507333,0.00011740932,0.000021620994,0.000001872349,0.000030809762,0.0005429323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982404,0.00036816415,0.0005008706,0.00008716742,0.0004877262,0.00031564978],"domain_scores_gemma":[0.99795294,0.00047904468,0.0009098487,0.00038720027,0.00024422596,0.000026759775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016727682,0.000137998,0.00027254835,0.00008131665,0.00074299966,0.000019124729,0.0008840656,0.000048008154,0.00007532727],"category_scores_gemma":[0.0002829955,0.000076596625,0.0002927066,0.0004255624,0.000099656005,0.000058132024,0.00014921138,0.0006283585,8.139361e-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.000053962995,0.00008639723,0.00006384008,0.00003375934,0.00015314946,2.8159542e-7,0.001955571,0.0005847346,0.0001890687,0.99279684,0.0039552436,0.00012717753],"study_design_scores_gemma":[0.0008997068,0.00028586318,0.00005529373,0.000008169815,0.0001528136,0.00010802506,0.00044812085,0.00044518066,0.0011614875,0.9836344,0.012710294,0.00009060339],"about_ca_topic_score_codex":0.0000020372613,"about_ca_topic_score_gemma":0.0000026492678,"teacher_disagreement_score":0.094176434,"about_ca_system_score_codex":0.00025438136,"about_ca_system_score_gemma":0.00032854246,"threshold_uncertainty_score":0.57146275},"labels":[],"label_agreement":null},{"id":"W4234676776","doi":"10.37236/997","title":"Small Forbidden Configurations III","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Mathematics; Matrix (chemical analysis); Forb; Permutation (music); Physics","score_opus":0.008252513326393115,"score_gpt":0.19585237267408728,"score_spread":0.18759985934769416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234676776","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.8323086,0.0068317493,0.13843495,0.00013850276,0.0016528564,0.00014392905,5.620199e-7,0.00007191121,0.02041694],"genre_scores_gemma":[0.99933016,0.00021619964,0.0000033366634,0.000020575479,0.00013774604,9.849754e-7,3.924802e-7,0.00001753732,0.0002730652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898493,0.00004243449,0.00036650285,0.00003867791,0.00016630073,0.00040117017],"domain_scores_gemma":[0.9994084,0.00015163037,0.00011632641,0.00015523599,0.000107755746,0.00006059965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017493193,0.00009926141,0.00016083442,0.000091254435,0.00009501287,0.000023065344,0.00032320226,0.00005505919,0.0000141093],"category_scores_gemma":[0.000020252595,0.00007034119,0.00010330859,0.00026863947,0.000028081313,0.00007761039,0.000007812162,0.00051646604,0.0000091437105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021129137,0.000021223623,0.00003701932,0.000008206264,0.000104525796,0.000006857009,0.0003904318,0.00044582627,0.0022820826,0.99565476,0.00046524304,0.00056266406],"study_design_scores_gemma":[0.0012831633,0.00037856871,0.00052598736,0.00003853101,0.00009928784,0.0006297068,0.00091284985,0.0004422856,0.01626085,0.9430507,0.03614886,0.000229242],"about_ca_topic_score_codex":0.0000019896358,"about_ca_topic_score_gemma":0.000012936865,"teacher_disagreement_score":0.16702157,"about_ca_system_score_codex":0.00014236716,"about_ca_system_score_gemma":0.000068724694,"threshold_uncertainty_score":0.28684306},"labels":[],"label_agreement":null},{"id":"W4236584536","doi":"10.37236/2302","title":"Colourful Theorems and Indices of Homomorphism Complexes","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási és Technológiai Hivatal; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Clique; Homomorphism; Bipartite graph; Chromatic scale; Discrete mathematics; Order (exchange); Graph","score_opus":0.010795564709253575,"score_gpt":0.24760172170440536,"score_spread":0.23680615699515178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236584536","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.99352014,0.0036421355,0.0007142553,0.0003887513,0.0002413197,0.0001685106,0.0000011813206,0.000008665477,0.0013150441],"genre_scores_gemma":[0.9990468,0.00066044804,0.00006083103,0.0000481597,0.000054278873,0.0000019471715,1.7018439e-7,0.00001728911,0.000110073954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859434,0.0001858606,0.00047792858,0.000072083734,0.00033923986,0.0003305297],"domain_scores_gemma":[0.9978162,0.0009069379,0.0007224235,0.00023183784,0.0002632727,0.00005935008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011992424,0.00013982638,0.00037571392,0.00010390476,0.00017851747,0.00002845359,0.0005060087,0.00007156553,0.00006226538],"category_scores_gemma":[0.00020069648,0.000078870566,0.00010694527,0.00018790708,0.0003260831,0.00012736047,0.000097679345,0.0005341327,9.951351e-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.000027236889,0.00006413975,0.00053922686,0.000028975202,0.00014407029,0.000001363261,0.0012024165,9.604863e-7,0.000738981,0.9961332,0.0007599343,0.00035948362],"study_design_scores_gemma":[0.00059659855,0.0005091314,0.00096333324,0.0000295871,0.000090366695,0.00020969185,0.0004138747,0.000017058266,0.0025837773,0.99403447,0.00046305853,0.000089059424],"about_ca_topic_score_codex":0.000009402605,"about_ca_topic_score_gemma":0.0000015628941,"teacher_disagreement_score":0.005526665,"about_ca_system_score_codex":0.000049666123,"about_ca_system_score_gemma":0.000097320575,"threshold_uncertainty_score":0.32162482},"labels":[],"label_agreement":null},{"id":"W4245728343","doi":"10.37236/966","title":"Tilings of the sphere with right triangles III: the asymptotically obtuse families","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Tile; Geometry; Computer science; Geography; Artificial intelligence","score_opus":0.008621098544025596,"score_gpt":0.24912727062242357,"score_spread":0.24050617207839797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245728343","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.92771006,0.0011555896,0.059080258,0.0022771265,0.00028317067,0.00046945794,0.0000017700128,0.000017756955,0.009004843],"genre_scores_gemma":[0.9985834,0.00021322096,0.00016187642,0.00008562031,0.000073188065,0.0000015973458,1.2955869e-7,0.0000302097,0.00085077196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975131,0.00016353272,0.00083718105,0.00009665525,0.0008434373,0.0005460885],"domain_scores_gemma":[0.9954936,0.0024985156,0.000964308,0.0005601091,0.00041483392,0.00006864402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040436736,0.00020499714,0.00045809374,0.000045775956,0.00022181885,0.000041230745,0.001107079,0.000095730466,0.000042297932],"category_scores_gemma":[0.0006682908,0.000075437405,0.00025832327,0.00048212757,0.0003158707,0.00008069811,0.00009016534,0.0009954574,0.000002070084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014106912,0.00024721294,0.00008584112,0.000040999243,0.0001614506,0.0000059921513,0.0006618885,0.000008996669,0.00013585309,0.9978844,0.0002904482,0.0003358523],"study_design_scores_gemma":[0.0010564458,0.00044235564,0.00020934702,0.00011956025,0.00025786815,0.00026516838,0.00067317474,0.00024339561,0.0021847594,0.9929289,0.0015054545,0.000113574584],"about_ca_topic_score_codex":0.000005702898,"about_ca_topic_score_gemma":0.00005525868,"teacher_disagreement_score":0.07087336,"about_ca_system_score_codex":0.00014329156,"about_ca_system_score_gemma":0.00035527901,"threshold_uncertainty_score":0.43248224},"labels":[],"label_agreement":null},{"id":"W4248533316","doi":"10.37236/510","title":"Periodic Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":56,"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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Vertex (graph theory); Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics","score_opus":0.011760061440056056,"score_gpt":0.22103794996065518,"score_spread":0.20927788852059911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248533316","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.9540164,0.004189221,0.0012019421,0.00015515515,0.00022825293,0.000025925448,5.770276e-7,0.000020016554,0.040162493],"genre_scores_gemma":[0.9987959,0.00059282593,0.000009957483,0.00006444242,0.000056108296,0.0000012739057,3.9233467e-7,0.000016032283,0.00046301677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877834,0.000046194487,0.00032692254,0.000085793436,0.00031649903,0.00044625413],"domain_scores_gemma":[0.9991474,0.000027450513,0.00032533077,0.00031600424,0.000109826724,0.00007396085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050432986,0.00012983891,0.00019671312,0.00004017933,0.0001310712,0.000020555539,0.0006338751,0.00006928379,0.00052067806],"category_scores_gemma":[0.000038358223,0.00008678376,0.00020727483,0.00017482681,0.00008451763,0.0000759295,0.000037070316,0.00085291825,0.000009934927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009997798,0.00017997867,0.0012444531,0.00001522131,0.00012937188,0.000023653422,0.0007029993,5.903551e-7,0.010455754,0.98676807,0.00016246812,0.00021744642],"study_design_scores_gemma":[0.0005977076,0.0002607198,0.00036982226,0.000016568905,0.00009328506,0.0002909416,0.00014508488,0.00000485568,0.12281788,0.8694889,0.0057892636,0.00012497613],"about_ca_topic_score_codex":0.000010653788,"about_ca_topic_score_gemma":0.0000028926975,"teacher_disagreement_score":0.117279194,"about_ca_system_score_codex":0.00014579402,"about_ca_system_score_gemma":0.00026283955,"threshold_uncertainty_score":0.57010597},"labels":[],"label_agreement":null},{"id":"W4281708143","doi":"10.37236/10764","title":"Shattering and More: Extending the Complete Object","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computability, Logic, AI Algorithms","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Mathematics; Multiset; TRACE (psycholinguistics); Philosophy","score_opus":0.011696916278997643,"score_gpt":0.2291250644863417,"score_spread":0.21742814820734407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281708143","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.4556177,0.016148452,0.5030247,0.021769052,0.0026133049,0.00041477723,0.000001946172,0.000093355506,0.00031673064],"genre_scores_gemma":[0.99906415,0.0002103933,0.00016881376,0.00039641053,0.000095008625,0.0000067486653,1.7036595e-7,0.0000123263335,0.000045977617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976194,0.00045642798,0.0003994427,0.00020077034,0.000738269,0.00058569893],"domain_scores_gemma":[0.9982684,0.00062409346,0.00037888277,0.00055266416,0.00011089561,0.00006504058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003283352,0.00016048802,0.00025182567,0.00010494297,0.00089817605,0.00018996336,0.0024845684,0.000019325546,0.000011878572],"category_scores_gemma":[0.000068187284,0.0000991855,0.00012107302,0.00071787543,0.00010511393,0.00024158048,0.0013665106,0.001240764,0.0000013254022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023441064,0.0001321556,0.0005450954,0.000010390746,0.00010326561,0.000041421146,0.0025194276,0.002506268,0.00043945556,0.977755,0.00039961675,0.015524476],"study_design_scores_gemma":[0.00085630105,0.0011141928,0.004700226,0.000010349154,0.00004170861,0.0038234233,0.0004942999,0.064890556,0.00014160245,0.90633094,0.01733387,0.00026251381],"about_ca_topic_score_codex":0.000011047019,"about_ca_topic_score_gemma":0.0000014903325,"teacher_disagreement_score":0.5434465,"about_ca_system_score_codex":0.0005095475,"about_ca_system_score_gemma":0.00028309468,"threshold_uncertainty_score":0.6908135},"labels":[],"label_agreement":null},{"id":"W4285385873","doi":"10.37236/10489","title":"Upper Triangular Linear Relations on Mmultiplicities and the Stanley-Stembridge Conjecture","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Permutation (music); Schubert polynomial; Permutation group; Symmetric group; Multiplicity (mathematics); Cohomology ring; Connection (principal bundle); Discrete mathematics; Cohomology; Equivariant cohomology; Pure mathematics; Geometry","score_opus":0.01527832649119573,"score_gpt":0.2720821067415733,"score_spread":0.2568037802503776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285385873","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.94053227,0.011370277,0.026522843,0.01253807,0.0029637113,0.0023839287,0.000017356762,0.00011848066,0.0035530936],"genre_scores_gemma":[0.99749404,0.00027346023,0.00011303621,0.00015444125,0.00017412844,0.00004324168,7.984254e-7,0.000054559223,0.0016923028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685735,0.0008306341,0.0007940867,0.00013540036,0.0009176888,0.0004648584],"domain_scores_gemma":[0.99328756,0.0048983544,0.0010168629,0.0005299879,0.00020648482,0.00006075668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038056388,0.0002468918,0.00064809725,0.00012834588,0.00086145406,0.00004512612,0.00073285424,0.00006405406,0.00003850976],"category_scores_gemma":[0.0016182495,0.00013619957,0.00027044964,0.00042229396,0.00019677187,0.00010581115,0.00019840771,0.001987678,0.0000033247068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006712472,0.00017123616,0.000009264555,0.000017397286,0.00019739737,0.000006164925,0.0017761906,0.00044006016,0.000015425592,0.9955193,0.0011254493,0.00005087001],"study_design_scores_gemma":[0.008658022,0.0008253445,0.0000054696898,0.000026655396,0.00024416222,0.00031309237,0.001703895,0.0007217631,0.0001567285,0.9786278,0.008566588,0.00015048555],"about_ca_topic_score_codex":0.0000021153198,"about_ca_topic_score_gemma":8.5551363e-7,"teacher_disagreement_score":0.056961793,"about_ca_system_score_codex":0.0005379386,"about_ca_system_score_gemma":0.0003419938,"threshold_uncertainty_score":0.86355823},"labels":[],"label_agreement":null},{"id":"W4293298833","doi":"10.37236/10774","title":"Planar Turán Numbers of Cycles: A Counterexample","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Counterexample; Planar graph; Upper and lower bounds; Planar; Graph; Vertex (graph theory); Discrete mathematics; Mathematical analysis","score_opus":0.017569061698572492,"score_gpt":0.2723036695560613,"score_spread":0.2547346078574888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293298833","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.9925931,0.002297624,0.0017214686,0.00028493188,0.0008169177,0.00013904685,0.000009235277,0.000014015832,0.0021236222],"genre_scores_gemma":[0.99945265,0.00013907572,0.000033602006,0.00008245986,0.000060628085,0.0000028498084,6.293793e-7,0.0000237545,0.00020433444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807423,0.00028289622,0.0005290777,0.00008001856,0.0006588762,0.000374884],"domain_scores_gemma":[0.99808925,0.0006508212,0.0007529316,0.00032659774,0.0001366002,0.000043781532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019419786,0.00013041786,0.0003387388,0.00010532097,0.00035004166,0.000010628546,0.00086205103,0.000036271766,0.000112530644],"category_scores_gemma":[0.00015024986,0.00008751335,0.00020754091,0.00030718886,0.00009418067,0.00006093806,0.00012313206,0.00094438944,4.2250372e-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.00013400373,0.00012212768,0.00022203162,0.000021966662,0.00019324727,0.0000075270523,0.0020080297,0.00003231497,0.00013999295,0.9940024,0.0030397747,0.000076554315],"study_design_scores_gemma":[0.00072061445,0.0005995597,0.00008377841,0.000011628534,0.00009969997,0.00045086732,0.0013627034,0.00001829353,0.0003350395,0.9897852,0.0064385524,0.00009406897],"about_ca_topic_score_codex":0.00000845817,"about_ca_topic_score_gemma":0.0000029919404,"teacher_disagreement_score":0.006859529,"about_ca_system_score_codex":0.0002779303,"about_ca_system_score_gemma":0.00025450703,"threshold_uncertainty_score":0.4102955},"labels":[],"label_agreement":null},{"id":"W4296896544","doi":"10.37236/8370","title":"Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Urbanization and City Planning","field":"Social Sciences","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 Calgary; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Countable set; Metric space; Partition (number theory); Automorphism; Urysohn and completely Hausdorff spaces; Infinite group; Conjecture; Combinatorics; Homogeneous; Existential quantification; Group (periodic table); Discrete mathematics","score_opus":0.010368654293787628,"score_gpt":0.26649082644406896,"score_spread":0.2561221721502813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296896544","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.96638924,0.0029206304,0.001645068,0.0015238338,0.0010407122,0.000101416364,0.0000029012351,0.00002420751,0.02635198],"genre_scores_gemma":[0.99801207,0.00024948758,0.000009579926,0.00003383774,0.00007741733,4.3298417e-7,7.7014795e-7,0.00000824914,0.0016081404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982933,0.00039296466,0.00022641858,0.000056556553,0.0007226674,0.0003080894],"domain_scores_gemma":[0.99882984,0.0002978216,0.0004845492,0.00008515561,0.00024985042,0.000052798285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019302602,0.00006130888,0.00015420679,0.0001047492,0.0007559616,0.000042366515,0.0005820859,0.000025270698,0.00025546327],"category_scores_gemma":[0.00042635744,0.000052021824,0.00007322629,0.0012723416,0.00008075328,0.00010066626,0.000071557806,0.0005081599,0.0000022252332],"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.0000252901,0.00009034555,0.0060897986,0.0000028822408,0.00006205866,0.000013061928,0.007387738,0.0005765638,0.00002716052,0.9839733,0.0014952545,0.00025653534],"study_design_scores_gemma":[0.0013001101,0.00076016283,0.0010449616,0.000021372682,0.00028845307,0.00034433536,0.056494027,0.0002971823,0.00021651243,0.36289892,0.5759709,0.00036310987],"about_ca_topic_score_codex":0.00025213612,"about_ca_topic_score_gemma":0.000032539978,"teacher_disagreement_score":0.6210744,"about_ca_system_score_codex":0.0005629974,"about_ca_system_score_gemma":0.00083628367,"threshold_uncertainty_score":0.58143216},"labels":[],"label_agreement":null},{"id":"W4297724406","doi":"10.37236/10411","title":"$2\\times n$ Grids have Unbounded Anagram-Free Chromatic Number","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","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":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Anagram; Mathematics; Combinatorics; Vertex (graph theory); Bounded function; Chromatic scale; Square-free integer; Grid; Discrete mathematics; Graph; Geometry","score_opus":0.008679594744389717,"score_gpt":0.2614543574190871,"score_spread":0.2527747626746974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297724406","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.30600274,0.009879853,0.6512208,0.016697822,0.0029817151,0.00088843534,0.000005755314,0.00023381769,0.01208906],"genre_scores_gemma":[0.99811286,0.00017686434,0.00024455605,0.0001621014,0.00006303407,0.000013486429,5.1083003e-7,0.000023223829,0.0012033384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962666,0.00071236584,0.0004874511,0.00020224703,0.0014196298,0.00091172336],"domain_scores_gemma":[0.9975186,0.00050400564,0.00046949307,0.0011314747,0.0002526298,0.00012380845],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0032635138,0.00018755348,0.00031925886,0.00019912077,0.0007172497,0.00014314553,0.0054213027,0.00003426854,0.00010577289],"category_scores_gemma":[0.00021262276,0.0001399463,0.000210013,0.0013492601,0.00013650343,0.0004799442,0.0011793082,0.0016990534,0.000016858132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037904625,0.00015960568,0.00017986781,0.000006401594,0.00009799782,0.000039114027,0.00043353482,0.00035852034,0.00007993448,0.99566364,0.0020964155,0.0008470645],"study_design_scores_gemma":[0.0010468254,0.000798,0.00011151334,0.000006739329,0.000020851587,0.0010354228,0.00023041239,0.0023469473,0.0003987062,0.9862445,0.007601082,0.00015900056],"about_ca_topic_score_codex":0.0000053518365,"about_ca_topic_score_gemma":0.0000022923646,"teacher_disagreement_score":0.6921102,"about_ca_system_score_codex":0.00087683514,"about_ca_system_score_gemma":0.00084165315,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W4306652466","doi":"10.37236/11179","title":"Digraphs with All Induced Directed Cycles of the Same Length are not $\\vec{\\chi}$-Bounded","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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 Waterloo","funders":"Marsden Fund; Royal Society Te Apārangi; Royal Society","keywords":"Combinatorics; Mathematics; Bounded function; Digraph; Chordal graph; Clique; Vertex (graph theory); Discrete mathematics; Treewidth; Graph; Pathwidth","score_opus":0.017181983305825422,"score_gpt":0.2577195889919505,"score_spread":0.2405376056861251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306652466","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.98783267,0.0019322284,0.005359992,0.003822719,0.00044091744,0.0003155126,0.000003017159,0.00005441867,0.00023851157],"genre_scores_gemma":[0.9992511,0.000259163,0.00008371753,0.00019969931,0.000025703048,0.000012025664,2.98363e-7,0.000025240739,0.00014302238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596596,0.0009930655,0.00047517548,0.00022428736,0.0015821572,0.0007593392],"domain_scores_gemma":[0.9970617,0.0005158794,0.0009961306,0.000943148,0.0003893847,0.00009372039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021378414,0.00021180573,0.00038409428,0.00024135175,0.00057363196,0.00007181051,0.004130617,0.00004128154,0.000010471061],"category_scores_gemma":[0.00015342308,0.00012059275,0.00021897012,0.002115068,0.00019585084,0.0003171069,0.00069137855,0.0019925563,0.0000010007916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026295974,0.00031647398,0.0011244217,0.000011005467,0.0002537281,0.000015062073,0.0010098309,0.00039525633,0.002480653,0.993307,0.00009582582,0.00072777073],"study_design_scores_gemma":[0.001844673,0.0018552396,0.006575652,0.000039234226,0.00006498631,0.0004928989,0.0004252194,0.0010043909,0.013938661,0.97072536,0.0027607966,0.0002728867],"about_ca_topic_score_codex":0.000014480492,"about_ca_topic_score_gemma":0.000018948926,"teacher_disagreement_score":0.02258165,"about_ca_system_score_codex":0.00042409447,"about_ca_system_score_gemma":0.0008788835,"threshold_uncertainty_score":0.86567765},"labels":[],"label_agreement":null},{"id":"W4306976709","doi":"10.37236/11070","title":"On the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Planar graph; Hamiltonian path; Discrete mathematics; Outerplanar graph; Prism; Graph; Line graph; Pathwidth; Physics; Optics","score_opus":0.012745447788768032,"score_gpt":0.2377635597652711,"score_spread":0.22501811197650307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306976709","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.90634227,0.004657163,0.06344625,0.020793207,0.0011321462,0.0008838892,0.0000063831217,0.00007595254,0.002662741],"genre_scores_gemma":[0.9991232,0.00017786343,0.000035187277,0.00026587473,0.000015877802,0.000013551711,3.0625597e-7,0.000015660833,0.00035247408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964705,0.0011035968,0.00041787775,0.00016495271,0.0012063634,0.0006367213],"domain_scores_gemma":[0.9972584,0.0011410918,0.00047005634,0.000785983,0.00027268298,0.00007173402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037402094,0.00014967672,0.0002553697,0.00027769164,0.0006261344,0.000041505362,0.003892185,0.000026282396,0.00002803423],"category_scores_gemma":[0.00026431782,0.000070145456,0.00018113958,0.0018067202,0.00018077258,0.00017947248,0.0003224279,0.0018525855,0.0000028751062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014897798,0.00017499056,0.00004163477,0.000003857609,0.00008541855,0.00001487609,0.0004995639,0.00038331427,0.0008932752,0.99612784,0.0006704505,0.0009557816],"study_design_scores_gemma":[0.0005658861,0.0022410438,0.00011926953,0.000010349067,0.000010588284,0.0002054464,0.00012974977,0.000685678,0.0021061613,0.98973846,0.0040905257,0.0000968643],"about_ca_topic_score_codex":0.0000072134358,"about_ca_topic_score_gemma":0.0000021674862,"teacher_disagreement_score":0.09278094,"about_ca_system_score_codex":0.00031151867,"about_ca_system_score_gemma":0.00073070556,"threshold_uncertainty_score":0.8048665},"labels":[],"label_agreement":null},{"id":"W4306976805","doi":"10.37236/11037","title":"Crowns in Linear $3$-Graphs of Minimum Degree $4$","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.008747014920304353,"score_gpt":0.20061773821357293,"score_spread":0.19187072329326857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306976805","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.98954725,0.0075813252,0.00046316726,0.00006722042,0.0009976656,0.00008619804,0.0000018262699,0.000015662736,0.00123966],"genre_scores_gemma":[0.999563,0.00028405097,0.0000021709168,0.000010614419,0.000026803365,0.0000047838694,4.0375238e-7,0.000020328445,0.00008783953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862355,0.00018390603,0.00047539364,0.000051756135,0.00031822253,0.00034718242],"domain_scores_gemma":[0.99940944,0.0001279501,0.00018198948,0.00019126029,0.00005491237,0.00003442498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510876,0.000105662875,0.00026144972,0.0002214343,0.00007179762,0.0000054889038,0.00052621367,0.00003288951,0.000029543915],"category_scores_gemma":[0.00002203201,0.0000840593,0.00014178298,0.0007328155,0.00003367579,0.00006158503,0.000039012528,0.00087777287,0.0000012003492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014274828,0.00021890506,0.0018211901,0.00006406823,0.00021941475,0.000029368115,0.001594073,0.029084317,0.0045591844,0.9608461,0.0008722562,0.00054834137],"study_design_scores_gemma":[0.0021374326,0.00134379,0.0011211659,0.000046927413,0.000074985284,0.0004838949,0.0017623595,0.003098294,0.0050117387,0.97338045,0.011268046,0.00027093943],"about_ca_topic_score_codex":0.000004404955,"about_ca_topic_score_gemma":0.000005193219,"teacher_disagreement_score":0.025986023,"about_ca_system_score_codex":0.00018950267,"about_ca_system_score_gemma":0.000111269605,"threshold_uncertainty_score":0.38135353},"labels":[],"label_agreement":null},{"id":"W4311003387","doi":"10.37236/10962","title":"The EKR-Module Property of Pseudo-Paley Graphs of Square Order","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Clique; Property (philosophy); Order (exchange); Square (algebra); Clique number; Block (permutation group theory); Discrete mathematics; Graph; Geometry","score_opus":0.004352458934925816,"score_gpt":0.18179650405606376,"score_spread":0.17744404512113796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311003387","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.9797908,0.01615808,0.0007251827,0.00023475822,0.0012252759,0.00023928942,0.0000046146065,0.000025443975,0.0015965507],"genre_scores_gemma":[0.99893725,0.00077327195,0.0000020174318,0.000007852154,0.000026396941,0.000009548985,4.8636275e-7,0.000026395772,0.00021677089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821675,0.0002871801,0.0005625735,0.00006170539,0.00049715,0.0003746553],"domain_scores_gemma":[0.9988739,0.00017976636,0.00035018168,0.0003322172,0.00022679233,0.000037138296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019459038,0.00013232409,0.00029287612,0.00009640936,0.00025158352,0.000011737673,0.0007850293,0.00003475676,0.000023233104],"category_scores_gemma":[0.000044978475,0.00006777725,0.00018962992,0.0007572296,0.00008427371,0.00006678043,0.00005653234,0.00078009797,8.460073e-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.00015550578,0.00015432558,0.0005789259,0.000099886616,0.00052391837,0.000003972589,0.0010059457,0.013144148,0.0038351058,0.97825825,0.0014164235,0.00082357856],"study_design_scores_gemma":[0.0017338801,0.0020955284,0.0004536286,0.00007596379,0.00018768784,0.00044693096,0.002827346,0.00284993,0.011292073,0.9467114,0.031026106,0.00029952993],"about_ca_topic_score_codex":0.0000073239285,"about_ca_topic_score_gemma":0.000004426465,"teacher_disagreement_score":0.03154687,"about_ca_system_score_codex":0.00012808459,"about_ca_system_score_gemma":0.00016742913,"threshold_uncertainty_score":0.3389181},"labels":[],"label_agreement":null},{"id":"W4319722891","doi":"10.37236/11461","title":"Cooperative Colorings of Forests","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Star (game theory); Graph; Greedy coloring; Discrete mathematics; Line graph","score_opus":0.015500626155127003,"score_gpt":0.2886190215033137,"score_spread":0.2731183953481867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319722891","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.78401273,0.0017177337,0.2095206,0.002528331,0.00049514644,0.00023630536,7.7651833e-7,0.00006529956,0.0014230768],"genre_scores_gemma":[0.9990311,0.0004663506,0.000034442644,0.000018942721,0.000018553597,0.000002841343,1.4651529e-7,0.0000092416485,0.0004183281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829346,0.00018884789,0.00032637065,0.000099462224,0.00057171984,0.0005201175],"domain_scores_gemma":[0.99822664,0.0005644432,0.00030000348,0.00034523648,0.0005003577,0.00006331997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020979573,0.0000940479,0.00021908173,0.00022676976,0.00012008185,0.000031162217,0.0017152833,0.0000336667,0.0000028283582],"category_scores_gemma":[0.0002469394,0.000061942956,0.00009752117,0.0020510277,0.00011633098,0.0003412372,0.00023204104,0.00058261206,0.00001344112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033974306,0.000036204878,0.00022699125,0.000005274583,0.000045736233,0.000011856672,0.00031168174,0.00056186126,0.0010168505,0.9969695,0.00021887234,0.000561147],"study_design_scores_gemma":[0.00053211115,0.0009594623,0.0007549722,0.000016154741,0.000006904577,0.0000692007,0.0000764839,0.00093484763,0.018759875,0.97613513,0.0016869796,0.00006789387],"about_ca_topic_score_codex":0.0000013526518,"about_ca_topic_score_gemma":0.0000029160492,"teacher_disagreement_score":0.21501842,"about_ca_system_score_codex":0.00014614785,"about_ca_system_score_gemma":0.0005165665,"threshold_uncertainty_score":0.31874517},"labels":[],"label_agreement":null},{"id":"W4323670410","doi":"10.37236/11586","title":"Constructions and Restrictions for Balanced Splittable Hadamard Matrices","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Combinatorics; Hadamard transform; Hadamard matrix; Block matrix; Matrix (chemical analysis); Discrete mathematics; Row; Abelian group; Eigenvalues and eigenvectors; Computer science","score_opus":0.005811934820727407,"score_gpt":0.20609010508360373,"score_spread":0.2002781702628763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323670410","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.9748457,0.0073793936,0.013485024,0.0004204384,0.001935891,0.00024159314,0.000007243509,0.00016464155,0.0015200895],"genre_scores_gemma":[0.99713063,0.0025166469,0.000012718305,0.0000050004014,0.00008902404,0.000010135492,8.078114e-7,0.000015361706,0.00021966366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992683,0.000033423097,0.0002338478,0.000048115766,0.0001104306,0.00030589377],"domain_scores_gemma":[0.99945015,0.00023858943,0.00008446,0.00010578811,0.00007880923,0.000042215674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005994696,0.00008067444,0.00015354963,0.00013978867,0.00018557829,0.000033916713,0.00014852156,0.000041720952,0.0000023607472],"category_scores_gemma":[0.000033985612,0.000060467675,0.00006884852,0.0005998422,0.000034624733,0.00010133958,0.000010246064,0.0002599248,0.0000033407944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001841823,0.000010116965,0.00035084397,0.000042452364,0.0001369358,0.0000014354808,0.00013139965,0.0022546253,0.00076123636,0.99140424,0.0044069802,0.00048130497],"study_design_scores_gemma":[0.00081627676,0.00021611464,0.0006723955,0.00003113361,0.00009789058,0.00030931982,0.00066277554,0.0033293099,0.00066838495,0.950177,0.042894598,0.00012476442],"about_ca_topic_score_codex":0.0000017261611,"about_ca_topic_score_gemma":0.0000016027595,"teacher_disagreement_score":0.041227214,"about_ca_system_score_codex":0.00007020777,"about_ca_system_score_gemma":0.00005940778,"threshold_uncertainty_score":0.24658003},"labels":[],"label_agreement":null},{"id":"W4377139441","doi":"10.37236/11537","title":"A Cantor-Bendixson Rank for Siblings of Trees","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical Dynamics and Fractals","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 Calgary","funders":"","keywords":"Mathematics; Transfinite number; Combinatorics; Conjecture; Tree (set theory); Rank (graph theory); Recursion (computer science); Representation (politics); Discrete mathematics; Algorithm","score_opus":0.03491132897309101,"score_gpt":0.3256627825396258,"score_spread":0.29075145356653476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377139441","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.92999834,0.0010476221,0.06456851,0.0020424286,0.00050001586,0.0005423034,0.00001253109,0.000049284656,0.0012389879],"genre_scores_gemma":[0.9985354,0.00043390473,0.00012733159,0.000016724045,0.00007522393,0.000006971322,0.0000011035987,0.00003099389,0.000772367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983174,0.000058863414,0.00066375214,0.00007676957,0.00041938177,0.00046379477],"domain_scores_gemma":[0.9968275,0.0018656419,0.00069642364,0.00023546482,0.00031537528,0.000059635386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002438654,0.00013225708,0.00045723922,0.00017543996,0.00008034763,0.00002057982,0.0004739421,0.00007103485,0.000016768792],"category_scores_gemma":[0.0010401425,0.00008340556,0.00027024062,0.0005576988,0.000049670238,0.00007049499,0.000040421008,0.00033335562,0.0000033261415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006169639,0.00012637374,0.000024498637,0.00012382897,0.0001280925,0.0000020101586,0.00036659607,0.000012995955,0.0006254172,0.99552494,0.002708946,0.00029458592],"study_design_scores_gemma":[0.00090374204,0.0005403768,0.000041070944,0.000066121596,0.00012885615,0.00002955263,0.00019046031,0.00403575,0.0009640955,0.9911857,0.001824755,0.000089493544],"about_ca_topic_score_codex":0.0000033912347,"about_ca_topic_score_gemma":0.000011418352,"teacher_disagreement_score":0.06853707,"about_ca_system_score_codex":0.00011143624,"about_ca_system_score_gemma":0.00023690845,"threshold_uncertainty_score":0.34011802},"labels":[],"label_agreement":null},{"id":"W4379185352","doi":"10.37236/11281","title":"Generalized Riemann Functions, Their Weights, and the Complete Graph","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Riemann hypothesis; Combinatorics; Rank (graph theory); Weight function; Graph; Function (biology); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.024589569102364855,"score_gpt":0.26070422665529713,"score_spread":0.2361146575529323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379185352","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.9767521,0.0046848967,0.0059736925,0.010721107,0.0003989561,0.0004203639,0.0000071949607,0.00008513665,0.0009565581],"genre_scores_gemma":[0.9964256,0.0024463485,0.0000141594755,0.00011892135,0.00009571351,0.000020170222,0.0000020755028,0.000020887177,0.00085607247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985013,0.00038894944,0.00040093588,0.00009262695,0.00024837424,0.00036783013],"domain_scores_gemma":[0.997593,0.0014713334,0.00036799195,0.0003655423,0.00015078524,0.000051361963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028818054,0.00014424737,0.00029127055,0.000114799965,0.00059097365,0.000048443686,0.00048021888,0.00004594888,0.000013148607],"category_scores_gemma":[0.00013048341,0.00006782359,0.00020392703,0.00078726985,0.00027751378,0.00007125978,0.00006440192,0.00058947096,0.000013359599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008392803,0.00004182576,0.00002413093,0.000008105384,0.00016820106,8.9130214e-7,0.00044900962,0.0000055263295,0.000098083445,0.9939773,0.0050281035,0.00011487124],"study_design_scores_gemma":[0.0016028135,0.00008553667,0.00010397548,0.000011838529,0.0001405597,0.00012651633,0.00042577088,0.00013449976,0.00012846863,0.9723604,0.024798278,0.00008135462],"about_ca_topic_score_codex":0.0000025981683,"about_ca_topic_score_gemma":0.000003585437,"teacher_disagreement_score":0.021616936,"about_ca_system_score_codex":0.00004060414,"about_ca_system_score_gemma":0.00008717019,"threshold_uncertainty_score":0.4545351},"labels":[],"label_agreement":null},{"id":"W4380990053","doi":"10.37236/11623","title":"Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Tree (set theory); Pyramid (geometry); Diamond; Discrete mathematics; Geometry; Chemistry","score_opus":0.010780389594643301,"score_gpt":0.2390661114478326,"score_spread":0.2282857218531893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380990053","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.9070511,0.0019483074,0.08480999,0.0048962673,0.0007978048,0.00014186066,0.0000014893327,0.00007869084,0.00027451775],"genre_scores_gemma":[0.9985607,0.0009576833,0.00018218605,0.00010814869,0.00007515452,0.000004856884,0.0000029115959,0.0000102728645,0.000098074284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984521,0.00014932649,0.00034846817,0.00015976623,0.00047567888,0.0004146037],"domain_scores_gemma":[0.9986906,0.0003294119,0.000260331,0.00037181764,0.00024481193,0.00010302858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973725,0.00013836438,0.0001919888,0.00044988247,0.00031729726,0.00014423617,0.0010312296,0.00005773112,0.0000015145677],"category_scores_gemma":[0.00009265266,0.00010719163,0.0001184405,0.002194134,0.000046660014,0.00041784492,0.00020208223,0.00047724292,0.0000074292448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013024455,0.000068080124,0.00018542733,0.000004648574,0.000068314395,0.000011336009,0.00031744278,0.0005899629,0.0022675984,0.98886573,0.0013813229,0.0062271254],"study_design_scores_gemma":[0.00086218666,0.0004962066,0.0069045937,0.000013233598,0.000031427397,0.00014673242,0.00004099382,0.0052733915,0.0017275694,0.98333836,0.0010292172,0.00013611035],"about_ca_topic_score_codex":0.0000043623577,"about_ca_topic_score_gemma":0.000011587913,"teacher_disagreement_score":0.09150964,"about_ca_system_score_codex":0.0000867091,"about_ca_system_score_gemma":0.0002993287,"threshold_uncertainty_score":0.43711478},"labels":[],"label_agreement":null},{"id":"W4380990376","doi":"10.37236/11571","title":"Maximal Degree Subposets of $\\nu$-Tamari Lattices","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Partially ordered set; Degree (music); Lattice (music); Path (computing); Order (exchange); Discrete mathematics; Physics; Computer science","score_opus":0.02244841850190152,"score_gpt":0.254418024334184,"score_spread":0.23196960583228246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380990376","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.7942814,0.0058287513,0.19243103,0.0037596154,0.0013835981,0.00016384524,9.4061147e-7,0.000115316776,0.0020355],"genre_scores_gemma":[0.99873334,0.00074587937,0.00014345553,0.00006493648,0.00005859293,0.0000010744802,3.1360992e-7,0.000009817487,0.00024257196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982925,0.00011718613,0.00040744472,0.00012159236,0.00051047624,0.00055076525],"domain_scores_gemma":[0.9984699,0.00034425824,0.0005145337,0.00038097604,0.00022356951,0.00006675486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011921668,0.00012804837,0.0002658951,0.00016298714,0.00011673304,0.000039986837,0.0017003159,0.00005175047,0.0000054288985],"category_scores_gemma":[0.00010846456,0.000083380364,0.00013745046,0.0011620516,0.00006684646,0.0003792555,0.0002016873,0.0005321231,0.000021084415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001854004,0.000058344398,0.00035502115,0.000010048783,0.00004811287,0.00002440482,0.0002656378,0.00017483844,0.00041213472,0.9922521,0.00033609456,0.00604469],"study_design_scores_gemma":[0.0005372959,0.00070697325,0.0037216477,0.000017949473,0.000024000892,0.0001606387,0.000062122366,0.001450411,0.0025744399,0.98802406,0.0026084539,0.00011198308],"about_ca_topic_score_codex":0.0000023721107,"about_ca_topic_score_gemma":0.0000026560529,"teacher_disagreement_score":0.20445196,"about_ca_system_score_codex":0.000104164275,"about_ca_system_score_gemma":0.00034258197,"threshold_uncertainty_score":0.34001526},"labels":[],"label_agreement":null},{"id":"W4380992167","doi":"10.37236/11307","title":"On the Running Time of Hypergraph Bootstrap Percolation","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":5,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Indian Institute of Science Education and Research Mohali; Indian Institute of Science Education and Research Pune; University of Victoria","keywords":"Hypergraph; Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Constant (computer programming); Graph; Omega; Complete graph; Discrete mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.03652708860321113,"score_gpt":0.300824066326651,"score_spread":0.26429697772343985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380992167","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.7720605,0.00067708065,0.22173622,0.0030635048,0.00050504506,0.00034192926,0.0000051328034,0.000055960583,0.0015546181],"genre_scores_gemma":[0.99952877,0.00011614194,0.000033708577,0.000044998087,0.000042036863,0.0000026098378,4.1278668e-7,0.000018040317,0.00021330638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986384,0.000070058224,0.00040015124,0.00006571853,0.00050421734,0.00032145705],"domain_scores_gemma":[0.9965785,0.002575145,0.00038631167,0.00019509306,0.00022896343,0.00003598245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016319318,0.00010695963,0.00023182986,0.000090996626,0.00013785347,0.000017633654,0.00039698672,0.000048942995,0.000034710436],"category_scores_gemma":[0.0014072709,0.00005685453,0.000110920126,0.000597656,0.00004191268,0.00004247403,0.00003146281,0.0005096774,0.000018113691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004356,0.000052773077,0.0000033693002,0.000018484237,0.000060935134,0.0000024244684,0.0002858791,0.000041941345,0.00042681734,0.9973158,0.0015566647,0.0001913464],"study_design_scores_gemma":[0.00028962587,0.00065670174,0.000039893574,0.000059394075,0.00007969166,0.000032011925,0.00021256576,0.0051533263,0.00064810546,0.9926631,0.000104566505,0.00006103521],"about_ca_topic_score_codex":7.5186637e-7,"about_ca_topic_score_gemma":3.562379e-7,"teacher_disagreement_score":0.22746824,"about_ca_system_score_codex":0.000075073636,"about_ca_system_score_gemma":0.00018107399,"threshold_uncertainty_score":0.23184603},"labels":[],"label_agreement":null},{"id":"W4382776389","doi":"10.37236/11990","title":"Hadamard Matrices related to Projective Planes","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hadamard transform; Hadamard matrix; Combinatorics; Projective plane; Projective test; Order (exchange); Matrix (chemical analysis); Complex Hadamard matrix; Pure mathematics; Hadamard's inequality; Hadamard's maximal determinant problem; Geometry; Mathematical analysis; Composite material","score_opus":0.004127754479292991,"score_gpt":0.20626214929694514,"score_spread":0.20213439481765216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382776389","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.99111766,0.003385751,0.0004692195,0.00043608143,0.0014242403,0.0001994098,0.0000014580551,0.0001950976,0.0027710595],"genre_scores_gemma":[0.9989458,0.00047512513,0.0000010814771,0.000015480371,0.000051771378,0.0000053577223,7.0395294e-7,0.000025743993,0.00047896625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988513,0.000092384194,0.0003131142,0.00006120545,0.00025683304,0.0004251354],"domain_scores_gemma":[0.99943775,0.00015958458,0.00009577332,0.00014853186,0.00008240246,0.00007595434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011306899,0.00011897309,0.0002034221,0.0002342139,0.0000874789,0.000029061346,0.00037416234,0.000058426354,0.0000063420152],"category_scores_gemma":[0.000060520528,0.000081399376,0.000111312955,0.0012423337,0.000016154847,0.00009300452,0.00002116504,0.00049867044,0.00008761043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008322819,0.000034530512,0.00037262848,0.00005881805,0.00055934454,0.000046282097,0.0030961842,0.014206849,0.0012911282,0.96279496,0.016680405,0.00077565905],"study_design_scores_gemma":[0.00061233074,0.0005887567,0.00065550295,0.00007496566,0.00008380988,0.00038584988,0.0012812212,0.00093349966,0.0016651292,0.9700743,0.023414545,0.00023009666],"about_ca_topic_score_codex":0.0000020530517,"about_ca_topic_score_gemma":0.0000015403874,"teacher_disagreement_score":0.01327335,"about_ca_system_score_codex":0.00015261001,"about_ca_system_score_gemma":0.000091794296,"threshold_uncertainty_score":0.33193702},"labels":[],"label_agreement":null},{"id":"W4382791606","doi":"10.37236/11463","title":"How Many Cliques Can a Clique Cover Cover?","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Commutative Algebra and Its Applications","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 Waterloo","funders":"","keywords":"Enumeration; Combinatorics; Mathematics; Partition (number theory); Quotient; Discrete mathematics; Clique; Clique graph; Cover (algebra); Graph; Line graph; Graph power","score_opus":0.027865984028710555,"score_gpt":0.3055270144663083,"score_spread":0.27766103043759777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382791606","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.9146166,0.0018276356,0.04514541,0.03406909,0.00040503909,0.00051098067,0.000010777046,0.00016195285,0.003252518],"genre_scores_gemma":[0.9943948,0.0014125229,0.000026373724,0.00017667303,0.000114310074,0.000013307837,0.0000018382004,0.00003643375,0.0038237488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983746,0.00020779805,0.00037912346,0.00010564573,0.00041946745,0.0005133935],"domain_scores_gemma":[0.9978481,0.0008338437,0.00049665285,0.00039304097,0.0003494252,0.00007894537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273672,0.00016669786,0.00031606606,0.00013608705,0.000208819,0.00009554148,0.00064644415,0.00007136344,0.000023030974],"category_scores_gemma":[0.00040616273,0.00011335071,0.00018214501,0.0007474393,0.000074457006,0.00014492587,0.00009675189,0.00082504755,0.00003585526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023896906,0.00008126055,0.0000904642,0.000015688807,0.00012243155,0.0000066801535,0.0006622512,0.000003978357,0.00037438612,0.9774038,0.020955117,0.0002600171],"study_design_scores_gemma":[0.000531267,0.00037731696,0.00028336875,0.000023693266,0.00008877729,0.00009023055,0.00034587877,0.00012285725,0.0032086275,0.9645582,0.03024216,0.00012763099],"about_ca_topic_score_codex":0.000003834439,"about_ca_topic_score_gemma":0.0000073214983,"teacher_disagreement_score":0.079778194,"about_ca_system_score_codex":0.00034951625,"about_ca_system_score_gemma":0.00047909157,"threshold_uncertainty_score":0.4622308},"labels":[],"label_agreement":null},{"id":"W4384339936","doi":"10.37236/11657","title":"Graphs of Linear Growth have Bounded Treewidth","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Australian Government","keywords":"Combinatorics; Treewidth; Mathematics; Bounded function; Discrete mathematics; Graph; Partial k-tree; 1-planar graph; Pathwidth; Chordal graph; Line graph","score_opus":0.016056357463164528,"score_gpt":0.28395786498195147,"score_spread":0.26790150751878694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384339936","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.5965082,0.0037512502,0.3913958,0.0047119483,0.0011599554,0.0004055652,0.0000023522905,0.00017478452,0.0018901414],"genre_scores_gemma":[0.99814147,0.0012286245,0.00015490256,0.00003726023,0.00003776588,0.000002409935,3.9885646e-7,0.000017511928,0.00037964032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973875,0.00030027275,0.0004899399,0.00015568014,0.00090258813,0.0007639792],"domain_scores_gemma":[0.9977127,0.00058235164,0.00045279108,0.0005544095,0.0005928522,0.00010490966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028983348,0.0001485839,0.00031849532,0.00047766496,0.00019665947,0.000042841235,0.0024692307,0.00005773699,0.0000035356443],"category_scores_gemma":[0.00028660914,0.000102132195,0.00022421339,0.0024206755,0.00017320659,0.00038589592,0.00026176695,0.0008741294,0.000013173821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043644875,0.00007181247,0.0003356842,0.000010764011,0.00007797468,0.000018189421,0.00035982786,0.00006529546,0.00044603046,0.99725264,0.00029776315,0.0010203824],"study_design_scores_gemma":[0.0007196588,0.0008195301,0.00053451007,0.000017993214,0.000014531497,0.00009360465,0.000083285304,0.001822426,0.0070911823,0.9879901,0.000712553,0.00010066203],"about_ca_topic_score_codex":0.000005676564,"about_ca_topic_score_gemma":0.0000034170457,"teacher_disagreement_score":0.4016333,"about_ca_system_score_codex":0.00015281986,"about_ca_system_score_gemma":0.0005475794,"threshold_uncertainty_score":0.4588486},"labels":[],"label_agreement":null},{"id":"W4385360076","doi":"10.37236/11659","title":"The Lexicographically Least Square-Free Word with a Given Prefix","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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":"University of Waterloo","funders":"National Science Foundation","keywords":"Lexicographical order; Prefix; Mathematics; Combinatorics; Word (group theory); Morphism; Square-free integer; Alphabet; Sequence (biology); Arithmetic; Ruler; Discrete mathematics; Linguistics","score_opus":0.00559057445222522,"score_gpt":0.2058071930271715,"score_spread":0.20021661857494627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385360076","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.6635482,0.012911363,0.24209632,0.07549675,0.0022135305,0.00065880455,0.0000025445365,0.00062018714,0.002452309],"genre_scores_gemma":[0.998233,0.001069417,0.000042862932,0.00013096456,0.000090283786,0.0000062824943,2.5385202e-7,0.000018708326,0.00040819493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772924,0.00023652065,0.0003546494,0.00015842152,0.0007533272,0.0007678336],"domain_scores_gemma":[0.99771357,0.0006608649,0.0003835678,0.00092758395,0.00023054636,0.000083865314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00254535,0.00016900607,0.0002137077,0.00013963388,0.0004834581,0.0002485456,0.0038638778,0.000050628933,0.0000017522091],"category_scores_gemma":[0.00012001991,0.00008048377,0.00015209372,0.001866042,0.00015778148,0.00030716826,0.00034046298,0.00084896636,0.00001628002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060732265,0.000052127718,0.0001267102,0.000004441125,0.000105412786,0.0000248295,0.00032973647,0.000068952664,0.00007503342,0.9892146,0.0027452933,0.0071921353],"study_design_scores_gemma":[0.0008657809,0.00092395005,0.0017520153,0.00004352617,0.000028447423,0.00033361308,0.00017534995,0.0018320081,0.00022060542,0.9780952,0.015587378,0.0001421719],"about_ca_topic_score_codex":0.0000037747677,"about_ca_topic_score_gemma":0.000011199691,"teacher_disagreement_score":0.33468485,"about_ca_system_score_codex":0.00011150594,"about_ca_system_score_gemma":0.00044132918,"threshold_uncertainty_score":0.7180111},"labels":[],"label_agreement":null},{"id":"W4386559272","doi":"10.37236/11862","title":"Irreducible Subcube Partitions","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; University of Haifa; Israel Science Foundation; Fonds Wetenschappelijk Onderzoek; Vlaamse regering; European Commission","keywords":"Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Dimension (graph theory)","score_opus":0.019568141892636892,"score_gpt":0.29277190572134376,"score_spread":0.27320376382870687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386559272","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.31888056,0.005316793,0.6456172,0.022068553,0.0024931913,0.00036428522,0.0000016973426,0.0003629835,0.004894732],"genre_scores_gemma":[0.99796206,0.0009017502,0.000050615563,0.000057708243,0.0000631595,0.000004763806,3.5887712e-7,0.000011196831,0.00094838964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810874,0.00019736207,0.00028313405,0.00012363274,0.00056271715,0.0007244184],"domain_scores_gemma":[0.9985201,0.00040218126,0.00018202724,0.00052832084,0.0002723085,0.00009509129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002343709,0.00009570013,0.00015649771,0.00026103132,0.0002556687,0.000083529565,0.0018250813,0.000033071912,0.000008422777],"category_scores_gemma":[0.00018254624,0.00006587648,0.00012266572,0.002484733,0.00008033813,0.00044000085,0.00019875808,0.0007089962,0.00010863357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009074178,0.000042016807,0.00005175245,0.0000025207141,0.000030475927,0.000016449909,0.00017900234,0.0004061231,0.0003404384,0.99523497,0.0027221646,0.0009650094],"study_design_scores_gemma":[0.0003025899,0.00032365072,0.00022719301,0.000008324217,0.000007162477,0.0001465106,0.000065142616,0.0010397355,0.0017562092,0.98500556,0.011043478,0.000074446354],"about_ca_topic_score_codex":0.0000010833885,"about_ca_topic_score_gemma":0.0000010692105,"teacher_disagreement_score":0.6790815,"about_ca_system_score_codex":0.00016638244,"about_ca_system_score_gemma":0.00049975544,"threshold_uncertainty_score":0.33914855},"labels":[],"label_agreement":null},{"id":"W4387402806","doi":"10.37236/11113","title":"Improved Pyrotechnics: Closer to the Burning Number Conjecture","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"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 Manitoba; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Upper and lower bounds; Bounded function; Degree (music); Graph; Order (exchange); Vertex connectivity; Vertex (graph theory); Discrete mathematics; Physics","score_opus":0.005934136516747675,"score_gpt":0.26908537926430304,"score_spread":0.26315124274755536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387402806","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.15790005,0.00029035663,0.8123493,0.021168916,0.00045748937,0.0007215565,0.00000810823,0.00008338205,0.0070208167],"genre_scores_gemma":[0.99834985,0.0000305559,0.0000580482,0.00010104504,0.00028682573,0.000023964009,0.0000012717857,0.000019638894,0.0011288119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990216,0.000042299496,0.0002694861,0.00007969922,0.00018265404,0.000404242],"domain_scores_gemma":[0.99904674,0.00028336397,0.00021392382,0.00028570485,0.0001120641,0.00005822672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006921156,0.000113690556,0.00017222304,0.000024182746,0.0002706779,0.00004005592,0.0005272752,0.000025609384,0.00007212496],"category_scores_gemma":[0.000034984012,0.00005873221,0.0001256062,0.000610651,0.000039033723,0.000055210385,0.000087808694,0.0006498418,0.00008146254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008322038,0.000025607616,0.000019891424,0.000002060981,0.00004933558,2.7066397e-7,0.00018933318,0.00034140967,0.000334143,0.996106,0.0013938728,0.0015297381],"study_design_scores_gemma":[0.00021179073,0.000073727795,0.000014201417,0.00001014045,0.000032384305,0.0000079452975,0.0004916684,0.00027930597,0.0011183891,0.9337952,0.06389093,0.00007429645],"about_ca_topic_score_codex":0.000002815767,"about_ca_topic_score_gemma":4.5387065e-7,"teacher_disagreement_score":0.8404498,"about_ca_system_score_codex":0.00005398895,"about_ca_system_score_gemma":0.00012306539,"threshold_uncertainty_score":0.28232753},"labels":[],"label_agreement":null},{"id":"W4388734332","doi":"10.37236/11548","title":"Separating the Online and Offline DP-Chromatic Numbers","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Optimization and Search Problems","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":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Fractional coloring; List coloring; Cover (algebra); Graph; Greedy coloring; Generalization; Edge coloring; Discrete mathematics; Transversal (combinatorics); Graph coloring; Graph power; Line graph","score_opus":0.012988599195016078,"score_gpt":0.2682370579565959,"score_spread":0.2552484587615798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388734332","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.57880485,0.0031774614,0.359445,0.054605015,0.0010999894,0.0005096707,0.0000011801716,0.00020328962,0.002153543],"genre_scores_gemma":[0.9976094,0.0012156416,0.00022390876,0.00026712264,0.00005274501,0.0000013980316,6.5770615e-7,0.000008003892,0.0006211556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986538,0.00018971994,0.00030480395,0.00008254869,0.0003969173,0.0003721627],"domain_scores_gemma":[0.99892825,0.00038152083,0.00022490122,0.00024734766,0.00016053794,0.000057418834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001877927,0.00008574625,0.00013995482,0.000078047065,0.00025287006,0.0001281888,0.0008610475,0.000026570611,0.0000037556408],"category_scores_gemma":[0.0001406771,0.000045866807,0.00005118842,0.0009439021,0.00005563289,0.0002278639,0.00015898045,0.0005123416,0.000009690722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004796692,0.000051749787,0.000094378316,0.000010411933,0.000052731742,0.0000072128146,0.0015491075,0.002728436,0.000107435066,0.991244,0.002001839,0.0021479032],"study_design_scores_gemma":[0.0007182428,0.00040484883,0.0004997596,0.000031108168,0.000018820498,0.00026304694,0.00028389948,0.29918337,0.00013214297,0.6941742,0.0041831266,0.00010745448],"about_ca_topic_score_codex":0.0000032383612,"about_ca_topic_score_gemma":0.0000046648643,"teacher_disagreement_score":0.41880453,"about_ca_system_score_codex":0.000072282804,"about_ca_system_score_gemma":0.00027567428,"threshold_uncertainty_score":0.22258978},"labels":[],"label_agreement":null},{"id":"W4391258573","doi":"10.37236/10281","title":"Triangles and Subgraph Probabilities in Random Regular Graphs","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Induced subgraph isomorphism problem; Random graph; Discrete mathematics; Graph; Line graph","score_opus":0.011854225939604505,"score_gpt":0.26390329926881506,"score_spread":0.25204907332921056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391258573","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.953248,0.043883357,0.00085426314,0.00063845416,0.00057409017,0.00021106863,8.781117e-7,0.000024982737,0.0005648714],"genre_scores_gemma":[0.99660176,0.0030847243,0.000027882175,0.000019879957,0.00005902677,0.000004188701,2.094727e-7,0.000021553578,0.00018079221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845695,0.00028325047,0.00048389277,0.00011044288,0.0002978299,0.00036765],"domain_scores_gemma":[0.9982657,0.001254906,0.00014852389,0.00020745333,0.000080779864,0.000042628515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949537,0.00015215344,0.00034749808,0.0002764375,0.000118568234,0.00006677824,0.00030744777,0.00007728975,0.000007972625],"category_scores_gemma":[0.00031348658,0.00008635482,0.00018145436,0.0004804739,0.0001785566,0.00013722014,0.000049093946,0.000749803,2.3516338e-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.00015601297,0.000036204758,0.0001800052,0.00010159449,0.00012107849,0.000017795224,0.0018714624,0.0000019932882,0.00006318909,0.99673235,0.00018412473,0.0005341895],"study_design_scores_gemma":[0.0013331953,0.00026726446,0.00010115973,0.00011939259,0.00009272604,0.00027120384,0.00039035003,0.000027304002,0.0002475544,0.9952142,0.0018344027,0.00010119603],"about_ca_topic_score_codex":0.0000027686865,"about_ca_topic_score_gemma":0.0000068933596,"teacher_disagreement_score":0.043353707,"about_ca_system_score_codex":0.00009878404,"about_ca_system_score_gemma":0.00019771612,"threshold_uncertainty_score":0.35214475},"labels":[],"label_agreement":null},{"id":"W4391258576","doi":"10.37236/11909","title":"Power of $k$ Choices in the Semi-Random Graph Process","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"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; Combinatorics; Graph; Random graph; Process (computing); Power (physics); Discrete mathematics; Computer science","score_opus":0.02386316884284069,"score_gpt":0.35460698811547936,"score_spread":0.3307438192726387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391258576","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.9766289,0.010170493,0.0044816663,0.0037245979,0.0003108357,0.00017181558,0.0000015078116,0.000008046026,0.004502162],"genre_scores_gemma":[0.99928194,0.00028798752,8.282387e-7,0.00007692615,0.00004153753,0.0000057608627,1.199233e-7,0.000006690016,0.00029822454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748015,0.00040028448,0.000678058,0.00011710557,0.0010482722,0.0002761553],"domain_scores_gemma":[0.9960047,0.0029724368,0.0003552856,0.0003579642,0.00027991788,0.000029665747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010221757,0.000096003525,0.00023996475,0.00023123018,0.00009447906,0.00012799798,0.0017846695,0.000041231964,0.00005744737],"category_scores_gemma":[0.0005783518,0.000041732044,0.0001683756,0.0021916628,0.0001334664,0.00022585201,0.000029991977,0.0007137438,0.000016943954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006376919,0.0001161138,0.00026007663,0.0000065916433,0.0000337742,0.0000039970228,0.0032110997,0.00024157188,0.00019406651,0.9945233,0.00073040795,0.0006152185],"study_design_scores_gemma":[0.00035909828,0.00019324853,0.00051827723,0.000031508745,0.000025514923,0.00009953875,0.0020294548,0.00010250105,0.0007762842,0.9845578,0.011257644,0.000049139828],"about_ca_topic_score_codex":0.0000019459155,"about_ca_topic_score_gemma":0.0000045108927,"teacher_disagreement_score":0.022653049,"about_ca_system_score_codex":0.000041753032,"about_ca_system_score_gemma":0.00034820812,"threshold_uncertainty_score":0.35426775},"labels":[],"label_agreement":null},{"id":"W4394934440","doi":"10.37236/11860","title":"Improved Bounds for Cross-Sperner Systems","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Computer science","score_opus":0.007972549842715766,"score_gpt":0.26592855346522715,"score_spread":0.25795600362251137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394934440","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.012502239,0.026276287,0.9545415,0.0009432878,0.005042146,0.00019646979,0.0000015038237,0.000070740025,0.00042581864],"genre_scores_gemma":[0.9961845,0.0002672753,0.00008089072,0.000043368746,0.00041812568,0.000007755482,2.7117244e-7,0.000016108059,0.0029816926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985823,0.00009259382,0.00039047957,0.00014718082,0.00028038607,0.0005070794],"domain_scores_gemma":[0.9988054,0.00038295364,0.00017840989,0.00032512544,0.00024176812,0.00006635682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026777575,0.0001321906,0.00020574842,0.00009706358,0.00019025698,0.0007808785,0.0013676772,0.000059375718,0.0000029656776],"category_scores_gemma":[0.000059938986,0.00008019397,0.00019948473,0.0004133368,0.000049866023,0.00048631857,0.000080199294,0.000521834,0.000007059727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016962864,0.000028899547,0.0000031438803,0.000040858267,0.00007849882,0.0000071171803,0.00017770095,0.000083372994,0.00026162987,0.9969463,0.0006338145,0.0017217413],"study_design_scores_gemma":[0.0004706767,0.0006381042,0.000005398443,0.000038569124,0.000030069084,0.00047383647,0.000023813189,0.10158283,0.00096009596,0.8120641,0.08358661,0.00012588325],"about_ca_topic_score_codex":0.0000022841634,"about_ca_topic_score_gemma":2.3756948e-7,"teacher_disagreement_score":0.9836823,"about_ca_system_score_codex":0.00024340098,"about_ca_system_score_gemma":0.0005996994,"threshold_uncertainty_score":0.75300294},"labels":[],"label_agreement":null},{"id":"W4396608397","doi":"10.37236/11234","title":"Decompositions of Unit Hypercubes and the Reversion of a Generalized Möbius Series","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","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 Saskatchewan","funders":"","keywords":"Hypercube; Series (stratigraphy); Unit (ring theory); Reversion; Mean reversion; Mathematics; Combinatorics; Econometrics; Geology; Chemistry; Mathematics education; Paleontology","score_opus":0.016972200371230702,"score_gpt":0.29539545105450893,"score_spread":0.2784232506832782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396608397","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.9605638,0.017875925,0.017350907,0.002274624,0.0008817234,0.0003935241,0.000004744132,0.000032494336,0.00062227884],"genre_scores_gemma":[0.99602306,0.0029574197,0.0006908696,0.000011555852,0.000058852675,0.0000036440908,3.533842e-7,0.000027661854,0.00022655458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982491,0.00027266121,0.0007184754,0.00008190391,0.0004248609,0.00025296837],"domain_scores_gemma":[0.9968661,0.0019102896,0.0005169238,0.0003174857,0.00035000147,0.00003916853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016455766,0.00015713053,0.00052256556,0.000117462645,0.00011835543,0.0000275086,0.00043875724,0.0000648524,0.000009188958],"category_scores_gemma":[0.00048078634,0.00008557446,0.00019071912,0.00047526477,0.00030138553,0.00018464016,0.00009950609,0.0005286962,7.6025253e-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.00018494183,0.00009387197,0.0000064253104,0.00021579993,0.00022278214,0.0000037808118,0.0011789425,0.00001669139,0.0017311719,0.9959776,0.00026447457,0.000103565006],"study_design_scores_gemma":[0.0013826992,0.00041219144,0.000004800722,0.00025717638,0.00040023954,0.0004110813,0.0004649313,0.00025009335,0.008180012,0.98724097,0.0009130045,0.00008282817],"about_ca_topic_score_codex":0.0000042168112,"about_ca_topic_score_gemma":0.0000020392383,"teacher_disagreement_score":0.03545931,"about_ca_system_score_codex":0.000101928825,"about_ca_system_score_gemma":0.00027493233,"threshold_uncertainty_score":0.34896252},"labels":[],"label_agreement":null},{"id":"W4396608435","doi":"10.37236/11732","title":"Central Limit Theorems via Analytic Combinatorics in Several Variables","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","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 Waterloo","funders":"","keywords":"Limit (mathematics); Mathematics; Central limit theorem; Combinatorics; Enumerative combinatorics; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.013330712486469781,"score_gpt":0.27465006504180856,"score_spread":0.2613193525553388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396608435","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.869618,0.010568754,0.10781498,0.003521461,0.0020886064,0.000635749,0.000006136348,0.00015620631,0.005590114],"genre_scores_gemma":[0.99855405,0.0006672437,0.00003242225,0.000045865992,0.00011671805,0.000007967741,0.0000013099966,0.000041471558,0.0005329235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976356,0.0002780583,0.00069418474,0.0001717108,0.00044124082,0.00077919103],"domain_scores_gemma":[0.9978794,0.0012323647,0.0002643889,0.00037657662,0.00014362701,0.000103675455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026157126,0.00022968366,0.0003946813,0.00026481302,0.00014541425,0.00010284484,0.00073928316,0.00011609198,0.00003971745],"category_scores_gemma":[0.00019292947,0.0001579156,0.000246964,0.0013910529,0.00010418884,0.00021603187,0.000058550162,0.0013817991,0.000009471971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003676185,0.00029942926,0.00012277767,0.000050315666,0.00016416337,0.000024597637,0.00070116745,0.00012681683,0.00011105164,0.99734557,0.00081293576,0.00020443779],"study_design_scores_gemma":[0.00053689716,0.00022832095,0.000103832084,0.00009542407,0.00018622016,0.00027360802,0.00017249501,0.002766751,0.0003666731,0.99140334,0.0036929995,0.00017340876],"about_ca_topic_score_codex":0.000007324969,"about_ca_topic_score_gemma":0.000008533122,"teacher_disagreement_score":0.12893608,"about_ca_system_score_codex":0.0005365319,"about_ca_system_score_gemma":0.00047831665,"threshold_uncertainty_score":0.6439611},"labels":[],"label_agreement":null},{"id":"W4399213339","doi":"10.37236/12429","title":"Constructing Graphs with No Independent Transversals","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Maximal independent set; Chordal graph; 1-planar graph; Graph","score_opus":0.007709438158755823,"score_gpt":0.25164732720706195,"score_spread":0.24393788904830613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399213339","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.08255264,0.008879262,0.9020081,0.001985924,0.001102393,0.00019712583,7.2251316e-7,0.0001036367,0.003170194],"genre_scores_gemma":[0.99901927,0.0004023973,0.00028074614,0.00003187032,0.000045736768,0.0000021748929,1.2226559e-7,0.000016808594,0.00020088245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790144,0.0001961892,0.0003066005,0.00017354022,0.0008016055,0.0006206057],"domain_scores_gemma":[0.9986237,0.00046352294,0.00014528459,0.0003450045,0.00032805023,0.000094396455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019446405,0.00014581284,0.00020923109,0.0002558407,0.00013948728,0.0002128555,0.0014862934,0.000043788812,0.000009503241],"category_scores_gemma":[0.000049898546,0.00008542702,0.00012839204,0.0012143141,0.00014248269,0.00062476896,0.000077055796,0.0013469567,0.000014796433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039431463,0.000025340254,0.00009782919,0.000015358517,0.00013313924,0.0000857602,0.00028833887,0.000046467732,0.00019773639,0.9947553,0.000066077504,0.0042491844],"study_design_scores_gemma":[0.000494433,0.0008803004,0.000018014136,0.000073834504,0.00002647243,0.0016618199,0.00016900618,0.0013203572,0.002153112,0.99078876,0.0022900691,0.00012383448],"about_ca_topic_score_codex":0.0000015573316,"about_ca_topic_score_gemma":0.0000029187638,"teacher_disagreement_score":0.9164666,"about_ca_system_score_codex":0.0003107965,"about_ca_system_score_gemma":0.0007969778,"threshold_uncertainty_score":0.58519316},"labels":[],"label_agreement":null},{"id":"W4399602825","doi":"10.37236/12115","title":"Asymptotic Bounds for the Number of Closed and Privileged Words","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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":"University of Guelph","funders":"","keywords":"Combinatorics; Word (group theory); Suffix; Prefix; Mathematics; Upper and lower bounds; Alphabet; Linguistics; Geometry; Philosophy; Mathematical analysis","score_opus":0.005746212735170773,"score_gpt":0.2510511144270334,"score_spread":0.2453049016918626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602825","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.30987495,0.03725185,0.6446774,0.0053659766,0.002045997,0.00027870605,0.0000014524805,0.00005631686,0.00044735995],"genre_scores_gemma":[0.99857056,0.00093171553,0.00009909291,0.0000776025,0.00010086796,0.0000035977132,1.16395775e-7,0.000011839786,0.00020457832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887604,0.000088684355,0.0003108572,0.00010489508,0.0002925903,0.00032695825],"domain_scores_gemma":[0.9981482,0.0012188085,0.00018372429,0.0003043443,0.0001086016,0.000036311052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205551,0.000106770305,0.00018846232,0.00005215956,0.00013297285,0.00016490812,0.0009998506,0.000039341583,0.0000043936675],"category_scores_gemma":[0.00007091402,0.000055179615,0.00013032071,0.0004003799,0.00008776088,0.0002349793,0.00010396968,0.00039825405,0.0000018431463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013492454,0.000029843237,0.00004713537,0.000025214467,0.00011265973,0.0000022916377,0.0005345236,0.000008398661,0.00017605627,0.9906326,0.00044699165,0.007970801],"study_design_scores_gemma":[0.0004224131,0.00026959332,0.00030162273,0.00006999703,0.000073812735,0.00032812209,0.00007198563,0.015890619,0.00088230846,0.97320235,0.008407181,0.00007997777],"about_ca_topic_score_codex":0.0000019191966,"about_ca_topic_score_gemma":6.8814325e-7,"teacher_disagreement_score":0.68869567,"about_ca_system_score_codex":0.00009090923,"about_ca_system_score_gemma":0.0003748718,"threshold_uncertainty_score":0.22501594},"labels":[],"label_agreement":null},{"id":"W4399602839","doi":"10.37236/11533","title":"The Genus Distribution of Cubic Graphs and Asymptotic Number of Rooted Cubic Maps with High Genus","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","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":"Carleton University","funders":"","keywords":"Combinatorics; Genus; Mathematics; Simple (philosophy); Distribution (mathematics); Sequence (biology); Asymptotic formula; Asymptotic distribution; Discrete mathematics; Mathematical analysis; Statistics; Biology","score_opus":0.008296830276757977,"score_gpt":0.2603676113204804,"score_spread":0.25207078104372244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602839","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.6895991,0.010480395,0.29864597,0.00049370405,0.00041729424,0.00022055968,0.000032025237,0.000020323743,0.00009062892],"genre_scores_gemma":[0.9986767,0.001095997,0.00009985319,0.0000049268706,0.000026386719,0.0000033897356,0.000002275396,0.000023693801,0.000066767905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835306,0.000087691544,0.0005574572,0.00010785583,0.0005162113,0.0003777186],"domain_scores_gemma":[0.9973501,0.0015557276,0.00042767858,0.00021841605,0.00038499426,0.00006306252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656587,0.00016249088,0.00036060676,0.000041352167,0.00012353406,0.000040258514,0.00031785434,0.00006848814,0.0000065930694],"category_scores_gemma":[0.0004635307,0.00008432467,0.00009015572,0.00050819136,0.0001542464,0.000066045926,0.000045454457,0.00055960537,0.0000013578543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011802999,0.00007705968,0.000018495222,0.00019335285,0.00025129676,0.000010072426,0.000118572774,0.0000065559548,0.000066901775,0.99725074,0.00023530814,0.0016536479],"study_design_scores_gemma":[0.0005248679,0.0008320934,0.00007491252,0.00020421989,0.000438884,0.00049979065,0.00009734815,0.0009164419,0.0010359444,0.99493235,0.0003465486,0.00009658733],"about_ca_topic_score_codex":0.000008467316,"about_ca_topic_score_gemma":0.000005067238,"teacher_disagreement_score":0.3090776,"about_ca_system_score_codex":0.00012821551,"about_ca_system_score_gemma":0.00037450058,"threshold_uncertainty_score":0.34386602},"labels":[],"label_agreement":null},{"id":"W4399602855","doi":"10.37236/11712","title":"Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Degree (music); Planar graph; Discrete mathematics; Graph; Vertex (graph theory); 1-planar graph; Structured program theorem; Pathwidth; Chordal graph; Line graph; Physics; Mathematical analysis","score_opus":0.019278106987865237,"score_gpt":0.25198456432584804,"score_spread":0.23270645733798279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602855","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.3348988,0.04934962,0.5856625,0.0168619,0.010299027,0.0006258236,0.000012805087,0.0002612997,0.0020282525],"genre_scores_gemma":[0.9976955,0.00049681857,0.0004906772,0.00021076163,0.0004881545,0.0000025491643,0.0000038184176,0.000021303706,0.00059039023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973061,0.00019237139,0.0005425604,0.00033746686,0.00100561,0.00061590935],"domain_scores_gemma":[0.99840623,0.00026713635,0.00029235272,0.00051105244,0.0004075141,0.00011570742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014052398,0.00025898305,0.00028973457,0.00039301213,0.0003523276,0.00076184596,0.0014622755,0.00008423001,0.0000145822405],"category_scores_gemma":[0.000095013806,0.00017928462,0.00021425606,0.0012518214,0.00007671502,0.0007576046,0.00010798355,0.0011862242,0.000013828637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025536707,0.00005083563,0.000024254212,0.000024125144,0.00015718375,0.00003983337,0.0005310932,0.00038483017,0.00070550496,0.97793555,0.0031248792,0.016996345],"study_design_scores_gemma":[0.00040316515,0.0005047946,0.00039870705,0.000044963053,0.00005937747,0.0012113287,0.000033201093,0.003969052,0.0037886072,0.957471,0.03189346,0.0002223197],"about_ca_topic_score_codex":0.0000063886864,"about_ca_topic_score_gemma":0.000016248146,"teacher_disagreement_score":0.66279674,"about_ca_system_score_codex":0.00041134385,"about_ca_system_score_gemma":0.0014741577,"threshold_uncertainty_score":0.7346498},"labels":[],"label_agreement":null},{"id":"W4401026269","doi":"10.37236/12715","title":"Hopf Algebras from Poset Growth Models","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topics in Algebra","field":"Mathematics","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":"Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Canada Research Chairs; Government of Canada; Ministero dello Sviluppo Economico","keywords":"Partially ordered set; Hopf algebra; Mathematics; Combinatorics; Pure mathematics; Algebra over a field","score_opus":0.024664942396066314,"score_gpt":0.2916441135444045,"score_spread":0.2669791711483382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401026269","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.6426643,0.034232166,0.31062013,0.0045283753,0.0029601844,0.00029666076,0.00001233976,0.00019353117,0.004492281],"genre_scores_gemma":[0.99677545,0.0015880372,0.0004774882,0.00010363737,0.00039831657,0.0000018549704,0.0000014474392,0.00006370768,0.0005900462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979448,0.00013668336,0.00057446084,0.00016434137,0.00062220125,0.00055752543],"domain_scores_gemma":[0.99779934,0.0012168793,0.0002795495,0.0003868592,0.00023215065,0.00008524487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000991035,0.00021783558,0.00035680505,0.00012794034,0.00012637376,0.0000948058,0.0008175614,0.00010517727,0.000044973825],"category_scores_gemma":[0.00030001331,0.00014574736,0.00022127952,0.00042980994,0.000069080874,0.0003897906,0.000098654935,0.0014561585,0.000023268904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021596681,0.00007240683,0.0000069799407,0.000025569892,0.00023768353,0.000039613107,0.0005341261,0.00002317488,0.0001054625,0.99561524,0.0029570728,0.0003610564],"study_design_scores_gemma":[0.00037877914,0.00021750294,0.0000051872053,0.00009143974,0.00016731823,0.00017394238,0.00009086446,0.0008765217,0.0014685423,0.99377304,0.0025976654,0.00015920495],"about_ca_topic_score_codex":0.0000062641025,"about_ca_topic_score_gemma":0.0000030092292,"teacher_disagreement_score":0.35411114,"about_ca_system_score_codex":0.0005160127,"about_ca_system_score_gemma":0.0004706782,"threshold_uncertainty_score":0.6326365},"labels":[],"label_agreement":null},{"id":"W4401419681","doi":"10.37236/11270","title":"A Note on the Maximum Number of k-Powers in a Finite Word","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Uniwersytet Warszawski","keywords":"Word (group theory); Mathematics; Arithmetic; Geometry","score_opus":0.007622824280421959,"score_gpt":0.2723886229256945,"score_spread":0.26476579864527255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401419681","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.14399216,0.047687214,0.764962,0.037563335,0.0021182834,0.0004724145,0.0000013813179,0.0002632834,0.002939896],"genre_scores_gemma":[0.9985491,0.0003212566,0.00077150256,0.00020831836,0.00003343018,0.0000023891955,6.247736e-8,0.000011051421,0.00010291072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985966,0.00014933503,0.00033997046,0.000114208466,0.0004539828,0.00034591908],"domain_scores_gemma":[0.9984987,0.000808055,0.00020804656,0.00034493985,0.00011364107,0.000026655056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017895183,0.000118681484,0.0001804525,0.00014778496,0.000049160284,0.00010630463,0.001603858,0.000056214114,0.000007277584],"category_scores_gemma":[0.00020872429,0.000060687238,0.00011006038,0.0011657459,0.000054350636,0.00023142205,0.00012187244,0.0012609402,0.0000075721437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020429236,0.00004345331,0.000021133872,0.000014274596,0.000021349355,0.00003585529,0.0007993019,0.000014637249,0.00018201185,0.9898307,0.0003868592,0.008630007],"study_design_scores_gemma":[0.0001414159,0.00019677191,0.000014953134,0.0002094701,0.000010330591,0.00014210583,0.00002086191,0.0022507322,0.004876612,0.99009776,0.001964096,0.00007489271],"about_ca_topic_score_codex":0.000008242099,"about_ca_topic_score_gemma":0.000003089002,"teacher_disagreement_score":0.8545569,"about_ca_system_score_codex":0.00027105593,"about_ca_system_score_gemma":0.00046859263,"threshold_uncertainty_score":0.5478228},"labels":[],"label_agreement":null},{"id":"W4401419710","doi":"10.37236/12438","title":"The $s$-Weak Order and $s$-Permutahedra II: The Combinatorial Complex of Pure Intervals","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; International Centre for Comparative Criminology","funders":"Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Intersection (aeronautics); Lattice (music); Order (exchange); Coxeter group; Physics","score_opus":0.023424172515552982,"score_gpt":0.3091158524354183,"score_spread":0.2856916799198653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401419710","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.8374667,0.060079567,0.043957274,0.028364819,0.021271352,0.0028792876,0.000019457852,0.00030488806,0.005656636],"genre_scores_gemma":[0.9971834,0.0016719113,0.000076782875,0.00004165097,0.00042589058,0.000014373724,5.9357245e-7,0.000083084,0.00050235534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612063,0.0004832461,0.0013334763,0.00020995527,0.0010767098,0.0007759793],"domain_scores_gemma":[0.99212426,0.0052441964,0.00094184146,0.00080976577,0.00077978004,0.00010018591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043140063,0.00038690362,0.0007097104,0.0001125518,0.0007699652,0.00020746524,0.0016445793,0.00014948013,0.000019586807],"category_scores_gemma":[0.0019565322,0.00018231322,0.00029833024,0.0009297416,0.0005346499,0.00025316564,0.00044119015,0.0017589733,0.000004182547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092482995,0.00018095897,0.000007310146,0.00012919013,0.00042326748,0.000008452899,0.0018025173,0.000009499045,0.0003653634,0.9917072,0.0046057794,0.00066794484],"study_design_scores_gemma":[0.0009952601,0.0009906191,0.000010523214,0.00019516198,0.00033912782,0.0005143361,0.0010879769,0.0006324399,0.0008064894,0.96637136,0.027861174,0.00019552662],"about_ca_topic_score_codex":0.0000032742068,"about_ca_topic_score_gemma":0.0000066209727,"teacher_disagreement_score":0.15971664,"about_ca_system_score_codex":0.00032261328,"about_ca_system_score_gemma":0.0006238507,"threshold_uncertainty_score":0.76419616},"labels":[],"label_agreement":null},{"id":"W4401813949","doi":"10.37236/11627","title":"Polyharmonic Functions in the Quarter Plane","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"European Commission","keywords":"Quarter (Canadian coin); Plane (geometry); Mathematics; Computer science; Geometry; History; Archaeology","score_opus":0.01630377749511544,"score_gpt":0.2760560489822502,"score_spread":0.25975227148713476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401813949","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.77535796,0.07439858,0.11251161,0.025915485,0.0018937958,0.00044847283,0.000004719831,0.000090507296,0.009378844],"genre_scores_gemma":[0.9978313,0.0004943761,0.000004470532,0.000106096435,0.0001673583,0.0000035181506,7.8615165e-7,0.000014016236,0.0013780823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836135,0.00020085952,0.00044480772,0.00008878027,0.00049939455,0.0004048008],"domain_scores_gemma":[0.99803954,0.0014118194,0.0001624147,0.00026039055,0.000093631184,0.000032217646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025771244,0.00012474776,0.00023260157,0.00031796537,0.00011215055,0.00007861007,0.0005436559,0.000057689318,0.0000828986],"category_scores_gemma":[0.00021827803,0.00006077378,0.00019271526,0.0022762825,0.000044746703,0.000113955684,0.000021247852,0.0011358326,0.000042762567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015954445,0.00011090163,0.00014414622,0.000015636377,0.0002375081,0.000029975714,0.0010719987,0.000007240559,0.0000058913947,0.97233856,0.025492944,0.00052923657],"study_design_scores_gemma":[0.00026939125,0.0003033975,0.00019794016,0.000027382837,0.00027300837,0.00040610827,0.0017215639,0.0002013528,0.000010738594,0.9812885,0.0152189,0.00008173357],"about_ca_topic_score_codex":0.000009052439,"about_ca_topic_score_gemma":0.000014110811,"teacher_disagreement_score":0.22247331,"about_ca_system_score_codex":0.00024258229,"about_ca_system_score_gemma":0.00036004145,"threshold_uncertainty_score":0.49346906},"labels":[],"label_agreement":null},{"id":"W4403096726","doi":"10.37236/12328","title":"Cyclic Orderings of Paving Matroids","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","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":"Thompson Rivers University","funders":"","keywords":"Matroid; Computer science; Combinatorics; Mathematics","score_opus":0.004072584411164965,"score_gpt":0.2238813585092814,"score_spread":0.21980877409811644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403096726","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.22347255,0.022395626,0.7505856,0.0016760284,0.0010271504,0.000062224295,1.6032969e-7,0.000057694364,0.00072292174],"genre_scores_gemma":[0.9986376,0.0008441661,0.00022682549,0.000047248464,0.000066444154,7.628185e-7,5.730325e-8,0.000009755061,0.00016712122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988048,0.000058784102,0.0003422787,0.000102548285,0.00032826193,0.0003633485],"domain_scores_gemma":[0.999197,0.00020128819,0.00019465791,0.00025670786,0.000107806125,0.000042538293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000755308,0.00010262701,0.00019274605,0.00011500477,0.00006552035,0.000067455425,0.0010765735,0.00003412762,0.0000046717546],"category_scores_gemma":[0.000047043344,0.0000644612,0.00012874336,0.0006855894,0.000040710667,0.00037426667,0.000117456715,0.00056288415,0.0000063238876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003873033,0.00002591795,0.000026372234,0.00001796551,0.000037824077,0.000015247601,0.00027830835,0.00011513819,0.0019189373,0.99320483,0.00010419542,0.0042513823],"study_design_scores_gemma":[0.00017741759,0.0004245985,0.00009812944,0.000053046442,0.000019971592,0.00036749966,0.00003455412,0.0014968198,0.004387622,0.986333,0.006525941,0.00008140581],"about_ca_topic_score_codex":0.000001541899,"about_ca_topic_score_gemma":4.7724e-7,"teacher_disagreement_score":0.7751651,"about_ca_system_score_codex":0.00014028358,"about_ca_system_score_gemma":0.00031143776,"threshold_uncertainty_score":0.26286513},"labels":[],"label_agreement":null},{"id":"W4403097226","doi":"10.37236/12040","title":"Hamiltonians of Bipartite Walks","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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 Waterloo","funders":"","keywords":"Bipartite graph; Random walk; Mathematics; Combinatorics; Statistics; Graph","score_opus":0.01865481315606235,"score_gpt":0.3070295926730617,"score_spread":0.2883747795169993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403097226","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.94805384,0.01208951,0.03207948,0.0028149302,0.0006212021,0.00021279433,0.0000042017473,0.00005915904,0.004064858],"genre_scores_gemma":[0.9988007,0.00044216609,0.000040611678,0.000018753284,0.000058922604,0.0000031564712,2.0887111e-7,0.000018260154,0.00061720674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989387,0.00008809372,0.00040536743,0.0000636346,0.00024237885,0.00026184373],"domain_scores_gemma":[0.99881285,0.0005618729,0.00021025699,0.00024485507,0.00013238662,0.00003774913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370402,0.000091944385,0.00019874178,0.00010403994,0.00007184577,0.000022971886,0.00038624325,0.000044163095,0.000025185014],"category_scores_gemma":[0.00009489838,0.000057793717,0.00017814999,0.00050517207,0.00007739703,0.00007918427,0.000024859557,0.000526522,0.000009230553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012346283,0.000092955066,0.000018286473,0.00004234644,0.000118316864,0.0000028580553,0.00042518438,0.0000057063853,0.0011238826,0.99625456,0.0015057063,0.0003978654],"study_design_scores_gemma":[0.00015517097,0.00019234451,0.00002449964,0.00006393132,0.00013123747,0.000117694704,0.00009021154,0.000086809276,0.005233005,0.97696984,0.016877642,0.00005763279],"about_ca_topic_score_codex":0.000001027019,"about_ca_topic_score_gemma":0.0000015796433,"teacher_disagreement_score":0.05074685,"about_ca_system_score_codex":0.000078074256,"about_ca_system_score_gemma":0.00024048,"threshold_uncertainty_score":0.23567593},"labels":[],"label_agreement":null},{"id":"W4403939243","doi":"10.37236/12575","title":"On an Induced Version of Menger's Theorem","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computability, Logic, AI Algorithms","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Eidgenössische Technische Hochschule Zürich","keywords":"Mathematics; Calculus (dental); Medicine","score_opus":0.009243470468888243,"score_gpt":0.25249730179503244,"score_spread":0.2432538313261442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403939243","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.81977206,0.0030980052,0.1708047,0.0019465804,0.0025382529,0.00016510545,7.071029e-7,0.000086943386,0.0015876429],"genre_scores_gemma":[0.9995624,0.00012510833,0.000115185016,0.000053505977,0.00009519234,8.3787074e-7,2.4244858e-7,0.000012640404,0.000034889796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997906,0.0003474167,0.00042126738,0.00020239029,0.0007089395,0.00041395775],"domain_scores_gemma":[0.99820685,0.0006262658,0.00023256765,0.0005943706,0.00025267492,0.00008724925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026417803,0.00015931767,0.00026628803,0.00020387293,0.00009168574,0.00010794189,0.0017819654,0.00007069515,0.000008366633],"category_scores_gemma":[0.00009962407,0.00010129789,0.00016437421,0.0008268884,0.00005353346,0.00041215224,0.00017468452,0.0008982173,0.000010820774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002716006,0.0001895009,0.00000783916,0.000011776441,0.000053012853,0.000013609218,0.0005624604,0.00020511713,0.00076953357,0.9865064,0.00021271149,0.0114408685],"study_design_scores_gemma":[0.00037590074,0.0032880146,0.00014237428,0.000047842263,0.000026187365,0.0001353189,0.000042849068,0.02157668,0.006010992,0.9673491,0.0008874371,0.00011730036],"about_ca_topic_score_codex":0.0000046291057,"about_ca_topic_score_gemma":8.947701e-7,"teacher_disagreement_score":0.17979033,"about_ca_system_score_codex":0.0004175597,"about_ca_system_score_gemma":0.0006429133,"threshold_uncertainty_score":0.4130808},"labels":[],"label_agreement":null},{"id":"W4403939412","doi":"10.37236/12950","title":"From Quasi-Symmetric to Schur Expansions with Applications to Symmetric Chain Decompositions and Plethysm","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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 function; Stanley symmetric function; Ring of symmetric functions; Symmetric group; Chain (unit); Schur polynomial; Pure mathematics; Physics; Quantum mechanics; Orthogonal polynomials","score_opus":0.017617490770866367,"score_gpt":0.31184217999462477,"score_spread":0.2942246892237584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403939412","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.23243971,0.0064133774,0.7538099,0.0058763786,0.00026419782,0.00061204814,0.000012143255,0.00007554179,0.00049666764],"genre_scores_gemma":[0.9912717,0.0003580759,0.0075183855,0.00019252734,0.00025813674,0.000065327105,0.0000016480504,0.000054101158,0.0002801079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982458,0.00009929562,0.0004575381,0.00023003698,0.00048718246,0.00048017036],"domain_scores_gemma":[0.9970097,0.0019131406,0.0001643791,0.00044077847,0.00024306742,0.00022896274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006839389,0.00020610886,0.00033853712,0.00075798354,0.0002678286,0.000110326226,0.000512482,0.00006820468,0.000011496461],"category_scores_gemma":[0.0003432452,0.00014216926,0.00008237314,0.003356643,0.00004320443,0.00014459161,0.00011300504,0.00087971217,0.000026292682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020388507,0.00020761431,0.000011712669,0.000019483688,0.00014216577,0.0000095064925,0.0006165375,0.000024568615,0.00026955237,0.99492556,0.000622316,0.003130623],"study_design_scores_gemma":[0.00032685918,0.00088840345,0.00006674224,0.00011402029,0.0001794241,0.00015935369,0.000320511,0.000113113936,0.0006890023,0.98566866,0.011294936,0.00017899781],"about_ca_topic_score_codex":0.000010742624,"about_ca_topic_score_gemma":0.000015153324,"teacher_disagreement_score":0.758832,"about_ca_system_score_codex":0.0004922976,"about_ca_system_score_gemma":0.00033176772,"threshold_uncertainty_score":0.5797494},"labels":[],"label_agreement":null},{"id":"W4403940531","doi":"10.37236/12980","title":"Layered Subgraphs of the Hypercube","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Hypercube; Parallel computing; Geology; Computer science; Combinatorics; Mathematics","score_opus":0.004848642471394242,"score_gpt":0.20326200840164893,"score_spread":0.1984133659302547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403940531","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.39697754,0.05596901,0.5137274,0.009132031,0.018866673,0.0003317559,9.740118e-7,0.00008945048,0.0049050963],"genre_scores_gemma":[0.998952,0.00038575803,0.000006637412,0.00006540432,0.00013101398,9.72985e-7,2.6414215e-8,0.0000073996925,0.00045082104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868345,0.0001920322,0.00038010598,0.00008560169,0.000382623,0.00027615664],"domain_scores_gemma":[0.999006,0.00020358476,0.00020619883,0.00036058744,0.00019465486,0.000028989589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014361773,0.00008690368,0.00017046716,0.00008066779,0.00009183996,0.00008555874,0.001360765,0.00004333538,0.000004597553],"category_scores_gemma":[0.000031819516,0.000042031512,0.00024349119,0.0008170176,0.000039629085,0.00018991792,0.00008951074,0.0005854988,0.0000039185406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043178907,0.000021957147,0.000042330183,0.0000101562255,0.00007105881,0.0000032394687,0.0003990108,0.0001885426,0.00033232145,0.99564314,0.002193091,0.0010908614],"study_design_scores_gemma":[0.00034258512,0.0005281195,0.00033305347,0.00018106494,0.000042908938,0.0011527579,0.00012601409,0.02128077,0.00333795,0.9358885,0.036656894,0.00012936501],"about_ca_topic_score_codex":0.000008435213,"about_ca_topic_score_gemma":0.0000048309735,"teacher_disagreement_score":0.6019744,"about_ca_system_score_codex":0.00012591269,"about_ca_system_score_gemma":0.00035775994,"threshold_uncertainty_score":0.25437337},"labels":[],"label_agreement":null},{"id":"W4404413602","doi":"10.37236/12984","title":"Simplicial Complexes with Many Facets are Vertex Decomposable","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Vertex (graph theory); Combinatorics; Simplicial complex; Mathematics; Graph","score_opus":0.007737977919089127,"score_gpt":0.2329950582611353,"score_spread":0.2252570803420462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404413602","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.14202233,0.015394278,0.8303815,0.010058448,0.00082571607,0.00012142576,0.000004582567,0.00011783706,0.001073879],"genre_scores_gemma":[0.99880606,0.00047089264,0.00011071493,0.00016827634,0.00007179957,0.0000013087247,8.698333e-7,0.0000081838825,0.00036188448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830455,0.00009934285,0.00032394187,0.00019048913,0.00054173474,0.000539936],"domain_scores_gemma":[0.99883467,0.00033893922,0.00020857659,0.0003623741,0.00016068324,0.000094753974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074873545,0.00015594953,0.00031618954,0.00024864747,0.00017976576,0.00031493756,0.0016859017,0.000046889032,0.000026582504],"category_scores_gemma":[0.00005051696,0.000080758226,0.00014962247,0.0020960195,0.00006927896,0.0004275248,0.00017994034,0.0006573856,0.000037129124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015881826,0.00008470086,0.00018372208,0.000007996558,0.000195073,0.000060382907,0.00006729774,0.000174206,0.000056583125,0.992248,0.0036757812,0.0032303862],"study_design_scores_gemma":[0.00047231378,0.0011163742,0.0015530154,0.000047223944,0.00012781977,0.0006722001,0.00007726498,0.008269916,0.0005136599,0.92474085,0.06219254,0.00021682399],"about_ca_topic_score_codex":0.000013485505,"about_ca_topic_score_gemma":0.000010078019,"teacher_disagreement_score":0.85678375,"about_ca_system_score_codex":0.00018374107,"about_ca_system_score_gemma":0.0002709933,"threshold_uncertainty_score":0.3293225},"labels":[],"label_agreement":null},{"id":"W4404413619","doi":"10.37236/12909","title":"On the Algebra Generated by Three Commuting Matrices: Combinatorial Cases","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","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; Universities Space Research Association","keywords":"Algebra over a field; Mathematics; Combinatorics; Pure mathematics","score_opus":0.010110952633977594,"score_gpt":0.23246427943863548,"score_spread":0.22235332680465789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404413619","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.4713874,0.06791716,0.42402622,0.019571345,0.013537588,0.00065377157,0.000009384778,0.00039080612,0.0025063145],"genre_scores_gemma":[0.9986645,0.0005364568,0.00002012191,0.00029369278,0.00030799126,0.0000041895855,8.429546e-7,0.000022937305,0.00014929465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748045,0.00048982963,0.000502731,0.00019724025,0.00069023337,0.0006395221],"domain_scores_gemma":[0.9962035,0.002645402,0.000305794,0.0005770184,0.00018474815,0.00008352636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035167532,0.00023846458,0.00027234186,0.000120208686,0.0005234634,0.0005731791,0.002529539,0.00008084307,0.000025310284],"category_scores_gemma":[0.00021305592,0.00012498067,0.00017014028,0.0011773744,0.00008932603,0.00035506755,0.0001991735,0.0015083334,0.000035740482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023243443,0.00008831197,0.0000028983045,0.000010356792,0.00011613579,0.000062736195,0.00018273182,0.000046089055,0.00017774665,0.98778987,0.009770151,0.0017297446],"study_design_scores_gemma":[0.00040998796,0.0009130079,0.0000021493013,0.00006986056,0.000048512433,0.000598306,0.000040309256,0.011587345,0.0025373215,0.9707656,0.012859634,0.00016798291],"about_ca_topic_score_codex":0.000010086005,"about_ca_topic_score_gemma":0.0000013797454,"teacher_disagreement_score":0.52727705,"about_ca_system_score_codex":0.0002728129,"about_ca_system_score_gemma":0.0005020463,"threshold_uncertainty_score":0.6553042},"labels":[],"label_agreement":null},{"id":"W4404822264","doi":"10.37236/13002","title":"Keller Properties for Integer Tilings","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer (computer science); Substitution tiling; Combinatorics; Mathematics; Integer programming; Computer science; Mathematical optimization","score_opus":0.013055691021755671,"score_gpt":0.23885556236758132,"score_spread":0.22579987134582566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404822264","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.015630243,0.015394359,0.9617386,0.0061102626,0.0005832453,0.00015036862,2.7474326e-7,0.00006139653,0.00033126833],"genre_scores_gemma":[0.9982926,0.00023069516,0.00011175419,0.00007294817,0.00007666293,0.000010088013,2.1700212e-7,0.000009640768,0.0011953625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992113,0.00002474387,0.00022137964,0.00009335953,0.00018713681,0.00026204405],"domain_scores_gemma":[0.99939704,0.000120481105,0.00007879696,0.00022879473,0.00014311018,0.00003178367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006934994,0.00007623548,0.000106436855,0.000067251814,0.00010412618,0.00017450805,0.00086957536,0.000027543238,0.0000027740887],"category_scores_gemma":[0.000027296546,0.000043705244,0.000120694116,0.0003271873,0.000028418415,0.00022763474,0.00006282814,0.00032255103,0.0000150317865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036060997,0.000029181156,9.630512e-7,0.000015196156,0.00003696181,0.0000013471189,0.00041044666,0.000018953535,0.001915148,0.9909502,0.001998045,0.0046199393],"study_design_scores_gemma":[0.00017247151,0.00021691882,0.0000037708453,0.000042139145,0.000029053012,0.0001628575,0.00003600109,0.04730082,0.012658135,0.7700185,0.16927627,0.00008307466],"about_ca_topic_score_codex":0.0000011247424,"about_ca_topic_score_gemma":3.3408674e-7,"teacher_disagreement_score":0.9826624,"about_ca_system_score_codex":0.00011533464,"about_ca_system_score_gemma":0.00041089006,"threshold_uncertainty_score":0.17822482},"labels":[],"label_agreement":null},{"id":"W4405465361","doi":"10.37236/11997","title":"A Complete Solution for a Nontrivial Ruleset with Entailing Moves","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","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":"Dalhousie University","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Axiom; Scope (computer science); Game theory; Affine transformation; Computer science; Mathematics; Combinatorial game theory; Algebra over a field; Calculus (dental); Mathematical economics; Pure mathematics; Sequential game; Programming language","score_opus":0.018145128700296692,"score_gpt":0.27140689401288653,"score_spread":0.2532617653125898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405465361","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.02207557,0.0041046576,0.9694938,0.003154089,0.00084978004,0.00018156617,0.0000016397356,0.000048258964,0.00009062349],"genre_scores_gemma":[0.9985191,0.00016215497,0.0009317439,0.00005960821,0.00020562632,0.000006947084,5.205592e-7,0.000013917274,0.00010034734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851847,0.00007431656,0.0003496875,0.00014783262,0.00040075422,0.0005089541],"domain_scores_gemma":[0.9987495,0.00051941106,0.0001862253,0.0002353769,0.0002563913,0.000053102976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012543359,0.00012652225,0.00018989781,0.00012585745,0.00017999753,0.00025694,0.0010020743,0.000039530678,0.0000021485628],"category_scores_gemma":[0.000077813434,0.000077454,0.00013072306,0.00045934418,0.00007031076,0.00045356035,0.000072478615,0.00047651315,0.000008858571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055733206,0.000042807365,0.0000147736755,0.000014463002,0.00009070627,0.0000109881985,0.0007583341,0.0002778352,0.0012620273,0.98934793,0.0004148858,0.007709514],"study_design_scores_gemma":[0.0002055282,0.0011744479,0.000010842569,0.0000812494,0.000046480367,0.00029741038,0.000074289856,0.14833531,0.0037202528,0.8316407,0.014288472,0.00012498104],"about_ca_topic_score_codex":0.0000076041856,"about_ca_topic_score_gemma":0.000011747449,"teacher_disagreement_score":0.9764436,"about_ca_system_score_codex":0.00032916642,"about_ca_system_score_gemma":0.0006352692,"threshold_uncertainty_score":0.31584826},"labels":[],"label_agreement":null},{"id":"W4405812762","doi":"10.37236/12464","title":"The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Repetition (rhetorical device); Binary number; Word (group theory); Arithmetic; Mathematics; Computer science; Combinatorics; Linguistics; Philosophy","score_opus":0.006386845421117536,"score_gpt":0.24807258380892247,"score_spread":0.24168573838780494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405812762","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.06696858,0.40540677,0.4215717,0.10106123,0.0028866432,0.00043331814,5.879328e-7,0.00063411915,0.0010370404],"genre_scores_gemma":[0.99533457,0.0035980027,0.00035769265,0.0002420116,0.0001978221,0.0000063825923,2.1577665e-7,0.000018614015,0.00024466787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788344,0.00023678593,0.0004215074,0.00018506637,0.00071396533,0.00055923604],"domain_scores_gemma":[0.9981221,0.0006676149,0.00028086334,0.0006304762,0.00025029466,0.000048642287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037444714,0.00017392257,0.00016102528,0.00013702415,0.00074075063,0.0007985942,0.0031491497,0.00007636967,0.0000018248],"category_scores_gemma":[0.00015650726,0.00007383589,0.00018980665,0.0016145005,0.00016345139,0.0005446754,0.0003111172,0.0021433763,0.0000046297546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016017833,0.000026717418,0.000018849674,0.000010641273,0.000057768862,0.00002877186,0.00025282582,0.000009716982,0.0006699427,0.9854855,0.0011196071,0.01230362],"study_design_scores_gemma":[0.00009897852,0.00032640068,0.00008603233,0.00014355652,0.000039689512,0.0006738545,0.000049989227,0.0020602767,0.000919495,0.98481023,0.01067433,0.000117169744],"about_ca_topic_score_codex":0.0000028794086,"about_ca_topic_score_gemma":0.0000044056787,"teacher_disagreement_score":0.928366,"about_ca_system_score_codex":0.00022828739,"about_ca_system_score_gemma":0.00047698373,"threshold_uncertainty_score":0.93120223},"labels":[],"label_agreement":null},{"id":"W4406985323","doi":"10.37236/12788","title":"The Clairvoyant Maître d'","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Reformation and Early Modern Christianity","field":"Arts and Humanities","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":"York University","funders":"Division of Mathematical Sciences; DePaul University; National Science Foundation","keywords":"Geology","score_opus":0.008034651449824971,"score_gpt":0.216562997371992,"score_spread":0.20852834592216704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406985323","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.2885458,0.03706745,0.008075853,0.044523202,0.008224358,0.00044582412,0.000004122517,0.00008058475,0.6130328],"genre_scores_gemma":[0.97807544,0.001150926,3.4757096e-7,0.00026002078,0.00013967897,0.000001250457,2.8970243e-7,0.000005105205,0.020366967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990691,0.00008638859,0.00030633333,0.000036800186,0.00022026266,0.00028114475],"domain_scores_gemma":[0.9991692,0.00015057098,0.00023025597,0.00016997429,0.0002559388,0.000024066223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087237026,0.00007839501,0.000112698355,0.000047160156,0.0008168561,0.00021099037,0.00046895412,0.000022348244,0.000051697833],"category_scores_gemma":[0.000038815277,0.00003504265,0.0001025364,0.00006644076,0.00012446975,0.00013405301,0.00003065703,0.0005614214,0.000020435502],"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.000026368509,0.0000324688,0.000016610897,0.0000051342527,0.000040994197,6.2463454e-7,0.0019114391,0.000006492933,0.0000029787311,0.98112947,0.015463028,0.0013643731],"study_design_scores_gemma":[0.00025996083,0.00008502905,0.00005750203,0.000009021237,0.000023810228,0.0000070225124,0.0014799119,0.00007238032,0.00006969584,0.43565643,0.5622456,0.000033635617],"about_ca_topic_score_codex":0.000016890435,"about_ca_topic_score_gemma":0.0000836052,"teacher_disagreement_score":0.6895296,"about_ca_system_score_codex":0.00015256456,"about_ca_system_score_gemma":0.0003321907,"threshold_uncertainty_score":0.62826794},"labels":[],"label_agreement":null},{"id":"W4407580272","doi":"10.37236/12506","title":"On the Quantum Chromatic Numbers of Small Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","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":"Université de Montréal","funders":"","keywords":"Chromatic scale; Quantum; Quantum graph; Mathematics; Computer science; Combinatorics; Physics; Quantum mechanics","score_opus":0.007870199887265065,"score_gpt":0.2162875026383883,"score_spread":0.20841730275112325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407580272","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.9279279,0.0045481957,0.05405613,0.010075812,0.0012364443,0.00017674021,2.0674649e-7,0.000032410764,0.0019461581],"genre_scores_gemma":[0.99911237,0.00027488582,0.00004486183,0.00041720242,0.0000027161484,0.0000016550168,5.55568e-8,0.0000051964257,0.00014108584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985113,0.00022226047,0.00045237024,0.00010084547,0.00036939443,0.00034384197],"domain_scores_gemma":[0.99798685,0.0007558445,0.0004410778,0.0005358331,0.0002447802,0.000035636953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014161,0.00011787837,0.00022547551,0.00016732176,0.0001707447,0.000047191716,0.0015690814,0.000042193027,0.0000027233352],"category_scores_gemma":[0.00017452217,0.00006049217,0.00016992433,0.0010925788,0.00009263821,0.000071709575,0.00009337528,0.0005801126,0.0000037336245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011182801,0.000103230115,0.000035324607,0.000010589052,0.00008339735,0.0000014971307,0.00018144742,0.00016397207,0.00028996685,0.9976877,0.0012181296,0.00021359356],"study_design_scores_gemma":[0.0004156015,0.0004347898,0.0000814891,0.0001008007,0.000033128552,0.000026609547,0.000045629993,0.0025272027,0.0021542304,0.9938865,0.00023524661,0.00005882236],"about_ca_topic_score_codex":0.000011376747,"about_ca_topic_score_gemma":0.0000023248072,"teacher_disagreement_score":0.07118444,"about_ca_system_score_codex":0.00007546111,"about_ca_system_score_gemma":0.00044310646,"threshold_uncertainty_score":0.29157698},"labels":[],"label_agreement":null},{"id":"W4408492470","doi":"10.37236/13018","title":"A Note on the Invertibility of Oriented Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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 Victoria","funders":"","keywords":"Mathematics; Computer science","score_opus":0.010311144251661103,"score_gpt":0.28411038253773035,"score_spread":0.2737992382860692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408492470","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.45461938,0.0019734534,0.5298948,0.010354323,0.0007242132,0.00033151137,6.583648e-7,0.000027067434,0.0020745802],"genre_scores_gemma":[0.9993074,0.00022082725,0.000043889064,0.00025456704,0.000008833737,0.0000025995164,5.6748952e-8,0.000005097824,0.00015671091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783593,0.00053390686,0.0004178205,0.00013974984,0.00061920413,0.00045336367],"domain_scores_gemma":[0.9968973,0.0013644678,0.00032489482,0.0008728468,0.0004958377,0.000044676308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003569069,0.00011784206,0.0002257941,0.00021463982,0.00018933904,0.000028547038,0.0023878454,0.000042659583,0.0000034178627],"category_scores_gemma":[0.0006873769,0.00006120813,0.00017499823,0.0020987573,0.0002149157,0.00016843487,0.00023087102,0.0010523734,0.0000023831083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095296076,0.00013216767,0.00020200653,0.0000067867386,0.000056885543,0.0000018133973,0.00019483252,0.000057693065,0.00054523436,0.99714345,0.0001914352,0.0013724159],"study_design_scores_gemma":[0.00043949307,0.00054732256,0.0003977329,0.0000348481,0.000012656253,0.000011935281,0.000039648265,0.000879953,0.013824406,0.982383,0.0013773746,0.00005161031],"about_ca_topic_score_codex":0.0000035134606,"about_ca_topic_score_gemma":0.0000030544256,"teacher_disagreement_score":0.54468805,"about_ca_system_score_codex":0.00023424285,"about_ca_system_score_gemma":0.0007125319,"threshold_uncertainty_score":0.45720974},"labels":[],"label_agreement":null},{"id":"W4409348349","doi":"10.37236/13380","title":"Fusions of the Tensor Product of a Strongly Regular Graph","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor product; Graph; Computer science; Mathematics; Combinatorics; Pure mathematics","score_opus":0.019374317501808756,"score_gpt":0.3038033342638607,"score_spread":0.28442901676205196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348349","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.9897726,0.0033981754,0.0015490699,0.002505735,0.00035430287,0.00043898937,0.0000034176958,0.0000096494505,0.0019680627],"genre_scores_gemma":[0.99785584,0.00026295232,0.00004710333,0.00001335472,0.00003372375,0.0000035128357,1.5350771e-7,0.000019117864,0.0017642672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736786,0.00055814325,0.0007421153,0.00010701329,0.0007594115,0.00046545765],"domain_scores_gemma":[0.9964879,0.0010302229,0.0007708156,0.0008505614,0.00082327187,0.000037196776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036229088,0.00014556295,0.0004404048,0.00023261545,0.00014518347,0.000011790863,0.0014059864,0.00006221163,0.00001867893],"category_scores_gemma":[0.0019075114,0.000078090736,0.00031699755,0.001356771,0.0003021184,0.00006582133,0.00021216592,0.0010341193,7.649049e-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.00014625,0.0003507618,0.000527656,0.000112635455,0.0002577127,0.0000011576628,0.0002965384,0.000022486714,0.005162923,0.9914628,0.0014722481,0.00018681446],"study_design_scores_gemma":[0.00076686335,0.00039536064,0.0007021435,0.00016266247,0.00018123163,0.000039242368,0.0003279836,0.000027607328,0.023710301,0.97283185,0.0007916676,0.00006311857],"about_ca_topic_score_codex":0.0000048688817,"about_ca_topic_score_gemma":0.000005164708,"teacher_disagreement_score":0.018630998,"about_ca_system_score_codex":0.00017957496,"about_ca_system_score_gemma":0.0010227263,"threshold_uncertainty_score":0.44927913},"labels":[],"label_agreement":null},{"id":"W4409766224","doi":"10.37236/12751","title":"Turán Colourings in Off-Diagonal Ramsey Multiplicity","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diagonal; Multiplicity (mathematics); Combinatorics; Mathematics; Ramsey's theorem; Geometry; Graph","score_opus":0.00993804610950145,"score_gpt":0.31040045841189556,"score_spread":0.3004624123023941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409766224","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.9790615,0.0038133739,0.012327889,0.0019577492,0.00053967896,0.0001855452,7.837475e-7,0.000021531512,0.0020919626],"genre_scores_gemma":[0.99788254,0.00053763995,0.00006699557,0.00020644032,0.0000456159,0.000004147459,2.3753232e-7,0.000012189111,0.0012442173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984315,0.00025103358,0.00051551353,0.00010181971,0.00020404672,0.0004960554],"domain_scores_gemma":[0.997789,0.0014546738,0.0003410258,0.0002302286,0.00014673587,0.000038310252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019564703,0.0001456963,0.00036499996,0.00016554163,0.0001246347,0.000011196993,0.00054492423,0.00012734097,0.000018399656],"category_scores_gemma":[0.00083077647,0.00010330581,0.00012445457,0.0004006408,0.00012984194,0.000100264064,0.00007710876,0.001383592,0.0000034810535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021170064,0.00024603624,0.00076706085,0.000016793292,0.00007926289,0.000014547891,0.00028069812,0.000049223385,0.00011681321,0.9969522,0.0005897578,0.0006759328],"study_design_scores_gemma":[0.0015129531,0.00017361254,0.000739291,0.000049435486,0.000047279344,0.00007395266,0.00019623416,0.00009099408,0.0013750298,0.99189466,0.0037565825,0.000089947825],"about_ca_topic_score_codex":0.000002965629,"about_ca_topic_score_gemma":0.000021437803,"teacher_disagreement_score":0.01882103,"about_ca_system_score_codex":0.00043027554,"about_ca_system_score_gemma":0.00043397135,"threshold_uncertainty_score":0.60110956},"labels":[],"label_agreement":null},{"id":"W4409766258","doi":"10.37236/13236","title":"Simplicial Complexes and Matroids with Vanishing $T^2$","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","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":"McMaster University","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; National Board for Higher Mathematics; Istituto Nazionale di Alta Matematica \"Francesco Severi\"; National Foundation for Science and Technology Development; Banff International Research Station for Mathematical Innovation and Discovery; Vietnam Institute for Advanced Study in Mathematics; National Science Foundation","keywords":"Matroid; Simplicial complex; Abstract simplicial complex; h-vector; Simplicial approximation theorem; Mathematics; Combinatorics; Computer science; Simplicial set; Pure mathematics","score_opus":0.011354012328640868,"score_gpt":0.2974321554897087,"score_spread":0.28607814316106783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409766258","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.9008128,0.0018232885,0.09014322,0.0038671615,0.00006856388,0.00018559392,8.979712e-7,0.000020383566,0.0030780833],"genre_scores_gemma":[0.9993087,0.00017448352,0.00014379808,0.000106968306,0.000032558688,0.0000033778224,2.143133e-7,0.000010925783,0.00021896647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991616,0.000077360826,0.00026856363,0.00006639197,0.00018013809,0.00024591494],"domain_scores_gemma":[0.99865335,0.00071089325,0.00023265206,0.00018667827,0.00018541278,0.00003098256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057526195,0.0001025561,0.00021698914,0.00007114973,0.00023178158,0.000054940367,0.0003159765,0.000028224356,0.000005760792],"category_scores_gemma":[0.00009553078,0.00006195585,0.000044079825,0.00031783036,0.00008497082,0.000094427414,0.000060952505,0.00047665046,6.7199625e-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.000037377136,0.000061397215,0.00028982438,0.000013958782,0.000103919054,8.209692e-7,0.0002717389,0.000002035531,0.0003168985,0.99722457,0.0011006582,0.00057682226],"study_design_scores_gemma":[0.000598444,0.0002820306,0.0008651465,0.000033540487,0.00012633407,0.000081048405,0.00034531206,0.00003914381,0.0007332844,0.9928803,0.0039491616,0.00006626813],"about_ca_topic_score_codex":0.000004148358,"about_ca_topic_score_gemma":0.000017079787,"teacher_disagreement_score":0.0984959,"about_ca_system_score_codex":0.00011514133,"about_ca_system_score_gemma":0.00024042375,"threshold_uncertainty_score":0.25264862},"labels":[],"label_agreement":null},{"id":"W4409766807","doi":"10.37236/13350","title":"The Skew Immaculate Hecke Poset and 0-Hecke Modules","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":1,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Skew; Mathematics; Partially ordered set; Pure mathematics; Combinatorics; Computer science","score_opus":0.007580599807239986,"score_gpt":0.2903537674245291,"score_spread":0.28277316761728916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409766807","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.93740267,0.031189505,0.024107544,0.00479541,0.0007006796,0.00021420537,0.0000016135284,0.000028183349,0.001560215],"genre_scores_gemma":[0.9936062,0.0042767064,0.00005328936,0.00011353181,0.00006028961,0.0000022436334,2.7886153e-7,0.000016724258,0.0018707123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850714,0.0001267411,0.00045355552,0.000101594356,0.000307826,0.0005031487],"domain_scores_gemma":[0.99807966,0.0009659075,0.00036256254,0.00033357512,0.00020553284,0.000052742802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013535547,0.00016488264,0.00028811375,0.00009351046,0.00043498783,0.00007109554,0.0005306319,0.000064063985,0.0000036615868],"category_scores_gemma":[0.00043507345,0.00008721649,0.0001245675,0.0004545922,0.00012200547,0.00010870694,0.00010856938,0.0007872887,0.0000023261766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050962273,0.000052851672,0.00010948933,0.000020526666,0.00017700407,0.0000040513564,0.00009194452,0.0000062379977,0.00008493412,0.9952062,0.0010926109,0.0031031815],"study_design_scores_gemma":[0.0006543329,0.00017069318,0.0003869567,0.00004657735,0.00011332137,0.00011130329,0.00017319295,0.00008195542,0.00075013906,0.9866482,0.010771638,0.00009169589],"about_ca_topic_score_codex":8.6910194e-7,"about_ca_topic_score_gemma":0.0000051098004,"teacher_disagreement_score":0.056203578,"about_ca_system_score_codex":0.00016476386,"about_ca_system_score_gemma":0.00021351101,"threshold_uncertainty_score":0.35565853},"labels":[],"label_agreement":null},{"id":"W4410338799","doi":"10.37236/12513","title":"Almost All 9-Regular Graphs Have a Modulo-5 Orientation","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Modulo; Orientation (vector space); Mathematics; Combinatorics; Arithmetic; Geometry","score_opus":0.003546911379042969,"score_gpt":0.20805621188000095,"score_spread":0.20450930050095797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410338799","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.9605503,0.010836992,0.021056127,0.00034844285,0.0024361166,0.00018563257,0.0000010910195,0.00007101952,0.004514251],"genre_scores_gemma":[0.9986143,0.000855329,0.0000028801273,0.000048972084,0.00003764002,0.000004391103,0.0000011259592,0.000016969736,0.00041840738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988456,0.00011191621,0.0003700139,0.0000692638,0.00023063648,0.0003725992],"domain_scores_gemma":[0.9994039,0.00008323939,0.00012002012,0.00022474854,0.00012548012,0.000042635475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090315804,0.00013770675,0.00021303691,0.00013899196,0.00008797471,0.000034769208,0.00033473124,0.00006731778,0.0000061676888],"category_scores_gemma":[0.000025075962,0.00010203856,0.00014881471,0.00042861482,0.00003577448,0.00012759196,0.000015787633,0.0005109176,0.000004321954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028640645,0.000036153953,0.0002673357,0.000031902448,0.00030007193,0.000004578885,0.0003889769,0.0023322199,0.0010680393,0.9931963,0.0019893553,0.00035643807],"study_design_scores_gemma":[0.0007046604,0.00014528976,0.0003071649,0.00005282317,0.00011842181,0.00006605297,0.00025872502,0.0015424982,0.005519491,0.97403586,0.017132543,0.00011644837],"about_ca_topic_score_codex":0.000004464843,"about_ca_topic_score_gemma":0.0000058299784,"teacher_disagreement_score":0.03806396,"about_ca_system_score_codex":0.00025305562,"about_ca_system_score_gemma":0.00010039625,"threshold_uncertainty_score":0.41610116},"labels":[],"label_agreement":null},{"id":"W4410338800","doi":"10.37236/12822","title":"Grid Minors and Products","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Grid; Computer science; Geology; Geodesy","score_opus":0.006239289094987502,"score_gpt":0.256904653646761,"score_spread":0.2506653645517735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410338800","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.3767535,0.044954438,0.54085803,0.030478245,0.0026622976,0.00044962397,4.3224875e-7,0.000070793925,0.003772597],"genre_scores_gemma":[0.9978837,0.00090668636,0.00015420023,0.00010878089,0.00004448679,0.0000015306648,4.7523347e-8,0.000004551398,0.0008960172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876803,0.00016098036,0.00022174962,0.00012568494,0.00030298097,0.0004205584],"domain_scores_gemma":[0.998881,0.0002508085,0.00014441328,0.00037590947,0.00030271852,0.000045139055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015518322,0.00008960491,0.00015435209,0.0001814302,0.00015035992,0.00006881001,0.0012332839,0.000027706943,7.939512e-7],"category_scores_gemma":[0.00024428006,0.00005844075,0.000041523304,0.0010498287,0.00009777943,0.00028936003,0.00021655373,0.00062107656,0.0000017628768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018029454,0.000036308556,0.00013536369,0.000009196894,0.000035770645,0.000004891525,0.000099775876,0.000009961333,0.00032467075,0.99435467,0.00068664027,0.0042847493],"study_design_scores_gemma":[0.00038489036,0.0002541491,0.00038675542,0.000016238842,0.000010454008,0.00011767771,0.000027047992,0.00018171735,0.0052397666,0.98140174,0.011921325,0.000058256766],"about_ca_topic_score_codex":9.745493e-7,"about_ca_topic_score_gemma":6.530518e-7,"teacher_disagreement_score":0.62113017,"about_ca_system_score_codex":0.00012893513,"about_ca_system_score_gemma":0.0005418742,"threshold_uncertainty_score":0.2698303},"labels":[],"label_agreement":null},{"id":"W4410590613","doi":"10.37236/12746","title":"Classification of Vertex-Transitive Digraphs of Order a Product of Two Distinct Primes via Automorphism Group","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","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 Lethbridge","funders":"","keywords":"Transitive relation; Automorphism group; Automorphism; Vertex (graph theory); Combinatorics; Mathematics; Order (exchange); Group (periodic table); Inner automorphism; Product (mathematics); Digraph; Discrete mathematics; Graph; Physics; Business","score_opus":0.012377976705542236,"score_gpt":0.28865931985978394,"score_spread":0.2762813431542417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590613","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.96035725,0.0014101415,0.036023043,0.00052038056,0.00012854116,0.00036867047,0.0000051151173,0.000012315045,0.0011745464],"genre_scores_gemma":[0.99962884,0.00013430427,0.00011325936,0.0000064924916,0.000010555806,0.000008346205,0.0000016808151,0.000012584463,0.00008392808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837047,0.00021858227,0.0007817048,0.00010770161,0.00030032903,0.00022123696],"domain_scores_gemma":[0.9971319,0.0006557535,0.001087807,0.00039736155,0.0007008381,0.000026346515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013852945,0.0001348984,0.0004379273,0.00018874036,0.00006843096,0.0000044963754,0.00045481574,0.000046791785,0.000005691891],"category_scores_gemma":[0.00024061235,0.00009680947,0.00017718774,0.0010626706,0.00024644617,0.00006510348,0.000026754646,0.00038749623,2.0534286e-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.0001109436,0.0007093091,0.00063215016,0.00012360919,0.0002795918,2.4592222e-7,0.0004568756,0.0000040124314,0.03082861,0.96628684,0.000063458036,0.00050435984],"study_design_scores_gemma":[0.00084446144,0.0002894189,0.0037970974,0.00011935351,0.00035705388,0.000014030273,0.00013143734,0.00015534121,0.042866234,0.9512711,0.00008311985,0.000071304676],"about_ca_topic_score_codex":0.000009657273,"about_ca_topic_score_gemma":0.0000073756155,"teacher_disagreement_score":0.039271604,"about_ca_system_score_codex":0.00007318713,"about_ca_system_score_gemma":0.00035555303,"threshold_uncertainty_score":0.39477754},"labels":[],"label_agreement":null},{"id":"W4410590685","doi":"10.37236/12962","title":"3-Cluster-Free Families of Subspaces","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","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":"University of British Columbia","funders":"","keywords":"Linear subspace; Cluster (spacecraft); Mathematics; Combinatorics; Computer science; Pure mathematics; Programming language","score_opus":0.003592812360183899,"score_gpt":0.22310507720525183,"score_spread":0.21951226484506792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590685","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.17165673,0.012537761,0.80551434,0.0058006737,0.0009451479,0.000101626625,2.928766e-7,0.00002712888,0.003416323],"genre_scores_gemma":[0.9980298,0.0011437897,0.00024942335,0.00015495103,0.000023494189,9.1476016e-7,5.3982006e-8,0.0000038507337,0.0003936772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988233,0.00010672125,0.00034757608,0.000090859954,0.0002983993,0.00033315766],"domain_scores_gemma":[0.99853,0.0003332112,0.0003569966,0.00051761186,0.00023261823,0.000029575318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073218334,0.00010413053,0.00024199944,0.00015308605,0.00009372648,0.00002995727,0.0022163559,0.000039278682,0.0000015241066],"category_scores_gemma":[0.00016835352,0.00006542438,0.00011168808,0.0007669254,0.0000762643,0.00026116797,0.00025895858,0.00041139335,0.0000011993403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015788102,0.000055689718,0.00017924025,0.000010403298,0.000046061938,0.000002036083,0.00020690745,0.0001600525,0.00019209756,0.9964704,0.000706897,0.0019544458],"study_design_scores_gemma":[0.00066257396,0.00034590703,0.00041504312,0.000028463768,0.0000210469,0.00003496991,0.00012002433,0.0004541274,0.00463492,0.98976344,0.0034559467,0.00006350898],"about_ca_topic_score_codex":0.0000029443963,"about_ca_topic_score_gemma":0.0000048009915,"teacher_disagreement_score":0.8263731,"about_ca_system_score_codex":0.000111901674,"about_ca_system_score_gemma":0.0004672299,"threshold_uncertainty_score":0.41185775},"labels":[],"label_agreement":null},{"id":"W4410590705","doi":"10.37236/13669","title":"Frozen Colourings in $2K_2$-free graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","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":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics","score_opus":0.0058383278427437645,"score_gpt":0.2613319210123492,"score_spread":0.25549359316960546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590705","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.51226574,0.014502135,0.44864932,0.014948032,0.0014865808,0.00048107438,6.6105594e-7,0.00007831855,0.007588146],"genre_scores_gemma":[0.99836296,0.0006768502,0.00015639077,0.00018174078,0.000014875739,0.0000046576624,6.802047e-8,0.000008168438,0.00059426454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978804,0.0002914995,0.0004340106,0.00016257884,0.0005107993,0.00072069134],"domain_scores_gemma":[0.9981425,0.0005361537,0.00023214158,0.00077173195,0.0002548427,0.0000626309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026803806,0.00013631707,0.00026939606,0.00054849224,0.00013643688,0.00007971367,0.004135252,0.00006131817,0.0000033754523],"category_scores_gemma":[0.00036517426,0.000097978256,0.00012876219,0.0022953604,0.00010236718,0.00039124148,0.00048772444,0.001275961,0.0000039782076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049279,0.00009559617,0.00078030536,0.000006509435,0.000040587376,0.000019844927,0.00015944608,0.000087531065,0.0001696667,0.9967027,0.0005597118,0.0013288365],"study_design_scores_gemma":[0.0012716337,0.00029950976,0.0010921746,0.000037451584,0.000008171385,0.00005026327,0.00004514116,0.00034074308,0.0015916727,0.9921521,0.0030236847,0.000087440596],"about_ca_topic_score_codex":0.000006341613,"about_ca_topic_score_gemma":0.000013005697,"teacher_disagreement_score":0.48609725,"about_ca_system_score_codex":0.00042178764,"about_ca_system_score_gemma":0.0007362338,"threshold_uncertainty_score":0.7684396},"labels":[],"label_agreement":null},{"id":"W4411054266","doi":"10.37236/12681","title":"A Combinatorial Proof of a Symmetry for a Refinement of the Narayana Numbers","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","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":"Université du Québec à Montréal","funders":"Medical Research Council; National Science Foundation","keywords":"Symmetry (geometry); Mathematics; Combinatorial proof; Combinatorics; Geometry","score_opus":0.004653053591272252,"score_gpt":0.26570960134218685,"score_spread":0.2610565477509146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411054266","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.22339892,0.0012701068,0.7441586,0.0049951654,0.0013937508,0.0018184538,0.000028422064,0.000009860369,0.022926724],"genre_scores_gemma":[0.9994929,0.000009830455,0.00009401407,0.00001673764,0.0000549134,0.000024084045,5.4073695e-7,0.000007907251,0.00029910915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989832,0.000044242366,0.00049135496,0.00006404829,0.00019424365,0.00022287667],"domain_scores_gemma":[0.99845105,0.0003563289,0.00059763406,0.00027758177,0.00029579445,0.000021628657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053044595,0.00009555837,0.0002863681,0.000032979588,0.000108517495,0.0000066136195,0.00048385028,0.000024807834,0.000009244284],"category_scores_gemma":[0.00005870984,0.000054071177,0.00024412837,0.00042469337,0.00010535036,0.000033475848,0.00006383222,0.00025889731,1.2947697e-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.00005983299,0.00031480656,0.000110651876,0.00004275289,0.00017678468,1.4551084e-8,0.0000870107,0.00002878063,0.00024378058,0.9979583,0.00027730686,0.00069997594],"study_design_scores_gemma":[0.0010496567,0.00018550275,0.000012442122,0.00006868006,0.0001335106,7.583514e-7,0.00030256523,0.00004666256,0.021042703,0.972614,0.004498083,0.000045444798],"about_ca_topic_score_codex":0.000004892632,"about_ca_topic_score_gemma":3.74281e-7,"teacher_disagreement_score":0.77609396,"about_ca_system_score_codex":0.00007176325,"about_ca_system_score_gemma":0.00041139487,"threshold_uncertainty_score":0.22049586},"labels":[],"label_agreement":null},{"id":"W4411450127","doi":"10.37236/13499","title":"The Repetition Threshold for Ternary Rich Words","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Repetition (rhetorical device); Conjecture; Mathematics; Combinatorics; Binary number; Polynomial; Root (linguistics); Discrete mathematics; Arithmetic; Computer science; Mathematical analysis; Linguistics; Philosophy","score_opus":0.004598387732743194,"score_gpt":0.23934507771130026,"score_spread":0.23474668997855708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411450127","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.06160131,0.015477329,0.90076905,0.016554372,0.002607543,0.0002648421,5.002981e-7,0.000056768535,0.0026682944],"genre_scores_gemma":[0.99707556,0.001066401,0.00007639093,0.0003593351,0.000100658894,0.000008375198,2.1079387e-7,0.000006674958,0.0013064067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987844,0.00008838379,0.00033587968,0.000108472836,0.00026655255,0.00041629712],"domain_scores_gemma":[0.9983595,0.00065954163,0.0002843047,0.00048195085,0.00018646326,0.00002824535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024001333,0.000102203005,0.00014588116,0.00007181076,0.00042286728,0.0001733271,0.0018698474,0.000041770607,9.925527e-7],"category_scores_gemma":[0.00010002293,0.00005455585,0.00013315536,0.0004690082,0.000051436375,0.00022239017,0.00013671245,0.00042905257,0.0000017749212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002937126,0.000040326184,0.00005138797,0.000004753692,0.000054146087,0.0000018091757,0.00008869837,0.000024964065,0.00010938233,0.9910098,0.0033115973,0.005273819],"study_design_scores_gemma":[0.0004609284,0.00025860927,0.00015592345,0.000032134576,0.000023904762,0.000061504485,0.00006431855,0.004829952,0.0013073258,0.96825635,0.02448624,0.00006278931],"about_ca_topic_score_codex":0.0000011092669,"about_ca_topic_score_gemma":0.0000014751598,"teacher_disagreement_score":0.9354742,"about_ca_system_score_codex":0.0002266043,"about_ca_system_score_gemma":0.00038498902,"threshold_uncertainty_score":0.34746727},"labels":[],"label_agreement":null},{"id":"W4412022751","doi":"10.37236/12851","title":"Characterizations of Perfectly Clustering Words","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Natural language processing; Computer science; Artificial intelligence; Mathematics","score_opus":0.004797784448982438,"score_gpt":0.23334965078588837,"score_spread":0.22855186633690594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412022751","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.08049219,0.0015444953,0.91495353,0.0013393817,0.0005847774,0.000056373658,1.4140682e-7,0.00001479229,0.0010143166],"genre_scores_gemma":[0.9989855,0.0003939046,0.00017155574,0.000118602184,0.000027260588,0.0000010800014,1.3194004e-7,0.0000038016535,0.00029811924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990805,0.00007574466,0.00031898404,0.00007468415,0.0001871216,0.00026301522],"domain_scores_gemma":[0.99908704,0.00013972889,0.000302926,0.00027078378,0.00017379284,0.000025762027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049178634,0.0000805219,0.00018210361,0.00012715932,0.000104191924,0.000030651692,0.0009958307,0.000030357613,0.0000027550143],"category_scores_gemma":[0.000067745306,0.000054763812,0.000084531945,0.00075060874,0.000034825378,0.00025089795,0.00013323316,0.00035441143,0.0000011135235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000812512,0.000051163363,0.00013995502,0.000008412751,0.0000330736,0.0000015525027,0.0002133021,0.0002650681,0.001964456,0.9940073,0.000028063996,0.0032795663],"study_design_scores_gemma":[0.0005279236,0.00035974898,0.0016063516,0.000056112218,0.000028177838,0.000066009015,0.00005244332,0.0039092866,0.00491799,0.98570806,0.002678214,0.000089678986],"about_ca_topic_score_codex":7.439773e-7,"about_ca_topic_score_gemma":9.987738e-7,"teacher_disagreement_score":0.91849333,"about_ca_system_score_codex":0.00011443375,"about_ca_system_score_gemma":0.00036709133,"threshold_uncertainty_score":0.22332034},"labels":[],"label_agreement":null},{"id":"W4413073558","doi":"10.37236/13247","title":"Clustered Colouring of Graph Products","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Discrete mathematics; Cluster analysis; 1-planar graph; Pathwidth; Degree (music); Partial k-tree; Graph; Chordal graph; Line graph","score_opus":0.008809648612104325,"score_gpt":0.26838149700915837,"score_spread":0.25957184839705405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413073558","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.2631531,0.010992258,0.71635324,0.0060532046,0.0011275647,0.0003508684,3.4886e-7,0.000037538346,0.0019318856],"genre_scores_gemma":[0.9987514,0.0004483796,0.00024420305,0.000048087648,0.000021585796,0.0000020082318,5.779385e-8,0.000006329043,0.00047796828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982298,0.00025411425,0.00042507984,0.00013344141,0.00046573323,0.00049181416],"domain_scores_gemma":[0.99803215,0.00033860264,0.00037712042,0.00056852424,0.0006421779,0.00004140655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022415493,0.00010727703,0.00025492028,0.00033630495,0.00012699145,0.000036464182,0.0021695958,0.00003914223,0.0000011507201],"category_scores_gemma":[0.00030618845,0.00007440017,0.00010663234,0.0019810488,0.00011543475,0.0002849193,0.00027574858,0.00070346124,0.0000011469823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005450655,0.00009313427,0.00012604825,0.000025775675,0.000081298866,0.000004167598,0.00015814413,0.00016946123,0.0018303307,0.9957452,0.00022397634,0.0014879507],"study_design_scores_gemma":[0.0006366162,0.0004063282,0.00025412795,0.00004531737,0.000016101556,0.00005187877,0.000040498977,0.0003096667,0.03058091,0.96625704,0.0013376662,0.000063871215],"about_ca_topic_score_codex":0.0000014176328,"about_ca_topic_score_gemma":0.0000010449975,"teacher_disagreement_score":0.73559827,"about_ca_system_score_codex":0.00017845053,"about_ca_system_score_gemma":0.0008401196,"threshold_uncertainty_score":0.4031685},"labels":[],"label_agreement":null},{"id":"W4414785272","doi":"10.37236/12956","title":"Graphs of Bounded Chordality","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Land Rights and Reforms","field":"Agricultural and Biological Sciences","cited_by":1,"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; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Chordal graph; Indifference graph; Split graph; Pathwidth; Interval graph; Block graph; Intersection graph; Treewidth; Clique-sum","score_opus":0.005595933152981684,"score_gpt":0.2108549141086347,"score_spread":0.205258980955653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414785272","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.99308246,0.0014930546,0.00003114674,0.0035871628,0.00035769175,0.000057214398,9.490136e-7,0.0000050795884,0.0013852465],"genre_scores_gemma":[0.99737424,0.0012266708,6.9069046e-7,0.000057184854,0.000040915813,3.587506e-7,6.311964e-7,2.7877465e-7,0.001299009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992314,0.000054034557,0.00026727945,0.000048702685,0.00017934965,0.00021925109],"domain_scores_gemma":[0.9994776,0.00009259428,0.00021766577,0.000044746826,0.00014155288,0.000025805188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062895444,0.000064250096,0.00016992437,0.000013802667,0.00013917645,0.00001578585,0.00036933264,0.000047263795,0.000018193896],"category_scores_gemma":[0.000017346318,0.000009366907,0.00014007247,0.00040072724,0.00006661727,0.00005111286,0.00002725505,0.00026190118,5.85405e-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.000055764758,0.00014631404,0.001687291,0.0000063097723,0.00008310616,9.1322556e-7,0.000035956964,0.0000012207054,0.004035852,0.9841377,0.00040398547,0.009405572],"study_design_scores_gemma":[0.00022305705,0.00037189602,0.01306537,0.00001604728,0.000027717564,0.000012602347,0.000060605234,0.00000350409,0.003726954,0.92907315,0.05337815,0.000040933013],"about_ca_topic_score_codex":0.000043251282,"about_ca_topic_score_gemma":0.000048123115,"teacher_disagreement_score":0.055064548,"about_ca_system_score_codex":0.00004877967,"about_ca_system_score_gemma":0.00007377126,"threshold_uncertainty_score":0.11378449},"labels":[],"label_agreement":null},{"id":"W4414785393","doi":"10.37236/13504","title":"Invertibility in the Misère Multiverse","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Medieval European Literature and History","field":"Arts and Humanities","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":"Memorial University of Newfoundland","funders":"","keywords":"Invertible matrix; Universe; Set (abstract data type); Stability (learning theory); Algebra over a field","score_opus":0.009839901334016622,"score_gpt":0.21693146801477164,"score_spread":0.207091566680755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414785393","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.605089,0.03209226,0.00015912946,0.008915247,0.0039346465,0.00039859273,0.0000029415921,0.000021663323,0.3493865],"genre_scores_gemma":[0.991148,0.00019136874,4.0774987e-7,0.0011545157,0.00016602379,9.004912e-7,3.854053e-7,0.0000045575835,0.0073338575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989076,0.00031061203,0.00027977035,0.00006267989,0.00021070849,0.00022858665],"domain_scores_gemma":[0.99927986,0.00021182372,0.00013698096,0.000201952,0.00015252948,0.000016880176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016193859,0.00008323861,0.00014267617,0.000094015646,0.00019334149,0.00005854817,0.00051999174,0.000020680314,0.000062886735],"category_scores_gemma":[0.000110954265,0.00004171751,0.000093865914,0.00010789752,0.0001637803,0.000103791615,0.0000219887,0.00081168354,0.000009082102],"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.00005602026,0.00010323156,0.0000599432,0.0000109977245,0.000025531228,0.000008235037,0.025747677,0.0000018240613,0.000009988795,0.95842236,0.015247189,0.00030701802],"study_design_scores_gemma":[0.0005176796,0.00015577213,0.00026575575,0.000032461765,0.000037843853,0.000007743567,0.0033339774,0.000014068314,0.000015682399,0.1939418,0.80163074,0.00004647103],"about_ca_topic_score_codex":0.000020618721,"about_ca_topic_score_gemma":0.0001726764,"teacher_disagreement_score":0.78638357,"about_ca_system_score_codex":0.0001907833,"about_ca_system_score_gemma":0.00025303752,"threshold_uncertainty_score":0.3526406},"labels":[],"label_agreement":null},{"id":"W4414785425","doi":"10.37236/13199","title":"Degree-Similar Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Natural Science Foundation of Shandong Province; University of Waterloo; China Postdoctoral Science Foundation","keywords":"Degree matrix; Invertible matrix; Adjacency matrix; Laplacian matrix; Diagonal matrix; Degree (music); Converse; Diagonal; Matrix (chemical analysis)","score_opus":0.013921917469359935,"score_gpt":0.2820883461614702,"score_spread":0.26816642869211027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414785425","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.027453778,0.010667977,0.9495026,0.0060221637,0.00090156036,0.00015334095,2.1135011e-7,0.00004643002,0.0052519385],"genre_scores_gemma":[0.99775213,0.0009864643,0.00021854407,0.00025399795,0.000020516689,0.000002523069,7.23147e-8,0.00000768496,0.0007580634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980534,0.00027027726,0.00035561965,0.00014125869,0.00052344985,0.00065603317],"domain_scores_gemma":[0.99823564,0.00044340172,0.00022568763,0.00062513916,0.0003997051,0.00007044634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022105945,0.00013234785,0.00022491082,0.00034389898,0.00023075132,0.00008460181,0.0029310065,0.0000512034,0.0000038690046],"category_scores_gemma":[0.00019407268,0.00008780557,0.00017156093,0.0018884622,0.00011075343,0.00036820822,0.00025851463,0.0010478934,0.000006340211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025353353,0.000060850925,0.00012986794,0.000004922037,0.000072523995,0.000010610264,0.00007165209,0.000048827424,0.000180972,0.9933247,0.0006452626,0.0054244567],"study_design_scores_gemma":[0.0005330217,0.00028613606,0.000216155,0.000020401581,0.000015235417,0.00007986625,0.000030849646,0.00037138918,0.0022507422,0.98621434,0.00990262,0.000079217054],"about_ca_topic_score_codex":0.000001153042,"about_ca_topic_score_gemma":0.0000017079433,"teacher_disagreement_score":0.97029835,"about_ca_system_score_codex":0.0002439336,"about_ca_system_score_gemma":0.0007688295,"threshold_uncertainty_score":0.54465884},"labels":[],"label_agreement":null},{"id":"W4415368689","doi":"10.37236/14483","title":"A Short Proof of Seymour’s 6-Flow Theorem","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Polynomial and algebraic computation","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Proof complexity; Mathematical proof; Calculus (dental); Graph theory","score_opus":0.006860189723091736,"score_gpt":0.23842303830001657,"score_spread":0.23156284857692483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368689","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.10725179,0.020273209,0.8605458,0.0059679253,0.0035733026,0.00039349138,0.0000016435537,0.000017859424,0.00197495],"genre_scores_gemma":[0.99795574,0.00075030513,0.000099810604,0.00015517363,0.00017340832,0.000002557738,3.740368e-7,0.000015125563,0.00084752624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960429,0.0005108123,0.0014052605,0.00027112183,0.0008601876,0.0009097323],"domain_scores_gemma":[0.99679184,0.0005387348,0.0009923344,0.0006623941,0.0008976766,0.000117024756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034223134,0.00033566667,0.0007284857,0.0003796147,0.00026942094,0.00014802568,0.0028033047,0.00014562104,0.000009868479],"category_scores_gemma":[0.00020660847,0.00023694843,0.0004657045,0.0020013186,0.00024834924,0.00043448646,0.00043965608,0.0014205348,0.0000026666125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013536889,0.00043245452,0.00008760149,0.00005854512,0.00034987106,0.000008294005,0.00080739765,0.0016791914,0.0001564488,0.8258953,0.0005942058,0.16979532],"study_design_scores_gemma":[0.0010599664,0.0012890788,0.00052355696,0.00028392934,0.00022747078,0.00014944303,0.00008063049,0.054029275,0.01024346,0.92981154,0.0020929154,0.00020875725],"about_ca_topic_score_codex":0.0000067099118,"about_ca_topic_score_gemma":0.0000034156174,"teacher_disagreement_score":0.8907039,"about_ca_system_score_codex":0.0005748135,"about_ca_system_score_gemma":0.003680058,"threshold_uncertainty_score":0.9662476},"labels":[],"label_agreement":null},{"id":"W4415368940","doi":"10.37236/11555","title":"Complement Avoidance in Binary Words","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"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 Winnipeg","funders":"","keywords":"Complement (music); Binary number; Word (group theory); Binary data; Factor (programming language)","score_opus":0.006246664915193381,"score_gpt":0.27100077517690413,"score_spread":0.26475411026171075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368940","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.039579045,0.053852763,0.89404607,0.010720217,0.0007097221,0.00018399894,1.8010736e-7,0.00008928538,0.00081873743],"genre_scores_gemma":[0.99642783,0.000404629,0.002575066,0.00034372738,0.000020301657,0.0000031156553,1.1185701e-7,0.000004710632,0.00022051818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864036,0.00014190744,0.00038577188,0.00011436099,0.00030699724,0.00041062952],"domain_scores_gemma":[0.9990646,0.00016428945,0.00025312742,0.00034026627,0.00015190747,0.000025767005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015440412,0.00010928551,0.00019969426,0.00025105666,0.00008964787,0.00007449844,0.0019772055,0.000041211268,0.0000019913125],"category_scores_gemma":[0.000084692925,0.00007395616,0.000063406165,0.0012189627,0.00003623531,0.00028295556,0.0002433107,0.00087322586,0.000001228349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013057766,0.000073375755,0.00022829512,0.000010017971,0.000015119033,0.000015502972,0.00019471151,0.000016532069,0.00037420425,0.99373466,0.0008178469,0.0045066746],"study_design_scores_gemma":[0.00042297243,0.00020334478,0.00024280314,0.000106361374,0.000007058852,0.000041623713,0.00003243695,0.00107575,0.004407001,0.9898326,0.0035480266,0.000080035854],"about_ca_topic_score_codex":0.000008138807,"about_ca_topic_score_gemma":0.0000077021705,"teacher_disagreement_score":0.9568488,"about_ca_system_score_codex":0.0005172963,"about_ca_system_score_gemma":0.00057672616,"threshold_uncertainty_score":0.37937805},"labels":[],"label_agreement":null},{"id":"W4415819102","doi":"10.37236/12450","title":"Sharp Szemerédi-Trotter Constructions from Arbitrary Number Fields","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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 British Columbia","funders":"Killam Trusts","keywords":"Extension (predicate logic); Field (mathematics); Cartesian product; Cartesian coordinate system; Algebra over a field; Argument (complex analysis)","score_opus":0.008494552878621706,"score_gpt":0.26751816836168935,"score_spread":0.2590236154830676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415819102","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.8479558,0.013592402,0.06491957,0.012429856,0.008979191,0.00060471724,0.000027816179,0.000057878224,0.051432766],"genre_scores_gemma":[0.9902208,0.0024084344,0.0001102697,0.001008897,0.00060637394,0.0000075900534,0.0000033857798,0.000051336483,0.0055829403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995145,0.0007703515,0.0017663258,0.00032815893,0.00077582453,0.0012142954],"domain_scores_gemma":[0.99402475,0.0028759197,0.0013442183,0.0009845734,0.0005923801,0.00017813146],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002345817,0.0005516671,0.0010467394,0.00026751202,0.0006397005,0.00016867505,0.0016357575,0.0005061404,0.003599687],"category_scores_gemma":[0.0006397541,0.00042705025,0.0007596282,0.0014061813,0.00044417844,0.0003908057,0.00027568187,0.0044227513,0.0001501729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029644213,0.00059850706,0.0010914532,0.00008642372,0.0021562688,0.000027918648,0.0008075026,0.0000057791685,0.000038816426,0.9826083,0.011211843,0.0010707249],"study_design_scores_gemma":[0.002241791,0.00028459047,0.00026757628,0.00030972864,0.0014912356,0.00039912024,0.0014214618,0.00006357175,0.0020864215,0.9744736,0.016597508,0.00036339046],"about_ca_topic_score_codex":0.000029344998,"about_ca_topic_score_gemma":0.0000068602976,"teacher_disagreement_score":0.14226496,"about_ca_system_score_codex":0.0005996497,"about_ca_system_score_gemma":0.0020058155,"threshold_uncertainty_score":0.99981815},"labels":[],"label_agreement":null},{"id":"W4416182696","doi":"10.37236/13576","title":"Primeness of Generalized Parking Functions","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Generalization; Affine transformation; Prime (order theory); Indecomposable module; Matrix (chemical analysis); Transformation (genetics); Algebra over a field","score_opus":0.013641803891663544,"score_gpt":0.3005598117414149,"score_spread":0.28691800784975136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416182696","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.35032514,0.033407014,0.59282434,0.0015040337,0.015474588,0.0012127697,0.0000073111128,0.000052634114,0.005192149],"genre_scores_gemma":[0.99287313,0.003038997,0.0002903578,0.00005066039,0.000329466,0.000012609578,8.1434257e-7,0.0000826675,0.0033212728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936979,0.0007584063,0.0030175063,0.0002813038,0.0010347804,0.0012101199],"domain_scores_gemma":[0.9897285,0.0028091625,0.0040941793,0.001278361,0.0019571348,0.00013267035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004239311,0.0005925502,0.0017049474,0.00052209717,0.00044849524,0.0000849661,0.0018997143,0.0003333813,0.000036452093],"category_scores_gemma":[0.0020684164,0.00045424135,0.0007566249,0.0022773643,0.00033256138,0.00024233444,0.00036831127,0.0021575636,0.0000065854415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034627123,0.0012998501,0.00007324957,0.00058381696,0.0014526732,0.0000064540504,0.0009182929,0.00029060268,0.0014432722,0.9911653,0.0007932255,0.0016269905],"study_design_scores_gemma":[0.00400433,0.0009174541,0.000018624205,0.00087063457,0.0018457532,0.00009776215,0.00085896545,0.00042564367,0.013073875,0.96894026,0.008617773,0.00032894267],"about_ca_topic_score_codex":0.000005391871,"about_ca_topic_score_gemma":0.000003907104,"teacher_disagreement_score":0.642548,"about_ca_system_score_codex":0.0014208461,"about_ca_system_score_gemma":0.003210557,"threshold_uncertainty_score":0.9997909},"labels":[],"label_agreement":null},{"id":"W4416182730","doi":"10.37236/13841","title":"Revisiting the Rédei-Berge Symmetric Functions via Matrix Algebra","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"York University; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Symmetric function; Symmetric matrix; Complete homogeneous symmetric polynomial; Centrosymmetric matrix; Matrix function; Matrix algebra; Ring of symmetric functions; Matrix (chemical analysis); Stanley symmetric function; Algebra over a field","score_opus":0.010180882220304102,"score_gpt":0.2911748858829632,"score_spread":0.2809940036626591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416182730","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.042736273,0.13447632,0.7585896,0.027491055,0.020749545,0.002724386,0.000011770077,0.00019247804,0.01302852],"genre_scores_gemma":[0.98367923,0.0059941052,0.00018554536,0.00017954884,0.0013933333,0.00002736355,0.0000013580499,0.0001556856,0.0083838105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99047023,0.0013949354,0.0035754743,0.00046681077,0.0019057315,0.0021867987],"domain_scores_gemma":[0.982174,0.008996331,0.0044542565,0.0021139993,0.00203478,0.00022667038],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007511278,0.000953395,0.0017221792,0.00086641393,0.0018626716,0.00040478614,0.0036017343,0.0004515672,0.00010802355],"category_scores_gemma":[0.0062424922,0.0006068968,0.0011695223,0.0069538606,0.0003990231,0.00054475275,0.00071599014,0.0056202784,0.00010364115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637725,0.00050374516,0.000043889537,0.00047246885,0.001393831,0.000022950744,0.00057532225,0.00014325112,0.00011515199,0.9893277,0.0027026362,0.004552672],"study_design_scores_gemma":[0.0023843988,0.00062308874,0.000024263414,0.00081934367,0.0028093692,0.00067287934,0.0013210195,0.0018841558,0.0005089915,0.9645046,0.023938809,0.0005090612],"about_ca_topic_score_codex":0.000007808342,"about_ca_topic_score_gemma":0.0000023882276,"teacher_disagreement_score":0.940943,"about_ca_system_score_codex":0.0027829998,"about_ca_system_score_gemma":0.0025852537,"threshold_uncertainty_score":0.99963826},"labels":[],"label_agreement":null},{"id":"W4416802214","doi":"10.37236/13609","title":"Word Length, Bias and Bijections in Penney's Ante","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection, injection and surjection; Conjecture; Word (group theory); Simple (philosophy); Alphabet; Binary number","score_opus":0.010032848477251673,"score_gpt":0.24379329358904528,"score_spread":0.2337604451117936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416802214","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.7772019,0.098596245,0.10286359,0.014374331,0.004727907,0.00036651146,0.0000014561972,0.000040802664,0.0018272438],"genre_scores_gemma":[0.9808206,0.017733704,0.00002708394,0.00031397896,0.00009249063,0.000002622755,1.5279669e-7,0.000015343625,0.0009940274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964638,0.0007410593,0.0010363937,0.00030355147,0.00044936084,0.0010058638],"domain_scores_gemma":[0.99713147,0.0011709317,0.00069362705,0.00061357685,0.00028016162,0.000110262925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00504787,0.00031353632,0.0006166857,0.000701329,0.00040546214,0.00035466993,0.0017490136,0.00014952432,0.00001379274],"category_scores_gemma":[0.00040405904,0.00023432857,0.00021597928,0.0027455245,0.00022354926,0.00061927206,0.00042406208,0.0020729771,0.0000054598004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006211026,0.00030549683,0.0007073272,0.000029936878,0.00015586891,0.000030062654,0.0009739746,0.00007403279,0.000103551734,0.9652417,0.0006328545,0.03168312],"study_design_scores_gemma":[0.0018143102,0.00069589855,0.0038018995,0.00039601533,0.00012704656,0.00050709955,0.00053786824,0.014077524,0.00046696875,0.9684791,0.008839063,0.00025723068],"about_ca_topic_score_codex":0.000039606104,"about_ca_topic_score_gemma":0.000046283072,"teacher_disagreement_score":0.20361868,"about_ca_system_score_codex":0.00059240503,"about_ca_system_score_gemma":0.0016833298,"threshold_uncertainty_score":0.9555642},"labels":[],"label_agreement":null},{"id":"W7114780409","doi":"10.37236/13517","title":"Extremal Number of Arborescences","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","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 Toronto","funders":"National Research, Development and Innovation Office; Innovációs és Technológiai Minisztérium; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia","keywords":"Eulerian path; Upper and lower bounds; Bipartite graph; Graph; Transitive relation; Orientation (vector space); Tournament; Minification","score_opus":0.008349927471902786,"score_gpt":0.2995931588540293,"score_spread":0.29124323138212654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114780409","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.9097702,0.04917593,0.010170994,0.0016196877,0.0058223833,0.0004219176,0.000005325629,0.000016009915,0.022997582],"genre_scores_gemma":[0.98992133,0.008172845,0.00005699359,0.00008097627,0.00014919284,0.0000013697711,1.7135196e-7,0.000028667995,0.0015884683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574524,0.00060902844,0.001701042,0.00018098207,0.00088255736,0.00088112196],"domain_scores_gemma":[0.99467105,0.0017004857,0.001967522,0.0007198522,0.0008546437,0.0000864468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003575477,0.00037655266,0.0009804724,0.00023978189,0.00041463156,0.00005216518,0.0018393685,0.00025599726,0.00017016985],"category_scores_gemma":[0.0008061537,0.00023754801,0.0006388273,0.0011087131,0.00059034204,0.00016571004,0.00028878928,0.0019625514,0.0000026465439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033590238,0.00039514832,0.0019166853,0.00025605617,0.0010074734,0.000008696137,0.0013160476,0.000010761768,0.00009739839,0.9920061,0.0013295017,0.0013201998],"study_design_scores_gemma":[0.0013454754,0.00045787083,0.00042075594,0.0004658164,0.00086757436,0.00018974429,0.00078823767,0.00008914374,0.0029886346,0.9885005,0.0036879978,0.00019828],"about_ca_topic_score_codex":0.000005852072,"about_ca_topic_score_gemma":0.0000025096465,"teacher_disagreement_score":0.08015114,"about_ca_system_score_codex":0.00031712916,"about_ca_system_score_gemma":0.0015412763,"threshold_uncertainty_score":0.9686927},"labels":[],"label_agreement":null},{"id":"W7114797723","doi":"10.37236/13739","title":"Brun's Inequality for a Geometric Lattice","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Queen's University","funders":"Queen's University","keywords":"Lattice (music); Inequality; Function (biology); Enumeration; Sieve (category theory); Geometric distribution","score_opus":0.024847237267037817,"score_gpt":0.3367952209050931,"score_spread":0.3119479836380553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114797723","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.07899561,0.02883886,0.87361395,0.004572878,0.0094527975,0.0023374443,0.000016118387,0.00006813127,0.0021041974],"genre_scores_gemma":[0.9917247,0.0029980033,0.0009826426,0.00023239433,0.0005035015,0.000040659714,0.0000012997243,0.00012092888,0.0033958333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99225193,0.00074128824,0.003258064,0.00041117883,0.0013564349,0.0019811026],"domain_scores_gemma":[0.9786789,0.012806143,0.0038373235,0.001482723,0.0029792981,0.00021562463],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.010250896,0.00076949154,0.0019221568,0.0009625268,0.0006767667,0.00022442164,0.002800655,0.00047628864,0.000028155355],"category_scores_gemma":[0.014781902,0.0005905823,0.0010269036,0.004613965,0.00026722983,0.00044531384,0.00041138276,0.002850693,0.000013101924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005115193,0.0016071196,0.000038335573,0.0012482379,0.0012749513,0.0000094718,0.000598427,0.00005698866,0.00005574243,0.9891485,0.0037118376,0.0017388661],"study_design_scores_gemma":[0.005674328,0.001981861,0.000020055613,0.0005654543,0.0021750582,0.000128461,0.00072134397,0.0006771644,0.0018849797,0.96262807,0.023060301,0.00048292463],"about_ca_topic_score_codex":0.000004815652,"about_ca_topic_score_gemma":0.0000036699237,"teacher_disagreement_score":0.91272914,"about_ca_system_score_codex":0.0026271252,"about_ca_system_score_gemma":0.0038895211,"threshold_uncertainty_score":0.99965453},"labels":[],"label_agreement":null},{"id":"W92501153","doi":"10.37236/12156","title":"Computation in Coxeter Groups—I. Multiplication","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"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":"Coxeter group; Mathematics; Coxeter element; Artin group; Coxeter complex; Multiplication (music); Computation; Mathematical proof; Reflection (computer programming); Combinatorics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Geometry; Programming language","score_opus":0.010280974980870687,"score_gpt":0.21943738770983814,"score_spread":0.20915641272896746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92501153","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.34628898,0.0027645768,0.64709145,0.0027177092,0.00042518115,0.00011612296,1.257696e-7,0.00003547013,0.00056037016],"genre_scores_gemma":[0.9992648,0.00029641765,0.00017177622,0.00016190771,0.00004419564,0.000001992203,2.1350718e-7,0.000006746329,0.00005195311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988133,0.00014524192,0.00034577824,0.00009987247,0.00028480502,0.0003110239],"domain_scores_gemma":[0.99912083,0.00021340737,0.00029555158,0.00023012649,0.00010367461,0.00003638172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009927595,0.00008961975,0.00014549238,0.00012736817,0.00006799239,0.00006506856,0.0008248604,0.00003885228,0.0000059162903],"category_scores_gemma":[0.000040964656,0.00006310579,0.000063885265,0.0005072108,0.000026323843,0.0003937869,0.00006002638,0.00040592262,0.000017130626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060581497,0.00016497134,0.00023514556,0.0000036819317,0.000014549193,0.000006848316,0.00093967543,0.00048159945,0.0002756271,0.98231137,0.00041738662,0.015143084],"study_design_scores_gemma":[0.0009887037,0.0002812904,0.0019735238,0.000019932299,0.000007687877,0.00019431245,0.00005333373,0.18819074,0.00046781334,0.80675125,0.0009577366,0.000113671515],"about_ca_topic_score_codex":0.0000027060362,"about_ca_topic_score_gemma":0.0000015763951,"teacher_disagreement_score":0.65297586,"about_ca_system_score_codex":0.00022572851,"about_ca_system_score_gemma":0.000043420197,"threshold_uncertainty_score":0.25733796},"labels":[],"label_agreement":null}]}