{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17216597,0.00226394,0.6080281,0.001432774,0.0006052677,0.00018969164,0.00040904715,0.0006777201,0.21422745],"genre_scores_gemma":[0.734413,0.0011492742,0.20498724,0.0008147313,0.0003684349,0.0003183719,0.00038131574,0.00046425418,0.057103414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830294,0.0005089856,0.00010288878,0.00028419207,0.00045175967,0.00034914608],"domain_scores_gemma":[0.99784994,0.0011553693,0.00014230631,0.0003335282,0.00033479417,0.00018410238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023167382,0.0007412798,0.0006837532,0.0015043361,0.0020798617,0.002603869,0.001609335,0.0011601892,0.0071085473],"category_scores_gemma":[0.007825153,0.00054275966,0.0015755135,0.0018234852,0.0038116663,0.0048068846,0.002238117,0.002829945,0.0015147728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016103313,0.000007519574,0.00016002342,0.000013771713,0.0000023838509,0.00007572666,0.00025358907,0.0010766234,0.00038896082,0.99315166,0.000383894,0.0044696187],"study_design_scores_gemma":[0.000016748476,0.00002326551,0.00016389083,0.000037991947,0.000009415036,0.00015833828,0.00011432098,0.014862553,0.0009186983,0.9705602,0.013113355,0.000021095428],"about_ca_topic_score_codex":0.0059662387,"about_ca_topic_score_gemma":0.0074742674,"teacher_disagreement_score":0.0071085473,"about_ca_system_score_codex":0.0029643758,"about_ca_system_score_gemma":0.00148025,"threshold_uncertainty_score":0.023780406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4236091,0.00054436794,0.48892123,0.0003687216,0.00041709453,0.00009590942,0.00015719373,0.0006535874,0.085232854],"genre_scores_gemma":[0.9302715,0.0003918505,0.053646635,0.00021395923,0.00015819348,0.000069466165,0.00019441548,0.00028448144,0.014769617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815315,0.00037936936,0.00015713366,0.00042503988,0.00046804198,0.00041729913],"domain_scores_gemma":[0.99805534,0.00064024766,0.00020003112,0.00023627601,0.00059060473,0.00027755232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016291265,0.00057813607,0.00058394735,0.0017205456,0.0016806673,0.0026918205,0.0008122389,0.00073000684,0.0071191033],"category_scores_gemma":[0.0037983546,0.000530482,0.000947337,0.0009136377,0.0032699753,0.0056745685,0.0024630257,0.0019423852,0.0012400439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006101403,0.000027079665,0.0006080477,0.000035486715,0.0000059599815,0.00021433683,0.00041388228,0.00071734644,0.0039614956,0.9793032,0.00037875495,0.014273385],"study_design_scores_gemma":[0.000024271125,0.000112912196,0.00080004794,0.000033662494,0.000030260657,0.0006320486,0.00050290726,0.008767292,0.026336312,0.9507182,0.01199497,0.000047115238],"about_ca_topic_score_codex":0.0007690705,"about_ca_topic_score_gemma":0.00090253004,"teacher_disagreement_score":0.0071191033,"about_ca_system_score_codex":0.0009353131,"about_ca_system_score_gemma":0.00066813314,"threshold_uncertainty_score":0.023815751},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14039041,0.063977234,0.20909138,0.14518642,0.03010673,0.00019759998,0.0015652247,0.0021290262,0.40735596],"genre_scores_gemma":[0.70233345,0.06651382,0.09691208,0.037420146,0.017084505,0.0002473266,0.0012442301,0.0016584418,0.07658604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908113,0.00024173068,0.000038337548,0.00024232989,0.00020979266,0.00018666002],"domain_scores_gemma":[0.9927729,0.0049099387,0.00025181822,0.0010275021,0.000571031,0.00046687116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008783771,0.0011774943,0.00089620333,0.00093643396,0.0022568924,0.0020348402,0.0017749987,0.0010286415,0.009056145],"category_scores_gemma":[0.0075011565,0.00054522697,0.00085391756,0.0016887867,0.0025269648,0.012763808,0.002653019,0.006497861,0.002891009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003754539,0.000118408156,0.0018725408,0.0008169229,0.000067179375,0.0008980823,0.00059389794,0.01082262,0.00943644,0.72039425,0.16136575,0.09323838],"study_design_scores_gemma":[0.000038852588,0.00011844913,0.0013430535,0.00020401829,0.00007398705,0.00062349206,0.00039523188,0.00880636,0.0042147394,0.76952434,0.21459801,0.00005943888],"about_ca_topic_score_codex":0.0045297043,"about_ca_topic_score_gemma":0.0055115526,"teacher_disagreement_score":0.009056145,"about_ca_system_score_codex":0.0016214973,"about_ca_system_score_gemma":0.00076446205,"threshold_uncertainty_score":0.030295849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6689615,0.00055887445,0.301236,0.0021997422,0.000069147725,0.00017041099,0.0009838222,0.001110697,0.024709808],"genre_scores_gemma":[0.96707237,0.00048679573,0.02333709,0.00024888598,0.00007901719,0.000292801,0.0008432066,0.00013998474,0.0074999714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891555,0.00039813746,0.000055217715,0.00028759614,0.00017570911,0.00016777158],"domain_scores_gemma":[0.9921268,0.0042744824,0.0013605655,0.0009857004,0.0005073107,0.00074509345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016793653,0.00041832347,0.0007025527,0.002697831,0.0012552686,0.0025863561,0.0015181394,0.0013002112,0.0066912826],"category_scores_gemma":[0.0124537395,0.000762715,0.0008900626,0.0012016384,0.0027099226,0.004739303,0.0018509675,0.0010904943,0.00066612725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027843623,0.0000655807,0.0051358305,0.00014429964,0.000064661326,0.00031616364,0.0003448732,0.08858976,0.00357716,0.8853646,0.004260991,0.011857682],"study_design_scores_gemma":[0.00010214696,0.000059531758,0.0024645736,0.000040580486,0.000049948183,0.0002867945,0.00014259043,0.37112343,0.0021033795,0.6195628,0.004023889,0.000040296567],"about_ca_topic_score_codex":0.0019987035,"about_ca_topic_score_gemma":0.0023443196,"teacher_disagreement_score":0.0066912826,"about_ca_system_score_codex":0.002007006,"about_ca_system_score_gemma":0.00047267144,"threshold_uncertainty_score":0.022384524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051755183,0.00025416614,0.98689705,0.00014403413,0.00012479733,0.00004197945,0.00003041299,0.00031022637,0.0070217787],"genre_scores_gemma":[0.13982993,0.0009103692,0.84194714,0.00028541457,0.00051670667,0.0003032329,0.00012930288,0.0006907373,0.015387252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989208,0.00049768016,0.00004319615,0.00011173828,0.0003601003,0.000066433524],"domain_scores_gemma":[0.9985833,0.0006795392,0.0000694583,0.0002922653,0.00025666886,0.00011890312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021959299,0.00093259744,0.0014999621,0.0057150857,0.00084757624,0.0019606068,0.001987426,0.001008763,0.0041450765],"category_scores_gemma":[0.004549551,0.0005217696,0.0015438198,0.0018021506,0.0022368631,0.0024660584,0.0025967627,0.0022073793,0.001976452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038660008,0.000060294606,0.00039855592,0.00016354736,0.000043181935,0.00016362194,0.00028919423,0.008310192,0.005809732,0.8672743,0.0025553522,0.11489341],"study_design_scores_gemma":[0.00004014981,0.000098803066,0.00045384656,0.00006121555,0.000027379901,0.00056026137,0.00008630677,0.32484302,0.0046488093,0.6461929,0.022889607,0.00009773676],"about_ca_topic_score_codex":0.0007218396,"about_ca_topic_score_gemma":0.0007247343,"teacher_disagreement_score":0.0057150857,"about_ca_system_score_codex":0.0007407816,"about_ca_system_score_gemma":0.0005995387,"threshold_uncertainty_score":0.013866723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78108627,0.00088925223,0.17903884,0.00049424334,0.0002744137,0.000058835838,0.00019718359,0.00020304379,0.037757903],"genre_scores_gemma":[0.9760637,0.00045634407,0.011237755,0.00009002575,0.00018778803,0.00004974853,0.00019346176,0.000057838344,0.011663311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924856,0.00014743434,0.000041405074,0.00014459221,0.00021342521,0.00020451454],"domain_scores_gemma":[0.9989736,0.000269119,0.00026858057,0.00009942392,0.00016994715,0.00021942702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011436527,0.00075231725,0.0005476557,0.0021465498,0.0015124967,0.0025813696,0.0011918651,0.0005448628,0.0071046147],"category_scores_gemma":[0.0012037595,0.0002691369,0.0010800024,0.0014941279,0.0040618,0.0034469177,0.0015260283,0.0014346575,0.00090677437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001752651,0.00002324132,0.00030651563,0.00002566637,0.0000071674203,0.00008319124,0.00030489554,0.00073732005,0.0011046476,0.99432063,0.00015211005,0.0029170837],"study_design_scores_gemma":[0.000013995962,0.000062461,0.0006041204,0.000013408653,0.000012694126,0.00015280697,0.00022794699,0.01082439,0.0027301335,0.9829457,0.0023883253,0.000024135577],"about_ca_topic_score_codex":0.0013659761,"about_ca_topic_score_gemma":0.0010176522,"teacher_disagreement_score":0.0071046147,"about_ca_system_score_codex":0.0012173012,"about_ca_system_score_gemma":0.00097571063,"threshold_uncertainty_score":0.023767292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77254915,0.0014301777,0.11574258,0.006141198,0.0009982223,0.00045023058,0.001222596,0.0015797324,0.09988611],"genre_scores_gemma":[0.9696182,0.00027547634,0.021057812,0.0007050856,0.00070614746,0.00013212899,0.0010013758,0.00012566352,0.0063780784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977489,0.00036913803,0.00022909221,0.00055865577,0.00042597108,0.00066831044],"domain_scores_gemma":[0.9917436,0.003752447,0.0010017992,0.0003765415,0.0010462793,0.0020792037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022368715,0.00082236447,0.0013530654,0.0028192194,0.003196926,0.0032428147,0.0012076487,0.0021175456,0.01198129],"category_scores_gemma":[0.009359431,0.00082237966,0.0009380271,0.0013037744,0.0047369828,0.0075985696,0.004090985,0.0034278804,0.002293193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066663075,0.00032715304,0.010912327,0.00054635777,0.00006642233,0.0051022186,0.0017049251,0.0035744586,0.02392767,0.931271,0.00861666,0.01328424],"study_design_scores_gemma":[0.00040227632,0.00084980694,0.0085028885,0.00019143763,0.00008011633,0.009039274,0.0027148162,0.01169285,0.02911346,0.9052514,0.03185985,0.00030183242],"about_ca_topic_score_codex":0.00035147395,"about_ca_topic_score_gemma":0.00039101945,"teacher_disagreement_score":0.01198129,"about_ca_system_score_codex":0.00064887304,"about_ca_system_score_gemma":0.000932964,"threshold_uncertainty_score":0.04008138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6207346,0.0016260917,0.12621532,0.0026459994,0.00020120046,0.000087612585,0.00065640983,0.00036159033,0.24747118],"genre_scores_gemma":[0.95485353,0.00067932415,0.019593393,0.0003746879,0.000106391024,0.000075903394,0.0003763212,0.00006579801,0.023874534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994925,0.00012486649,0.000028819162,0.000114652474,0.00012989473,0.00010924265],"domain_scores_gemma":[0.9988072,0.0004888072,0.00025029384,0.00017852861,0.00010904017,0.00016619285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005482976,0.0005061559,0.00046722294,0.0021492448,0.0019037394,0.0024165923,0.0006488879,0.0007355946,0.005748289],"category_scores_gemma":[0.0014807717,0.00043805852,0.00051626837,0.0015809257,0.0028818003,0.004379121,0.0026877425,0.0014902949,0.00072911655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017136395,0.000005720824,0.0001709708,0.000011493503,0.0000028335721,0.000054992,0.00014031776,0.0004734898,0.00042460702,0.9957568,0.00025911178,0.002682508],"study_design_scores_gemma":[0.000009328028,0.000008999554,0.000374766,0.000012983355,0.0000075824905,0.00013364709,0.00018991475,0.0018119123,0.0006797695,0.99159384,0.0051680217,0.000009225246],"about_ca_topic_score_codex":0.0011710452,"about_ca_topic_score_gemma":0.0018034753,"teacher_disagreement_score":0.005748289,"about_ca_system_score_codex":0.00091606315,"about_ca_system_score_gemma":0.00030187,"threshold_uncertainty_score":0.019230008},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27446294,0.0012996533,0.4526813,0.017051173,0.0011728905,0.00046896358,0.0012801546,0.0007762112,0.2508069],"genre_scores_gemma":[0.8814798,0.0016227007,0.07003188,0.005233723,0.0013077109,0.0008009825,0.0012250165,0.0004901195,0.03780801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962836,0.000934144,0.0001305938,0.001044113,0.0006604361,0.0009471162],"domain_scores_gemma":[0.98348975,0.010605781,0.00093292113,0.0025926935,0.0008968521,0.0014819329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042417664,0.0017744065,0.0031891675,0.0018547545,0.003828757,0.00445569,0.005468572,0.004541121,0.016667446],"category_scores_gemma":[0.02765026,0.0009728919,0.0024443227,0.0024516513,0.0073827435,0.019718949,0.0060075894,0.0068005454,0.0021938912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001855293,0.00007109125,0.00046539333,0.000102063066,0.000031992862,0.00014728511,0.00030661217,0.01868225,0.00069264986,0.95953673,0.012182159,0.0075961715],"study_design_scores_gemma":[0.000072202936,0.000039357303,0.00019909801,0.000028033908,0.000017635515,0.00007999709,0.00008187643,0.049066763,0.000282393,0.9451319,0.004971537,0.000029196082],"about_ca_topic_score_codex":0.006286356,"about_ca_topic_score_gemma":0.004048081,"teacher_disagreement_score":0.016667446,"about_ca_system_score_codex":0.0031920583,"about_ca_system_score_gemma":0.0020999738,"threshold_uncertainty_score":0.05575818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8635864,0.0013878605,0.07372621,0.0006033629,0.0000658609,0.00007937496,0.0006998649,0.00014333334,0.059707783],"genre_scores_gemma":[0.9743936,0.0008320202,0.020971028,0.00010601217,0.000089494104,0.000052078878,0.0005738057,0.000034986588,0.0029469726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962986,0.00007210274,0.00002530829,0.00008635552,0.00011308269,0.00007331673],"domain_scores_gemma":[0.9980451,0.00069610303,0.00050177553,0.00019883542,0.0002726218,0.0002856281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461129,0.00035106373,0.00024308657,0.0025172015,0.0008626201,0.0013047309,0.00032118414,0.00029831348,0.0024272418],"category_scores_gemma":[0.002323147,0.0002631199,0.00023012681,0.0019491637,0.0019777243,0.0018858353,0.00081925653,0.00061997457,0.00017536894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010765453,0.000035770943,0.0047765463,0.000121837875,0.000013006727,0.00024261804,0.00095902634,0.0091753,0.007666235,0.9404207,0.0023999426,0.034081373],"study_design_scores_gemma":[0.000028677521,0.00006602939,0.0070936945,0.000063971514,0.000026477892,0.0006308568,0.0007966096,0.025783487,0.004449872,0.94637966,0.014626882,0.000053791435],"about_ca_topic_score_codex":0.0021728748,"about_ca_topic_score_gemma":0.0037155414,"teacher_disagreement_score":0.0025172015,"about_ca_system_score_codex":0.0006296944,"about_ca_system_score_gemma":0.00045984826,"threshold_uncertainty_score":0.008119941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46781135,0.0004508103,0.3591132,0.00047520245,0.00049868325,0.00011990653,0.00035004696,0.000383952,0.17079686],"genre_scores_gemma":[0.8931227,0.00030784853,0.07011356,0.00025166644,0.0002031934,0.00010641085,0.0003196801,0.00022229382,0.03535268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956113,0.00007643528,0.000023113978,0.000074644224,0.00015909922,0.000105572755],"domain_scores_gemma":[0.99975723,0.00002336737,0.000028108208,0.000043109998,0.00008875257,0.0000593914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041881125,0.00033729238,0.0004923494,0.00085803354,0.0009972402,0.0011765189,0.000603848,0.00026713876,0.004686411],"category_scores_gemma":[0.0005048215,0.00019796588,0.00048167887,0.00048388963,0.0017357087,0.0014336681,0.0010161012,0.00096505956,0.0012001232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022023234,0.000012921235,0.000102346916,0.000015939322,0.0000029387622,0.00009497552,0.00010477371,0.00053752365,0.004832249,0.9886052,0.00056333985,0.005105781],"study_design_scores_gemma":[0.000014593384,0.000043113472,0.0003862417,0.000011207056,0.000005379748,0.00022632084,0.00012891673,0.008707906,0.009444617,0.9701255,0.010881958,0.000024272776],"about_ca_topic_score_codex":0.00084746804,"about_ca_topic_score_gemma":0.0009868334,"teacher_disagreement_score":0.004686411,"about_ca_system_score_codex":0.00058721914,"about_ca_system_score_gemma":0.0006319013,"threshold_uncertainty_score":0.01567763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8309754,0.0010496821,0.10919986,0.00068141817,0.00007929463,0.000071934526,0.00044551175,0.0005355776,0.056961395],"genre_scores_gemma":[0.9672769,0.00048987655,0.024775464,0.00016803226,0.000038436036,0.000083060404,0.00074113725,0.000091776805,0.006335418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975127,0.000041077936,0.000010510221,0.00007067748,0.00007734316,0.00004908477],"domain_scores_gemma":[0.9988772,0.00041862065,0.00018717302,0.00012039223,0.00014390619,0.00025263432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024885047,0.00046211967,0.00025157363,0.0015392482,0.0009850187,0.0011298372,0.00100506,0.00054970366,0.0038447056],"category_scores_gemma":[0.0019692145,0.00042637816,0.0003211774,0.0007682029,0.0012317266,0.0014294521,0.0012545437,0.0009988396,0.00028930508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021010252,0.00008573916,0.004500921,0.00031230995,0.000052394502,0.002237321,0.0013975499,0.016038025,0.027956083,0.9168238,0.00427741,0.026108276],"study_design_scores_gemma":[0.00012315344,0.00019832418,0.0049894634,0.00014484282,0.0001225107,0.0059869196,0.0011094916,0.06907043,0.019156158,0.8579569,0.041029852,0.000111950096],"about_ca_topic_score_codex":0.0003696941,"about_ca_topic_score_gemma":0.00069758354,"teacher_disagreement_score":0.0038447056,"about_ca_system_score_codex":0.0007198186,"about_ca_system_score_gemma":0.00026990418,"threshold_uncertainty_score":0.012861848},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77821106,0.000562011,0.19469807,0.0011339934,0.00007200665,0.00007018759,0.00028073203,0.00023830656,0.02473366],"genre_scores_gemma":[0.982226,0.00019084393,0.012174141,0.00018805404,0.000038418504,0.00005213051,0.00020212846,0.00005607752,0.0048721996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974245,0.00009917579,0.0000054238817,0.000053581694,0.000043350996,0.00005588814],"domain_scores_gemma":[0.9991947,0.00034840012,0.00014515598,0.000104818784,0.000062193765,0.00014471367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031990427,0.0003451291,0.00039094753,0.00074571907,0.0005513132,0.00057888596,0.00075384654,0.0005645945,0.0028502797],"category_scores_gemma":[0.0021777642,0.00019601232,0.0003535326,0.0004134296,0.0010911225,0.0011771101,0.0007157752,0.00055133685,0.00019150854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058495338,0.000025605412,0.0014524673,0.000056716606,0.00002452411,0.00034446636,0.00013384175,0.039370313,0.003696471,0.94842345,0.001409653,0.005004077],"study_design_scores_gemma":[0.00003600246,0.00004077085,0.0015148361,0.000017105318,0.000018294399,0.00030329736,0.00014323009,0.27037898,0.0017125512,0.72197366,0.0038363459,0.000024855122],"about_ca_topic_score_codex":0.0016431552,"about_ca_topic_score_gemma":0.0019189753,"teacher_disagreement_score":0.0028502797,"about_ca_system_score_codex":0.0006502461,"about_ca_system_score_gemma":0.0003227108,"threshold_uncertainty_score":0.009535193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16936277,0.0009025381,0.73296213,0.0012279165,0.00016626634,0.0001356056,0.0003582582,0.0006060307,0.09427845],"genre_scores_gemma":[0.68956524,0.0010215892,0.2718348,0.00048797287,0.0002861985,0.00037881237,0.00091157336,0.00032043512,0.035193354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991379,0.00021424067,0.000072263385,0.00019749599,0.0002214195,0.00015666173],"domain_scores_gemma":[0.99924123,0.00034704027,0.00007576045,0.00015419416,0.00013276139,0.000048941503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005018646,0.0005527125,0.00073419954,0.001291353,0.0010802468,0.0024501092,0.0010424188,0.00075912965,0.006062689],"category_scores_gemma":[0.0021182015,0.00041454763,0.0011580708,0.0012209163,0.0024835228,0.0044486797,0.0016248333,0.0014690554,0.0014144832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029655597,0.000021892123,0.0002125883,0.0000520007,0.0000033566446,0.0000902219,0.00035496708,0.0033129829,0.0020983622,0.9736485,0.0010151897,0.01916024],"study_design_scores_gemma":[0.000020026655,0.000038379796,0.00013789114,0.00002832165,0.000009713903,0.00024371834,0.00027693287,0.03456717,0.0025158648,0.9487069,0.013431677,0.000023526743],"about_ca_topic_score_codex":0.0010970922,"about_ca_topic_score_gemma":0.0010703497,"teacher_disagreement_score":0.006062689,"about_ca_system_score_codex":0.001005928,"about_ca_system_score_gemma":0.0005425383,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54192466,0.0011745922,0.32164252,0.0051169316,0.00026290907,0.00045628575,0.0016813419,0.00036283213,0.12737788],"genre_scores_gemma":[0.78290594,0.0022842076,0.17044476,0.0009623263,0.00037162888,0.00049618917,0.0030166844,0.00021011234,0.039308194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993305,0.00019257398,0.000028053131,0.00014243336,0.000099217395,0.00020725631],"domain_scores_gemma":[0.9971348,0.0021747085,0.00019696607,0.0001620381,0.0001399461,0.00019151621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008554217,0.000944131,0.0008093243,0.0010761741,0.0014072298,0.0017144865,0.001230131,0.0016727534,0.01420418],"category_scores_gemma":[0.004544347,0.00054440805,0.00066797907,0.0012673343,0.0014737969,0.0033758038,0.0020173513,0.0018932563,0.0012104823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034232743,0.00025748595,0.0011500927,0.0004860934,0.000060162693,0.00058520376,0.00054260565,0.07694316,0.0044393484,0.83539915,0.0149320895,0.06486225],"study_design_scores_gemma":[0.00013711351,0.00008752573,0.0004906685,0.00008774512,0.0000356382,0.0002882407,0.00054977695,0.08397939,0.0028185013,0.9028853,0.008595402,0.000044718992],"about_ca_topic_score_codex":0.0025851203,"about_ca_topic_score_gemma":0.004111923,"teacher_disagreement_score":0.01420418,"about_ca_system_score_codex":0.0012079661,"about_ca_system_score_gemma":0.0011179236,"threshold_uncertainty_score":0.047517717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5860133,0.0007474608,0.32256168,0.0012205185,0.00016111498,0.000053830852,0.0003268407,0.0010112508,0.08790408],"genre_scores_gemma":[0.9653059,0.00029194637,0.026209205,0.00026152094,0.00013512751,0.00008651938,0.00033916262,0.00019386382,0.0071767904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993512,0.00010878912,0.000030706397,0.00021042611,0.00021197581,0.00008691989],"domain_scores_gemma":[0.99637574,0.0019567984,0.0004356354,0.0004992584,0.00034157038,0.00039086616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011460677,0.00032760116,0.0004695976,0.0012260006,0.00067214685,0.0020456684,0.0010270213,0.0007076167,0.0038948671],"category_scores_gemma":[0.010715927,0.00019469205,0.00040928312,0.00086077355,0.0021131218,0.002647223,0.0010183351,0.0011186481,0.00049142033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003978637,0.00001590891,0.002124876,0.000042715412,0.000007035274,0.00007037116,0.00015819956,0.0016865595,0.0030499017,0.9746525,0.0016618186,0.016490174],"study_design_scores_gemma":[0.000028281054,0.000045978202,0.0034590305,0.00006923294,0.00003295558,0.0009220528,0.00012496837,0.08295933,0.008310953,0.89538586,0.008622234,0.000039087565],"about_ca_topic_score_codex":0.0009513167,"about_ca_topic_score_gemma":0.001260882,"teacher_disagreement_score":0.0038948671,"about_ca_system_score_codex":0.0012503826,"about_ca_system_score_gemma":0.00050538214,"threshold_uncertainty_score":0.013029635},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35474315,0.0035509067,0.15229763,0.04011942,0.0020201858,0.00011550042,0.0011543166,0.0019568792,0.44404206],"genre_scores_gemma":[0.9192653,0.0023726153,0.028816262,0.007362517,0.0017015645,0.00019541594,0.0010962818,0.00043107735,0.038759068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736315,0.00068081444,0.00009374989,0.00078477256,0.00052752945,0.00054989784],"domain_scores_gemma":[0.9910653,0.0059017395,0.00040107165,0.0014010816,0.00062634377,0.00060427986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028789297,0.0008880296,0.0017642245,0.0014693191,0.002583171,0.0028706521,0.0018578724,0.002489924,0.019304773],"category_scores_gemma":[0.015593736,0.0007531899,0.0015635772,0.0016057113,0.005857356,0.010794237,0.0051407525,0.0056355563,0.0038271535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017471547,0.000041717874,0.0006480636,0.00010442015,0.00002360995,0.00014037699,0.0003902311,0.0033533298,0.00072222366,0.9675309,0.018265465,0.0086048925],"study_design_scores_gemma":[0.000055732224,0.000041974352,0.00033038223,0.000037593214,0.00002467072,0.00019436139,0.00019184912,0.009955247,0.0007441544,0.97631854,0.012086313,0.000019134033],"about_ca_topic_score_codex":0.0013984079,"about_ca_topic_score_gemma":0.00097292714,"teacher_disagreement_score":0.019304773,"about_ca_system_score_codex":0.0014243793,"about_ca_system_score_gemma":0.0010097255,"threshold_uncertainty_score":0.06458092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83364934,0.00061526353,0.12916014,0.0002555756,0.00006972604,0.00009517168,0.0004156193,0.00042498772,0.03531413],"genre_scores_gemma":[0.98052007,0.00023331706,0.014666584,0.00009736338,0.00006231731,0.00006578982,0.0003632047,0.00007618249,0.0039150934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993825,0.00012898946,0.00003870315,0.00015147637,0.00016030463,0.00013788568],"domain_scores_gemma":[0.9973786,0.0010741932,0.0004303531,0.00044881535,0.000280295,0.0003877282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047652153,0.00031545677,0.0004148279,0.0013435718,0.0007425061,0.001632883,0.0005816862,0.00037717397,0.0029084561],"category_scores_gemma":[0.003324952,0.00035891315,0.00044205916,0.00065550796,0.0016728386,0.0025553666,0.0015106811,0.0006780654,0.00032571083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017963944,0.000049626415,0.002462915,0.000120196135,0.000022931172,0.0003942457,0.0008153671,0.0049404497,0.010226449,0.95853406,0.0017105314,0.02054365],"study_design_scores_gemma":[0.000030556108,0.000073840405,0.0012993811,0.000027317383,0.00002541728,0.00047890013,0.00035074344,0.021958562,0.005209603,0.963963,0.006569626,0.000013107048],"about_ca_topic_score_codex":0.0008713349,"about_ca_topic_score_gemma":0.0008130605,"teacher_disagreement_score":0.0029084561,"about_ca_system_score_codex":0.000725521,"about_ca_system_score_gemma":0.0003019365,"threshold_uncertainty_score":0.009729803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040456638,0.00031416278,0.9498425,0.00031872964,0.00013663922,0.00013378839,0.0004518082,0.0046858843,0.0036598109],"genre_scores_gemma":[0.21700162,0.0002454856,0.7749134,0.00018354783,0.00009747827,0.00030280947,0.0013738442,0.00083965715,0.005042132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925023,0.00012865127,0.00009177043,0.00012066896,0.0002924488,0.0001162641],"domain_scores_gemma":[0.99652123,0.0011996718,0.00018204862,0.0015098588,0.00047014156,0.00011710307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010168323,0.0005101711,0.0006613166,0.000998654,0.00075108156,0.0012955009,0.0015696156,0.001097169,0.006258572],"category_scores_gemma":[0.006970681,0.00046590515,0.00085506187,0.0018929293,0.0009035798,0.003237074,0.0020305058,0.0013090022,0.002141008],"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.00073095184,0.00019006671,0.0019241337,0.00028055525,0.000037870665,0.00021788865,0.00035588566,0.070695356,0.017102974,0.17147385,0.028692696,0.7082977],"study_design_scores_gemma":[0.00020759838,0.00031581146,0.0005203567,0.00006498726,0.000048634418,0.0005109712,0.00011236119,0.5164809,0.038337555,0.42226318,0.021060562,0.00007700019],"about_ca_topic_score_codex":0.0005418797,"about_ca_topic_score_gemma":0.0011402256,"teacher_disagreement_score":0.006258572,"about_ca_system_score_codex":0.00065199856,"about_ca_system_score_gemma":0.001058085,"threshold_uncertainty_score":0.020937026},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22483474,0.0020867954,0.4963862,0.0061394284,0.0011574787,0.00018595663,0.0011772126,0.0008185026,0.26721373],"genre_scores_gemma":[0.8935375,0.0011363862,0.07580783,0.0009151797,0.00059344334,0.00014021661,0.00046929272,0.00026193014,0.027138185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985642,0.00045065954,0.00007445124,0.00015543765,0.0005433234,0.00021200694],"domain_scores_gemma":[0.9932934,0.0038748158,0.00036483706,0.0007889971,0.0013117099,0.000366206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019168411,0.00042912358,0.00054561166,0.0011520293,0.001760024,0.0025276358,0.0013377647,0.00079525384,0.013508286],"category_scores_gemma":[0.009122327,0.00035330452,0.0007057811,0.0013777615,0.0026773964,0.0065194382,0.003114727,0.00241937,0.0013571506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025720847,0.00001972492,0.00012168528,0.000047849917,0.0000050947265,0.00012369812,0.0001859493,0.0004096464,0.0004841763,0.9921669,0.002088114,0.0043214825],"study_design_scores_gemma":[0.000027749884,0.000011979184,0.0001420376,0.000016824639,0.0000088056295,0.00018460982,0.00006720319,0.0024133015,0.0011923496,0.9877016,0.008219707,0.000013765016],"about_ca_topic_score_codex":0.0006891208,"about_ca_topic_score_gemma":0.00091436226,"teacher_disagreement_score":0.013508286,"about_ca_system_score_codex":0.0015869016,"about_ca_system_score_gemma":0.0012765487,"threshold_uncertainty_score":0.04518974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68667924,0.00060509134,0.22437912,0.0005317762,0.00011791947,0.00009368781,0.00071345846,0.0007020926,0.08617761],"genre_scores_gemma":[0.9393578,0.00030798736,0.040174354,0.00009659253,0.00009280818,0.00007076551,0.00077890826,0.00013451545,0.018986208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994636,0.00009690162,0.00002775759,0.00011454043,0.00017120187,0.00012601152],"domain_scores_gemma":[0.9991491,0.00043060735,0.0000866471,0.00008104668,0.00013133489,0.00012125278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007563611,0.0006820016,0.0004893505,0.0017093779,0.0015077392,0.002165014,0.00047122155,0.00057314226,0.011855065],"category_scores_gemma":[0.0015320815,0.00034697083,0.0008241679,0.0015520717,0.0018526705,0.0041673956,0.0014244607,0.0008972308,0.00076204987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071570525,0.00003824046,0.0015472708,0.00005218803,0.000012505206,0.00019189925,0.0004235285,0.0050179767,0.0015433817,0.9758419,0.001301988,0.013957441],"study_design_scores_gemma":[0.00002729511,0.00004509435,0.0008664633,0.0000174996,0.00001852996,0.0002666423,0.00024799388,0.016219506,0.0030242815,0.96832824,0.010915524,0.000022846996],"about_ca_topic_score_codex":0.0020248285,"about_ca_topic_score_gemma":0.0022576968,"teacher_disagreement_score":0.011855065,"about_ca_system_score_codex":0.0010046096,"about_ca_system_score_gemma":0.0007404061,"threshold_uncertainty_score":0.039659142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.917812,0.00036631545,0.061189555,0.00077175844,0.00006610851,0.00011561008,0.0013389119,0.00040269614,0.017937103],"genre_scores_gemma":[0.9738981,0.0002660206,0.018080086,0.00017333003,0.000054581145,0.0001410154,0.0013157167,0.000099263096,0.005971896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953556,0.000057626985,0.000031204632,0.00015078175,0.00010726323,0.000117617805],"domain_scores_gemma":[0.99669015,0.0011527076,0.00068675843,0.00031956096,0.00028828875,0.0008625752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038092438,0.00073739974,0.0005466476,0.0014818917,0.0013599473,0.0014320633,0.0012873417,0.00061268045,0.006666566],"category_scores_gemma":[0.002837277,0.0005378718,0.00092691806,0.0008771327,0.0014108858,0.001956826,0.0017794203,0.0011462125,0.0006924889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022928892,0.0004582893,0.020477975,0.0011980836,0.00039442384,0.0028071639,0.00303691,0.1266422,0.12388816,0.63236904,0.018598955,0.067836046],"study_design_scores_gemma":[0.00015882743,0.00042772677,0.02048513,0.00013961559,0.0001996035,0.002653936,0.0011345278,0.19845062,0.023775961,0.73387825,0.01853398,0.00016180887],"about_ca_topic_score_codex":0.0023050022,"about_ca_topic_score_gemma":0.002324102,"teacher_disagreement_score":0.006666566,"about_ca_system_score_codex":0.0007977848,"about_ca_system_score_gemma":0.00044246097,"threshold_uncertainty_score":0.022301912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.327509,0.00044116512,0.5187047,0.0003360547,0.0004079387,0.000105176565,0.00018870152,0.0006510914,0.1516562],"genre_scores_gemma":[0.8732938,0.00038003526,0.09904386,0.00016822791,0.00009317606,0.00009514545,0.0002673252,0.00025281834,0.02640563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994118,0.00015532099,0.000033303506,0.00011614138,0.00017776758,0.00010563333],"domain_scores_gemma":[0.9995529,0.00011816107,0.000056531735,0.00007726346,0.00008508219,0.000110116605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041014882,0.00029811304,0.0003105948,0.00079162203,0.0008705362,0.0013000706,0.00051857677,0.0004330422,0.005283955],"category_scores_gemma":[0.0010609778,0.00022625762,0.00039011674,0.00046494554,0.0011908085,0.0019402584,0.0013261024,0.00091159996,0.0011791436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020957596,0.000010027009,0.0001434669,0.000019579913,0.0000017548936,0.00007188743,0.00017403488,0.000733421,0.0035324807,0.98668367,0.00031449756,0.008294244],"study_design_scores_gemma":[0.000027082307,0.00004800186,0.0003004007,0.000030292877,0.000011484246,0.0003423722,0.0003156616,0.011672348,0.012302618,0.9338877,0.041033156,0.000028842554],"about_ca_topic_score_codex":0.0009400988,"about_ca_topic_score_gemma":0.0016248797,"teacher_disagreement_score":0.005283955,"about_ca_system_score_codex":0.000630302,"about_ca_system_score_gemma":0.0004840013,"threshold_uncertainty_score":0.017676592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4151162,0.0028106852,0.29710132,0.0026043348,0.0011895278,0.00036094678,0.0008775024,0.0007587851,0.27918068],"genre_scores_gemma":[0.7399365,0.0014000173,0.20690186,0.0017879335,0.0003905761,0.00028614234,0.0010482696,0.00017014486,0.04807858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951684,0.00014165154,0.00003490784,0.000099687495,0.000121914956,0.00008504659],"domain_scores_gemma":[0.99924445,0.00029403894,0.00010570673,0.00018195914,0.00010484671,0.00006907003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507221,0.0003916938,0.00038038625,0.0005998317,0.0009828204,0.00078302674,0.0005342008,0.0010512964,0.015631758],"category_scores_gemma":[0.0016287108,0.00030356698,0.00050813425,0.00067671714,0.0007713373,0.0011403869,0.000993185,0.0011353738,0.0017748821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024384327,0.00011297655,0.0011568744,0.000408368,0.000038573915,0.000524553,0.00044864867,0.008100356,0.015163983,0.8730337,0.007360589,0.0934076],"study_design_scores_gemma":[0.00021422356,0.00075193774,0.0011088359,0.00021527048,0.00006170297,0.0016765356,0.000263996,0.028023265,0.018523581,0.79180616,0.15724018,0.000114301925],"about_ca_topic_score_codex":0.0002909104,"about_ca_topic_score_gemma":0.00069606747,"teacher_disagreement_score":0.015631758,"about_ca_system_score_codex":0.0006121221,"about_ca_system_score_gemma":0.0005089132,"threshold_uncertainty_score":0.05229348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.666375,0.00075798,0.28400248,0.00032906176,0.00039031517,0.000094970725,0.00015194264,0.00027293994,0.047625367],"genre_scores_gemma":[0.95170414,0.0002644593,0.03973914,0.000088151624,0.00012430186,0.00008302921,0.00015442524,0.00005146087,0.007790862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00007213016,0.000043319495,0.00015144984,0.0001303253,0.00012556136],"domain_scores_gemma":[0.9991117,0.00030227494,0.00018967384,0.00018662728,0.00009267708,0.00011694775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002993842,0.00041096212,0.00041440775,0.00097411114,0.00096447504,0.0011113706,0.00047513432,0.0005842324,0.0059756464],"category_scores_gemma":[0.0016290606,0.00027651517,0.00059928704,0.0006137693,0.0017980848,0.001890394,0.0017632759,0.00085041823,0.0007433713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008810301,0.000039559865,0.0012214179,0.000089288566,0.000018890989,0.00036315247,0.00051825086,0.0057757855,0.018185746,0.94966924,0.00050568173,0.023524847],"study_design_scores_gemma":[0.00004431244,0.00025302352,0.00094050815,0.00003852385,0.000029435409,0.00090914953,0.0005882654,0.03320645,0.026549688,0.9217751,0.015626628,0.000038833623],"about_ca_topic_score_codex":0.00025687146,"about_ca_topic_score_gemma":0.00021581337,"teacher_disagreement_score":0.0059756464,"about_ca_system_score_codex":0.0004939455,"about_ca_system_score_gemma":0.00022177283,"threshold_uncertainty_score":0.019990504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8962412,0.0001597483,0.0734245,0.00090421713,0.00006574685,0.000058117694,0.0005138589,0.00024947088,0.028383171],"genre_scores_gemma":[0.9799146,0.00012777142,0.012395333,0.000102380734,0.00007222783,0.000034871715,0.00035593956,0.00010459135,0.0068922616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999663,0.00007335455,0.000015571326,0.000096233125,0.0000906239,0.00006121584],"domain_scores_gemma":[0.99727815,0.0012830332,0.0005258946,0.00026781423,0.00027394653,0.00037119616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294487,0.00030479833,0.00039370958,0.0013236394,0.0010661138,0.0015117956,0.0009336735,0.00055099564,0.0061996263],"category_scores_gemma":[0.0029844558,0.0002491964,0.00061325735,0.0008755152,0.0015316015,0.0023376325,0.0007192718,0.0014362248,0.000744191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015096935,0.00006142877,0.0021545955,0.000087302564,0.00001629914,0.00052146387,0.0005600827,0.0058564264,0.010518917,0.96905184,0.0018438065,0.009176813],"study_design_scores_gemma":[0.000042276093,0.000090168265,0.0033097963,0.000018555387,0.000032561995,0.0010166958,0.00035454656,0.059237037,0.005252534,0.9234531,0.0071429727,0.000049741826],"about_ca_topic_score_codex":0.0011469891,"about_ca_topic_score_gemma":0.0010988248,"teacher_disagreement_score":0.0061996263,"about_ca_system_score_codex":0.000732974,"about_ca_system_score_gemma":0.00038339337,"threshold_uncertainty_score":0.020739794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.327614,0.0006300593,0.5812109,0.0012675038,0.00033987805,0.00009854253,0.00034647214,0.00031167362,0.088180915],"genre_scores_gemma":[0.9309288,0.0004372512,0.049967322,0.00023102004,0.00027586476,0.000083885796,0.0002251783,0.000095962976,0.017754674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995746,0.0000864864,0.000022337195,0.000106259635,0.00012619968,0.00008419949],"domain_scores_gemma":[0.99943954,0.00022456804,0.00007989736,0.00005595002,0.000120120676,0.0000798864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445004,0.00038745452,0.00025095697,0.0008138333,0.00092982914,0.0014773273,0.00035360391,0.00057992776,0.0076097865],"category_scores_gemma":[0.0018094867,0.00015571843,0.00040574392,0.0006161727,0.0014393554,0.0028915573,0.00096043845,0.0010469501,0.0012206074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009214725,0.000007224234,0.00005923242,0.0000135510745,9.049834e-7,0.00005338608,0.00016631387,0.00041885476,0.0016066867,0.9936173,0.00024789677,0.0037994385],"study_design_scores_gemma":[0.000007682913,0.00004130969,0.00014263611,0.000013518233,0.0000031889235,0.00019359645,0.00012534669,0.010191187,0.0019704537,0.9817722,0.005524332,0.000014523652],"about_ca_topic_score_codex":0.00047988535,"about_ca_topic_score_gemma":0.00045392828,"teacher_disagreement_score":0.0076097865,"about_ca_system_score_codex":0.00064627716,"about_ca_system_score_gemma":0.00037410934,"threshold_uncertainty_score":0.025457263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59394807,0.0052457834,0.19711727,0.009261689,0.00051759405,0.00012045003,0.001931017,0.0019458364,0.18991242],"genre_scores_gemma":[0.96374565,0.0017331899,0.020775892,0.00091369846,0.0005422239,0.00034132312,0.0010949095,0.00044017404,0.010412885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982919,0.0005298316,0.00004675732,0.00027204116,0.0004676528,0.00039170077],"domain_scores_gemma":[0.9866045,0.009121466,0.00092842354,0.0011466864,0.0008761832,0.0013226218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018904004,0.0015786047,0.0013910386,0.0037950105,0.0028175132,0.0030496249,0.002526221,0.0014358001,0.014923135],"category_scores_gemma":[0.014189471,0.00082144263,0.0011112229,0.0018354197,0.0034012904,0.0051722485,0.0038323198,0.003997492,0.002599967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030932188,0.00014126355,0.006016218,0.00032555978,0.00007928467,0.0002602837,0.0009446159,0.020060996,0.0038344632,0.9168531,0.025073051,0.026102027],"study_design_scores_gemma":[0.00003933156,0.00009293622,0.006946431,0.00012268903,0.000092338734,0.0008337438,0.0002085795,0.10869593,0.0039630085,0.86390233,0.014999732,0.00010303292],"about_ca_topic_score_codex":0.0018146893,"about_ca_topic_score_gemma":0.0018153266,"teacher_disagreement_score":0.014923135,"about_ca_system_score_codex":0.0019665856,"about_ca_system_score_gemma":0.000633682,"threshold_uncertainty_score":0.049922824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15755557,0.014360938,0.62367666,0.010373619,0.003901547,0.00016291179,0.0017147155,0.0014233744,0.18683067],"genre_scores_gemma":[0.84457636,0.008605287,0.10546378,0.0016637276,0.006017539,0.00020455779,0.0008691422,0.00071372424,0.031885855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843794,0.00031921046,0.00013873493,0.0003378243,0.000515754,0.00025053511],"domain_scores_gemma":[0.9901579,0.00614695,0.001116099,0.0009347276,0.0009956602,0.0006486251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018557963,0.001261103,0.0010865575,0.0034808728,0.0021347732,0.0047512115,0.0016258268,0.0011167864,0.01060963],"category_scores_gemma":[0.013112543,0.00059919484,0.0009325542,0.0038459639,0.003718584,0.01022517,0.0037116478,0.005596338,0.002908535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058835012,0.000035957095,0.0006872061,0.0001591035,0.000011399902,0.00024353502,0.00063684466,0.0018658594,0.0023510428,0.9656413,0.00650375,0.0218051],"study_design_scores_gemma":[0.000008691885,0.00006291111,0.00047180994,0.000041675517,0.000018296256,0.00039716912,0.00014438243,0.0040682238,0.0018249989,0.98000324,0.012910935,0.000047545574],"about_ca_topic_score_codex":0.00093375717,"about_ca_topic_score_gemma":0.0014535472,"teacher_disagreement_score":0.01060963,"about_ca_system_score_codex":0.0009603351,"about_ca_system_score_gemma":0.0006867658,"threshold_uncertainty_score":0.03549272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07386525,0.006965376,0.805877,0.0039131623,0.00064762513,0.00012750634,0.0006101795,0.00044297447,0.10755093],"genre_scores_gemma":[0.7965623,0.0041400604,0.14975323,0.0009958153,0.0011874232,0.0003845839,0.00072100887,0.00018379932,0.04607175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909985,0.00024142304,0.000062242085,0.00022060213,0.00025983964,0.00011601569],"domain_scores_gemma":[0.9987367,0.0006019402,0.0001300267,0.00022424686,0.000172042,0.0001351128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096536585,0.0005112345,0.00059665,0.0017917465,0.00195015,0.0040675523,0.0010862558,0.0011504539,0.0077038077],"category_scores_gemma":[0.0018331846,0.00038750548,0.0011273791,0.0018514011,0.004928835,0.0071643894,0.00218922,0.0021263256,0.001142102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029106704,0.0000039781717,0.00004831196,0.000017032582,0.0000018034369,0.00002225524,0.000091322036,0.00028798348,0.00017983258,0.99672335,0.0002610828,0.0023602291],"study_design_scores_gemma":[0.000004775791,0.0000107518135,0.00007111013,0.000014857525,0.0000038762755,0.00010147438,0.0000487067,0.0024091778,0.00025985617,0.9849908,0.012079193,0.0000053530052],"about_ca_topic_score_codex":0.00092538487,"about_ca_topic_score_gemma":0.0006000332,"teacher_disagreement_score":0.0077038077,"about_ca_system_score_codex":0.0018246606,"about_ca_system_score_gemma":0.0009854988,"threshold_uncertainty_score":0.025771797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.770946,0.0015848583,0.19673403,0.0050371015,0.00020553752,0.000106145366,0.00057783845,0.0006378183,0.024170721],"genre_scores_gemma":[0.98525435,0.001107591,0.008406527,0.00016490935,0.00038567124,0.00009787641,0.00023274783,0.00009288624,0.0042574997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875784,0.00038300976,0.00003904386,0.0002539563,0.0003144198,0.00025166132],"domain_scores_gemma":[0.9798585,0.012944737,0.002035822,0.0018159746,0.0013077105,0.0020372581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032276195,0.0005762818,0.0009195099,0.0025696943,0.0011307045,0.002220952,0.0014947378,0.0011088368,0.004024989],"category_scores_gemma":[0.028050208,0.0005960171,0.0007167175,0.0011163646,0.0054655904,0.0061374814,0.0022412094,0.0023586124,0.00079097843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029812774,0.000077011,0.008367481,0.00017276044,0.000037051446,0.00030073288,0.0004522654,0.037199564,0.00721889,0.932412,0.0022731035,0.011190949],"study_design_scores_gemma":[0.000073328105,0.00015856992,0.0064176987,0.000108793785,0.000034495468,0.00074778695,0.00018176732,0.26111895,0.0045538465,0.72362906,0.0028771977,0.00009854867],"about_ca_topic_score_codex":0.001507066,"about_ca_topic_score_gemma":0.00088225567,"teacher_disagreement_score":0.004024989,"about_ca_system_score_codex":0.0022907231,"about_ca_system_score_gemma":0.0012403451,"threshold_uncertainty_score":0.017069519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60075027,0.0008903521,0.3590428,0.001472811,0.0001963203,0.000080618265,0.0006284269,0.00062327663,0.03631521],"genre_scores_gemma":[0.9726512,0.00075699046,0.019880215,0.00035385857,0.00035730886,0.00018619957,0.00039588843,0.00015052219,0.0052677207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746895,0.00041384285,0.00015013159,0.00084714283,0.0008425567,0.00027729248],"domain_scores_gemma":[0.99101955,0.004675014,0.0015525852,0.0014319655,0.00087774,0.0004430995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015813863,0.0004007547,0.00084846956,0.0018390644,0.001255692,0.0030372965,0.0012619484,0.00072994176,0.0031095834],"category_scores_gemma":[0.012218366,0.00054151716,0.0005634868,0.001905351,0.0035810375,0.0054359846,0.0016444479,0.0014792201,0.0005055939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010607127,0.000026511723,0.0035453169,0.00009130304,0.000040728275,0.0001791581,0.0004183941,0.006424125,0.0043915603,0.96455485,0.0020176105,0.018204419],"study_design_scores_gemma":[0.00001446892,0.00002857629,0.001382252,0.00002234801,0.000019212495,0.00047074028,0.00013809348,0.022839611,0.0029487323,0.96670336,0.005402,0.00003054535],"about_ca_topic_score_codex":0.0004120044,"about_ca_topic_score_gemma":0.000346132,"teacher_disagreement_score":0.0031095834,"about_ca_system_score_codex":0.001261208,"about_ca_system_score_gemma":0.0006244206,"threshold_uncertainty_score":0.01040256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6981134,0.00015797022,0.27428275,0.0010881168,0.000080681144,0.00015336808,0.000615438,0.000701205,0.024807109],"genre_scores_gemma":[0.9326602,0.00011843885,0.057780445,0.00016915919,0.00008220341,0.00022793507,0.0009213966,0.00015774289,0.007882427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840575,0.0003613481,0.00012416663,0.00039877725,0.0003821599,0.00032780223],"domain_scores_gemma":[0.9936579,0.0033861161,0.000856061,0.0011925655,0.00037281803,0.00053463207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076891476,0.00057702657,0.0006499791,0.00077242707,0.0015822516,0.0026225396,0.0009830086,0.0010638883,0.009876777],"category_scores_gemma":[0.0073931813,0.0004961643,0.0010571661,0.0010260943,0.002504753,0.0040793815,0.0024307983,0.0018261411,0.0009923758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028165293,0.00017463395,0.0020090847,0.00014819903,0.00003051815,0.00044468485,0.00075121416,0.020372666,0.008651974,0.9463913,0.0031693964,0.017574554],"study_design_scores_gemma":[0.00006323415,0.000080324186,0.00077288284,0.000021511893,0.00002355775,0.00047310864,0.000312492,0.07277243,0.0065141567,0.91416276,0.004759786,0.000043822616],"about_ca_topic_score_codex":0.00085424265,"about_ca_topic_score_gemma":0.0012649803,"teacher_disagreement_score":0.009876777,"about_ca_system_score_codex":0.0010077754,"about_ca_system_score_gemma":0.00072332635,"threshold_uncertainty_score":0.03304112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58673704,0.00050497206,0.38402423,0.0004668923,0.000031497366,0.00013265427,0.001503796,0.0008309296,0.025767945],"genre_scores_gemma":[0.93233025,0.00032725555,0.05832979,0.00020907763,0.000024851219,0.00021230735,0.0016057774,0.00019466129,0.0067659807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839336,0.00026760998,0.00009667221,0.00045480335,0.00042641576,0.000361088],"domain_scores_gemma":[0.9962084,0.0014691747,0.00070811005,0.00065222464,0.00055095204,0.0004110976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008297434,0.00063535105,0.00071963033,0.0007726604,0.0010779718,0.001806026,0.0016061838,0.00066286983,0.0049253237],"category_scores_gemma":[0.0043333983,0.0007158656,0.0006583632,0.00095889915,0.0017806946,0.0043999525,0.0026220034,0.0016514906,0.0006144482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009811146,0.00016071278,0.007518569,0.00043869205,0.000113351954,0.0005220026,0.0014735047,0.063726015,0.034323815,0.83130574,0.003408788,0.05602779],"study_design_scores_gemma":[0.00013197404,0.0002699791,0.0033065837,0.00011339428,0.00013376563,0.00093364366,0.0008971273,0.19385745,0.031655993,0.7422402,0.026377233,0.00008274704],"about_ca_topic_score_codex":0.0015447624,"about_ca_topic_score_gemma":0.0015776625,"teacher_disagreement_score":0.0049253237,"about_ca_system_score_codex":0.0013917006,"about_ca_system_score_gemma":0.0007541106,"threshold_uncertainty_score":0.01647681},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17298795,0.005714586,0.35872933,0.03861597,0.0019203476,0.00031263247,0.0021395145,0.0012697577,0.41830987],"genre_scores_gemma":[0.8415774,0.0025654654,0.084556915,0.003502269,0.0022855008,0.0005044465,0.0032900802,0.00050372945,0.06121418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963362,0.0008839309,0.00022859054,0.0010079398,0.0008401244,0.0007031542],"domain_scores_gemma":[0.9831418,0.010910089,0.0007561736,0.0026583471,0.0012653107,0.0012682802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035840624,0.0007428277,0.001608445,0.002268127,0.0040083663,0.0052058157,0.0034606103,0.0035633433,0.019877035],"category_scores_gemma":[0.022212494,0.0005930773,0.0017283191,0.0025165635,0.0061330213,0.014801045,0.0060699456,0.008543079,0.0019608785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003463168,0.000012527212,0.00033781983,0.00008242107,0.000007350307,0.0000696064,0.00027853105,0.0010042636,0.00016927275,0.9857647,0.004285205,0.007953693],"study_design_scores_gemma":[0.000019716166,0.000011609997,0.00016708346,0.000039929142,0.000011024889,0.00012053821,0.0003452356,0.005468864,0.0004168131,0.9765562,0.016824286,0.000018665576],"about_ca_topic_score_codex":0.0040664324,"about_ca_topic_score_gemma":0.0018763855,"teacher_disagreement_score":0.019877035,"about_ca_system_score_codex":0.0045243646,"about_ca_system_score_gemma":0.0023231967,"threshold_uncertainty_score":0.06649536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9320081,0.00018854495,0.03472598,0.0002852752,0.00006431605,0.000020079724,0.00011010712,0.00013571049,0.032461807],"genre_scores_gemma":[0.98522353,0.0001076882,0.007504955,0.000045259,0.000028947396,0.000025018197,0.00010114615,0.000051292114,0.0069121905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996954,0.000044647866,0.0000147227265,0.00006395682,0.000080624704,0.000100572826],"domain_scores_gemma":[0.99952817,0.00015670725,0.00008956532,0.000056412344,0.000043833912,0.00012527566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021558549,0.0002888575,0.0003299938,0.0008798435,0.0014502634,0.0017170202,0.0004785775,0.00050036254,0.0053145387],"category_scores_gemma":[0.0012141863,0.00035954616,0.0004794364,0.00049810763,0.0022090173,0.0019344783,0.0018305454,0.00086005125,0.00044745769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058938436,0.00001783988,0.0011234554,0.000041585434,0.000005449872,0.00029152902,0.0006987352,0.0026844419,0.0039695636,0.98293394,0.000729165,0.007445364],"study_design_scores_gemma":[0.000024506204,0.000073076735,0.0024314977,0.000041076783,0.000016316853,0.0009069451,0.001152351,0.017399386,0.0066503696,0.9585113,0.012735593,0.000057584948],"about_ca_topic_score_codex":0.0012298368,"about_ca_topic_score_gemma":0.0020446312,"teacher_disagreement_score":0.0053145387,"about_ca_system_score_codex":0.00074156135,"about_ca_system_score_gemma":0.00025846116,"threshold_uncertainty_score":0.017778873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34595016,0.0027924082,0.54364955,0.0005287088,0.00071513763,0.000103649065,0.00021315552,0.0010213838,0.1050258],"genre_scores_gemma":[0.8112829,0.0011468082,0.14378688,0.00034152888,0.00017515637,0.000124143,0.00041270847,0.0002467301,0.042483192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996567,0.000043102827,0.000036955524,0.00011648423,0.000094180876,0.00005271056],"domain_scores_gemma":[0.9995203,0.00016855879,0.00006496587,0.00012605175,0.00007248656,0.000047700512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016364295,0.00026269676,0.0003516868,0.0002872983,0.00071421685,0.00066312985,0.00046388793,0.00049610424,0.006062701],"category_scores_gemma":[0.0011224407,0.00024676093,0.0005091813,0.0002735307,0.0010944371,0.0010504979,0.0011658459,0.00064665487,0.0018658274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001378668,0.000058766862,0.001068225,0.00040208607,0.000024225546,0.000791728,0.0009510024,0.011486412,0.09293843,0.7878492,0.0026125545,0.10167947],"study_design_scores_gemma":[0.00006995909,0.00052175164,0.0014887395,0.00013513741,0.00004836146,0.0023581479,0.00050374534,0.043533422,0.113826334,0.71873623,0.11869802,0.00007997293],"about_ca_topic_score_codex":0.00019098316,"about_ca_topic_score_gemma":0.00037095093,"teacher_disagreement_score":0.006062701,"about_ca_system_score_codex":0.00029122178,"about_ca_system_score_gemma":0.00019666736,"threshold_uncertainty_score":0.020281732},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14919117,0.0013147136,0.67348146,0.0013652754,0.000722324,0.0002073349,0.0009611709,0.0014724116,0.17128412],"genre_scores_gemma":[0.8543721,0.00080027437,0.10537494,0.00074416,0.00064174214,0.0003211166,0.0013348397,0.0010835149,0.035327364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701357,0.0005537379,0.00021374522,0.0009425406,0.00072906475,0.00054743467],"domain_scores_gemma":[0.9968947,0.00145423,0.00026121736,0.00069174444,0.00042353352,0.00027459147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014582069,0.0006786809,0.0008791056,0.0019030417,0.0034915826,0.0041919043,0.001398655,0.0011368688,0.012135605],"category_scores_gemma":[0.005637483,0.0006142799,0.0014691359,0.0022491426,0.0058758156,0.010916204,0.00463307,0.003094916,0.0016421878],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021966862,0.000010185189,0.0003497805,0.00003164731,0.0000048027305,0.000094939525,0.00028958995,0.00038601423,0.0005190168,0.9869741,0.0008756075,0.010442293],"study_design_scores_gemma":[0.000008392527,0.000026871558,0.00024952026,0.000027581986,0.0000145856175,0.0003578848,0.0002611117,0.0028727415,0.0026994555,0.97206825,0.021385819,0.000027865544],"about_ca_topic_score_codex":0.0012565965,"about_ca_topic_score_gemma":0.0014059673,"teacher_disagreement_score":0.012135605,"about_ca_system_score_codex":0.0017411985,"about_ca_system_score_gemma":0.0010277687,"threshold_uncertainty_score":0.040597618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07087099,0.0010536778,0.72692543,0.0022612344,0.00088809704,0.00017215767,0.0010016718,0.0006423459,0.19618446],"genre_scores_gemma":[0.760847,0.0017340136,0.16320169,0.0017633464,0.0009917746,0.00047319365,0.0011735838,0.00050837966,0.06930701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.00024064948,0.000050217615,0.00025859833,0.0003578312,0.0001920723],"domain_scores_gemma":[0.99845874,0.0005835313,0.00020503633,0.00030145084,0.0002543679,0.0001968529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825253,0.0007847138,0.000833237,0.0015881616,0.0023666,0.002644417,0.0014629059,0.0013176932,0.011202069],"category_scores_gemma":[0.004034725,0.00041431357,0.0010495075,0.0013824438,0.0031089254,0.007405495,0.0051902346,0.0027488086,0.0025635506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028031067,0.0000096990825,0.00017691075,0.00003245186,0.0000063752977,0.00007492679,0.00013472015,0.0009401418,0.00044317218,0.9888614,0.0021342959,0.0071579227],"study_design_scores_gemma":[0.0000132026025,0.000039332706,0.00020704267,0.000015137884,0.000009810181,0.0002088017,0.0001156455,0.003842402,0.00083581044,0.96175796,0.0329399,0.0000150553005],"about_ca_topic_score_codex":0.0003990021,"about_ca_topic_score_gemma":0.0003534531,"teacher_disagreement_score":0.011202069,"about_ca_system_score_codex":0.00055653456,"about_ca_system_score_gemma":0.00047786982,"threshold_uncertainty_score":0.037474632},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25457817,0.00635562,0.30292645,0.03368637,0.0027869665,0.00024628785,0.0018370129,0.00078952336,0.39679372],"genre_scores_gemma":[0.8456137,0.0031134696,0.08670691,0.0047401837,0.0028849847,0.00050184317,0.0015778348,0.000503378,0.05435776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969668,0.0010717117,0.00009751358,0.00056318677,0.000815728,0.00048506857],"domain_scores_gemma":[0.98755217,0.009278599,0.0006657561,0.00093367754,0.00063668576,0.0009331359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004065256,0.0017412449,0.0019666306,0.00366573,0.0034221576,0.0038867174,0.003650901,0.0038555523,0.017040605],"category_scores_gemma":[0.020384373,0.00095586164,0.0015590303,0.00289695,0.0058101323,0.010497924,0.0058150394,0.009803047,0.0024711313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014613886,0.00005677347,0.00080129964,0.00015772245,0.000021363821,0.00012313202,0.0002083565,0.0052847182,0.0006324741,0.97366285,0.008702868,0.010202287],"study_design_scores_gemma":[0.000028172626,0.000033467724,0.00029915862,0.000048679925,0.000018185765,0.00013030507,0.00007823789,0.012598521,0.0007562913,0.97911525,0.0068626795,0.00003107136],"about_ca_topic_score_codex":0.002774218,"about_ca_topic_score_gemma":0.002695561,"teacher_disagreement_score":0.017040605,"about_ca_system_score_codex":0.0027969133,"about_ca_system_score_gemma":0.0015136761,"threshold_uncertainty_score":0.057006538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5998344,0.0008437391,0.09939053,0.0019695447,0.0011393123,0.00016556254,0.0004892519,0.00043687486,0.2957309],"genre_scores_gemma":[0.95519835,0.0003404495,0.024630979,0.00027351087,0.00026429133,0.0001371689,0.00024042917,0.0001187073,0.01879612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921024,0.000118236094,0.000039599825,0.00017009038,0.00024113238,0.0002207431],"domain_scores_gemma":[0.9994622,0.000076138385,0.00008713995,0.00012691782,0.00012860986,0.00011909496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054349116,0.00045707342,0.0005992662,0.0014258355,0.0027744146,0.004129881,0.0006375357,0.001569031,0.006353035],"category_scores_gemma":[0.0012043908,0.0002775082,0.00086776883,0.00072291144,0.0046975785,0.003006392,0.0020870594,0.0021495752,0.0010041633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001772694,0.000008226044,0.00011386078,0.0000111099835,0.0000030360175,0.00004660678,0.00017472333,0.00008696014,0.0010239434,0.99609274,0.00038308525,0.0020381357],"study_design_scores_gemma":[0.00004785252,0.00006658412,0.0010557608,0.000020829417,0.000020597134,0.00041574615,0.00065367203,0.0017720604,0.004753688,0.9679244,0.023213075,0.00005566246],"about_ca_topic_score_codex":0.0010889071,"about_ca_topic_score_gemma":0.0011602499,"teacher_disagreement_score":0.006353035,"about_ca_system_score_codex":0.0011743478,"about_ca_system_score_gemma":0.0007991502,"threshold_uncertainty_score":0.02125299},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19676222,0.01100217,0.5098548,0.007752286,0.0013281001,0.000335653,0.004003457,0.0014273704,0.26753393],"genre_scores_gemma":[0.7445356,0.0112922555,0.17427568,0.003448084,0.0027466572,0.0011701414,0.0027885248,0.00065904687,0.05908399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976278,0.00037644402,0.00018804643,0.0006352117,0.00080402766,0.00036846157],"domain_scores_gemma":[0.9932678,0.0038516545,0.0006579323,0.0010719915,0.000648765,0.0005018534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030246498,0.0010852308,0.0018748973,0.004525602,0.003722699,0.0052442444,0.0019575646,0.0014660527,0.00918173],"category_scores_gemma":[0.009451956,0.001069355,0.0021982694,0.0042515555,0.0035833318,0.01125311,0.0062565883,0.0036314446,0.0030051658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000687872,0.000020604719,0.0005256574,0.00014435842,0.000022751685,0.00010281678,0.00021942657,0.0017429655,0.0009389422,0.9794572,0.0045815734,0.01217493],"study_design_scores_gemma":[0.000028232445,0.00003073184,0.00053777813,0.00005552508,0.000031846837,0.00027721666,0.00009098598,0.00662954,0.0007352838,0.96941245,0.02214309,0.000027254722],"about_ca_topic_score_codex":0.0008320585,"about_ca_topic_score_gemma":0.00073592586,"teacher_disagreement_score":0.00918173,"about_ca_system_score_codex":0.0023189567,"about_ca_system_score_gemma":0.0012313718,"threshold_uncertainty_score":0.030716002},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8248146,0.0012976233,0.12925537,0.002034949,0.0005746996,0.000059934693,0.00041982875,0.00056935806,0.040973675],"genre_scores_gemma":[0.95455146,0.000465234,0.026353575,0.0005626283,0.00028144312,0.00007876727,0.00037625994,0.00010511726,0.017225517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.00013954623,0.000068700254,0.0001836902,0.00013902671,0.00014138478],"domain_scores_gemma":[0.9967514,0.0019667668,0.00037640397,0.00032560978,0.00029443446,0.0002852935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059101597,0.00047068865,0.00048007912,0.00052552024,0.0013958706,0.0018776004,0.0006124752,0.0011315293,0.007375105],"category_scores_gemma":[0.003581349,0.00053421094,0.0006316289,0.0007352252,0.0018809385,0.0051385043,0.002159324,0.001060501,0.0018279761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005017762,0.000104465944,0.0017562122,0.0003945362,0.00003067485,0.0008562263,0.0014280376,0.0037301523,0.014517459,0.95050794,0.004130444,0.022042084],"study_design_scores_gemma":[0.00006342409,0.000103569124,0.0005430854,0.000030538926,0.0000294017,0.0005275126,0.000422818,0.0076171723,0.009913092,0.9699599,0.0107502,0.00003920124],"about_ca_topic_score_codex":0.0003234001,"about_ca_topic_score_gemma":0.00040202602,"teacher_disagreement_score":0.007375105,"about_ca_system_score_codex":0.00041942517,"about_ca_system_score_gemma":0.00045560635,"threshold_uncertainty_score":0.02467215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3459682,0.008286931,0.5362077,0.00972329,0.0004954713,0.0001906293,0.0028782217,0.001046624,0.095202856],"genre_scores_gemma":[0.8428467,0.0036541035,0.1343653,0.0014493702,0.0013170463,0.00045490038,0.0029656813,0.00066753,0.012279295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937674,0.0013686491,0.00034072396,0.0012529414,0.002156683,0.0011136822],"domain_scores_gemma":[0.9744056,0.018402293,0.0011600077,0.0029170369,0.0014734601,0.001641662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00367081,0.0021110766,0.002944625,0.0034909737,0.003314933,0.006100308,0.0045593632,0.0019602347,0.0074830316],"category_scores_gemma":[0.024966316,0.0017776873,0.002287222,0.004205144,0.004244742,0.017361268,0.005445335,0.008016706,0.0019970424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010197476,0.00019877164,0.0066820993,0.0006769527,0.00024685566,0.00052985246,0.0009628372,0.026983436,0.015687285,0.89143497,0.012095761,0.043481577],"study_design_scores_gemma":[0.00005363851,0.00009714643,0.0032219177,0.00013649675,0.00017049274,0.001027452,0.00033532083,0.11284488,0.014764737,0.8496877,0.01754238,0.00011790017],"about_ca_topic_score_codex":0.00146452,"about_ca_topic_score_gemma":0.001561579,"teacher_disagreement_score":0.0074830316,"about_ca_system_score_codex":0.0028418503,"about_ca_system_score_gemma":0.0011498136,"threshold_uncertainty_score":0.025033236},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12879662,0.0070945844,0.08340526,0.4462107,0.013176308,0.00014104623,0.0015079989,0.002182681,0.31748468],"genre_scores_gemma":[0.8428461,0.0039589987,0.028677551,0.07264256,0.0111811645,0.00027616305,0.0014008342,0.0006060446,0.03841056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961862,0.0009648959,0.00014629906,0.0010444914,0.0010642738,0.00059387943],"domain_scores_gemma":[0.9788374,0.013526601,0.0008552185,0.002441048,0.0028304595,0.0015093035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046695396,0.00089632586,0.0013841664,0.0014453076,0.006096805,0.0028794939,0.0022502816,0.004058636,0.022459738],"category_scores_gemma":[0.02236292,0.0005908971,0.0014009245,0.0020822226,0.011093069,0.012341359,0.0059983223,0.00750626,0.0033538963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002809926,0.000112352296,0.0019238561,0.0001550824,0.000025494877,0.0003046567,0.001285902,0.0015493863,0.0007482824,0.87723243,0.1070739,0.009307736],"study_design_scores_gemma":[0.00013786244,0.000056455574,0.0016269577,0.00011542832,0.000027870272,0.00030282236,0.0006303053,0.004118321,0.0008319098,0.92120844,0.0708873,0.000056236127],"about_ca_topic_score_codex":0.005628891,"about_ca_topic_score_gemma":0.002699725,"teacher_disagreement_score":0.022459738,"about_ca_system_score_codex":0.002078532,"about_ca_system_score_gemma":0.0011295333,"threshold_uncertainty_score":0.07513535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73968095,0.00033706063,0.14375141,0.0005707958,0.00008504593,0.00013482869,0.0014953788,0.0003711612,0.11357333],"genre_scores_gemma":[0.95031184,0.00027604753,0.03296431,0.00024601392,0.00007057497,0.00011946299,0.001384861,0.00006987686,0.014556958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999485,0.00010012946,0.000027507362,0.0001775053,0.000108611275,0.000101153746],"domain_scores_gemma":[0.9988224,0.0004646946,0.00017338803,0.00015449685,0.00019091136,0.00019419205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028317136,0.00031171585,0.00029809284,0.0006848899,0.0011242058,0.0012358138,0.0005042441,0.0004063166,0.0057147956],"category_scores_gemma":[0.0015730275,0.00039268026,0.0003842765,0.00074492214,0.00090801634,0.0016790128,0.0010736985,0.00069777406,0.0006424093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014540686,0.000066611676,0.0024822128,0.00015306163,0.000036945377,0.0005723192,0.0005413596,0.0032933862,0.017100452,0.94985044,0.003798988,0.02195884],"study_design_scores_gemma":[0.00009531235,0.00010066366,0.003971252,0.000054685854,0.00009732569,0.0018818855,0.000578871,0.03901678,0.019594438,0.9013458,0.03321361,0.000049302835],"about_ca_topic_score_codex":0.0014676404,"about_ca_topic_score_gemma":0.0022206435,"teacher_disagreement_score":0.0057147956,"about_ca_system_score_codex":0.00092219684,"about_ca_system_score_gemma":0.0005937531,"threshold_uncertainty_score":0.019117951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92727846,0.00020668496,0.061389636,0.00013918463,0.000046790094,0.000016280705,0.00016025492,0.0001288242,0.010633884],"genre_scores_gemma":[0.9910816,0.000120695775,0.0064753806,0.000047854362,0.00004368065,0.000042419186,0.00019680141,0.000042588497,0.0019488991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985384,0.0002681777,0.000074188785,0.0003618158,0.00043543705,0.00032207608],"domain_scores_gemma":[0.99397284,0.0027103745,0.001233616,0.00055614143,0.0005235775,0.0010034178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010540211,0.00044354517,0.0010519635,0.0021655716,0.0012763038,0.001812293,0.0009980196,0.0005493538,0.0024274648],"category_scores_gemma":[0.005880444,0.0003839248,0.00054531876,0.0011128183,0.003365157,0.0030142514,0.0029753197,0.0017409822,0.00027303514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023180907,0.000064832566,0.009635899,0.00005684991,0.00002153577,0.00022414843,0.0005430386,0.0054675834,0.0075939517,0.96460885,0.0006193655,0.010932132],"study_design_scores_gemma":[0.000063061125,0.00025190337,0.014680993,0.000039852795,0.000047624006,0.0009944062,0.00070113933,0.06967858,0.013722224,0.8946893,0.0050081136,0.00012273512],"about_ca_topic_score_codex":0.000605209,"about_ca_topic_score_gemma":0.0005231485,"teacher_disagreement_score":0.0024274648,"about_ca_system_score_codex":0.0010174386,"about_ca_system_score_gemma":0.000504757,"threshold_uncertainty_score":0.008120656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6195039,0.0012147104,0.2588397,0.0010561662,0.00029206034,0.00005599142,0.00029383047,0.00032278473,0.11842078],"genre_scores_gemma":[0.94063,0.0006361158,0.029740345,0.00027819248,0.0001982351,0.000069686816,0.00016354716,0.00009654741,0.028187413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969566,0.000057657267,0.000010762723,0.000054962726,0.000098345445,0.00008274049],"domain_scores_gemma":[0.9995123,0.0001593008,0.0000913175,0.00005222961,0.000079766214,0.00010519535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035844606,0.00037708282,0.0002759184,0.001136602,0.00081726984,0.0009532102,0.00062547426,0.0004994846,0.006480166],"category_scores_gemma":[0.0014291758,0.00015807316,0.00030079842,0.0009226469,0.0013397175,0.001973051,0.000985766,0.0013593555,0.0011494987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024766154,0.000011190086,0.00012075373,0.000015490017,0.0000015730087,0.00007021397,0.00011288563,0.0010389134,0.0025070282,0.98971623,0.0004339033,0.005947112],"study_design_scores_gemma":[0.000015714193,0.000045031647,0.00048996083,0.000024597819,0.0000051188745,0.00031674068,0.00015568452,0.022229502,0.003896973,0.96451527,0.008279338,0.000026023969],"about_ca_topic_score_codex":0.00055617926,"about_ca_topic_score_gemma":0.0006132793,"teacher_disagreement_score":0.006480166,"about_ca_system_score_codex":0.0007279727,"about_ca_system_score_gemma":0.00041524274,"threshold_uncertainty_score":0.021678269},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07243975,0.0034975884,0.74748623,0.007787502,0.001044562,0.00032204777,0.0013514715,0.0018861444,0.16418478],"genre_scores_gemma":[0.53132075,0.0045442404,0.38924468,0.00449132,0.0022927565,0.0011951756,0.003487671,0.002629656,0.06079366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963259,0.0011606528,0.00015536326,0.0006796166,0.0010857359,0.00059271866],"domain_scores_gemma":[0.98855853,0.0071404544,0.0006329088,0.0020499607,0.00071056426,0.000907561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031359207,0.0024360882,0.0019059469,0.0032861081,0.0031854422,0.006041955,0.004928835,0.003352773,0.026609035],"category_scores_gemma":[0.018940458,0.0015173308,0.0027217476,0.0041848207,0.004158388,0.014004259,0.007839316,0.01120152,0.005155723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013713112,0.00020241614,0.00054396887,0.0002604136,0.000042829328,0.00019243473,0.00035243804,0.012990956,0.002135926,0.9311512,0.020860963,0.031129168],"study_design_scores_gemma":[0.00003486042,0.000057422243,0.00016822813,0.00009541399,0.000030008117,0.00020468197,0.000095962154,0.055942494,0.0011853249,0.93136305,0.010775433,0.000047165515],"about_ca_topic_score_codex":0.0016494186,"about_ca_topic_score_gemma":0.0020350486,"teacher_disagreement_score":0.026609035,"about_ca_system_score_codex":0.0027745466,"about_ca_system_score_gemma":0.0016376674,"threshold_uncertainty_score":0.08901608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6397496,0.0019271314,0.09770816,0.0032206797,0.0003497722,0.000112439084,0.0015238315,0.0007309489,0.25467736],"genre_scores_gemma":[0.9495108,0.0007629049,0.03417841,0.00042437032,0.000092112256,0.00012928993,0.0005587214,0.00017159099,0.014171832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994221,0.00012954515,0.000017552824,0.00014735086,0.00011136626,0.00017211327],"domain_scores_gemma":[0.99852896,0.00080184435,0.00019932682,0.00018588357,0.00011555994,0.00016832449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630412,0.00041857857,0.00038523602,0.0005795485,0.0012762498,0.0013193815,0.0011818988,0.0008311935,0.02493325],"category_scores_gemma":[0.0025233822,0.0002151635,0.00042147262,0.0005772427,0.0010141395,0.0025918693,0.0011098138,0.0012281261,0.0028699231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003980871,0.00024791213,0.00480584,0.00041933433,0.000059916227,0.00043989613,0.00034129,0.01893687,0.016396463,0.87287927,0.01878351,0.0662915],"study_design_scores_gemma":[0.000050245966,0.0001632095,0.0033591727,0.000087097455,0.00005446403,0.0012961484,0.00046405592,0.057838406,0.0200818,0.8560523,0.06048546,0.000067717745],"about_ca_topic_score_codex":0.0009450444,"about_ca_topic_score_gemma":0.0020290483,"teacher_disagreement_score":0.02493325,"about_ca_system_score_codex":0.00079940795,"about_ca_system_score_gemma":0.0006178819,"threshold_uncertainty_score":0.083410025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5752449,0.0006742842,0.2693418,0.00030106184,0.00019830714,0.0001557605,0.00044824448,0.00064210565,0.15299347],"genre_scores_gemma":[0.92764074,0.00032626273,0.0545011,0.0001354599,0.000044742836,0.000058595564,0.00040904348,0.00011067708,0.016773237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994741,0.00013508742,0.00003238751,0.00010953147,0.00016288996,0.00008596322],"domain_scores_gemma":[0.99910045,0.00019809445,0.00012164622,0.00016433904,0.00022904424,0.0001865508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037917378,0.00029586317,0.0003229552,0.0008896759,0.00077332964,0.0008766175,0.0006216247,0.0005694013,0.006519073],"category_scores_gemma":[0.0018301969,0.0002806984,0.00032111432,0.00050055503,0.00086476514,0.0018253356,0.0011923192,0.0004885738,0.0011748077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010069367,0.000027933613,0.0010989925,0.00011600375,0.000013782351,0.0003010846,0.0003577414,0.0033767181,0.018199474,0.9396477,0.0020673734,0.034692537],"study_design_scores_gemma":[0.00005021126,0.00007261739,0.0013261627,0.000053980824,0.000028320354,0.0014599315,0.00029796278,0.025587805,0.01694051,0.9147244,0.039404992,0.000053052074],"about_ca_topic_score_codex":0.0004613061,"about_ca_topic_score_gemma":0.0009790545,"teacher_disagreement_score":0.006519073,"about_ca_system_score_codex":0.0003881475,"about_ca_system_score_gemma":0.0003116986,"threshold_uncertainty_score":0.021808505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477628,0.0032319264,0.106600404,0.0048142844,0.00019858318,0.00008108856,0.00051041914,0.00027621916,0.036524247],"genre_scores_gemma":[0.98896104,0.0010073951,0.006228219,0.00039745143,0.00019513884,0.00006581952,0.0001996396,0.000085019026,0.0028602302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775535,0.0011422308,0.00007759772,0.00036229257,0.00035536228,0.0003071843],"domain_scores_gemma":[0.97388464,0.018657451,0.002306605,0.0021607322,0.0011614239,0.001829128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003467336,0.0005575353,0.0010394047,0.002258983,0.0012619591,0.0025623743,0.002083498,0.0010438114,0.0031639978],"category_scores_gemma":[0.02656316,0.00075235055,0.00045217833,0.00117804,0.0057249162,0.0051136175,0.0031550648,0.0021586684,0.00050348317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024305389,0.000035187026,0.004668491,0.000115395385,0.000043563035,0.00022727934,0.00059852784,0.017802939,0.0023042492,0.9603014,0.0025979022,0.0110621955],"study_design_scores_gemma":[0.00006107508,0.000055414195,0.0019313513,0.000063079286,0.000023547685,0.00031786697,0.00023401197,0.069511056,0.0009247854,0.9244712,0.0023558256,0.000050896146],"about_ca_topic_score_codex":0.0011814985,"about_ca_topic_score_gemma":0.0007656392,"teacher_disagreement_score":0.003467336,"about_ca_system_score_codex":0.0017774927,"about_ca_system_score_gemma":0.00042938913,"threshold_uncertainty_score":0.01833725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73026574,0.0005486324,0.19394676,0.0022612866,0.00022561179,0.00020952083,0.0018908521,0.00073749956,0.06991401],"genre_scores_gemma":[0.9387049,0.00043857205,0.039515954,0.00056824036,0.000101043384,0.00019174574,0.0014792361,0.00011809846,0.018882202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991621,0.00014029993,0.00007241471,0.0002643394,0.00018868585,0.00017214811],"domain_scores_gemma":[0.9976047,0.0012277594,0.00035076152,0.00034559757,0.00021269609,0.00025846343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051494775,0.0005865071,0.00072454085,0.0008543313,0.00091299426,0.0027053156,0.00072246284,0.0010807923,0.008743346],"category_scores_gemma":[0.003100749,0.00085984153,0.0008283573,0.0010177608,0.0016287976,0.0028532327,0.0015991003,0.0013369273,0.0009162164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002960082,0.0001104051,0.0025542811,0.0002494037,0.00007092275,0.00043613042,0.00046646994,0.016748644,0.010927115,0.935043,0.0045021614,0.028595485],"study_design_scores_gemma":[0.00017186393,0.000064081854,0.0015127377,0.000027489808,0.00004558207,0.0005439716,0.00017462965,0.031651028,0.0048995367,0.9483719,0.012487018,0.000050150702],"about_ca_topic_score_codex":0.00086051604,"about_ca_topic_score_gemma":0.0014627869,"teacher_disagreement_score":0.008743346,"about_ca_system_score_codex":0.0012712169,"about_ca_system_score_gemma":0.0005410608,"threshold_uncertainty_score":0.02924943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58837056,0.0014308847,0.23147619,0.0013835161,0.00033637095,0.0001269573,0.0004224378,0.00072386157,0.17572926],"genre_scores_gemma":[0.9576555,0.00041166545,0.021600619,0.00035595294,0.00016780435,0.00013309885,0.00016909998,0.00024123302,0.019265106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988852,0.00022621783,0.000049178914,0.0002860147,0.00029915993,0.00025425357],"domain_scores_gemma":[0.9950153,0.0017652394,0.00060631084,0.000700327,0.00096003606,0.00095266494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011614597,0.00041304866,0.0009079644,0.002062288,0.0014859501,0.002620834,0.001212857,0.0010503492,0.0084707495],"category_scores_gemma":[0.008934707,0.0004732086,0.00063406443,0.0007195844,0.0023528489,0.0051336195,0.003562646,0.0019714378,0.001020881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029323903,0.000016374499,0.0009416451,0.000042257037,0.0000051559155,0.000112076785,0.00017670821,0.0013948628,0.0017626329,0.98956406,0.00085702894,0.0050978237],"study_design_scores_gemma":[0.000018581444,0.00006817265,0.0019913348,0.000055261946,0.00001271882,0.0005316193,0.00024048962,0.045271967,0.0034894748,0.94063747,0.007658961,0.000023989554],"about_ca_topic_score_codex":0.0010914662,"about_ca_topic_score_gemma":0.0011252767,"teacher_disagreement_score":0.0084707495,"about_ca_system_score_codex":0.0013343348,"about_ca_system_score_gemma":0.00054803793,"threshold_uncertainty_score":0.028337479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6944447,0.002870346,0.268674,0.00050610915,0.00010348329,0.000038694994,0.00025352233,0.00017353574,0.032935668],"genre_scores_gemma":[0.95891976,0.0008933039,0.03523249,0.00009214701,0.00009123986,0.00005661506,0.00014646843,0.000030201381,0.0045377933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998072,0.000040327257,0.000012099666,0.000035565747,0.00007111504,0.00003369813],"domain_scores_gemma":[0.9991553,0.00043963222,0.00017220998,0.000064426684,0.0000924621,0.00007603157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036799524,0.0003771506,0.00032330546,0.0012151292,0.000686883,0.0009273651,0.0005377721,0.00071083294,0.0018801535],"category_scores_gemma":[0.0024613943,0.00017535187,0.00029026432,0.00075819343,0.0009846973,0.0014186727,0.00049734954,0.0006152487,0.00030461096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003172215,0.000012546429,0.0008508496,0.000049539205,0.000004911609,0.00027230615,0.0001981109,0.007193341,0.0040661665,0.97876567,0.0003185978,0.008236217],"study_design_scores_gemma":[0.000009576797,0.00003328221,0.0007072487,0.00004002788,0.000007947276,0.0006723195,0.0001574162,0.05482479,0.0030522854,0.9373748,0.0030999,0.000020346211],"about_ca_topic_score_codex":0.0003747349,"about_ca_topic_score_gemma":0.00049765466,"teacher_disagreement_score":0.0018801535,"about_ca_system_score_codex":0.0006205131,"about_ca_system_score_gemma":0.00021103393,"threshold_uncertainty_score":0.0062897205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58247405,0.0019308471,0.27427775,0.0025848923,0.00055119477,0.00013688236,0.00038546955,0.0011473281,0.13651164],"genre_scores_gemma":[0.9144327,0.0003314897,0.06122161,0.0004730677,0.00017235581,0.00011308277,0.00015318814,0.00009844665,0.023004003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993819,0.0001572974,0.000041903848,0.00013636747,0.00016108259,0.000121404504],"domain_scores_gemma":[0.9989329,0.00050202315,0.00010219275,0.00014942365,0.00018383631,0.00012959367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072569697,0.00025534045,0.0005090946,0.00077197154,0.0017369301,0.0009306791,0.0005252505,0.000560372,0.0030024585],"category_scores_gemma":[0.0030186782,0.00030960678,0.00052760285,0.00043050354,0.0017018894,0.0021620297,0.001723823,0.0010432911,0.0005317689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010261479,0.000051229526,0.001273179,0.00007505153,0.000014293038,0.0003951705,0.0010701638,0.0019223685,0.011827319,0.9535953,0.0021468468,0.02752645],"study_design_scores_gemma":[0.000028054452,0.00011997482,0.0009623222,0.000027933196,0.000021130636,0.00046824626,0.00021108914,0.010872894,0.011074566,0.95187825,0.024281789,0.000053693475],"about_ca_topic_score_codex":0.00079098303,"about_ca_topic_score_gemma":0.0006679972,"teacher_disagreement_score":0.0030024585,"about_ca_system_score_codex":0.00093780406,"about_ca_system_score_gemma":0.00065515446,"threshold_uncertainty_score":0.010044217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42028052,0.0009108974,0.25113618,0.0012127591,0.00033648175,0.00016333164,0.00118952,0.0025132892,0.32225707],"genre_scores_gemma":[0.9066315,0.00034915074,0.03964529,0.00044786118,0.0002275262,0.00015160198,0.0008450435,0.0004819243,0.051220097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984938,0.00038914135,0.00013255268,0.00037482454,0.00028809498,0.00032152713],"domain_scores_gemma":[0.9978555,0.001115218,0.00024734583,0.00030679378,0.0003403449,0.000134868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010572055,0.00062357844,0.00040903426,0.0015042804,0.0020058537,0.0029246341,0.00090201636,0.00071055256,0.012320342],"category_scores_gemma":[0.0034289504,0.00050181506,0.00079702376,0.0012940962,0.0023177962,0.004133827,0.0014927961,0.0010806904,0.0024577978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027023834,0.000011608427,0.00021833212,0.000024423616,0.0000041685494,0.00010838022,0.00030401873,0.00039048115,0.0008792745,0.9908552,0.0011335778,0.006043488],"study_design_scores_gemma":[0.00002061634,0.00003071597,0.0002561656,0.000031871918,0.000022253767,0.0002584341,0.0002216512,0.0055040675,0.0024291778,0.9673322,0.023868382,0.00002452628],"about_ca_topic_score_codex":0.0022067062,"about_ca_topic_score_gemma":0.003094129,"teacher_disagreement_score":0.012320342,"about_ca_system_score_codex":0.0017396765,"about_ca_system_score_gemma":0.0007042824,"threshold_uncertainty_score":0.04121566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63176566,0.0020888844,0.21096678,0.0031808638,0.00026855824,0.00012007087,0.00071373105,0.0007970967,0.15009834],"genre_scores_gemma":[0.96700513,0.00048816163,0.01825217,0.00068066403,0.00013052295,0.0000817108,0.0003308103,0.00009693512,0.012933991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946064,0.000092132585,0.000024850839,0.0001601187,0.00017269391,0.00008956286],"domain_scores_gemma":[0.9979305,0.0010187251,0.00021002379,0.0002934359,0.00020964177,0.00033775196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042839054,0.00029859174,0.00053267187,0.0018666711,0.0013298609,0.0021965068,0.0008313848,0.0011482718,0.0068333526],"category_scores_gemma":[0.0046351315,0.0003840024,0.00039700678,0.000861556,0.0016628141,0.0036970275,0.0019971346,0.0014916025,0.00079207966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038936585,0.000012889894,0.00056536816,0.00005574627,0.0000075679145,0.0001303529,0.00029432683,0.001608468,0.00339787,0.9873074,0.001586602,0.0049943244],"study_design_scores_gemma":[0.000009872812,0.000010762794,0.00031497498,0.000019084724,0.00000814245,0.00023742208,0.00018873058,0.0082162805,0.0010242958,0.9860719,0.00389114,0.0000074009986],"about_ca_topic_score_codex":0.0008110892,"about_ca_topic_score_gemma":0.0011292025,"teacher_disagreement_score":0.0068333526,"about_ca_system_score_codex":0.0012415856,"about_ca_system_score_gemma":0.00045762357,"threshold_uncertainty_score":0.022859812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9072824,0.0004861742,0.053188585,0.0010771217,0.00017400052,0.00004685792,0.0004290284,0.00022253794,0.0370932],"genre_scores_gemma":[0.98715264,0.00049182057,0.006665682,0.00007906375,0.00014598979,0.00005722077,0.00021368722,0.000049705923,0.0051441486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993243,0.00012662818,0.00003243699,0.000106943255,0.00016739711,0.00024240413],"domain_scores_gemma":[0.9976908,0.0011593822,0.00039208922,0.00026878546,0.00020712453,0.00028173288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011091685,0.00039780917,0.00054067443,0.0012885475,0.0012743167,0.0014931891,0.00064936484,0.0005029958,0.0062144008],"category_scores_gemma":[0.0037988669,0.00028719997,0.0004324647,0.0007332213,0.0018947446,0.0027896385,0.0010744511,0.00082514907,0.0007820753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008142607,0.000109584485,0.013234124,0.0003206628,0.00007285261,0.0011287336,0.00057639263,0.012229815,0.037464004,0.85042995,0.0066933855,0.07692611],"study_design_scores_gemma":[0.00014462454,0.00032695325,0.016178228,0.00013896023,0.00018197577,0.005764223,0.00051434344,0.07245569,0.04562825,0.83065796,0.027842512,0.00016632947],"about_ca_topic_score_codex":0.00035217713,"about_ca_topic_score_gemma":0.00040548661,"teacher_disagreement_score":0.0062144008,"about_ca_system_score_codex":0.0006426932,"about_ca_system_score_gemma":0.0005542194,"threshold_uncertainty_score":0.020789266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49270406,0.002697605,0.31055748,0.0010874157,0.0008001452,0.00019742668,0.00089178456,0.00095285935,0.19011128],"genre_scores_gemma":[0.89222807,0.00071418233,0.063676484,0.0006651993,0.00021307552,0.00020430118,0.0007774469,0.00025251007,0.04126875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992605,0.00014254554,0.00004220491,0.00013642322,0.00021733732,0.00020091371],"domain_scores_gemma":[0.9990007,0.00017813832,0.000101708865,0.00016188539,0.00038825287,0.00016933084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055464666,0.00053523923,0.0004536737,0.0014344136,0.0010450946,0.0010881065,0.0008982726,0.0007936308,0.007731846],"category_scores_gemma":[0.0023706192,0.00022377026,0.0004868871,0.0010964052,0.0011649682,0.0017256578,0.0011197856,0.0011858332,0.0015735293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001498151,0.00003085574,0.0010429745,0.000103787446,0.00001151898,0.00032725,0.00038701232,0.0043760496,0.008520064,0.94484425,0.003243177,0.036963277],"study_design_scores_gemma":[0.0000468589,0.00013394511,0.0013779113,0.00009192954,0.000020215495,0.00095017604,0.00021928264,0.07902879,0.011128941,0.8518262,0.05508882,0.00008693502],"about_ca_topic_score_codex":0.0018176499,"about_ca_topic_score_gemma":0.0022309197,"teacher_disagreement_score":0.007731846,"about_ca_system_score_codex":0.0013148937,"about_ca_system_score_gemma":0.00068670424,"threshold_uncertainty_score":0.025865614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91245365,0.00020078006,0.03489489,0.00019593607,0.000039632545,0.000069263704,0.0008911891,0.00011453672,0.051140115],"genre_scores_gemma":[0.9816218,0.00016283893,0.010595703,0.000042047606,0.0000284498,0.00005528092,0.0008806986,0.000035166617,0.006578052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952567,0.00005614974,0.000044508502,0.000073833064,0.00015911557,0.00014073245],"domain_scores_gemma":[0.9987978,0.00038921082,0.00032768055,0.00013948021,0.00019880632,0.00014700637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033518233,0.00028316837,0.00035763538,0.00084716774,0.0011357507,0.0016644963,0.00033599194,0.00035120468,0.009232201],"category_scores_gemma":[0.0014315635,0.0003288569,0.000470082,0.0009318015,0.0009420369,0.0011251036,0.00079142256,0.00068336434,0.0007736425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039300357,0.000100056095,0.0076840627,0.00021309846,0.000055262753,0.00086653343,0.0010968847,0.02389219,0.046267856,0.870934,0.0040930267,0.04440402],"study_design_scores_gemma":[0.00018253954,0.000706692,0.010643127,0.00010158315,0.000093507755,0.0027634108,0.0016275547,0.047817145,0.04028283,0.84265137,0.052999046,0.00013107454],"about_ca_topic_score_codex":0.0008354205,"about_ca_topic_score_gemma":0.0010672127,"teacher_disagreement_score":0.009232201,"about_ca_system_score_codex":0.0007320613,"about_ca_system_score_gemma":0.00071632076,"threshold_uncertainty_score":0.030884743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35080293,0.0010625913,0.4979364,0.0009871629,0.00019867037,0.00013570325,0.00049607333,0.0013083097,0.14707224],"genre_scores_gemma":[0.826129,0.00054318405,0.14648633,0.00039727884,0.00012481683,0.0003585918,0.00072098966,0.00025641153,0.024983503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878675,0.00044615683,0.00006410242,0.00023743574,0.00030661863,0.00015900523],"domain_scores_gemma":[0.9972351,0.0013683117,0.00035238746,0.0004670295,0.00030488858,0.0002722912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069552474,0.00063540495,0.0004971635,0.00216117,0.0022073856,0.002814051,0.0016561215,0.0010434475,0.010612588],"category_scores_gemma":[0.003859937,0.0007104689,0.00047688326,0.0016472992,0.0026370927,0.0034486104,0.002937748,0.0017019486,0.0020564592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066745524,0.000019911706,0.0003883222,0.000057503457,0.0000069178855,0.00011623875,0.0002025404,0.0027810533,0.002170247,0.981531,0.0020167104,0.010642881],"study_design_scores_gemma":[0.000059766804,0.0001160907,0.00064546,0.00010783644,0.000026826308,0.0008735305,0.00051354466,0.03762873,0.016069522,0.90290743,0.040991835,0.000059383645],"about_ca_topic_score_codex":0.0002657406,"about_ca_topic_score_gemma":0.0004924064,"teacher_disagreement_score":0.010612588,"about_ca_system_score_codex":0.0009917925,"about_ca_system_score_gemma":0.0002383846,"threshold_uncertainty_score":0.035502613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50055426,0.003934906,0.41110325,0.006711362,0.00028440822,0.0002263436,0.0009890744,0.00073342357,0.07546297],"genre_scores_gemma":[0.9456595,0.0029744857,0.032248273,0.00065120624,0.0005150738,0.00044221611,0.00056877197,0.00028441852,0.016656078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828184,0.00054442143,0.000054088992,0.00044493773,0.00039474637,0.000279936],"domain_scores_gemma":[0.98525697,0.010629434,0.0010364213,0.00096558256,0.0007120177,0.0013995572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019098151,0.0010291856,0.0013044159,0.0025087115,0.0017306966,0.0031687883,0.0021103756,0.0017934282,0.006614885],"category_scores_gemma":[0.02172865,0.00079060317,0.0008663998,0.0015082569,0.004109492,0.0066309976,0.002829945,0.0028577663,0.0010032911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022425536,0.00005188268,0.0022164409,0.00014520914,0.000048109225,0.0002050992,0.00037015992,0.028747732,0.0067505827,0.9440528,0.0056996085,0.011488188],"study_design_scores_gemma":[0.00005315484,0.00007091845,0.0011769631,0.000057243567,0.000034009397,0.00035024175,0.00009105848,0.1920734,0.0032611226,0.7965612,0.006220917,0.00004980684],"about_ca_topic_score_codex":0.0013581825,"about_ca_topic_score_gemma":0.00093349785,"teacher_disagreement_score":0.006614885,"about_ca_system_score_codex":0.0021803083,"about_ca_system_score_gemma":0.00070727995,"threshold_uncertainty_score":0.022129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69126683,0.001960955,0.24206339,0.0011518738,0.00028711197,0.00009428801,0.0003081334,0.00028219484,0.06258527],"genre_scores_gemma":[0.93830603,0.0008298272,0.043102928,0.00022055331,0.000087231645,0.00009931394,0.0005400916,0.00016537437,0.016648548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938405,0.00017717974,0.000023851611,0.00015850695,0.00012398548,0.0001324442],"domain_scores_gemma":[0.9992235,0.0002458137,0.000074436415,0.00015695841,0.0001376365,0.00016169203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049680466,0.00050241547,0.00045007828,0.0021363136,0.0020579738,0.0024853223,0.0010787833,0.0009452313,0.0036375194],"category_scores_gemma":[0.0020578073,0.00039822847,0.0006486353,0.0015034619,0.0030447212,0.0042932867,0.003647938,0.0017160551,0.0004818959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003283883,0.000011471233,0.0003238975,0.000021450058,0.0000076010915,0.00010086251,0.0008234498,0.001084444,0.0014703785,0.98562706,0.00041265026,0.010083818],"study_design_scores_gemma":[0.0000057876623,0.00001495347,0.00031708452,0.000017793862,0.000011137428,0.00011056666,0.00067317445,0.0035201823,0.0017138533,0.98414534,0.009450515,0.000019715253],"about_ca_topic_score_codex":0.0025663674,"about_ca_topic_score_gemma":0.0029153689,"teacher_disagreement_score":0.0036375194,"about_ca_system_score_codex":0.001145874,"about_ca_system_score_gemma":0.00045006172,"threshold_uncertainty_score":0.012168705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63130844,0.0013141512,0.332592,0.00089999236,0.00011755874,0.000055287106,0.00018254762,0.0002564946,0.03327353],"genre_scores_gemma":[0.96109885,0.0007480138,0.028722908,0.00016764767,0.000106009196,0.00013373267,0.00016993214,0.00013161427,0.008721314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910885,0.0003056112,0.000032811644,0.0001371226,0.00027334868,0.000142272],"domain_scores_gemma":[0.9948153,0.0029697497,0.0007358954,0.0002677474,0.0006819164,0.0005294232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018295802,0.0006944971,0.00063171226,0.0023563302,0.0010767801,0.0019812756,0.0012474295,0.0008332252,0.002922637],"category_scores_gemma":[0.010589817,0.00031213873,0.0006631814,0.0011335382,0.0034002527,0.003326857,0.0014079838,0.0014877194,0.00047733847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051620715,0.000050234128,0.00085503433,0.00006179528,0.00001613515,0.00018624665,0.00032878466,0.011283941,0.0031308297,0.9753264,0.0005161503,0.008192785],"study_design_scores_gemma":[0.000012638003,0.00006003584,0.0010241148,0.00005068984,0.0000130433555,0.00029872844,0.0002034627,0.15379524,0.0033038615,0.8380921,0.0031123736,0.000033708286],"about_ca_topic_score_codex":0.001428224,"about_ca_topic_score_gemma":0.0010780637,"teacher_disagreement_score":0.002922637,"about_ca_system_score_codex":0.0019097005,"about_ca_system_score_gemma":0.00055330974,"threshold_uncertainty_score":0.013855934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6797844,0.0021495041,0.22183663,0.0010879484,0.00075116206,0.0001558718,0.0019542186,0.0014965598,0.09078367],"genre_scores_gemma":[0.8083252,0.00096088566,0.16211918,0.00039958913,0.0003006309,0.0002993021,0.002692928,0.0007035422,0.02419872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.0000833586,0.00007678614,0.00023159495,0.00017074494,0.0001418666],"domain_scores_gemma":[0.99730444,0.0010726429,0.00040059493,0.0005360348,0.00047765262,0.00020847643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005853081,0.0007575791,0.0006543913,0.0012121202,0.0024510953,0.0017302328,0.0012299318,0.0010232291,0.011116235],"category_scores_gemma":[0.0074954154,0.00043918326,0.0007015617,0.0014827317,0.001277602,0.003973619,0.0017738999,0.0015307866,0.003927669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010071791,0.00023264215,0.0076321727,0.0012004566,0.000077997334,0.001645688,0.0013466716,0.013603953,0.06237822,0.7309794,0.009103211,0.17079245],"study_design_scores_gemma":[0.00008167255,0.00034785646,0.003916152,0.00043139354,0.0001508699,0.0031432416,0.00080117804,0.0358098,0.054235324,0.8476566,0.053232692,0.00019329929],"about_ca_topic_score_codex":0.00033432574,"about_ca_topic_score_gemma":0.0007702635,"teacher_disagreement_score":0.011116235,"about_ca_system_score_codex":0.0006810037,"about_ca_system_score_gemma":0.00092674326,"threshold_uncertainty_score":0.037187517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8422731,0.0036910176,0.13431269,0.0021617368,0.00013252733,0.000121619036,0.00038327713,0.00061954756,0.01630445],"genre_scores_gemma":[0.9889436,0.0011330325,0.006051707,0.00023526826,0.00011242849,0.00014123063,0.00020119186,0.000094257164,0.0030872126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990188,0.00035628356,0.000035198584,0.00022953456,0.00018820378,0.00017200578],"domain_scores_gemma":[0.99142283,0.0048987796,0.0015220889,0.00070581556,0.0005834543,0.0008669352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016244457,0.000528106,0.000911802,0.002836004,0.0011504217,0.002187401,0.0013275057,0.0015154608,0.0029406492],"category_scores_gemma":[0.01588491,0.00084655965,0.00058826606,0.0015007557,0.0027718025,0.0036825375,0.0014576697,0.0011369382,0.00045858583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023016839,0.000059759437,0.005056015,0.00017969879,0.00006891025,0.00042168977,0.0006191691,0.054235216,0.0036021685,0.9174119,0.0036560744,0.014459301],"study_design_scores_gemma":[0.00005367226,0.000049518057,0.0016165067,0.00005853871,0.000033529504,0.00034328975,0.00016166354,0.188336,0.0012279171,0.80490977,0.0031680467,0.000041530155],"about_ca_topic_score_codex":0.0020149606,"about_ca_topic_score_gemma":0.001908483,"teacher_disagreement_score":0.0029406492,"about_ca_system_score_codex":0.0019274784,"about_ca_system_score_gemma":0.0005323082,"threshold_uncertainty_score":0.013984919},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35004106,0.0025599718,0.561242,0.0034850792,0.0003392814,0.00024622824,0.0011737418,0.0005405686,0.08037213],"genre_scores_gemma":[0.8824854,0.002507058,0.09812113,0.0010492147,0.0005697152,0.0005181344,0.0011653455,0.00020733628,0.013376575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965501,0.00073573855,0.00028178535,0.0009108226,0.0008750687,0.0006464769],"domain_scores_gemma":[0.98815197,0.0063615935,0.0013736894,0.0022048878,0.0010690435,0.0008387239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00490891,0.00089897605,0.0020168638,0.0026389644,0.003227851,0.0040296484,0.002438466,0.0014289389,0.007908099],"category_scores_gemma":[0.016198212,0.0009021887,0.0022002251,0.0026265625,0.0046421634,0.010934109,0.005064177,0.004260267,0.0011833282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005583275,0.000018169629,0.00071277306,0.00007307111,0.000022044416,0.00007559863,0.00030313173,0.0043654526,0.0007774505,0.98734075,0.0015895771,0.00466616],"study_design_scores_gemma":[0.00004460988,0.00004261319,0.0008205971,0.000037634454,0.0000426427,0.0003090002,0.00020789023,0.030619944,0.0016913264,0.95879143,0.0073530395,0.00003940467],"about_ca_topic_score_codex":0.0012637688,"about_ca_topic_score_gemma":0.0011571147,"teacher_disagreement_score":0.007908099,"about_ca_system_score_codex":0.0030284913,"about_ca_system_score_gemma":0.00096506,"threshold_uncertainty_score":0.026455224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8886451,0.0005156628,0.027248159,0.00023045979,0.0001752425,0.00003317395,0.00018007017,0.00022035745,0.08275174],"genre_scores_gemma":[0.9841293,0.00019047824,0.007881421,0.00008790561,0.00004918269,0.00003523292,0.00014266447,0.000050050196,0.007433795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973756,0.00003078132,0.000017537765,0.00007086292,0.00006237443,0.00008088734],"domain_scores_gemma":[0.99956244,0.00011477669,0.00007915684,0.00005965415,0.000087350236,0.00009667572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022268244,0.00025284183,0.00029530603,0.00091337884,0.0015680827,0.0013884301,0.00052494975,0.00043609092,0.004602598],"category_scores_gemma":[0.0007265042,0.00021411486,0.00037062183,0.00058367976,0.0015697746,0.0015955376,0.00084943627,0.00072989136,0.00041336438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028790452,0.000029994098,0.001806677,0.00009002492,0.000014261342,0.00026097044,0.00034704345,0.0033390296,0.019248495,0.96153384,0.0015502,0.011491502],"study_design_scores_gemma":[0.0000544283,0.000182234,0.0042810948,0.00004630146,0.000033118384,0.0006724553,0.00045428736,0.022990748,0.022824146,0.92978185,0.018588617,0.00009074406],"about_ca_topic_score_codex":0.0015480836,"about_ca_topic_score_gemma":0.0021585596,"teacher_disagreement_score":0.004602598,"about_ca_system_score_codex":0.00091229635,"about_ca_system_score_gemma":0.00041945695,"threshold_uncertainty_score":0.015397251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024364982,0.00029303407,0.9489024,0.00044955744,0.000078337725,0.00029234408,0.0015181703,0.012636264,0.011464873],"genre_scores_gemma":[0.26055956,0.00031649074,0.72002923,0.00029937478,0.00007334927,0.00097130536,0.0047550914,0.0028626402,0.010132901],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987565,0.00027354664,0.00011648082,0.00021231365,0.00045247705,0.00018873072],"domain_scores_gemma":[0.9971559,0.0014665622,0.00014708671,0.00082286575,0.00028022335,0.0001274093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013014092,0.00094436033,0.0009469755,0.0012028201,0.0005018753,0.002154573,0.0025940125,0.0011802476,0.018489858],"category_scores_gemma":[0.008133155,0.00070979446,0.00094383775,0.0015761685,0.0009751595,0.0040851003,0.0033598356,0.0018222124,0.005874652],"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.001131934,0.0003255304,0.0016387049,0.00091196655,0.000052742107,0.0003224056,0.0004380302,0.055251464,0.023753287,0.38574314,0.02742441,0.50300634],"study_design_scores_gemma":[0.00034103196,0.00027959686,0.00042208403,0.00016279278,0.00006218975,0.00050524983,0.00020420366,0.4674869,0.05935873,0.4368667,0.034199465,0.000111077934],"about_ca_topic_score_codex":0.0006340363,"about_ca_topic_score_gemma":0.0010693418,"teacher_disagreement_score":0.018489858,"about_ca_system_score_codex":0.0010922847,"about_ca_system_score_gemma":0.0014565665,"threshold_uncertainty_score":0.06185478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23597318,0.00048490262,0.7353523,0.0006068594,0.000077036246,0.00009826351,0.000257,0.00018806728,0.026962373],"genre_scores_gemma":[0.856053,0.00040121758,0.13564277,0.00024089393,0.000105814725,0.00012685396,0.00021105433,0.000040640814,0.007177794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660814,0.00083906885,0.00019996788,0.0005943208,0.0010105714,0.00074801367],"domain_scores_gemma":[0.98982567,0.004939803,0.0011859462,0.002463692,0.0010674112,0.0005174991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024717776,0.0005019603,0.00070517435,0.0009743576,0.0016203267,0.0018337335,0.0007778143,0.0011167699,0.004621823],"category_scores_gemma":[0.0094637945,0.0005113988,0.00067938206,0.0012445974,0.0026868582,0.0035562397,0.0023776498,0.0023155073,0.0009556909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114138194,0.000023689518,0.00060243526,0.00004746512,0.000009769019,0.00005305297,0.00018538297,0.00504775,0.00659252,0.97689706,0.00044250145,0.009984209],"study_design_scores_gemma":[0.00004702166,0.00013262138,0.00087010657,0.000040047904,0.000021632055,0.00038773747,0.00015614401,0.058039002,0.017558044,0.91303265,0.009654496,0.00006063343],"about_ca_topic_score_codex":0.0005069427,"about_ca_topic_score_gemma":0.0005101118,"teacher_disagreement_score":0.004621823,"about_ca_system_score_codex":0.00085040764,"about_ca_system_score_gemma":0.00070468563,"threshold_uncertainty_score":0.015461564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8015288,0.0011393416,0.15549788,0.0006453978,0.00013314569,0.00009746536,0.00018038558,0.00017121092,0.040606398],"genre_scores_gemma":[0.97261983,0.0006025375,0.018946914,0.00009254808,0.00008337429,0.00011094474,0.00016451014,0.000059840946,0.007319466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946207,0.00010391887,0.000029194463,0.00008587189,0.00021202481,0.00010689243],"domain_scores_gemma":[0.9977367,0.0011688807,0.00039198986,0.00021750295,0.0003260106,0.00015885805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067021925,0.00037427628,0.00035753995,0.001592196,0.0006412621,0.00095865113,0.0005141319,0.0005691677,0.002508505],"category_scores_gemma":[0.006289747,0.0002886312,0.00029274056,0.0006937786,0.001411502,0.0014338025,0.000653986,0.0007070006,0.00036425778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041433486,0.000021701222,0.0008928168,0.000047924404,0.0000052227124,0.00023904847,0.00020469236,0.017134745,0.0072637955,0.9652438,0.0007392629,0.008165592],"study_design_scores_gemma":[0.000034877587,0.00007948764,0.0014132624,0.00005046022,0.000010681231,0.00045629268,0.00012334414,0.22028615,0.0078177685,0.76511383,0.004564574,0.0000492493],"about_ca_topic_score_codex":0.0014770398,"about_ca_topic_score_gemma":0.0013575125,"teacher_disagreement_score":0.002508505,"about_ca_system_score_codex":0.00077768834,"about_ca_system_score_gemma":0.0005216182,"threshold_uncertainty_score":0.008391738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38150162,0.0017955796,0.48344967,0.0032221735,0.0005367319,0.00024018632,0.0021534169,0.0036570346,0.12344352],"genre_scores_gemma":[0.820287,0.0010338017,0.1285096,0.00080646464,0.00030028634,0.0004341167,0.0025777007,0.0011893897,0.044861723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976156,0.0004712651,0.00015000167,0.0006319318,0.0006843879,0.0004468781],"domain_scores_gemma":[0.9918549,0.0047247224,0.0004069663,0.0015143895,0.0010126146,0.0004864213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256791,0.00075313787,0.0010860618,0.0019042414,0.0025750948,0.0036721167,0.0021486548,0.0013732845,0.02604411],"category_scores_gemma":[0.018390445,0.00087748625,0.00097419467,0.0018020878,0.0027970313,0.008980721,0.0044586565,0.0025831147,0.005504125],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055517023,0.000103544364,0.0037912142,0.00032719888,0.00005405899,0.0004058688,0.0012366978,0.012911407,0.010272825,0.8434887,0.023714827,0.103138484],"study_design_scores_gemma":[0.000059517835,0.00014157484,0.00094710116,0.000100208505,0.00005887865,0.0010080369,0.0005423012,0.051327493,0.010337275,0.9041162,0.031292845,0.00006851709],"about_ca_topic_score_codex":0.0010230942,"about_ca_topic_score_gemma":0.001245074,"teacher_disagreement_score":0.02604411,"about_ca_system_score_codex":0.0013488553,"about_ca_system_score_gemma":0.0012106472,"threshold_uncertainty_score":0.087126195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.749549,0.001512806,0.18576513,0.0011820133,0.00020886528,0.000054941807,0.0013497549,0.0013489106,0.05902862],"genre_scores_gemma":[0.9618923,0.00019277558,0.03338752,0.00018573625,0.00006274523,0.00006463056,0.0011094373,0.00038173186,0.0027230878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871206,0.00023405034,0.000057358306,0.0003159699,0.0003535676,0.00032688718],"domain_scores_gemma":[0.9940258,0.00397361,0.0005186741,0.0007891867,0.00029328399,0.0003994193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010519936,0.0010425941,0.001104959,0.0025996394,0.001999869,0.0027585798,0.0021625874,0.0016076249,0.015626198],"category_scores_gemma":[0.012843951,0.0007945563,0.0007716512,0.0017410043,0.0028109082,0.004905587,0.0026641416,0.0020980472,0.0012354602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009093474,0.00032452983,0.008394987,0.00055408344,0.000107156346,0.00073539675,0.00060861185,0.16524714,0.00482359,0.75420386,0.015926896,0.0481644],"study_design_scores_gemma":[0.00003825621,0.00004356768,0.0006871073,0.00006223795,0.000023974282,0.0001826291,0.00014348346,0.16625047,0.0024955987,0.8281694,0.0018669178,0.000036396956],"about_ca_topic_score_codex":0.0011698456,"about_ca_topic_score_gemma":0.0022047835,"teacher_disagreement_score":0.015626198,"about_ca_system_score_codex":0.0014123337,"about_ca_system_score_gemma":0.0006943061,"threshold_uncertainty_score":0.052274823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15590861,0.00233223,0.53299725,0.020096295,0.0015136008,0.00024176284,0.0048701838,0.002014332,0.28002575],"genre_scores_gemma":[0.79851776,0.0018176464,0.09164168,0.0018467422,0.00088300684,0.00038347382,0.0034752758,0.00075710827,0.10067729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889284,0.00020825263,0.00005313413,0.00041520345,0.00017869077,0.000251923],"domain_scores_gemma":[0.9964485,0.0020303703,0.00022150243,0.00075537805,0.00031198954,0.00023223952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512072,0.00055192737,0.00135781,0.00061452115,0.0023994949,0.0041106557,0.0015565495,0.001987115,0.029762061],"category_scores_gemma":[0.007964662,0.0005742397,0.00089120405,0.0012919189,0.0022623183,0.00618673,0.0025426198,0.0036881051,0.00480897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017103908,0.000065076805,0.00033643396,0.00013577238,0.000022451582,0.00009211453,0.00012057295,0.010962621,0.0005224669,0.9223806,0.027594669,0.03759609],"study_design_scores_gemma":[0.00005406238,0.000020601983,0.00013787065,0.000022063194,0.000010273213,0.000063747546,0.000080985374,0.022583174,0.00055268273,0.96441,0.012051399,0.000013141132],"about_ca_topic_score_codex":0.0016938185,"about_ca_topic_score_gemma":0.0017382883,"teacher_disagreement_score":0.029762061,"about_ca_system_score_codex":0.0014318383,"about_ca_system_score_gemma":0.0021579207,"threshold_uncertainty_score":0.099564016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5641593,0.0011891084,0.39045426,0.0016839124,0.00020731713,0.00011776918,0.0009241477,0.00062712276,0.04063713],"genre_scores_gemma":[0.9603305,0.0010267935,0.022631602,0.0002148388,0.00026378842,0.00024339644,0.0008718298,0.00019636471,0.014221018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994599,0.00008689793,0.000022415097,0.00013614746,0.00017704134,0.00011756214],"domain_scores_gemma":[0.9975091,0.0014419646,0.00025384154,0.00025105008,0.00035900014,0.00018501635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009863545,0.0005401964,0.0006248135,0.0031902501,0.0009633142,0.0017690968,0.0012982115,0.0007999136,0.0068119112],"category_scores_gemma":[0.007741898,0.0003014926,0.000581961,0.0017300525,0.0025868188,0.0033437854,0.0014891862,0.0011962263,0.001158552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029910761,0.000008381095,0.0012428764,0.000040258998,0.0000062329773,0.00005202434,0.0002346788,0.0031408374,0.0011545414,0.9773637,0.0011345587,0.01559198],"study_design_scores_gemma":[0.000016850925,0.00003328151,0.0008727576,0.000029760376,0.000007833069,0.0001402042,0.000096602,0.032586686,0.0019927435,0.9593604,0.0048335264,0.00002938411],"about_ca_topic_score_codex":0.0009608512,"about_ca_topic_score_gemma":0.00048201738,"teacher_disagreement_score":0.0068119112,"about_ca_system_score_codex":0.0015558248,"about_ca_system_score_gemma":0.00061782775,"threshold_uncertainty_score":0.022788107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9101926,0.0010813839,0.059525914,0.0005120001,0.00013300228,0.00008919188,0.00072352856,0.00040033995,0.02734197],"genre_scores_gemma":[0.86552244,0.00085545174,0.12355281,0.00012722329,0.000050134022,0.00010838806,0.0013326575,0.00022765037,0.008223253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917233,0.00016822138,0.00008446337,0.00011685963,0.00016185285,0.00029631465],"domain_scores_gemma":[0.9991874,0.0002781628,0.0001269845,0.00017561269,0.00007863704,0.0001532779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004232569,0.00074599235,0.0013077814,0.00046522415,0.0007573734,0.0011108593,0.0006123433,0.00077245914,0.008390703],"category_scores_gemma":[0.0021887284,0.00071051595,0.00057674065,0.0014137843,0.00073172053,0.0016851014,0.001530922,0.0005414266,0.001701776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055672824,0.0011691502,0.007317385,0.0014142969,0.00022168744,0.0024251016,0.0010990878,0.413856,0.09825082,0.12463806,0.03293036,0.3111108],"study_design_scores_gemma":[0.0007189017,0.0021296039,0.007964255,0.00015798246,0.00013440136,0.0015441503,0.0015806557,0.6909825,0.080155365,0.18735369,0.02709907,0.00017939784],"about_ca_topic_score_codex":0.0008992656,"about_ca_topic_score_gemma":0.0016188533,"teacher_disagreement_score":0.008390703,"about_ca_system_score_codex":0.0005572031,"about_ca_system_score_gemma":0.00070829573,"threshold_uncertainty_score":0.028069675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41197705,0.018421331,0.5102054,0.007709044,0.00042931503,0.00018520799,0.003659169,0.0005172126,0.046896204],"genre_scores_gemma":[0.93884087,0.005479979,0.048354868,0.00069615024,0.0007507964,0.00030803133,0.0014048559,0.0001516132,0.004012864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974446,0.0011771427,0.00011564975,0.00049999775,0.00048681264,0.0002757796],"domain_scores_gemma":[0.9838594,0.010952636,0.0015542334,0.0014930319,0.0009094105,0.0012312388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234725,0.0010737579,0.0015017821,0.0033579923,0.0015605579,0.0036341907,0.0012876224,0.0014722715,0.0027532903],"category_scores_gemma":[0.015118959,0.00053537136,0.0008535144,0.0027209762,0.003530754,0.005892543,0.0024590117,0.0023553562,0.0004149776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078834964,0.00002833626,0.0017374501,0.00016100072,0.000062236024,0.00006013484,0.00020775318,0.014393745,0.0010145538,0.97028995,0.0037782004,0.008187843],"study_design_scores_gemma":[0.000015574033,0.000039487786,0.0013346456,0.00003656453,0.000021465925,0.00016155443,0.00008775867,0.05252695,0.00045070268,0.9394442,0.005848685,0.000032315387],"about_ca_topic_score_codex":0.0011011924,"about_ca_topic_score_gemma":0.00070674194,"teacher_disagreement_score":0.0036341907,"about_ca_system_score_codex":0.0026383996,"about_ca_system_score_gemma":0.0005565136,"threshold_uncertainty_score":0.019143045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878097,0.00047526314,0.19030952,0.00021586218,0.000115701485,0.00006549022,0.00013810357,0.0001823842,0.020687973],"genre_scores_gemma":[0.93102634,0.00017417944,0.061281923,0.000087665234,0.00003635666,0.00009398239,0.00018127123,0.00005807441,0.0070602577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997029,0.000046657497,0.000023984627,0.00010054097,0.00006282932,0.00006318047],"domain_scores_gemma":[0.9994294,0.00019676297,0.000104263505,0.00012165285,0.000054566775,0.00009336018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025526134,0.00022410548,0.00039714345,0.00034387386,0.0006505914,0.00059299613,0.0004482831,0.0005116428,0.0038297155],"category_scores_gemma":[0.0011966787,0.00025329253,0.00043809737,0.00032406274,0.0006701218,0.00078615604,0.0006782777,0.00045780817,0.00067274255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004913688,0.00011676521,0.005121692,0.00027800372,0.00005132109,0.0012056134,0.0009634734,0.10505323,0.13620079,0.7039129,0.0026689733,0.043935895],"study_design_scores_gemma":[0.00009282873,0.0003190122,0.0035214936,0.0000370118,0.000047282774,0.0016131039,0.00060529594,0.45495093,0.083869144,0.4320865,0.022792982,0.000064416956],"about_ca_topic_score_codex":0.00038142534,"about_ca_topic_score_gemma":0.0004449142,"teacher_disagreement_score":0.0038297155,"about_ca_system_score_codex":0.00029597123,"about_ca_system_score_gemma":0.00016779764,"threshold_uncertainty_score":0.012811661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14382383,0.0017910976,0.76644564,0.0023769927,0.00034447972,0.00027956767,0.0013076123,0.00095790304,0.082672805],"genre_scores_gemma":[0.75867176,0.001838222,0.20561078,0.001211242,0.0008975484,0.0006745259,0.0015383472,0.00040219974,0.02915535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697745,0.00049117557,0.00023518523,0.0008307546,0.0010120836,0.00045332537],"domain_scores_gemma":[0.99276555,0.0043110154,0.0005228431,0.0012360403,0.0007505591,0.00041401453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002745321,0.00088152295,0.0016499292,0.0026225932,0.0040208376,0.003876021,0.0018767436,0.001789189,0.0121091725],"category_scores_gemma":[0.010397377,0.0009788289,0.0026526116,0.0036049008,0.005239513,0.012015034,0.004070712,0.003834226,0.0020192896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004601012,0.00001903898,0.00046804367,0.00012286179,0.000025057436,0.00009398075,0.00037047008,0.0035569416,0.0012467977,0.98218334,0.0031786307,0.008688746],"study_design_scores_gemma":[0.00003118395,0.00004615198,0.00045061103,0.000037113452,0.00003423355,0.00040817252,0.0000879257,0.01757996,0.0022768022,0.96680856,0.0122084515,0.000030829226],"about_ca_topic_score_codex":0.0014547831,"about_ca_topic_score_gemma":0.0013947781,"teacher_disagreement_score":0.0121091725,"about_ca_system_score_codex":0.0028645848,"about_ca_system_score_gemma":0.0012525235,"threshold_uncertainty_score":0.040509164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069882296,0.00088305713,0.89604735,0.0027704309,0.00016126127,0.00007023061,0.00028758377,0.00013813072,0.02975969],"genre_scores_gemma":[0.6121121,0.0017751085,0.36600378,0.00092673197,0.0005806372,0.00040015715,0.00074255664,0.00023561543,0.017223297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976453,0.001023415,0.000085277956,0.0004503436,0.00048234593,0.0003132879],"domain_scores_gemma":[0.9950565,0.0033634373,0.00044456983,0.00047543176,0.00028963824,0.0003703221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026987905,0.000842109,0.0013958226,0.0013548976,0.0019562328,0.0024510964,0.0020974292,0.0019269722,0.007440692],"category_scores_gemma":[0.010442977,0.00072800874,0.0017860178,0.0017460802,0.0040849647,0.0066034114,0.0029677546,0.0050503355,0.0007230345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062988285,0.000038964903,0.000275707,0.000052923322,0.000017345948,0.00003777836,0.00008278747,0.019984383,0.00052560825,0.96349263,0.0038997377,0.011529186],"study_design_scores_gemma":[0.000018701281,0.00003544415,0.00020932932,0.000017350492,0.000006545245,0.00006404448,0.000055040087,0.06411764,0.00026693064,0.931864,0.0033238959,0.00002098409],"about_ca_topic_score_codex":0.0012613186,"about_ca_topic_score_gemma":0.0010968805,"teacher_disagreement_score":0.007440692,"about_ca_system_score_codex":0.0014098872,"about_ca_system_score_gemma":0.0011441556,"threshold_uncertainty_score":0.024891555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67241275,0.0005189379,0.27697864,0.0008227972,0.00011465875,0.00008330035,0.0010776438,0.00062304176,0.047368266],"genre_scores_gemma":[0.8681893,0.00027624852,0.123586826,0.00015607596,0.00004985695,0.000110686764,0.001078585,0.00012688038,0.006425418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990619,0.00019217862,0.00005563331,0.00015985665,0.00039737255,0.00013299326],"domain_scores_gemma":[0.9977859,0.00097200146,0.00030711084,0.00047254367,0.00024024618,0.00022212339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038676776,0.00027475078,0.0006590478,0.0013316434,0.0014660277,0.0020511076,0.0010897223,0.0007003159,0.005035055],"category_scores_gemma":[0.0039867056,0.00048434097,0.000493578,0.0018227693,0.0018079645,0.0019770137,0.0018182418,0.0013728446,0.00081381935],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017280813,0.000058860132,0.0018783286,0.0000917903,0.000015895504,0.00020036651,0.0003231632,0.048408307,0.0059806304,0.90234286,0.0035892539,0.036937617],"study_design_scores_gemma":[0.00005269088,0.000048290163,0.0007144594,0.000021520542,0.000010081061,0.0003056097,0.00024008873,0.13314654,0.0032658419,0.8554786,0.0066820555,0.000034171702],"about_ca_topic_score_codex":0.0023427466,"about_ca_topic_score_gemma":0.0034428353,"teacher_disagreement_score":0.005035055,"about_ca_system_score_codex":0.0013245525,"about_ca_system_score_gemma":0.0005235049,"threshold_uncertainty_score":0.016843915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9084492,0.0005858101,0.050270043,0.0024220906,0.00009466341,0.0000542633,0.0010851077,0.00063810934,0.036400706],"genre_scores_gemma":[0.97444826,0.00030034184,0.01953432,0.00028603853,0.00007038567,0.00005643121,0.0006558711,0.00010715843,0.0045411526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992773,0.00011595798,0.000022511358,0.0002717125,0.00012818753,0.00018436731],"domain_scores_gemma":[0.9937344,0.0037496432,0.0006312281,0.0009267357,0.00034234088,0.0006156038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005806396,0.00044752398,0.000578603,0.0011274435,0.0015285092,0.0022160206,0.0008477883,0.0008692805,0.0044550574],"category_scores_gemma":[0.0037538956,0.00057269476,0.00048801358,0.00121051,0.0021154548,0.0026478588,0.0016093433,0.0017395854,0.00045666774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050015294,0.00013425703,0.011210319,0.0002761554,0.000048339076,0.00039632674,0.0005983456,0.036305275,0.025706023,0.8830146,0.012231321,0.029578967],"study_design_scores_gemma":[0.00011931996,0.00007046736,0.0071167843,0.000037308826,0.00006581905,0.0007744194,0.00040766032,0.08671141,0.009119358,0.8807749,0.014751117,0.000051391602],"about_ca_topic_score_codex":0.0020517919,"about_ca_topic_score_gemma":0.004646874,"teacher_disagreement_score":0.0044550574,"about_ca_system_score_codex":0.0027372167,"about_ca_system_score_gemma":0.0010649987,"threshold_uncertainty_score":0.01985991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2310311,0.00076043064,0.39655563,0.0022728508,0.00051508914,0.000502097,0.0011158504,0.0009995786,0.3662473],"genre_scores_gemma":[0.8640892,0.00040226988,0.060348585,0.0010348337,0.00015927336,0.00040846915,0.00081949256,0.00017137294,0.07256652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878925,0.00029034851,0.0000656871,0.00026569932,0.00026360175,0.00032539017],"domain_scores_gemma":[0.9978746,0.0007158764,0.0002443202,0.0003594728,0.00030833107,0.0004973733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007350199,0.0006785092,0.00088375085,0.0007134726,0.002379622,0.0025767721,0.0021263154,0.0017041204,0.01924008],"category_scores_gemma":[0.0045234645,0.00039551785,0.0006115361,0.0008246825,0.0024784175,0.0032010407,0.0029251364,0.0015611775,0.0023482754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021176298,0.00006114474,0.00033901806,0.00007412003,0.000012174501,0.00014622329,0.00019839994,0.0046038,0.0016918611,0.9781738,0.0043637957,0.010124015],"study_design_scores_gemma":[0.00010733315,0.000112608046,0.00047899806,0.000049784674,0.000026143616,0.0003078895,0.00027663467,0.08731787,0.002267207,0.86962014,0.03938769,0.000047761616],"about_ca_topic_score_codex":0.00257745,"about_ca_topic_score_gemma":0.002927148,"teacher_disagreement_score":0.01924008,"about_ca_system_score_codex":0.0015635072,"about_ca_system_score_gemma":0.0011872906,"threshold_uncertainty_score":0.06436449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6635116,0.00046278813,0.2206516,0.0041005397,0.00021109568,0.00045264835,0.0013576292,0.0006959136,0.1085562],"genre_scores_gemma":[0.92403907,0.00032314996,0.053212713,0.00062205433,0.00006347817,0.00045067075,0.00095098326,0.00021037957,0.020127406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998511,0.00048185672,0.00008643451,0.00026537213,0.0002357976,0.00041953087],"domain_scores_gemma":[0.9954881,0.0024764466,0.00035673942,0.00032524203,0.00024581997,0.0011076779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013282197,0.0011496991,0.001662849,0.0009598951,0.002075086,0.003951192,0.0022258402,0.0020642802,0.011545387],"category_scores_gemma":[0.007400982,0.00058014534,0.0009308521,0.0010666923,0.003257583,0.005749094,0.0028929366,0.0027432577,0.0009980154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006769736,0.0001613581,0.0010183043,0.0001967354,0.000040671697,0.00025775732,0.00058545714,0.038639843,0.002724204,0.9316054,0.0071345153,0.016958797],"study_design_scores_gemma":[0.000144464,0.000085957,0.0002553359,0.000037710637,0.000019340187,0.00009613984,0.00019498075,0.12438671,0.0008521715,0.87083876,0.0030548458,0.000033629894],"about_ca_topic_score_codex":0.0038701172,"about_ca_topic_score_gemma":0.00484008,"teacher_disagreement_score":0.011545387,"about_ca_system_score_codex":0.0027385617,"about_ca_system_score_gemma":0.0017587361,"threshold_uncertainty_score":0.038623154},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8194177,0.0010189058,0.15159549,0.00455995,0.000103665814,0.0001600164,0.0012026913,0.0011142618,0.020827351],"genre_scores_gemma":[0.97378516,0.0006580528,0.018339211,0.00048869976,0.00014371461,0.0003224691,0.0008664216,0.00027888117,0.005117336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730206,0.0009613114,0.00012995738,0.0006819814,0.00047154177,0.00045321268],"domain_scores_gemma":[0.9634128,0.025168128,0.0026770153,0.004271723,0.0014634097,0.003006923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003313391,0.00063564425,0.0013431975,0.0019379107,0.0016918571,0.0027513811,0.0028810536,0.0017789775,0.0069676256],"category_scores_gemma":[0.028170697,0.0010864327,0.0009960263,0.0012082551,0.0036062028,0.007935486,0.0025453374,0.0027076465,0.0011004013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015856948,0.00025861242,0.02349818,0.0005807061,0.00025147668,0.0007333088,0.0010447985,0.083506286,0.03414302,0.7706552,0.021640126,0.062102657],"study_design_scores_gemma":[0.00019142967,0.0003289448,0.008749212,0.00008904132,0.00012237394,0.0017861894,0.0002760036,0.3362847,0.011766485,0.6326966,0.0075868974,0.00012216439],"about_ca_topic_score_codex":0.0008136387,"about_ca_topic_score_gemma":0.00085345097,"teacher_disagreement_score":0.0069676256,"about_ca_system_score_codex":0.0018422041,"about_ca_system_score_gemma":0.0008132236,"threshold_uncertainty_score":0.023309052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6908141,0.0011873122,0.15584771,0.0025270768,0.0006240594,0.00014436462,0.0009547458,0.0009310499,0.1469696],"genre_scores_gemma":[0.8618891,0.0005869898,0.07189095,0.0008550508,0.00023415792,0.0003563794,0.0010590628,0.00032600685,0.06280231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995346,0.00005616995,0.000028332728,0.0001204091,0.00009796082,0.00016253252],"domain_scores_gemma":[0.9982628,0.000886213,0.00023293677,0.00015775727,0.00024961744,0.00021069749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563186,0.0006399817,0.0004370064,0.00054746855,0.0018699275,0.0016873322,0.00069017964,0.0010719202,0.018515421],"category_scores_gemma":[0.0020508734,0.0005114234,0.00074204593,0.00060828286,0.0012136665,0.003965051,0.002359691,0.0013490802,0.003065879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069488573,0.00014586296,0.0018689784,0.00048850046,0.00003445129,0.0012206568,0.0012418656,0.0014975802,0.028746143,0.9149311,0.008077926,0.04105208],"study_design_scores_gemma":[0.00012705167,0.00020603884,0.0018808346,0.00012787057,0.00010615624,0.001386172,0.00080798776,0.008902657,0.037432767,0.8895745,0.059364278,0.000083696345],"about_ca_topic_score_codex":0.00037880254,"about_ca_topic_score_gemma":0.00043972177,"teacher_disagreement_score":0.018515421,"about_ca_system_score_codex":0.0005536458,"about_ca_system_score_gemma":0.00051862246,"threshold_uncertainty_score":0.061940193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5603136,0.0013714072,0.39776388,0.0012500121,0.00026392489,0.00011893848,0.0009496508,0.0012414127,0.036727183],"genre_scores_gemma":[0.86624426,0.0011815422,0.113431,0.00050584995,0.00052659545,0.00060289603,0.0019670671,0.0008957545,0.014645107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688584,0.00064587314,0.00029966194,0.00075588975,0.0010451542,0.00036752693],"domain_scores_gemma":[0.9847647,0.00892413,0.0012778258,0.00232595,0.0020963668,0.0006109893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022030207,0.00073824177,0.00093330175,0.0032696663,0.0011713053,0.0027077766,0.0024088053,0.0012281821,0.008623828],"category_scores_gemma":[0.025985403,0.00059940614,0.000810777,0.00213424,0.0024152868,0.0076375855,0.0022141056,0.0013405004,0.0015180592],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070636853,0.00018502868,0.019806225,0.000713979,0.00013965818,0.0010514186,0.0012805292,0.04504942,0.054963533,0.7414179,0.0070394394,0.12764658],"study_design_scores_gemma":[0.00005039012,0.0001347503,0.0047714687,0.000174314,0.00011945935,0.0034137017,0.0002777402,0.3000013,0.02623866,0.65331554,0.011365969,0.00013676335],"about_ca_topic_score_codex":0.0005380638,"about_ca_topic_score_gemma":0.00061092095,"teacher_disagreement_score":0.008623828,"about_ca_system_score_codex":0.0013272257,"about_ca_system_score_gemma":0.0005782011,"threshold_uncertainty_score":0.028849602},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04900858,0.0003512904,0.9112411,0.0013148332,0.00022457639,0.00041051564,0.00029951104,0.00066450186,0.03648512],"genre_scores_gemma":[0.4966096,0.0005684446,0.48219544,0.000899293,0.00015380263,0.0008609623,0.00068064185,0.00023118695,0.017800737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938497,0.0031244976,0.00030159103,0.0010483692,0.0010415191,0.00063425465],"domain_scores_gemma":[0.993793,0.002449421,0.0005643896,0.0025130445,0.00040268805,0.0002774074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003629192,0.0014139405,0.0011337451,0.00088642084,0.0014700175,0.0027140367,0.0025202853,0.002355781,0.011131158],"category_scores_gemma":[0.011156548,0.00085854676,0.0023722248,0.0016417485,0.003325333,0.0050432915,0.0050511984,0.004278538,0.0021071245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013989572,0.00010152086,0.00067483453,0.00019070704,0.000055337507,0.00011829282,0.00036807786,0.024752088,0.002282753,0.93359315,0.0034225557,0.03430081],"study_design_scores_gemma":[0.00019999366,0.00025181758,0.00040962527,0.00011237003,0.00009257782,0.00040262577,0.00020928816,0.12245973,0.00466372,0.8417452,0.02937327,0.0000797815],"about_ca_topic_score_codex":0.0008710996,"about_ca_topic_score_gemma":0.0011694205,"teacher_disagreement_score":0.011131158,"about_ca_system_score_codex":0.0015560433,"about_ca_system_score_gemma":0.001991372,"threshold_uncertainty_score":0.037237465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29788673,0.0020743194,0.5889914,0.0030056236,0.00032686448,0.00013858949,0.0010244529,0.00075132924,0.10580067],"genre_scores_gemma":[0.900927,0.0011139617,0.0766559,0.00085592817,0.00018038988,0.00022316788,0.0005209326,0.00014220264,0.019380474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995165,0.00006874739,0.000023612836,0.0001543704,0.00013068327,0.00010604037],"domain_scores_gemma":[0.99755186,0.0014019123,0.0001827376,0.0003517936,0.00029642068,0.00021526289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007679555,0.00052511465,0.00047575883,0.0013732604,0.0014169343,0.0012654569,0.0011588235,0.0005636901,0.0067683407],"category_scores_gemma":[0.0047893883,0.00032232646,0.000829626,0.0009615028,0.001871562,0.0028373958,0.0016933865,0.0016492695,0.0007415293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072466944,0.00001590728,0.0011711582,0.0001121797,0.000021739977,0.00011545118,0.0003385491,0.008320543,0.00389718,0.9576774,0.004268864,0.02398857],"study_design_scores_gemma":[0.000023363646,0.000044191704,0.00090597046,0.0000361866,0.000025182506,0.00027801446,0.00010492771,0.025525775,0.0026213662,0.9524032,0.018004488,0.000027395456],"about_ca_topic_score_codex":0.004223638,"about_ca_topic_score_gemma":0.004717879,"teacher_disagreement_score":0.0067683407,"about_ca_system_score_codex":0.0021406473,"about_ca_system_score_gemma":0.00090563286,"threshold_uncertainty_score":0.022642374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.780898,0.00057636,0.16413897,0.00021439587,0.00007060955,0.00010072432,0.0008902086,0.00026522268,0.052845486],"genre_scores_gemma":[0.9316442,0.0003944641,0.057817727,0.00006934822,0.00003001265,0.0001384259,0.0015478138,0.00007570681,0.008282393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899274,0.00017535289,0.00010182083,0.00016058495,0.00028305151,0.0002864241],"domain_scores_gemma":[0.99841785,0.0005438793,0.00038500965,0.00018856382,0.00026040323,0.00020419453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036676155,0.0005963109,0.0008489904,0.0015302452,0.001531445,0.0017374131,0.00067848037,0.0010499981,0.0099215405],"category_scores_gemma":[0.0020864161,0.0008406258,0.0006287502,0.001803212,0.0009372838,0.0022436322,0.0019933463,0.000780521,0.0021607955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018162604,0.00017782599,0.009358482,0.00043369405,0.00024917448,0.0056658336,0.0014609242,0.09304984,0.10124878,0.7131982,0.0077026673,0.06563838],"study_design_scores_gemma":[0.0002706911,0.00057314325,0.005911696,0.00021259069,0.00024590685,0.0053226906,0.0026176963,0.2339696,0.075005926,0.64048827,0.035187624,0.0001941495],"about_ca_topic_score_codex":0.0011222456,"about_ca_topic_score_gemma":0.0018643165,"teacher_disagreement_score":0.0099215405,"about_ca_system_score_codex":0.0008182474,"about_ca_system_score_gemma":0.0005446847,"threshold_uncertainty_score":0.033190906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2240094,0.0021118862,0.6030353,0.004599991,0.0006545083,0.00016962839,0.0014203598,0.0004778895,0.16352104],"genre_scores_gemma":[0.8727566,0.0024855442,0.097895056,0.001221217,0.00063313195,0.00024703713,0.0009921513,0.0001961441,0.023573108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998922,0.00014883124,0.00006505453,0.00040079988,0.00030799783,0.00015544842],"domain_scores_gemma":[0.99596775,0.0020922476,0.00040745776,0.0007131887,0.00047810317,0.00034119305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009108893,0.00051933207,0.00069195224,0.0013531283,0.0019863558,0.0023875444,0.0013390579,0.0010429149,0.0064869965],"category_scores_gemma":[0.0064800126,0.0004540867,0.0007925561,0.0015121785,0.0027679708,0.0053401827,0.0027202854,0.0026901236,0.0011058152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034984372,0.000013833439,0.00037863234,0.00007072612,0.000013014686,0.000112208545,0.00016056355,0.002907547,0.0017390166,0.98020154,0.0032115022,0.011156539],"study_design_scores_gemma":[0.000019096644,0.000020526588,0.0003255577,0.00001996825,0.000014062462,0.00027606572,0.00009193265,0.008093582,0.002005617,0.9679413,0.021175278,0.00001706202],"about_ca_topic_score_codex":0.0009631132,"about_ca_topic_score_gemma":0.00069187704,"teacher_disagreement_score":0.0064869965,"about_ca_system_score_codex":0.0011464505,"about_ca_system_score_gemma":0.00040720883,"threshold_uncertainty_score":0.021701097},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37483305,0.0017204318,0.47253242,0.0013486167,0.0005771095,0.00022372686,0.0006327256,0.001363373,0.14676856],"genre_scores_gemma":[0.9258058,0.00051191193,0.058106,0.0004345738,0.00013722284,0.00024280744,0.00056214223,0.0003227523,0.013876792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982413,0.0004520166,0.00007129816,0.00042711472,0.00042987263,0.0003785012],"domain_scores_gemma":[0.9930118,0.0038418528,0.0005533157,0.0012755648,0.00065399904,0.00066351955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075034756,0.00065154326,0.0007951099,0.0014628891,0.0025100089,0.0022509026,0.002056801,0.0010180426,0.018021744],"category_scores_gemma":[0.008156927,0.0006454813,0.00069869595,0.0013379934,0.002257164,0.0039994386,0.0025333695,0.0026443414,0.0016680214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046001922,0.00019670774,0.003454069,0.00029230065,0.000056432742,0.0010130462,0.00060263585,0.029837972,0.011535286,0.8873428,0.009697967,0.05551067],"study_design_scores_gemma":[0.000063021645,0.0001750346,0.0011004381,0.00008364704,0.000035097506,0.0014366935,0.00035580923,0.06310117,0.00818334,0.9073345,0.018062599,0.0000686693],"about_ca_topic_score_codex":0.0011958007,"about_ca_topic_score_gemma":0.0021694037,"teacher_disagreement_score":0.018021744,"about_ca_system_score_codex":0.0010973603,"about_ca_system_score_gemma":0.0007997737,"threshold_uncertainty_score":0.060288727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20299836,0.009298238,0.5190993,0.022623455,0.0031864494,0.00014796335,0.0005081148,0.0011844978,0.24095365],"genre_scores_gemma":[0.8555591,0.0042514508,0.09680664,0.0031269018,0.001859721,0.00011974289,0.00031803182,0.0005305034,0.03742795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802506,0.00061189866,0.00010105542,0.00050372427,0.00043983132,0.00031844122],"domain_scores_gemma":[0.99320555,0.004349578,0.00022237634,0.001189699,0.00046597168,0.0005667958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023569625,0.0006887971,0.0011595815,0.0012458877,0.0023475238,0.0018281805,0.0014297441,0.0019945048,0.0063020494],"category_scores_gemma":[0.008820392,0.00079739676,0.0017148424,0.0008045604,0.005642987,0.009785225,0.0047459183,0.0057661016,0.0010143134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026698232,0.000013842646,0.00019934296,0.00006482534,0.000008014887,0.00009888314,0.00033476533,0.00089000986,0.0012848505,0.99020374,0.0024346756,0.0044404007],"study_design_scores_gemma":[0.000022698161,0.000054308122,0.000266352,0.00003331365,0.000014509308,0.00014829927,0.00016833845,0.005454366,0.0015707759,0.96741796,0.024819655,0.000029380859],"about_ca_topic_score_codex":0.0027641605,"about_ca_topic_score_gemma":0.002672828,"teacher_disagreement_score":0.0063020494,"about_ca_system_score_codex":0.0012008912,"about_ca_system_score_gemma":0.00060138665,"threshold_uncertainty_score":0.02108246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5319347,0.0024625803,0.35909733,0.0025998687,0.0009646832,0.00014708714,0.0010492519,0.0005044949,0.10123995],"genre_scores_gemma":[0.9288824,0.00087543856,0.05846878,0.00057033607,0.00055561226,0.00012869237,0.00068564515,0.00016755587,0.009665565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997976,0.00054576324,0.00020198386,0.00036649514,0.00047482213,0.000434891],"domain_scores_gemma":[0.9947478,0.002042895,0.00073761086,0.00081089966,0.00076572,0.0008951337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002904533,0.000668209,0.0005755353,0.0023154754,0.0016677411,0.004475702,0.00065370556,0.00066748785,0.008347628],"category_scores_gemma":[0.0050410666,0.0006149081,0.001384879,0.0015087668,0.0050593335,0.011065855,0.0027516466,0.0023966716,0.00073023885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041975927,0.000025878478,0.0004940587,0.0000421037,0.000008371313,0.0001308692,0.0005835658,0.0010170627,0.0013293378,0.99288505,0.0004595922,0.0029820655],"study_design_scores_gemma":[0.000019521069,0.000056888737,0.0005385154,0.00002646758,0.000015457303,0.00024374158,0.0006673513,0.0034199958,0.0016265325,0.98339945,0.009962304,0.000023745146],"about_ca_topic_score_codex":0.0016336465,"about_ca_topic_score_gemma":0.0019655153,"teacher_disagreement_score":0.008347628,"about_ca_system_score_codex":0.0013210878,"about_ca_system_score_gemma":0.00072547223,"threshold_uncertainty_score":0.02792561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50200516,0.00040254387,0.4601998,0.00068157446,0.00008960532,0.00005262232,0.00028020216,0.0005099504,0.035778478],"genre_scores_gemma":[0.9773375,0.00022678763,0.016724288,0.00008682965,0.00008768008,0.000056722867,0.00014290541,0.00010845719,0.0052287886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771583,0.00048371873,0.00013587408,0.0005368272,0.00075968425,0.0003681084],"domain_scores_gemma":[0.9936428,0.0031326134,0.0007750099,0.0013975912,0.00054935605,0.000502553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022480087,0.0003339674,0.0005894082,0.001986594,0.0010720688,0.0025814113,0.001007486,0.00061068544,0.0044265473],"category_scores_gemma":[0.0104055,0.00047963086,0.0011011799,0.0014864759,0.0043008355,0.0040527093,0.0017137456,0.0017094575,0.0006010543],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026167592,0.000017238548,0.0012559246,0.000017309418,0.0000049033574,0.00010324995,0.00028318763,0.0041934364,0.0014423017,0.98324513,0.00045020893,0.008960974],"study_design_scores_gemma":[0.000010632698,0.00001572718,0.0011110638,0.000011344664,0.00000858106,0.00028673984,0.000072439616,0.034544054,0.0016942953,0.9596948,0.0025283368,0.00002213075],"about_ca_topic_score_codex":0.0011641984,"about_ca_topic_score_gemma":0.0008090498,"teacher_disagreement_score":0.0044265473,"about_ca_system_score_codex":0.0015392305,"about_ca_system_score_gemma":0.0008390677,"threshold_uncertainty_score":0.014808238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72922707,0.0020190855,0.24166362,0.00036974123,0.00012077944,0.00005368149,0.0002443966,0.00021411026,0.026087584],"genre_scores_gemma":[0.9487548,0.0008612634,0.043041937,0.00008734537,0.000097657095,0.000064373424,0.00016330906,0.000051588304,0.0068777623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990798,0.000250197,0.000065518616,0.00019847727,0.0002520891,0.0001538812],"domain_scores_gemma":[0.9968894,0.0014788996,0.0007485666,0.00030809513,0.00037074357,0.00020423534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006977674,0.00060298626,0.0004758874,0.0011611417,0.00068793213,0.0013836068,0.0005600191,0.0007334218,0.0019742383],"category_scores_gemma":[0.0037821108,0.0004900689,0.0004027495,0.0010830887,0.0026672855,0.0038018692,0.0017435596,0.0008807837,0.00031772317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004241543,0.000011770356,0.0007948583,0.000072866635,0.0000074932545,0.00032998205,0.00045242306,0.00909858,0.001960361,0.981911,0.00032540289,0.0049928194],"study_design_scores_gemma":[0.000020297273,0.00018124886,0.00086535566,0.00005922714,0.000016276534,0.0013184809,0.00026383478,0.04211056,0.0035138254,0.94376755,0.007844519,0.000038779297],"about_ca_topic_score_codex":0.00049304636,"about_ca_topic_score_gemma":0.00048579418,"teacher_disagreement_score":0.0019742383,"about_ca_system_score_codex":0.00044818956,"about_ca_system_score_gemma":0.00048932765,"threshold_uncertainty_score":0.006604433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8735965,0.00039160383,0.04550542,0.0013587426,0.00011711099,0.00007104143,0.0006135238,0.00044087964,0.077905096],"genre_scores_gemma":[0.9715604,0.000112455375,0.013944,0.00009981092,0.000045853267,0.00002589845,0.00027268202,0.00005623592,0.013882658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957806,0.000082320235,0.000013536849,0.00012387751,0.00006251065,0.00013957759],"domain_scores_gemma":[0.9991666,0.00033451561,0.00014521144,0.00011712785,0.00007509283,0.00016151115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000373301,0.00029606352,0.00036504827,0.00067620684,0.0012220994,0.0015885592,0.00070691167,0.0005302542,0.010201617],"category_scores_gemma":[0.001215069,0.00028925572,0.0004282364,0.00051369716,0.0016449601,0.0012810242,0.001191141,0.00095981185,0.0010267294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055811735,0.000094145835,0.0018572462,0.00013402992,0.000033927456,0.000327885,0.00057152164,0.014640682,0.018465007,0.9420765,0.004685706,0.016555289],"study_design_scores_gemma":[0.0004407779,0.00030680507,0.004656979,0.000052658073,0.00009628865,0.00073098426,0.0008027985,0.09067528,0.019218981,0.8373607,0.04547851,0.00017922749],"about_ca_topic_score_codex":0.0032904057,"about_ca_topic_score_gemma":0.0043073627,"teacher_disagreement_score":0.010201617,"about_ca_system_score_codex":0.001695532,"about_ca_system_score_gemma":0.0007001157,"threshold_uncertainty_score":0.03412777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3028872,0.0005349141,0.5021248,0.002164331,0.00022163212,0.00027675417,0.0004338018,0.0006317735,0.19072486],"genre_scores_gemma":[0.89747304,0.00039369453,0.065044194,0.00092602486,0.0001653106,0.0004379938,0.0007987661,0.00024332502,0.03451762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987903,0.00033308472,0.000046527988,0.0002584993,0.00030203912,0.00026945508],"domain_scores_gemma":[0.99777764,0.0009113273,0.0003647825,0.00038253682,0.00035141717,0.00021232109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015323492,0.0007494946,0.0005673224,0.0015959645,0.0027449646,0.0016887385,0.0020134759,0.001359461,0.010438213],"category_scores_gemma":[0.0030820344,0.00057057425,0.0017458625,0.00083644217,0.004147063,0.005315441,0.0029338063,0.0028007831,0.001818601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082876695,0.000008044015,0.00015397521,0.00001712945,0.0000028882855,0.000028820246,0.00017405913,0.00040934826,0.00043882223,0.996454,0.0005407835,0.0017638588],"study_design_scores_gemma":[0.000013253959,0.00002322062,0.0003085686,0.000008372123,0.000012525951,0.00009874962,0.00021917881,0.004583354,0.0027826037,0.98640835,0.005526951,0.000014897223],"about_ca_topic_score_codex":0.001480188,"about_ca_topic_score_gemma":0.0017683037,"teacher_disagreement_score":0.010438213,"about_ca_system_score_codex":0.0021985257,"about_ca_system_score_gemma":0.0009371784,"threshold_uncertainty_score":0.034919262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76626456,0.0005061702,0.10733329,0.00028243716,0.00019895069,0.00006177009,0.0005251665,0.00030183152,0.124525726],"genre_scores_gemma":[0.94258755,0.00030298554,0.031651147,0.00011618683,0.00006128474,0.000054519536,0.0008776326,0.00015359189,0.024195086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998135,0.000025611687,0.000017083563,0.000045277146,0.000045159333,0.000053428994],"domain_scores_gemma":[0.99980587,0.000035564004,0.000026766178,0.00006757305,0.000028572065,0.000035610636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113268725,0.0001841108,0.0003627353,0.00026553366,0.00059476786,0.0006562631,0.0003284189,0.0002530162,0.0048473645],"category_scores_gemma":[0.00034215252,0.00014613684,0.00043062668,0.0002524415,0.00061469537,0.00059376017,0.0006679727,0.00054897927,0.0008797433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045591072,0.000051975425,0.002707184,0.00020565974,0.000033532393,0.0008231584,0.0010139206,0.01893065,0.11022968,0.7670959,0.0073876875,0.09106474],"study_design_scores_gemma":[0.00011596024,0.00039615782,0.009284733,0.00007289901,0.000061962295,0.0025213042,0.0010095349,0.095764786,0.08122405,0.67789364,0.13155995,0.00009499186],"about_ca_topic_score_codex":0.0010050663,"about_ca_topic_score_gemma":0.00096070615,"teacher_disagreement_score":0.0048473645,"about_ca_system_score_codex":0.00028176745,"about_ca_system_score_gemma":0.00015189261,"threshold_uncertainty_score":0.0162161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4576445,0.0034749077,0.30442393,0.0018901584,0.0009368066,0.00020647892,0.00145212,0.00093681563,0.22903438],"genre_scores_gemma":[0.9231932,0.0012030556,0.03545363,0.000669402,0.0005764723,0.00033046817,0.001151882,0.0002281058,0.037193783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985921,0.00034125336,0.00006748046,0.0002822909,0.00030407173,0.00041279633],"domain_scores_gemma":[0.9980495,0.0007355292,0.00032628578,0.00033694314,0.00029626495,0.00025551204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478024,0.00047835082,0.00049913663,0.001767946,0.0014020476,0.0018457886,0.00063972257,0.00067401223,0.0077377157],"category_scores_gemma":[0.0044084154,0.00032092276,0.0005156381,0.0017809642,0.002384262,0.0023130411,0.0014458906,0.0010451364,0.001247246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038254457,0.000008251863,0.00017710574,0.000014881214,0.0000028285713,0.00004276499,0.00009571411,0.0016585117,0.00030164132,0.9895483,0.0013945646,0.006717149],"study_design_scores_gemma":[0.000019723157,0.000033090862,0.00041903497,0.000023345516,0.000005068815,0.000116691306,0.000062279054,0.018177995,0.000703329,0.970125,0.010294928,0.000019590398],"about_ca_topic_score_codex":0.002417212,"about_ca_topic_score_gemma":0.0019491906,"teacher_disagreement_score":0.0077377157,"about_ca_system_score_codex":0.0013772905,"about_ca_system_score_gemma":0.00097219605,"threshold_uncertainty_score":0.025885284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15756163,0.005486091,0.5541531,0.003793941,0.001325309,0.00010665597,0.00061025063,0.0016098237,0.27535316],"genre_scores_gemma":[0.86856574,0.0038076118,0.07224808,0.00079451187,0.0016613273,0.00028269264,0.00043082837,0.0008247419,0.051384453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940825,0.00012931906,0.00003712718,0.0001348723,0.00020256038,0.00008790572],"domain_scores_gemma":[0.99741685,0.0012550339,0.000220562,0.00032654012,0.000546429,0.00023455717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015363656,0.0010487225,0.00073466316,0.0039215176,0.00089950423,0.002368213,0.0015835486,0.0011582876,0.013317815],"category_scores_gemma":[0.010837197,0.0003394134,0.000664352,0.0021307839,0.0020435709,0.006501143,0.0020090127,0.0038304578,0.002995626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023690158,0.000023813293,0.0007443251,0.00009083713,0.00001135873,0.00011620418,0.00019384558,0.0026695693,0.0022160474,0.96078575,0.0039029964,0.029221516],"study_design_scores_gemma":[0.0000098598375,0.000026973466,0.0021432298,0.00012838228,0.000042525684,0.0006068501,0.00017336874,0.036828596,0.002413861,0.9357727,0.021786178,0.00006756102],"about_ca_topic_score_codex":0.0012071024,"about_ca_topic_score_gemma":0.0012243884,"teacher_disagreement_score":0.013317815,"about_ca_system_score_codex":0.002181481,"about_ca_system_score_gemma":0.00063555577,"threshold_uncertainty_score":0.044552565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3710953,0.00049777614,0.53940296,0.001046148,0.0003945097,0.00016249379,0.0021713288,0.0019422597,0.08328723],"genre_scores_gemma":[0.8599669,0.00034606227,0.08978869,0.00031477163,0.0002620029,0.00029690433,0.0017947234,0.00038364384,0.046846274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993143,0.0001171798,0.00004163076,0.00014448428,0.0001795682,0.00020296345],"domain_scores_gemma":[0.99829,0.0005819789,0.0003114865,0.0002729575,0.00030494135,0.00023866606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066673255,0.00056827196,0.00032226686,0.0017019472,0.001032928,0.0022277897,0.0008932601,0.00069976883,0.018397415],"category_scores_gemma":[0.0038032546,0.00039903104,0.0005693905,0.000987862,0.0018637327,0.0025027643,0.0013610732,0.0012084323,0.0037874777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027789024,0.00009067171,0.0007818727,0.00013863281,0.000018622153,0.00021244961,0.00029193776,0.021409899,0.00933906,0.9158249,0.008753862,0.042860143],"study_design_scores_gemma":[0.000040808143,0.00018467364,0.00083833036,0.000027889419,0.000008293256,0.00027315074,0.00011868052,0.047588855,0.010769473,0.9323493,0.007733173,0.00006726599],"about_ca_topic_score_codex":0.00044038956,"about_ca_topic_score_gemma":0.0009180488,"teacher_disagreement_score":0.018397415,"about_ca_system_score_codex":0.0007610215,"about_ca_system_score_gemma":0.00070871273,"threshold_uncertainty_score":0.06154549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16015127,0.0018974808,0.8159016,0.001294323,0.000107187894,0.00007953208,0.00049368397,0.00024689035,0.019828085],"genre_scores_gemma":[0.86915654,0.0020475923,0.11901192,0.00027752353,0.00028617177,0.00019756294,0.00078593916,0.0002119347,0.008024806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988073,0.0005058827,0.000048153637,0.00029741507,0.0002156946,0.00012550317],"domain_scores_gemma":[0.996439,0.0025114755,0.00041143733,0.00027658197,0.00016278762,0.00019880949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013548918,0.0012704064,0.0010748334,0.0010413636,0.0005375043,0.0024360374,0.0016488566,0.0012439662,0.004288676],"category_scores_gemma":[0.006876717,0.00043966208,0.000596291,0.0021315243,0.001444066,0.005763235,0.0019750728,0.0022015506,0.00058582745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012157522,0.00013030211,0.0005190245,0.00026394447,0.000050632945,0.000114586495,0.00018641347,0.1716128,0.0018882619,0.77460325,0.0038964204,0.046612836],"study_design_scores_gemma":[0.000016947748,0.00004063112,0.0001563324,0.000020381607,0.000008595314,0.00006090049,0.00007104889,0.24561445,0.00062507624,0.7516064,0.0017665824,0.000012609606],"about_ca_topic_score_codex":0.0006124355,"about_ca_topic_score_gemma":0.00048143213,"teacher_disagreement_score":0.004288676,"about_ca_system_score_codex":0.0014521152,"about_ca_system_score_gemma":0.0004388014,"threshold_uncertainty_score":0.014347017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9319374,0.0003563239,0.05121928,0.0002758136,0.00010718023,0.000046434834,0.00017502041,0.00010831383,0.015774291],"genre_scores_gemma":[0.98160386,0.00023490633,0.012468116,0.0000838485,0.00007162483,0.00008438638,0.00029266562,0.000056586574,0.0051040263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987571,0.00016986948,0.000093493334,0.0003524853,0.00041901143,0.00020809549],"domain_scores_gemma":[0.99808925,0.0008705321,0.0002552363,0.00018934568,0.00024180596,0.00035391134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008934648,0.00051535387,0.0010081889,0.0023796083,0.0019108444,0.0027260429,0.0019947125,0.0012417743,0.006106712],"category_scores_gemma":[0.0034161035,0.00042004092,0.00077785656,0.0009393319,0.003148672,0.004542768,0.0017316138,0.0017207406,0.0005365504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021143281,0.000121271456,0.013894225,0.00013837541,0.0000683485,0.00061219244,0.0007476921,0.0037509114,0.024144158,0.93514574,0.0013877247,0.019777875],"study_design_scores_gemma":[0.000046972375,0.00013378708,0.010346033,0.000066326946,0.00009663121,0.0017471289,0.0004350943,0.04519224,0.031203248,0.9037445,0.0068785315,0.000109489774],"about_ca_topic_score_codex":0.00053251977,"about_ca_topic_score_gemma":0.00066663494,"teacher_disagreement_score":0.006106712,"about_ca_system_score_codex":0.0011995055,"about_ca_system_score_gemma":0.0003821713,"threshold_uncertainty_score":0.020428956},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06754659,0.0028425364,0.13076442,0.007969202,0.001044575,0.00014029493,0.0025595725,0.00053959765,0.78659326],"genre_scores_gemma":[0.7876993,0.0030454153,0.030813344,0.004910087,0.0007619719,0.0002482697,0.0017711566,0.00043749192,0.170313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910104,0.00008761177,0.000030685012,0.0001973699,0.00035696186,0.00022632217],"domain_scores_gemma":[0.99889755,0.00027480198,0.000055512028,0.00016646806,0.00042709723,0.00017853097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263421,0.00039335559,0.0006234605,0.0009720386,0.0037104103,0.0024838771,0.0011006817,0.0008787371,0.021230057],"category_scores_gemma":[0.0025474352,0.00026040335,0.00071812654,0.0011486504,0.003264649,0.0026538544,0.0024591896,0.0019701761,0.0025953155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009574723,0.000003801196,0.00014368353,0.000013442535,0.0000042655984,0.000021984124,0.0000666162,0.00018491446,0.00017034274,0.9864938,0.007749601,0.0051379683],"study_design_scores_gemma":[0.00001537614,0.0000080213285,0.0005305181,0.0000131472825,0.0000087370645,0.000101833684,0.00008531794,0.0021091437,0.00048269014,0.93340266,0.06322493,0.000017625369],"about_ca_topic_score_codex":0.06320759,"about_ca_topic_score_gemma":0.043529566,"teacher_disagreement_score":0.06320759,"about_ca_system_score_codex":0.0032977061,"about_ca_system_score_gemma":0.0044474863,"threshold_uncertainty_score":0.12567937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06951114,0.007711428,0.64735574,0.0069019403,0.00070742995,0.000081584534,0.0010753912,0.00021074433,0.26644462],"genre_scores_gemma":[0.8027811,0.007600487,0.1328387,0.0023511655,0.0013206047,0.00029804494,0.0012474953,0.00015609714,0.05140626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993874,0.00011045899,0.00003835076,0.000139692,0.00024566488,0.000078370715],"domain_scores_gemma":[0.9988212,0.00057677424,0.00010738998,0.000102205304,0.00031673216,0.00007572297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007871775,0.00050356134,0.00035840727,0.0011082793,0.00071600167,0.0015708108,0.00089910324,0.0007612108,0.008441204],"category_scores_gemma":[0.0026578608,0.00027261584,0.0004823812,0.0014786449,0.0016306815,0.0043336432,0.0015161306,0.0029473521,0.00114351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014913003,0.0000072111407,0.000119015094,0.00005205353,0.000004456212,0.000029448753,0.00006419373,0.0022025986,0.0010712877,0.9824785,0.0021633415,0.011792877],"study_design_scores_gemma":[0.00000888955,0.000020216967,0.00030967937,0.00002933785,0.0000059703816,0.00009833086,0.000052966156,0.015058934,0.0018948771,0.95533234,0.02717644,0.000011989584],"about_ca_topic_score_codex":0.0016864866,"about_ca_topic_score_gemma":0.0018286869,"teacher_disagreement_score":0.008441204,"about_ca_system_score_codex":0.0017658502,"about_ca_system_score_gemma":0.00044838485,"threshold_uncertainty_score":0.028238654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02171658,0.0016972249,0.8948684,0.0032595124,0.00094684126,0.0001420317,0.00013667993,0.0007040681,0.076528706],"genre_scores_gemma":[0.3684868,0.0038495716,0.5329815,0.0022968072,0.0023596084,0.00056099,0.00037720278,0.0010417034,0.08804584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985262,0.00036520627,0.00008530718,0.0003978375,0.000494187,0.00013111315],"domain_scores_gemma":[0.99654275,0.002012505,0.00016007017,0.0008047564,0.00033911652,0.00014081999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017492683,0.0014073987,0.0011134907,0.002644749,0.0018687369,0.0018123619,0.0020866732,0.0013739099,0.018723559],"category_scores_gemma":[0.008379261,0.00064817246,0.0023921828,0.0027569248,0.0038726805,0.0060709813,0.0037287609,0.004330992,0.0031254855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006381465,0.000075767544,0.00034230962,0.00013462927,0.000027302185,0.00018188347,0.00033561533,0.0063874694,0.0032787377,0.9132673,0.0052599343,0.07064517],"study_design_scores_gemma":[0.000023984001,0.000060639926,0.00012547725,0.000023985374,0.00002031962,0.00028393796,0.0000570679,0.03828826,0.0018617591,0.9333434,0.025880285,0.0000308727],"about_ca_topic_score_codex":0.001100483,"about_ca_topic_score_gemma":0.001396723,"teacher_disagreement_score":0.018723559,"about_ca_system_score_codex":0.001211307,"about_ca_system_score_gemma":0.0007555514,"threshold_uncertainty_score":0.062636495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90755075,0.0003308279,0.04567545,0.00021358104,0.00011184001,0.000028387802,0.00033041454,0.00028830266,0.04547045],"genre_scores_gemma":[0.9812687,0.00017451246,0.008166954,0.00007634689,0.00006665785,0.00004469711,0.00039168008,0.00006666878,0.009743638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995515,0.000087420274,0.000041049207,0.00011411642,0.00010280223,0.00010301923],"domain_scores_gemma":[0.99877304,0.00038775426,0.0002386743,0.0001175866,0.0001526617,0.00033021468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037459686,0.000331526,0.0002961335,0.0023760928,0.0014995693,0.0028599696,0.00050632143,0.000608038,0.004970674],"category_scores_gemma":[0.0013022101,0.00026348943,0.00040764036,0.0012281997,0.0017334297,0.002950107,0.001205553,0.00076566066,0.00066166214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006273126,0.00005684385,0.0030383859,0.000040673393,0.000009463446,0.00046917834,0.00055902434,0.0009619632,0.0044592093,0.9806137,0.0009000508,0.008828696],"study_design_scores_gemma":[0.0000128931515,0.000051307947,0.002042817,0.00004428445,0.000017353337,0.0008279352,0.00053201173,0.0063793478,0.0038559227,0.9758533,0.0103557175,0.000027117385],"about_ca_topic_score_codex":0.0004885447,"about_ca_topic_score_gemma":0.0007255466,"teacher_disagreement_score":0.004970674,"about_ca_system_score_codex":0.00071401,"about_ca_system_score_gemma":0.0003505305,"threshold_uncertainty_score":0.016628563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7599278,0.00032642853,0.18322793,0.0003607292,0.00016962239,0.00009744849,0.00019685381,0.00040488562,0.055288445],"genre_scores_gemma":[0.94481266,0.00029211774,0.043534342,0.00008023231,0.000112576316,0.00011247158,0.00025306302,0.00025248877,0.010549995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999721,0.000065412896,0.000011476024,0.000033811233,0.00012373038,0.000044586715],"domain_scores_gemma":[0.9995734,0.00017543859,0.00005806476,0.000055942888,0.00007406862,0.000063008265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055460574,0.0008311508,0.0006598108,0.0023954154,0.00074997265,0.0016853606,0.0010333813,0.0005693679,0.007016465],"category_scores_gemma":[0.002311633,0.00021793909,0.0005517524,0.0010202626,0.001070048,0.00182093,0.0011327794,0.001001323,0.0010632013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069929425,0.00014109598,0.0013766717,0.00013101492,0.000023513127,0.0003661242,0.0005712279,0.01694677,0.008865827,0.92754436,0.0019203003,0.04204321],"study_design_scores_gemma":[0.00004610989,0.00005635156,0.0007542284,0.000041017247,0.000025163408,0.0003891604,0.00023135802,0.15433083,0.010396913,0.8282695,0.005404029,0.0000553751],"about_ca_topic_score_codex":0.00044984365,"about_ca_topic_score_gemma":0.0009247661,"teacher_disagreement_score":0.007016465,"about_ca_system_score_codex":0.0007856109,"about_ca_system_score_gemma":0.00038883393,"threshold_uncertainty_score":0.023472369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51524884,0.00063901686,0.42407975,0.00048701724,0.00009108182,0.00017223935,0.0004389859,0.0005164026,0.058326636],"genre_scores_gemma":[0.8939825,0.00025223542,0.09795282,0.00014232328,0.000045833523,0.000168177,0.0002728965,0.0000669747,0.007116222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991217,0.00017939923,0.000054794662,0.00020417971,0.00020264296,0.00023730028],"domain_scores_gemma":[0.9966271,0.0011492709,0.00049545744,0.0011865258,0.00030396463,0.00023779088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146125,0.0004224064,0.0005213567,0.00074757903,0.0012880382,0.0015143328,0.00093489664,0.0010114913,0.004498226],"category_scores_gemma":[0.0038163138,0.00038178838,0.0005804667,0.0006354301,0.00151802,0.001838297,0.0014460862,0.0017014941,0.00066266936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001876483,0.000055484023,0.0012315011,0.00011577061,0.00002063235,0.00022972608,0.000342541,0.010029369,0.018821206,0.9384766,0.0012720966,0.02921743],"study_design_scores_gemma":[0.00013128661,0.00031994312,0.00096126756,0.00011670705,0.000049474074,0.0015405882,0.00034238328,0.08624465,0.06821053,0.81321436,0.028792502,0.00007638041],"about_ca_topic_score_codex":0.0002043087,"about_ca_topic_score_gemma":0.00035186386,"teacher_disagreement_score":0.004498226,"about_ca_system_score_codex":0.0011289363,"about_ca_system_score_gemma":0.00053268886,"threshold_uncertainty_score":0.015048027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772038,0.00036653824,0.045999836,0.0005381642,0.00018683326,0.000027436989,0.00028794017,0.00009576433,0.07529363],"genre_scores_gemma":[0.973179,0.00026947752,0.010089,0.000115097086,0.00007013616,0.00002773501,0.0003167602,0.000051517076,0.015881216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999711,0.000037031725,0.000020372627,0.00006198188,0.000084868465,0.00008470383],"domain_scores_gemma":[0.99957484,0.0001582855,0.000073658266,0.00005307405,0.00006360825,0.0000765686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030015927,0.00026969763,0.00035002423,0.0010429304,0.00068267883,0.0011435683,0.0006530866,0.00036965092,0.007900478],"category_scores_gemma":[0.0011761318,0.00014152589,0.00027885684,0.0007305904,0.0012245505,0.0023181348,0.0008619825,0.0007643823,0.00090003415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071541486,0.000015471136,0.0009583772,0.000034649416,0.0000041378526,0.00015730762,0.00021222446,0.0013126676,0.002894809,0.97511476,0.0010161082,0.018207926],"study_design_scores_gemma":[0.000016210151,0.00005255005,0.0017063123,0.000017670414,0.000009333,0.00048312743,0.00024087394,0.008352515,0.0061136754,0.9712532,0.011718542,0.000036020017],"about_ca_topic_score_codex":0.0006461633,"about_ca_topic_score_gemma":0.0006762178,"teacher_disagreement_score":0.007900478,"about_ca_system_score_codex":0.00050896825,"about_ca_system_score_gemma":0.0002754285,"threshold_uncertainty_score":0.026429713},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15540299,0.0019057819,0.2610868,0.0038923342,0.00085696706,0.000079937665,0.00041989124,0.00088553294,0.5754698],"genre_scores_gemma":[0.8321351,0.0010218654,0.075440064,0.001908083,0.00032497756,0.00021372123,0.0003026889,0.0003210711,0.08833259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961925,0.00009562385,0.000015131883,0.00005651474,0.00014253744,0.00007095671],"domain_scores_gemma":[0.99960726,0.00008417423,0.000034929115,0.00008310151,0.00009060407,0.00009999026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046201635,0.0002604885,0.0004007085,0.00082608557,0.0018658902,0.0019161865,0.0006542307,0.0012044878,0.011363466],"category_scores_gemma":[0.00094876275,0.00021878709,0.00045282644,0.0007385398,0.0019519224,0.0033992103,0.0015426419,0.0015002813,0.0019262681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051890856,0.000005539584,0.00004266543,0.000007911399,9.215434e-7,0.000023398781,0.000044436125,0.00018466786,0.00039068135,0.9972162,0.0007708623,0.0013074243],"study_design_scores_gemma":[0.000011185661,0.0000134433785,0.000081439175,0.000021295247,0.0000024052204,0.00016330491,0.00010318338,0.0050919275,0.00039476564,0.97306675,0.021039778,0.000010417099],"about_ca_topic_score_codex":0.0015266691,"about_ca_topic_score_gemma":0.0020308518,"teacher_disagreement_score":0.011363466,"about_ca_system_score_codex":0.0009922624,"about_ca_system_score_gemma":0.0011353656,"threshold_uncertainty_score":0.03801459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7273784,0.00092005933,0.17971776,0.0021978165,0.0004768392,0.00007329154,0.00022845308,0.00097284187,0.08803455],"genre_scores_gemma":[0.9331231,0.0009407721,0.028561391,0.00027466525,0.00025721337,0.000085429965,0.00017084111,0.000658714,0.03592785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925417,0.00013222886,0.00003486919,0.00017273598,0.00025569266,0.0001501346],"domain_scores_gemma":[0.9982551,0.00079167116,0.00016869209,0.00026796898,0.0003243733,0.0001921524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012026718,0.0007585742,0.0006157089,0.002221953,0.001121224,0.002157114,0.00073419564,0.0011788994,0.0076311957],"category_scores_gemma":[0.006204593,0.0008087534,0.00065736135,0.00088807446,0.00309738,0.0049256417,0.00184651,0.0019106959,0.0012928692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005089483,0.00002279194,0.00083417696,0.00006879336,0.000015530086,0.00031008793,0.0004300118,0.003053674,0.008139539,0.9722621,0.0013594067,0.013453051],"study_design_scores_gemma":[0.000024911844,0.00003398612,0.0014485416,0.000043360058,0.000023907092,0.00063989894,0.00031877504,0.028429765,0.00862502,0.94676846,0.013583563,0.000059820446],"about_ca_topic_score_codex":0.0005728675,"about_ca_topic_score_gemma":0.0007091272,"teacher_disagreement_score":0.0076311957,"about_ca_system_score_codex":0.00086662156,"about_ca_system_score_gemma":0.00039838205,"threshold_uncertainty_score":0.025528848},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028644487,0.000071172275,0.9641961,0.00013599571,0.000036657173,0.00005213052,0.000044402164,0.00021460255,0.0066045374],"genre_scores_gemma":[0.29024246,0.00017827644,0.6991134,0.00019064789,0.00006229937,0.00031526203,0.00017172855,0.000497833,0.009228076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987727,0.00031072632,0.000071828516,0.00022639133,0.00042349714,0.00019490076],"domain_scores_gemma":[0.99845326,0.00079806644,0.0001500546,0.00035033212,0.00016030685,0.00008791198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017066363,0.0006305871,0.0009177235,0.0008906603,0.0011883649,0.0013503387,0.0020704584,0.0017456248,0.0058778496],"category_scores_gemma":[0.0066420254,0.00057843403,0.001977698,0.0009829904,0.0022918275,0.0032367846,0.0025333492,0.0027784482,0.0011112007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003136543,0.00005291587,0.0006938676,0.000084282525,0.000023142291,0.00015437914,0.00065426907,0.059293926,0.007880861,0.9036163,0.00083084684,0.026683927],"study_design_scores_gemma":[0.000021031035,0.000039270915,0.00018007241,0.00003698133,0.000024376799,0.00011326198,0.00012495885,0.39911973,0.0039799046,0.58826166,0.008063573,0.00003528911],"about_ca_topic_score_codex":0.0017390804,"about_ca_topic_score_gemma":0.0039755953,"teacher_disagreement_score":0.0058778496,"about_ca_system_score_codex":0.0012108053,"about_ca_system_score_gemma":0.0015265058,"threshold_uncertainty_score":0.019663393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8012376,0.001248339,0.12750316,0.0065955976,0.00039111305,0.00007231331,0.0015892508,0.00072670984,0.06063593],"genre_scores_gemma":[0.98218185,0.00026740282,0.010953873,0.0010773815,0.00018539894,0.0001209755,0.00057923223,0.000096847245,0.004537088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969867,0.0006472285,0.00023110701,0.00088260113,0.00065023714,0.0006020565],"domain_scores_gemma":[0.9898789,0.0062070605,0.00081212673,0.0018981779,0.00050850096,0.0006953228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029950023,0.0007146935,0.0014817711,0.0012406004,0.0027187439,0.004059006,0.0014582326,0.0020507309,0.009279948],"category_scores_gemma":[0.013200442,0.0008092163,0.0011191352,0.001613208,0.004531481,0.008103065,0.0030433105,0.002312392,0.0013535641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019056717,0.00018538724,0.011519675,0.00029051496,0.00007222343,0.00059244083,0.0013456914,0.010818381,0.009986591,0.9228468,0.01129022,0.029146438],"study_design_scores_gemma":[0.0001842272,0.00013796809,0.0022868311,0.00007160736,0.000052694315,0.0013289,0.00040751896,0.024919823,0.0057393257,0.95309603,0.0117113395,0.00006378652],"about_ca_topic_score_codex":0.0012463595,"about_ca_topic_score_gemma":0.0010286499,"teacher_disagreement_score":0.009279948,"about_ca_system_score_codex":0.001885506,"about_ca_system_score_gemma":0.00094660925,"threshold_uncertainty_score":0.031044483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73905647,0.0008125562,0.18731122,0.0006318166,0.00016446451,0.00007003934,0.00050448196,0.00024692438,0.071201965],"genre_scores_gemma":[0.95624614,0.00040544002,0.027955279,0.00012538284,0.000035984365,0.000061781815,0.0004164756,0.00008610782,0.014667382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996408,0.000049795788,0.000016591324,0.00007472539,0.00010222481,0.00011580308],"domain_scores_gemma":[0.99951017,0.000092759765,0.00007804283,0.000055785018,0.00007754938,0.00018562899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002828187,0.0004786238,0.0003005258,0.0012919841,0.0010522427,0.0022290216,0.0007458072,0.0005045598,0.006325159],"category_scores_gemma":[0.0011146181,0.00038122942,0.00028663783,0.00087881833,0.001581308,0.0024361403,0.0019016992,0.0011520627,0.00077706564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039268674,0.000015694837,0.000728429,0.000031222142,0.0000055161568,0.00014770064,0.00031528436,0.0015270427,0.004117163,0.9777475,0.00088160386,0.01444352],"study_design_scores_gemma":[0.000022858036,0.000028599616,0.0008724683,0.000028328572,0.000009746318,0.0002447054,0.0004465523,0.013364285,0.008083597,0.9605092,0.016357854,0.00003174396],"about_ca_topic_score_codex":0.001987864,"about_ca_topic_score_gemma":0.002038624,"teacher_disagreement_score":0.006325159,"about_ca_system_score_codex":0.0009768268,"about_ca_system_score_gemma":0.00039487024,"threshold_uncertainty_score":0.021159768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25260547,0.0042210477,0.65483457,0.0064591854,0.0003692143,0.0001633084,0.0006158674,0.00046471375,0.08026667],"genre_scores_gemma":[0.7714905,0.0022341567,0.19420755,0.0010917232,0.00076891994,0.00032613464,0.0005267636,0.00025700603,0.029097177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949396,0.0001523565,0.0000295989,0.00008965506,0.00014308351,0.000091372276],"domain_scores_gemma":[0.99854493,0.00094722793,0.00010721887,0.00015755268,0.00015314034,0.00008987112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012503369,0.0004768887,0.0009562324,0.0028319207,0.0015847989,0.0019676154,0.0016549196,0.0017862057,0.005352245],"category_scores_gemma":[0.005523319,0.00035743258,0.0011366631,0.0018498632,0.0030281502,0.0050750365,0.0015675013,0.0020256264,0.00046717818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048832953,0.000005603438,0.000104949744,0.000027150294,0.0000033562878,0.00001527714,0.00006019077,0.0025555245,0.00017761867,0.9937657,0.0006576001,0.0026221077],"study_design_scores_gemma":[0.00000403944,0.0000036339795,0.00007007829,0.0000097341635,0.0000024828212,0.000027686849,0.000026396485,0.02111387,0.00017526736,0.9773071,0.0012546206,0.000005123863],"about_ca_topic_score_codex":0.0013411095,"about_ca_topic_score_gemma":0.0013398813,"teacher_disagreement_score":0.005352245,"about_ca_system_score_codex":0.002565313,"about_ca_system_score_gemma":0.0008733065,"threshold_uncertainty_score":0.018612683},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35676438,0.0016433368,0.20869839,0.0023751017,0.0009823852,0.00017601065,0.0020355233,0.001548543,0.4257763],"genre_scores_gemma":[0.8785114,0.0005369438,0.05746043,0.0005818609,0.00018453001,0.0002214398,0.0019105505,0.0005041329,0.060088776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920696,0.00010818054,0.000044173492,0.00022435033,0.00021144535,0.00020487653],"domain_scores_gemma":[0.9983132,0.0006035318,0.00011905179,0.0003323834,0.00030588984,0.0003260198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056178577,0.00041820086,0.0005009799,0.001282367,0.0011605446,0.0022384897,0.0008048099,0.00072223076,0.034611158],"category_scores_gemma":[0.0047223996,0.00041219158,0.0005244124,0.00088121515,0.0014784054,0.0030971635,0.0020374244,0.0014607441,0.004366298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015242399,0.000022877895,0.0010063794,0.000083935236,0.000009413896,0.00010252722,0.00033917997,0.003076578,0.0028061492,0.9508308,0.008701053,0.03286859],"study_design_scores_gemma":[0.000052790594,0.000057974208,0.0013143157,0.000071216724,0.000016475977,0.00032390477,0.00049156393,0.021867063,0.0038138696,0.9281675,0.043802027,0.000021319709],"about_ca_topic_score_codex":0.00081149774,"about_ca_topic_score_gemma":0.0011462327,"teacher_disagreement_score":0.034611158,"about_ca_system_score_codex":0.0012928629,"about_ca_system_score_gemma":0.00047871002,"threshold_uncertainty_score":0.1157859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15206227,0.011846967,0.49525592,0.00798091,0.0015909144,0.00015189365,0.0011144483,0.0006509807,0.32934573],"genre_scores_gemma":[0.8377967,0.010841417,0.09486331,0.0032481553,0.0029797922,0.00067260413,0.0012650284,0.00076600997,0.04756701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969656,0.00069560815,0.000115655734,0.0008543872,0.0008635849,0.0005051881],"domain_scores_gemma":[0.98455435,0.010905704,0.0010257255,0.0014421714,0.0008915159,0.0011805848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018413286,0.0014122522,0.0015424554,0.004852312,0.0030021786,0.003695619,0.0027517225,0.0024872345,0.014026661],"category_scores_gemma":[0.019845877,0.0007197943,0.0010485427,0.0028354928,0.0073321913,0.015972944,0.006849043,0.0074924678,0.0030690182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003451313,0.000016531934,0.00035469886,0.000087492146,0.000006101133,0.000045941888,0.00018083156,0.0034427792,0.0007571215,0.98424226,0.0033101654,0.007521525],"study_design_scores_gemma":[0.000008199095,0.0000210317,0.00039291676,0.00006296001,0.000010545481,0.00015004305,0.00008409905,0.009908085,0.00060356787,0.9747683,0.013966918,0.000023422737],"about_ca_topic_score_codex":0.0008776338,"about_ca_topic_score_gemma":0.00062516733,"teacher_disagreement_score":0.014026661,"about_ca_system_score_codex":0.0021194506,"about_ca_system_score_gemma":0.00068985374,"threshold_uncertainty_score":0.046923876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24563882,0.00353414,0.62106484,0.0029680969,0.00089779886,0.000273102,0.0013516442,0.0015957579,0.1226758],"genre_scores_gemma":[0.7513624,0.0023295437,0.19830696,0.0011547969,0.0013436438,0.00078737544,0.0022967588,0.0011418434,0.041276745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951349,0.0012086593,0.00027131508,0.00090965664,0.001931876,0.00054358895],"domain_scores_gemma":[0.9839236,0.009967291,0.00096030673,0.0024275067,0.0020692125,0.0006521606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017596595,0.0008424195,0.0014243103,0.0036290952,0.0018481622,0.0037106974,0.0028203789,0.0015088732,0.015535608],"category_scores_gemma":[0.027259834,0.000707926,0.0007875504,0.0033194497,0.0031500778,0.012643317,0.003991586,0.0019292339,0.0031427613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033506923,0.00010460384,0.0052645844,0.00046800092,0.00005271642,0.00046685437,0.00049165473,0.010416965,0.008495782,0.8626038,0.016837297,0.094462745],"study_design_scores_gemma":[0.00003346589,0.000072697665,0.0013013369,0.00009960968,0.000044971523,0.0016687084,0.00019020878,0.08032284,0.008274298,0.8890015,0.01893906,0.000051313065],"about_ca_topic_score_codex":0.00059012516,"about_ca_topic_score_gemma":0.00065236347,"teacher_disagreement_score":0.015535608,"about_ca_system_score_codex":0.0011748082,"about_ca_system_score_gemma":0.00086997193,"threshold_uncertainty_score":0.051971853},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61481476,0.00046023476,0.29912183,0.0012804571,0.00012338905,0.00022135479,0.0015368373,0.0015662104,0.08087489],"genre_scores_gemma":[0.92058176,0.00030873562,0.066621065,0.0002680457,0.000056289857,0.00015482672,0.0013641035,0.00016805175,0.010477129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.00014564903,0.000054946067,0.0002820006,0.00022980994,0.00015911077],"domain_scores_gemma":[0.9949479,0.0021582753,0.0005041691,0.00096081727,0.00090270845,0.0005261128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520061,0.0005818301,0.00046569333,0.0009851416,0.0011627837,0.0012686937,0.0010175612,0.00059581717,0.0060713096],"category_scores_gemma":[0.002921928,0.00045204494,0.0008237876,0.0010540356,0.002004141,0.0035494484,0.0020902895,0.0010566143,0.0006972011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045222742,0.00016771877,0.0078953365,0.00061465957,0.00010380252,0.0011109035,0.001822216,0.02923926,0.03826712,0.85422295,0.0058619017,0.06024198],"study_design_scores_gemma":[0.000071917944,0.0001867314,0.0036991513,0.00009432364,0.00009973217,0.0013897314,0.00095372344,0.08061356,0.030442866,0.8464573,0.03592555,0.000065336935],"about_ca_topic_score_codex":0.001546122,"about_ca_topic_score_gemma":0.0024751942,"teacher_disagreement_score":0.0060713096,"about_ca_system_score_codex":0.0015054975,"about_ca_system_score_gemma":0.0010756877,"threshold_uncertainty_score":0.020310521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137757,0.003470323,0.4470725,0.0050587007,0.00023540619,0.00019134983,0.00079348654,0.0009628761,0.02843958],"genre_scores_gemma":[0.96889347,0.0013545888,0.0197804,0.00045004062,0.00020141828,0.00017431017,0.00031368798,0.00020631634,0.008625759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675214,0.0014241863,0.000120268385,0.0007319361,0.0004355897,0.00053595746],"domain_scores_gemma":[0.9677394,0.022916907,0.00319766,0.0026861953,0.0012005528,0.0022593169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006564651,0.0011774404,0.0027340958,0.0024051254,0.002208166,0.0031556648,0.0035330632,0.0028016716,0.0077181025],"category_scores_gemma":[0.031171575,0.001237296,0.0021632325,0.0018916703,0.005816498,0.0081904195,0.003208236,0.0034862095,0.0013332792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024982163,0.00005240567,0.0019194352,0.00011825669,0.00007385649,0.0004574242,0.0005306985,0.039513472,0.0011684658,0.94823325,0.0024673645,0.005215516],"study_design_scores_gemma":[0.00013543954,0.000060280032,0.0006860575,0.000045519067,0.000045946923,0.0002408108,0.00013688154,0.21507803,0.0004158465,0.781144,0.0019434124,0.0000677682],"about_ca_topic_score_codex":0.0029824688,"about_ca_topic_score_gemma":0.002893744,"teacher_disagreement_score":0.0077181025,"about_ca_system_score_codex":0.0022684906,"about_ca_system_score_gemma":0.00087389426,"threshold_uncertainty_score":0.03471756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801422,0.0004536625,0.07884996,0.00030366244,0.000039621125,0.000022193137,0.0001453383,0.00014055042,0.03990272],"genre_scores_gemma":[0.99032307,0.00017832356,0.006380096,0.00004605952,0.000048190937,0.000012237855,0.00011332796,0.000014466355,0.0028841952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969435,0.000045248013,0.00001783823,0.00007397663,0.00009271283,0.00007584839],"domain_scores_gemma":[0.9989536,0.00037949256,0.00021959638,0.00009121877,0.00013074426,0.00022530081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195891,0.00028179862,0.00026088994,0.0015802198,0.0007204013,0.0013893018,0.0004477292,0.00035366442,0.0026604205],"category_scores_gemma":[0.0011108425,0.00020715575,0.00027090887,0.0008274186,0.001127364,0.0020972406,0.0011184643,0.000744358,0.00018771167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003469607,0.000019289038,0.0011127165,0.000022427248,0.0000079166575,0.00021369892,0.00031444646,0.0020330264,0.0033539918,0.9866476,0.00036317576,0.0058770403],"study_design_scores_gemma":[0.000010968504,0.000025682562,0.0015306288,0.000017349837,0.000021149244,0.00039181797,0.00031648728,0.024582595,0.0031880834,0.9654215,0.0044789715,0.00001483815],"about_ca_topic_score_codex":0.00067008124,"about_ca_topic_score_gemma":0.001120997,"teacher_disagreement_score":0.0026604205,"about_ca_system_score_codex":0.0007128844,"about_ca_system_score_gemma":0.00024413201,"threshold_uncertainty_score":0.008899987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6707298,0.0011385535,0.2529429,0.0056960615,0.00017731877,0.0001544167,0.00060828915,0.00029594504,0.0682567],"genre_scores_gemma":[0.9544798,0.00049730507,0.039254546,0.0004222336,0.00014632025,0.00015928008,0.00021177954,0.00013936873,0.0046893866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841,0.00059646403,0.000043643424,0.00037873903,0.0002452908,0.00032576828],"domain_scores_gemma":[0.9890387,0.0075213886,0.00097562897,0.0011783757,0.00045859025,0.00082725927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020288927,0.0006336467,0.00080617314,0.0019186293,0.0030013453,0.0025999818,0.0015618883,0.0015295532,0.0061665513],"category_scores_gemma":[0.00857051,0.00048428235,0.00066718826,0.0015253266,0.008539109,0.008599585,0.0025294202,0.0026519203,0.0004422514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007602891,0.000026725387,0.0004897991,0.000039288756,0.00000927584,0.00003239893,0.00017348854,0.011676588,0.0020074872,0.9823124,0.0007868719,0.0023696346],"study_design_scores_gemma":[0.000032109834,0.000032626904,0.0004925271,0.000023771556,0.000013414417,0.00007071992,0.00013458324,0.057062063,0.0012015229,0.9385074,0.0023991922,0.000030058058],"about_ca_topic_score_codex":0.0027123608,"about_ca_topic_score_gemma":0.0021259412,"teacher_disagreement_score":0.0061665513,"about_ca_system_score_codex":0.0038109336,"about_ca_system_score_gemma":0.0014267648,"threshold_uncertainty_score":0.027650356},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2451691,0.0005402813,0.7378597,0.0002225879,0.00008064029,0.00014449332,0.0015008393,0.0010242354,0.013458058],"genre_scores_gemma":[0.75095457,0.00041752667,0.24166334,0.00012319897,0.00006267443,0.00014259256,0.0024625207,0.000094140676,0.0040793386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996215,0.000046944784,0.00003084983,0.00016054802,0.00009176217,0.00004831677],"domain_scores_gemma":[0.99870706,0.0004271031,0.0002961417,0.0002771327,0.00018361918,0.00010904921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019097826,0.00024899121,0.00020779828,0.0009286432,0.00041568434,0.0010479066,0.0006037347,0.00033736136,0.0025731714],"category_scores_gemma":[0.0019049648,0.00023103919,0.0003407321,0.0010317031,0.0005174268,0.0013790894,0.00045695773,0.0007038615,0.00040706698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033323176,0.00021466026,0.010851017,0.0005247601,0.00004627233,0.0006845833,0.0008305676,0.041769195,0.06491441,0.6204632,0.0063621937,0.25300592],"study_design_scores_gemma":[0.00007178193,0.00022377787,0.008010943,0.00011972507,0.00007476272,0.002233387,0.000685477,0.31828448,0.051027488,0.55677766,0.06238363,0.00010688053],"about_ca_topic_score_codex":0.0011055756,"about_ca_topic_score_gemma":0.0016696992,"teacher_disagreement_score":0.0025731714,"about_ca_system_score_codex":0.00052394246,"about_ca_system_score_gemma":0.00046834975,"threshold_uncertainty_score":0.008608103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85365075,0.0028941708,0.119633846,0.0010864517,0.00006314193,0.00002739567,0.00094484055,0.00024238293,0.02145703],"genre_scores_gemma":[0.9748917,0.0006656967,0.021855526,0.00014281095,0.000053478467,0.00004459243,0.0005772344,0.00007364287,0.0016953617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991441,0.00020906507,0.000041980707,0.00027660906,0.00015436101,0.00017394978],"domain_scores_gemma":[0.9952266,0.0029609222,0.00050407083,0.00061460864,0.00027212765,0.0004215963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006839937,0.00042876825,0.0005242477,0.0010490692,0.00091323216,0.0018003818,0.0008395116,0.0005091218,0.0030312021],"category_scores_gemma":[0.0033454783,0.0005363735,0.00060255994,0.0012897478,0.0019414482,0.0042978083,0.0019035772,0.0013292846,0.0002739629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071390247,0.00012649017,0.022545522,0.00037733,0.00010808089,0.000369265,0.0012162544,0.034421075,0.02173784,0.85968506,0.009393163,0.049306106],"study_design_scores_gemma":[0.000044952103,0.00011755822,0.009985396,0.000066566245,0.000076914,0.001528523,0.0005069009,0.12070924,0.010404107,0.8408274,0.015676538,0.00005595207],"about_ca_topic_score_codex":0.00086421287,"about_ca_topic_score_gemma":0.0009155837,"teacher_disagreement_score":0.0030312021,"about_ca_system_score_codex":0.00097273756,"about_ca_system_score_gemma":0.00032609177,"threshold_uncertainty_score":0.010140359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76360416,0.0006412621,0.17365792,0.00063371897,0.0002870155,0.00009327435,0.0005314772,0.00034648454,0.060204767],"genre_scores_gemma":[0.9456341,0.0004303307,0.04085797,0.0001352565,0.00015485154,0.00015150147,0.0005496625,0.00016442774,0.011921805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992698,0.000107218046,0.00005204502,0.00015140354,0.00024492113,0.00017464123],"domain_scores_gemma":[0.9984847,0.00068181887,0.00016181845,0.00021495642,0.00023531694,0.00022147509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052350113,0.00040665877,0.0006450072,0.0016021521,0.0013382591,0.0021982694,0.001276989,0.00086365436,0.009311108],"category_scores_gemma":[0.005357507,0.00043571176,0.000508862,0.0014239454,0.001539839,0.0032144666,0.0014855448,0.0008110293,0.00082657306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011506245,0.00003737901,0.004167368,0.00017346098,0.000023258697,0.00028527458,0.00055237516,0.010121114,0.013737647,0.94024265,0.0044045127,0.026139962],"study_design_scores_gemma":[0.000035166988,0.00006461195,0.0028849335,0.000084679115,0.000050275805,0.001070836,0.0005399087,0.13958059,0.016479097,0.8244065,0.014732256,0.00007120123],"about_ca_topic_score_codex":0.0008116625,"about_ca_topic_score_gemma":0.0012537983,"teacher_disagreement_score":0.009311108,"about_ca_system_score_codex":0.00075760373,"about_ca_system_score_gemma":0.0003339785,"threshold_uncertainty_score":0.031148791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53874165,0.00076035806,0.24672464,0.0016733486,0.00023280595,0.00020404658,0.0005150633,0.0004886386,0.2106595],"genre_scores_gemma":[0.956873,0.0001939162,0.02651019,0.00023173609,0.000046143243,0.00014796441,0.0002707637,0.00013193703,0.015594369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666876,0.000762358,0.00022819453,0.0006348726,0.00096210197,0.0007436044],"domain_scores_gemma":[0.9953998,0.0022137938,0.0004102718,0.0005419465,0.0005559454,0.00087823224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020658653,0.00069486914,0.0011287772,0.0016700927,0.0041525923,0.0061830347,0.0023448027,0.0022872004,0.01022214],"category_scores_gemma":[0.007864084,0.0006907188,0.0011266029,0.0010213008,0.006035865,0.0076309717,0.0074559343,0.0028405858,0.0015495406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004773348,0.000015393758,0.00020643225,0.000023949586,0.000008619105,0.00007882419,0.0003777207,0.0011523572,0.00072742713,0.99431926,0.00028241653,0.0027598978],"study_design_scores_gemma":[0.000021230884,0.0000238728,0.00016654709,0.000016107826,0.00000986731,0.000104539555,0.00028593905,0.0080057075,0.0011115285,0.9850581,0.0051744767,0.000022100536],"about_ca_topic_score_codex":0.0013183232,"about_ca_topic_score_gemma":0.0014633775,"teacher_disagreement_score":0.01022214,"about_ca_system_score_codex":0.0020745944,"about_ca_system_score_gemma":0.001028277,"threshold_uncertainty_score":0.034196436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25816116,0.01404573,0.58176845,0.06183636,0.002278829,0.00018098965,0.0010258441,0.0019491185,0.07875346],"genre_scores_gemma":[0.92010397,0.004480398,0.045793694,0.0057124305,0.004224185,0.00017809005,0.00046879958,0.00060230313,0.018436207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949404,0.0016381203,0.00013931318,0.0015626617,0.0010949337,0.00062448106],"domain_scores_gemma":[0.9383795,0.047718685,0.0025411076,0.007001902,0.0020759576,0.0022828751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005222109,0.0010634991,0.0018604907,0.001892815,0.0029337048,0.0032696303,0.0037451112,0.0025117444,0.007286925],"category_scores_gemma":[0.04523541,0.0008915897,0.0020754782,0.0032217107,0.005181846,0.014435284,0.0033265469,0.008259242,0.0011199777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051842246,0.00025966417,0.0046969517,0.00028201414,0.00019866106,0.00042121895,0.0011583881,0.04391987,0.005516924,0.86427665,0.033536255,0.045215007],"study_design_scores_gemma":[0.00011461164,0.00023345591,0.003704405,0.0000615317,0.00013053545,0.00026571064,0.00015233352,0.19312471,0.0027049882,0.77636635,0.023050977,0.00009043107],"about_ca_topic_score_codex":0.0064195534,"about_ca_topic_score_gemma":0.0031354483,"teacher_disagreement_score":0.007286925,"about_ca_system_score_codex":0.0034619605,"about_ca_system_score_gemma":0.0010089936,"threshold_uncertainty_score":0.027617514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7448085,0.00051027164,0.16828302,0.00068513775,0.0006153947,0.00010436979,0.00024315236,0.0004886594,0.084261514],"genre_scores_gemma":[0.9602187,0.00029798297,0.014294136,0.00019181134,0.0003289139,0.000044802026,0.00015681692,0.00015610563,0.024310762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950576,0.000075814125,0.000031275475,0.00010226833,0.00016291035,0.00012207557],"domain_scores_gemma":[0.9996151,0.000053837513,0.000060433893,0.000057665708,0.00008909958,0.00012385857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044348833,0.00053159223,0.00043071414,0.0012951295,0.0007941066,0.0019190958,0.00047925249,0.00039285925,0.007945914],"category_scores_gemma":[0.00066529383,0.00019033001,0.0004734385,0.000542308,0.0020639314,0.002397295,0.0015192709,0.001206056,0.0011702942],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034521912,0.00001611397,0.00032232678,0.00002550414,0.0000067370243,0.00014515982,0.00025529755,0.00050328684,0.003980729,0.9854828,0.0005080831,0.008719393],"study_design_scores_gemma":[0.00001950319,0.0001252661,0.0014408068,0.000017396544,0.000021338892,0.00072722504,0.0002981382,0.010618683,0.009791746,0.96385294,0.013035507,0.000051504994],"about_ca_topic_score_codex":0.00051612884,"about_ca_topic_score_gemma":0.00049588963,"teacher_disagreement_score":0.007945914,"about_ca_system_score_codex":0.00048084027,"about_ca_system_score_gemma":0.00042257734,"threshold_uncertainty_score":0.026581764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6921692,0.00123156,0.18649219,0.001956665,0.00038397455,0.00007442707,0.00020682489,0.0001640488,0.11732108],"genre_scores_gemma":[0.97179407,0.000691059,0.015600272,0.00021037902,0.00044997904,0.000054413595,0.00012988919,0.000047157733,0.011022885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932027,0.00018888443,0.000025705005,0.00012884595,0.00017726899,0.00015906483],"domain_scores_gemma":[0.9991642,0.00028552464,0.0001852396,0.00006220011,0.00014824384,0.00015456592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061774766,0.0006655447,0.00045652562,0.001456393,0.0014537575,0.0024227616,0.0005373819,0.00065087696,0.0056130965],"category_scores_gemma":[0.0019075795,0.00023677677,0.00056144746,0.0010593322,0.0037994897,0.003914474,0.0017190842,0.00180586,0.00069846533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014950159,0.00000710851,0.00012324004,0.000014613396,0.0000015852611,0.000059589256,0.00013998876,0.000364447,0.0006345246,0.9957801,0.00023735237,0.0026223813],"study_design_scores_gemma":[0.000006839914,0.000027506374,0.00027590225,0.000012599751,0.0000046676514,0.00019502439,0.00024297184,0.0040244963,0.0010859148,0.98944384,0.004662511,0.00001780843],"about_ca_topic_score_codex":0.0006001936,"about_ca_topic_score_gemma":0.00050608424,"teacher_disagreement_score":0.0056130965,"about_ca_system_score_codex":0.0007724366,"about_ca_system_score_gemma":0.000485522,"threshold_uncertainty_score":0.018777668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393069,0.00026892626,0.15064324,0.0005980133,0.00018439772,0.00007584183,0.00030195503,0.0004254364,0.10819532],"genre_scores_gemma":[0.96402186,0.00024358521,0.015308532,0.00014605114,0.00019243151,0.00010836369,0.00026856974,0.00014290889,0.019567689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989837,0.00014802013,0.00006921565,0.0002151061,0.0003317029,0.00025231353],"domain_scores_gemma":[0.9990853,0.00033973507,0.00022113057,0.00011125401,0.00012402194,0.000118579585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005826603,0.00070747983,0.0005217529,0.0015611611,0.0016885616,0.002819163,0.0006611613,0.000654725,0.0061681],"category_scores_gemma":[0.0019399085,0.00038021262,0.0011722144,0.0010044398,0.0033250612,0.003935927,0.0016566522,0.0011704474,0.00088284607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043772205,0.000030324429,0.0006004149,0.000024679062,0.000005365408,0.00024429595,0.00028705597,0.002533526,0.0021601706,0.9884637,0.00047118834,0.0051355106],"study_design_scores_gemma":[0.000024335579,0.000052855296,0.00068614265,0.000019816278,0.000018553212,0.0005284865,0.00016606705,0.01266302,0.004357825,0.9723786,0.0090658115,0.000038569215],"about_ca_topic_score_codex":0.0008405894,"about_ca_topic_score_gemma":0.00082900637,"teacher_disagreement_score":0.0061681,"about_ca_system_score_codex":0.001061762,"about_ca_system_score_gemma":0.0009070439,"threshold_uncertainty_score":0.020634353},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5440071,0.0035047347,0.2918589,0.002637425,0.00038988204,0.00019014094,0.00064761547,0.0007375553,0.15602668],"genre_scores_gemma":[0.9526939,0.0008411699,0.030406835,0.00031869806,0.00015071871,0.000080197315,0.00020641334,0.00006926507,0.015232775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991968,0.00014059238,0.000050117378,0.00017281668,0.0002457488,0.0001939424],"domain_scores_gemma":[0.99879885,0.0004971754,0.00024067202,0.00015060812,0.00017395236,0.00013873137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097594963,0.00036636964,0.000493525,0.001361966,0.0013003245,0.002085471,0.0006762481,0.0009967416,0.008884144],"category_scores_gemma":[0.0064017824,0.0003046493,0.00067101367,0.0011826121,0.0020079785,0.0035887703,0.0016108449,0.001223587,0.0018884877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038874077,0.000009891654,0.00022638415,0.00003985185,0.0000033596812,0.000083505394,0.00020989511,0.0009996741,0.0013485488,0.9872305,0.0006595969,0.009149904],"study_design_scores_gemma":[0.000020097948,0.000030900974,0.00039512583,0.00003267138,0.0000101421465,0.0002596039,0.00013174028,0.004567393,0.0013880596,0.98233837,0.010804247,0.000021529913],"about_ca_topic_score_codex":0.00104268,"about_ca_topic_score_gemma":0.0009478958,"teacher_disagreement_score":0.008884144,"about_ca_system_score_codex":0.0013973182,"about_ca_system_score_gemma":0.0006485321,"threshold_uncertainty_score":0.029720366},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5844605,0.0011941739,0.35660222,0.0018113356,0.00011354841,0.000106423984,0.00082374073,0.0005864444,0.054301642],"genre_scores_gemma":[0.9550959,0.00041557912,0.037122633,0.00019753443,0.00012075129,0.00012313761,0.00058750313,0.00012828229,0.00620865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914336,0.00013111989,0.00006200367,0.00020127311,0.000263621,0.00019859252],"domain_scores_gemma":[0.99676776,0.002212972,0.0002884713,0.000243573,0.00036233373,0.00012485251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085964205,0.0004973007,0.00046327608,0.0016556721,0.00086095894,0.0015536702,0.0010933768,0.0006781123,0.0042476715],"category_scores_gemma":[0.005002142,0.00034757072,0.0009985922,0.0016456344,0.0017083153,0.0028451073,0.0011675534,0.002417334,0.0005956991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044476932,0.000050375755,0.0014027612,0.00007251488,0.0000144435535,0.00025799457,0.0006209344,0.004593789,0.0063543404,0.961118,0.002166842,0.023303447],"study_design_scores_gemma":[0.000021274205,0.00002569607,0.0008165194,0.000017460776,0.000020840214,0.00033833538,0.00012777337,0.033743426,0.004913169,0.9572486,0.0026953777,0.00003145587],"about_ca_topic_score_codex":0.0015847288,"about_ca_topic_score_gemma":0.001741888,"teacher_disagreement_score":0.0042476715,"about_ca_system_score_codex":0.0015684621,"about_ca_system_score_gemma":0.000465611,"threshold_uncertainty_score":0.0142098665},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7497309,0.00026855498,0.22062004,0.0008015113,0.00007240829,0.00007414591,0.00014335093,0.00024490154,0.028044183],"genre_scores_gemma":[0.9817021,0.000101597565,0.013953263,0.0000737845,0.000029625116,0.00004430527,0.0000604636,0.00002976541,0.004005063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989429,0.00022706199,0.000046732202,0.0002908904,0.00020116712,0.00029139465],"domain_scores_gemma":[0.9969893,0.0010194506,0.0005022814,0.00077034923,0.00023146032,0.00048720755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085096736,0.00037225406,0.00042419138,0.0009751446,0.0020145262,0.0017652056,0.0008851923,0.0012275302,0.0060934597],"category_scores_gemma":[0.005018956,0.0003427057,0.0006804441,0.001049514,0.0027856908,0.0048662624,0.0026182027,0.0017505101,0.0005106761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054658252,0.000027789547,0.0007078921,0.000018822437,0.000007920481,0.00007576565,0.00023141365,0.0052659186,0.0022429102,0.98729634,0.0001840239,0.0038865176],"study_design_scores_gemma":[0.000026900654,0.00007265365,0.00057801657,0.000018296725,0.0000132725145,0.00016461607,0.00018228168,0.071999036,0.004209335,0.919147,0.003563797,0.000024888388],"about_ca_topic_score_codex":0.00065339817,"about_ca_topic_score_gemma":0.0003952431,"teacher_disagreement_score":0.0060934597,"about_ca_system_score_codex":0.001107753,"about_ca_system_score_gemma":0.00054466055,"threshold_uncertainty_score":0.02038467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9287205,0.00020679878,0.044015132,0.00015963508,0.000057920075,0.000043559307,0.0001081028,0.000090160196,0.026598249],"genre_scores_gemma":[0.9887438,0.0002453974,0.007696397,0.00006826082,0.000068656205,0.000040100767,0.00015740881,0.000033345426,0.0029466974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993917,0.00006781142,0.000023176204,0.00011910428,0.00019988297,0.00019830665],"domain_scores_gemma":[0.99908185,0.00034566247,0.00017161861,0.00021614105,0.00007723161,0.00010749865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775958,0.0004272863,0.0004258355,0.0008201223,0.0012904862,0.001398123,0.0005741505,0.0005601304,0.0036098408],"category_scores_gemma":[0.0015384855,0.00030103337,0.0006999176,0.00059620634,0.0025596982,0.0019378582,0.002261367,0.0013451147,0.000295568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020891165,0.00006226029,0.004190056,0.00013813314,0.000030080308,0.0016697606,0.0016549653,0.014954517,0.026345674,0.90786785,0.00215898,0.04071894],"study_design_scores_gemma":[0.000066195054,0.0003567084,0.0077811657,0.000081620645,0.00009395751,0.004602419,0.0019786314,0.067507565,0.06423387,0.8250957,0.028023308,0.00017887859],"about_ca_topic_score_codex":0.001241853,"about_ca_topic_score_gemma":0.0007676672,"teacher_disagreement_score":0.0036098408,"about_ca_system_score_codex":0.00050316576,"about_ca_system_score_gemma":0.00031193523,"threshold_uncertainty_score":0.01207608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8915353,0.001148607,0.09417903,0.0005974195,0.0000425825,0.00003605258,0.00045502928,0.00020024124,0.011805736],"genre_scores_gemma":[0.9636509,0.0010966947,0.030233106,0.00014947592,0.00016785174,0.00008583312,0.001207892,0.0001369744,0.0032712966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808633,0.00055962283,0.000097630254,0.0005600062,0.00044555176,0.00025076763],"domain_scores_gemma":[0.98562187,0.009726304,0.0014033346,0.0013675079,0.0008847961,0.0009961957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230207,0.0009059858,0.0010954604,0.0026340054,0.001407786,0.002624778,0.0011012753,0.00087690784,0.0032220094],"category_scores_gemma":[0.007814551,0.0012869488,0.0008681377,0.0025367227,0.0030156274,0.007369449,0.0031443152,0.0015706111,0.00048915955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096416613,0.00016342562,0.01465399,0.00034680846,0.0001659237,0.0019835897,0.0027722605,0.033052962,0.009383227,0.9049742,0.0041768826,0.027362399],"study_design_scores_gemma":[0.000057380938,0.00016758192,0.0048282724,0.00007681011,0.00012667458,0.0018751987,0.0005040281,0.079810925,0.0033563343,0.9037421,0.005412465,0.000042199597],"about_ca_topic_score_codex":0.0010320492,"about_ca_topic_score_gemma":0.0007305782,"teacher_disagreement_score":0.0032220094,"about_ca_system_score_codex":0.00084027776,"about_ca_system_score_gemma":0.00036112516,"threshold_uncertainty_score":0.010778725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57082826,0.00077845214,0.29579034,0.001990559,0.000113791546,0.00010003023,0.0015620375,0.001054139,0.12778243],"genre_scores_gemma":[0.9659931,0.00023985494,0.02431375,0.00019892392,0.00005076037,0.00004625744,0.00041243396,0.00007013801,0.008674813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899274,0.00021759138,0.00006578475,0.00019069498,0.00029970906,0.00023348823],"domain_scores_gemma":[0.9964306,0.0011916723,0.00066210586,0.00058171677,0.00071609893,0.00041787335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071719446,0.000572099,0.0005453403,0.00072875916,0.0009852645,0.0032417746,0.00064213783,0.00067246053,0.007848541],"category_scores_gemma":[0.0029899178,0.0004262095,0.0006081513,0.00076433684,0.0020755336,0.003171989,0.0014590097,0.0014217658,0.0014201954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024398652,0.000039035647,0.0023079296,0.00015361588,0.00003998453,0.000423754,0.00044559367,0.012253307,0.016617307,0.9299113,0.0058800704,0.03168404],"study_design_scores_gemma":[0.0000386517,0.00011650261,0.002480892,0.000046152945,0.000037777765,0.0016640028,0.0006551132,0.07666318,0.023570858,0.8672996,0.027342493,0.00008472028],"about_ca_topic_score_codex":0.0019725873,"about_ca_topic_score_gemma":0.002475669,"teacher_disagreement_score":0.007848541,"about_ca_system_score_codex":0.00089117815,"about_ca_system_score_gemma":0.0006423028,"threshold_uncertainty_score":0.026255965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5263857,0.0011333765,0.29556602,0.013838318,0.0005872813,0.00009219845,0.0009605669,0.001131588,0.16030496],"genre_scores_gemma":[0.9683069,0.00029166776,0.01706941,0.0014945763,0.0002942232,0.000080528866,0.00028475674,0.00010143065,0.012076577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989473,0.00018918217,0.000040517152,0.0004456181,0.00019939226,0.00017805576],"domain_scores_gemma":[0.99461836,0.0022440052,0.00049331994,0.0016840122,0.00059553375,0.00036475595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333229,0.00037516616,0.0008167412,0.00062559673,0.001560956,0.0013121921,0.001775454,0.0013786915,0.011572208],"category_scores_gemma":[0.005685211,0.00032923586,0.00076369214,0.0007988719,0.0027496703,0.006174944,0.0024766594,0.0022796516,0.00116961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022458046,0.00004321141,0.0017641045,0.00022638547,0.00002442162,0.00019975915,0.00063601945,0.008911317,0.0061219814,0.96010816,0.006299467,0.0154405795],"study_design_scores_gemma":[0.000057164416,0.00008853114,0.0016066824,0.000036859543,0.000024199004,0.00033586274,0.00028535197,0.02474582,0.0028632286,0.9544078,0.015510504,0.000037992326],"about_ca_topic_score_codex":0.001153931,"about_ca_topic_score_gemma":0.0013695257,"teacher_disagreement_score":0.011572208,"about_ca_system_score_codex":0.0013506024,"about_ca_system_score_gemma":0.0005724901,"threshold_uncertainty_score":0.03871292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.866774,0.0003404916,0.058477923,0.00042436353,0.00016129766,0.00004785082,0.00009572432,0.0001574053,0.07352081],"genre_scores_gemma":[0.97968376,0.00015534282,0.005407121,0.00007644233,0.000076047494,0.000034503595,0.00007465189,0.000043673153,0.01444844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.000054352615,0.000011631147,0.00008308241,0.000070819646,0.00009285605],"domain_scores_gemma":[0.99978966,0.000039981147,0.00004489439,0.000020389158,0.000022527991,0.00008257964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002493754,0.0004780074,0.00031484832,0.0010832363,0.0015510516,0.0019136018,0.00059411966,0.00043365365,0.0065328307],"category_scores_gemma":[0.0006134345,0.00021270881,0.00044459983,0.00053803023,0.0024033275,0.0027569563,0.0017990179,0.0010990865,0.00048873475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027196704,0.00001215616,0.00045356486,0.000015916796,0.0000031973852,0.00013036489,0.00040519223,0.00096544303,0.0014646533,0.993288,0.000325512,0.0029087758],"study_design_scores_gemma":[0.000025464351,0.00009402965,0.0013968532,0.000019510291,0.000011436195,0.00044484355,0.0009611178,0.007569473,0.0046666265,0.9733236,0.01144558,0.000041500785],"about_ca_topic_score_codex":0.0007280688,"about_ca_topic_score_gemma":0.0007860194,"teacher_disagreement_score":0.0065328307,"about_ca_system_score_codex":0.0008304505,"about_ca_system_score_gemma":0.00035454583,"threshold_uncertainty_score":0.02185446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47767037,0.0013469069,0.3183542,0.0012091185,0.0005089797,0.00010797593,0.00029986879,0.00035671005,0.20014596],"genre_scores_gemma":[0.942217,0.00075320684,0.036002994,0.00029195432,0.00034867995,0.00008721763,0.00022549427,0.00017687908,0.019896606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994271,0.00009993373,0.0000320756,0.000112118214,0.00017105167,0.00015776664],"domain_scores_gemma":[0.99928856,0.00012017161,0.00012067037,0.00013761499,0.00018674346,0.00014622213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070461846,0.00068495946,0.0004754748,0.001578894,0.0013760162,0.00260281,0.0006598362,0.0005751399,0.006029514],"category_scores_gemma":[0.0015896851,0.00032983406,0.0007871058,0.0007913728,0.0032889051,0.0033524607,0.0015413323,0.0015137692,0.0015242347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005410422,0.000005216293,0.00007042621,0.000006805983,7.449934e-7,0.000031205906,0.00009044819,0.0003641339,0.0003631414,0.99660265,0.00025661214,0.002203086],"study_design_scores_gemma":[0.000004240763,0.000014745037,0.0001093241,0.000010534739,0.0000024475728,0.000100588826,0.00010152781,0.004681849,0.0012146033,0.99077344,0.0029758126,0.0000108814265],"about_ca_topic_score_codex":0.0010086318,"about_ca_topic_score_gemma":0.0012592737,"teacher_disagreement_score":0.006029514,"about_ca_system_score_codex":0.00088556856,"about_ca_system_score_gemma":0.00078964955,"threshold_uncertainty_score":0.020170748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5470056,0.00055863796,0.11631527,0.0007569184,0.0007479228,0.00021511958,0.00046580235,0.0003923951,0.33354232],"genre_scores_gemma":[0.92523676,0.00022866372,0.02880279,0.00042463903,0.00015593095,0.00020764921,0.00035381995,0.00030592224,0.0442838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924695,0.00011599017,0.00005038256,0.00012216097,0.00021733418,0.00024713913],"domain_scores_gemma":[0.9994023,0.00016959207,0.000064491425,0.000098963974,0.0001232308,0.00014151567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390597,0.0002758232,0.0005307379,0.0009465357,0.0025915524,0.0024782585,0.00061238883,0.0007030603,0.010063697],"category_scores_gemma":[0.0019584266,0.00035041705,0.0009216589,0.00054945564,0.0026082206,0.0021011133,0.0022831333,0.0015250883,0.0014661149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039886876,0.0000138208925,0.00040062473,0.00002251673,0.0000031514367,0.0001388079,0.00027139529,0.00043863017,0.0015689153,0.99106807,0.0016366045,0.004397577],"study_design_scores_gemma":[0.00004678185,0.000033469725,0.0010498778,0.000038305363,0.000011913278,0.00041475825,0.000641847,0.0052296473,0.0038634764,0.9665595,0.0220681,0.000042375592],"about_ca_topic_score_codex":0.002062036,"about_ca_topic_score_gemma":0.005025433,"teacher_disagreement_score":0.010063697,"about_ca_system_score_codex":0.0009293008,"about_ca_system_score_gemma":0.00063405413,"threshold_uncertainty_score":0.033666432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1261376,0.0011422759,0.8276941,0.006580409,0.00022762029,0.00032388073,0.002501803,0.0012467004,0.0341456],"genre_scores_gemma":[0.9095447,0.0011645107,0.057728413,0.0012322366,0.00043821527,0.0008748252,0.0015238288,0.00020689501,0.02728639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721223,0.0013488553,0.00007061991,0.00058353966,0.00044755155,0.00033724084],"domain_scores_gemma":[0.99141437,0.004355405,0.0011722855,0.0017148816,0.00070397765,0.00063896243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026444043,0.0011797757,0.0015658172,0.0015835667,0.0010852917,0.0026064746,0.0040619043,0.0022611916,0.009375577],"category_scores_gemma":[0.014118384,0.0007533101,0.0010125672,0.0020712635,0.0028323776,0.00613934,0.0020715324,0.0027255374,0.0017166409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006793304,0.000040924326,0.00055200525,0.000038840422,0.000020403071,0.00015925877,0.0000892122,0.07003868,0.0003206095,0.92141426,0.003913488,0.003344389],"study_design_scores_gemma":[0.000056762176,0.000031615513,0.00032144747,0.000013788724,0.000015636895,0.000134106,0.00003878663,0.44967315,0.00019327182,0.5453204,0.0041806153,0.000020524576],"about_ca_topic_score_codex":0.003683799,"about_ca_topic_score_gemma":0.004092456,"teacher_disagreement_score":0.009375577,"about_ca_system_score_codex":0.0026433505,"about_ca_system_score_gemma":0.0007906039,"threshold_uncertainty_score":0.03136444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5205607,0.00087407214,0.27342647,0.0008916577,0.0006308495,0.000115085044,0.0003249017,0.0006534509,0.20252284],"genre_scores_gemma":[0.940795,0.00059015123,0.030369962,0.00024604588,0.0003954651,0.000095193536,0.00016953844,0.00018641617,0.027152162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996966,0.000051826635,0.000014739294,0.000039134226,0.00012373031,0.00007401759],"domain_scores_gemma":[0.999647,0.000094768395,0.000061173654,0.000037793023,0.00009179855,0.00006754627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054546166,0.0006724201,0.0004976134,0.0020441124,0.0011498947,0.0016180705,0.00091791106,0.00058508554,0.009499253],"category_scores_gemma":[0.0014696969,0.0002458015,0.000586431,0.0010428106,0.001547072,0.0031730824,0.0011176404,0.0012687009,0.0021200436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021714677,0.000017716362,0.00017608132,0.000028986044,0.0000027453655,0.00017757426,0.00014130097,0.00093103055,0.0018002272,0.98855525,0.00075279037,0.007394617],"study_design_scores_gemma":[0.000010651541,0.000030112595,0.0003271983,0.000023379895,0.00000663142,0.0003437376,0.00011153626,0.0131873945,0.0025086927,0.97926134,0.0041620145,0.000027284668],"about_ca_topic_score_codex":0.00057725265,"about_ca_topic_score_gemma":0.0008342118,"teacher_disagreement_score":0.009499253,"about_ca_system_score_codex":0.0007337106,"about_ca_system_score_gemma":0.0003556359,"threshold_uncertainty_score":0.031778157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27623004,0.0073346845,0.59334743,0.0025370654,0.00036521806,0.0002242983,0.0024229598,0.0007698366,0.11676856],"genre_scores_gemma":[0.83855844,0.0045937374,0.13594168,0.0005896678,0.00050137896,0.0003365807,0.0016444381,0.000314911,0.01751916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862754,0.00020790347,0.00008729891,0.00033855016,0.00039103825,0.00034764296],"domain_scores_gemma":[0.9919354,0.0051588016,0.0005495518,0.00079626427,0.00053292233,0.0010271753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013842289,0.0012293889,0.0014766783,0.0019567544,0.0014481898,0.003293388,0.0017606901,0.0011141192,0.008286742],"category_scores_gemma":[0.006256461,0.00056157244,0.0009974365,0.0018727302,0.0016014994,0.0076573845,0.0029827596,0.003124281,0.0013851521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009501892,0.00032606785,0.008326466,0.0014590166,0.00023186722,0.00071802136,0.0014725861,0.13558733,0.07015567,0.645713,0.022241674,0.1128181],"study_design_scores_gemma":[0.0000868034,0.0006957729,0.006809189,0.0002896873,0.00035872663,0.0027882587,0.0007194213,0.27728564,0.022990104,0.63551754,0.052298665,0.00016019703],"about_ca_topic_score_codex":0.00038846012,"about_ca_topic_score_gemma":0.0010793266,"teacher_disagreement_score":0.008286742,"about_ca_system_score_codex":0.0015067812,"about_ca_system_score_gemma":0.0006098618,"threshold_uncertainty_score":0.027721941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47307578,0.0029389742,0.44619218,0.0021848455,0.00016448977,0.00008623737,0.0005136126,0.0005021202,0.074341714],"genre_scores_gemma":[0.8817705,0.0008627973,0.10346382,0.0005004951,0.00014595044,0.00019759676,0.00033901288,0.00011452088,0.012605356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940884,0.00019510339,0.000030802792,0.00011350646,0.00013314009,0.00011846164],"domain_scores_gemma":[0.9977581,0.0013313974,0.0003642515,0.00018196716,0.00022922369,0.00013522149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082498975,0.0005353678,0.00045877078,0.0019335635,0.0013837881,0.0021694729,0.0010467207,0.0015231712,0.0043478487],"category_scores_gemma":[0.0054902816,0.0003120322,0.0006677274,0.0020874548,0.0019216404,0.003060472,0.0007588985,0.0015404512,0.00085296604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009718566,0.000007677995,0.00047317464,0.000023453671,0.0000031927623,0.000046389803,0.000116642645,0.0035147665,0.0006813682,0.9883355,0.0006189007,0.00616926],"study_design_scores_gemma":[0.000004870556,0.0000057731877,0.00027014242,0.000020098718,0.0000031366312,0.0001307368,0.00007586219,0.030965907,0.0003642653,0.96560764,0.002541339,0.000010164149],"about_ca_topic_score_codex":0.0014381633,"about_ca_topic_score_gemma":0.003117405,"teacher_disagreement_score":0.0043478487,"about_ca_system_score_codex":0.0020539411,"about_ca_system_score_gemma":0.0009066115,"threshold_uncertainty_score":0.0149024725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34956723,0.000405146,0.62012064,0.00067907193,0.00009909431,0.0002476681,0.0015131399,0.001507588,0.025860397],"genre_scores_gemma":[0.8199034,0.0005091582,0.15833864,0.00031542673,0.000050451818,0.00023004822,0.0019844177,0.000207035,0.018461445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954957,0.00007348899,0.00003835106,0.00014485138,0.00009092958,0.000102762824],"domain_scores_gemma":[0.9986552,0.0005587704,0.00016823984,0.00027587768,0.00018890874,0.00015295873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037818102,0.00035380624,0.00041226388,0.0008666876,0.0013483719,0.0013868706,0.00064795103,0.0004005727,0.0056761242],"category_scores_gemma":[0.0022971532,0.00035101504,0.000539718,0.0014447868,0.0012009352,0.0027407892,0.0013291725,0.0011232028,0.0007574838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018343145,0.00014627108,0.0035649093,0.00023299937,0.00002950571,0.00082083786,0.0016202673,0.01576928,0.018555388,0.86372495,0.0033271005,0.09202506],"study_design_scores_gemma":[0.000045569497,0.0001306311,0.001786863,0.0000668534,0.00003784129,0.00074785086,0.0009670981,0.056726545,0.018254895,0.88271254,0.038468808,0.000054565764],"about_ca_topic_score_codex":0.0045831916,"about_ca_topic_score_gemma":0.0065186806,"teacher_disagreement_score":0.0056761242,"about_ca_system_score_codex":0.0011316173,"about_ca_system_score_gemma":0.0007648231,"threshold_uncertainty_score":0.01898849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8939081,0.0006376575,0.058025252,0.0013030785,0.000091892456,0.000056318415,0.0007367869,0.00034660078,0.04489444],"genre_scores_gemma":[0.9864245,0.00018486675,0.010060756,0.000106242784,0.0000541284,0.000044093835,0.0002766717,0.000047291527,0.0028015107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.00011017964,0.00002210273,0.00020027111,0.000120245495,0.00013714863],"domain_scores_gemma":[0.9956234,0.002608083,0.00063959236,0.0004905913,0.00024550103,0.00039287095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005888826,0.00047756877,0.00033545165,0.0022041218,0.0013200678,0.0019731103,0.0010249052,0.0007214115,0.0035747376],"category_scores_gemma":[0.004974886,0.0004464328,0.00041474326,0.0014968906,0.0025552635,0.0026329185,0.0016942016,0.0015070273,0.00035690583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042805148,0.00011424741,0.011004553,0.00014412013,0.000033574554,0.00023708379,0.0006189524,0.040275905,0.015628368,0.89454496,0.007875017,0.029095192],"study_design_scores_gemma":[0.000062766434,0.0000569985,0.00486991,0.00003407732,0.000030308041,0.0003646556,0.0002587794,0.098188534,0.0055035916,0.8835497,0.0070168786,0.00006376428],"about_ca_topic_score_codex":0.001963951,"about_ca_topic_score_gemma":0.0032943333,"teacher_disagreement_score":0.0035747376,"about_ca_system_score_codex":0.0024691934,"about_ca_system_score_gemma":0.00063221314,"threshold_uncertainty_score":0.017915368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5203947,0.0009512136,0.17733939,0.001742133,0.0004079207,0.000084489315,0.00018158152,0.00021944183,0.29867902],"genre_scores_gemma":[0.9497272,0.0004762794,0.022096567,0.00036037999,0.0002587149,0.000111649555,0.000110006156,0.00008477988,0.026774427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.00009688376,0.00002716417,0.00009409283,0.00014136636,0.00012953456],"domain_scores_gemma":[0.99935454,0.00017096636,0.00012102306,0.00008469488,0.00010546733,0.00016333572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006128933,0.00048350717,0.0004383154,0.0013005865,0.0020684316,0.0027862804,0.0006405788,0.0007596289,0.004204725],"category_scores_gemma":[0.0011196337,0.00032524354,0.00064894446,0.00078343425,0.0045234174,0.0042212144,0.0022608978,0.0020147439,0.0010022193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112597945,0.000006390101,0.00010108449,0.000006247006,0.0000013392847,0.000084770094,0.00012974963,0.0002052357,0.0005708108,0.9972037,0.00027171455,0.0014076825],"study_design_scores_gemma":[0.000009022698,0.000014734777,0.00020897623,0.000009859751,0.000002409567,0.00023709983,0.00013263033,0.0014651943,0.0008347478,0.9923045,0.004770773,0.000010028429],"about_ca_topic_score_codex":0.00042644277,"about_ca_topic_score_gemma":0.00051970273,"teacher_disagreement_score":0.004204725,"about_ca_system_score_codex":0.00089822215,"about_ca_system_score_gemma":0.0005620766,"threshold_uncertainty_score":0.014066219},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05818998,0.0019365271,0.9148393,0.0025584828,0.0001661534,0.0002461297,0.0007782431,0.0014917898,0.019793386],"genre_scores_gemma":[0.60043293,0.0023701976,0.3809085,0.0013081351,0.0006198481,0.0009635819,0.0014509627,0.0013977353,0.010547996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911299,0.003062101,0.0002686565,0.0011940122,0.0019229838,0.0024223053],"domain_scores_gemma":[0.96699345,0.026545627,0.0024343003,0.0016770861,0.0014642166,0.0008854376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006554182,0.0025974002,0.002022985,0.0022367067,0.001415835,0.004297741,0.0041019702,0.0017683611,0.0061573824],"category_scores_gemma":[0.030011807,0.0013178913,0.0023805413,0.0047123246,0.0034727098,0.0053374707,0.0023103873,0.0048959553,0.001143259],"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.0005148487,0.00024563077,0.0014699659,0.00045788163,0.00014008878,0.00014802112,0.00022920691,0.86034703,0.0029614503,0.09734231,0.006028248,0.030115338],"study_design_scores_gemma":[0.000030459927,0.000057896137,0.00021688877,0.000021089098,0.000023884799,0.000034592304,0.000040388346,0.9380585,0.0006134282,0.059975516,0.0009130945,0.000014275846],"about_ca_topic_score_codex":0.012579901,"about_ca_topic_score_gemma":0.008759027,"teacher_disagreement_score":0.012579901,"about_ca_system_score_codex":0.0063956194,"about_ca_system_score_gemma":0.0046766945,"threshold_uncertainty_score":0.046403706},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04002654,0.00085618877,0.947745,0.00089701713,0.00010613409,0.00016503243,0.00008375744,0.00054464,0.0095757],"genre_scores_gemma":[0.34724733,0.0009750262,0.6432558,0.000357466,0.00015693974,0.0007504856,0.000304068,0.00023487008,0.0067180987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986785,0.0006228645,0.00007347714,0.00024594032,0.00023184075,0.00014747366],"domain_scores_gemma":[0.9957021,0.0034573232,0.00022512415,0.00023383036,0.00027750808,0.00010401523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018737804,0.0014407288,0.0015985797,0.001812997,0.0015685838,0.0018032556,0.0018806108,0.002388545,0.0030654564],"category_scores_gemma":[0.008703651,0.0009652458,0.001243063,0.0018981672,0.0028165006,0.0014201123,0.002154277,0.0022415987,0.0004489982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005913375,0.000057899706,0.00069470674,0.00011484014,0.00007932304,0.0001543206,0.00018560428,0.87607664,0.00059351383,0.08234592,0.001339353,0.038298726],"study_design_scores_gemma":[0.00005041653,0.000025850113,0.00009773694,0.000024508685,0.000021507212,0.000034967565,0.00005189062,0.85721433,0.00039213352,0.14046405,0.0016094439,0.0000132480745],"about_ca_topic_score_codex":0.006541824,"about_ca_topic_score_gemma":0.006461536,"teacher_disagreement_score":0.006541824,"about_ca_system_score_codex":0.0024594949,"about_ca_system_score_gemma":0.0020720402,"threshold_uncertainty_score":0.017844975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.905742,0.00082536903,0.06692346,0.0004728603,0.000078475925,0.000038235277,0.00016208137,0.00022482131,0.025532614],"genre_scores_gemma":[0.9746504,0.00015900389,0.019409131,0.000089511115,0.00007617698,0.000047463436,0.00016220415,0.000035875215,0.0053703063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952745,0.00007433872,0.00004506683,0.00018859381,0.000089500456,0.000075163305],"domain_scores_gemma":[0.9989913,0.0004378349,0.00019679623,0.00015068815,0.00010746595,0.0001158387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035217477,0.0004670998,0.00057228224,0.00058452174,0.0012403287,0.0015014433,0.0005247989,0.0008171214,0.0045339274],"category_scores_gemma":[0.001962655,0.00042885166,0.0006600061,0.00040926595,0.0017757363,0.0027651726,0.0010364549,0.0008128622,0.0005534168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033567526,0.000080850536,0.004404943,0.00023100455,0.000033811753,0.0012534247,0.0012496422,0.0031964127,0.028036986,0.94048744,0.0010269205,0.019662838],"study_design_scores_gemma":[0.000074178584,0.00023979646,0.0025014116,0.000068568654,0.00007012179,0.0022840367,0.0008833144,0.020003483,0.017138137,0.9412929,0.015385903,0.000058193295],"about_ca_topic_score_codex":0.00033051678,"about_ca_topic_score_gemma":0.0005727406,"teacher_disagreement_score":0.0045339274,"about_ca_system_score_codex":0.00062156667,"about_ca_system_score_gemma":0.0003019788,"threshold_uncertainty_score":0.015167475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6076196,0.0015224642,0.3233715,0.000673995,0.00012742999,0.00009752569,0.00028886567,0.00051983277,0.065778814],"genre_scores_gemma":[0.96928465,0.00050419144,0.022367617,0.000088202265,0.00016601832,0.00008965039,0.00016221736,0.00013556611,0.007201847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990852,0.0002561465,0.0000436306,0.0002087738,0.00024380586,0.00016244194],"domain_scores_gemma":[0.99697375,0.0014822788,0.0005083142,0.0002858087,0.00043098288,0.00031883415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822816,0.0004547037,0.00084371056,0.0024828564,0.0012592694,0.0020906257,0.0006636907,0.00066249183,0.0048270044],"category_scores_gemma":[0.007160422,0.00036651897,0.0008900898,0.00090507214,0.0029243953,0.0027383375,0.0018426654,0.0016668084,0.00074611825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012163706,0.000005865633,0.00059284084,0.00002500834,0.000006603537,0.00005232815,0.00025282256,0.0029009394,0.00074177363,0.9907759,0.00034370995,0.00429011],"study_design_scores_gemma":[0.000016340819,0.000041799514,0.00091618556,0.00002644721,0.0000109960665,0.00016666364,0.00013062915,0.034783,0.00103667,0.9586621,0.0041882438,0.000020858331],"about_ca_topic_score_codex":0.0008379957,"about_ca_topic_score_gemma":0.0005263577,"teacher_disagreement_score":0.0048270044,"about_ca_system_score_codex":0.0013458655,"about_ca_system_score_gemma":0.00052638527,"threshold_uncertainty_score":0.016147912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15028892,0.0013472609,0.800288,0.0006301034,0.00020601692,0.00019598949,0.0003880842,0.0005176685,0.046137966],"genre_scores_gemma":[0.61117464,0.0026475256,0.36535928,0.00072317396,0.000246932,0.0004499555,0.0016555582,0.00042651582,0.017316438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969447,0.000065077526,0.00002089542,0.00007696345,0.000063644504,0.000078985846],"domain_scores_gemma":[0.9994043,0.00020136582,0.000079562655,0.00010648031,0.00012895637,0.000079377576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031834262,0.00096641725,0.0005762912,0.0016528158,0.0008991332,0.0018860301,0.00079415314,0.0009691626,0.0042133927],"category_scores_gemma":[0.0012720986,0.00049018714,0.0010425901,0.0012977164,0.0018403277,0.003974408,0.0022039162,0.0015939121,0.0010199818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008541206,0.000040873347,0.00076051184,0.00019776118,0.000025800437,0.00045793207,0.0008498261,0.026376618,0.006862885,0.9159656,0.0028562855,0.04552042],"study_design_scores_gemma":[0.000011360361,0.000025023288,0.00030813902,0.000057789206,0.000018752178,0.00022096826,0.00022324038,0.035291735,0.001591659,0.9495367,0.012697354,0.000017300674],"about_ca_topic_score_codex":0.0016697159,"about_ca_topic_score_gemma":0.0019284878,"teacher_disagreement_score":0.0042133927,"about_ca_system_score_codex":0.0005973115,"about_ca_system_score_gemma":0.00058120495,"threshold_uncertainty_score":0.014095187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78544647,0.0039727935,0.12508991,0.0017113655,0.0004203784,0.000072021634,0.00032090783,0.00017388437,0.08279229],"genre_scores_gemma":[0.9788979,0.000956442,0.010810397,0.00018146988,0.00019594868,0.000054270728,0.0001744049,0.000030987238,0.008698119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.00012272384,0.00002073522,0.00006098589,0.00016906083,0.00012285428],"domain_scores_gemma":[0.99939454,0.00016420144,0.00012820282,0.000067583846,0.00007975727,0.00016577312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068425806,0.00062028517,0.0006394967,0.0017276856,0.0017094347,0.002365351,0.0009493808,0.0005923796,0.0039965087],"category_scores_gemma":[0.0010884539,0.00035184508,0.0005571234,0.0014905297,0.0029855955,0.0042566196,0.0016771595,0.0017283651,0.0008280299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012090023,0.000014329736,0.00009039112,0.000022548375,0.0000027510177,0.00006276077,0.00014074991,0.0005576406,0.0006237728,0.99686325,0.00024743876,0.001362345],"study_design_scores_gemma":[0.0000070885153,0.0000092960745,0.00013724701,0.0000061792234,0.0000038256817,0.00007909549,0.00007385445,0.0028651163,0.00065678265,0.9949869,0.0011666882,0.000008052943],"about_ca_topic_score_codex":0.0012332969,"about_ca_topic_score_gemma":0.0016295423,"teacher_disagreement_score":0.0039965087,"about_ca_system_score_codex":0.0008766413,"about_ca_system_score_gemma":0.0006385366,"threshold_uncertainty_score":0.013369679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76624215,0.0007377663,0.20850879,0.0028022407,0.0001141793,0.0001203421,0.0010549055,0.00059374154,0.019825842],"genre_scores_gemma":[0.9734529,0.000541551,0.020401508,0.00021046861,0.00015936898,0.0002688117,0.0006720957,0.00017303434,0.004120241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989297,0.00031191864,0.000051803963,0.00033680676,0.0002292389,0.0001405087],"domain_scores_gemma":[0.98379,0.011332188,0.0012097689,0.0013535331,0.0010316701,0.0012829184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017123839,0.0005150786,0.0006926106,0.001923299,0.00114607,0.0018295228,0.0015184705,0.0013414768,0.004178389],"category_scores_gemma":[0.017877985,0.0004971156,0.0006331067,0.00084886583,0.003062415,0.0039899773,0.001300481,0.0014032205,0.00064725144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071238016,0.00009884002,0.016586382,0.00035571534,0.00013513282,0.0005158888,0.00078856875,0.09025534,0.034391668,0.82201445,0.008312952,0.025832612],"study_design_scores_gemma":[0.00007615433,0.0002391418,0.00831683,0.000095981246,0.000077958335,0.0011868599,0.00026564405,0.58660424,0.015475912,0.3831023,0.004441852,0.00011712848],"about_ca_topic_score_codex":0.0007185463,"about_ca_topic_score_gemma":0.00061596686,"teacher_disagreement_score":0.004178389,"about_ca_system_score_codex":0.001546658,"about_ca_system_score_gemma":0.00061689224,"threshold_uncertainty_score":0.013978064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15574397,0.001197474,0.55518585,0.0023714888,0.0021217898,0.00017545874,0.0005506134,0.0005288821,0.2821245],"genre_scores_gemma":[0.79835606,0.0012454818,0.14090727,0.0016894079,0.0008240048,0.00041286813,0.00030553134,0.00056337746,0.055696025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989588,0.00015540374,0.00006899526,0.00023398854,0.0003176513,0.0002652616],"domain_scores_gemma":[0.9993098,0.00023296058,0.000044233097,0.00013064328,0.00018841198,0.0000940076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015364761,0.00078942615,0.0010472893,0.0014885439,0.0027794072,0.0024899964,0.0014056815,0.0018139776,0.009278329],"category_scores_gemma":[0.0032336786,0.000497123,0.0017749539,0.0010061135,0.0044394457,0.0064354767,0.0026701079,0.0042431885,0.0023102907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007954409,0.000004585545,0.000022906284,0.000009547531,0.0000010967086,0.00004709415,0.00007543004,0.00014978126,0.0003945362,0.9974522,0.000400622,0.0014342126],"study_design_scores_gemma":[0.000007788142,0.000010651536,0.000072157214,0.0000073850233,0.0000034333036,0.00009466018,0.000030421748,0.0025805165,0.0008468716,0.99229914,0.004030729,0.000016276354],"about_ca_topic_score_codex":0.001570333,"about_ca_topic_score_gemma":0.001098403,"teacher_disagreement_score":0.009278329,"about_ca_system_score_codex":0.0015090988,"about_ca_system_score_gemma":0.0014034201,"threshold_uncertainty_score":0.031039119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59205073,0.0011613964,0.2760336,0.0012117458,0.000186163,0.00008263439,0.0003972098,0.0003065199,0.12857004],"genre_scores_gemma":[0.93374324,0.00063700555,0.04013372,0.00031783673,0.00014746377,0.00013751218,0.00036899926,0.0001697411,0.024344528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991117,0.00022222476,0.00006595724,0.0002516086,0.00019363203,0.00015473936],"domain_scores_gemma":[0.99800223,0.0009709456,0.00021424588,0.00027066848,0.00025286066,0.00028910246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617024,0.0003261502,0.00041837431,0.0013915031,0.0022683674,0.00299911,0.00071401714,0.0008188218,0.006572059],"category_scores_gemma":[0.0027857295,0.0005508447,0.00060760666,0.0011446686,0.00547563,0.0052313795,0.0027724523,0.0016285309,0.00082317553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003121969,0.0000150679725,0.0003835068,0.000019865005,0.0000026722605,0.00007582439,0.0004127487,0.000889658,0.00087107037,0.99255544,0.0003270727,0.0044158776],"study_design_scores_gemma":[0.0000092524015,0.000033203527,0.00044289336,0.000017523445,0.0000051320967,0.00017231471,0.00027719405,0.0043072766,0.0010067663,0.98900056,0.004709886,0.000017867718],"about_ca_topic_score_codex":0.0011703996,"about_ca_topic_score_gemma":0.0011162423,"teacher_disagreement_score":0.006572059,"about_ca_system_score_codex":0.001019685,"about_ca_system_score_gemma":0.0005303548,"threshold_uncertainty_score":0.02198577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8642526,0.000108526496,0.12015639,0.00022261904,0.00002407282,0.000027478369,0.00007605748,0.00020360929,0.01492863],"genre_scores_gemma":[0.98864543,0.00005099808,0.010203065,0.000029123441,0.00001064335,0.00002110817,0.000055602966,0.000025185473,0.0009588581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995919,0.000109636145,0.000018109513,0.00011425965,0.00010164791,0.00006443609],"domain_scores_gemma":[0.9984396,0.00064342085,0.00030023293,0.00038180003,0.00008028748,0.0001546254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003331517,0.00023705348,0.00025137607,0.00058859674,0.0008369815,0.0008594106,0.0004871745,0.0006740505,0.00245388],"category_scores_gemma":[0.0023490665,0.0002511384,0.000250423,0.0003907903,0.0016394632,0.0015466448,0.0010627755,0.0006657359,0.00020644766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022607794,0.0001238453,0.0022341434,0.00009247946,0.000020348509,0.0003677844,0.0003395559,0.02842099,0.06759819,0.88008374,0.00065055356,0.019842336],"study_design_scores_gemma":[0.000034000986,0.00013030184,0.002274487,0.000015386235,0.000019742418,0.0005352349,0.00023769125,0.113224715,0.038051296,0.8436501,0.0017988727,0.000028120228],"about_ca_topic_score_codex":0.00020183112,"about_ca_topic_score_gemma":0.00025215643,"teacher_disagreement_score":0.00245388,"about_ca_system_score_codex":0.00038476128,"about_ca_system_score_gemma":0.0002052095,"threshold_uncertainty_score":0.008209109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85404706,0.0019704807,0.10291957,0.00057208247,0.00008384687,0.000039791594,0.0002596795,0.00014070758,0.039966743],"genre_scores_gemma":[0.9799114,0.00054813555,0.015361068,0.00009196867,0.000099572804,0.00004300523,0.00020198223,0.000037834103,0.0037049963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921834,0.00017279667,0.00002955106,0.00014813215,0.00026098837,0.00017023375],"domain_scores_gemma":[0.9980324,0.0010495449,0.0003213151,0.00021654379,0.00016839328,0.00021178978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005508896,0.0004343936,0.00044161943,0.0022171796,0.0014079061,0.0018271697,0.00058250845,0.00066180277,0.0030294533],"category_scores_gemma":[0.0037213515,0.00039285998,0.00035606453,0.0013082039,0.001999082,0.0027549174,0.0011969216,0.0008056351,0.00029514168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030134438,0.000028650615,0.0017981813,0.00011898725,0.00002054742,0.00019461267,0.0005497014,0.022180311,0.00883465,0.93870485,0.0015116774,0.025756504],"study_design_scores_gemma":[0.00002064013,0.00007934991,0.0018602543,0.000045637622,0.000019080737,0.00055707817,0.00033842272,0.07879286,0.0072727716,0.9014518,0.009533284,0.000028808718],"about_ca_topic_score_codex":0.0014171475,"about_ca_topic_score_gemma":0.0017357203,"teacher_disagreement_score":0.0030294533,"about_ca_system_score_codex":0.001264284,"about_ca_system_score_gemma":0.0003012803,"threshold_uncertainty_score":0.010134578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614606,0.00012181313,0.024700249,0.0004823299,0.000012731227,0.000018112676,0.00044333385,0.00021103803,0.012549834],"genre_scores_gemma":[0.9915615,0.00005133762,0.0068218033,0.000038681737,0.000014362411,0.00001585858,0.00027702615,0.000019659903,0.0011997496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991881,0.00015773403,0.000051697865,0.000269011,0.00017227035,0.00016119855],"domain_scores_gemma":[0.9940706,0.0037264684,0.0006293851,0.0009015582,0.00020521991,0.00046678534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009983225,0.00028488928,0.000422906,0.0013193821,0.001152566,0.0018158875,0.0008601631,0.000600417,0.0033931325],"category_scores_gemma":[0.0041082376,0.0003127935,0.00050809595,0.00077793736,0.0024634735,0.0031208433,0.0016975768,0.0009157499,0.0002539091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042716358,0.00008133666,0.01416825,0.000114816015,0.000036757472,0.00026238573,0.0007359,0.01636761,0.011278356,0.9337434,0.0019952166,0.020788811],"study_design_scores_gemma":[0.000056399564,0.00007064031,0.0045719496,0.000015976795,0.000053321695,0.00034822445,0.00019421057,0.05007834,0.014316047,0.9260275,0.0042265034,0.000040841973],"about_ca_topic_score_codex":0.00072623487,"about_ca_topic_score_gemma":0.00087542355,"teacher_disagreement_score":0.0033931325,"about_ca_system_score_codex":0.0017181326,"about_ca_system_score_gemma":0.0005367156,"threshold_uncertainty_score":0.012466013},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6531319,0.00086161983,0.19848941,0.0014627393,0.00041081774,0.00020685227,0.0029640817,0.0016872399,0.14078534],"genre_scores_gemma":[0.9282406,0.00037372502,0.045325868,0.00030721942,0.00023971607,0.00023361368,0.0019761478,0.00038268472,0.022920474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987954,0.00012080698,0.00016497166,0.00031582938,0.00032381926,0.00027910972],"domain_scores_gemma":[0.9968573,0.00116405,0.00040970926,0.0006291357,0.00042374872,0.00051602186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063613086,0.0005648758,0.0006530462,0.0019159756,0.001595758,0.0029053285,0.0011543026,0.0009137187,0.013542286],"category_scores_gemma":[0.0037717188,0.00035626112,0.00083219283,0.0014663027,0.0016776139,0.0039283386,0.0021264812,0.0019683973,0.0022187785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042620618,0.00011201298,0.0022334154,0.00019908063,0.000027062584,0.0005690732,0.0008840391,0.0031133343,0.01583842,0.943182,0.0043829354,0.029032547],"study_design_scores_gemma":[0.000048058082,0.00010946499,0.0010956081,0.000042972708,0.00003722189,0.00092375185,0.00026922926,0.01199925,0.007489879,0.9602607,0.01767534,0.00004852016],"about_ca_topic_score_codex":0.00077434286,"about_ca_topic_score_gemma":0.0007552566,"teacher_disagreement_score":0.013542286,"about_ca_system_score_codex":0.0013013831,"about_ca_system_score_gemma":0.00076664303,"threshold_uncertainty_score":0.045303464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36755916,0.0027861847,0.52593464,0.0014274293,0.0005490921,0.000047026322,0.0003286047,0.0002947229,0.10107314],"genre_scores_gemma":[0.93925714,0.0012668498,0.043320004,0.00021128263,0.00023848918,0.000035173463,0.00011004824,0.00008904544,0.015471877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996106,0.00012904106,0.00002059797,0.000060192968,0.00011039877,0.00006927864],"domain_scores_gemma":[0.99928755,0.00025761503,0.00011650608,0.00011341393,0.00013439302,0.00009055194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069360185,0.00035593167,0.00026031918,0.0010829102,0.00069596,0.0019459059,0.0005131412,0.00054493116,0.004961748],"category_scores_gemma":[0.0033352044,0.00019268222,0.00029174978,0.0011155434,0.00231014,0.004041053,0.0009222571,0.0011086493,0.001099518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020946009,0.000010672769,0.00023501129,0.000029481138,0.000002022056,0.00006508507,0.0001255268,0.0014189224,0.0008674299,0.98704135,0.0005226885,0.009660825],"study_design_scores_gemma":[0.0000052893397,0.000034769437,0.00028509396,0.000022827198,0.0000028348488,0.00020238277,0.00010538091,0.01057271,0.0010170668,0.98224145,0.0054903724,0.000019899415],"about_ca_topic_score_codex":0.0005687201,"about_ca_topic_score_gemma":0.0005241485,"teacher_disagreement_score":0.004961748,"about_ca_system_score_codex":0.00047486628,"about_ca_system_score_gemma":0.00042197818,"threshold_uncertainty_score":0.016598761},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85147184,0.0006045147,0.10935168,0.0011846715,0.00009628693,0.00004828985,0.0005014089,0.0005027376,0.036238417],"genre_scores_gemma":[0.9839574,0.0002025935,0.011094112,0.00012409475,0.00005931065,0.00006574984,0.00022063263,0.000082585815,0.0041934554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999653,0.00010149516,0.000015845188,0.00008512893,0.00007863294,0.00006588337],"domain_scores_gemma":[0.9972373,0.0015552792,0.00028814268,0.00040397467,0.00017620009,0.00033901064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047479407,0.0002231009,0.0004582406,0.00094476796,0.0008562816,0.001249272,0.000752242,0.0006040343,0.003963104],"category_scores_gemma":[0.0048400187,0.00022515966,0.0003672358,0.00043676322,0.0013436077,0.0021261445,0.0010198895,0.00071659393,0.00053483684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069510477,0.00015706962,0.0057121105,0.00019684213,0.00004775319,0.0012574664,0.0005130137,0.04819226,0.026823396,0.8861615,0.0051362193,0.02510721],"study_design_scores_gemma":[0.000097923665,0.00020774179,0.0029711318,0.000056749643,0.000034960674,0.0011261937,0.0002749116,0.334404,0.00674843,0.6460311,0.0079906965,0.000056176337],"about_ca_topic_score_codex":0.0006700567,"about_ca_topic_score_gemma":0.0005194779,"teacher_disagreement_score":0.003963104,"about_ca_system_score_codex":0.00039004852,"about_ca_system_score_gemma":0.00024980443,"threshold_uncertainty_score":0.013257921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508885,0.00019631647,0.0342897,0.00029101982,0.000015208453,0.000040646206,0.00037529343,0.00014042127,0.013762873],"genre_scores_gemma":[0.9908048,0.00017095308,0.005072363,0.000051699255,0.000016532287,0.00003215871,0.00030584342,0.000027962922,0.0035177711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997781,0.00003374252,0.000013130099,0.000055620607,0.000042784057,0.00007668671],"domain_scores_gemma":[0.999033,0.00045857747,0.00020974732,0.000080597485,0.000094448966,0.00012365208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001575151,0.00027830518,0.00023372986,0.0006231112,0.00055290246,0.00077762385,0.0005437417,0.00036500633,0.0034963838],"category_scores_gemma":[0.0014018781,0.00022500168,0.00031699883,0.0005710935,0.00090846163,0.0010507907,0.0006679104,0.0005794546,0.00025163288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034903162,0.00015854539,0.009837728,0.00026685518,0.000059629638,0.0014094657,0.0015564159,0.05241397,0.03566586,0.8660786,0.0039986325,0.028205158],"study_design_scores_gemma":[0.00007905785,0.00009340055,0.003760433,0.000029880239,0.000026519678,0.00049051887,0.00057292066,0.10755808,0.009619119,0.8729935,0.0047363266,0.00004034307],"about_ca_topic_score_codex":0.0033414075,"about_ca_topic_score_gemma":0.004082494,"teacher_disagreement_score":0.0034963838,"about_ca_system_score_codex":0.0007457596,"about_ca_system_score_gemma":0.00053946034,"threshold_uncertainty_score":0.011696577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9144414,0.00034923348,0.038368423,0.0008024545,0.00011614607,0.000043573888,0.00013960728,0.00025860648,0.045480594],"genre_scores_gemma":[0.98134893,0.0002503738,0.009801955,0.00012373012,0.000097361335,0.00007445521,0.00018217374,0.000061654646,0.008059428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.00021162114,0.000049011865,0.00017838854,0.00021590429,0.00018824183],"domain_scores_gemma":[0.99662435,0.0017626778,0.00055990595,0.00060247025,0.00020242289,0.0002481441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007751195,0.0003840954,0.00050606305,0.0010884766,0.0015426236,0.0025727358,0.0007992808,0.0012158429,0.004462436],"category_scores_gemma":[0.006775817,0.00035807208,0.0005711954,0.00083840627,0.003174093,0.0036509896,0.0017348315,0.0014618518,0.00059123116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001287694,0.00004179243,0.0011267156,0.00006578321,0.000010269659,0.00019742807,0.00033147685,0.006302395,0.0047510676,0.970803,0.0012313775,0.015009907],"study_design_scores_gemma":[0.000028239781,0.00006452436,0.00043742656,0.000022740283,0.000018540459,0.0003616388,0.00018177183,0.024014724,0.0047077215,0.96473145,0.005408683,0.000022497996],"about_ca_topic_score_codex":0.00064437796,"about_ca_topic_score_gemma":0.0007288484,"teacher_disagreement_score":0.004462436,"about_ca_system_score_codex":0.0011455286,"about_ca_system_score_gemma":0.0010973687,"threshold_uncertainty_score":0.0149284005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7732746,0.0007111354,0.19464816,0.0008054324,0.000081229504,0.000037079793,0.00032848513,0.00063778664,0.029476166],"genre_scores_gemma":[0.9745918,0.00056177285,0.01980256,0.00014381239,0.000094841576,0.000104318184,0.00038885733,0.0002047951,0.004107158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937636,0.00014671718,0.000025285517,0.00015949438,0.00018284743,0.00010936014],"domain_scores_gemma":[0.99358094,0.003725473,0.00082889094,0.00078126136,0.0005920024,0.0004915177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009621727,0.0004954897,0.00054687326,0.0026988792,0.000694641,0.0019790677,0.0016147485,0.0010071156,0.0044423863],"category_scores_gemma":[0.015514299,0.00044912403,0.0006533468,0.0013188727,0.0021260495,0.0036667348,0.001872946,0.0012274126,0.00048571458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016704194,0.000059621558,0.010195482,0.00019560196,0.000037862945,0.000394798,0.0005693099,0.053313468,0.01810465,0.8879302,0.0026250093,0.026406927],"study_design_scores_gemma":[0.000017107495,0.00004083866,0.006284851,0.0000784342,0.00003811911,0.0007652726,0.00019712749,0.38209835,0.007480601,0.60017735,0.0027695969,0.000052282383],"about_ca_topic_score_codex":0.0006727537,"about_ca_topic_score_gemma":0.001045582,"teacher_disagreement_score":0.0044423863,"about_ca_system_score_codex":0.0015769843,"about_ca_system_score_gemma":0.00043553443,"threshold_uncertainty_score":0.014861286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.737743,0.0014414957,0.17704211,0.0006648465,0.00043372624,0.00010095267,0.0003410532,0.0005780885,0.081654586],"genre_scores_gemma":[0.9365653,0.00055462326,0.032575667,0.00027753768,0.00044313085,0.00016340715,0.00054308283,0.00022248374,0.028654821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988882,0.0001980369,0.000081287275,0.00021919452,0.00037712202,0.00023616533],"domain_scores_gemma":[0.9976301,0.0010658733,0.00029347264,0.00026055265,0.00035367566,0.0003962219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009144647,0.00079950434,0.00086140895,0.0022412103,0.001966873,0.002210263,0.0008518334,0.00073272677,0.006293861],"category_scores_gemma":[0.0052801166,0.00039792902,0.00070475176,0.001129762,0.0017812508,0.003876954,0.002993714,0.001310436,0.0011589625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019802962,0.00006410309,0.0020087487,0.00011799744,0.000021837868,0.0006205449,0.00063668273,0.0030021532,0.009137423,0.96269083,0.0014318546,0.020069746],"study_design_scores_gemma":[0.000023156541,0.00011395462,0.0011535678,0.0000755502,0.000036167334,0.0008604721,0.00022007662,0.026485248,0.008704568,0.9536134,0.008670902,0.000043038497],"about_ca_topic_score_codex":0.00046051526,"about_ca_topic_score_gemma":0.0004454712,"teacher_disagreement_score":0.006293861,"about_ca_system_score_codex":0.00096569426,"about_ca_system_score_gemma":0.00049541576,"threshold_uncertainty_score":0.021055043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55268395,0.0028588015,0.41998664,0.0019416761,0.00019676419,0.00023069819,0.00104615,0.0010041401,0.020051226],"genre_scores_gemma":[0.9466032,0.0019606422,0.04103653,0.0005774189,0.00027870914,0.00038040167,0.0011109515,0.00036443272,0.007687679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968851,0.0010156828,0.00015185843,0.00076232647,0.0006427672,0.00054217194],"domain_scores_gemma":[0.9806683,0.011784116,0.0023834375,0.0026601795,0.0009586039,0.0015453248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027453548,0.0014215418,0.0018819324,0.002835044,0.0021755283,0.0033986114,0.0019829273,0.0020629407,0.005329146],"category_scores_gemma":[0.026374748,0.0013586417,0.0016566111,0.0027010594,0.0043601044,0.0080928225,0.0030224577,0.0021414123,0.0010303938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005693472,0.00012660878,0.0050446345,0.00028170485,0.000113921466,0.0006953968,0.0009085535,0.077409804,0.004638893,0.88764626,0.006607866,0.01595692],"study_design_scores_gemma":[0.0001141811,0.00016858593,0.0021478957,0.000115140516,0.00010216978,0.0013734286,0.00029167134,0.38521898,0.004434021,0.59964144,0.006304173,0.00008836326],"about_ca_topic_score_codex":0.0024459078,"about_ca_topic_score_gemma":0.0020708416,"teacher_disagreement_score":0.005329146,"about_ca_system_score_codex":0.002284811,"about_ca_system_score_gemma":0.00086997775,"threshold_uncertainty_score":0.01782775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33842906,0.006527657,0.38019544,0.006154964,0.0015152186,0.00011358691,0.0006056327,0.0027764074,0.26368195],"genre_scores_gemma":[0.9303757,0.002160043,0.024225662,0.0010650173,0.001033479,0.0001456494,0.0003932902,0.0010515619,0.03954969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992576,0.000119788136,0.000028009328,0.00018339323,0.0002603632,0.00015084409],"domain_scores_gemma":[0.99673504,0.0015616765,0.0002858779,0.00038243656,0.00069901993,0.00033593253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010507957,0.0005883247,0.00056835485,0.0025854572,0.0011656687,0.0017856054,0.0013677967,0.0012193506,0.014504397],"category_scores_gemma":[0.011330894,0.00029539445,0.0007915839,0.0010010841,0.002656572,0.005326182,0.0020841327,0.0032605056,0.0020233295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058163263,0.000024926405,0.0010754123,0.00016571084,0.000014171599,0.00019705335,0.00035249384,0.0023099252,0.0046867304,0.96378565,0.005455527,0.021874296],"study_design_scores_gemma":[0.000014312465,0.00004232615,0.0023751731,0.00011307724,0.000030582447,0.0006773854,0.00017563137,0.039438102,0.0045039905,0.9405876,0.011984709,0.000057185796],"about_ca_topic_score_codex":0.002637104,"about_ca_topic_score_gemma":0.0017216392,"teacher_disagreement_score":0.014504397,"about_ca_system_score_codex":0.001705975,"about_ca_system_score_gemma":0.0007947061,"threshold_uncertainty_score":0.048522055},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2026747,0.00008945196,0.7687614,0.0001224744,0.000078175784,0.00011702349,0.000077002245,0.00024101548,0.027838893],"genre_scores_gemma":[0.7892909,0.0002643305,0.19410868,0.0000890387,0.000098741824,0.00022715979,0.00015762776,0.00027525212,0.015488383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915123,0.0001919044,0.00005763263,0.00013530701,0.00034009333,0.00012383146],"domain_scores_gemma":[0.9988105,0.00048038617,0.00010822686,0.00021931108,0.00023504042,0.00014650944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010432304,0.0003233705,0.00045500827,0.0014762818,0.0014016251,0.002511197,0.00090735045,0.0005680177,0.0048771417],"category_scores_gemma":[0.004256066,0.00034054831,0.0005753291,0.0008489261,0.0018884625,0.00273511,0.0017949397,0.0012227749,0.0010796856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017022798,0.00001776814,0.0003171662,0.000014198321,0.0000024035626,0.000099660494,0.00022432551,0.0031210924,0.0035001196,0.98341745,0.00019836951,0.009070407],"study_design_scores_gemma":[0.000016451366,0.000035420057,0.00032771836,0.000018674209,0.0000100390125,0.00036473537,0.00019262334,0.1071964,0.015101261,0.8714253,0.0052850144,0.000026345657],"about_ca_topic_score_codex":0.0004492801,"about_ca_topic_score_gemma":0.00048220146,"teacher_disagreement_score":0.0048771417,"about_ca_system_score_codex":0.00091050315,"about_ca_system_score_gemma":0.00064227346,"threshold_uncertainty_score":0.016315699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87785226,0.00047922632,0.09933084,0.0008093699,0.000091904534,0.000029843211,0.00006568435,0.00018079784,0.021160217],"genre_scores_gemma":[0.9911629,0.0001611251,0.006545927,0.000058914382,0.000047253154,0.000021009755,0.000031692547,0.000023735103,0.0019474102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997514,0.00007346171,0.0000074131385,0.000038347684,0.000067915644,0.0000614202],"domain_scores_gemma":[0.9989957,0.0005088831,0.00016340778,0.00008285068,0.00010556145,0.00014360313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003251685,0.00033670504,0.00028879085,0.0009641893,0.00058411603,0.00079683965,0.0005016472,0.0006967145,0.0023883632],"category_scores_gemma":[0.0020803856,0.00018971073,0.00029544174,0.00049474515,0.0015151211,0.0013316821,0.00064436416,0.0006952762,0.0002598431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039898387,0.000044020777,0.00064019655,0.00003276948,0.000008668163,0.00021669148,0.0002504959,0.013702647,0.004676509,0.9762955,0.0006809747,0.0034116618],"study_design_scores_gemma":[0.000016680498,0.000026110525,0.0004899804,0.000011258854,0.0000043520904,0.000115572584,0.00012957769,0.14020367,0.0010839044,0.85709697,0.0008057867,0.000016154072],"about_ca_topic_score_codex":0.0009087286,"about_ca_topic_score_gemma":0.00070845516,"teacher_disagreement_score":0.0023883632,"about_ca_system_score_codex":0.00037941514,"about_ca_system_score_gemma":0.00024437165,"threshold_uncertainty_score":0.007989883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7900825,0.0013252309,0.18202947,0.0009175361,0.000039786,0.00003324866,0.00029036222,0.00030746113,0.024974404],"genre_scores_gemma":[0.975738,0.00061503955,0.019886162,0.00024458588,0.00007596546,0.000050228304,0.00030862607,0.00007393631,0.0030074723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963737,0.00011641335,0.0000103540915,0.00008453226,0.00008453451,0.00006683061],"domain_scores_gemma":[0.99578387,0.003087892,0.00030513026,0.00024926747,0.00026602772,0.0003079029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044872,0.0002573068,0.00039748094,0.000715333,0.00062192074,0.0006616016,0.00049000187,0.0004811569,0.001799692],"category_scores_gemma":[0.0048866416,0.00032621832,0.00030885174,0.00059218257,0.001220164,0.0019482614,0.0011009261,0.001010775,0.00025172863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015062248,0.000044137047,0.0026437172,0.00016689615,0.000019637971,0.0005412304,0.00070936856,0.027716143,0.021379331,0.92230475,0.0033935872,0.020930614],"study_design_scores_gemma":[0.000036502573,0.000070804,0.0027110428,0.00003215914,0.00002197015,0.00078358955,0.0001916701,0.08987882,0.00595111,0.8937843,0.0065180543,0.000020063486],"about_ca_topic_score_codex":0.00044416334,"about_ca_topic_score_gemma":0.00049660105,"teacher_disagreement_score":0.001799692,"about_ca_system_score_codex":0.00031556984,"about_ca_system_score_gemma":0.0001788171,"threshold_uncertainty_score":0.0060206056},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4179986,0.0017790745,0.52859443,0.0021663967,0.00017940022,0.00027370296,0.00052401004,0.0006052431,0.047879115],"genre_scores_gemma":[0.95470566,0.0008702418,0.026941177,0.0004604189,0.00007430051,0.0003830863,0.00041354282,0.0002777362,0.015873792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850225,0.00041644266,0.000047497077,0.00031258486,0.00027090329,0.0004502969],"domain_scores_gemma":[0.9933263,0.0042821015,0.00064419117,0.00062387006,0.0003151084,0.0008084912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018508548,0.00078229886,0.0007930562,0.00081977353,0.0011955496,0.0022518656,0.0019891274,0.0015359356,0.009645889],"category_scores_gemma":[0.010907851,0.0007975115,0.0011283315,0.0006418781,0.0021965695,0.004481806,0.0023744782,0.0026419105,0.0009142151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008034261,0.00017344844,0.0018709366,0.00027091193,0.00013347201,0.00027345103,0.000608951,0.25220087,0.014001631,0.7069406,0.005906126,0.016816145],"study_design_scores_gemma":[0.000088739755,0.00024082795,0.0009431709,0.00008209245,0.0000531072,0.00022081625,0.00021774428,0.6877646,0.0062392405,0.29968932,0.0043884055,0.000071926785],"about_ca_topic_score_codex":0.0027158791,"about_ca_topic_score_gemma":0.0022958608,"teacher_disagreement_score":0.009645889,"about_ca_system_score_codex":0.002304305,"about_ca_system_score_gemma":0.0018028602,"threshold_uncertainty_score":0.032268703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66701216,0.0057026944,0.21059763,0.0021222632,0.00033667163,0.00006105135,0.00032205647,0.00033438214,0.11351106],"genre_scores_gemma":[0.9616528,0.002093468,0.017711032,0.00022216239,0.00037364976,0.00007385449,0.00016119603,0.00006407099,0.017647829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.00012384212,0.00001855508,0.00007039414,0.00011987986,0.00011444985],"domain_scores_gemma":[0.9993131,0.0003259765,0.00013034204,0.000098286815,0.00006940891,0.00006281861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503853,0.00063406385,0.00049425685,0.0016218857,0.0010043976,0.0016063014,0.00048858963,0.0006980937,0.0031546345],"category_scores_gemma":[0.0028729471,0.00027203996,0.0005829366,0.0014068024,0.002379975,0.002154285,0.0009622803,0.0012973993,0.00080996077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003452392,0.000008960235,0.0002023582,0.000018176857,0.000003526518,0.00006625474,0.00009232536,0.0024587882,0.0009322291,0.98731065,0.0004313176,0.008440932],"study_design_scores_gemma":[0.000013112702,0.000018083263,0.00028569478,0.000013905226,0.0000052425626,0.00014873403,0.000033475008,0.013271403,0.00075439684,0.9818326,0.0036079714,0.000015236379],"about_ca_topic_score_codex":0.0028190878,"about_ca_topic_score_gemma":0.0020967447,"teacher_disagreement_score":0.0031546345,"about_ca_system_score_codex":0.001366354,"about_ca_system_score_gemma":0.0006637277,"threshold_uncertainty_score":0.0105533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7137063,0.00061394525,0.15417068,0.0003179922,0.0001676494,0.000041611653,0.00030927255,0.00030340222,0.13036916],"genre_scores_gemma":[0.9621763,0.0003145013,0.023902029,0.00010208687,0.00006574537,0.000028319047,0.0003242769,0.00012830745,0.012958539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997018,0.000053405503,0.000021692846,0.0000641003,0.00007741379,0.00008157211],"domain_scores_gemma":[0.99958855,0.000098497476,0.00005024765,0.00012454405,0.00007094838,0.00006720795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025357743,0.0002218572,0.00034911028,0.0004681984,0.0009942704,0.0008615908,0.00038810514,0.00034724944,0.00463749],"category_scores_gemma":[0.0008051329,0.00022655509,0.000564385,0.0002876483,0.0012194732,0.001135085,0.00077533635,0.00058228004,0.00056598114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000944908,0.0000097266775,0.00067986647,0.000044725482,0.0000069136586,0.00025879903,0.00059868465,0.006895219,0.010662682,0.96455806,0.0016377151,0.014553005],"study_design_scores_gemma":[0.000043954813,0.000082657156,0.0017130572,0.000039359787,0.000017824708,0.00074601604,0.0005225234,0.029511867,0.009569316,0.9241975,0.0335085,0.000047539448],"about_ca_topic_score_codex":0.0019336776,"about_ca_topic_score_gemma":0.0016605479,"teacher_disagreement_score":0.00463749,"about_ca_system_score_codex":0.0005784671,"about_ca_system_score_gemma":0.00020578636,"threshold_uncertainty_score":0.015513897},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40888393,0.001956906,0.52535605,0.0017611944,0.00021055542,0.00016925091,0.0017589587,0.0008727317,0.05903049],"genre_scores_gemma":[0.8183889,0.0009688609,0.1656163,0.0002714631,0.00014096191,0.00018025556,0.0013037561,0.00020382354,0.012925738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970387,0.00073266827,0.0002297204,0.0008280502,0.00082469016,0.00034605234],"domain_scores_gemma":[0.99135876,0.0041348524,0.0014731577,0.0015182127,0.0007124041,0.0008027233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193094,0.00078451005,0.0007238542,0.0017464479,0.0013269894,0.0035530003,0.0014012521,0.0013224701,0.006965623],"category_scores_gemma":[0.010190362,0.00075436867,0.00066050974,0.0022869653,0.0022301704,0.0050450144,0.0026706883,0.0016418275,0.001092436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678703,0.00006230764,0.003788544,0.0002480414,0.000032344513,0.00020041731,0.00055149285,0.036704063,0.0077310107,0.886187,0.0050741015,0.05915277],"study_design_scores_gemma":[0.00006467807,0.00011904414,0.002165272,0.00007621048,0.000047877413,0.0009899165,0.00035619191,0.08045138,0.0111219315,0.874558,0.02999258,0.000056937435],"about_ca_topic_score_codex":0.00062696513,"about_ca_topic_score_gemma":0.00091483205,"teacher_disagreement_score":0.006965623,"about_ca_system_score_codex":0.0019567208,"about_ca_system_score_gemma":0.0005629535,"threshold_uncertainty_score":0.023302376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8391098,0.0007157783,0.12967995,0.00043349815,0.00010432207,0.0001286407,0.00059234013,0.00051956193,0.028716223],"genre_scores_gemma":[0.94871014,0.00035557203,0.042794634,0.00015981222,0.000077360295,0.000058201967,0.00066391414,0.00012694002,0.007053405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993285,0.00011860675,0.000041054143,0.00020955861,0.00011377954,0.00018854853],"domain_scores_gemma":[0.9977679,0.00083977083,0.00043222588,0.000501851,0.00021253276,0.00024567344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004153221,0.0004426474,0.0004607464,0.00095745263,0.0011996061,0.0012516315,0.0006704419,0.0006637669,0.0056934496],"category_scores_gemma":[0.0037884617,0.00047777986,0.0006866765,0.0007230379,0.0014800247,0.0018312641,0.0009088304,0.00080633594,0.0006807476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005909821,0.00014882382,0.007012727,0.0002831461,0.00005942111,0.000939413,0.0010414005,0.029574057,0.041910864,0.8513208,0.00575198,0.061366312],"study_design_scores_gemma":[0.000115954506,0.00027437857,0.004598863,0.00010019267,0.00007690651,0.0015143668,0.00078744156,0.06401171,0.022353375,0.8765571,0.029514534,0.00009510672],"about_ca_topic_score_codex":0.0018386741,"about_ca_topic_score_gemma":0.002940674,"teacher_disagreement_score":0.0056934496,"about_ca_system_score_codex":0.00072555663,"about_ca_system_score_gemma":0.00052079867,"threshold_uncertainty_score":0.019046426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69446355,0.0011863466,0.1551319,0.0022745652,0.00034202627,0.00007151905,0.0004791457,0.00029186075,0.14575902],"genre_scores_gemma":[0.95134306,0.00076996663,0.033117197,0.0002043135,0.00018323663,0.00007262935,0.00040677993,0.00009511106,0.013807692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926156,0.00016367478,0.0000314003,0.000100487094,0.00019739615,0.00024539957],"domain_scores_gemma":[0.9962424,0.0023077598,0.0002909058,0.0004553975,0.00031572254,0.0003878905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011056231,0.00057473715,0.00042793687,0.0010518909,0.0015774574,0.0024091066,0.0008107117,0.00075411174,0.0061149662],"category_scores_gemma":[0.00436521,0.0003710174,0.0005955211,0.00076763064,0.0032008092,0.0035795404,0.0016795635,0.002166538,0.0011300676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011277995,0.0000380765,0.00092391483,0.00006272745,0.0000058381356,0.00018863399,0.00032310595,0.00457397,0.0036128375,0.97799623,0.0017797109,0.0103821345],"study_design_scores_gemma":[0.000015455957,0.000059628463,0.0003438149,0.0000360019,0.000011424747,0.00031763854,0.00026501098,0.013138328,0.005058721,0.97402716,0.0066977805,0.000029015235],"about_ca_topic_score_codex":0.00091263716,"about_ca_topic_score_gemma":0.001346111,"teacher_disagreement_score":0.0061149662,"about_ca_system_score_codex":0.00078895723,"about_ca_system_score_gemma":0.0007077863,"threshold_uncertainty_score":0.020456553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.778309,0.00050057605,0.18092841,0.00071133993,0.00008728158,0.000079557525,0.0002886566,0.00027160184,0.0388236],"genre_scores_gemma":[0.96117646,0.0002551878,0.03275268,0.00018503513,0.00004569928,0.00006350691,0.00019248079,0.000028217219,0.005300673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997032,0.000059594768,0.0000160057,0.0000724665,0.00006267615,0.00008602845],"domain_scores_gemma":[0.9985006,0.00066354143,0.00030582183,0.00021660613,0.0001553978,0.00015803942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024259408,0.00037429683,0.00025282736,0.00066015613,0.0007553128,0.0009097098,0.0003496237,0.0005995707,0.001958271],"category_scores_gemma":[0.0016128492,0.0002876532,0.00041747236,0.0006650742,0.001511312,0.0009728567,0.00066063856,0.0010901043,0.00028918954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105515064,0.000038796545,0.0011275503,0.000051746658,0.000012332625,0.0005588844,0.00039563735,0.009831054,0.012976954,0.96013224,0.0013834718,0.013385835],"study_design_scores_gemma":[0.00003125733,0.00009187407,0.0012627399,0.000015947471,0.000014417881,0.00096976245,0.0002099834,0.04322305,0.008236815,0.9377804,0.008129995,0.000033767265],"about_ca_topic_score_codex":0.0011173217,"about_ca_topic_score_gemma":0.0011193996,"teacher_disagreement_score":0.001958271,"about_ca_system_score_codex":0.00049003225,"about_ca_system_score_gemma":0.00033050324,"threshold_uncertainty_score":0.006551087},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27009836,0.0032071664,0.54876614,0.0035587451,0.00025717632,0.000272139,0.0035711646,0.00298803,0.16728114],"genre_scores_gemma":[0.7493417,0.0028511568,0.19615483,0.0016533631,0.0002610423,0.00046231397,0.0035212997,0.0004688457,0.045285523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994041,0.00015401308,0.00003171303,0.0001665334,0.000118049895,0.00012559874],"domain_scores_gemma":[0.99785006,0.0009951756,0.0002190722,0.00037101252,0.0002880221,0.00027661698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039978835,0.00044599405,0.00033355947,0.00082128687,0.0014324725,0.0023387147,0.0010108193,0.00061030925,0.012902617],"category_scores_gemma":[0.0021991367,0.00041510147,0.00042123607,0.0020111976,0.0011706097,0.002985136,0.001690763,0.0014549978,0.0020872252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026720169,0.00013942242,0.002765022,0.00041581906,0.000058404723,0.0004137688,0.0008676479,0.013561129,0.01495377,0.8606574,0.021351717,0.084548675],"study_design_scores_gemma":[0.000092320784,0.00009201402,0.0018829461,0.0001014134,0.0000616236,0.0009354302,0.00070734427,0.06628301,0.011000786,0.8241732,0.094609186,0.000060709477],"about_ca_topic_score_codex":0.003149205,"about_ca_topic_score_gemma":0.0034945586,"teacher_disagreement_score":0.012902617,"about_ca_system_score_codex":0.0018354965,"about_ca_system_score_gemma":0.0008503238,"threshold_uncertainty_score":0.043163538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5680768,0.0025412238,0.34596673,0.0029262532,0.00023080508,0.00040117107,0.0015175636,0.00276821,0.075571254],"genre_scores_gemma":[0.7746549,0.001985227,0.19180189,0.00105744,0.00030002673,0.00038127517,0.0031888543,0.0014402423,0.025190197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975581,0.0005972763,0.00013897642,0.000603794,0.0005022448,0.0005996226],"domain_scores_gemma":[0.97877216,0.014264985,0.0020862406,0.0034468763,0.0006897836,0.00073993456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010964737,0.0013925047,0.0008984075,0.0011458544,0.0020787308,0.0031318215,0.004031861,0.0014760864,0.013335426],"category_scores_gemma":[0.011024633,0.0013776126,0.0013606468,0.0018778811,0.0033069048,0.0074772574,0.0036597368,0.002805794,0.002757115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002293495,0.00084946974,0.009880831,0.0021986559,0.00025879202,0.0017122253,0.0023289816,0.16058639,0.095954545,0.5152998,0.033533543,0.17510325],"study_design_scores_gemma":[0.00025501425,0.00036608236,0.0050095255,0.0001582494,0.00021276354,0.001655678,0.0005607019,0.22483225,0.029789768,0.7136522,0.023394037,0.00011381745],"about_ca_topic_score_codex":0.0029682894,"about_ca_topic_score_gemma":0.008144014,"teacher_disagreement_score":0.013335426,"about_ca_system_score_codex":0.0023816037,"about_ca_system_score_gemma":0.001111188,"threshold_uncertainty_score":0.044611454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39058506,0.004154387,0.29991108,0.0036297962,0.0007323773,0.000121219295,0.00054509443,0.00043044676,0.29989052],"genre_scores_gemma":[0.91459644,0.002522985,0.056557145,0.00047943334,0.00048197838,0.00009607729,0.00031382675,0.00012038627,0.024831709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995912,0.000097074655,0.000025245048,0.000079113226,0.00012675674,0.000080597616],"domain_scores_gemma":[0.999198,0.00043056704,0.00009869937,0.00006549763,0.000103665174,0.00010354896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007436069,0.00060441147,0.0004798524,0.0013064239,0.0011605048,0.0019399021,0.0006601262,0.0006483779,0.009047634],"category_scores_gemma":[0.0021799288,0.00033519414,0.0005552682,0.0010884835,0.0023719943,0.0026496525,0.0015343677,0.002836399,0.0010719396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020391752,0.000011550802,0.00023675936,0.000034661018,0.0000027718856,0.00012248372,0.00015613926,0.00058671366,0.0008618307,0.9890877,0.0009848956,0.007894083],"study_design_scores_gemma":[0.000019925843,0.00010681144,0.0005962267,0.000028195827,0.000008657484,0.00037421793,0.00034395314,0.0055172485,0.002378278,0.97315943,0.017436482,0.000030601495],"about_ca_topic_score_codex":0.00068929355,"about_ca_topic_score_gemma":0.00066003215,"teacher_disagreement_score":0.009047634,"about_ca_system_score_codex":0.000577446,"about_ca_system_score_gemma":0.00028665506,"threshold_uncertainty_score":0.030267358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85359985,0.0011827184,0.07481069,0.0012739266,0.00021441265,0.00005680823,0.0003007334,0.00083814526,0.06772275],"genre_scores_gemma":[0.97769016,0.00044220863,0.006295469,0.00021322457,0.00017755553,0.00008836349,0.00026378024,0.00022487243,0.014604421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993043,0.00015784899,0.000032407712,0.000087436594,0.00021000528,0.00020804396],"domain_scores_gemma":[0.99662966,0.001507574,0.0005781972,0.0002615128,0.0005801301,0.00044285328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010737855,0.0005696027,0.0005524144,0.0021264812,0.001264993,0.0018812913,0.0010363656,0.0009171007,0.007275799],"category_scores_gemma":[0.011889126,0.00038462578,0.00057128,0.0007950811,0.0019111353,0.0025286903,0.0013953196,0.001504283,0.0012509068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117448995,0.00006379145,0.0026278314,0.00011421748,0.000022795271,0.00048478335,0.00040832272,0.009650078,0.008666359,0.9631645,0.002743211,0.0119367065],"study_design_scores_gemma":[0.0000516471,0.00010268804,0.0033595844,0.00016688241,0.000062427775,0.0010025448,0.00026007913,0.22381862,0.009536272,0.7553395,0.006211644,0.00008817314],"about_ca_topic_score_codex":0.0023490007,"about_ca_topic_score_gemma":0.0021215251,"teacher_disagreement_score":0.007275799,"about_ca_system_score_codex":0.0018226973,"about_ca_system_score_gemma":0.0009909407,"threshold_uncertainty_score":0.024339914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8938882,0.0002947034,0.07340471,0.0026962245,0.00008584852,0.00006253975,0.0004396381,0.00047242502,0.028655734],"genre_scores_gemma":[0.98705715,0.00026047407,0.0067412267,0.0002908116,0.00008970746,0.000039500523,0.00058699417,0.000062108746,0.0048719267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921966,0.00009340203,0.000044264383,0.00028182546,0.00018032099,0.0001804359],"domain_scores_gemma":[0.9950122,0.0025563652,0.000564023,0.0009639229,0.00043600472,0.00046741357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056653353,0.0004670762,0.00038712425,0.00057053316,0.0011731465,0.001935645,0.0010788275,0.0010279132,0.006147189],"category_scores_gemma":[0.0055707335,0.00045024836,0.00077446096,0.0008350541,0.0023984632,0.004924216,0.001372023,0.0015575412,0.0004854808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053560047,0.0004931106,0.023651943,0.00034090874,0.00009365724,0.0014909948,0.0038329693,0.02478207,0.019474119,0.8596096,0.0076770475,0.05801794],"study_design_scores_gemma":[0.00007868485,0.00012715056,0.0038190437,0.00004120384,0.00003840737,0.00062553777,0.0011090438,0.032987878,0.0062151095,0.94705373,0.007870838,0.00003334406],"about_ca_topic_score_codex":0.0037636664,"about_ca_topic_score_gemma":0.0028915121,"teacher_disagreement_score":0.006147189,"about_ca_system_score_codex":0.0009696296,"about_ca_system_score_gemma":0.00066857587,"threshold_uncertainty_score":0.020564377},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25931853,0.029756667,0.23554878,0.029548656,0.003749235,0.00016293288,0.0012159854,0.0012899708,0.43940923],"genre_scores_gemma":[0.881683,0.019685052,0.05157978,0.0023260007,0.003852241,0.000082403974,0.0006074886,0.00033361933,0.03985047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914443,0.00019360312,0.000037438334,0.00022226742,0.00016785979,0.000234437],"domain_scores_gemma":[0.997095,0.0021216683,0.00017403628,0.00024062055,0.00016160586,0.00020703893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995427,0.0011738837,0.0008075724,0.0021126724,0.002279684,0.0026645395,0.0009917656,0.0010068341,0.0072519872],"category_scores_gemma":[0.004463932,0.00063901907,0.0013634897,0.002538095,0.005527899,0.0070676226,0.0023183057,0.0042726262,0.0014255986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108026456,0.000045096895,0.0007505247,0.00011498632,0.0000113263295,0.00028028054,0.0005852246,0.0019591607,0.00088068075,0.9663707,0.010370738,0.018523281],"study_design_scores_gemma":[0.000019464058,0.000060910657,0.0005520436,0.00003759087,0.000015201546,0.00033132077,0.00020255127,0.003413279,0.000895535,0.95634216,0.038100436,0.000029613011],"about_ca_topic_score_codex":0.0083517255,"about_ca_topic_score_gemma":0.005372413,"teacher_disagreement_score":0.0083517255,"about_ca_system_score_codex":0.0027215262,"about_ca_system_score_gemma":0.00081872975,"threshold_uncertainty_score":0.024260283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30842915,0.0024743485,0.6171639,0.0011017963,0.00026899003,0.00014861814,0.0012758301,0.0014236292,0.0677138],"genre_scores_gemma":[0.8666094,0.0013446284,0.12058333,0.00041893197,0.00014846177,0.00022034034,0.0014176699,0.0003499725,0.008907311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971078,0.0005779298,0.00020241489,0.00069267064,0.0007544403,0.0006647102],"domain_scores_gemma":[0.9918296,0.0042311857,0.0012357733,0.0014809502,0.0005807719,0.0006417313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016605408,0.0010115288,0.001042601,0.0027506368,0.0013188168,0.0038064665,0.0019516309,0.0011906084,0.012004652],"category_scores_gemma":[0.013268911,0.0010707123,0.0010471207,0.003234018,0.0017729459,0.005098079,0.003529058,0.002028639,0.001416636],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045176942,0.00010816208,0.008779877,0.00036177778,0.00009328921,0.00040191703,0.00063492643,0.16002136,0.0076194876,0.7183002,0.010035176,0.093192026],"study_design_scores_gemma":[0.000055402987,0.0001164851,0.0030486793,0.00011916992,0.00007750165,0.0005897289,0.0002599782,0.4351222,0.0067895246,0.5360393,0.0177298,0.000052213385],"about_ca_topic_score_codex":0.0026682739,"about_ca_topic_score_gemma":0.0024889992,"teacher_disagreement_score":0.012004652,"about_ca_system_score_codex":0.002382762,"about_ca_system_score_gemma":0.00066204596,"threshold_uncertainty_score":0.040159523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88535273,0.00048832747,0.102868974,0.00030708784,0.000042965745,0.000029627046,0.00018927513,0.00008842261,0.010632649],"genre_scores_gemma":[0.97587085,0.0007055309,0.01851721,0.00007105076,0.00011183697,0.000056236444,0.0003178352,0.000107390006,0.0042422265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932206,0.00014856378,0.000029464156,0.00012964042,0.00020096327,0.00016934621],"domain_scores_gemma":[0.99406743,0.0037551448,0.0007723165,0.00042844095,0.00048422418,0.00049248844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012665825,0.0007355613,0.00083479786,0.0031182482,0.0011435748,0.0019127276,0.0015252954,0.0009330755,0.00457951],"category_scores_gemma":[0.00907369,0.0004406758,0.00056792895,0.0029131877,0.0017720534,0.004649751,0.0016341397,0.0009603921,0.0003712334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043581444,0.000088034365,0.0057690297,0.00028340792,0.00012809513,0.00029384866,0.00054294756,0.03311893,0.015789596,0.90316516,0.0017644358,0.038620725],"study_design_scores_gemma":[0.00004411084,0.00009997785,0.0020078933,0.000038650353,0.00009202647,0.00033020452,0.00024072165,0.1266298,0.0050196038,0.8631199,0.0023528093,0.00002434513],"about_ca_topic_score_codex":0.000629239,"about_ca_topic_score_gemma":0.000643028,"teacher_disagreement_score":0.00457951,"about_ca_system_score_codex":0.00090393843,"about_ca_system_score_gemma":0.00032016792,"threshold_uncertainty_score":0.015320003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8234793,0.00051439874,0.110226795,0.0007989388,0.00011232656,0.0000636055,0.0004167069,0.00039842786,0.06398959],"genre_scores_gemma":[0.9703939,0.00045069004,0.022817153,0.00017392568,0.000068541965,0.000049547078,0.00035927555,0.00005294755,0.0056339004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997595,0.0000205977,0.000009781653,0.00005590045,0.00007398695,0.00008022053],"domain_scores_gemma":[0.9994842,0.00014572812,0.000111023226,0.000067685505,0.00008158312,0.00010970151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016125293,0.00036952939,0.00032495282,0.0011251116,0.0010152695,0.0010144602,0.00062315457,0.00045468396,0.0041004005],"category_scores_gemma":[0.0009982465,0.00019408172,0.00036447644,0.0010665893,0.0011234777,0.0012549758,0.001346978,0.00066688913,0.00043127104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002211602,0.000081112375,0.0022578237,0.00009158355,0.000022531698,0.00074628834,0.00071484456,0.006286488,0.022541286,0.9162253,0.0028574278,0.047954075],"study_design_scores_gemma":[0.000022931099,0.000042428084,0.0021504655,0.000023972736,0.000032303265,0.0008751882,0.00050391705,0.021036262,0.0084347585,0.9536894,0.013157391,0.000031074993],"about_ca_topic_score_codex":0.0004927677,"about_ca_topic_score_gemma":0.0007490573,"teacher_disagreement_score":0.0041004005,"about_ca_system_score_codex":0.00040285563,"about_ca_system_score_gemma":0.00031098624,"threshold_uncertainty_score":0.013717234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8766461,0.00095189153,0.08790688,0.00046814614,0.00016793128,0.00006190781,0.00095115154,0.0007883913,0.032057513],"genre_scores_gemma":[0.9760686,0.00038039763,0.018313635,0.000103724924,0.0000832376,0.000059911505,0.0007490199,0.00014142689,0.004099995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995271,0.000075946075,0.000026762746,0.00015989921,0.000113558664,0.00009672883],"domain_scores_gemma":[0.9971943,0.0012383887,0.00044525097,0.0003324602,0.0002823041,0.00050720375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045608933,0.00055430765,0.000496127,0.0021254404,0.0009232272,0.0013939244,0.00066208444,0.0006035218,0.0050337412],"category_scores_gemma":[0.003600129,0.0003650072,0.0005210137,0.0010357097,0.0012483228,0.0017100949,0.0008950274,0.00090966764,0.0005873148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023659295,0.00030293703,0.023191597,0.000834714,0.00030714498,0.0020731783,0.0015718063,0.07344292,0.1507136,0.60196584,0.019192297,0.12403803],"study_design_scores_gemma":[0.00012617097,0.0004256902,0.02289821,0.00011088475,0.00022195747,0.005465006,0.0005548527,0.19887102,0.049523458,0.6926469,0.029021574,0.00013429383],"about_ca_topic_score_codex":0.000714719,"about_ca_topic_score_gemma":0.00056696945,"teacher_disagreement_score":0.0050337412,"about_ca_system_score_codex":0.0008951626,"about_ca_system_score_gemma":0.00036328917,"threshold_uncertainty_score":0.016839504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4737597,0.0010826897,0.49016637,0.0012493549,0.00012276304,0.00015224438,0.0015567695,0.0012063351,0.030703852],"genre_scores_gemma":[0.8351345,0.0006032467,0.15150808,0.00040065197,0.00013282329,0.00018205158,0.0016292089,0.00035309093,0.010056337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736613,0.0007183994,0.00018764746,0.00067906594,0.00057031633,0.0004784378],"domain_scores_gemma":[0.9916855,0.0033901148,0.0009723848,0.0025332908,0.0006540313,0.0007648209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017648201,0.00067737495,0.0007784483,0.0011947904,0.0016373923,0.0024353294,0.0017845018,0.0011669802,0.0038824915],"category_scores_gemma":[0.010475737,0.00067014736,0.0011570184,0.0015925574,0.002397487,0.0054559177,0.0029197827,0.002440353,0.0006388909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000531366,0.00007888151,0.002174872,0.00019904212,0.000043488664,0.00022811108,0.0015097461,0.06871396,0.011036183,0.85721666,0.0046061273,0.053661637],"study_design_scores_gemma":[0.000030828465,0.000091876405,0.0008468504,0.00004387069,0.000032916494,0.00019214413,0.00028061352,0.08108331,0.0043727127,0.9035863,0.009391618,0.000046989597],"about_ca_topic_score_codex":0.0023746702,"about_ca_topic_score_gemma":0.0029444923,"teacher_disagreement_score":0.0038824915,"about_ca_system_score_codex":0.0016349762,"about_ca_system_score_gemma":0.00067663396,"threshold_uncertainty_score":0.012988269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89352304,0.00048656756,0.07302747,0.00019827415,0.000049182745,0.00004848733,0.00034177932,0.00014618997,0.03217899],"genre_scores_gemma":[0.9809106,0.0002272994,0.012605318,0.00006552731,0.00006381141,0.000048259473,0.00045478047,0.00002265894,0.0056016557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997241,0.000032224594,0.00002205875,0.000081855556,0.000089773945,0.000049981925],"domain_scores_gemma":[0.99940705,0.00017688228,0.0001445895,0.000048867994,0.0001291678,0.00009339567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018199938,0.00022211902,0.0002464682,0.0010925386,0.00067955005,0.00070020446,0.00026461802,0.00040149523,0.003208756],"category_scores_gemma":[0.0013341601,0.00013450721,0.00015550535,0.00061992905,0.0006325404,0.0009507522,0.0004718483,0.0003014633,0.00047854078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002660192,0.0000654986,0.009636479,0.00016026349,0.000016723538,0.0012243192,0.0018108999,0.005790311,0.10866776,0.79499495,0.0021587336,0.07520795],"study_design_scores_gemma":[0.000038789232,0.00040972314,0.019206967,0.00011960043,0.000044423155,0.005665592,0.0010188777,0.0945472,0.041508824,0.76600516,0.07133223,0.000102574275],"about_ca_topic_score_codex":0.0003467445,"about_ca_topic_score_gemma":0.00037329725,"teacher_disagreement_score":0.003208756,"about_ca_system_score_codex":0.0004084313,"about_ca_system_score_gemma":0.00022726125,"threshold_uncertainty_score":0.010734379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6358649,0.000754456,0.308637,0.000731262,0.00006337011,0.00010940658,0.001173302,0.0008224594,0.051843792],"genre_scores_gemma":[0.8988758,0.0006022772,0.08534126,0.00026323425,0.0000624502,0.00010089631,0.0012651474,0.00021977606,0.013269187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993457,0.00013379022,0.000029796885,0.00019326704,0.00014972767,0.00014765863],"domain_scores_gemma":[0.9988085,0.0005153902,0.00016853726,0.00018589555,0.00016950908,0.00015214705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033015557,0.00057649665,0.00037938022,0.001488848,0.0008625559,0.002132636,0.0007652282,0.0006886793,0.0065444247],"category_scores_gemma":[0.0021080752,0.00057024637,0.00059879344,0.0016823675,0.0011496876,0.0030606524,0.0021651634,0.0011161068,0.0007411432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039253375,0.000082709805,0.0037781459,0.00033025022,0.00008233991,0.00032646416,0.0007960958,0.037021507,0.029141381,0.85543174,0.0045109345,0.06810599],"study_design_scores_gemma":[0.000054480595,0.00007388714,0.0027389785,0.000076942364,0.00007751543,0.00062605226,0.000518075,0.109536126,0.010449069,0.8564368,0.019361459,0.00005063188],"about_ca_topic_score_codex":0.002575467,"about_ca_topic_score_gemma":0.0030604561,"teacher_disagreement_score":0.0065444247,"about_ca_system_score_codex":0.0016057098,"about_ca_system_score_gemma":0.00044295745,"threshold_uncertainty_score":0.021893263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89536536,0.00042498464,0.07385068,0.0008826755,0.000072839124,0.00003606806,0.0006842645,0.0006025337,0.028080683],"genre_scores_gemma":[0.9735649,0.0005535534,0.018689578,0.00012966293,0.00008970464,0.00010829498,0.0008581222,0.000111521214,0.005894723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995635,0.00010108753,0.000016390568,0.00012592561,0.00012115358,0.0000718007],"domain_scores_gemma":[0.99679273,0.0016544685,0.000510541,0.00036619397,0.00037157247,0.00030439722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004217055,0.00034618165,0.00040774603,0.0016507054,0.0007642188,0.0013216818,0.0011499932,0.0010661813,0.0047416654],"category_scores_gemma":[0.0066338503,0.00038299704,0.00035281578,0.0009132191,0.0013738038,0.0025720445,0.0010495451,0.00061506435,0.000431256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040202783,0.00006951491,0.011097497,0.00036468235,0.00007198599,0.0006188279,0.00044515642,0.08074177,0.047559932,0.802363,0.0065092873,0.04975629],"study_design_scores_gemma":[0.000056604735,0.000087283624,0.009230292,0.000071841314,0.00007700248,0.0018124213,0.0003326783,0.29127783,0.024687015,0.6632449,0.009044204,0.00007798993],"about_ca_topic_score_codex":0.0004837271,"about_ca_topic_score_gemma":0.00053492584,"teacher_disagreement_score":0.0047416654,"about_ca_system_score_codex":0.000869582,"about_ca_system_score_gemma":0.00035689797,"threshold_uncertainty_score":0.015862465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6923054,0.00060251204,0.28243423,0.00059637544,0.00014512455,0.000073723764,0.00028406907,0.00042842826,0.023130279],"genre_scores_gemma":[0.9675803,0.00023770315,0.022190347,0.00018260023,0.00009391031,0.0000919607,0.0001914386,0.00010901083,0.009322741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991615,0.00023124478,0.000043051,0.00015257695,0.0002470341,0.00016468906],"domain_scores_gemma":[0.9971842,0.0013194175,0.0003883879,0.00045115786,0.00032711966,0.00032973845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013792089,0.00029551613,0.00062409573,0.0012050454,0.000749555,0.0016228844,0.0009740057,0.00076951436,0.003912898],"category_scores_gemma":[0.0080833705,0.00041067685,0.0005423364,0.000623295,0.0019853266,0.002503575,0.0010675637,0.0009523328,0.0006026407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041755924,0.000012851657,0.00038964456,0.000020779684,0.0000056707004,0.00010591168,0.00010236423,0.0072676195,0.002346155,0.986005,0.00057425955,0.0031280261],"study_design_scores_gemma":[0.000024734953,0.00004576652,0.00092103705,0.000028076958,0.000007453785,0.00022412726,0.000078471494,0.18940774,0.0027616632,0.80506045,0.0013968206,0.000043760432],"about_ca_topic_score_codex":0.00072642794,"about_ca_topic_score_gemma":0.0011220312,"teacher_disagreement_score":0.003912898,"about_ca_system_score_codex":0.0012450194,"about_ca_system_score_gemma":0.00046374512,"threshold_uncertainty_score":0.013089955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44418582,0.0013457584,0.46356493,0.0006965642,0.00026182862,0.00017585099,0.0005439332,0.00048780083,0.08873754],"genre_scores_gemma":[0.91942537,0.00036247703,0.06709746,0.00017847965,0.00009493621,0.00017656642,0.00030551877,0.000078651305,0.012280574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909055,0.00017348719,0.00003901733,0.00020569778,0.00019331354,0.0002978483],"domain_scores_gemma":[0.9980368,0.0007810662,0.00028805787,0.00043476734,0.00019106764,0.0002682824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010003871,0.00043184185,0.00043427144,0.0008396771,0.0018734542,0.0019419582,0.00060766196,0.0009380369,0.0067984234],"category_scores_gemma":[0.003957401,0.0003563158,0.00057290413,0.00066850515,0.0019716234,0.0029344524,0.0015595024,0.001651946,0.00073458476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051156174,0.0000137595325,0.00031899544,0.00003479912,0.0000048768165,0.0000844751,0.00022001442,0.00089377596,0.0022638252,0.98543614,0.0007681492,0.009910078],"study_design_scores_gemma":[0.000038230235,0.0000918984,0.0004515205,0.000067124245,0.000020938252,0.0004160693,0.00032272885,0.010327087,0.010890801,0.9559762,0.021365825,0.000031601317],"about_ca_topic_score_codex":0.00060458604,"about_ca_topic_score_gemma":0.0006780409,"teacher_disagreement_score":0.0067984234,"about_ca_system_score_codex":0.0011136354,"about_ca_system_score_gemma":0.0005333442,"threshold_uncertainty_score":0.022742987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46943614,0.0018069795,0.25686032,0.0027357338,0.0008384968,0.00013407186,0.00071279256,0.0008389315,0.26663655],"genre_scores_gemma":[0.9114365,0.0007327215,0.05299423,0.00047322203,0.00033588102,0.00012926108,0.00045743506,0.0003494672,0.03309142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992636,0.00010875738,0.000043323616,0.00015403489,0.0002955219,0.00013473797],"domain_scores_gemma":[0.9990891,0.00027376512,0.00015174373,0.00013605127,0.00018759073,0.00016177578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075820857,0.00079124875,0.000592971,0.0024025226,0.0014616423,0.0024653606,0.0016479243,0.0011187007,0.013026264],"category_scores_gemma":[0.0031689934,0.0005285421,0.00079476024,0.0015802566,0.0025660659,0.005566569,0.002556581,0.002950689,0.0021091518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003102893,0.000017131846,0.00038184348,0.000043463056,0.0000034949448,0.00020326469,0.0003011145,0.0006170922,0.000836036,0.9862367,0.0025223622,0.008806462],"study_design_scores_gemma":[0.000020976024,0.00003502684,0.0008087479,0.00003766747,0.000012982085,0.0005835624,0.00020209908,0.009834656,0.0016900381,0.9745419,0.0121917445,0.0000405731],"about_ca_topic_score_codex":0.0012507859,"about_ca_topic_score_gemma":0.0013924476,"teacher_disagreement_score":0.013026264,"about_ca_system_score_codex":0.0014581076,"about_ca_system_score_gemma":0.00048491402,"threshold_uncertainty_score":0.043577194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9188851,0.00021270628,0.069381624,0.00009875058,0.000043410764,0.000020436642,0.0002410687,0.00019730093,0.010919654],"genre_scores_gemma":[0.9745948,0.00021049434,0.020604335,0.000048361784,0.000040900595,0.000033652257,0.0005302229,0.00004909026,0.0038882787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997565,0.000049382994,0.000023813196,0.000036686848,0.00006248647,0.000071114766],"domain_scores_gemma":[0.9991316,0.00027772316,0.0001964329,0.00016021656,0.00014805348,0.00008600697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017998645,0.0002943071,0.0002649707,0.0006622706,0.00036008592,0.0009602843,0.0003842468,0.00030848244,0.0031899498],"category_scores_gemma":[0.0008940111,0.00016308934,0.0002816694,0.00054538605,0.0006387715,0.0014544299,0.0005910238,0.0003130674,0.0005515061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015655204,0.00022938542,0.016783012,0.00049790484,0.0000624222,0.0013488887,0.0012355713,0.026170263,0.20419848,0.48437455,0.005974206,0.25755972],"study_design_scores_gemma":[0.00011413056,0.0010081709,0.010612684,0.000085773245,0.0001086902,0.0028091357,0.0011596243,0.13403216,0.15639412,0.66864216,0.024919407,0.000113919064],"about_ca_topic_score_codex":0.00029289577,"about_ca_topic_score_gemma":0.0004393535,"teacher_disagreement_score":0.0031899498,"about_ca_system_score_codex":0.0001909952,"about_ca_system_score_gemma":0.0003070886,"threshold_uncertainty_score":0.010671437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887724,0.00019526841,0.0873841,0.00019599735,0.0000366568,0.00003960545,0.00011029574,0.0002792376,0.024034988],"genre_scores_gemma":[0.9889072,0.00006535653,0.008709178,0.000017667473,0.000033442855,0.000015432697,0.000053329422,0.000022928649,0.002175363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974555,0.000049733324,0.000013965405,0.00004832507,0.0000903472,0.000052130614],"domain_scores_gemma":[0.9985399,0.0005126919,0.0002924026,0.0002922094,0.00013736745,0.0002254441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041076142,0.00022955246,0.00024779927,0.0013229639,0.00044352404,0.000705617,0.00045789807,0.0002262272,0.002022214],"category_scores_gemma":[0.0017459831,0.000116656294,0.0003406886,0.00043899828,0.0019244162,0.0010644018,0.0008181616,0.0004734132,0.00016985669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013112114,0.000036074303,0.0028421357,0.00006426158,0.000011557034,0.00034332887,0.00062304013,0.008752779,0.015197086,0.9572905,0.00044660055,0.014261455],"study_design_scores_gemma":[0.00003807828,0.000115107585,0.0018386861,0.000016206266,0.000017206132,0.00047701714,0.00026864707,0.0708959,0.00998113,0.91100085,0.005318989,0.00003220598],"about_ca_topic_score_codex":0.0018253626,"about_ca_topic_score_gemma":0.0018926375,"teacher_disagreement_score":0.002022214,"about_ca_system_score_codex":0.000597597,"about_ca_system_score_gemma":0.0003606554,"threshold_uncertainty_score":0.0067649484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32563263,0.0011014909,0.6660051,0.00033543873,0.00004038026,0.0000859708,0.00071885536,0.00031443784,0.0057657715],"genre_scores_gemma":[0.86787975,0.0006465518,0.12675872,0.0000902514,0.00006885065,0.0001546596,0.0013541094,0.00018827307,0.0028588928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967842,0.00073120126,0.00021369076,0.00074773526,0.0011524404,0.00037068833],"domain_scores_gemma":[0.9826805,0.010325889,0.0029289292,0.0019280119,0.0012568727,0.0008798073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017913261,0.0004206456,0.00094063906,0.003675078,0.0015208349,0.0025960107,0.0016190098,0.001417649,0.0032663622],"category_scores_gemma":[0.02626666,0.0008325418,0.00064843654,0.0051436475,0.003449156,0.0046869623,0.0033299476,0.0014161674,0.00048669387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004469841,0.00006499984,0.011945107,0.00021260131,0.00007241008,0.0006182837,0.001127525,0.22549905,0.006475727,0.6846209,0.002498634,0.06641783],"study_design_scores_gemma":[0.000043347343,0.00006599093,0.0028034619,0.000052739102,0.000020860696,0.0006213157,0.00043551833,0.34609637,0.00325516,0.64112496,0.005438202,0.00004217547],"about_ca_topic_score_codex":0.0021470934,"about_ca_topic_score_gemma":0.0020583037,"teacher_disagreement_score":0.003675078,"about_ca_system_score_codex":0.0017964066,"about_ca_system_score_gemma":0.0004956694,"threshold_uncertainty_score":0.0130339265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8151796,0.0014556716,0.09796152,0.0016103277,0.00020719566,0.000049555292,0.00021502221,0.00031900214,0.083002135],"genre_scores_gemma":[0.97548836,0.0006670767,0.012623268,0.0001481975,0.00014906896,0.000035037923,0.00021005358,0.000047499172,0.010631282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997267,0.00006235864,0.000014227358,0.000039486797,0.00007621245,0.000081077684],"domain_scores_gemma":[0.99914217,0.00042339735,0.00015837491,0.00009680581,0.0000858539,0.00009327568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026518328,0.00036094277,0.0003051609,0.0009920176,0.00074038,0.0013014409,0.00044168092,0.0007784494,0.0077440445],"category_scores_gemma":[0.0024809453,0.00017315654,0.0002196985,0.00086504215,0.0014203753,0.0029038936,0.0014381792,0.0012282904,0.00083593297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012252848,0.000042776497,0.00078862853,0.00006036078,0.000006019766,0.00051209045,0.00030937378,0.0036785307,0.004522858,0.96056956,0.0015245834,0.027862687],"study_design_scores_gemma":[0.000039514918,0.0001310832,0.001190139,0.000045578392,0.000009361337,0.0011728351,0.0003537893,0.023713145,0.010231953,0.9542648,0.008811146,0.0000366977],"about_ca_topic_score_codex":0.0002479025,"about_ca_topic_score_gemma":0.0001659772,"teacher_disagreement_score":0.0077440445,"about_ca_system_score_codex":0.00038724788,"about_ca_system_score_gemma":0.00020940734,"threshold_uncertainty_score":0.025906384},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055602316,0.00046788898,0.24693893,0.004546671,0.0005107788,0.00018058831,0.0003710984,0.0006927823,0.69068885],"genre_scores_gemma":[0.7984808,0.0002679606,0.079571865,0.0013967174,0.00012461195,0.00033142598,0.00032434647,0.0002482036,0.11925411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835,0.00086472806,0.000044666216,0.00022471078,0.00025248775,0.00026332456],"domain_scores_gemma":[0.99930215,0.0002534362,0.000036672973,0.00014462452,0.00007967297,0.00018333443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158313,0.00066016207,0.00057963823,0.00038807976,0.004205813,0.0037283944,0.0015899197,0.0018467025,0.016980374],"category_scores_gemma":[0.003410903,0.0003389872,0.00078459526,0.0004194587,0.0037366413,0.006200925,0.004146163,0.0021914304,0.0026281455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006814825,0.000016270278,0.000099412275,0.000019513052,0.0000053848266,0.00005004797,0.00039277147,0.0009558334,0.00025639802,0.98967415,0.0038592708,0.0046027447],"study_design_scores_gemma":[0.000034764536,0.0000394928,0.0001501512,0.00003468469,0.000008938563,0.00011369973,0.000577758,0.012169652,0.0006273834,0.9089849,0.07723676,0.000021815216],"about_ca_topic_score_codex":0.0025521212,"about_ca_topic_score_gemma":0.0046894457,"teacher_disagreement_score":0.016980374,"about_ca_system_score_codex":0.0014877787,"about_ca_system_score_gemma":0.0011262429,"threshold_uncertainty_score":0.056805015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12428866,0.00038375365,0.7907041,0.0004528943,0.00046329162,0.00021253932,0.0002816218,0.0009574633,0.08225561],"genre_scores_gemma":[0.54523456,0.0005500097,0.39801794,0.00028399093,0.00017556228,0.0002986862,0.00038086067,0.0005916785,0.054466724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989133,0.00018086548,0.000089292385,0.00022752107,0.00042932964,0.00015978441],"domain_scores_gemma":[0.9991339,0.00031045446,0.000058681002,0.00020915327,0.00019744453,0.00009028125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011617208,0.0005136384,0.00048229127,0.0008518026,0.0015874252,0.0024095075,0.00066780916,0.00054665154,0.01242334],"category_scores_gemma":[0.002251213,0.00047293174,0.0009874696,0.000801687,0.002696016,0.003824756,0.0019854477,0.0018569919,0.0019739603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049453138,0.000026508098,0.00041320844,0.000050457616,0.0000070685664,0.00027755107,0.00060385687,0.001914381,0.009990989,0.9506289,0.00093169755,0.035105996],"study_design_scores_gemma":[0.000030554584,0.0001567077,0.0008658164,0.00005027506,0.000036590256,0.0005887388,0.00050351326,0.022351738,0.072339326,0.8243825,0.07860071,0.000093504685],"about_ca_topic_score_codex":0.0012914643,"about_ca_topic_score_gemma":0.0022830432,"teacher_disagreement_score":0.01242334,"about_ca_system_score_codex":0.00084435224,"about_ca_system_score_gemma":0.0006584888,"threshold_uncertainty_score":0.041560173},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21487862,0.0023004054,0.07210877,0.05540094,0.005203532,0.0002763322,0.0016252162,0.0015510147,0.64665514],"genre_scores_gemma":[0.9130595,0.0017692125,0.01958133,0.007173974,0.0010158595,0.0002456216,0.0012631759,0.00015337995,0.055738013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978586,0.00014848889,0.000114997245,0.000758873,0.0006006217,0.0005183661],"domain_scores_gemma":[0.9950482,0.001750458,0.00038044347,0.0012559018,0.0011711998,0.00039371412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011717025,0.0007179535,0.0017636839,0.0015038241,0.00536383,0.004013235,0.0015830775,0.002708365,0.018770404],"category_scores_gemma":[0.009823018,0.0006806179,0.00113357,0.0019050237,0.0055445824,0.007195419,0.0032912882,0.0033006305,0.0030367768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000136424,0.000063253414,0.002865328,0.00019458837,0.000027845612,0.00026019537,0.0013217239,0.0010791892,0.0009293107,0.92841476,0.041131783,0.023575597],"study_design_scores_gemma":[0.00012370445,0.000046415542,0.0020894725,0.00008587392,0.00006138806,0.0006052513,0.0012317688,0.0058718435,0.001948669,0.85614884,0.1317277,0.000059056823],"about_ca_topic_score_codex":0.011579459,"about_ca_topic_score_gemma":0.01100272,"teacher_disagreement_score":0.018770404,"about_ca_system_score_codex":0.003698884,"about_ca_system_score_gemma":0.0023903796,"threshold_uncertainty_score":0.062793255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8189823,0.0010362135,0.04373656,0.001699304,0.0004656402,0.00009857071,0.0037550237,0.0006243535,0.12960209],"genre_scores_gemma":[0.92877245,0.0010449187,0.034550812,0.00036638716,0.00009756758,0.00010038066,0.0038086544,0.000325826,0.030933067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991123,0.00009017416,0.000055569784,0.00028773234,0.0001620952,0.00029207373],"domain_scores_gemma":[0.9985279,0.00039345113,0.0004941593,0.00025066477,0.00011498706,0.00021891369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754511,0.00089480495,0.00061111077,0.00069288036,0.00095864746,0.0022284796,0.00072690024,0.00072893035,0.013612107],"category_scores_gemma":[0.0014669097,0.00035645903,0.0006089354,0.001336651,0.0017904378,0.0017370137,0.0009792132,0.001096271,0.0033320198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002205258,0.00027899176,0.016153375,0.0008851293,0.0002223366,0.0019565201,0.0010679167,0.026610564,0.09528334,0.62099427,0.053738788,0.18060352],"study_design_scores_gemma":[0.00017351219,0.0005443144,0.033021398,0.0002496994,0.0002495066,0.0056878626,0.0009887007,0.03933385,0.07575587,0.61260206,0.23097612,0.000417096],"about_ca_topic_score_codex":0.001435135,"about_ca_topic_score_gemma":0.0022439118,"teacher_disagreement_score":0.013612107,"about_ca_system_score_codex":0.00139652,"about_ca_system_score_gemma":0.00059996225,"threshold_uncertainty_score":0.045537055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119157605,0.000793038,0.7634265,0.0010519876,0.0008128108,0.00031779276,0.0013251067,0.0028889729,0.11022618],"genre_scores_gemma":[0.56486106,0.00070314074,0.36788392,0.00062289764,0.00016470789,0.00056885736,0.0015604472,0.0007180497,0.06291692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938595,0.00006670334,0.000046843747,0.00020401063,0.00016649067,0.00013011943],"domain_scores_gemma":[0.9995196,0.00010546463,0.000068485984,0.00017233012,0.00008256347,0.000051600033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045674783,0.00046119484,0.000544516,0.00079400855,0.0011042604,0.0010619628,0.0014010279,0.0006156769,0.0137155205],"category_scores_gemma":[0.0010928113,0.00052583916,0.0009087447,0.0008510379,0.0012226601,0.0023247965,0.002768729,0.0013145806,0.0042455043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004685294,0.000118591764,0.0011248155,0.00042639548,0.000052983978,0.00030418206,0.0006582823,0.0023421994,0.08315664,0.7492055,0.009302518,0.15283927],"study_design_scores_gemma":[0.0001771607,0.00043245652,0.0021997076,0.00012336888,0.00018291902,0.0012050192,0.00032402627,0.027738769,0.19565594,0.49606583,0.27568445,0.00021028565],"about_ca_topic_score_codex":0.00031624842,"about_ca_topic_score_gemma":0.0005200184,"teacher_disagreement_score":0.0137155205,"about_ca_system_score_codex":0.0006831758,"about_ca_system_score_gemma":0.00056608336,"threshold_uncertainty_score":0.04588306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09178647,0.0017481712,0.5875998,0.015111857,0.0011733857,0.00039679345,0.000669908,0.00059850747,0.300915],"genre_scores_gemma":[0.78452116,0.0013918757,0.122616716,0.005100185,0.00051918346,0.00032225923,0.00047271696,0.00015021022,0.08490574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979777,0.0007434542,0.00010478062,0.00045292173,0.00041036928,0.00031084727],"domain_scores_gemma":[0.9970757,0.001493325,0.00019161667,0.0004888828,0.00042215633,0.00032828443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014662525,0.0007366335,0.00069166673,0.0004560185,0.0015581666,0.0032509658,0.0013771928,0.0028756245,0.009355978],"category_scores_gemma":[0.0060928883,0.0003802389,0.00076843245,0.0005169087,0.0039067194,0.0072979433,0.0023652697,0.0036336193,0.0011521067],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008826639,0.000037028858,0.00036329505,0.00006409702,0.000026317182,0.00011267383,0.0003702319,0.0023861718,0.0014963794,0.97257084,0.005888895,0.01659591],"study_design_scores_gemma":[0.00007629069,0.00012163613,0.0004791978,0.000066843146,0.0000472014,0.000349498,0.00034505042,0.040118717,0.0025705458,0.89192533,0.063839585,0.00006011969],"about_ca_topic_score_codex":0.002967622,"about_ca_topic_score_gemma":0.0026108602,"teacher_disagreement_score":0.009355978,"about_ca_system_score_codex":0.0016838666,"about_ca_system_score_gemma":0.0011825952,"threshold_uncertainty_score":0.031298935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5794422,0.0016670737,0.1616757,0.0020633924,0.00097045786,0.00007963994,0.00019143512,0.00020256656,0.2537075],"genre_scores_gemma":[0.96501213,0.00066135667,0.014207692,0.00039395134,0.00048995874,0.000065430366,0.00009817261,0.000096032425,0.018975312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992532,0.00016752095,0.000041387386,0.000108912354,0.00027130227,0.00015759304],"domain_scores_gemma":[0.9989281,0.00034106057,0.00014760536,0.000088560395,0.0002154228,0.00027920405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010018884,0.0005167353,0.0005423783,0.0016860225,0.0014008065,0.0026052117,0.0007323055,0.00072008074,0.0070145787],"category_scores_gemma":[0.0036137237,0.0003604493,0.0005888941,0.001181879,0.0035033422,0.0023371999,0.0019486451,0.0016443838,0.0011543465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091949705,0.000007234801,0.00015896752,0.000012541717,0.000001483884,0.000088558525,0.00012952718,0.00034216364,0.0006817292,0.9960115,0.0004955352,0.0020615263],"study_design_scores_gemma":[0.000010632346,0.0000127445865,0.00034582362,0.00001130957,0.000003701307,0.00022559965,0.00011728346,0.007731631,0.00062268943,0.98828274,0.0026181713,0.000017759447],"about_ca_topic_score_codex":0.0009435981,"about_ca_topic_score_gemma":0.00094345165,"teacher_disagreement_score":0.0070145787,"about_ca_system_score_codex":0.0011962571,"about_ca_system_score_gemma":0.0006382381,"threshold_uncertainty_score":0.02346611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5203769,0.00076454924,0.4222337,0.0026350222,0.00023509651,0.00032113295,0.0010476707,0.00041719706,0.051968716],"genre_scores_gemma":[0.77889407,0.0007080418,0.19960268,0.000501944,0.00018668396,0.00019667314,0.0011253477,0.000108340515,0.018676192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995765,0.000097948585,0.000023464587,0.00010202744,0.00007536122,0.00012475118],"domain_scores_gemma":[0.99874854,0.00058655656,0.00018164853,0.00017854435,0.00013770549,0.0001668741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576878,0.00062728673,0.0005831064,0.0006338219,0.0012065845,0.0011863229,0.0007377473,0.0012455217,0.0063435724],"category_scores_gemma":[0.0031253982,0.00039824005,0.000534144,0.0007906917,0.0007940839,0.0023919232,0.0011148348,0.0011238416,0.0006951811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000859723,0.00021971251,0.0021582395,0.00052003446,0.000077173296,0.0006582553,0.00077235914,0.081057034,0.012624173,0.71888036,0.029101055,0.15307188],"study_design_scores_gemma":[0.00019930782,0.000140393,0.0005749671,0.00006707878,0.000042675987,0.00049528456,0.0005118899,0.16744916,0.004805602,0.8072703,0.01839355,0.000049752638],"about_ca_topic_score_codex":0.0021315394,"about_ca_topic_score_gemma":0.0035736659,"teacher_disagreement_score":0.0063435724,"about_ca_system_score_codex":0.0006764879,"about_ca_system_score_gemma":0.0007729281,"threshold_uncertainty_score":0.02122134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582565,0.0002519368,0.02409688,0.00030109668,0.000020141271,0.000029230267,0.0005178306,0.00022938145,0.0162971],"genre_scores_gemma":[0.9885212,0.00019065347,0.009003798,0.000072038616,0.000022394746,0.00006660393,0.0005156613,0.0000645356,0.0015430743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993007,0.00008143151,0.000029952665,0.0001429627,0.00017376164,0.000271206],"domain_scores_gemma":[0.99843675,0.0006535199,0.0002830859,0.00018191613,0.00015944004,0.00028530476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043223638,0.0005404323,0.0005675347,0.0018981689,0.0014913327,0.0025241252,0.0009022554,0.0007164348,0.0056317844],"category_scores_gemma":[0.0024290748,0.00048278345,0.0003978913,0.0015193904,0.0014831588,0.0020302131,0.0013710173,0.00090392336,0.0005257675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015609419,0.00036744602,0.013102267,0.00022028736,0.000080767764,0.0010329823,0.0021552588,0.06803866,0.04386243,0.8086613,0.011752432,0.049165245],"study_design_scores_gemma":[0.00019938704,0.00018306298,0.009417188,0.0000872654,0.000060795002,0.0012448068,0.0015769198,0.19601831,0.012413008,0.7677577,0.010955445,0.000086147775],"about_ca_topic_score_codex":0.004305328,"about_ca_topic_score_gemma":0.0030842682,"teacher_disagreement_score":0.0056317844,"about_ca_system_score_codex":0.0015852607,"about_ca_system_score_gemma":0.00069308176,"threshold_uncertainty_score":0.018840134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61317897,0.0020992525,0.2977345,0.005235901,0.00034943677,0.00027427656,0.00092483906,0.0016811503,0.07852175],"genre_scores_gemma":[0.97017235,0.0006532099,0.013150644,0.00061386393,0.0004952913,0.0004733493,0.0007558862,0.0002752524,0.013410062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949714,0.0023187923,0.00014742718,0.00078128587,0.0011212786,0.0006597399],"domain_scores_gemma":[0.946211,0.03919649,0.0035314434,0.0060482924,0.0028831034,0.002129729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009392963,0.00063773285,0.0015523215,0.0024344237,0.0013933989,0.0028894024,0.0025605054,0.0018468896,0.013180476],"category_scores_gemma":[0.070685506,0.0008045837,0.0010861373,0.0010806075,0.005163673,0.0063789207,0.0030147787,0.0027721939,0.0016865362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003605319,0.00008771434,0.004332446,0.0001635101,0.000071804716,0.00031598474,0.00053334463,0.024485165,0.002647495,0.94567454,0.0062421295,0.015085273],"study_design_scores_gemma":[0.00012317939,0.00014603035,0.004337335,0.0001303085,0.00007921305,0.00084679824,0.00023802019,0.28105378,0.0026811068,0.70710087,0.0031412647,0.0001220866],"about_ca_topic_score_codex":0.0015775437,"about_ca_topic_score_gemma":0.0013612988,"teacher_disagreement_score":0.013180476,"about_ca_system_score_codex":0.0023326266,"about_ca_system_score_gemma":0.0013193198,"threshold_uncertainty_score":0.049675345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8290693,0.00020449447,0.12922896,0.00025004128,0.000082033905,0.000074775686,0.00017171096,0.00036768132,0.04055099],"genre_scores_gemma":[0.96513057,0.00020327013,0.019737078,0.00010472485,0.00007556606,0.000060052113,0.00036295186,0.000074165,0.01425156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993956,0.00010810854,0.00003810114,0.00020558818,0.0001324018,0.00012024857],"domain_scores_gemma":[0.9988512,0.0003274772,0.00020225238,0.00029573365,0.00015139136,0.00017196411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005008796,0.0004059304,0.0003112247,0.001212555,0.00081524823,0.0010551513,0.0006081707,0.000396713,0.003330861],"category_scores_gemma":[0.0014725591,0.00034057282,0.00072690164,0.00055099145,0.0016064139,0.0019017552,0.0017485347,0.0009148185,0.0006145742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006250122,0.00004008655,0.0011629761,0.00003806802,0.000014802167,0.0003596968,0.000775884,0.002904805,0.007177226,0.9719863,0.00039752526,0.015080245],"study_design_scores_gemma":[0.00003533527,0.000100972335,0.0011044948,0.00001674822,0.000023935549,0.00044598395,0.00023548683,0.015134977,0.009875746,0.96187645,0.011123706,0.000026247428],"about_ca_topic_score_codex":0.00060866214,"about_ca_topic_score_gemma":0.0005120634,"teacher_disagreement_score":0.003330861,"about_ca_system_score_codex":0.00057560473,"about_ca_system_score_gemma":0.00032406088,"threshold_uncertainty_score":0.01114285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87484884,0.00061528315,0.111323915,0.0012141196,0.000052291238,0.00005169223,0.0009079064,0.0004908676,0.010495141],"genre_scores_gemma":[0.9885266,0.00034676323,0.007786913,0.0001035153,0.000048410893,0.000066977744,0.0005347359,0.00007064269,0.0025155034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995389,0.00011573132,0.000018786168,0.00015454547,0.0000680718,0.00010403048],"domain_scores_gemma":[0.99461293,0.0027537288,0.00083593954,0.00040456257,0.00044692677,0.00094606454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106273,0.00053555303,0.00084600603,0.002230717,0.0012357844,0.0016568532,0.0018098026,0.0008457993,0.0025770601],"category_scores_gemma":[0.008421192,0.00064962235,0.0004762355,0.00070295815,0.0017353202,0.0019682795,0.0009689393,0.0009885263,0.0004889344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000741489,0.00020313753,0.021668466,0.0002967356,0.00013492137,0.0010223397,0.0010019867,0.18901755,0.03603964,0.7219302,0.010813843,0.017129809],"study_design_scores_gemma":[0.00007636772,0.000115751325,0.008230421,0.00008621175,0.000060043676,0.00063549104,0.00031829084,0.78953636,0.0072904066,0.19036174,0.003212469,0.00007653856],"about_ca_topic_score_codex":0.0022476665,"about_ca_topic_score_gemma":0.0025358023,"teacher_disagreement_score":0.0025770601,"about_ca_system_score_codex":0.0023442316,"about_ca_system_score_gemma":0.0004896002,"threshold_uncertainty_score":0.017008722},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66967,0.0005300018,0.24427831,0.0008420852,0.00031889594,0.00011374815,0.00031687602,0.0003455797,0.08358448],"genre_scores_gemma":[0.9469753,0.00028386002,0.033997856,0.00019503312,0.0002519789,0.00017261633,0.00029157096,0.00014526634,0.01768649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993049,0.00013938757,0.00004581813,0.00014345552,0.00019304323,0.0001734043],"domain_scores_gemma":[0.9987657,0.00046451495,0.00020507452,0.0001980961,0.00018397791,0.00018267384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008350382,0.00055509753,0.00063722767,0.0016981782,0.0015020545,0.0018740463,0.0013340566,0.0007328801,0.0054513584],"category_scores_gemma":[0.003025363,0.00038030703,0.00085921295,0.0010990247,0.0020237889,0.0029308454,0.0019737,0.0015685159,0.0012806943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032746982,0.00001881852,0.00033201525,0.0000335117,0.0000047839562,0.00016579253,0.00022392764,0.0017952821,0.0023994471,0.9881721,0.00063671375,0.0061848015],"study_design_scores_gemma":[0.000023718234,0.000043275235,0.00056533155,0.000025674277,0.000016628144,0.0006500727,0.000092664246,0.02313191,0.0047809114,0.96356875,0.0070531657,0.00004789867],"about_ca_topic_score_codex":0.00045504235,"about_ca_topic_score_gemma":0.0006112436,"teacher_disagreement_score":0.0054513584,"about_ca_system_score_codex":0.0010161328,"about_ca_system_score_gemma":0.0004888251,"threshold_uncertainty_score":0.018236578},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19112004,0.00064525765,0.718609,0.0006286204,0.00013688763,0.00009509168,0.00036745906,0.0008604724,0.08753722],"genre_scores_gemma":[0.9143296,0.00037874124,0.074678384,0.00015001545,0.000080872946,0.00010740626,0.0003564078,0.00026583252,0.0096528465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998102,0.0004173426,0.00007526628,0.00044868604,0.00059262686,0.0003640278],"domain_scores_gemma":[0.99843913,0.0006454668,0.0002019535,0.0003610293,0.00016106236,0.00019137796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014238993,0.0007699339,0.00078047754,0.0014140441,0.002331748,0.0022549059,0.0014639023,0.0010529917,0.008523198],"category_scores_gemma":[0.0030380806,0.00054828456,0.0016536122,0.0011043478,0.005357746,0.0057720426,0.0042819926,0.0022671453,0.0008478098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009562862,0.0000053281206,0.00013115941,0.000026785865,0.0000059329045,0.00010294584,0.00015254597,0.0028523023,0.00060349324,0.9940264,0.0001903901,0.0018930715],"study_design_scores_gemma":[0.000012652861,0.000042998538,0.00039773466,0.000042332715,0.000021123074,0.00033411742,0.00032979352,0.015439225,0.0015538608,0.9734591,0.008328338,0.00003872163],"about_ca_topic_score_codex":0.0018946201,"about_ca_topic_score_gemma":0.0027050583,"teacher_disagreement_score":0.008523198,"about_ca_system_score_codex":0.0014691792,"about_ca_system_score_gemma":0.0007613509,"threshold_uncertainty_score":0.028512955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95064163,0.00078249146,0.038987424,0.00067214714,0.00003764508,0.000013175957,0.00020040426,0.00028098107,0.008384203],"genre_scores_gemma":[0.99530447,0.00017956787,0.0032805644,0.00004804644,0.000031857922,0.000019617513,0.00012696987,0.00003314444,0.00097571645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947256,0.00009213245,0.000022283893,0.00017060654,0.00013089692,0.00011148303],"domain_scores_gemma":[0.9959473,0.0022783254,0.0005207656,0.00054219994,0.00037350119,0.00033788988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010474115,0.00024026437,0.00072306517,0.0021005163,0.0010601636,0.0018762061,0.0014825029,0.0014388552,0.0035190666],"category_scores_gemma":[0.010739265,0.0004738085,0.00040632763,0.0010205883,0.0024937,0.0029328035,0.0011316723,0.0014435318,0.00029077535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006259463,0.00016354393,0.02253442,0.00029572984,0.000078511446,0.0013944033,0.00133739,0.031400327,0.042457383,0.8636673,0.00414901,0.03189608],"study_design_scores_gemma":[0.0001383269,0.00033235108,0.061968282,0.00014148708,0.00010716898,0.0041657467,0.0009917127,0.24365678,0.020976847,0.6593531,0.007909761,0.0002584182],"about_ca_topic_score_codex":0.0008531778,"about_ca_topic_score_gemma":0.0006932122,"teacher_disagreement_score":0.0035190666,"about_ca_system_score_codex":0.0014027808,"about_ca_system_score_gemma":0.0002296987,"threshold_uncertainty_score":0.011772394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6456358,0.0018145513,0.3052533,0.001312905,0.00020432302,0.00011412901,0.0003458349,0.0008518401,0.04446732],"genre_scores_gemma":[0.9387666,0.0005959772,0.048865747,0.00036167656,0.00010934817,0.00017363354,0.00026859646,0.00011625131,0.01074224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992632,0.000116050156,0.00004140098,0.00012976838,0.00023840735,0.0002110996],"domain_scores_gemma":[0.9978841,0.0008138415,0.00043032656,0.00044596707,0.00022681699,0.00019892871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174204,0.0004760664,0.00040156677,0.00058623013,0.00083770393,0.0011584156,0.0006568685,0.0008621501,0.003877177],"category_scores_gemma":[0.0037923455,0.00030676206,0.0003168683,0.000942884,0.0015042408,0.0020101785,0.0020978365,0.0011036284,0.0010073982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005886378,0.00008524435,0.0021270288,0.00016654498,0.00002501957,0.0010404654,0.000607669,0.03877694,0.03831413,0.8472122,0.00425422,0.0668019],"study_design_scores_gemma":[0.00012399272,0.00029089925,0.0013927654,0.00011504751,0.000048401642,0.0011638673,0.00019368506,0.16541491,0.044774786,0.7605476,0.025841609,0.000092363516],"about_ca_topic_score_codex":0.0012988237,"about_ca_topic_score_gemma":0.0011493104,"teacher_disagreement_score":0.003877177,"about_ca_system_score_codex":0.00084557047,"about_ca_system_score_gemma":0.0008950339,"threshold_uncertainty_score":0.012970388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8346424,0.00034991204,0.070768155,0.0022769268,0.0002944069,0.000073323376,0.00037922547,0.00048885564,0.0907268],"genre_scores_gemma":[0.9752237,0.0002465033,0.011622435,0.0003186554,0.00025232058,0.00008788105,0.00036683655,0.00014858844,0.011733264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982728,0.00032668977,0.0000836039,0.00043679835,0.00045812078,0.00042184608],"domain_scores_gemma":[0.99376327,0.0036552104,0.00067404937,0.00072609674,0.000487389,0.0006940503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015029209,0.00055058196,0.0011041295,0.0011490914,0.003103691,0.0034592163,0.0012588366,0.0014215661,0.0071608424],"category_scores_gemma":[0.015717106,0.0014175314,0.0010554071,0.0008778969,0.003953901,0.004342316,0.0032803363,0.0027828803,0.001223034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025355225,0.000044096338,0.002440502,0.0000810329,0.00002691902,0.000936944,0.0004176636,0.0015205529,0.0048908894,0.9804161,0.002987228,0.005984467],"study_design_scores_gemma":[0.00017631173,0.00008494599,0.0018195852,0.000052056846,0.0000462076,0.0029225666,0.00035115913,0.023469927,0.006417609,0.9555365,0.009057031,0.00006618427],"about_ca_topic_score_codex":0.00047434535,"about_ca_topic_score_gemma":0.0005141106,"teacher_disagreement_score":0.0071608424,"about_ca_system_score_codex":0.0009551389,"about_ca_system_score_gemma":0.00077533454,"threshold_uncertainty_score":0.023955405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5685176,0.00521323,0.3601656,0.007824504,0.00030820732,0.0002207908,0.0012551897,0.002262361,0.054232486],"genre_scores_gemma":[0.965032,0.002860098,0.019126043,0.00039538933,0.00061156426,0.0004996669,0.0008591495,0.00040189724,0.010214248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842876,0.00052860804,0.00005470843,0.00044165217,0.00029035055,0.0002559558],"domain_scores_gemma":[0.9441337,0.044975333,0.0034261981,0.003098756,0.0021078323,0.00225815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071939104,0.0010161579,0.001539537,0.0055337083,0.0014913604,0.003577366,0.0042428845,0.0028514657,0.012913116],"category_scores_gemma":[0.068650894,0.0009063239,0.0011199717,0.0021725595,0.0077250334,0.0075865947,0.0028567745,0.0033065781,0.0014457005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003055005,0.00008424941,0.00957782,0.00032340438,0.000074772935,0.00038309942,0.00069518166,0.054269977,0.0031677207,0.9099845,0.005284927,0.01584872],"study_design_scores_gemma":[0.00008534547,0.000108654174,0.009934896,0.00030140005,0.00008669468,0.0014697945,0.0005231416,0.4727643,0.002504548,0.50742334,0.0046232683,0.00017467703],"about_ca_topic_score_codex":0.0027237104,"about_ca_topic_score_gemma":0.0015001605,"teacher_disagreement_score":0.012913116,"about_ca_system_score_codex":0.0034411948,"about_ca_system_score_gemma":0.0008311294,"threshold_uncertainty_score":0.043198645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8346219,0.000508404,0.13090082,0.0014508781,0.00008937496,0.00009281197,0.0008117848,0.0011495202,0.03037453],"genre_scores_gemma":[0.9725357,0.00026130036,0.021631164,0.00025274823,0.000040928153,0.00004866266,0.0008148227,0.00008908059,0.0043255743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992149,0.00014669208,0.00003225466,0.00025250242,0.00016796307,0.00018568251],"domain_scores_gemma":[0.99317706,0.0033378995,0.00067395566,0.0016413556,0.0006158721,0.00055385707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902923,0.0003205839,0.0004330996,0.00069216755,0.0012649435,0.0016634332,0.0010629587,0.00094236946,0.004884627],"category_scores_gemma":[0.006397471,0.00041889152,0.0006798769,0.0011488638,0.0018562141,0.0030953516,0.0012957866,0.0011725633,0.00036335795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068675354,0.00013381195,0.011518625,0.0005720344,0.00009613677,0.0009868053,0.0015243589,0.07148521,0.03473884,0.8184866,0.010914704,0.048856188],"study_design_scores_gemma":[0.0001077615,0.00015084096,0.00455335,0.000047452402,0.00008338312,0.0011900619,0.00043966735,0.16842325,0.021626266,0.78719354,0.016128445,0.000055997705],"about_ca_topic_score_codex":0.0026970266,"about_ca_topic_score_gemma":0.0035523202,"teacher_disagreement_score":0.004884627,"about_ca_system_score_codex":0.0014585332,"about_ca_system_score_gemma":0.0008553817,"threshold_uncertainty_score":0.016340733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3309789,0.0011860379,0.48427445,0.0033977071,0.00048842013,0.00012518965,0.0002915739,0.0006562284,0.17860141],"genre_scores_gemma":[0.9184314,0.00037071615,0.0606236,0.00078024523,0.00030226182,0.00020887943,0.00014552168,0.00015359576,0.018983763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840933,0.00043236354,0.00010363413,0.0002761785,0.0005073605,0.0002710703],"domain_scores_gemma":[0.9974565,0.0012487463,0.00025568533,0.00047312345,0.00028058086,0.00028539784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030857804,0.00036890004,0.0005507229,0.0011478513,0.0023856563,0.0037277406,0.0012840598,0.0010399008,0.0062999357],"category_scores_gemma":[0.006233509,0.00048331387,0.0010505414,0.000849363,0.0063618184,0.0067476546,0.0032611224,0.0023758328,0.0009804543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037971936,0.0000026126245,0.000060731232,0.000003949688,7.5754645e-7,0.000014393052,0.00007508652,0.00005919362,0.00012773318,0.998495,0.00021068861,0.0009461054],"study_design_scores_gemma":[0.000006991872,0.000008529406,0.00011044638,0.0000075963185,0.0000029729797,0.00006727138,0.00006093876,0.0019386209,0.0005598421,0.99478817,0.0024414088,0.000007300049],"about_ca_topic_score_codex":0.0008639996,"about_ca_topic_score_gemma":0.00071539264,"teacher_disagreement_score":0.0062999357,"about_ca_system_score_codex":0.0020103748,"about_ca_system_score_gemma":0.0008786534,"threshold_uncertainty_score":0.021075428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7389738,0.00066969416,0.2475793,0.0015813814,0.00007499432,0.0001444645,0.00060012395,0.0012796278,0.009096686],"genre_scores_gemma":[0.9708274,0.00044837326,0.022966832,0.00018265368,0.000051497344,0.00037455486,0.00073143846,0.00047595814,0.003941241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988984,0.0003865396,0.000044356453,0.0003090931,0.00021065476,0.00015105295],"domain_scores_gemma":[0.9768123,0.016794823,0.0018202661,0.0019543548,0.0013714837,0.0012467699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037773524,0.0007090181,0.0007307721,0.0019522653,0.0009992775,0.0016596444,0.002215523,0.0012484893,0.0038294573],"category_scores_gemma":[0.036422934,0.00066079246,0.0007625115,0.0006738212,0.0025404983,0.00347772,0.0019220281,0.002365407,0.0006572502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000987658,0.0001728434,0.017716365,0.00038017775,0.00021131785,0.00063978764,0.001400035,0.25165305,0.03881551,0.639208,0.006531269,0.04228403],"study_design_scores_gemma":[0.00006165256,0.0001516289,0.0036697173,0.000064780994,0.000039460192,0.00042416138,0.00015870309,0.85313815,0.012907844,0.12743023,0.001864789,0.00008888693],"about_ca_topic_score_codex":0.0013988388,"about_ca_topic_score_gemma":0.0009602952,"teacher_disagreement_score":0.0038294573,"about_ca_system_score_codex":0.0017114067,"about_ca_system_score_gemma":0.0005612564,"threshold_uncertainty_score":0.019976795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9573347,0.00039689647,0.027414953,0.0001977593,0.000078554665,0.000024743795,0.00021084721,0.0001353242,0.014206328],"genre_scores_gemma":[0.97904426,0.00019246309,0.009763872,0.000069808695,0.00012440178,0.000042843894,0.00049753726,0.000036810216,0.010227995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956006,0.00008356128,0.000042455493,0.000080471764,0.00012531265,0.000108065826],"domain_scores_gemma":[0.9990144,0.0003213829,0.00017204748,0.00009844784,0.00014555351,0.00024815157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047812954,0.00048808925,0.00053491665,0.0015131508,0.0012892042,0.0012326874,0.00050018757,0.00026133927,0.0044066203],"category_scores_gemma":[0.0010610006,0.00024311901,0.00052919996,0.0006252478,0.0015080271,0.0017485588,0.0016294655,0.000621857,0.00077796774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068603834,0.00008798081,0.005295793,0.0001512649,0.000048187256,0.00091445213,0.0013682148,0.002040847,0.03075584,0.9277113,0.0015159488,0.029423969],"study_design_scores_gemma":[0.00009266272,0.0005334406,0.0069272895,0.000063310275,0.00012385508,0.0017548337,0.0012393064,0.014274258,0.05469229,0.8933327,0.026890883,0.00007520046],"about_ca_topic_score_codex":0.0004966967,"about_ca_topic_score_gemma":0.00050012465,"teacher_disagreement_score":0.0044066203,"about_ca_system_score_codex":0.0006728884,"about_ca_system_score_gemma":0.00034722924,"threshold_uncertainty_score":0.014741659},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1644175,0.0032368342,0.3995848,0.004028361,0.0008879585,0.00022387113,0.001965046,0.00087398686,0.42478162],"genre_scores_gemma":[0.83443713,0.0015027781,0.07631523,0.0011094125,0.0010726938,0.00029683768,0.0019054124,0.00042159736,0.08293888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977489,0.0005231116,0.00012189097,0.00045683642,0.0007740719,0.00037519165],"domain_scores_gemma":[0.99729854,0.00096617924,0.00021589462,0.0003660033,0.00067562587,0.00047777873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002007156,0.0010215153,0.0010187213,0.0023850163,0.0024557775,0.004859338,0.0012304367,0.0008294023,0.0119609],"category_scores_gemma":[0.0039396114,0.0005825737,0.001395776,0.0013920128,0.006141971,0.008649246,0.0024447422,0.0029756255,0.0018691755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003044214,0.000013586549,0.00008924985,0.000029482746,0.0000042419642,0.00005073992,0.00030261735,0.000373831,0.00072577334,0.9935116,0.0011413794,0.0037270344],"study_design_scores_gemma":[0.000030400779,0.00004251291,0.00031787163,0.000021699392,0.000006259242,0.00017955124,0.00019062142,0.0027203565,0.0018201013,0.963327,0.031300094,0.000043559317],"about_ca_topic_score_codex":0.0065688277,"about_ca_topic_score_gemma":0.005234445,"teacher_disagreement_score":0.0119609,"about_ca_system_score_codex":0.0020643452,"about_ca_system_score_gemma":0.0016136188,"threshold_uncertainty_score":0.040013194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15873913,0.00048517348,0.8019183,0.0018632305,0.00020049456,0.00039767363,0.0007193838,0.0011222934,0.03455432],"genre_scores_gemma":[0.8062244,0.00046604578,0.1627121,0.00060345157,0.00024473222,0.0013726001,0.0013917532,0.00040516022,0.026579741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640995,0.0017953849,0.00011878925,0.00052220136,0.00072200823,0.00043172284],"domain_scores_gemma":[0.9918805,0.0054862285,0.00048609995,0.0010741698,0.0006350849,0.000437922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002855612,0.0008083301,0.0008943706,0.002047551,0.0014872893,0.0023642574,0.0015122059,0.0015065073,0.007988849],"category_scores_gemma":[0.017499175,0.00068125717,0.0012418194,0.0014055549,0.0035346868,0.0039643934,0.0030739154,0.0017226305,0.0020067731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046331978,0.000026879668,0.0005935249,0.00003330703,0.000010186981,0.00006934927,0.00030886175,0.0073817344,0.00050991285,0.98378885,0.0010992852,0.00613185],"study_design_scores_gemma":[0.000057334706,0.00003505091,0.00018278784,0.000026873005,0.000008528393,0.000089212306,0.00008669014,0.06346781,0.0014277468,0.9311235,0.0034711014,0.000023341749],"about_ca_topic_score_codex":0.0010367329,"about_ca_topic_score_gemma":0.0009719715,"teacher_disagreement_score":0.007988849,"about_ca_system_score_codex":0.001905,"about_ca_system_score_gemma":0.0009287406,"threshold_uncertainty_score":0.026725352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76196116,0.0006351023,0.20028025,0.00055351463,0.0001986213,0.000056372726,0.00028647014,0.00041709718,0.035611413],"genre_scores_gemma":[0.953468,0.0002191242,0.03321981,0.00017716759,0.00012191691,0.000095569085,0.000298657,0.0001341013,0.012265676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993586,0.000108370026,0.00005108099,0.00014953753,0.00019004791,0.00014232453],"domain_scores_gemma":[0.99780375,0.0010894253,0.00029567044,0.00023657108,0.00033538567,0.00023909187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039024375,0.00065772387,0.00052769843,0.0006569815,0.0014090133,0.0011762724,0.0006302696,0.00052885356,0.0040110475],"category_scores_gemma":[0.002322631,0.00034208645,0.00038460927,0.00077168876,0.0016385918,0.002970058,0.0018030796,0.00097018265,0.00093417586],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041170392,0.00008059714,0.0022398208,0.00024346635,0.00002444457,0.0014287807,0.0017491068,0.0033178495,0.036518604,0.9213838,0.0017248607,0.030876912],"study_design_scores_gemma":[0.000043429936,0.00010243446,0.0013247082,0.00006674716,0.00005743297,0.0011599521,0.0006766499,0.016016869,0.038539924,0.92049813,0.021442374,0.00007131368],"about_ca_topic_score_codex":0.00029991614,"about_ca_topic_score_gemma":0.0003699781,"teacher_disagreement_score":0.0040110475,"about_ca_system_score_codex":0.00040931025,"about_ca_system_score_gemma":0.00033160913,"threshold_uncertainty_score":0.013418257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52892756,0.0018771566,0.39681077,0.0033089777,0.0003402761,0.00019492913,0.00062726776,0.000785823,0.06712716],"genre_scores_gemma":[0.8868008,0.0007411472,0.08517778,0.0006225511,0.00028439064,0.00024996014,0.000547436,0.00025756608,0.025318442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992605,0.0002838503,0.000032639902,0.00015444054,0.00009581972,0.0001728005],"domain_scores_gemma":[0.9971908,0.001952315,0.00025708525,0.00024833175,0.0001343134,0.00021713821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016370642,0.0005913591,0.001160471,0.0008875207,0.0013556794,0.0016721896,0.0015653983,0.0015029996,0.010046226],"category_scores_gemma":[0.0062469016,0.0004340434,0.0009095138,0.0009334792,0.0015648067,0.0042708227,0.0013991252,0.0016004683,0.0008498187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020801362,0.000090558395,0.0009361623,0.00021593082,0.000027274837,0.00014112459,0.00027019554,0.024622826,0.0020680113,0.9422343,0.006051926,0.023133818],"study_design_scores_gemma":[0.000101212405,0.00012278208,0.0006209927,0.00005706554,0.000043494812,0.0003542687,0.00034156567,0.17233141,0.0029182315,0.8155155,0.0075424463,0.000050971288],"about_ca_topic_score_codex":0.0009798977,"about_ca_topic_score_gemma":0.001196424,"teacher_disagreement_score":0.010046226,"about_ca_system_score_codex":0.0014505796,"about_ca_system_score_gemma":0.0009042895,"threshold_uncertainty_score":0.03360796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8857774,0.00044072594,0.08023239,0.0003635675,0.00005899243,0.00008480534,0.0005397271,0.00029202996,0.032210305],"genre_scores_gemma":[0.96630627,0.00035916237,0.027205491,0.0001271886,0.000016197659,0.00010702125,0.0005174452,0.000039251587,0.005321919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979585,0.00003201316,0.000018912333,0.00004518154,0.00004211447,0.000065911074],"domain_scores_gemma":[0.99951637,0.000115070165,0.00011954134,0.00006454752,0.00006669779,0.00011778178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010101601,0.00025826631,0.0002558388,0.00070510653,0.00070596614,0.0008877098,0.00037869043,0.00043603376,0.0030196873],"category_scores_gemma":[0.0009509284,0.00037691515,0.00030816585,0.00073877274,0.0008098844,0.0008752813,0.0011247692,0.00042776988,0.0003589525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026469323,0.00005457557,0.0055746925,0.00022085384,0.000042796302,0.0014494947,0.00088058197,0.032514956,0.024872636,0.8904313,0.004395197,0.039298363],"study_design_scores_gemma":[0.00007555309,0.00007603392,0.0030237006,0.000038538103,0.000033599426,0.0008582333,0.00064498564,0.08093999,0.00837961,0.8872023,0.018663825,0.00006357465],"about_ca_topic_score_codex":0.0035408542,"about_ca_topic_score_gemma":0.0048385374,"teacher_disagreement_score":0.0035408542,"about_ca_system_score_codex":0.0007607964,"about_ca_system_score_gemma":0.00042508106,"threshold_uncertainty_score":0.010101855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09663574,0.003729291,0.6198941,0.0028886476,0.001480842,0.000094868774,0.00023993208,0.00026962478,0.27476692],"genre_scores_gemma":[0.87196606,0.0034343856,0.06941233,0.0011313704,0.0026438308,0.00012120371,0.0002477607,0.00015897173,0.050884116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900633,0.00026377646,0.000055046854,0.00015335379,0.00038368788,0.00013784101],"domain_scores_gemma":[0.99889475,0.00034761426,0.00010827521,0.00016879856,0.00034872495,0.0001317926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013663365,0.000744596,0.00067774334,0.0030558489,0.002080409,0.0037130571,0.0012038477,0.0010009144,0.009705254],"category_scores_gemma":[0.0032204587,0.0002812736,0.00077464845,0.0020346455,0.0036885012,0.006318369,0.0023749073,0.0019391499,0.0015576072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000252033,0.0000043059026,0.00003084655,0.000007639149,0.000001309608,0.000020952808,0.00004846571,0.00018601393,0.00018959682,0.99714154,0.00024817084,0.0021187444],"study_design_scores_gemma":[0.0000018545467,0.000005850426,0.000033569002,0.0000053701892,0.000002138103,0.000043719185,0.000028693432,0.0022926535,0.00028601484,0.9951481,0.0021476764,0.0000044201274],"about_ca_topic_score_codex":0.0010266467,"about_ca_topic_score_gemma":0.0008323372,"teacher_disagreement_score":0.009705254,"about_ca_system_score_codex":0.0016197097,"about_ca_system_score_gemma":0.00095991837,"threshold_uncertainty_score":0.032467306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59389454,0.0012667784,0.36397737,0.0013328764,0.0002250792,0.000078915684,0.00060456025,0.00029700188,0.03832288],"genre_scores_gemma":[0.9553538,0.00059947587,0.038325537,0.0001563783,0.0003086585,0.000107380314,0.00023532612,0.000087717934,0.0048257224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990877,0.00019008321,0.000059893107,0.00033087144,0.00018755146,0.00014391387],"domain_scores_gemma":[0.9950488,0.002533051,0.0008042461,0.0006753745,0.00041882085,0.00051960506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908788,0.0006965731,0.00068411074,0.002197486,0.0012357668,0.0016974129,0.0012054449,0.0009404388,0.004282633],"category_scores_gemma":[0.0056425105,0.00044769084,0.00077148876,0.0009484808,0.0027193362,0.0036466904,0.0017157666,0.0012627298,0.00054925325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014665973,0.000044824257,0.0021458862,0.00016910724,0.000039489234,0.00030634628,0.00036505293,0.014370627,0.010380559,0.95149606,0.0019678064,0.018567616],"study_design_scores_gemma":[0.000017246299,0.000045079785,0.0009912774,0.000022226144,0.000015769505,0.0004171949,0.00016135535,0.032635197,0.0023024054,0.9606271,0.0027394919,0.000025534531],"about_ca_topic_score_codex":0.0003892146,"about_ca_topic_score_gemma":0.0004146911,"teacher_disagreement_score":0.004282633,"about_ca_system_score_codex":0.00066509354,"about_ca_system_score_gemma":0.00045811696,"threshold_uncertainty_score":0.014326811},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21958457,0.0035651617,0.48689505,0.002854645,0.0026610452,0.00040602876,0.002406958,0.0019801382,0.2796464],"genre_scores_gemma":[0.74243563,0.0022965039,0.12648095,0.002453086,0.0006328785,0.00071523665,0.0019165494,0.0015652686,0.12150391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984263,0.00026006246,0.00011201994,0.00045778704,0.0002919542,0.0004518655],"domain_scores_gemma":[0.99657506,0.0013961529,0.00040642146,0.000695032,0.00056440267,0.00036292447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006331589,0.0007876239,0.0007604416,0.0014944979,0.0024389927,0.0027459096,0.0011526122,0.0013402732,0.031018348],"category_scores_gemma":[0.0054614474,0.0010841535,0.0010893139,0.0014580305,0.0037479606,0.0076504014,0.0037374184,0.0028354374,0.0070811408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012417442,0.000025586503,0.0005435393,0.00018806584,0.000013372192,0.0003619359,0.00076745055,0.0008715342,0.0061061694,0.96343553,0.0062570777,0.021305533],"study_design_scores_gemma":[0.000034478322,0.00007842318,0.0006265624,0.00012259539,0.00002376332,0.0007294541,0.0006758535,0.0033186048,0.0068719857,0.87728024,0.11019302,0.000045073877],"about_ca_topic_score_codex":0.0010294125,"about_ca_topic_score_gemma":0.0018012244,"teacher_disagreement_score":0.031018348,"about_ca_system_score_codex":0.00078868703,"about_ca_system_score_gemma":0.00062492845,"threshold_uncertainty_score":0.10376668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16033809,0.00073359243,0.6612749,0.0015102803,0.00027987268,0.00049645535,0.0011732699,0.00077381777,0.17341968],"genre_scores_gemma":[0.82967705,0.0003741386,0.12893625,0.00057470775,0.00019065297,0.000386894,0.0010413562,0.00017254622,0.038646378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735886,0.0007004745,0.00021909553,0.0006270108,0.00070369605,0.00039078496],"domain_scores_gemma":[0.9982874,0.0006548504,0.00017930295,0.00031760675,0.0003168982,0.0002438622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059457,0.0007054412,0.00079763046,0.00088210654,0.0016237283,0.0033302847,0.0013411593,0.0010693275,0.009874101],"category_scores_gemma":[0.004169355,0.00031633436,0.0010150969,0.00070562103,0.0028831435,0.0037067966,0.0022614412,0.0018427977,0.0012099411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003526134,0.000023346542,0.00034130242,0.000032626023,0.000010288502,0.000049600563,0.00019474805,0.0013697245,0.00060421356,0.9865513,0.001274385,0.009513083],"study_design_scores_gemma":[0.000026789938,0.000043360626,0.00032845527,0.000024354162,0.000012340476,0.00011331815,0.00011965724,0.012439625,0.0007390244,0.96730405,0.01883222,0.000016728396],"about_ca_topic_score_codex":0.0024819886,"about_ca_topic_score_gemma":0.0022966866,"teacher_disagreement_score":0.009874101,"about_ca_system_score_codex":0.001543905,"about_ca_system_score_gemma":0.0011656027,"threshold_uncertainty_score":0.03303218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7611335,0.00030082988,0.22425291,0.00080024777,0.000054037122,0.00009465866,0.00077122834,0.00024549165,0.012347065],"genre_scores_gemma":[0.98056555,0.0001922593,0.016368782,0.000105345775,0.000080050646,0.00008838063,0.000549621,0.000071591385,0.0019783166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982169,0.00054500136,0.00010322655,0.00037188607,0.00047039843,0.00029253835],"domain_scores_gemma":[0.99173987,0.0047664787,0.0009865854,0.0009942062,0.00079879316,0.0007140536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016255536,0.000553536,0.0008906013,0.0018889263,0.0008432584,0.0019776018,0.00088402454,0.0007810586,0.0023783704],"category_scores_gemma":[0.0072727893,0.00040404257,0.00085253135,0.0009163517,0.0024817726,0.0034375729,0.001253612,0.0009956605,0.00027443402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003168885,0.00007980602,0.004734979,0.00013232876,0.00007542606,0.00035701334,0.00041861887,0.094683126,0.014703675,0.8629024,0.0017850071,0.019810699],"study_design_scores_gemma":[0.000030483416,0.00008094748,0.0029175996,0.000022398444,0.000021764792,0.0003323785,0.00013246293,0.1943178,0.004160137,0.7966669,0.0012789505,0.00003816548],"about_ca_topic_score_codex":0.0009956823,"about_ca_topic_score_gemma":0.0006956341,"teacher_disagreement_score":0.0023783704,"about_ca_system_score_codex":0.0017075221,"about_ca_system_score_gemma":0.0008513972,"threshold_uncertainty_score":0.012389004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8215463,0.00028207715,0.16463122,0.00019495992,0.000040490537,0.000029491672,0.00019121695,0.00020227743,0.012882153],"genre_scores_gemma":[0.9816798,0.000122010155,0.015368711,0.00003067117,0.00003991453,0.00003082077,0.00010488424,0.00004096435,0.0025823135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995351,0.00006942817,0.000040864332,0.00013587231,0.000120303324,0.00009842619],"domain_scores_gemma":[0.99786395,0.0010184026,0.00043800427,0.00023069177,0.00026653538,0.00018236242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005634143,0.00037049482,0.00032081874,0.0012444011,0.00088565727,0.0017634402,0.0004148722,0.0004240422,0.0031175506],"category_scores_gemma":[0.0035996244,0.00021405994,0.0006752531,0.00086297153,0.0020867514,0.0031822762,0.0009447712,0.00072855287,0.0004466556],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001410965,0.000032404565,0.004186588,0.000080054444,0.000011108381,0.00028047332,0.0010252569,0.0037063267,0.013034723,0.95851755,0.00042219274,0.018562209],"study_design_scores_gemma":[0.000026245501,0.00010561617,0.0032227705,0.000034388628,0.0000322843,0.00096363976,0.0004942137,0.036685333,0.01681938,0.9352704,0.0062888972,0.000056820405],"about_ca_topic_score_codex":0.00080528244,"about_ca_topic_score_gemma":0.0008376261,"teacher_disagreement_score":0.0031175506,"about_ca_system_score_codex":0.001053346,"about_ca_system_score_gemma":0.0005138671,"threshold_uncertainty_score":0.010429263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457713,0.000115899966,0.04453625,0.00020844988,0.000042485408,0.000030843952,0.000080303915,0.00010628816,0.009108139],"genre_scores_gemma":[0.99367964,0.000048360685,0.0046003107,0.00003540857,0.00002166928,0.000018762,0.00006511726,0.000027137408,0.0015035016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936646,0.00018543034,0.00002084399,0.00011792989,0.00014150291,0.00016775994],"domain_scores_gemma":[0.9988355,0.00048872735,0.00021887547,0.0001460154,0.00010950962,0.00020136658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003765539,0.00044895685,0.00044818848,0.0011695749,0.0008215401,0.0014134113,0.0006931944,0.0007673929,0.0050860755],"category_scores_gemma":[0.0023716977,0.00026646262,0.00038758898,0.00085002737,0.0018152309,0.0023021663,0.0010922519,0.0009042727,0.00042363853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013883924,0.00006703884,0.0013306867,0.000029700685,0.000012379598,0.00029386548,0.00025174415,0.018622693,0.005954992,0.96792233,0.0005350191,0.004840802],"study_design_scores_gemma":[0.000040143997,0.000077399425,0.0009032886,0.000013747562,0.0000051596244,0.00016773117,0.0002445651,0.15877558,0.0022671628,0.835979,0.0015011377,0.00002500464],"about_ca_topic_score_codex":0.0013298866,"about_ca_topic_score_gemma":0.0011944985,"teacher_disagreement_score":0.0050860755,"about_ca_system_score_codex":0.00055358064,"about_ca_system_score_gemma":0.00030275105,"threshold_uncertainty_score":0.017014563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07729025,0.020990936,0.71992666,0.021793872,0.0029100704,0.0001290487,0.0005840914,0.0011865145,0.15518852],"genre_scores_gemma":[0.8532856,0.010761514,0.09527338,0.0051913606,0.007396531,0.000537581,0.00026350757,0.000964219,0.026326392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965552,0.0012598243,0.00015470904,0.00089579297,0.0007852429,0.0003492422],"domain_scores_gemma":[0.96855885,0.02637481,0.0012126529,0.0017657699,0.0010383327,0.0010494858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051571126,0.0012161661,0.00214177,0.0031341102,0.0026276144,0.0035249456,0.0026834004,0.0023981838,0.007286786],"category_scores_gemma":[0.030326469,0.001175317,0.0018221828,0.0022941378,0.0061723227,0.010989902,0.0053541036,0.008870785,0.0013360108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004283985,0.000017518709,0.0003432783,0.00011002147,0.000016686365,0.00013559769,0.00014236248,0.0040114806,0.00078554486,0.981138,0.004212158,0.009044491],"study_design_scores_gemma":[0.00002677648,0.000045750072,0.00031315943,0.000075072014,0.000016637921,0.00017649455,0.00003522637,0.014978571,0.0007260643,0.9743435,0.009230697,0.00003199815],"about_ca_topic_score_codex":0.0010055596,"about_ca_topic_score_gemma":0.00078240095,"teacher_disagreement_score":0.007286786,"about_ca_system_score_codex":0.001998987,"about_ca_system_score_gemma":0.00077037944,"threshold_uncertainty_score":0.027273774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54442275,0.0022857625,0.24259098,0.0021994167,0.0005236253,0.0001528083,0.000508085,0.0002806145,0.20703602],"genre_scores_gemma":[0.9512259,0.0008060577,0.029297173,0.00034320875,0.0003337192,0.00011339139,0.00026789913,0.00006059953,0.017552113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994727,0.00010928883,0.000047070753,0.00007437231,0.00022798545,0.000068685986],"domain_scores_gemma":[0.99900156,0.0003916022,0.0001269403,0.000078790756,0.00028446826,0.00011664092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088762306,0.00044254065,0.00040309443,0.0023889781,0.0012929129,0.00321079,0.0008888863,0.00080718205,0.006930271],"category_scores_gemma":[0.002598035,0.00037241628,0.00049848953,0.0014794223,0.0021761917,0.005154036,0.0012098765,0.0020729485,0.0008794642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049781106,0.000008713408,0.000087169195,0.00001223949,0.000001610199,0.00006197289,0.0000928515,0.00016954445,0.0003345714,0.9966493,0.00023355178,0.0023435713],"study_design_scores_gemma":[0.00000695256,0.000006802582,0.00010646297,0.00000748339,0.0000027356516,0.00010461987,0.000060369443,0.002636795,0.00050898746,0.99426717,0.0022845308,0.000007097277],"about_ca_topic_score_codex":0.00045616174,"about_ca_topic_score_gemma":0.0005773,"teacher_disagreement_score":0.006930271,"about_ca_system_score_codex":0.0013157192,"about_ca_system_score_gemma":0.0005295552,"threshold_uncertainty_score":0.023184061},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30062467,0.0010898677,0.32469615,0.025408579,0.0042886757,0.00014689365,0.0009382121,0.0013371006,0.34146982],"genre_scores_gemma":[0.92782223,0.00044936407,0.03381881,0.0058116084,0.0015294341,0.00014049285,0.00042688646,0.00019438908,0.029806767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869555,0.00022418889,0.000062207175,0.00043095916,0.00032927902,0.0002577919],"domain_scores_gemma":[0.99778146,0.00076541037,0.0002508886,0.00045015063,0.00044644758,0.0003057345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541656,0.0005122845,0.0005941067,0.0010361286,0.002061154,0.0021165975,0.0013127739,0.0021185856,0.019317053],"category_scores_gemma":[0.0066799927,0.0003043877,0.0008519425,0.0009883234,0.0056248214,0.007541596,0.003179567,0.0034243423,0.002014205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003194134,0.000013702251,0.00026963922,0.00002399679,0.000002873849,0.000100885736,0.000110561385,0.00033582034,0.00040039571,0.98978907,0.004035199,0.004885847],"study_design_scores_gemma":[0.000014648418,0.000016431975,0.00020598792,0.000007430866,0.000002852926,0.00013074321,0.00004915516,0.0017487203,0.00032968013,0.99256223,0.004921943,0.000010150824],"about_ca_topic_score_codex":0.0012172821,"about_ca_topic_score_gemma":0.00062192517,"teacher_disagreement_score":0.019317053,"about_ca_system_score_codex":0.001151302,"about_ca_system_score_gemma":0.0007907124,"threshold_uncertainty_score":0.064621985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1733208,0.0016388339,0.7495059,0.0011537995,0.00021489893,0.00021883588,0.00049172,0.0017270052,0.07172819],"genre_scores_gemma":[0.74280506,0.001373595,0.22238277,0.001040968,0.00035865908,0.000366157,0.0007004977,0.00091363996,0.030058673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812883,0.00027268808,0.00013169645,0.00058621133,0.0005196398,0.00036090214],"domain_scores_gemma":[0.9976726,0.0009488116,0.00029302537,0.0006677312,0.0002445803,0.00017321024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039363,0.00081628095,0.00072715216,0.002030016,0.0018111919,0.0028788012,0.0012353449,0.0011357717,0.0056270626],"category_scores_gemma":[0.0070853597,0.00069232757,0.0009587959,0.0028190946,0.0039138347,0.007486478,0.004019335,0.0020080425,0.0013072061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009838494,0.000034226832,0.00049186085,0.00010672202,0.000011078105,0.00014018969,0.00061577436,0.0088176,0.004058948,0.94491357,0.0014817027,0.03922985],"study_design_scores_gemma":[0.000032209806,0.00008595255,0.0002630083,0.00008436487,0.000023534587,0.0006483137,0.00023392553,0.041273586,0.012307969,0.90624326,0.038738087,0.0000657253],"about_ca_topic_score_codex":0.0017109442,"about_ca_topic_score_gemma":0.0014959195,"teacher_disagreement_score":0.0056270626,"about_ca_system_score_codex":0.0020532657,"about_ca_system_score_gemma":0.0017595381,"threshold_uncertainty_score":0.018824399},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03432573,0.013570397,0.29935563,0.03129117,0.0066394387,0.0001544424,0.0014095801,0.0010435327,0.61221004],"genre_scores_gemma":[0.625637,0.012319814,0.1396927,0.017142847,0.006345802,0.00064832415,0.001971787,0.0011135748,0.19512816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888057,0.00024226413,0.000049270555,0.00024874049,0.00037878618,0.00020037587],"domain_scores_gemma":[0.9987884,0.00062080106,0.00006699334,0.00016243705,0.00026154568,0.00009978162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017880644,0.0011321725,0.0009979554,0.0018572729,0.002399471,0.0020206575,0.0013833374,0.0010977043,0.01808173],"category_scores_gemma":[0.004586722,0.00050176604,0.001610447,0.0017788283,0.00412696,0.0067971386,0.0058640293,0.005495387,0.0041127936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003839711,0.00001889234,0.00012648175,0.00010105742,0.000012861641,0.00009203191,0.00028313944,0.00032821952,0.0005366766,0.96940875,0.014849891,0.014203661],"study_design_scores_gemma":[0.000030255916,0.000032891792,0.00037532562,0.000059605023,0.000014395668,0.00017113083,0.000070694885,0.0011254541,0.00097066985,0.9051281,0.092006214,0.0000152292505],"about_ca_topic_score_codex":0.0023262403,"about_ca_topic_score_gemma":0.0013393908,"teacher_disagreement_score":0.01808173,"about_ca_system_score_codex":0.0027978255,"about_ca_system_score_gemma":0.0012143302,"threshold_uncertainty_score":0.060489416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5408065,0.0009481771,0.33854213,0.0013171822,0.0012775323,0.00013158857,0.00073678663,0.0010473138,0.115192726],"genre_scores_gemma":[0.89733624,0.00034852247,0.06337519,0.0005318107,0.0002621666,0.00011224747,0.00069866644,0.00038442435,0.036950696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926037,0.00007375647,0.000060839604,0.00028702014,0.00017156613,0.00014647188],"domain_scores_gemma":[0.99874604,0.00044573442,0.00014863568,0.00020481582,0.0002997085,0.00015512489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029179512,0.0005401444,0.00051821186,0.00054810976,0.001558473,0.0018271854,0.00043061373,0.0009437438,0.016046643],"category_scores_gemma":[0.0022264398,0.00028701028,0.0007557765,0.00056358427,0.0015745814,0.0020222045,0.0009762992,0.0012108462,0.0032207265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041760533,0.00007202147,0.0011377924,0.00028907112,0.000024697718,0.0008260307,0.0009806335,0.0023058588,0.027673459,0.9192714,0.005739725,0.04126171],"study_design_scores_gemma":[0.000054794902,0.0001625538,0.00096412445,0.0000739855,0.00004946994,0.0013843267,0.00041572755,0.01270154,0.019382743,0.9083033,0.05644308,0.00006431093],"about_ca_topic_score_codex":0.0014153328,"about_ca_topic_score_gemma":0.0011029578,"teacher_disagreement_score":0.016046643,"about_ca_system_score_codex":0.00054213096,"about_ca_system_score_gemma":0.0008316324,"threshold_uncertainty_score":0.053681374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48213932,0.00051394495,0.4696997,0.00039207644,0.000059946342,0.00022998922,0.0017795517,0.0006592215,0.044526298],"genre_scores_gemma":[0.8406243,0.0004229117,0.13900325,0.00027652836,0.000065171356,0.00025340845,0.003313338,0.00020424546,0.015836965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948466,0.00011690785,0.000031581185,0.00013912033,0.000111079404,0.000116678195],"domain_scores_gemma":[0.99891984,0.0003343571,0.00022901704,0.00021839312,0.0001338095,0.0001645877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037531604,0.0004856525,0.00038446614,0.00096269115,0.00046227494,0.0009973604,0.00046322422,0.00036298798,0.004630815],"category_scores_gemma":[0.0015073668,0.0005540169,0.00066225894,0.0006254587,0.0006317337,0.0015083825,0.0008015671,0.00072680606,0.0007440733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000540018,0.000191647,0.0042946385,0.0003678312,0.00009902233,0.0008474431,0.00085604755,0.053527348,0.03975427,0.8352239,0.0089871995,0.05531075],"study_design_scores_gemma":[0.00008450688,0.00011694726,0.004043656,0.000067436406,0.00006627899,0.0008462967,0.00044215732,0.13533603,0.010881858,0.83245945,0.015617754,0.000037698133],"about_ca_topic_score_codex":0.0009208662,"about_ca_topic_score_gemma":0.0020568878,"teacher_disagreement_score":0.004630815,"about_ca_system_score_codex":0.00050882366,"about_ca_system_score_gemma":0.00041104716,"threshold_uncertainty_score":0.015491605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8419407,0.0007482888,0.0556415,0.000683054,0.00006258824,0.000047637786,0.00035158944,0.00024233287,0.100282244],"genre_scores_gemma":[0.9896144,0.00016625777,0.0045871767,0.000054174077,0.000038566886,0.00003270268,0.00010912387,0.000022635379,0.005374883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00010281509,0.00004729117,0.0001412892,0.00011999033,0.00016482534],"domain_scores_gemma":[0.99863845,0.0005571519,0.00018648303,0.0002456461,0.00016790492,0.00020442808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008367148,0.00025748127,0.00035725764,0.0009215609,0.0013803587,0.002480425,0.00043036503,0.00043174383,0.004540647],"category_scores_gemma":[0.0019236972,0.00021930212,0.00047434057,0.00040628907,0.002488636,0.004039539,0.0013766485,0.0009864212,0.0003778999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008128065,0.000031244093,0.001750702,0.000033171764,0.000007344393,0.000086457956,0.0007677174,0.0008261939,0.004249567,0.9819478,0.0006228465,0.009595623],"study_design_scores_gemma":[0.000019913705,0.000060495528,0.003302013,0.0000371412,0.000024939085,0.0004422142,0.0005980066,0.0075073596,0.0068768887,0.96943766,0.0116580725,0.000035298308],"about_ca_topic_score_codex":0.0009019176,"about_ca_topic_score_gemma":0.001226362,"teacher_disagreement_score":0.004540647,"about_ca_system_score_codex":0.0008151862,"about_ca_system_score_gemma":0.0005342229,"threshold_uncertainty_score":0.015190005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29288238,0.0009787239,0.6306033,0.0011896543,0.00024765282,0.00021708639,0.0010840142,0.0009228987,0.071874246],"genre_scores_gemma":[0.78071773,0.00087593845,0.19311368,0.00058442965,0.000268401,0.00022947573,0.0015219386,0.00030883722,0.022379585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.00020562751,0.00007179169,0.000406189,0.00015330363,0.00028911588],"domain_scores_gemma":[0.99780244,0.00076572,0.0002497301,0.00043850637,0.00033595858,0.00040758072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010073488,0.00058451394,0.0005058817,0.0006263771,0.0014154771,0.0016242602,0.000479967,0.0007394475,0.011267816],"category_scores_gemma":[0.003129739,0.0006450942,0.0015427932,0.0006176535,0.0018322408,0.005000654,0.002398436,0.0024681955,0.001973888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022438988,0.00007453043,0.0011686985,0.00014843888,0.000023515913,0.00055608444,0.00121461,0.0075968346,0.010488937,0.942207,0.005424314,0.030872656],"study_design_scores_gemma":[0.00004696724,0.00011212939,0.00083076156,0.00008656024,0.000024784176,0.0005423472,0.00052127364,0.020386897,0.0042089866,0.9561293,0.017065827,0.000044245866],"about_ca_topic_score_codex":0.0018067455,"about_ca_topic_score_gemma":0.0023665123,"teacher_disagreement_score":0.011267816,"about_ca_system_score_codex":0.00079559686,"about_ca_system_score_gemma":0.00062702666,"threshold_uncertainty_score":0.037694573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87435573,0.00020670934,0.09624209,0.00061519153,0.00007855123,0.0000375173,0.000080352,0.000270512,0.028113235],"genre_scores_gemma":[0.99125457,0.00007104432,0.005942883,0.00011371173,0.000030027168,0.000026335152,0.000051069703,0.00004578985,0.0024645443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964905,0.0000843712,0.000012582493,0.00008647132,0.00006321606,0.000104291394],"domain_scores_gemma":[0.9990395,0.00037247426,0.00011388514,0.0002497254,0.00008470816,0.00013976965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036732332,0.00021749134,0.00034620607,0.00046679887,0.0012546362,0.0010600257,0.00060928316,0.000924287,0.004343213],"category_scores_gemma":[0.0019584647,0.00020311454,0.00063085527,0.00033380216,0.0018147755,0.002530809,0.0013702178,0.00092504366,0.00024320248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004673807,0.00006489111,0.00058747025,0.000029869318,0.0000091782385,0.00016366498,0.0003015187,0.0114276195,0.007751048,0.97315997,0.0008269385,0.005631135],"study_design_scores_gemma":[0.000020582267,0.00007652201,0.00072003546,0.000011362098,0.00000838145,0.0001298363,0.00016239927,0.116236985,0.0035537055,0.87725234,0.0018056689,0.000022146969],"about_ca_topic_score_codex":0.00066298735,"about_ca_topic_score_gemma":0.0005045088,"teacher_disagreement_score":0.004343213,"about_ca_system_score_codex":0.00078799884,"about_ca_system_score_gemma":0.00031574682,"threshold_uncertainty_score":0.014529467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09181677,0.0012842466,0.88236415,0.001636391,0.0001374899,0.000096594085,0.00044029258,0.0007002339,0.021523826],"genre_scores_gemma":[0.7406668,0.0021240825,0.21952535,0.0013011439,0.0005336335,0.0011415111,0.0018628626,0.0010199315,0.0318246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965726,0.0014836005,0.00015390267,0.0006792833,0.00075076125,0.0003598079],"domain_scores_gemma":[0.98084486,0.014215683,0.0014701071,0.0018284215,0.00084526645,0.0007956553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057131294,0.001200826,0.0016499221,0.0037141207,0.0013687505,0.0029748136,0.0026956187,0.0020791404,0.00971726],"category_scores_gemma":[0.034644082,0.0010588085,0.0019995007,0.0019896491,0.0038999598,0.0054243007,0.003719105,0.0032008474,0.0014437841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045848963,0.000026228101,0.0006781413,0.000080266254,0.000037032056,0.000084568506,0.00010065406,0.024538985,0.000551822,0.9649522,0.0016627914,0.0072415625],"study_design_scores_gemma":[0.000017609791,0.000013105893,0.0002712197,0.000029086461,0.000009770191,0.000058101643,0.000017749515,0.16633366,0.00029731944,0.831806,0.0011268385,0.00001950658],"about_ca_topic_score_codex":0.0024285181,"about_ca_topic_score_gemma":0.0038775601,"teacher_disagreement_score":0.00971726,"about_ca_system_score_codex":0.0025066016,"about_ca_system_score_gemma":0.0014935078,"threshold_uncertainty_score":0.03250748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7233665,0.00048424595,0.0436753,0.0008506833,0.00033401995,0.00007908159,0.0007086628,0.000575386,0.2299261],"genre_scores_gemma":[0.95974195,0.00021309702,0.0057695466,0.00012553137,0.00011750381,0.00006957311,0.00053782726,0.00013060817,0.033294532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995479,0.000047610298,0.000021274536,0.000100258076,0.000110367946,0.00017259455],"domain_scores_gemma":[0.9997187,0.00005661477,0.000035520028,0.00005151413,0.000046527333,0.00009108706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029219934,0.00033356677,0.00048100855,0.0008958606,0.0018697912,0.0022187436,0.00045781076,0.00053006475,0.008419894],"category_scores_gemma":[0.0008801076,0.00029287205,0.0005617036,0.0004704072,0.0016395062,0.0019312331,0.0019318791,0.00087711087,0.0015316986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009414622,0.000017460517,0.0005466237,0.000029795074,0.0000047286335,0.00013518592,0.0005180845,0.00040792068,0.0022830563,0.9884448,0.0012622027,0.0062560607],"study_design_scores_gemma":[0.00004663946,0.000054067754,0.0011161183,0.000037105012,0.000016346576,0.00029454482,0.00053851487,0.0033003408,0.0048722853,0.97056055,0.01914088,0.000022595308],"about_ca_topic_score_codex":0.0013901799,"about_ca_topic_score_gemma":0.0012884929,"teacher_disagreement_score":0.008419894,"about_ca_system_score_codex":0.0011447846,"about_ca_system_score_gemma":0.0007137399,"threshold_uncertainty_score":0.028167367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8223892,0.0007505786,0.12492107,0.0015539809,0.00019056565,0.00006596885,0.0005420753,0.0004807562,0.04910588],"genre_scores_gemma":[0.97855216,0.0002549612,0.013161335,0.0002955797,0.00007279516,0.00005823346,0.00024527937,0.00007441322,0.0072851623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984971,0.0003510361,0.00008732115,0.00042173313,0.00028768354,0.00035501807],"domain_scores_gemma":[0.9905318,0.005561245,0.0007457907,0.0015084436,0.0006654204,0.0009872671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413465,0.00047273072,0.00075644185,0.00089480873,0.0018051311,0.002612685,0.001191919,0.00092182576,0.00596199],"category_scores_gemma":[0.008771026,0.00055901357,0.0005786612,0.0008229994,0.0019990543,0.0038791369,0.0027886743,0.0013114031,0.0007917979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040732964,0.00008450266,0.0033734003,0.00019661253,0.00004035764,0.000493041,0.0009922826,0.012491162,0.012433176,0.93692,0.00444837,0.028119748],"study_design_scores_gemma":[0.000066225046,0.000050615505,0.0007019454,0.00003190019,0.000034875455,0.00031089253,0.0002284251,0.03596515,0.0052505545,0.9501295,0.0072082225,0.000021711074],"about_ca_topic_score_codex":0.0011071407,"about_ca_topic_score_gemma":0.0016524476,"teacher_disagreement_score":0.00596199,"about_ca_system_score_codex":0.0016353483,"about_ca_system_score_gemma":0.000659372,"threshold_uncertainty_score":0.019944847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09437938,0.01603347,0.60722977,0.023377432,0.0042965547,0.00016854658,0.0011473448,0.0014988736,0.25186858],"genre_scores_gemma":[0.79864764,0.010131576,0.14267297,0.0076373513,0.0058066146,0.00031331833,0.00064843724,0.00047824072,0.033663902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982318,0.0005546051,0.00009317701,0.00050812436,0.00043945908,0.00017288605],"domain_scores_gemma":[0.9939948,0.004197086,0.00034591072,0.0005718685,0.00046981266,0.00042061636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004339041,0.0009940848,0.0010523635,0.0014859473,0.0022050268,0.0029421665,0.0016558858,0.0016397233,0.012777302],"category_scores_gemma":[0.0063388315,0.00057657517,0.0015092252,0.0013649447,0.004819234,0.011640803,0.006088899,0.0051293424,0.0013169629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038516668,0.000022825332,0.00022269077,0.0001575845,0.000018182329,0.000278671,0.0003818605,0.00063652167,0.0013415795,0.98592246,0.0042537064,0.006725362],"study_design_scores_gemma":[0.000015850688,0.00006453111,0.00041377338,0.000047962632,0.000030406063,0.00049967674,0.000145314,0.0022732527,0.0014033073,0.9689237,0.026154108,0.000028095386],"about_ca_topic_score_codex":0.0009564278,"about_ca_topic_score_gemma":0.0007899352,"teacher_disagreement_score":0.012777302,"about_ca_system_score_codex":0.0011185224,"about_ca_system_score_gemma":0.0007715458,"threshold_uncertainty_score":0.04274434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3510755,0.0011148109,0.4557128,0.0015991995,0.0003360944,0.00027634905,0.00069855625,0.00058383704,0.1886029],"genre_scores_gemma":[0.9469107,0.0003891403,0.031207291,0.00029655098,0.00008201723,0.00015358152,0.0004117872,0.00016889296,0.020379985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998248,0.00039583223,0.000104244486,0.00042974023,0.0005049458,0.00031736112],"domain_scores_gemma":[0.99822026,0.00055902766,0.00019775599,0.0002584178,0.00032918857,0.00043538777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064581697,0.00069273874,0.00068460574,0.0011878354,0.0017472443,0.005786481,0.00092197466,0.0010143602,0.008565888],"category_scores_gemma":[0.004129897,0.0005335608,0.0008535287,0.0008859214,0.0043740743,0.0073012053,0.0027493734,0.002382081,0.0009598164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011619506,0.000008273527,0.00021952162,0.000016343149,0.000004929881,0.00004108025,0.00021291543,0.00072009163,0.00050716643,0.99506664,0.00038686654,0.0028045105],"study_design_scores_gemma":[0.0000112437865,0.000012109503,0.00032328232,0.000011849942,0.000009345825,0.00012138543,0.00022759226,0.0067423973,0.000796313,0.9800598,0.01167183,0.000012789917],"about_ca_topic_score_codex":0.002716605,"about_ca_topic_score_gemma":0.0016215676,"teacher_disagreement_score":0.008565888,"about_ca_system_score_codex":0.0018774585,"about_ca_system_score_gemma":0.00088317634,"threshold_uncertainty_score":0.028655708},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26667294,0.007154894,0.6552168,0.007750593,0.0007107059,0.00017748798,0.0010968562,0.0024869647,0.058732744],"genre_scores_gemma":[0.8260751,0.0029835368,0.14540432,0.0020759928,0.001501857,0.000581861,0.0019196846,0.0015430646,0.01791462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99406576,0.001042451,0.0004302145,0.0017523759,0.0015420907,0.0011671736],"domain_scores_gemma":[0.94054365,0.046826575,0.0024332234,0.0055822325,0.0024622579,0.0021519577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004027695,0.00166927,0.0023383386,0.0023299274,0.0030094176,0.0049335426,0.0039647776,0.0032786839,0.013598201],"category_scores_gemma":[0.041327674,0.0010678605,0.002576098,0.002705861,0.0057295947,0.020376215,0.005120266,0.00903252,0.0037290321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013752648,0.0005328744,0.0065654744,0.0010172729,0.00010405962,0.0005063973,0.001473244,0.036781564,0.014564496,0.80053806,0.01110855,0.12543276],"study_design_scores_gemma":[0.00005347369,0.00016834872,0.00082885794,0.00008408406,0.000058898302,0.00029120885,0.00014501926,0.06785398,0.0069049867,0.91855186,0.005002008,0.00005730684],"about_ca_topic_score_codex":0.00094675587,"about_ca_topic_score_gemma":0.001072668,"teacher_disagreement_score":0.013598201,"about_ca_system_score_codex":0.0031886734,"about_ca_system_score_gemma":0.001982646,"threshold_uncertainty_score":0.045490503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37963423,0.00650795,0.37846178,0.0062193624,0.00048649855,0.00012661185,0.00072303973,0.0020167546,0.22582382],"genre_scores_gemma":[0.8461958,0.0037157855,0.124330565,0.0010052474,0.00039792026,0.00017409798,0.0007728347,0.000430231,0.022977432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999084,0.0002790759,0.000038928465,0.00021400655,0.00023512541,0.00014881181],"domain_scores_gemma":[0.99694353,0.0018794928,0.00015960274,0.0005279355,0.00018995386,0.00029955385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088327687,0.0005238149,0.00069944013,0.0013363245,0.0016984621,0.002150979,0.0011561695,0.0013795195,0.008777889],"category_scores_gemma":[0.0044252384,0.00083342846,0.00077708304,0.0016709523,0.0027953174,0.0047327895,0.003983057,0.003646082,0.0013992005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052144664,0.00002050957,0.0008874756,0.00013005725,0.000012780891,0.00040246136,0.00052417815,0.0046415245,0.0040945373,0.9734274,0.003402366,0.012404529],"study_design_scores_gemma":[0.000024646239,0.00006739415,0.00079128414,0.00007026486,0.000032652333,0.0009208859,0.000380615,0.019154562,0.0061430256,0.94247437,0.029895449,0.0000449898],"about_ca_topic_score_codex":0.00090257946,"about_ca_topic_score_gemma":0.0008497653,"teacher_disagreement_score":0.008777889,"about_ca_system_score_codex":0.0009802048,"about_ca_system_score_gemma":0.00033908643,"threshold_uncertainty_score":0.029364944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71354216,0.0011046923,0.18409023,0.0010099666,0.00025954965,0.000041869516,0.00053140934,0.000145858,0.09927429],"genre_scores_gemma":[0.96630985,0.00070536206,0.022894563,0.0001866672,0.0002497538,0.00004691316,0.00033140022,0.000085783635,0.00918977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987208,0.00035312993,0.00005945575,0.00017253778,0.00033627645,0.00035778695],"domain_scores_gemma":[0.99743783,0.0014459424,0.00030601857,0.00019083664,0.0003564176,0.0002628046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013434778,0.00053781463,0.0007634654,0.002188542,0.0010983126,0.0019087447,0.0008295058,0.00058086106,0.0050233947],"category_scores_gemma":[0.0063228915,0.00028376133,0.00073941716,0.0017224008,0.0027202698,0.0033651618,0.0018485448,0.0021736792,0.00084251666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006701594,0.000014499877,0.00044952912,0.000029457009,0.0000042590996,0.00007557697,0.00014571482,0.0023296936,0.0016160241,0.98447996,0.0005792077,0.010208907],"study_design_scores_gemma":[0.000020583886,0.00004687984,0.0005907853,0.000019097699,0.0000060950215,0.000105554405,0.0001365327,0.020924455,0.0015257593,0.9740539,0.0025459025,0.00002438297],"about_ca_topic_score_codex":0.0019096041,"about_ca_topic_score_gemma":0.001388399,"teacher_disagreement_score":0.0050233947,"about_ca_system_score_codex":0.0011509609,"about_ca_system_score_gemma":0.00043108565,"threshold_uncertainty_score":0.016804934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49806187,0.0018320188,0.43426263,0.0014891395,0.00014636002,0.000091861024,0.0006662706,0.0004142904,0.06303554],"genre_scores_gemma":[0.9397441,0.0010434267,0.04486093,0.00028562246,0.00028073636,0.00013091211,0.0005456196,0.00012147871,0.012987044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992766,0.00016978158,0.00003871101,0.00013979003,0.0002565484,0.00011860919],"domain_scores_gemma":[0.99786097,0.00096767326,0.0003565416,0.00021625341,0.00031684866,0.00028174516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009487735,0.0004020473,0.0003756373,0.002224502,0.0019656005,0.0021884304,0.000595373,0.00086507795,0.004905601],"category_scores_gemma":[0.004497577,0.00030526918,0.0010140389,0.0015876846,0.0017202041,0.0026919497,0.0011114961,0.0013120077,0.0005225146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014801075,0.000013959249,0.001301386,0.000031399806,0.000008078824,0.00024994236,0.00029689315,0.0015906247,0.001525416,0.9866403,0.000833626,0.007493678],"study_design_scores_gemma":[0.0000069251587,0.00003069706,0.0019541972,0.000034118824,0.000009987694,0.00090527674,0.0001671142,0.02042549,0.00094684184,0.9670659,0.008436349,0.00001716147],"about_ca_topic_score_codex":0.00073825085,"about_ca_topic_score_gemma":0.00058960204,"teacher_disagreement_score":0.004905601,"about_ca_system_score_codex":0.0010380315,"about_ca_system_score_gemma":0.00040074458,"threshold_uncertainty_score":0.016410887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660534,0.0009873522,0.20761992,0.0026103177,0.000077871664,0.00019006943,0.00068544224,0.0009605423,0.020815132],"genre_scores_gemma":[0.9767259,0.0006559312,0.015263458,0.00029646224,0.00008090131,0.00028427606,0.00056669535,0.00024104991,0.00588548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976743,0.0009021632,0.00007114263,0.000501176,0.00047704612,0.00037422663],"domain_scores_gemma":[0.9783513,0.014315929,0.0021995464,0.0024949796,0.0011797504,0.001458585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027219208,0.0007577333,0.0011526488,0.0018513456,0.0014175943,0.001964825,0.002592302,0.0014139445,0.0047324933],"category_scores_gemma":[0.022020945,0.00093852327,0.0010279783,0.0009578026,0.0030699726,0.0052988003,0.0022918526,0.0019526427,0.00078494305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009874012,0.00022621537,0.017619595,0.00039736845,0.0002398861,0.00073688896,0.00081642123,0.30930588,0.026649343,0.59032476,0.010767982,0.04192824],"study_design_scores_gemma":[0.000096741125,0.00028219182,0.0050697424,0.000059372527,0.00008723927,0.0008888855,0.00020921665,0.7730019,0.0064140046,0.20983462,0.0039686807,0.00008730669],"about_ca_topic_score_codex":0.0014627554,"about_ca_topic_score_gemma":0.0013946593,"teacher_disagreement_score":0.0047324933,"about_ca_system_score_codex":0.0025460143,"about_ca_system_score_gemma":0.00095269305,"threshold_uncertainty_score":0.018472672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.848985,0.0004294874,0.10662992,0.0012052311,0.00014583067,0.00015369509,0.0010149692,0.00072278245,0.040713128],"genre_scores_gemma":[0.95387775,0.00024449022,0.030897051,0.00012225601,0.00008201401,0.00015360303,0.000758199,0.00013001704,0.013734704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890685,0.00015784882,0.00013478882,0.00035204226,0.00027245985,0.00017605697],"domain_scores_gemma":[0.99820673,0.0008009704,0.000255023,0.00030946406,0.00018891341,0.00023891257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082798174,0.0004872179,0.00055115845,0.0010261666,0.001793517,0.004451872,0.0008660912,0.00090633426,0.008554824],"category_scores_gemma":[0.0036654633,0.00050050975,0.0007087975,0.0010555062,0.0024424177,0.0076964847,0.0026941835,0.0013814035,0.0010279019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000323235,0.00008284121,0.005270108,0.00013660121,0.000020340121,0.00046848267,0.002316402,0.002485709,0.007209171,0.95366305,0.0024667897,0.025557218],"study_design_scores_gemma":[0.00004555554,0.000086294865,0.0011536361,0.00005437978,0.000029911602,0.00052980235,0.0010652173,0.009249872,0.0083038835,0.96314627,0.016291974,0.00004329931],"about_ca_topic_score_codex":0.0007045295,"about_ca_topic_score_gemma":0.0010132607,"teacher_disagreement_score":0.008554824,"about_ca_system_score_codex":0.0014783723,"about_ca_system_score_gemma":0.00080669794,"threshold_uncertainty_score":0.028618693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84514785,0.00076019997,0.11385832,0.000699869,0.00021093288,0.00007324614,0.00026623378,0.0003107632,0.038672492],"genre_scores_gemma":[0.9749449,0.0002070829,0.014089986,0.000094276504,0.00015021271,0.000041743802,0.00022059232,0.00009012036,0.010161042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987924,0.00027007386,0.000061422514,0.00018123585,0.0003459097,0.0003489643],"domain_scores_gemma":[0.9986526,0.00032989882,0.0001925915,0.00014981799,0.00027539855,0.0003997018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011271305,0.00058823527,0.00059362553,0.0014188321,0.0010793128,0.0019577846,0.00084509567,0.00033016436,0.00549198],"category_scores_gemma":[0.0019602627,0.0004141625,0.00092494854,0.0005738132,0.0034369687,0.0035433855,0.0018240971,0.0012536519,0.0010211213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082915154,0.00003559531,0.00035016515,0.000026379283,0.0000075093026,0.00007815625,0.00039200706,0.0005835393,0.002676446,0.99213564,0.00036911992,0.0032625303],"study_design_scores_gemma":[0.000052646294,0.00011626846,0.0007921137,0.000015993219,0.000010418764,0.00018517257,0.00034501974,0.011712233,0.0077193114,0.97521055,0.0038014299,0.00003874678],"about_ca_topic_score_codex":0.0009732586,"about_ca_topic_score_gemma":0.00072632864,"teacher_disagreement_score":0.00549198,"about_ca_system_score_codex":0.0010914026,"about_ca_system_score_gemma":0.0007188312,"threshold_uncertainty_score":0.018372476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78540903,0.00037404458,0.16025268,0.00023568435,0.0001062801,0.0000778018,0.0002849951,0.0002683191,0.05299124],"genre_scores_gemma":[0.9538642,0.00020638348,0.034970205,0.00010171585,0.00004651556,0.00006165085,0.0003091743,0.000096584816,0.010343605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977535,0.000037064037,0.000017224513,0.000043581822,0.00007776016,0.00004903341],"domain_scores_gemma":[0.9995166,0.00011405739,0.00009708881,0.00010068697,0.000090302405,0.000081178776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002485228,0.00023157887,0.00029054508,0.0008563502,0.0007291225,0.0009405723,0.00033742195,0.00035174514,0.0048857396],"category_scores_gemma":[0.0011577471,0.00019772026,0.00041670023,0.00048913877,0.000995221,0.0016199334,0.000577954,0.00055001286,0.00034496255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035181063,0.000020477726,0.0010368056,0.000033881857,0.000005186847,0.00016873934,0.0002019844,0.0063855127,0.004170677,0.97447205,0.00093248015,0.012537019],"study_design_scores_gemma":[0.000014536259,0.000049805043,0.0014956782,0.000020936704,0.0000071055247,0.00038345085,0.00020290799,0.05975683,0.0060823685,0.9259407,0.006022111,0.000023577044],"about_ca_topic_score_codex":0.0010674024,"about_ca_topic_score_gemma":0.001604517,"teacher_disagreement_score":0.0048857396,"about_ca_system_score_codex":0.00049959816,"about_ca_system_score_gemma":0.00032627556,"threshold_uncertainty_score":0.016344428},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3996887,0.00023022038,0.57805836,0.00027775255,0.000059330014,0.00012129507,0.0001639381,0.0003867726,0.021013616],"genre_scores_gemma":[0.8428124,0.00017648363,0.15069547,0.00010698782,0.000057302674,0.0002106246,0.00018555217,0.000075311735,0.0056799194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998372,0.00052714883,0.000112808644,0.00036323062,0.00039500344,0.00022973798],"domain_scores_gemma":[0.99162745,0.003874274,0.0009804581,0.0026529555,0.0005400464,0.0003248247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567408,0.0004975634,0.0006442119,0.00063602027,0.00079721713,0.0013151541,0.0007610545,0.00091392634,0.0051512932],"category_scores_gemma":[0.006145599,0.00049215066,0.000811316,0.00045471475,0.0016229616,0.0024711862,0.0018366947,0.0019594885,0.00086810754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030853986,0.00009224657,0.0010794208,0.00015606274,0.00003491518,0.00027355566,0.0004548319,0.0140990075,0.042703677,0.9112668,0.0005193244,0.029011598],"study_design_scores_gemma":[0.00022671963,0.0006524228,0.0005140205,0.00007544376,0.0000652968,0.00067490153,0.00020570892,0.06839955,0.05999236,0.8545835,0.014549761,0.000060298855],"about_ca_topic_score_codex":0.00012948159,"about_ca_topic_score_gemma":0.0002456656,"teacher_disagreement_score":0.0051512932,"about_ca_system_score_codex":0.00049611257,"about_ca_system_score_gemma":0.0005652318,"threshold_uncertainty_score":0.017232835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36913678,0.004732294,0.41856933,0.016436921,0.0005577172,0.00036498808,0.006278829,0.0045931134,0.17933004],"genre_scores_gemma":[0.8776024,0.002259875,0.0669535,0.0034536817,0.0007444772,0.0006547839,0.0047697118,0.0012034737,0.042358063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942344,0.0011083115,0.0002705306,0.0017736121,0.0011417028,0.0014714184],"domain_scores_gemma":[0.9662705,0.024539623,0.0014396006,0.0038596261,0.0016144449,0.0022760637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002835172,0.001928932,0.0019363592,0.0020265114,0.0031214233,0.008744392,0.004860244,0.0028573421,0.025174657],"category_scores_gemma":[0.020940697,0.0015667045,0.0018710598,0.0030610121,0.0037527797,0.01642837,0.008833851,0.0050340304,0.0056836186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016550326,0.0004325035,0.0069440543,0.0015195373,0.00022664359,0.00071331236,0.0020725906,0.054193333,0.010011421,0.81097555,0.034896154,0.07635986],"study_design_scores_gemma":[0.00017000327,0.000106480744,0.00085161,0.00011967397,0.0001183901,0.00034723623,0.0002271992,0.09757007,0.003379059,0.88801277,0.009034405,0.000063174026],"about_ca_topic_score_codex":0.0029323073,"about_ca_topic_score_gemma":0.0046990165,"teacher_disagreement_score":0.025174657,"about_ca_system_score_codex":0.0049858307,"about_ca_system_score_gemma":0.0020211893,"threshold_uncertainty_score":0.08421761},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3231592,0.015190432,0.43196598,0.021939816,0.0067714234,0.00018653872,0.0009840654,0.0009783041,0.19882424],"genre_scores_gemma":[0.84586185,0.010086816,0.095022835,0.004654132,0.0059756655,0.00019586668,0.0007043972,0.0004737527,0.037024785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977791,0.00071959797,0.00014460059,0.00043528064,0.000563121,0.00035836617],"domain_scores_gemma":[0.99108595,0.0066371197,0.00047087795,0.00062937336,0.0005638434,0.00061282096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675294,0.0012163445,0.0013832717,0.0042752298,0.0025389486,0.0039824797,0.001553622,0.0021473926,0.0048781736],"category_scores_gemma":[0.014117642,0.0006156358,0.0012966978,0.003999619,0.004763767,0.012843128,0.002710678,0.004490618,0.00074696407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005673677,0.00004294843,0.001052424,0.00009024251,0.000011950327,0.00009425486,0.00030620495,0.0018018233,0.0012930229,0.9744505,0.0050495784,0.015750298],"study_design_scores_gemma":[0.000017000224,0.000041625044,0.00060628983,0.00007119213,0.000022786162,0.00017362504,0.00010237148,0.013376382,0.0015503695,0.96572965,0.018265415,0.00004322363],"about_ca_topic_score_codex":0.00246989,"about_ca_topic_score_gemma":0.0017094372,"teacher_disagreement_score":0.0048781736,"about_ca_system_score_codex":0.0025902796,"about_ca_system_score_gemma":0.0010543343,"threshold_uncertainty_score":0.01879394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5000433,0.0018964465,0.33728456,0.0010979777,0.0002827016,0.00008296421,0.00030339407,0.00045446545,0.15855408],"genre_scores_gemma":[0.94939977,0.00057175476,0.036238924,0.00018446764,0.00009881819,0.000040458293,0.00015501752,0.0000699296,0.013240821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959296,0.00008270438,0.000018336059,0.00009182914,0.00015170591,0.00006247148],"domain_scores_gemma":[0.9993247,0.00025870395,0.00010414923,0.00009525768,0.00010946383,0.00010780437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028556612,0.00023728797,0.00018084109,0.0012772925,0.0007128392,0.0014443396,0.0005510936,0.00057830557,0.003806316],"category_scores_gemma":[0.0018442519,0.00015133488,0.00025777135,0.00083987677,0.0013756708,0.0025857696,0.0012233392,0.0007290825,0.00039656422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063147186,0.000005438952,0.00025105165,0.000019994319,0.0000018402588,0.00008208661,0.00015280469,0.00042441417,0.0010155474,0.99317825,0.0002463847,0.0046158535],"study_design_scores_gemma":[0.0000068634613,0.000012253332,0.00034206526,0.000014452474,0.0000066464804,0.00028314482,0.00016229322,0.004179255,0.0017382661,0.9792292,0.014017408,0.00000808833],"about_ca_topic_score_codex":0.00062076683,"about_ca_topic_score_gemma":0.0008549555,"teacher_disagreement_score":0.003806316,"about_ca_system_score_codex":0.0007779807,"about_ca_system_score_gemma":0.0003478805,"threshold_uncertainty_score":0.0127334},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30818617,0.0068933363,0.579721,0.0017308366,0.0008657143,0.00035502794,0.002290538,0.0015246337,0.09843288],"genre_scores_gemma":[0.83441323,0.0022251217,0.12838106,0.00075219426,0.00056258973,0.0006042659,0.0021415015,0.00083645707,0.03008351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682766,0.00046401346,0.000297053,0.00092815125,0.0009270207,0.00055601436],"domain_scores_gemma":[0.9904221,0.005733101,0.0009779277,0.0012520591,0.0011219328,0.00049289095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018405643,0.0012707846,0.0017407624,0.0024543456,0.0030596938,0.003885748,0.0017820895,0.002086425,0.018505588],"category_scores_gemma":[0.019020673,0.0010115427,0.001972866,0.0016119335,0.0032116538,0.01095084,0.002466075,0.0018928996,0.003437578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008475053,0.00010400075,0.00945305,0.0009370361,0.000110431094,0.001138974,0.0014146902,0.015044834,0.018091556,0.8479962,0.009040923,0.09582075],"study_design_scores_gemma":[0.000053406995,0.00016582808,0.0014712656,0.00025372434,0.00008735685,0.0016096608,0.0003194578,0.031837255,0.009957256,0.9206824,0.03344188,0.00012047646],"about_ca_topic_score_codex":0.0013288441,"about_ca_topic_score_gemma":0.0016082312,"teacher_disagreement_score":0.018505588,"about_ca_system_score_codex":0.0017910218,"about_ca_system_score_gemma":0.0011983424,"threshold_uncertainty_score":0.06190741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.574773,0.008104206,0.3737851,0.0032903913,0.00020774265,0.00024358118,0.0022048422,0.00082683,0.036564313],"genre_scores_gemma":[0.8302429,0.003882338,0.15515791,0.0003717967,0.00019396358,0.0003606298,0.0009545547,0.00048119412,0.008354639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892163,0.00027485922,0.00005454368,0.0004204331,0.00015596185,0.0001725091],"domain_scores_gemma":[0.99426806,0.0037685933,0.0007122955,0.00046898596,0.00035410575,0.00042778408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008558652,0.0013991406,0.0012797951,0.0023422253,0.0014256748,0.0025259266,0.0020404933,0.0017602284,0.0035869943],"category_scores_gemma":[0.009544552,0.0009058983,0.0006998639,0.002503787,0.0014788095,0.0050291363,0.0015175606,0.0010912191,0.0005419928],"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.001073422,0.00017837757,0.0051012686,0.0017125936,0.00035389294,0.0005767023,0.0005930521,0.4139913,0.04094726,0.3925445,0.013748556,0.12917908],"study_design_scores_gemma":[0.00006798615,0.00021481774,0.001979949,0.00021172846,0.00014781719,0.00059539493,0.0002326102,0.44972548,0.012621567,0.52134454,0.012776248,0.00008185607],"about_ca_topic_score_codex":0.0015412553,"about_ca_topic_score_gemma":0.002552727,"teacher_disagreement_score":0.0035869943,"about_ca_system_score_codex":0.0022146346,"about_ca_system_score_gemma":0.0010629572,"threshold_uncertainty_score":0.016068399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66046095,0.0016382443,0.25746822,0.0034143927,0.00018632093,0.00020197248,0.0012824563,0.0007037052,0.07464386],"genre_scores_gemma":[0.95667654,0.00079929066,0.03088609,0.00042436144,0.0002163685,0.00021271216,0.00075251726,0.00025487415,0.009777116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802667,0.0005424761,0.00004739172,0.00051517435,0.00050286273,0.00036539833],"domain_scores_gemma":[0.98640907,0.008954231,0.0013748053,0.0014373347,0.0007826251,0.0010419006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014144778,0.0005998325,0.00078001694,0.0021951182,0.0021667052,0.003228468,0.001751222,0.001531183,0.0067475107],"category_scores_gemma":[0.013616186,0.000829518,0.00088212715,0.0020675843,0.005042267,0.004173331,0.0024469332,0.0019674273,0.000632898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093265844,0.00004010855,0.0012510223,0.000098718076,0.00002962178,0.00013205982,0.00046350932,0.026268208,0.002777903,0.95732707,0.0045649395,0.0069537107],"study_design_scores_gemma":[0.000048519625,0.000025013853,0.0011505001,0.000031644668,0.000018744196,0.00022380798,0.00011557821,0.09205245,0.0011257244,0.8992696,0.0059117153,0.000026645374],"about_ca_topic_score_codex":0.005359627,"about_ca_topic_score_gemma":0.004419033,"teacher_disagreement_score":0.0067475107,"about_ca_system_score_codex":0.004248577,"about_ca_system_score_gemma":0.0009737854,"threshold_uncertainty_score":0.030825734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4781557,0.018593524,0.2363777,0.014844283,0.000968448,0.000052224295,0.0010201026,0.0007769978,0.24921097],"genre_scores_gemma":[0.9521329,0.0043818597,0.02252657,0.0018178488,0.0006065393,0.00005787586,0.0003959224,0.0001259414,0.017954525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991103,0.00031897088,0.00003793779,0.00023638415,0.00018426795,0.00011215292],"domain_scores_gemma":[0.9975446,0.0013912731,0.00021530013,0.00030608548,0.0003155831,0.00022709019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013850307,0.00051044597,0.0008116551,0.0010584223,0.0015226695,0.002227478,0.0009987621,0.0011296511,0.006485107],"category_scores_gemma":[0.005298574,0.00040586482,0.00061833084,0.001338235,0.0030938261,0.007995298,0.0025404936,0.0025155987,0.0012027817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050717823,0.000013422785,0.00019040918,0.000079400925,0.00001059683,0.00006620891,0.00017759684,0.0011565152,0.0006729091,0.9911668,0.0026180642,0.0037973672],"study_design_scores_gemma":[0.000016258236,0.000013684725,0.000259923,0.000022535438,0.000012241106,0.0001350236,0.00011395551,0.0031938471,0.00043641057,0.9892757,0.006506698,0.000013704002],"about_ca_topic_score_codex":0.001347026,"about_ca_topic_score_gemma":0.00084705226,"teacher_disagreement_score":0.006485107,"about_ca_system_score_codex":0.0012600146,"about_ca_system_score_gemma":0.00039953348,"threshold_uncertainty_score":0.021694839},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6349644,0.001383569,0.30385026,0.003174057,0.00017851935,0.00017728878,0.0010703289,0.0008009511,0.05440062],"genre_scores_gemma":[0.97264284,0.00056146167,0.021192197,0.0004166055,0.00018477556,0.00025791483,0.00064311427,0.00017850014,0.0039225733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.00033468468,0.000075659555,0.00024688247,0.0003473777,0.00027001268],"domain_scores_gemma":[0.9839865,0.011813828,0.00094373943,0.0008788645,0.0010005495,0.0013764919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020701834,0.0005264726,0.0010989028,0.002486234,0.0020170673,0.0024896825,0.0016264971,0.002158534,0.005293186],"category_scores_gemma":[0.02001539,0.0006950596,0.0011769303,0.0008429085,0.0029682922,0.0034104234,0.0029190746,0.0023131457,0.0006835408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016885264,0.00006486381,0.0013071292,0.00017646681,0.000026411508,0.00037206046,0.0004273551,0.026206113,0.006734505,0.95640707,0.0029720033,0.005137204],"study_design_scores_gemma":[0.00008486408,0.00005449683,0.0011907546,0.000052588184,0.000016965405,0.0002568188,0.00014647572,0.15340498,0.0033947576,0.83933014,0.002026529,0.00004052979],"about_ca_topic_score_codex":0.0011159845,"about_ca_topic_score_gemma":0.0011829687,"teacher_disagreement_score":0.005293186,"about_ca_system_score_codex":0.0010003209,"about_ca_system_score_gemma":0.00059099565,"threshold_uncertainty_score":0.017707467},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9273449,0.0005915378,0.0635267,0.00023198825,0.000020310265,0.000033224427,0.0003226876,0.00038201953,0.007546618],"genre_scores_gemma":[0.9899478,0.00025283004,0.007899426,0.00005245932,0.0000469507,0.000069738446,0.00040646453,0.00012294605,0.0012013608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918777,0.00016568543,0.000043319837,0.0002560036,0.00018383253,0.00016333198],"domain_scores_gemma":[0.99061894,0.0051167007,0.00225656,0.0007444017,0.0005283262,0.0007350292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976216,0.00047068595,0.00067421875,0.0019116439,0.0008195727,0.0016353256,0.0011108123,0.00069245725,0.005018778],"category_scores_gemma":[0.012008362,0.0003836109,0.0006811429,0.00095500326,0.0017707556,0.002130645,0.0011257533,0.0010034981,0.000503463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023139904,0.00026225357,0.05363154,0.0006628391,0.00021640697,0.0021282285,0.0017289682,0.22107194,0.080794744,0.5573312,0.004337921,0.07551992],"study_design_scores_gemma":[0.00012534497,0.0004917977,0.03442925,0.000118224314,0.000067313376,0.002259879,0.00053506,0.56804395,0.01587586,0.3731749,0.0047432478,0.0001351933],"about_ca_topic_score_codex":0.00097098056,"about_ca_topic_score_gemma":0.0005093451,"teacher_disagreement_score":0.005018778,"about_ca_system_score_codex":0.00091234554,"about_ca_system_score_gemma":0.0003831628,"threshold_uncertainty_score":0.016789436},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4773137,0.001433128,0.4703226,0.000995187,0.00013186708,0.000114870825,0.0014562784,0.0004886288,0.047743782],"genre_scores_gemma":[0.8891845,0.0010440322,0.0921015,0.00022050149,0.00007890849,0.00009935388,0.0007953341,0.00012531727,0.016350653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996886,0.00007061383,0.00001957348,0.00010774792,0.000047605285,0.00006591129],"domain_scores_gemma":[0.9989039,0.000431413,0.00015264966,0.00019887066,0.00014845785,0.00016471007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034573753,0.0002879468,0.0002610106,0.000729706,0.0008097421,0.0009561873,0.00050201383,0.00045537058,0.006052853],"category_scores_gemma":[0.001527712,0.00034336693,0.00032128,0.0007666865,0.0010077563,0.0034574445,0.0010881678,0.000866534,0.00041946853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058460224,0.000020951979,0.0018554328,0.000099592056,0.000012593836,0.00024856153,0.00031816313,0.010713901,0.0048573227,0.962463,0.0017552776,0.017596764],"study_design_scores_gemma":[0.000018183067,0.000044749908,0.0022049868,0.00006492198,0.000021935371,0.0006278102,0.0004073863,0.053620137,0.0048732883,0.9064369,0.03164925,0.00003036846],"about_ca_topic_score_codex":0.0014414329,"about_ca_topic_score_gemma":0.0022858526,"teacher_disagreement_score":0.006052853,"about_ca_system_score_codex":0.00087651354,"about_ca_system_score_gemma":0.0004948888,"threshold_uncertainty_score":0.02024883},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07246523,0.0015906135,0.8474431,0.0015883814,0.00092826656,0.0003030856,0.0011585569,0.0016135786,0.07290913],"genre_scores_gemma":[0.52853423,0.0028569982,0.41609827,0.002349743,0.0012478201,0.00075874146,0.0028185933,0.0015715522,0.043764047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966612,0.0007991333,0.00014357915,0.0010389969,0.0006478396,0.0007092979],"domain_scores_gemma":[0.99455065,0.0020613275,0.0005771041,0.001418201,0.00073566986,0.0006570055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00160755,0.0020060425,0.0010162411,0.001737772,0.002531145,0.002962795,0.0025874968,0.0011516146,0.015075042],"category_scores_gemma":[0.0059211957,0.0006758187,0.0017126038,0.0038813818,0.0031790275,0.0070259934,0.0050309408,0.0042884443,0.0027510305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021903082,0.0001400473,0.0009601991,0.0002640502,0.00005338834,0.00027509246,0.00042618412,0.03232773,0.003973915,0.8897494,0.016473807,0.05513715],"study_design_scores_gemma":[0.000076951015,0.00011698857,0.00043621086,0.000071245675,0.00005369439,0.0005144557,0.00022276645,0.120150834,0.0034090371,0.8290822,0.045789864,0.00007576891],"about_ca_topic_score_codex":0.0032475668,"about_ca_topic_score_gemma":0.003962607,"teacher_disagreement_score":0.015075042,"about_ca_system_score_codex":0.0032433881,"about_ca_system_score_gemma":0.0018173081,"threshold_uncertainty_score":0.050431013},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64277345,0.0012340482,0.18328688,0.0011970106,0.00040672516,0.00007329313,0.00038340755,0.0006912695,0.16995388],"genre_scores_gemma":[0.96564454,0.00044534015,0.016261779,0.00025750734,0.00015871742,0.00005875592,0.00022404802,0.00017434442,0.016774992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995129,0.000063390726,0.000023187507,0.00012273574,0.00015009785,0.00012762548],"domain_scores_gemma":[0.9994086,0.00014487543,0.00014832662,0.000083696796,0.00009662296,0.00011783649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005736683,0.00050525425,0.00053733937,0.0030245548,0.0012616575,0.001896837,0.0006681946,0.0005483206,0.006967995],"category_scores_gemma":[0.0011430428,0.0002654271,0.0008097933,0.0013577621,0.0027588408,0.0025364826,0.0018908782,0.0014773083,0.0014235725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023033987,0.00001737823,0.0003367663,0.000023387438,0.000005505937,0.0001203861,0.00031155933,0.00070308807,0.0019003322,0.9881787,0.0008518079,0.007527961],"study_design_scores_gemma":[0.000014079207,0.000037469654,0.0012875305,0.00002159995,0.000015551896,0.00031693888,0.00027499543,0.0046619284,0.0027681466,0.98144907,0.009117069,0.000035654095],"about_ca_topic_score_codex":0.0009022407,"about_ca_topic_score_gemma":0.0007007218,"teacher_disagreement_score":0.006967995,"about_ca_system_score_codex":0.0012193078,"about_ca_system_score_gemma":0.0004370379,"threshold_uncertainty_score":0.023310244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87854373,0.0005954029,0.09092549,0.0005432087,0.0000322414,0.00012173605,0.0028451146,0.00047215336,0.025920955],"genre_scores_gemma":[0.9672902,0.0004238905,0.024539934,0.00017219159,0.00004666201,0.000116780306,0.004252972,0.0001202342,0.003037053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.00014755996,0.00006344816,0.00023640582,0.00029918287,0.00022786477],"domain_scores_gemma":[0.99657506,0.001542836,0.0006941146,0.00046975553,0.00032694574,0.00039120988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034643192,0.00053794996,0.000667194,0.0012676881,0.00077737233,0.001193588,0.0012372921,0.0005628016,0.00569991],"category_scores_gemma":[0.0036268614,0.00070770003,0.00087344047,0.00164581,0.0008915124,0.002364065,0.0020814538,0.0008952799,0.0006114729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028508755,0.000584912,0.04324035,0.0021351287,0.00038757504,0.0037261406,0.00243045,0.12724474,0.19984965,0.4603049,0.018236587,0.13900882],"study_design_scores_gemma":[0.00021815556,0.00038888873,0.03513158,0.00018119921,0.00027803995,0.007455059,0.0012151528,0.23966883,0.07286942,0.6116907,0.030775853,0.0001271434],"about_ca_topic_score_codex":0.0010067405,"about_ca_topic_score_gemma":0.0013574472,"teacher_disagreement_score":0.00569991,"about_ca_system_score_codex":0.0009746091,"about_ca_system_score_gemma":0.00033198588,"threshold_uncertainty_score":0.019068062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4276669,0.0018313024,0.5232142,0.0012023876,0.00016662013,0.000072191986,0.00027182887,0.0008298156,0.044744756],"genre_scores_gemma":[0.9627578,0.00036426622,0.028010914,0.00026655168,0.0001460041,0.000101498736,0.00012705408,0.00022006784,0.008005853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832374,0.00034948683,0.000094426214,0.00040985187,0.0005768045,0.00024567646],"domain_scores_gemma":[0.9945103,0.0026512188,0.0008448669,0.00093497726,0.0004934581,0.00056529057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951956,0.0005784949,0.0007774201,0.0016281379,0.0012421878,0.0022189578,0.0010576366,0.0009009234,0.0064262543],"category_scores_gemma":[0.010458886,0.00045844025,0.00085445266,0.00077715784,0.0043246797,0.004320446,0.0028974793,0.0024680991,0.0009235581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000776694,0.000016455107,0.0015440964,0.00006830014,0.00001824013,0.00023543727,0.0002756373,0.0065894667,0.005019195,0.9768554,0.0005503837,0.008749763],"study_design_scores_gemma":[0.000012999904,0.000034446595,0.0011230959,0.000035125657,0.000018782128,0.00071552786,0.00015843983,0.037355397,0.004930315,0.9523356,0.0032461598,0.000034229157],"about_ca_topic_score_codex":0.00069554354,"about_ca_topic_score_gemma":0.00047300252,"teacher_disagreement_score":0.0064262543,"about_ca_system_score_codex":0.0012552638,"about_ca_system_score_gemma":0.0005855497,"threshold_uncertainty_score":0.021497905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25105274,0.0003703394,0.72152495,0.0005476358,0.00009910025,0.00014393819,0.00048033235,0.00026531456,0.025515655],"genre_scores_gemma":[0.8988475,0.00025128675,0.091481246,0.00020571287,0.00013529866,0.00016323557,0.00035448774,0.00011406097,0.008447055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983209,0.00032379726,0.00009059272,0.0004986767,0.00035473309,0.00041130002],"domain_scores_gemma":[0.99561846,0.0016632391,0.00063180027,0.0011115428,0.00051643647,0.00045857308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935182,0.000511303,0.00063549826,0.0007968427,0.0016532888,0.0015745964,0.0006347516,0.0007746085,0.0064835134],"category_scores_gemma":[0.00659147,0.0004065049,0.00101714,0.0006892591,0.003243109,0.0038020352,0.0018820703,0.0013862678,0.0005784801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012123717,0.00004104795,0.0012411288,0.000054097844,0.000021897105,0.0001682876,0.0005006825,0.015248212,0.003407223,0.9669274,0.0014808355,0.01078799],"study_design_scores_gemma":[0.000028399072,0.0000715607,0.0006573214,0.000030475807,0.000020147736,0.00022340243,0.00029357767,0.05517584,0.0020805462,0.9358367,0.005551791,0.000030219298],"about_ca_topic_score_codex":0.0015926955,"about_ca_topic_score_gemma":0.001698639,"teacher_disagreement_score":0.0064835134,"about_ca_system_score_codex":0.0008930988,"about_ca_system_score_gemma":0.0007464083,"threshold_uncertainty_score":0.021689534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7396027,0.0004383281,0.18322067,0.0004278991,0.00015723586,0.000051092007,0.00016971766,0.00017104174,0.07576135],"genre_scores_gemma":[0.96295047,0.00016341142,0.02925302,0.00008121299,0.00006098277,0.000051478164,0.00012470252,0.000042486772,0.00727227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995522,0.00008199265,0.00002439718,0.000107694286,0.00014258496,0.0000909882],"domain_scores_gemma":[0.9994185,0.00022285931,0.000092598806,0.00012385489,0.00007642684,0.00006585811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032153432,0.00026365728,0.0003237024,0.00085658603,0.0008220217,0.0012792764,0.0007150941,0.0004201913,0.0066506322],"category_scores_gemma":[0.0014888537,0.00020181842,0.00029839482,0.0007814107,0.0015764371,0.002218881,0.0013980696,0.0007645167,0.0005121263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067483794,0.000018521956,0.00044623206,0.000027029411,0.000004896469,0.00009880265,0.0001574069,0.003608931,0.0075874464,0.97943044,0.00030263583,0.008250103],"study_design_scores_gemma":[0.00004567682,0.00014995491,0.00063532306,0.000024368826,0.000016195314,0.00044925822,0.0004329297,0.066924624,0.02157867,0.89704406,0.012667925,0.000031160474],"about_ca_topic_score_codex":0.00031754302,"about_ca_topic_score_gemma":0.00027000895,"teacher_disagreement_score":0.0066506322,"about_ca_system_score_codex":0.00060380343,"about_ca_system_score_gemma":0.00021455424,"threshold_uncertainty_score":0.022248566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5087344,0.0012037872,0.12768626,0.0014926965,0.00082335225,0.00007610912,0.00028456136,0.00052462704,0.35917416],"genre_scores_gemma":[0.92512774,0.00049481663,0.027777117,0.0003614095,0.0003970119,0.000096167954,0.00019838993,0.00024104287,0.04530621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.00005504804,0.000013258735,0.00007595579,0.00016352169,0.00009454617],"domain_scores_gemma":[0.9996785,0.0000835613,0.000045448996,0.000044183125,0.00006374791,0.00008466184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028255972,0.00031563907,0.00032328788,0.0010967066,0.001408957,0.0010887136,0.0009338978,0.00072066253,0.009354675],"category_scores_gemma":[0.001316697,0.0002248087,0.00037266896,0.0007782407,0.0017687399,0.0020309407,0.001293941,0.0015930914,0.0016358652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028183496,0.000017278311,0.00017546263,0.000025835341,0.0000023361806,0.0001770261,0.0001740633,0.00097350054,0.0024339408,0.98746526,0.0015807458,0.0069463104],"study_design_scores_gemma":[0.000010800107,0.0000479328,0.0005214728,0.000016567312,0.000004585106,0.0004890386,0.0001425963,0.011885446,0.001763249,0.9719793,0.013107805,0.00003105133],"about_ca_topic_score_codex":0.0014183715,"about_ca_topic_score_gemma":0.0016215036,"teacher_disagreement_score":0.009354675,"about_ca_system_score_codex":0.00045880134,"about_ca_system_score_gemma":0.0002313992,"threshold_uncertainty_score":0.031294525},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08703065,0.017430991,0.26008043,0.32582206,0.009530995,0.00027953106,0.0007376027,0.0005351074,0.2985527],"genre_scores_gemma":[0.66334844,0.015260326,0.15130393,0.023587754,0.009893518,0.00048516123,0.0009201844,0.0005415023,0.1346592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851054,0.0006826183,0.00003915914,0.00033647378,0.00020322266,0.00022798788],"domain_scores_gemma":[0.9970348,0.0022096785,0.0001298336,0.00017607646,0.00017657925,0.00027307455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017483332,0.00075930223,0.0011390575,0.0007994549,0.005340469,0.0027023093,0.0015715095,0.0052601313,0.010133768],"category_scores_gemma":[0.01041709,0.0007002485,0.0011574471,0.0018166404,0.0046245377,0.008122519,0.0036377523,0.00676644,0.0018807397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089573456,0.00005334997,0.00017191387,0.0001356681,0.000013886321,0.00017216425,0.00048535576,0.0038709869,0.00031739168,0.92719907,0.053948805,0.013541747],"study_design_scores_gemma":[0.000066080764,0.00004145242,0.00016205352,0.00008317334,0.000013636302,0.00015342861,0.00033937002,0.008127105,0.00038825008,0.91337085,0.07722566,0.000028914617],"about_ca_topic_score_codex":0.004021594,"about_ca_topic_score_gemma":0.0024895736,"teacher_disagreement_score":0.010133768,"about_ca_system_score_codex":0.0026087936,"about_ca_system_score_gemma":0.0016405081,"threshold_uncertainty_score":0.033900857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2631846,0.00143705,0.6620816,0.00064716366,0.0003568519,0.00022795014,0.0010197083,0.00043583222,0.07060921],"genre_scores_gemma":[0.7233858,0.0009617009,0.25164977,0.00039213526,0.00027596162,0.00017012903,0.0012320018,0.00014908111,0.02178345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983878,0.0002417459,0.00010704886,0.0006438423,0.00030907243,0.00031058292],"domain_scores_gemma":[0.99677926,0.0008360347,0.0004749842,0.00095711095,0.0005529002,0.00039973002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011490105,0.0007671144,0.0006262252,0.0007692406,0.001968419,0.001215521,0.0007109159,0.00049365155,0.0072910446],"category_scores_gemma":[0.0032311496,0.00051657745,0.0011164226,0.0006098502,0.0024601887,0.0045117647,0.0015608185,0.0017554021,0.0009476854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017758584,0.00004328051,0.00067023846,0.00011780928,0.000014126232,0.00022531746,0.0005228755,0.0051214057,0.0046024835,0.9627639,0.0020100682,0.023730906],"study_design_scores_gemma":[0.00003675742,0.00021232429,0.0008618526,0.00007023695,0.000028070392,0.0006802455,0.00031828388,0.01690061,0.0058085523,0.94886523,0.026162777,0.000055110842],"about_ca_topic_score_codex":0.0024466387,"about_ca_topic_score_gemma":0.003470529,"teacher_disagreement_score":0.0072910446,"about_ca_system_score_codex":0.0009611841,"about_ca_system_score_gemma":0.0008429262,"threshold_uncertainty_score":0.024390996},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7915608,0.0004440924,0.08616047,0.0022496465,0.0002566369,0.00019686193,0.0011453414,0.0007921364,0.117193975],"genre_scores_gemma":[0.98217815,0.00012850687,0.012143151,0.00025930203,0.00013714205,0.00012529416,0.00078127143,0.00008758045,0.0041596447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977992,0.0003365395,0.000176315,0.0006424611,0.0005321008,0.00051340234],"domain_scores_gemma":[0.9904709,0.0040652403,0.00093792746,0.0009332654,0.002027226,0.0015654181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015131898,0.00062063045,0.0008001751,0.0015310118,0.0022213273,0.002155494,0.0010800605,0.0018743272,0.014976326],"category_scores_gemma":[0.0118640335,0.0009095399,0.0009140043,0.00061645254,0.0038793082,0.0043568932,0.0025125663,0.0021227885,0.0023554785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003221963,0.000109174296,0.0034124912,0.00017989245,0.000017817236,0.00089957897,0.0006489616,0.0033278854,0.016246134,0.9644501,0.0023263956,0.008059284],"study_design_scores_gemma":[0.00012975093,0.00029037852,0.0028637885,0.000072159164,0.00002912776,0.0012805603,0.0009223736,0.018068632,0.02797273,0.9392251,0.009055035,0.00009045281],"about_ca_topic_score_codex":0.00064718636,"about_ca_topic_score_gemma":0.0011649055,"teacher_disagreement_score":0.014976326,"about_ca_system_score_codex":0.0009819298,"about_ca_system_score_gemma":0.0010033419,"threshold_uncertainty_score":0.050100803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8800553,0.0014858383,0.037445877,0.0017079792,0.0004001004,0.000050576367,0.00097369804,0.00056203787,0.07731848],"genre_scores_gemma":[0.94451,0.00049541995,0.03007493,0.0004629964,0.00007880626,0.00011912948,0.0009581378,0.00012687605,0.023173677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971694,0.000030671854,0.00002247781,0.000087739296,0.000055066677,0.00008706671],"domain_scores_gemma":[0.9984452,0.00067138893,0.00035672146,0.00014356645,0.00019023819,0.00019298408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303916,0.00050828874,0.00042511232,0.00041535837,0.0015687668,0.0012132971,0.00046363304,0.0009999493,0.013368248],"category_scores_gemma":[0.0016217328,0.00037673482,0.00061947136,0.0005123695,0.0013566182,0.0022519992,0.0015583868,0.0006881564,0.0027311968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037478623,0.00031834564,0.022798782,0.0012817199,0.00012349129,0.0054944204,0.006135843,0.0030393316,0.19644995,0.5641672,0.0171779,0.1792652],"study_design_scores_gemma":[0.00019102667,0.0004031962,0.021662584,0.00029454584,0.00016797592,0.0053515118,0.005146491,0.006263485,0.116508536,0.7081625,0.13559279,0.00025541897],"about_ca_topic_score_codex":0.000752075,"about_ca_topic_score_gemma":0.001725741,"teacher_disagreement_score":0.013368248,"about_ca_system_score_codex":0.00051688554,"about_ca_system_score_gemma":0.0006109387,"threshold_uncertainty_score":0.044721246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17986728,0.011180184,0.6852019,0.0124706775,0.0024077608,0.00038279605,0.0021829072,0.0035805102,0.10272603],"genre_scores_gemma":[0.6225095,0.013896395,0.32558322,0.0018534341,0.0010925978,0.00039399145,0.0039969115,0.0019995032,0.028674502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971846,0.00056290673,0.0001398101,0.00059092464,0.001016775,0.0005050849],"domain_scores_gemma":[0.99225664,0.003469833,0.0005719017,0.0021923431,0.0009708417,0.0005383714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024410065,0.00112681,0.00142892,0.003374739,0.0048376922,0.0041484316,0.001868142,0.0025190988,0.008877948],"category_scores_gemma":[0.013574224,0.0013249038,0.0018345454,0.0033191373,0.0070005134,0.012749767,0.0057423627,0.0066480683,0.0020566452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001779213,0.00009774187,0.00391735,0.0008121963,0.000078639576,0.0022858833,0.0017387049,0.019300483,0.0044816285,0.84808666,0.024612315,0.094410524],"study_design_scores_gemma":[0.000023544671,0.0000770482,0.0015013937,0.00026533467,0.000050147744,0.002516446,0.0010783814,0.02037848,0.004596252,0.8851499,0.084221564,0.00014154233],"about_ca_topic_score_codex":0.002311895,"about_ca_topic_score_gemma":0.0021831132,"teacher_disagreement_score":0.008877948,"about_ca_system_score_codex":0.002001559,"about_ca_system_score_gemma":0.0016443963,"threshold_uncertainty_score":0.029699743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91424894,0.00018917839,0.063696645,0.00012742523,0.000034832665,0.00003448462,0.0001666077,0.00019487295,0.0213069],"genre_scores_gemma":[0.9782075,0.00017372765,0.011762317,0.000042538442,0.000030225754,0.000080447186,0.00029514974,0.000105959436,0.009302062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996538,0.000049249436,0.000018515095,0.00009328252,0.00007177809,0.00011341763],"domain_scores_gemma":[0.99933964,0.00020253508,0.00014269161,0.00010728772,0.00006188929,0.0001458533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037554116,0.00048278255,0.00046120782,0.0015803077,0.0018689834,0.0014245734,0.00067558396,0.0007292048,0.006440244],"category_scores_gemma":[0.0017582336,0.0004368542,0.000961643,0.00073161704,0.00251979,0.0017932557,0.002142823,0.0010839,0.0006158424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023630825,0.000040488074,0.002455061,0.000066948836,0.000023153785,0.00070737494,0.0013823713,0.010127848,0.011437949,0.95789105,0.00078548276,0.014845991],"study_design_scores_gemma":[0.000082059836,0.00018214853,0.003287061,0.00010398256,0.00004165624,0.0005397861,0.0011714931,0.045102797,0.015320904,0.9236908,0.010401866,0.000075496486],"about_ca_topic_score_codex":0.0018390557,"about_ca_topic_score_gemma":0.002187225,"teacher_disagreement_score":0.006440244,"about_ca_system_score_codex":0.001124825,"about_ca_system_score_gemma":0.00033755423,"threshold_uncertainty_score":0.021544814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48947752,0.0038854221,0.41529748,0.005371522,0.00042425893,0.00014011713,0.0022772825,0.0014145295,0.08171177],"genre_scores_gemma":[0.936023,0.0014221264,0.050055224,0.0014016776,0.00048159796,0.00023888143,0.0015099088,0.0006517704,0.008215776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798155,0.000471487,0.000063162326,0.000705507,0.0005013551,0.00027688438],"domain_scores_gemma":[0.97508776,0.016773047,0.0019690727,0.0029409665,0.00170591,0.0015231356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021723236,0.00078930013,0.0010735318,0.0030547145,0.002595312,0.0034314755,0.0028333783,0.0020929507,0.012643066],"category_scores_gemma":[0.039638456,0.00077628146,0.00086378434,0.0022290926,0.003712348,0.010235072,0.003052025,0.0030443785,0.0011164029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017037579,0.00009849541,0.010593018,0.00027695313,0.00008005651,0.00025587803,0.0007396028,0.023796078,0.0047908924,0.925602,0.01129464,0.022301868],"study_design_scores_gemma":[0.000025609783,0.00002804638,0.0015220005,0.00006611376,0.000035118646,0.0005741686,0.00031852687,0.07886216,0.0014337798,0.91066015,0.0064488933,0.000025493211],"about_ca_topic_score_codex":0.0013661523,"about_ca_topic_score_gemma":0.0018212118,"teacher_disagreement_score":0.012643066,"about_ca_system_score_codex":0.0027281502,"about_ca_system_score_gemma":0.0008354484,"threshold_uncertainty_score":0.042295277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70504344,0.0011491288,0.06710699,0.0006675792,0.00015972684,0.00013444167,0.0012882192,0.00035512642,0.22409546],"genre_scores_gemma":[0.9315819,0.0009789133,0.02571485,0.0003099293,0.00009178266,0.00009433795,0.0015757817,0.0001472676,0.039505325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965537,0.000054913515,0.000008561973,0.000068838366,0.000097035634,0.000115312694],"domain_scores_gemma":[0.99963164,0.00012093846,0.000066699824,0.00006576758,0.000056091838,0.000058749498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015240838,0.000493001,0.0004456942,0.0012768813,0.0016429918,0.0010911875,0.0008924484,0.0007672438,0.014374604],"category_scores_gemma":[0.0009823861,0.0006395814,0.0005853717,0.0012462189,0.0014874048,0.0017288177,0.001697728,0.0013698811,0.0017023109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002770083,0.00005329938,0.0013822825,0.0002525089,0.000031340798,0.0005011497,0.0005670947,0.03093396,0.0064049843,0.9282123,0.007467899,0.02391623],"study_design_scores_gemma":[0.00012139121,0.00010022672,0.004892404,0.00014456728,0.000054467488,0.0005604167,0.0005766332,0.06947288,0.0038624562,0.8740365,0.04611343,0.00006462403],"about_ca_topic_score_codex":0.01475907,"about_ca_topic_score_gemma":0.017696898,"teacher_disagreement_score":0.01475907,"about_ca_system_score_codex":0.0013295846,"about_ca_system_score_gemma":0.0004625068,"threshold_uncertainty_score":0.048087895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43006483,0.0009672651,0.3486564,0.0015606871,0.0003869806,0.00014174978,0.00063903,0.0008208658,0.21676224],"genre_scores_gemma":[0.9021242,0.000349062,0.057920326,0.00027339696,0.000045546745,0.00018461443,0.00024719082,0.00022897634,0.03862653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972385,0.00006153353,0.0000115297,0.000046682155,0.00007184551,0.00008444674],"domain_scores_gemma":[0.9997906,0.000050923554,0.00003160646,0.00003827998,0.000038471793,0.000050145347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002021865,0.00046863355,0.0004932626,0.000645853,0.0018141606,0.002093931,0.0009611762,0.0010031358,0.009506721],"category_scores_gemma":[0.0008845815,0.00026091828,0.00043592305,0.000653486,0.0018518171,0.002121938,0.001365764,0.0013987728,0.0012750493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027661326,0.000009057261,0.000062915984,0.000015756019,0.0000023376701,0.00006089599,0.00008468605,0.0035158193,0.0009694499,0.99252135,0.00045747435,0.0022724725],"study_design_scores_gemma":[0.00003483263,0.000031766263,0.00012435109,0.000022141812,0.0000057493494,0.00011131315,0.00017126623,0.060327455,0.0018574329,0.922048,0.015235214,0.000030495408],"about_ca_topic_score_codex":0.0057253395,"about_ca_topic_score_gemma":0.0043130023,"teacher_disagreement_score":0.009506721,"about_ca_system_score_codex":0.0016618605,"about_ca_system_score_gemma":0.0008966317,"threshold_uncertainty_score":0.03180319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6405224,0.00306558,0.1474937,0.011946818,0.00096962514,0.00014516503,0.0012192529,0.0028604926,0.19177696],"genre_scores_gemma":[0.9730059,0.00046777778,0.014393031,0.0014932943,0.0006320992,0.0001355652,0.00044354526,0.0003007324,0.00912799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997177,0.0005575933,0.00024815835,0.0007142089,0.0007209334,0.00058197853],"domain_scores_gemma":[0.9855437,0.00979961,0.00095883996,0.0021450683,0.00077656563,0.00077624567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021634263,0.0006727201,0.0012531738,0.001381916,0.0020781553,0.0038589546,0.0014930633,0.002151372,0.0110072205],"category_scores_gemma":[0.01661127,0.0006054787,0.0013465201,0.0013048546,0.004506375,0.0057276553,0.0035273232,0.004021592,0.002444376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004505839,0.0000775312,0.0017018812,0.0001986268,0.000028870925,0.0006164616,0.0010969491,0.004934252,0.0039685224,0.96089065,0.007538898,0.01849668],"study_design_scores_gemma":[0.000065837165,0.000059094116,0.00066085556,0.000043744643,0.00002237501,0.0003150852,0.0001725884,0.017875664,0.0019567492,0.9744461,0.0043320935,0.00004987902],"about_ca_topic_score_codex":0.000960094,"about_ca_topic_score_gemma":0.00056451274,"teacher_disagreement_score":0.0110072205,"about_ca_system_score_codex":0.001368237,"about_ca_system_score_gemma":0.0008044143,"threshold_uncertainty_score":0.036822796},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9404345,0.0003076419,0.038128886,0.00012877649,0.00003548003,0.00003677094,0.00029279402,0.00009766881,0.020537507],"genre_scores_gemma":[0.9893701,0.00013341109,0.00735238,0.00004984538,0.000030142066,0.000036515372,0.0003068957,0.000028182172,0.002692534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989266,0.00016669735,0.00010223685,0.00021817227,0.00035707827,0.00022915643],"domain_scores_gemma":[0.9969336,0.0010298706,0.0006471267,0.00083117763,0.0002447658,0.00031343094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036361918,0.00034562667,0.0005540929,0.001068028,0.0009522453,0.0011789701,0.00064702355,0.00062600384,0.0020084279],"category_scores_gemma":[0.0029099528,0.0003483463,0.00061431824,0.0008363875,0.0020627377,0.00092780474,0.0012315384,0.000716315,0.00037789973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008184512,0.00009180999,0.009181915,0.00022653735,0.00006366865,0.0012816009,0.0015208628,0.03195594,0.033321507,0.87156725,0.001931148,0.048039302],"study_design_scores_gemma":[0.000089197674,0.00043190125,0.012716015,0.000091990856,0.00008519211,0.003680994,0.00061596953,0.085903026,0.029229203,0.85363567,0.013378708,0.00014214055],"about_ca_topic_score_codex":0.0013038273,"about_ca_topic_score_gemma":0.0015006013,"teacher_disagreement_score":0.0020084279,"about_ca_system_score_codex":0.000525891,"about_ca_system_score_gemma":0.0005090078,"threshold_uncertainty_score":0.006718874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3048709,0.0009379313,0.6458742,0.0006247749,0.00022528584,0.00010478924,0.00065426226,0.0011677225,0.045540124],"genre_scores_gemma":[0.85131526,0.0005368048,0.13623019,0.00043398916,0.00021482464,0.0002687191,0.0008070631,0.00024024596,0.0099529065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891245,0.00025771733,0.00006863793,0.00023895931,0.00028632625,0.00023598623],"domain_scores_gemma":[0.9967269,0.001623161,0.00046878625,0.00058288284,0.00031996093,0.00027840235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046767766,0.0005671886,0.0004935328,0.0008689103,0.000854068,0.0018933277,0.0007378099,0.00069386134,0.006219644],"category_scores_gemma":[0.0049277195,0.00041641606,0.00051013636,0.0018623583,0.00078155595,0.002622945,0.0017287066,0.0012141903,0.0008785541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017418872,0.0000759086,0.0017578619,0.000109225235,0.000021378808,0.00019389098,0.00030682646,0.030452093,0.012175825,0.8967812,0.004439217,0.053512357],"study_design_scores_gemma":[0.000055225577,0.0002115725,0.0014169081,0.000048171358,0.000041757157,0.000619247,0.00020127314,0.20050184,0.014292834,0.7492558,0.033302076,0.000053252534],"about_ca_topic_score_codex":0.00041925206,"about_ca_topic_score_gemma":0.00040812674,"teacher_disagreement_score":0.006219644,"about_ca_system_score_codex":0.00083625014,"about_ca_system_score_gemma":0.00029099084,"threshold_uncertainty_score":0.020806849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8149394,0.00044261065,0.10460383,0.0004603992,0.00017439204,0.000092655406,0.00043418803,0.00041494492,0.07843759],"genre_scores_gemma":[0.9655168,0.0002180341,0.022902716,0.0001597804,0.00006574945,0.00013619057,0.0009886164,0.00014108104,0.009870986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995448,0.000105003026,0.000021778835,0.00008437487,0.0001119629,0.00013194203],"domain_scores_gemma":[0.9995202,0.00015360395,0.0000859444,0.00007793361,0.00004879808,0.00011351576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022478214,0.00041970852,0.0004850985,0.0007313068,0.0012028591,0.0013291985,0.0006605451,0.00082324096,0.009990765],"category_scores_gemma":[0.00096460275,0.0005104615,0.0005597304,0.00050052453,0.0012240851,0.0016849674,0.0018282084,0.0013080275,0.0009947182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018862868,0.00009438258,0.00086343003,0.00012573434,0.00002289122,0.0005914752,0.00040713223,0.018932149,0.010938875,0.9494811,0.0038243344,0.014529823],"study_design_scores_gemma":[0.00007142209,0.00012128642,0.0009262538,0.0000454443,0.000023511326,0.0003394664,0.0003597174,0.081924535,0.006112748,0.9006997,0.009337535,0.000038275968],"about_ca_topic_score_codex":0.00097353116,"about_ca_topic_score_gemma":0.001453633,"teacher_disagreement_score":0.009990765,"about_ca_system_score_codex":0.00059754605,"about_ca_system_score_gemma":0.0004245864,"threshold_uncertainty_score":0.03342241},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14789,0.0010496454,0.62188697,0.0014406,0.00060591724,0.00019537778,0.0014532426,0.00095258997,0.2245256],"genre_scores_gemma":[0.7798902,0.00085073756,0.1625268,0.0010300829,0.00031843205,0.00043295443,0.0011624878,0.0002995543,0.05348882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991979,0.0001410415,0.00008174774,0.0001399152,0.00032639992,0.00011301939],"domain_scores_gemma":[0.9990343,0.000255213,0.000085965716,0.00016165971,0.00036246318,0.000100402554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008884498,0.00034928322,0.00042187906,0.0009366121,0.0016190067,0.0018979115,0.0007882723,0.000874779,0.008906201],"category_scores_gemma":[0.0016301947,0.0003653052,0.00071460597,0.0009624872,0.0024987438,0.004297937,0.0019390391,0.0019937465,0.0018386398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005266048,0.0000044961353,0.0000870437,0.00001402858,0.0000014870621,0.00004748628,0.000097721204,0.0002823173,0.0010010402,0.99432546,0.0009002525,0.003233295],"study_design_scores_gemma":[0.000014227347,0.000024887062,0.00021729116,0.000020840314,0.000008310062,0.00025894336,0.00020412265,0.004873211,0.004551583,0.95737743,0.032424998,0.000024182775],"about_ca_topic_score_codex":0.0014151536,"about_ca_topic_score_gemma":0.002026311,"teacher_disagreement_score":0.008906201,"about_ca_system_score_codex":0.0011871262,"about_ca_system_score_gemma":0.0011545611,"threshold_uncertainty_score":0.029794276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.885281,0.00047237787,0.09048345,0.00073124253,0.00007033991,0.000033713397,0.00027330167,0.00017755845,0.022476878],"genre_scores_gemma":[0.97616553,0.00012485166,0.016807633,0.0001007423,0.000027113389,0.00004939206,0.00022885794,0.000052783656,0.006443008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980754,0.00005049469,0.000009166487,0.000030398473,0.000044284978,0.00005809138],"domain_scores_gemma":[0.99953246,0.00018574011,0.00008070679,0.000045506287,0.000042344014,0.000113342016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500054,0.0004532568,0.0008027763,0.000825916,0.0006031067,0.0012410259,0.0008193377,0.0017951842,0.0035466128],"category_scores_gemma":[0.0016152936,0.00038766843,0.0005639021,0.0005509896,0.0010621683,0.001044382,0.0009831964,0.00083385064,0.00022520474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025732414,0.00016218555,0.0033692012,0.00011870308,0.00006304868,0.0010496917,0.0002439892,0.4517791,0.0051389374,0.5281941,0.002163722,0.0074599907],"study_design_scores_gemma":[0.000031441734,0.000018331915,0.00036936396,0.0000081948565,0.000004397994,0.000056651228,0.000075517215,0.9278313,0.00041196117,0.07076148,0.00042139125,0.0000099436575],"about_ca_topic_score_codex":0.004017724,"about_ca_topic_score_gemma":0.0031539793,"teacher_disagreement_score":0.004017724,"about_ca_system_score_codex":0.00094720913,"about_ca_system_score_gemma":0.0006116771,"threshold_uncertainty_score":0.011864662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9322478,0.00026965578,0.03444135,0.0006367525,0.000035729736,0.00004234134,0.00035163018,0.00016179863,0.031812876],"genre_scores_gemma":[0.99128026,0.00017869315,0.0044040973,0.00011010972,0.000034493365,0.00004427642,0.00033375333,0.000027934911,0.0035863905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958783,0.000063331245,0.000016729464,0.00012449706,0.00010894821,0.00009871998],"domain_scores_gemma":[0.9982653,0.00081335934,0.00030618397,0.0001507932,0.00019460807,0.00026979722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097866,0.00051677594,0.00037361216,0.0020374449,0.001051443,0.0021894637,0.00073241646,0.0008219946,0.0047435584],"category_scores_gemma":[0.0019870128,0.00032053748,0.00051945954,0.0011415776,0.0022138667,0.002501348,0.0010978936,0.00088616787,0.0003612391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021630873,0.00008602895,0.011118045,0.000108819666,0.0000337016,0.00037712554,0.00053693773,0.0042967205,0.013373444,0.93305403,0.0027075042,0.034091387],"study_design_scores_gemma":[0.000059592705,0.00008339839,0.011145627,0.00004052518,0.000042747804,0.0016002216,0.000689588,0.022009334,0.010033662,0.94547033,0.008777456,0.000047481415],"about_ca_topic_score_codex":0.000729859,"about_ca_topic_score_gemma":0.0006569433,"teacher_disagreement_score":0.0047435584,"about_ca_system_score_codex":0.0010350577,"about_ca_system_score_gemma":0.00039283806,"threshold_uncertainty_score":0.015868723},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25418985,0.0005368158,0.38122186,0.0008150873,0.00059358956,0.0001411182,0.00049469236,0.00069192523,0.36131525],"genre_scores_gemma":[0.852517,0.0005826484,0.07657305,0.00081622705,0.0003761158,0.00015090189,0.00043934854,0.00041722803,0.06812737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905974,0.000105268824,0.000057691028,0.00020983377,0.00042622126,0.00014125108],"domain_scores_gemma":[0.9994981,0.00007630585,0.000057619767,0.00013031236,0.00016260534,0.000074874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000591672,0.00034392125,0.0004755555,0.0008889375,0.0010113954,0.0016214557,0.0006260948,0.00043172538,0.0060426653],"category_scores_gemma":[0.0011347964,0.00034227502,0.000456919,0.0005792246,0.0020943934,0.002010941,0.0012114756,0.0015578661,0.0020140593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018497474,0.000013378464,0.00023767778,0.00002500542,0.0000040174104,0.00020607567,0.000120884106,0.0004009197,0.0038789364,0.9813716,0.0019630105,0.011760037],"study_design_scores_gemma":[0.000017050488,0.00006444207,0.0005921927,0.000017248907,0.000012962795,0.0014117219,0.00014093831,0.007960111,0.015097225,0.9410166,0.033630785,0.000038776747],"about_ca_topic_score_codex":0.00025928233,"about_ca_topic_score_gemma":0.00042830824,"teacher_disagreement_score":0.0060426653,"about_ca_system_score_codex":0.0003175863,"about_ca_system_score_gemma":0.0004459269,"threshold_uncertainty_score":0.020214736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116548285,0.006407,0.5617669,0.037570544,0.006704094,0.00013878228,0.00068466255,0.0029114771,0.26726812],"genre_scores_gemma":[0.794228,0.005261374,0.11406443,0.008094406,0.0037411305,0.00021017053,0.0006117817,0.0011668428,0.072621785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869686,0.00036286275,0.000068199304,0.00023630437,0.00047001056,0.00016576423],"domain_scores_gemma":[0.99763787,0.0011934849,0.00018254171,0.00040954916,0.00035140695,0.00022517667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024127972,0.0009963433,0.00081075344,0.001488987,0.0017790197,0.0025981378,0.0019572964,0.0017633865,0.024592077],"category_scores_gemma":[0.0058949683,0.00031761598,0.0007041754,0.0012330308,0.0046553374,0.0068126693,0.002398064,0.0038187164,0.003109428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003951098,0.00003495715,0.0004797305,0.00011839031,0.000006865075,0.00032575367,0.00031854797,0.0021736925,0.0010018247,0.98175997,0.006818667,0.0069221035],"study_design_scores_gemma":[0.00001235351,0.000031542182,0.00035202884,0.00004392801,0.000004915883,0.00016041615,0.00024307022,0.00442307,0.0012156571,0.9742511,0.019238306,0.000023578536],"about_ca_topic_score_codex":0.000609424,"about_ca_topic_score_gemma":0.00056697836,"teacher_disagreement_score":0.024592077,"about_ca_system_score_codex":0.0008101633,"about_ca_system_score_gemma":0.00044773816,"threshold_uncertainty_score":0.082268655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88674664,0.0003433384,0.07307738,0.0005659511,0.00010035819,0.00007362577,0.00051138736,0.00017849776,0.03840283],"genre_scores_gemma":[0.9549319,0.0002557856,0.03227113,0.00016897464,0.00004635892,0.00006975232,0.00058525975,0.00007212982,0.011598727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996475,0.00008683082,0.000017624776,0.000096271564,0.00007559087,0.00007617654],"domain_scores_gemma":[0.99907875,0.0004102154,0.00016655207,0.00011283296,0.00007633284,0.00015534357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023741266,0.00032179008,0.0004542003,0.00055248,0.0008405573,0.0010371237,0.00096821715,0.0008171943,0.007238131],"category_scores_gemma":[0.001209167,0.00038677143,0.00032700767,0.0008425962,0.0011271514,0.0013456156,0.0009383556,0.0006344035,0.00091316516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006243718,0.00016318263,0.0034896878,0.00042500973,0.00005711127,0.0027012262,0.0018397708,0.015973762,0.050625842,0.8894428,0.007064134,0.02759308],"study_design_scores_gemma":[0.00014576879,0.00013155794,0.0035232878,0.000053552158,0.00004571342,0.0017472598,0.00064704777,0.057167064,0.009804553,0.9095242,0.017179428,0.000030634394],"about_ca_topic_score_codex":0.0014391526,"about_ca_topic_score_gemma":0.00218396,"teacher_disagreement_score":0.007238131,"about_ca_system_score_codex":0.0005168851,"about_ca_system_score_gemma":0.00022064969,"threshold_uncertainty_score":0.02421391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6439184,0.0012059216,0.27807212,0.0010009004,0.0001765096,0.00012726233,0.00050351187,0.0005822284,0.074413165],"genre_scores_gemma":[0.92019,0.00080168695,0.049751196,0.00032958825,0.00013938805,0.00024958333,0.00052148063,0.00025651205,0.027760556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988759,0.0003332966,0.00006826047,0.00026478036,0.00026715497,0.0001905051],"domain_scores_gemma":[0.99828583,0.00067018246,0.0003154949,0.00030253758,0.00020148624,0.0002244494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006951785,0.00061032205,0.00062088604,0.0012705402,0.0016902061,0.0023155634,0.0015701768,0.0011996386,0.008628624],"category_scores_gemma":[0.003379695,0.0005134869,0.0010212347,0.0019652469,0.0016118146,0.0055701598,0.0015002042,0.0013793028,0.001122831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066769906,0.000044985478,0.00076965813,0.00007310155,0.00001776466,0.00014328733,0.00040573475,0.009284005,0.001844765,0.9745384,0.0012389291,0.011572713],"study_design_scores_gemma":[0.000031210377,0.000059994913,0.00041627174,0.000030799438,0.00001634871,0.00039938538,0.00027663007,0.039592844,0.0012522946,0.9490842,0.008799984,0.000040113227],"about_ca_topic_score_codex":0.0012793539,"about_ca_topic_score_gemma":0.0014819489,"teacher_disagreement_score":0.008628624,"about_ca_system_score_codex":0.0011486264,"about_ca_system_score_gemma":0.00046454172,"threshold_uncertainty_score":0.028865635},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8628836,0.00040748165,0.10024046,0.00033968303,0.000055701585,0.00005376889,0.0006995725,0.0002813537,0.035038292],"genre_scores_gemma":[0.9850647,0.00028221725,0.009633754,0.00004891775,0.00004727347,0.000032168417,0.00029082055,0.00009594872,0.004504063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963045,0.000039399492,0.0000086972,0.0001048509,0.0000959172,0.00012066631],"domain_scores_gemma":[0.998596,0.0006755436,0.00025514193,0.0001562325,0.00017656523,0.00014059969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027859112,0.0003681468,0.00023658766,0.0015316505,0.0005865157,0.0017896693,0.00050903665,0.00033031328,0.003950736],"category_scores_gemma":[0.0027287574,0.0001937526,0.0003292305,0.001311385,0.00163152,0.0014541266,0.0006607755,0.00076980155,0.00044291036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019114457,0.00005950854,0.0042207236,0.000093984796,0.000017176339,0.00008714549,0.00046552235,0.025892807,0.016885532,0.9178192,0.0022805464,0.03198677],"study_design_scores_gemma":[0.000036147998,0.00005966867,0.005785666,0.00003460825,0.000028278831,0.00020984611,0.00026978535,0.08344283,0.010052049,0.8910716,0.008958797,0.00005063478],"about_ca_topic_score_codex":0.0031354812,"about_ca_topic_score_gemma":0.0028333298,"teacher_disagreement_score":0.003950736,"about_ca_system_score_codex":0.0018182694,"about_ca_system_score_gemma":0.0005594954,"threshold_uncertainty_score":0.013216555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81273925,0.0010266928,0.1302121,0.0013617952,0.000053198353,0.00007860917,0.0010783686,0.00044304386,0.05300695],"genre_scores_gemma":[0.9602915,0.00052861223,0.027984971,0.0003040412,0.00007261307,0.000108392276,0.00084563723,0.000083091945,0.009781236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991761,0.00019433493,0.00004875077,0.00027341762,0.00015204304,0.00015548515],"domain_scores_gemma":[0.9960141,0.0020301726,0.0004819324,0.00043464164,0.00042153476,0.00061765895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072498084,0.00044430816,0.0005466705,0.0010706282,0.0011964805,0.001548809,0.0006783753,0.0007130332,0.0068332944],"category_scores_gemma":[0.00482927,0.00055391365,0.00051478186,0.0011465155,0.0019922128,0.0041258684,0.0019400691,0.001128932,0.00090979424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030879874,0.0000726229,0.004332884,0.00024264469,0.000038160317,0.00029817555,0.0011487532,0.009186105,0.012734422,0.9489299,0.0033225748,0.019384934],"study_design_scores_gemma":[0.00005007032,0.000077474295,0.002545984,0.000051895855,0.000028207969,0.0006213962,0.0007187968,0.03600208,0.006737371,0.9433133,0.009820156,0.00003327349],"about_ca_topic_score_codex":0.0010812255,"about_ca_topic_score_gemma":0.0012104511,"teacher_disagreement_score":0.0068332944,"about_ca_system_score_codex":0.0011719386,"about_ca_system_score_gemma":0.00046168463,"threshold_uncertainty_score":0.022859633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8207346,0.00047603657,0.12484624,0.0004896253,0.00006693116,0.000040840478,0.0002159771,0.00014029889,0.052989375],"genre_scores_gemma":[0.98747593,0.00022109287,0.00693677,0.00009258385,0.00004083271,0.00003095441,0.00012154826,0.00003735036,0.0050430233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994572,0.000116141884,0.000016425533,0.00009964438,0.00015640602,0.00015412131],"domain_scores_gemma":[0.99739313,0.0013480518,0.00036963404,0.00020128263,0.00036699843,0.00032080567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006836444,0.0005546435,0.00039487687,0.0016389537,0.000678765,0.0015655435,0.00073405536,0.0004999724,0.004178617],"category_scores_gemma":[0.0039591757,0.00023030375,0.0005012345,0.0010877941,0.0018787633,0.0023525523,0.0009944955,0.0009887975,0.00040872185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014575274,0.00004443389,0.0029861007,0.00010565974,0.000021916112,0.00020689481,0.00021110929,0.008902956,0.011875453,0.95114875,0.0019788742,0.022371992],"study_design_scores_gemma":[0.00002537762,0.00008420315,0.0033568912,0.00003682642,0.00003285001,0.00061895285,0.00023657284,0.07878333,0.012177959,0.90036213,0.004247367,0.000037449754],"about_ca_topic_score_codex":0.00094451016,"about_ca_topic_score_gemma":0.0010719544,"teacher_disagreement_score":0.004178617,"about_ca_system_score_codex":0.0010340913,"about_ca_system_score_gemma":0.000492799,"threshold_uncertainty_score":0.013978839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14635585,0.0007152518,0.6865996,0.0018143384,0.000566758,0.0007311375,0.004364288,0.007130693,0.15172203],"genre_scores_gemma":[0.4700256,0.00090123195,0.43672058,0.0011105564,0.0003079234,0.001418016,0.012800462,0.0025961287,0.07411941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967865,0.0012183316,0.00019890955,0.00069616333,0.0005692692,0.0005307731],"domain_scores_gemma":[0.99448496,0.00213726,0.00050251867,0.0016212671,0.00081716717,0.0004367699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018382557,0.0010426029,0.0010936434,0.0020487683,0.0029956887,0.0024575803,0.0021240655,0.0018000613,0.033797067],"category_scores_gemma":[0.013164137,0.0012634619,0.0014647662,0.004429812,0.0016512335,0.0066979127,0.0070447843,0.0019730944,0.0097202705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005025376,0.0003018907,0.0029539124,0.00055359746,0.00011883826,0.0012491702,0.0018469534,0.021873761,0.009300652,0.7928229,0.027731754,0.1407441],"study_design_scores_gemma":[0.000054633958,0.000120244986,0.0011284596,0.00014308275,0.00011619918,0.00050495175,0.00054209726,0.07504077,0.006046298,0.84239185,0.073849246,0.00006223289],"about_ca_topic_score_codex":0.0021614898,"about_ca_topic_score_gemma":0.0033552055,"teacher_disagreement_score":0.033797067,"about_ca_system_score_codex":0.0016219537,"about_ca_system_score_gemma":0.001182763,"threshold_uncertainty_score":0.11306244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7504642,0.0028546024,0.17967354,0.0029010011,0.00018964527,0.000050942836,0.0007060194,0.00044211702,0.06271795],"genre_scores_gemma":[0.9511446,0.0020326106,0.02993216,0.00039251568,0.00031139748,0.00012975433,0.00058507314,0.0002986059,0.015173495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994128,0.000112364076,0.000021625976,0.00011692699,0.00019309207,0.00014316251],"domain_scores_gemma":[0.99673444,0.0020697857,0.00029421164,0.00032432427,0.00025267387,0.0003244898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085833896,0.0006974107,0.00056520966,0.002059453,0.0010444551,0.0021419423,0.0013271783,0.0007299592,0.005765361],"category_scores_gemma":[0.005996989,0.00046234918,0.00045376606,0.00195231,0.0021106426,0.0063249464,0.001964508,0.0016056509,0.00091720646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018146822,0.00007530919,0.0030152474,0.00015258061,0.00004668087,0.0001291888,0.00043414798,0.011187559,0.0049529155,0.9413282,0.0046489458,0.03384776],"study_design_scores_gemma":[0.000022926239,0.000039317685,0.0015962565,0.0000369759,0.000041106734,0.00019752055,0.00017408501,0.035897747,0.0023604531,0.95347804,0.0061277836,0.000027821583],"about_ca_topic_score_codex":0.0014617103,"about_ca_topic_score_gemma":0.0013887818,"teacher_disagreement_score":0.005765361,"about_ca_system_score_codex":0.0013956391,"about_ca_system_score_gemma":0.00043133064,"threshold_uncertainty_score":0.01928699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8610023,0.0012471166,0.10039117,0.0006746798,0.00006506565,0.000052202202,0.0012093269,0.00028478436,0.03507336],"genre_scores_gemma":[0.9628906,0.00039116293,0.030120129,0.00010231379,0.00007301521,0.00014356797,0.0008879166,0.00012697482,0.005264245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895334,0.00027285505,0.000062685,0.00019954583,0.0003241532,0.0001874853],"domain_scores_gemma":[0.9971162,0.0018056575,0.0002958829,0.00027485794,0.00018948935,0.00031792652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090297475,0.0007344458,0.0010469536,0.002870985,0.0021450142,0.002839111,0.0028736005,0.000692161,0.0054598935],"category_scores_gemma":[0.005291459,0.0007479456,0.00096820237,0.0019676697,0.003039099,0.0037692364,0.0022042748,0.0011181543,0.00065936765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023562524,0.00008369265,0.0025207484,0.0002778868,0.000049168193,0.00018237041,0.00048457968,0.018028865,0.0043593626,0.9577091,0.0027824736,0.0132861985],"study_design_scores_gemma":[0.000037566326,0.000042067873,0.0017799992,0.00006215273,0.000030584342,0.00046798328,0.00026439063,0.078960754,0.0074345125,0.9069979,0.0038546002,0.000067508496],"about_ca_topic_score_codex":0.0017397054,"about_ca_topic_score_gemma":0.0019061919,"teacher_disagreement_score":0.0054598935,"about_ca_system_score_codex":0.0016740487,"about_ca_system_score_gemma":0.0007206395,"threshold_uncertainty_score":0.018265188},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7167448,0.002046343,0.20668554,0.0015882404,0.00012245128,0.00013073838,0.00067693094,0.000450338,0.071554676],"genre_scores_gemma":[0.96701294,0.0009209871,0.023194678,0.0002927939,0.00022214,0.000108750915,0.00064460695,0.000068226924,0.007534871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990054,0.00018850717,0.000051621268,0.00021712836,0.00031420361,0.00022326145],"domain_scores_gemma":[0.9965485,0.0015402675,0.0005061175,0.0003658711,0.0003815405,0.00065773097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441425,0.00073302357,0.0005913366,0.0020528426,0.0018104177,0.0019045976,0.0008525435,0.00095919205,0.0049772398],"category_scores_gemma":[0.0056778225,0.00063558575,0.00067219103,0.0014236904,0.003066822,0.0031353976,0.0026733251,0.0017505669,0.0005941166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010217887,0.000065338114,0.0028763404,0.00014574784,0.000020289584,0.00039244693,0.00065628916,0.009263661,0.0046879086,0.9639255,0.00312211,0.014742122],"study_design_scores_gemma":[0.000029312487,0.000071999624,0.0022843431,0.00006238147,0.000022909546,0.00077884726,0.0003567811,0.042493258,0.0033267976,0.93869954,0.011838704,0.000035167704],"about_ca_topic_score_codex":0.003055977,"about_ca_topic_score_gemma":0.0025244146,"teacher_disagreement_score":0.0049772398,"about_ca_system_score_codex":0.0018762916,"about_ca_system_score_gemma":0.0005226085,"threshold_uncertainty_score":0.016650498},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6225829,0.0015618367,0.20990138,0.0007015612,0.00042256044,0.00006620215,0.0006653346,0.00020159279,0.1638966],"genre_scores_gemma":[0.96535295,0.00036754314,0.017698422,0.00018876264,0.00013879302,0.000043670498,0.0003745579,0.00006781115,0.015767537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908376,0.0001464914,0.00005992189,0.00016434601,0.00037140853,0.000174122],"domain_scores_gemma":[0.9992322,0.00031576416,0.00007616015,0.00007679358,0.00017281834,0.00012637573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005813168,0.00023138772,0.00038343942,0.00082255603,0.0009447307,0.0031816184,0.0002861911,0.00038745967,0.0040097525],"category_scores_gemma":[0.0014795652,0.00023108942,0.0004691019,0.0005708952,0.0018198029,0.0031105932,0.0010008338,0.0010422152,0.00051456335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001286055,0.000004143721,0.00014626888,0.000010288606,0.0000017931374,0.000043397114,0.00012127781,0.00022768363,0.0008122361,0.9957014,0.00018145339,0.002737143],"study_design_scores_gemma":[0.000011505665,0.000032425392,0.000663401,0.00002334353,0.000008435918,0.00026234565,0.00018072792,0.0043028235,0.0031519255,0.9781029,0.013238735,0.00002137937],"about_ca_topic_score_codex":0.0007154943,"about_ca_topic_score_gemma":0.0012431181,"teacher_disagreement_score":0.0040097525,"about_ca_system_score_codex":0.0010904558,"about_ca_system_score_gemma":0.0005389587,"threshold_uncertainty_score":0.013413966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6846365,0.00056055724,0.23664075,0.001215876,0.00013810529,0.00012413868,0.00043346224,0.00032803317,0.075922735],"genre_scores_gemma":[0.9646707,0.00015767867,0.02126191,0.00014426281,0.00013762925,0.000079246514,0.00021150912,0.000040507013,0.013296523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955076,0.00011529128,0.000021283444,0.00009819091,0.00009922166,0.000115130206],"domain_scores_gemma":[0.9993337,0.00016703016,0.00016691055,0.00010474932,0.00004745007,0.00018022017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846276,0.00051654124,0.00047295517,0.0014807279,0.0011017034,0.002727005,0.0013396261,0.0008068563,0.0075649237],"category_scores_gemma":[0.0011599173,0.00032903944,0.000634536,0.0009109119,0.002696161,0.0029981649,0.0015621032,0.0009916779,0.0010272831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026211574,0.000030261688,0.000372116,0.000018159117,0.000003438269,0.00011891126,0.00013587216,0.0022637923,0.0010626742,0.99289685,0.0005798595,0.0024918797],"study_design_scores_gemma":[0.00003035131,0.00004641411,0.0004276853,0.000017209617,0.000008268699,0.00029421947,0.00014569297,0.037014518,0.00092670595,0.95740443,0.0036662873,0.000018248835],"about_ca_topic_score_codex":0.00066866446,"about_ca_topic_score_gemma":0.0010584106,"teacher_disagreement_score":0.0075649237,"about_ca_system_score_codex":0.0011907915,"about_ca_system_score_gemma":0.00056507287,"threshold_uncertainty_score":0.025307238},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23566808,0.0029373139,0.5752477,0.0028152466,0.0006461009,0.000261281,0.0012679016,0.0009333473,0.18022308],"genre_scores_gemma":[0.78461814,0.004402093,0.15592405,0.0017711511,0.00068727595,0.0005176608,0.0028780485,0.0005603202,0.04864127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.00046873835,0.00008845338,0.00038616153,0.00044988754,0.0002709181],"domain_scores_gemma":[0.9901669,0.006592524,0.0006872726,0.0011267879,0.00074886327,0.0006776651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010724039,0.00088402664,0.0011223102,0.0023371775,0.0018543811,0.0023264042,0.0018056004,0.001487341,0.013842236],"category_scores_gemma":[0.012207758,0.0007678589,0.0011515789,0.0031827074,0.0021673765,0.006119262,0.0037517194,0.0026924668,0.0022454872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009589486,0.000043910568,0.00089958304,0.00019660124,0.000020169438,0.00032673773,0.0005379755,0.014167086,0.0015082762,0.9506037,0.0055842106,0.026015965],"study_design_scores_gemma":[0.00003519509,0.000027666469,0.0003166779,0.000057370773,0.000016889995,0.00021034667,0.000111723646,0.04631187,0.0006035063,0.9397675,0.012524407,0.000016771219],"about_ca_topic_score_codex":0.0048661977,"about_ca_topic_score_gemma":0.0065393364,"teacher_disagreement_score":0.013842236,"about_ca_system_score_codex":0.0019823536,"about_ca_system_score_gemma":0.00071754376,"threshold_uncertainty_score":0.04630685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7136372,0.0011494233,0.25180286,0.0016884282,0.00015315255,0.00014656084,0.00035298042,0.00086905545,0.030200494],"genre_scores_gemma":[0.96485937,0.00047683192,0.023657344,0.00035509153,0.0001133981,0.00010813353,0.00024471505,0.00023319341,0.009951952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791557,0.00092057604,0.00003883702,0.0003669832,0.00037935682,0.00037871304],"domain_scores_gemma":[0.98911345,0.0066830735,0.0013625904,0.0012129229,0.00076302205,0.0008649356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012558422,0.0005613169,0.00081778126,0.0011735383,0.0015057147,0.002449057,0.0025111695,0.0015729467,0.0072148037],"category_scores_gemma":[0.013610077,0.00060023053,0.00064819347,0.0010365923,0.0027944364,0.004322672,0.0018553019,0.0016397663,0.0009992875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008932731,0.00020271023,0.006459963,0.0003363252,0.000083314066,0.0005323338,0.00075002905,0.1032497,0.0191833,0.82453305,0.009319292,0.034456715],"study_design_scores_gemma":[0.0001077199,0.00015082097,0.002048235,0.00006507083,0.00004340538,0.0005220151,0.0002016982,0.6031773,0.009064461,0.3781547,0.006384911,0.00007962304],"about_ca_topic_score_codex":0.0018553319,"about_ca_topic_score_gemma":0.0019173666,"teacher_disagreement_score":0.0072148037,"about_ca_system_score_codex":0.0023942557,"about_ca_system_score_gemma":0.0005354862,"threshold_uncertainty_score":0.024135947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4739544,0.001102237,0.39581767,0.0010337321,0.00055571325,0.00009685889,0.00016689008,0.00022089436,0.12705165],"genre_scores_gemma":[0.9622904,0.0005747437,0.023805631,0.00023657634,0.000307025,0.00007084265,0.00012993923,0.00009389953,0.012490981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986268,0.00023769087,0.00010820036,0.0002909465,0.00046586015,0.00027050514],"domain_scores_gemma":[0.9979691,0.00089556037,0.00019315474,0.00025246336,0.00039508133,0.0002946171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569972,0.00045759324,0.00067734363,0.0017274965,0.0016594509,0.002411044,0.0006743405,0.00057913706,0.004380275],"category_scores_gemma":[0.004264031,0.00034630776,0.0007630003,0.00079319224,0.0029189985,0.0047146,0.0030154453,0.0023324203,0.00086501817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012297383,0.000012809604,0.00062894187,0.00002166445,0.0000029509386,0.00014157638,0.00035224704,0.00026482105,0.00088148174,0.9917561,0.0003592609,0.005565831],"study_design_scores_gemma":[0.000009394156,0.00003082691,0.0008252719,0.000027141059,0.000014325143,0.000622382,0.00034692732,0.0048520556,0.0037238828,0.98242617,0.007095337,0.000026363856],"about_ca_topic_score_codex":0.00041693365,"about_ca_topic_score_gemma":0.00048027365,"teacher_disagreement_score":0.004380275,"about_ca_system_score_codex":0.00085837126,"about_ca_system_score_gemma":0.00068253215,"threshold_uncertainty_score":0.014653504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33625582,0.005888796,0.5117495,0.008349735,0.0008391929,0.0001811752,0.0021982882,0.0018124735,0.13272505],"genre_scores_gemma":[0.9200945,0.0024260152,0.05596689,0.001433428,0.00081103545,0.00030576854,0.0010973649,0.0007114974,0.017153602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810934,0.0002661571,0.0000750007,0.0007286142,0.00035058334,0.00047034232],"domain_scores_gemma":[0.9867166,0.007635163,0.00077166373,0.0025228932,0.0008100033,0.0015437595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014526892,0.0016958968,0.0015660347,0.0015463739,0.0024226222,0.0026692105,0.003268156,0.0018101103,0.014758454],"category_scores_gemma":[0.012964314,0.00086111604,0.002126886,0.0014129821,0.0029943176,0.007814011,0.005410381,0.004511347,0.0027306902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008462428,0.00029930766,0.008445372,0.001084383,0.0002084936,0.00080396124,0.0013022247,0.054533213,0.07340546,0.77385885,0.025539143,0.05967338],"study_design_scores_gemma":[0.00010336353,0.00047291038,0.0051710685,0.00021605934,0.00025434073,0.0026367041,0.00045415177,0.2162734,0.026797527,0.6985995,0.04883372,0.00018719932],"about_ca_topic_score_codex":0.001687353,"about_ca_topic_score_gemma":0.002410957,"teacher_disagreement_score":0.014758454,"about_ca_system_score_codex":0.0022421468,"about_ca_system_score_gemma":0.000989255,"threshold_uncertainty_score":0.049372017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8785608,0.00022418148,0.041789994,0.0003901451,0.0002796086,0.000028367844,0.00007187418,0.00024026266,0.07841474],"genre_scores_gemma":[0.9848149,0.00013894844,0.00793405,0.00015204413,0.000039122147,0.00002241293,0.00006728469,0.00006761945,0.0067635733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973494,0.000060406106,0.000013309776,0.000041325042,0.00008199043,0.00006792003],"domain_scores_gemma":[0.99975604,0.00003428804,0.000025860407,0.00006304359,0.000037169375,0.00008358636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024701047,0.0002609255,0.00031820548,0.00046134126,0.0014358192,0.001315314,0.0005366146,0.00042876336,0.0041934475],"category_scores_gemma":[0.00046424975,0.00019494972,0.00026487297,0.000471619,0.0018857358,0.0011783656,0.0011991656,0.0009602911,0.000626421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008078119,0.000034565917,0.00044934393,0.000034036093,0.0000039675756,0.00037048486,0.00023170492,0.002196223,0.014960865,0.97102517,0.00091455283,0.009698228],"study_design_scores_gemma":[0.0000625906,0.00012589023,0.0006004273,0.000026612803,0.000009925112,0.0009337929,0.0006242941,0.02058089,0.028570732,0.9376593,0.010763826,0.000041782816],"about_ca_topic_score_codex":0.00034992982,"about_ca_topic_score_gemma":0.00050566235,"teacher_disagreement_score":0.0041934475,"about_ca_system_score_codex":0.00032885125,"about_ca_system_score_gemma":0.00033367332,"threshold_uncertainty_score":0.01402849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59087,0.0005638902,0.38512772,0.0006102255,0.000120347926,0.000085486165,0.00025216292,0.00057664764,0.021793557],"genre_scores_gemma":[0.8879874,0.0004794084,0.09975508,0.000111507354,0.0002179611,0.00017105842,0.0005301074,0.00023840583,0.010509073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978574,0.00040343212,0.00015919487,0.00053200073,0.00078677374,0.00026121366],"domain_scores_gemma":[0.9925844,0.0043601147,0.0009141307,0.00077644247,0.0009278565,0.0004369708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019831038,0.000561585,0.0008288998,0.00261264,0.0017073114,0.0024824727,0.0014453819,0.000969757,0.0055774814],"category_scores_gemma":[0.0129460385,0.0004720593,0.0005618725,0.0017177884,0.0025512753,0.00859774,0.002003707,0.0012929708,0.00084463396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025230032,0.0000809385,0.008763695,0.00023556144,0.00003823884,0.00039345116,0.0006252853,0.016745608,0.01784497,0.90188277,0.0012107625,0.0519264],"study_design_scores_gemma":[0.000014453174,0.000057115296,0.0013232297,0.000052337073,0.000031688807,0.0008080094,0.00022577886,0.09408967,0.029042784,0.86903024,0.0052908193,0.000033873046],"about_ca_topic_score_codex":0.0003676607,"about_ca_topic_score_gemma":0.00037899453,"teacher_disagreement_score":0.0055774814,"about_ca_system_score_codex":0.0013690979,"about_ca_system_score_gemma":0.00061427784,"threshold_uncertainty_score":0.018658519},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03545482,0.009732758,0.25947955,0.02393876,0.024288833,0.00024230224,0.005942713,0.0064271027,0.63449305],"genre_scores_gemma":[0.24644454,0.004027128,0.15233237,0.009920145,0.0046970453,0.0003332958,0.00468725,0.004138283,0.57342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875,0.00019193844,0.0000723157,0.00050008093,0.00027750907,0.00020825164],"domain_scores_gemma":[0.99800223,0.0004497434,0.00016046826,0.0006743677,0.00046515517,0.00024794767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069660135,0.001257798,0.0010025937,0.001229773,0.004231296,0.0039696447,0.0014967204,0.001246486,0.099476606],"category_scores_gemma":[0.0042122384,0.0009666143,0.0012421871,0.0016432859,0.0034153487,0.007502961,0.0035566117,0.0038099017,0.040064115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034217365,0.00007732199,0.00085245725,0.00029097896,0.0000501026,0.0010846835,0.00093929155,0.00049701845,0.007663793,0.78470325,0.14381905,0.059679937],"study_design_scores_gemma":[0.000024164148,0.00009332681,0.0008087573,0.00014192947,0.00003659711,0.0014261509,0.0003187486,0.0014074664,0.0051106694,0.34818923,0.642365,0.00007797011],"about_ca_topic_score_codex":0.002009968,"about_ca_topic_score_gemma":0.003664948,"teacher_disagreement_score":0.099476606,"about_ca_system_score_codex":0.0014798731,"about_ca_system_score_gemma":0.00096625334,"threshold_uncertainty_score":0.3327824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0445103,0.0017819264,0.9154417,0.00089089386,0.0004215109,0.000026209485,0.00012638902,0.00030854077,0.03649247],"genre_scores_gemma":[0.75039923,0.0013180337,0.23197262,0.00063247606,0.000806089,0.00015797131,0.00021336105,0.00041907778,0.014081138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992086,0.00019739548,0.00002790781,0.00017269449,0.00026305983,0.00013044046],"domain_scores_gemma":[0.99818414,0.0009254325,0.0002051403,0.00022723059,0.00021178764,0.00024627146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010118035,0.0011382885,0.0006439725,0.0026814688,0.0011928185,0.0015439733,0.0011201212,0.00091806543,0.003676215],"category_scores_gemma":[0.0044866507,0.00033619988,0.0009788475,0.0009588877,0.0025364489,0.0025721032,0.002026822,0.002741131,0.0008291241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040275274,0.000015353979,0.0002285116,0.00004172426,0.000010499702,0.000063972955,0.000089913134,0.005921454,0.0034699813,0.97755367,0.0014875727,0.011076995],"study_design_scores_gemma":[0.0000062190284,0.00001463989,0.00026466788,0.00002363307,0.000006629181,0.00009035461,0.000035645182,0.057867236,0.0016516009,0.9360283,0.0039925734,0.000018558056],"about_ca_topic_score_codex":0.00061995856,"about_ca_topic_score_gemma":0.0006632917,"teacher_disagreement_score":0.003676215,"about_ca_system_score_codex":0.0011965248,"about_ca_system_score_gemma":0.00046730935,"threshold_uncertainty_score":0.012298107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8921905,0.0011571017,0.07146265,0.00072905,0.00016779282,0.000066339904,0.00018615673,0.0002552888,0.033785027],"genre_scores_gemma":[0.96997815,0.0005804502,0.018539067,0.000096557735,0.00018771389,0.000071591574,0.00025508596,0.000093904884,0.010197509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998992,0.00016936845,0.000056543842,0.0002272924,0.00034163008,0.00021306134],"domain_scores_gemma":[0.998475,0.00066701736,0.0002828293,0.0001531067,0.00014006767,0.00028199542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083527766,0.00051325565,0.0005994839,0.0018657091,0.0020908862,0.0020928602,0.00062013976,0.00071410625,0.0059341397],"category_scores_gemma":[0.0029154867,0.00039716446,0.0005803054,0.00095723924,0.0030827906,0.004719888,0.0023241076,0.0013170494,0.0005655742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022172068,0.00004121346,0.002395931,0.000104616236,0.000015120981,0.00024587856,0.00085806864,0.00445446,0.009055525,0.96452135,0.00066390313,0.017422361],"study_design_scores_gemma":[0.000040170904,0.00007321811,0.0018662293,0.000059948725,0.000030312785,0.0006175498,0.00063831615,0.02180506,0.008336045,0.95693356,0.009563713,0.000035794903],"about_ca_topic_score_codex":0.0006960469,"about_ca_topic_score_gemma":0.0007590931,"teacher_disagreement_score":0.0059341397,"about_ca_system_score_codex":0.0015582443,"about_ca_system_score_gemma":0.00046061428,"threshold_uncertainty_score":0.019851685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1993704,0.0036487072,0.69032747,0.006594592,0.0005247501,0.00023141569,0.0011309469,0.0007455769,0.09742613],"genre_scores_gemma":[0.79892284,0.0021627354,0.16780742,0.0024754829,0.0010958093,0.00046912365,0.0017829409,0.00050634856,0.02477738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974342,0.00095723034,0.000108676366,0.0005868745,0.0005738632,0.00033915875],"domain_scores_gemma":[0.98313373,0.012090028,0.0014967619,0.0017324137,0.0007797386,0.0007673761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048102317,0.0011087086,0.0015418137,0.0023157848,0.0021489186,0.004106644,0.0028717292,0.0024947133,0.019451907],"category_scores_gemma":[0.020817414,0.00078596995,0.0024463092,0.0024459881,0.003726827,0.011798595,0.0031499611,0.004108216,0.0011585106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008285449,0.00007834747,0.0014445262,0.0002358824,0.00004124053,0.000095841395,0.00031764156,0.027035128,0.00096439285,0.9505314,0.006839682,0.012333033],"study_design_scores_gemma":[0.00004683044,0.000108496984,0.0011007211,0.00009249852,0.000042762706,0.00028551964,0.00029890498,0.115237296,0.0014889917,0.871709,0.009534633,0.00005441889],"about_ca_topic_score_codex":0.001322351,"about_ca_topic_score_gemma":0.0014377164,"teacher_disagreement_score":0.019451907,"about_ca_system_score_codex":0.002423641,"about_ca_system_score_gemma":0.0006358866,"threshold_uncertainty_score":0.06507313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40715525,0.0014374225,0.40849388,0.0031720507,0.0016497452,0.00016091544,0.0004585073,0.0007696918,0.1767026],"genre_scores_gemma":[0.9230304,0.0010592589,0.04010912,0.000681709,0.00091716024,0.00017801275,0.00026306193,0.00035354155,0.033407822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995938,0.000059896134,0.000025099444,0.000096709366,0.00013089107,0.000093623334],"domain_scores_gemma":[0.9995621,0.00015990327,0.000063626125,0.000041838284,0.000080772705,0.000091715854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056209747,0.0007035097,0.00069490424,0.0016809154,0.0013849642,0.0016557903,0.0007852419,0.00087432814,0.009623567],"category_scores_gemma":[0.0015928783,0.00033514813,0.0007630359,0.0007449314,0.0018026592,0.005228184,0.0019661589,0.0027009412,0.0018388412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047653804,0.000026330687,0.00031713184,0.00007312266,0.000004864309,0.00028179807,0.00040756867,0.0005128747,0.0027155066,0.9719561,0.0018222375,0.021834848],"study_design_scores_gemma":[0.000020296304,0.000085012194,0.0005444852,0.000031779582,0.00001739872,0.0009498537,0.00020073673,0.005865699,0.004305859,0.97995824,0.0079835495,0.000037126967],"about_ca_topic_score_codex":0.00023061004,"about_ca_topic_score_gemma":0.00026255506,"teacher_disagreement_score":0.009623567,"about_ca_system_score_codex":0.0008723049,"about_ca_system_score_gemma":0.00041076806,"threshold_uncertainty_score":0.03219402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40667185,0.005594463,0.3792483,0.01615515,0.0012959987,0.00011034156,0.00068426965,0.000532451,0.18970725],"genre_scores_gemma":[0.911952,0.0036004232,0.051509317,0.00143422,0.00197142,0.00014473723,0.0008892193,0.00015458993,0.028344035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.0003902757,0.000051432133,0.00019375663,0.00035833355,0.000280794],"domain_scores_gemma":[0.9954951,0.0030924757,0.00026591937,0.00038649753,0.0003575174,0.00040242466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077223,0.0008114386,0.001132898,0.0021580234,0.00300441,0.0034627141,0.0017515844,0.0017000603,0.0088354545],"category_scores_gemma":[0.007994232,0.0005439677,0.00071505597,0.0027586299,0.0038792328,0.011737662,0.0051527866,0.005126564,0.0019987663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059775222,0.00006707345,0.0005193676,0.00007137733,0.000009806585,0.00014085993,0.00032986354,0.0025649029,0.00037491214,0.9760724,0.0036842956,0.016105453],"study_design_scores_gemma":[0.000011865177,0.000015656358,0.00009230221,0.0000256653,0.000007117107,0.00009575412,0.00015335837,0.0050644726,0.00029333023,0.990948,0.0032837004,0.000008562189],"about_ca_topic_score_codex":0.001061927,"about_ca_topic_score_gemma":0.00087157905,"teacher_disagreement_score":0.0088354545,"about_ca_system_score_codex":0.001184131,"about_ca_system_score_gemma":0.00082777225,"threshold_uncertainty_score":0.029557586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5004582,0.0008898878,0.29713547,0.0016308699,0.00029994958,0.00022651954,0.00045431452,0.0006103782,0.1982944],"genre_scores_gemma":[0.9489013,0.00023517218,0.031000823,0.00020761395,0.000087538,0.00013330879,0.00016648635,0.00007748443,0.01919023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996166,0.00008008829,0.000021182243,0.00008490643,0.00010258632,0.00009454805],"domain_scores_gemma":[0.99964225,0.00006310414,0.000057562273,0.00006689521,0.000056918194,0.000113259266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030512369,0.00037928257,0.0003882613,0.0011129737,0.0015796745,0.0027134817,0.0013152725,0.000983217,0.008167412],"category_scores_gemma":[0.00073775015,0.0002999719,0.000631414,0.00091194134,0.002436225,0.0031429003,0.0017891225,0.0011105445,0.0009072497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008405906,0.0000067669976,0.00009605913,0.000009563997,0.0000013761658,0.00006888942,0.000066086934,0.0010170429,0.00042913618,0.9971877,0.00022779962,0.0008810272],"study_design_scores_gemma":[0.000019276462,0.000028362168,0.00022960315,0.000014368972,0.000007049588,0.00031160613,0.00031267267,0.03224031,0.0013100646,0.9573595,0.008143031,0.00002416275],"about_ca_topic_score_codex":0.0014610766,"about_ca_topic_score_gemma":0.0012391666,"teacher_disagreement_score":0.008167412,"about_ca_system_score_codex":0.00159082,"about_ca_system_score_gemma":0.0006729455,"threshold_uncertainty_score":0.02732271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29380068,0.0007333272,0.6617798,0.002820178,0.000105616935,0.00030305606,0.00042251646,0.0007279323,0.03930685],"genre_scores_gemma":[0.9086431,0.0008703669,0.07050762,0.0014312933,0.00017840961,0.00052705023,0.0007310279,0.00031773574,0.016793419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759394,0.0009090634,0.000098701195,0.000592321,0.0004118936,0.00039401994],"domain_scores_gemma":[0.9850369,0.010605323,0.0013440372,0.001298549,0.00054236886,0.0011727223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030743538,0.0011340528,0.0017736119,0.0013899932,0.0015405247,0.0027211145,0.0034921218,0.0022613194,0.008202204],"category_scores_gemma":[0.021583928,0.00096012605,0.0015149761,0.0009894355,0.003915069,0.009419305,0.002588223,0.004320655,0.00104151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029666457,0.00018905605,0.0016743098,0.0001657373,0.000064117114,0.00023900383,0.00066564005,0.03884064,0.0047226213,0.9350016,0.0030838766,0.015056802],"study_design_scores_gemma":[0.00018061748,0.00022604245,0.0007573181,0.00006732236,0.000053753367,0.00047726164,0.00013019702,0.34407553,0.0016888063,0.6485521,0.0037347884,0.000056199748],"about_ca_topic_score_codex":0.0026726678,"about_ca_topic_score_gemma":0.0022113235,"teacher_disagreement_score":0.008202204,"about_ca_system_score_codex":0.0023236664,"about_ca_system_score_gemma":0.0012524531,"threshold_uncertainty_score":0.027439058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073480554,0.0020371496,0.8580305,0.004018498,0.0005766982,0.00003487794,0.00035879793,0.00034734324,0.06111557],"genre_scores_gemma":[0.861588,0.0026586032,0.11688578,0.0011651315,0.002253953,0.00011718431,0.0002603063,0.00030023538,0.014770763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919516,0.00025661904,0.00003040942,0.00021338227,0.00021156325,0.000092898714],"domain_scores_gemma":[0.9982358,0.0007812097,0.00021372049,0.00031596355,0.00022726682,0.00022597205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011324784,0.00064835843,0.0007815872,0.0014926346,0.0010853512,0.0023693894,0.00139711,0.0015037196,0.005893767],"category_scores_gemma":[0.0029717432,0.00032683654,0.0007206354,0.00095329736,0.0029020843,0.005750435,0.0013898787,0.002482879,0.0007407791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005318067,0.000005363495,0.00005426974,0.000012519773,0.0000031557884,0.000020801566,0.00004692299,0.0015861071,0.00066031975,0.9959694,0.0002763235,0.0013594441],"study_design_scores_gemma":[0.0000030743654,0.000017614899,0.000058464495,0.0000070897413,0.0000033016172,0.000045517307,0.000027771996,0.023759766,0.00031387026,0.97304666,0.0027073508,0.000009591669],"about_ca_topic_score_codex":0.0007691182,"about_ca_topic_score_gemma":0.00059984793,"teacher_disagreement_score":0.005893767,"about_ca_system_score_codex":0.0008594499,"about_ca_system_score_gemma":0.0005506282,"threshold_uncertainty_score":0.01971662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8008735,0.00035443413,0.16895874,0.0009750319,0.000036462832,0.000042163396,0.00034431322,0.0001988127,0.028216526],"genre_scores_gemma":[0.99252725,0.00015645749,0.004766716,0.000052646097,0.000056296347,0.000024338142,0.00014469361,0.000054356748,0.0022172774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914074,0.00020930117,0.000023536073,0.00020936005,0.00023916076,0.00017776835],"domain_scores_gemma":[0.98639977,0.009915909,0.0010174628,0.0007912624,0.0012119622,0.00066363165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619866,0.0003843727,0.0004487667,0.0013708547,0.0009810607,0.0012845326,0.00049606524,0.0004296602,0.0041936166],"category_scores_gemma":[0.010789482,0.00024413317,0.00048624148,0.00086440437,0.0023594687,0.00207574,0.0010889393,0.0016889708,0.0006337705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005065927,0.00012131758,0.0057702316,0.000114339746,0.000045603516,0.00043303857,0.000829432,0.06489951,0.030371604,0.86262435,0.0026970045,0.031586885],"study_design_scores_gemma":[0.00005246612,0.000085942534,0.0028643222,0.000017349555,0.000020760202,0.00020751308,0.00020315078,0.1906318,0.009319752,0.7948053,0.0017512749,0.000040349583],"about_ca_topic_score_codex":0.0014002763,"about_ca_topic_score_gemma":0.0009330782,"teacher_disagreement_score":0.0041936166,"about_ca_system_score_codex":0.0009919797,"about_ca_system_score_gemma":0.0004723969,"threshold_uncertainty_score":0.014029026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7372516,0.00041285343,0.20412382,0.0002569843,0.00007867124,0.000065935455,0.00024748952,0.0003940343,0.057168655],"genre_scores_gemma":[0.96389204,0.00022411541,0.02377777,0.00008015398,0.00007345277,0.000043179214,0.00021297927,0.00008644293,0.011609824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997627,0.00004839088,0.000009912668,0.00005957865,0.000056749755,0.0000626892],"domain_scores_gemma":[0.99961203,0.00015444009,0.00006155412,0.000053269174,0.000057367306,0.00006140139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035309303,0.00027734155,0.00028004646,0.0007576618,0.00052550796,0.0006293293,0.00036118232,0.00026530743,0.003428092],"category_scores_gemma":[0.0010453893,0.0001537511,0.00034007267,0.00028031625,0.00090070715,0.0020196384,0.00090332585,0.00084465044,0.00035088437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033900567,0.000016208776,0.00026024252,0.000027518994,0.0000036679992,0.00013946964,0.00031704767,0.0015331147,0.0054818536,0.98215127,0.00047457864,0.009561169],"study_design_scores_gemma":[0.000019260957,0.00006214324,0.0008284976,0.000018657787,0.000017781853,0.00036991658,0.0003595879,0.021807294,0.010549556,0.9544407,0.011509123,0.000017538574],"about_ca_topic_score_codex":0.00045993243,"about_ca_topic_score_gemma":0.00074577983,"teacher_disagreement_score":0.003428092,"about_ca_system_score_codex":0.00045343913,"about_ca_system_score_gemma":0.00018089006,"threshold_uncertainty_score":0.0114681125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3321586,0.0016853225,0.4080876,0.0019179576,0.0012648185,0.00014909352,0.00086714054,0.0004364373,0.25343305],"genre_scores_gemma":[0.8906731,0.0012521722,0.059044696,0.0006440551,0.001083305,0.00016505446,0.0009004439,0.00030426445,0.04593293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992938,0.00013391934,0.00003113981,0.00011205281,0.0002662248,0.0001628477],"domain_scores_gemma":[0.999241,0.00018223134,0.00007510587,0.000121396064,0.00020861509,0.00017170717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010000865,0.0007155014,0.00055615645,0.0019596806,0.0016290466,0.0023234056,0.0011310945,0.00057831104,0.012880299],"category_scores_gemma":[0.0012727688,0.00031795498,0.0008218262,0.0009973776,0.0021506995,0.0038502063,0.0015233807,0.0025478266,0.0023782616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008612385,0.000017512255,0.0000588598,0.000014774219,0.0000023674913,0.000021013424,0.000093846065,0.00046774434,0.00083747925,0.9936237,0.0006969685,0.0041573034],"study_design_scores_gemma":[0.0000072581934,0.000019957091,0.00009545953,0.000010512436,0.0000037373236,0.000047652742,0.00007192283,0.0036176434,0.0010089154,0.9887533,0.0063476637,0.000016007918],"about_ca_topic_score_codex":0.00074258464,"about_ca_topic_score_gemma":0.0011023213,"teacher_disagreement_score":0.012880299,"about_ca_system_score_codex":0.0012986431,"about_ca_system_score_gemma":0.0006997091,"threshold_uncertainty_score":0.043088853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6950983,0.00052322826,0.21341157,0.0025201067,0.00033930843,0.00011229078,0.0002423728,0.00046731636,0.08728547],"genre_scores_gemma":[0.92866904,0.0002252261,0.03834717,0.00019589438,0.000098701035,0.00010887744,0.00022933623,0.0001242516,0.032001484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00029017575,0.00003537577,0.00011854468,0.00011980589,0.00020187853],"domain_scores_gemma":[0.9970247,0.002038574,0.00020334314,0.00023748568,0.00013551218,0.00036039756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061545166,0.0005732742,0.00067610986,0.00044439116,0.0018320794,0.0025519524,0.0014168075,0.0020675883,0.008490251],"category_scores_gemma":[0.0046061995,0.0004723078,0.00081522577,0.00036728408,0.0027771958,0.0033659008,0.002468517,0.0017628386,0.0008936879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048657064,0.0001094416,0.0015186465,0.00014228604,0.0000252717,0.0015953999,0.0012814284,0.06211986,0.004561559,0.9089692,0.0057618516,0.013428518],"study_design_scores_gemma":[0.00010275174,0.00008744703,0.0004932013,0.000031129544,0.000016096898,0.00035580274,0.00065930036,0.1934475,0.0024792838,0.7961803,0.006111632,0.0000356334],"about_ca_topic_score_codex":0.0015140048,"about_ca_topic_score_gemma":0.0023999787,"teacher_disagreement_score":0.008490251,"about_ca_system_score_codex":0.0008673172,"about_ca_system_score_gemma":0.00056678033,"threshold_uncertainty_score":0.028402746},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8530428,0.00061228295,0.060148027,0.00066894334,0.0000707911,0.000050765197,0.00017586691,0.00013137024,0.08509922],"genre_scores_gemma":[0.96811646,0.0006683908,0.021176443,0.00016591678,0.000057043573,0.000040446404,0.00020379772,0.000073019844,0.009498605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996302,0.000097523494,0.000011820182,0.00006988152,0.00011286069,0.00007773916],"domain_scores_gemma":[0.99941385,0.00022904006,0.00011555969,0.00008496186,0.00007261915,0.00008395978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028172688,0.00045709888,0.0004263052,0.0011152432,0.001229026,0.0010632662,0.0006469279,0.00065389625,0.003023425],"category_scores_gemma":[0.0013373233,0.00030648638,0.00050498755,0.00097656157,0.0022630482,0.0019085775,0.0009434498,0.0009789147,0.00056114304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008522486,0.000020728887,0.00050845754,0.000056681976,0.000009737947,0.00013410438,0.00041949606,0.009819252,0.0032371273,0.9750899,0.0007461368,0.009873076],"study_design_scores_gemma":[0.00003840241,0.000053881497,0.0013033026,0.000038504393,0.000029238481,0.00031820737,0.00052327104,0.021008708,0.004561328,0.96212775,0.009950265,0.0000471866],"about_ca_topic_score_codex":0.0023878862,"about_ca_topic_score_gemma":0.002137007,"teacher_disagreement_score":0.003023425,"about_ca_system_score_codex":0.0009457411,"about_ca_system_score_gemma":0.0004794599,"threshold_uncertainty_score":0.010114312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8818094,0.0010343888,0.05735079,0.0010142305,0.00008119176,0.00008889406,0.0020594776,0.00046198233,0.05609968],"genre_scores_gemma":[0.9620155,0.0002759467,0.024856636,0.0001281839,0.00010712607,0.000079495534,0.0015009051,0.0000714725,0.010964763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993093,0.0001179516,0.000045684905,0.00022731994,0.00017299115,0.00012688206],"domain_scores_gemma":[0.99832267,0.00043802158,0.00040043605,0.00026929195,0.00016692882,0.00040261488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037077747,0.0006266575,0.0005660979,0.0010181487,0.0013763976,0.002328273,0.0010143617,0.0006076536,0.0051067495],"category_scores_gemma":[0.002205961,0.0006260826,0.00066271384,0.00089301035,0.0012265935,0.002362736,0.0018087038,0.0012088583,0.00094288186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009914619,0.00014559923,0.009487343,0.00082879484,0.00018334044,0.0013407494,0.0012810564,0.012673404,0.051324666,0.8556189,0.010878138,0.055246614],"study_design_scores_gemma":[0.00019792927,0.00050777284,0.020835508,0.00014916553,0.00026968354,0.006298755,0.0011701266,0.039880835,0.04639689,0.8251378,0.058991753,0.00016386957],"about_ca_topic_score_codex":0.00080363324,"about_ca_topic_score_gemma":0.0013354969,"teacher_disagreement_score":0.0051067495,"about_ca_system_score_codex":0.00095535134,"about_ca_system_score_gemma":0.00041325483,"threshold_uncertainty_score":0.017083764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56753486,0.00029305363,0.40695417,0.0023845357,0.00010090489,0.0003011742,0.0010563205,0.001304462,0.020070562],"genre_scores_gemma":[0.9307169,0.00012225164,0.065610126,0.00029527972,0.00006593893,0.00016464145,0.00052139687,0.000077053526,0.002426525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977059,0.0005115539,0.00015701923,0.0006482243,0.00049880386,0.00047856316],"domain_scores_gemma":[0.9866632,0.009344651,0.001033557,0.0016845881,0.00066483725,0.0006091657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019270033,0.00052464585,0.0006701873,0.000852122,0.0013819266,0.004257693,0.0017773311,0.0013243872,0.005123666],"category_scores_gemma":[0.0121954195,0.00052555604,0.001631847,0.00093112525,0.0032187644,0.007242398,0.0019807534,0.0025345206,0.00024719117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048471472,0.00031747602,0.009120689,0.0002463241,0.00008820124,0.00040924354,0.0011553267,0.028653089,0.013028413,0.89696234,0.0033376045,0.046196565],"study_design_scores_gemma":[0.00010207724,0.0002724371,0.0027351368,0.000050766597,0.00006243403,0.00035636456,0.0005134347,0.14369275,0.014898583,0.8328268,0.004433851,0.000055386125],"about_ca_topic_score_codex":0.0039826673,"about_ca_topic_score_gemma":0.003497351,"teacher_disagreement_score":0.005123666,"about_ca_system_score_codex":0.0025420445,"about_ca_system_score_gemma":0.0017616533,"threshold_uncertainty_score":0.018443942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85657567,0.00035918193,0.10884846,0.00092940446,0.00008274809,0.000091739515,0.00013160896,0.00021665524,0.03276461],"genre_scores_gemma":[0.98288673,0.0001667521,0.008521349,0.000107222244,0.00005094326,0.00008764002,0.00008626352,0.000051570074,0.008041611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995858,0.00010573799,0.000013934414,0.000041830895,0.00013735327,0.00011532414],"domain_scores_gemma":[0.99949265,0.00019839573,0.00010279687,0.000073688534,0.000046834324,0.00008565172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079966633,0.00047662988,0.0007259197,0.0011393868,0.0010407298,0.0012091451,0.0011344737,0.0013224347,0.0047215456],"category_scores_gemma":[0.0017839643,0.00028521023,0.00084266806,0.00063215196,0.0017639356,0.0023783895,0.0008512448,0.0007703757,0.00040857773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023247036,0.000024929943,0.00015405974,0.000016112554,0.0000037474365,0.000092053226,0.00007601699,0.00836435,0.0015662515,0.9881175,0.00024231918,0.001319479],"study_design_scores_gemma":[0.000038696624,0.00003475962,0.000372035,0.0000059920535,0.000003714396,0.00015707851,0.00006501872,0.10799659,0.0010203525,0.88970137,0.0005866185,0.000017788085],"about_ca_topic_score_codex":0.0014257841,"about_ca_topic_score_gemma":0.0010639855,"teacher_disagreement_score":0.0047215456,"about_ca_system_score_codex":0.0011281339,"about_ca_system_score_gemma":0.0006757949,"threshold_uncertainty_score":0.015795171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7224842,0.0005339794,0.22019033,0.00059224054,0.0000700687,0.00005331299,0.00027440256,0.00018796172,0.055613443],"genre_scores_gemma":[0.97743315,0.00029737884,0.015041862,0.000090487294,0.000060679424,0.000051235293,0.00015146866,0.000047965135,0.0068258503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994184,0.000108463995,0.000039193317,0.000101331505,0.0001904581,0.00014216523],"domain_scores_gemma":[0.99840695,0.00071284897,0.00025313674,0.0003250408,0.0001639877,0.00013800236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047970263,0.00032492122,0.0002970177,0.0010041179,0.00079496484,0.0016179843,0.0005572254,0.0006112815,0.003072494],"category_scores_gemma":[0.002585188,0.00018907416,0.00043271916,0.0010682462,0.0017273494,0.0023006683,0.0011570988,0.0007672906,0.00036925348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049997863,0.000020083173,0.0018582122,0.000033647615,0.000005777867,0.00018006844,0.00028670082,0.0059944163,0.0026498581,0.9699803,0.0007467104,0.018194215],"study_design_scores_gemma":[0.000017246703,0.000044813496,0.0012708241,0.000021451915,0.000009928308,0.0005333168,0.0001792191,0.03908081,0.002847901,0.94748664,0.008483402,0.000024384386],"about_ca_topic_score_codex":0.0010590057,"about_ca_topic_score_gemma":0.00103957,"teacher_disagreement_score":0.003072494,"about_ca_system_score_codex":0.00088390656,"about_ca_system_score_gemma":0.00046770638,"threshold_uncertainty_score":0.010278523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65858024,0.0035782892,0.169973,0.001941677,0.0004375674,0.000049612918,0.00040970536,0.00037510417,0.16465476],"genre_scores_gemma":[0.9679593,0.0009474921,0.01504915,0.00023325911,0.0003172935,0.000032401425,0.00014130554,0.00007021693,0.015249614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961084,0.000051807016,0.000017006081,0.000081241575,0.00013248855,0.000106607695],"domain_scores_gemma":[0.9993074,0.000302073,0.00010600909,0.000059879316,0.00011514862,0.000109423425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046066256,0.00029831688,0.00035720025,0.0018192441,0.0017031449,0.0017521833,0.00048729315,0.0006893287,0.005626596],"category_scores_gemma":[0.0015651552,0.00019222603,0.00033776925,0.0013672528,0.002349138,0.0044342494,0.00094971055,0.0012191603,0.00081849186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008293108,0.000003885575,0.00007590161,0.000010897145,0.0000010265668,0.000047999507,0.00015312221,0.0002004184,0.0004179682,0.99631894,0.00029630543,0.0024652143],"study_design_scores_gemma":[0.000005283404,0.000011310683,0.00024854022,0.00000979336,0.0000035400299,0.00014352203,0.00015031517,0.0013167321,0.0007391271,0.9899401,0.0074194,0.0000123303735],"about_ca_topic_score_codex":0.00093556894,"about_ca_topic_score_gemma":0.00081862556,"teacher_disagreement_score":0.005626596,"about_ca_system_score_codex":0.0011493284,"about_ca_system_score_gemma":0.0004887187,"threshold_uncertainty_score":0.01882279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55688524,0.0024709532,0.3377086,0.003057468,0.000464038,0.000101834084,0.00029174756,0.00025132578,0.09876883],"genre_scores_gemma":[0.9682862,0.001036563,0.013213576,0.00047685896,0.00024945443,0.00009312981,0.00022671773,0.00013143431,0.01628607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995641,0.00015258037,0.00001527059,0.000057133395,0.00007651011,0.00013446677],"domain_scores_gemma":[0.99888283,0.0004483838,0.00016139493,0.00008753535,0.00019901483,0.00022097045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074163877,0.00053915347,0.00059944333,0.0015472893,0.0012510779,0.0019808742,0.00088820397,0.001288839,0.005977819],"category_scores_gemma":[0.0038005006,0.0003120557,0.00084940746,0.0008990655,0.0019523927,0.0023404986,0.0012682073,0.0010101406,0.0007064527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001960093,0.000021718071,0.0003699299,0.000022899425,0.0000053446834,0.00012578144,0.00008934205,0.009614116,0.00068053696,0.9859189,0.0009485155,0.002183237],"study_design_scores_gemma":[0.000017560922,0.000025845251,0.00037279006,0.000037350495,0.00000613769,0.00015278197,0.00012209962,0.16132924,0.0002960574,0.8357739,0.0018487388,0.000017636781],"about_ca_topic_score_codex":0.0031470738,"about_ca_topic_score_gemma":0.0020072907,"teacher_disagreement_score":0.005977819,"about_ca_system_score_codex":0.0010668392,"about_ca_system_score_gemma":0.00077224855,"threshold_uncertainty_score":0.019997776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84114957,0.0015979918,0.04887676,0.00703048,0.00019727624,0.00010566447,0.0010892095,0.00046184752,0.09949121],"genre_scores_gemma":[0.981632,0.0003376349,0.012364266,0.00031212738,0.00007732815,0.000037250367,0.00036068814,0.000043776035,0.004834879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982943,0.00024500172,0.00008427936,0.0004663372,0.00025341444,0.00065672246],"domain_scores_gemma":[0.9958397,0.0023233204,0.0004961607,0.00046955442,0.00026501805,0.0006063166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013011836,0.0005266274,0.0006483377,0.0013876661,0.002770867,0.0033476956,0.0024039655,0.0022451505,0.011325387],"category_scores_gemma":[0.004732107,0.00063858466,0.0011441355,0.0016376738,0.0035581903,0.0043593366,0.0026876251,0.0022158667,0.000836478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015400958,0.000203092,0.01345726,0.00059642945,0.00013651034,0.0015810796,0.0012462909,0.02845934,0.01643853,0.88929003,0.016497102,0.030554289],"study_design_scores_gemma":[0.00038427723,0.0002508065,0.008019049,0.00013031116,0.000181898,0.0021860613,0.0008185032,0.11402603,0.012364623,0.8359186,0.025610654,0.00010908047],"about_ca_topic_score_codex":0.003602648,"about_ca_topic_score_gemma":0.0055319164,"teacher_disagreement_score":0.011325387,"about_ca_system_score_codex":0.0022318412,"about_ca_system_score_gemma":0.00093137287,"threshold_uncertainty_score":0.037887216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626803,0.0005140423,0.01942092,0.0011863253,0.00007091382,0.000010783248,0.00010201496,0.00016592507,0.01584889],"genre_scores_gemma":[0.9958181,0.00033096067,0.0020976148,0.00006969926,0.00007904674,0.00001719186,0.00008550602,0.000065508866,0.0014364407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999597,0.00010443047,0.000013476744,0.00009790782,0.000087424254,0.00009971575],"domain_scores_gemma":[0.99544287,0.0029277196,0.00064152025,0.00027341527,0.00026969798,0.00044477428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011881272,0.00038342795,0.0005082837,0.0036154343,0.0012055604,0.0019272215,0.0009597807,0.0009983006,0.0038620464],"category_scores_gemma":[0.007916675,0.00044099495,0.0003226004,0.001083307,0.0038337181,0.0032798124,0.0013009295,0.00092933537,0.0003386156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002913931,0.00006012944,0.01503034,0.00012422673,0.000024243342,0.0007344758,0.001222784,0.021128917,0.015691837,0.91868,0.0038975254,0.023114147],"study_design_scores_gemma":[0.000072532166,0.00008821899,0.025552664,0.000115621566,0.000040350325,0.0017306729,0.0010015153,0.16738836,0.00866681,0.7909108,0.0043160967,0.0001163232],"about_ca_topic_score_codex":0.00053387217,"about_ca_topic_score_gemma":0.0004895787,"teacher_disagreement_score":0.0038620464,"about_ca_system_score_codex":0.0009600725,"about_ca_system_score_gemma":0.00022645727,"threshold_uncertainty_score":0.012919843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85497147,0.00039980144,0.13372092,0.0011077301,0.000039786144,0.000079075086,0.00050539925,0.00051454967,0.008661296],"genre_scores_gemma":[0.98825026,0.0005257707,0.0064854426,0.00008609991,0.00008413437,0.00009548287,0.0005203646,0.00016954994,0.0037829361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921465,0.00027926735,0.000020156227,0.00012735446,0.00018518182,0.00017340468],"domain_scores_gemma":[0.9873841,0.008182934,0.00143068,0.00086749234,0.0010641882,0.0010705584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022115095,0.0006173974,0.0009258492,0.0030618445,0.00067733886,0.001859786,0.001681362,0.0011198262,0.004245139],"category_scores_gemma":[0.020734422,0.00064138894,0.0005972508,0.0013159917,0.003311003,0.0028528231,0.0013282867,0.0017289148,0.0005445843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027486315,0.00010453472,0.008024114,0.00024623374,0.000043942586,0.00074002193,0.0005531799,0.1886463,0.012740416,0.7765652,0.003585153,0.008476055],"study_design_scores_gemma":[0.00006038981,0.00006783654,0.0033689707,0.000056797027,0.000023533194,0.00047595313,0.00026303134,0.8036676,0.00422433,0.18638377,0.0013253712,0.00008242565],"about_ca_topic_score_codex":0.0023430209,"about_ca_topic_score_gemma":0.0017629896,"teacher_disagreement_score":0.004245139,"about_ca_system_score_codex":0.0015605829,"about_ca_system_score_gemma":0.0006204179,"threshold_uncertainty_score":0.014201403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.926653,0.0002523691,0.00872084,0.0001450571,0.000036440175,0.000016726846,0.00034736644,0.00010945704,0.063718654],"genre_scores_gemma":[0.9936546,0.00013949585,0.0031537341,0.000041338804,0.000015843858,0.0000123618,0.00029018614,0.00003842276,0.002654042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997913,0.00001944011,0.000008877579,0.000048051726,0.000044225217,0.00008818448],"domain_scores_gemma":[0.99929774,0.0002500159,0.000108590306,0.00008851699,0.00011308503,0.00014204696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002012834,0.00021826703,0.00015742006,0.0012793513,0.00093128183,0.001368712,0.00045172015,0.00036859457,0.0055739675],"category_scores_gemma":[0.0009453519,0.00017215511,0.00019245564,0.00082169235,0.0008986913,0.0010198748,0.0006185365,0.0004018877,0.0005403928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013401693,0.0001231033,0.021575874,0.00019992197,0.000044044617,0.00045826644,0.0008308463,0.027977468,0.09236038,0.7909991,0.009107747,0.05498302],"study_design_scores_gemma":[0.00014076754,0.00024407299,0.0396626,0.00008393215,0.00009373609,0.0010873665,0.0012102302,0.17499037,0.108862415,0.6400977,0.033349022,0.0001778081],"about_ca_topic_score_codex":0.0037140432,"about_ca_topic_score_gemma":0.0049814447,"teacher_disagreement_score":0.0055739675,"about_ca_system_score_codex":0.001387158,"about_ca_system_score_gemma":0.00043251933,"threshold_uncertainty_score":0.018646777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9280573,0.00033492665,0.047364827,0.0006680275,0.000034808116,0.00003766139,0.0005346045,0.0002622719,0.022705473],"genre_scores_gemma":[0.98373705,0.00017712888,0.012310598,0.000080443555,0.00004270251,0.000059996575,0.0005361658,0.00007825103,0.0029776765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.000085429514,0.000018599285,0.0001397058,0.00011810091,0.00012061242],"domain_scores_gemma":[0.99703634,0.0015804337,0.00044026764,0.0002443982,0.00019713603,0.0005014347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030035822,0.00042993223,0.00054595585,0.0008252583,0.00085586926,0.0011600046,0.0011363747,0.0006081536,0.006095886],"category_scores_gemma":[0.0029833964,0.00043860928,0.00051236706,0.000555427,0.0014803946,0.002277375,0.001580395,0.0007631265,0.00043103984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078922993,0.00021756376,0.012582228,0.00069567247,0.00011176637,0.0011033869,0.0019080003,0.057867635,0.06056372,0.8182152,0.007880532,0.038065],"study_design_scores_gemma":[0.00012148469,0.00018592627,0.008470705,0.000069190195,0.000090553964,0.00082544074,0.0010921034,0.08841646,0.018754851,0.87222725,0.009695147,0.000050831495],"about_ca_topic_score_codex":0.0011864145,"about_ca_topic_score_gemma":0.0015237565,"teacher_disagreement_score":0.006095886,"about_ca_system_score_codex":0.00080433115,"about_ca_system_score_gemma":0.000378344,"threshold_uncertainty_score":0.020392776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8983892,0.00044761528,0.07374314,0.0010928608,0.00012712633,0.0001412343,0.0013435971,0.00037171124,0.024343463],"genre_scores_gemma":[0.96029073,0.00031039765,0.029070126,0.0002590797,0.00010399825,0.00018565456,0.0018837065,0.00010459943,0.007791833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.0001321937,0.00006338544,0.0003432402,0.00020983102,0.00026477987],"domain_scores_gemma":[0.9927982,0.0030541,0.0016060445,0.00075386075,0.0005312106,0.0012566515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005634965,0.0008372236,0.0008461967,0.001743782,0.0021014172,0.0018678796,0.0019527226,0.00083988596,0.008616672],"category_scores_gemma":[0.0046729115,0.0008563526,0.0009708108,0.0014541689,0.0028992402,0.004230117,0.0023542058,0.0018153352,0.00053029315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093681674,0.00028944112,0.010787024,0.00097403204,0.00021590511,0.0025256593,0.0023680339,0.03372894,0.03346571,0.8701248,0.010170815,0.034412842],"study_design_scores_gemma":[0.000115481766,0.00022958232,0.00933024,0.00011154983,0.00014781799,0.0026312722,0.0012755451,0.06583188,0.009810991,0.8958258,0.014579481,0.00011030188],"about_ca_topic_score_codex":0.0013705702,"about_ca_topic_score_gemma":0.002249467,"teacher_disagreement_score":0.008616672,"about_ca_system_score_codex":0.0009385523,"about_ca_system_score_gemma":0.00067648274,"threshold_uncertainty_score":0.0288257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8543165,0.0005123356,0.06281702,0.0013471408,0.000120159035,0.00004465316,0.00050423585,0.0002182549,0.08011971],"genre_scores_gemma":[0.980051,0.00025282943,0.008060003,0.00014641369,0.00011685591,0.000029259065,0.00031967548,0.000056240093,0.010967804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995172,0.000070208334,0.000012834217,0.000115970994,0.000083273226,0.00020046496],"domain_scores_gemma":[0.99883395,0.0005176737,0.0001771888,0.000102658116,0.00012010869,0.00024842066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047765416,0.0003399074,0.00037980598,0.00091091875,0.0010274363,0.0014012334,0.0006285063,0.00031162373,0.0054382533],"category_scores_gemma":[0.0015828814,0.0002571616,0.00057676015,0.0005756291,0.002544322,0.00170264,0.0017213123,0.0017659006,0.00092908164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041381645,0.000088879395,0.003663474,0.000108873624,0.000025968098,0.0002668375,0.0006953846,0.0041257874,0.012197026,0.96074617,0.0031957154,0.014472052],"study_design_scores_gemma":[0.00012123916,0.00015061257,0.006543854,0.00003511192,0.000043901455,0.000562012,0.00060972647,0.03072309,0.021676771,0.9259252,0.013542289,0.00006608597],"about_ca_topic_score_codex":0.0012377216,"about_ca_topic_score_gemma":0.0012911625,"teacher_disagreement_score":0.0054382533,"about_ca_system_score_codex":0.00087762374,"about_ca_system_score_gemma":0.00040902145,"threshold_uncertainty_score":0.018192708},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35080877,0.009423574,0.18395385,0.06941043,0.0044204537,0.00007518637,0.00070987816,0.0009149099,0.38028297],"genre_scores_gemma":[0.9420719,0.002846546,0.023004452,0.0035665943,0.0015896803,0.00010772636,0.00023356178,0.00014922344,0.026430395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990721,0.00020348147,0.00004383602,0.000262696,0.00024660878,0.00017124483],"domain_scores_gemma":[0.99555176,0.0029608447,0.00026465935,0.00059589656,0.00028052035,0.00034623157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025186099,0.0006538327,0.00089716195,0.0020243824,0.0021981031,0.0026021258,0.0017556103,0.0018856926,0.0063047283],"category_scores_gemma":[0.00936433,0.00038717446,0.00072182727,0.002223481,0.0055800336,0.007819939,0.0034304175,0.0040974435,0.0011856802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086908265,0.000030277704,0.000786021,0.0000661384,0.000008196054,0.00012423629,0.00025162759,0.003112419,0.0007600626,0.9717629,0.01011047,0.012900834],"study_design_scores_gemma":[0.00001924477,0.000025079691,0.00047825443,0.000022221262,0.000009231496,0.0001123518,0.00010371647,0.009031631,0.0006903622,0.9746115,0.014872732,0.000023625147],"about_ca_topic_score_codex":0.0017642867,"about_ca_topic_score_gemma":0.0015512945,"teacher_disagreement_score":0.0063047283,"about_ca_system_score_codex":0.002222049,"about_ca_system_score_gemma":0.00084046595,"threshold_uncertainty_score":0.021091461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62387973,0.0011621104,0.22348619,0.0015801459,0.00017774235,0.000104062514,0.0010944412,0.0017268832,0.14678863],"genre_scores_gemma":[0.9607777,0.0004864776,0.022649832,0.0003256803,0.00014670227,0.00009644845,0.0005626639,0.00016268641,0.014791662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947363,0.00006265841,0.000024995868,0.00022193708,0.0000885714,0.00012826642],"domain_scores_gemma":[0.99855965,0.0005717783,0.00022883294,0.00029713442,0.00016189017,0.00018078886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754955,0.00035312926,0.000587424,0.00076494814,0.0012604168,0.0014439938,0.0004493919,0.0005875766,0.012132873],"category_scores_gemma":[0.0021680994,0.00033404128,0.0006385908,0.0007457205,0.0012258646,0.003133842,0.0011886633,0.0010269035,0.0012840275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002541668,0.00007730964,0.0039012216,0.0002086946,0.00003515899,0.00085171155,0.0006172315,0.0034478498,0.025512323,0.9238831,0.0053759003,0.035835344],"study_design_scores_gemma":[0.000076809876,0.00019146486,0.005313657,0.000060743943,0.00010858582,0.0028963482,0.00043954115,0.029139942,0.015155893,0.9111967,0.03535531,0.00006494377],"about_ca_topic_score_codex":0.0013874341,"about_ca_topic_score_gemma":0.001866943,"teacher_disagreement_score":0.012132873,"about_ca_system_score_codex":0.0006289791,"about_ca_system_score_gemma":0.00043006038,"threshold_uncertainty_score":0.040588558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8691815,0.0012502653,0.058967154,0.00068124686,0.00007358182,0.000060753795,0.0003207767,0.00009781084,0.06936689],"genre_scores_gemma":[0.9702354,0.001089895,0.015892772,0.00009108972,0.00015913851,0.000081453974,0.00028921457,0.000037759008,0.012123269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993018,0.000115528994,0.000026227135,0.00008488099,0.00032187355,0.00014974865],"domain_scores_gemma":[0.99832445,0.0005325109,0.0004214827,0.00021933715,0.00031067783,0.00019143993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036233576,0.00049050356,0.00040367525,0.001655963,0.0011611113,0.0012741704,0.00055433327,0.00058900943,0.0022519534],"category_scores_gemma":[0.003105301,0.00027960064,0.0005991003,0.0017123545,0.002040044,0.002241107,0.002078182,0.0018403637,0.0005004439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011471263,0.00003137801,0.0011982446,0.00009455488,0.000011243676,0.0005390713,0.00073515245,0.020662334,0.002829939,0.95348775,0.0010519527,0.019243665],"study_design_scores_gemma":[0.000032111882,0.000099583376,0.0013250132,0.00009175836,0.000012725938,0.00096195465,0.00036938387,0.056778647,0.0026105442,0.92772025,0.009946127,0.00005198626],"about_ca_topic_score_codex":0.0017034408,"about_ca_topic_score_gemma":0.0011657792,"teacher_disagreement_score":0.0022519534,"about_ca_system_score_codex":0.0010670242,"about_ca_system_score_gemma":0.00064743956,"threshold_uncertainty_score":0.0077418685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07180811,0.002552043,0.6851013,0.004802339,0.0014153747,0.0004885304,0.0011248213,0.00178341,0.2309241],"genre_scores_gemma":[0.72804713,0.0046511698,0.22615182,0.0032564253,0.0011441129,0.00060860865,0.0011114203,0.0006415945,0.034387704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899477,0.0001709943,0.00005697764,0.0002699591,0.00030460654,0.00020268215],"domain_scores_gemma":[0.9975237,0.0016251637,0.000115708135,0.00036734392,0.00024827613,0.00011973274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010963331,0.0015835192,0.00053778157,0.00094422896,0.0015133367,0.0020144207,0.0014197356,0.0012949951,0.018530618],"category_scores_gemma":[0.0041073714,0.0008295461,0.0018145406,0.00086487073,0.00379683,0.0059687705,0.005984195,0.0043890327,0.0015451271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000756047,0.0000927189,0.0005310243,0.0005147048,0.00003406536,0.0013092811,0.00062005245,0.002193448,0.007331798,0.9431655,0.0075167846,0.03661502],"study_design_scores_gemma":[0.00006162096,0.00010114529,0.0010411477,0.0001581701,0.000070543145,0.0012184747,0.00044833415,0.0039667133,0.012243853,0.9215254,0.05911516,0.00004931995],"about_ca_topic_score_codex":0.00082481565,"about_ca_topic_score_gemma":0.0010071934,"teacher_disagreement_score":0.018530618,"about_ca_system_score_codex":0.00088221073,"about_ca_system_score_gemma":0.00062703656,"threshold_uncertainty_score":0.061991036},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36621055,0.012150386,0.3284263,0.009992563,0.0015947908,0.00015189429,0.0013343295,0.0009311661,0.27920803],"genre_scores_gemma":[0.8860771,0.010226276,0.08299099,0.0021412699,0.0007345272,0.00022929099,0.001013579,0.0003221044,0.016264936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994628,0.0001307801,0.000035448476,0.0001369414,0.00013177717,0.00010221352],"domain_scores_gemma":[0.9976433,0.0015280287,0.0001624002,0.00024999407,0.00022680918,0.00018945936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045695773,0.00051556097,0.00057008665,0.00092712924,0.0017422271,0.0013867109,0.0011156381,0.0009316915,0.0073881233],"category_scores_gemma":[0.0026088208,0.0003894776,0.0006186792,0.0011570024,0.002165997,0.004028066,0.0031359056,0.0019051533,0.0009584329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016296539,0.000048899543,0.0030467478,0.00032726306,0.000049807444,0.0010036487,0.00072719954,0.007594396,0.011044581,0.92813814,0.015316411,0.03253989],"study_design_scores_gemma":[0.000041932442,0.00026718486,0.0047797854,0.0001587938,0.00011313319,0.0019167329,0.00071701704,0.019746121,0.011329602,0.872465,0.0883823,0.00008247028],"about_ca_topic_score_codex":0.0012521168,"about_ca_topic_score_gemma":0.0011711306,"teacher_disagreement_score":0.0073881233,"about_ca_system_score_codex":0.0003482553,"about_ca_system_score_gemma":0.00023700873,"threshold_uncertainty_score":0.024715722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70570946,0.000486646,0.23416492,0.00041116247,0.00013668103,0.00011029054,0.0011599921,0.00067758595,0.05714326],"genre_scores_gemma":[0.9198855,0.00041688347,0.05489954,0.00019981789,0.000096946926,0.00015984396,0.0018992433,0.00014196195,0.022300245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925774,0.00013274433,0.000057890527,0.00018899639,0.00021269609,0.00014984647],"domain_scores_gemma":[0.999089,0.00029437445,0.00013341417,0.00016668346,0.000119286204,0.00019721268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038403386,0.00038431113,0.0003827682,0.0014027768,0.0008926462,0.0018965057,0.00060222065,0.00040066897,0.0041790437],"category_scores_gemma":[0.0011217314,0.00027588708,0.00045341538,0.001342388,0.0015123154,0.0025557068,0.001106244,0.000618066,0.0005533746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008350519,0.00006484742,0.0016825172,0.00009142486,0.0000121189705,0.0004665494,0.0008037247,0.005453259,0.009544767,0.9552295,0.001070984,0.025496906],"study_design_scores_gemma":[0.00002125869,0.00007108003,0.0019540442,0.000036746085,0.000021424647,0.0004902231,0.00033062792,0.023528667,0.008450532,0.95171875,0.013345645,0.0000309614],"about_ca_topic_score_codex":0.0012595772,"about_ca_topic_score_gemma":0.003021883,"teacher_disagreement_score":0.0041790437,"about_ca_system_score_codex":0.0010761557,"about_ca_system_score_gemma":0.00056082115,"threshold_uncertainty_score":0.013980269},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70764416,0.0034891285,0.116009034,0.0012753132,0.00030128437,0.00015166406,0.000601644,0.0005290863,0.16999857],"genre_scores_gemma":[0.96419173,0.0012515661,0.020538395,0.00036817387,0.0001916915,0.00009760764,0.0007103196,0.00007179285,0.012578655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945587,0.00010441333,0.0000308264,0.000116848205,0.000167915,0.00012410725],"domain_scores_gemma":[0.9989837,0.0003625197,0.00013884254,0.00014863249,0.00021484306,0.00015149624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035945346,0.00039816846,0.00034384517,0.0021118873,0.0013494433,0.0017642817,0.0007294606,0.00075431616,0.004089295],"category_scores_gemma":[0.0016713269,0.0002966382,0.00039321894,0.001544869,0.0014227912,0.0015866116,0.000800259,0.00082673645,0.00054965337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022772498,0.000022282768,0.00077689847,0.000039276976,0.000007631964,0.000119835604,0.00020170092,0.0014695965,0.0021715935,0.97750014,0.0023822454,0.015286107],"study_design_scores_gemma":[0.000017943321,0.000030112258,0.001258195,0.00003268574,0.000015318094,0.0005952581,0.00025675338,0.024785357,0.0016182705,0.9576268,0.013734543,0.000028812456],"about_ca_topic_score_codex":0.0014948908,"about_ca_topic_score_gemma":0.0017378482,"teacher_disagreement_score":0.004089295,"about_ca_system_score_codex":0.0007624425,"about_ca_system_score_gemma":0.00053096586,"threshold_uncertainty_score":0.013680041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.842145,0.0012120099,0.07952187,0.0013479413,0.00021297742,0.00007387526,0.0012634703,0.0005609405,0.07366198],"genre_scores_gemma":[0.9735826,0.0005296147,0.014840725,0.0001826444,0.00010605635,0.00007678262,0.0007850828,0.000100170735,0.009796312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.000059257185,0.00002651058,0.00014324623,0.000112225185,0.0001668329],"domain_scores_gemma":[0.99737847,0.0013147533,0.00027112899,0.00048616147,0.00023348404,0.00031607805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004423485,0.00040315377,0.0003668708,0.0012040656,0.0012851678,0.002289493,0.0009089741,0.00060043705,0.0082140975],"category_scores_gemma":[0.002865214,0.0002918591,0.00036552746,0.0010856745,0.0020041943,0.0026045488,0.0013545384,0.0010859469,0.0009260675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058305735,0.000104045605,0.009106693,0.00028627974,0.000057736666,0.00035234814,0.00087131636,0.04452435,0.04844002,0.8344401,0.012762799,0.04847128],"study_design_scores_gemma":[0.000095492534,0.00017327849,0.0059768655,0.000108345805,0.00007248129,0.00066962454,0.00052743836,0.13399369,0.03391106,0.7902988,0.03405468,0.00011821785],"about_ca_topic_score_codex":0.0035074311,"about_ca_topic_score_gemma":0.004981459,"teacher_disagreement_score":0.0082140975,"about_ca_system_score_codex":0.0019307863,"about_ca_system_score_gemma":0.00082832575,"threshold_uncertainty_score":0.027478874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6824678,0.0023618315,0.16845833,0.0043608216,0.0010988456,0.00016007789,0.001279746,0.00095095066,0.13886155],"genre_scores_gemma":[0.9041,0.0009517844,0.05678061,0.0006407632,0.00061322085,0.00020375915,0.00075224735,0.0004058697,0.035551723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995937,0.000039947165,0.000029726243,0.00013508709,0.00008037292,0.00012127666],"domain_scores_gemma":[0.9983296,0.0007943963,0.00021305717,0.000122031364,0.00030403642,0.00023694555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038552957,0.00087632606,0.0006967856,0.0010879164,0.001571532,0.0024598727,0.00054095255,0.00090429286,0.008086525],"category_scores_gemma":[0.0018711977,0.0004177614,0.00051727373,0.0008448416,0.0022858602,0.004067187,0.001580459,0.0019694655,0.0017837428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007909245,0.00011819858,0.003124896,0.0004387022,0.000041253013,0.0025251925,0.002401185,0.0007547425,0.07177786,0.866151,0.009069729,0.042806365],"study_design_scores_gemma":[0.00008944086,0.00011609075,0.003876403,0.00016383274,0.000060227427,0.0026270973,0.0010150404,0.0055348845,0.02759278,0.89940226,0.059440378,0.00008141213],"about_ca_topic_score_codex":0.0005015762,"about_ca_topic_score_gemma":0.000556855,"teacher_disagreement_score":0.008086525,"about_ca_system_score_codex":0.00084635476,"about_ca_system_score_gemma":0.00044940048,"threshold_uncertainty_score":0.027052164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267858,0.0020309475,0.31307974,0.0007642261,0.00019351576,0.00015815895,0.0007386422,0.0009356093,0.055313356],"genre_scores_gemma":[0.9530644,0.0008574119,0.039266016,0.0002076857,0.00016836954,0.00009803251,0.00066288834,0.00019077296,0.005484409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870586,0.0002061668,0.000093668896,0.00040417968,0.00024661078,0.00034349717],"domain_scores_gemma":[0.99649566,0.0017581268,0.00038965626,0.00045396658,0.00041414562,0.00048846303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118689,0.0011361516,0.00091627485,0.0022100452,0.0024703082,0.0026172043,0.000923024,0.0013411855,0.007239416],"category_scores_gemma":[0.008011156,0.0005629838,0.0016189411,0.0019582906,0.0041113426,0.005073628,0.002142355,0.0018641806,0.0010519285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042721373,0.00007435985,0.0029475947,0.0001665835,0.000032027678,0.0004383641,0.0009025547,0.009026515,0.005067549,0.9601505,0.0022280838,0.018538667],"study_design_scores_gemma":[0.000051843726,0.0001228951,0.0012742997,0.00007529777,0.00007070482,0.000716125,0.0006445869,0.030662483,0.007139014,0.94941086,0.009763074,0.00006886647],"about_ca_topic_score_codex":0.0041939733,"about_ca_topic_score_gemma":0.003213437,"teacher_disagreement_score":0.007239416,"about_ca_system_score_codex":0.001570831,"about_ca_system_score_gemma":0.00085649046,"threshold_uncertainty_score":0.024218202},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115466416,0.009116141,0.6173172,0.007518235,0.0009912134,0.0001617464,0.0008451588,0.0007510416,0.24783282],"genre_scores_gemma":[0.81887215,0.009801774,0.112736106,0.0019298185,0.0015643551,0.0004124995,0.0009284121,0.00053072727,0.053224206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999181,0.00013119112,0.000042464773,0.00023435414,0.00028102042,0.00012991582],"domain_scores_gemma":[0.9968958,0.0012957773,0.0003363987,0.00046430324,0.00067446934,0.00033324456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013124283,0.0009254624,0.0007913566,0.0035992346,0.0019515295,0.002808291,0.0012580539,0.0013457092,0.006677791],"category_scores_gemma":[0.007304503,0.0005840637,0.0018007827,0.0022864193,0.0056096935,0.011032518,0.0055472045,0.004603765,0.001181758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089711575,0.0000035393896,0.000085230335,0.00004772338,0.0000051443776,0.00004660618,0.00020627012,0.0006061792,0.00036824282,0.9916943,0.0011443037,0.005783502],"study_design_scores_gemma":[0.000006495502,0.00001183821,0.00020987252,0.000020669768,0.000009316674,0.00013429164,0.00012117647,0.0015606958,0.0006640701,0.9854247,0.011821796,0.000015132683],"about_ca_topic_score_codex":0.0014109596,"about_ca_topic_score_gemma":0.0010365058,"teacher_disagreement_score":0.006677791,"about_ca_system_score_codex":0.0013547945,"about_ca_system_score_gemma":0.000728804,"threshold_uncertainty_score":0.022339404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43212205,0.00018178139,0.55452365,0.0003966599,0.00006290104,0.00032310802,0.0009184709,0.004460607,0.007010824],"genre_scores_gemma":[0.6495495,0.00008365296,0.343399,0.00017536628,0.000018818318,0.00025306203,0.0026641262,0.0004414716,0.0034150071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934036,0.00016433305,0.000033784727,0.00017164076,0.00017748824,0.00011225836],"domain_scores_gemma":[0.9975314,0.0010756213,0.0001361395,0.00085639715,0.00027347592,0.00012684007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067259354,0.00041798025,0.00049341354,0.00070384296,0.00045703023,0.00047302368,0.0011560979,0.0005522565,0.0030137815],"category_scores_gemma":[0.0045122486,0.00043215707,0.0007392221,0.0007680518,0.00059508224,0.0009731361,0.0012634053,0.00041787012,0.00061720534],"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.0016962922,0.0004871371,0.016130447,0.00060509384,0.0001916694,0.00077458395,0.0009343168,0.29641595,0.15604065,0.083926216,0.023387311,0.4194104],"study_design_scores_gemma":[0.00014830283,0.00017028594,0.0016702249,0.000016559696,0.000040068713,0.0003326357,0.00015521873,0.9192558,0.04502311,0.028991282,0.0041734185,0.000023129784],"about_ca_topic_score_codex":0.002188338,"about_ca_topic_score_gemma":0.0045440863,"teacher_disagreement_score":0.0030137815,"about_ca_system_score_codex":0.00070889853,"about_ca_system_score_gemma":0.00065561663,"threshold_uncertainty_score":0.010082126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6400264,0.0014104111,0.28416732,0.0012692653,0.0001888245,0.00007154984,0.0006659883,0.00075706484,0.07144326],"genre_scores_gemma":[0.95145905,0.0011450672,0.036542643,0.0003498923,0.00013976393,0.00008551896,0.0010138253,0.00018883205,0.00907556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999316,0.00010873135,0.000028275088,0.00014084658,0.00024305072,0.00016317761],"domain_scores_gemma":[0.99589044,0.0022628452,0.000489892,0.00054603367,0.00038394495,0.0004269421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034550493,0.00035567352,0.00038180716,0.00081078825,0.0009682978,0.0013152813,0.0013377481,0.00067990675,0.00713051],"category_scores_gemma":[0.004383533,0.0005238431,0.0005540496,0.0013037856,0.00096619804,0.0032671993,0.0018112495,0.0018364717,0.001249985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022541567,0.00015244547,0.0036036114,0.00039296434,0.000040077313,0.0008242202,0.0011500836,0.017873887,0.019514399,0.91003853,0.0071579283,0.03902636],"study_design_scores_gemma":[0.000059338774,0.00009996326,0.0023393047,0.00006707338,0.00006124166,0.0010067385,0.00029165595,0.067630015,0.012124197,0.8987558,0.017537028,0.000027757787],"about_ca_topic_score_codex":0.0010875672,"about_ca_topic_score_gemma":0.0018454047,"teacher_disagreement_score":0.00713051,"about_ca_system_score_codex":0.00077655044,"about_ca_system_score_gemma":0.00031977563,"threshold_uncertainty_score":0.023853898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8585574,0.0013377939,0.106465355,0.0018087497,0.000105333966,0.00009922995,0.00039246987,0.00036131375,0.030872416],"genre_scores_gemma":[0.98206204,0.0007637033,0.013235097,0.00022384293,0.00011095928,0.00018105721,0.00020596829,0.00008503252,0.0031323005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993512,0.00026581637,0.0000323563,0.00011553581,0.00011150671,0.00012351206],"domain_scores_gemma":[0.98819155,0.008167058,0.0012655014,0.00072826556,0.00054305245,0.001104555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011647003,0.00056536484,0.000973701,0.0016192355,0.0014877314,0.0017230527,0.0013642431,0.0011506572,0.0046731047],"category_scores_gemma":[0.014068692,0.0007587966,0.00050610665,0.0009805103,0.0026828505,0.0027949095,0.0016482812,0.0009101268,0.00048223796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028978175,0.00011925226,0.0036169784,0.00030703412,0.00007234429,0.00081221404,0.00040581357,0.038561333,0.005360884,0.9319291,0.004522105,0.0140031725],"study_design_scores_gemma":[0.00016799,0.00012965142,0.001762954,0.00009257281,0.000044711185,0.00046278196,0.0001980318,0.22379424,0.0017931713,0.7687581,0.00273814,0.00005760873],"about_ca_topic_score_codex":0.0014702387,"about_ca_topic_score_gemma":0.0016472177,"teacher_disagreement_score":0.0046731047,"about_ca_system_score_codex":0.0011905641,"about_ca_system_score_gemma":0.00093825767,"threshold_uncertainty_score":0.015633047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176355,0.0009935445,0.15546753,0.00094995595,0.00006643557,0.00010207895,0.0009469258,0.00055398047,0.023284012],"genre_scores_gemma":[0.96827,0.0006648208,0.025024688,0.0002661667,0.000074391064,0.00014146134,0.001503332,0.00011526309,0.003939814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982968,0.00045947664,0.00011129816,0.00055139035,0.00026047527,0.0003206208],"domain_scores_gemma":[0.99296653,0.002924666,0.0013645225,0.00091124274,0.0007973008,0.0010356434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013262111,0.00047399415,0.00066644786,0.0020122249,0.0018200679,0.0016868367,0.0009904399,0.0010279332,0.005561801],"category_scores_gemma":[0.005952646,0.00086393824,0.000933264,0.00155955,0.0020946236,0.0035006478,0.0024763555,0.0017805549,0.0006614572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044891555,0.00013632988,0.010625857,0.00032161648,0.00008802665,0.0010226751,0.0022281217,0.019653197,0.016973412,0.9102245,0.0053745764,0.032902848],"study_design_scores_gemma":[0.000093903574,0.00024143026,0.0043527815,0.00012934284,0.0000657974,0.002653277,0.0015375223,0.057536133,0.005794182,0.9115051,0.01601229,0.00007824701],"about_ca_topic_score_codex":0.0020909032,"about_ca_topic_score_gemma":0.0019099333,"teacher_disagreement_score":0.005561801,"about_ca_system_score_codex":0.0015906685,"about_ca_system_score_gemma":0.0005734748,"threshold_uncertainty_score":0.018606067},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6661313,0.00036068846,0.22102515,0.003287252,0.0002511771,0.0004879005,0.0015498261,0.0008100201,0.106096774],"genre_scores_gemma":[0.962946,0.0002934653,0.022707654,0.0005383193,0.00014311391,0.0005936026,0.0009610041,0.00012486307,0.011691901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961908,0.00052826735,0.00033179193,0.0009967803,0.0007314625,0.0012208777],"domain_scores_gemma":[0.9687255,0.01613794,0.0029985306,0.0028913764,0.0034453159,0.0058013285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038627451,0.0008066526,0.0016595853,0.0024567216,0.0025620721,0.003446628,0.0033126022,0.0033540288,0.012629128],"category_scores_gemma":[0.026691774,0.0012450372,0.0014547269,0.001390795,0.0040886053,0.0064239833,0.0068265437,0.0024031491,0.0023735205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008040795,0.00028606344,0.0049922457,0.00033145386,0.00009238033,0.0011487401,0.0015719513,0.014854462,0.02006975,0.94068897,0.006468454,0.008691503],"study_design_scores_gemma":[0.0005879974,0.00035191615,0.0025515999,0.00011757127,0.00015161838,0.0009952793,0.0012097454,0.12403051,0.009464554,0.8503303,0.010053086,0.00015575706],"about_ca_topic_score_codex":0.0022313283,"about_ca_topic_score_gemma":0.0020734782,"teacher_disagreement_score":0.012629128,"about_ca_system_score_codex":0.0016844141,"about_ca_system_score_gemma":0.0022410196,"threshold_uncertainty_score":0.042248607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9276103,0.00046323703,0.05627646,0.00015339511,0.000031483447,0.00002399302,0.00020064315,0.000072700226,0.01516778],"genre_scores_gemma":[0.9782804,0.00026570002,0.01774179,0.000034294913,0.000027409282,0.00002394404,0.00023140978,0.00001825065,0.003376828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950504,0.000089350484,0.00003086495,0.00010557861,0.00015678463,0.00011231285],"domain_scores_gemma":[0.99889886,0.0003518411,0.00041634234,0.00012214485,0.00009255384,0.00011835716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002456534,0.00030330982,0.00023438866,0.001073918,0.000742458,0.0013697605,0.00032511642,0.0003570486,0.002899829],"category_scores_gemma":[0.0015466087,0.00021164831,0.00021684261,0.00088229607,0.0012044854,0.0016260721,0.0010000117,0.0007395941,0.00023535249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027044493,0.000066160705,0.008736416,0.00017665818,0.000033328502,0.0007469254,0.00097025523,0.025346987,0.014207068,0.8947277,0.0008676654,0.05385041],"study_design_scores_gemma":[0.0000559259,0.00042185903,0.008389253,0.000113109025,0.000051779607,0.0020193704,0.0013017417,0.06902016,0.026982434,0.8635465,0.028006045,0.00009196638],"about_ca_topic_score_codex":0.00058011716,"about_ca_topic_score_gemma":0.00076372264,"teacher_disagreement_score":0.002899829,"about_ca_system_score_codex":0.0005290252,"about_ca_system_score_gemma":0.00033231743,"threshold_uncertainty_score":0.009700894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8326344,0.0019648566,0.1185606,0.001876135,0.0000763053,0.00002522293,0.0003973024,0.000205226,0.04425988],"genre_scores_gemma":[0.9907845,0.00097404467,0.00534056,0.0001179367,0.00014971888,0.000031533866,0.00022894658,0.00007236563,0.0023002704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990903,0.00021408629,0.00002533246,0.00017040585,0.00020823501,0.00029163086],"domain_scores_gemma":[0.99533206,0.0027696046,0.000540471,0.00039692488,0.00046297273,0.0004978967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012870738,0.00046528375,0.0007832305,0.0032741325,0.0019071647,0.002726599,0.001413305,0.0006847937,0.0036092522],"category_scores_gemma":[0.005752747,0.00036182592,0.0006229384,0.0029323618,0.0052324,0.003766446,0.0022668983,0.0023994846,0.000455141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005499004,0.000019716057,0.0019455358,0.000028459652,0.0000057730963,0.00006765103,0.00030487258,0.0037340147,0.00076916104,0.98482394,0.0007097138,0.007536241],"study_design_scores_gemma":[0.000017821232,0.00003398993,0.0021003622,0.000042245676,0.000012373093,0.00023231357,0.0003413859,0.04283565,0.0018643526,0.94874567,0.0037358452,0.000038001694],"about_ca_topic_score_codex":0.0029743793,"about_ca_topic_score_gemma":0.0010507717,"teacher_disagreement_score":0.0036092522,"about_ca_system_score_codex":0.003064486,"about_ca_system_score_gemma":0.00087768404,"threshold_uncertainty_score":0.0222345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69335455,0.000853697,0.18877451,0.0026711458,0.0003262849,0.00015809195,0.00097122614,0.00047104477,0.11241945],"genre_scores_gemma":[0.96536034,0.00076164224,0.021861825,0.00050502445,0.00017134254,0.00014963231,0.0008282764,0.00010685899,0.010254951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999033,0.00013291345,0.000058058504,0.00038362583,0.00017881948,0.00021363836],"domain_scores_gemma":[0.996278,0.001637146,0.0005776556,0.0007288114,0.00038400316,0.00039443665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011281467,0.00055251975,0.0008199473,0.0010968444,0.0018530233,0.0026762993,0.0012691341,0.000843244,0.0050379727],"category_scores_gemma":[0.005346029,0.00050855096,0.0009851167,0.0009616544,0.0025924079,0.0052705854,0.0029909883,0.0019003528,0.0007444165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002625858,0.00006903395,0.0020888739,0.00018022816,0.00003551825,0.00028665425,0.0005310448,0.0037958792,0.0057056495,0.97129256,0.002916909,0.012835049],"study_design_scores_gemma":[0.0000720387,0.000075043245,0.0013275684,0.000048541937,0.00006577791,0.00044641824,0.00038223798,0.021542585,0.005832476,0.9589488,0.011223013,0.00003555728],"about_ca_topic_score_codex":0.0015782252,"about_ca_topic_score_gemma":0.0015830615,"teacher_disagreement_score":0.0050379727,"about_ca_system_score_codex":0.001116203,"about_ca_system_score_gemma":0.0009967772,"threshold_uncertainty_score":0.01685369},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34960386,0.0009522078,0.5526048,0.0020667189,0.00048669067,0.000085412306,0.0006448981,0.0007182934,0.09283713],"genre_scores_gemma":[0.87931234,0.0005623217,0.08200028,0.0009392774,0.00033446265,0.00017234626,0.0008830817,0.0005131727,0.035282757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984717,0.00036848197,0.000068527086,0.00033664895,0.0005030889,0.0002514683],"domain_scores_gemma":[0.9960758,0.0020798552,0.0004897314,0.0005646986,0.00049450056,0.00029538738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010899969,0.0012118967,0.00070390233,0.00086167787,0.00084756536,0.0019815962,0.0011290332,0.0008066134,0.008793336],"category_scores_gemma":[0.0077129733,0.00043057825,0.0007513464,0.00081469654,0.002799023,0.002761294,0.0030400672,0.0024541086,0.003176058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011102703,0.000051860705,0.00095358014,0.00010308246,0.000021457989,0.00027934538,0.0003246049,0.0061417227,0.003925693,0.96810436,0.0053565586,0.014626715],"study_design_scores_gemma":[0.000027805449,0.000060770108,0.00039106078,0.000029964387,0.000012271539,0.0003106112,0.000105660496,0.048432272,0.0053507723,0.93895423,0.0062984284,0.000026050375],"about_ca_topic_score_codex":0.000866085,"about_ca_topic_score_gemma":0.0010620807,"teacher_disagreement_score":0.008793336,"about_ca_system_score_codex":0.00071816595,"about_ca_system_score_gemma":0.00071830896,"threshold_uncertainty_score":0.02941662},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21636517,0.010130638,0.47895688,0.010874186,0.00072979485,0.00026501584,0.0033806895,0.0029109989,0.27638644],"genre_scores_gemma":[0.8900531,0.004328734,0.07608929,0.0015268642,0.0010044102,0.0005404883,0.0015162757,0.0013311852,0.023609692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951959,0.0007370309,0.0001129489,0.0012993286,0.0014822484,0.0011725433],"domain_scores_gemma":[0.97316134,0.01823188,0.0011492445,0.0041115247,0.001607301,0.0017387406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030648296,0.001726187,0.0017366854,0.0035721667,0.0030057272,0.005393677,0.0036358468,0.001888254,0.016557237],"category_scores_gemma":[0.020661864,0.001570567,0.0012260274,0.003917299,0.0055204853,0.010713137,0.0053961743,0.006735521,0.0025641383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005902883,0.00025357204,0.0024778985,0.00043177494,0.000099597666,0.00026383973,0.00048567046,0.07862829,0.0148582775,0.84758484,0.0214694,0.032856546],"study_design_scores_gemma":[0.00007298734,0.00006336861,0.0019260631,0.00013453032,0.00006499892,0.00021047404,0.000115618466,0.13500482,0.005553342,0.84149057,0.015289607,0.00007359628],"about_ca_topic_score_codex":0.009048583,"about_ca_topic_score_gemma":0.014802469,"teacher_disagreement_score":0.016557237,"about_ca_system_score_codex":0.006725868,"about_ca_system_score_gemma":0.002547188,"threshold_uncertainty_score":0.055389524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92517114,0.000589234,0.04893769,0.00032408396,0.00006473386,0.000022683493,0.00036894143,0.00018821038,0.024333239],"genre_scores_gemma":[0.9779425,0.00016751736,0.015273467,0.00008214956,0.00007078454,0.000070057155,0.0003538488,0.000081063445,0.0059585813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.00011073006,0.000054977176,0.000151289,0.00014306158,0.00017071227],"domain_scores_gemma":[0.9976942,0.0010560259,0.0003943372,0.00022472706,0.0002532365,0.0003774422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040589305,0.00041804306,0.00037301268,0.000932158,0.0011932561,0.0014133367,0.00058645423,0.0005654236,0.004975726],"category_scores_gemma":[0.0028041308,0.00038515488,0.00032892526,0.00068138895,0.0013581979,0.0017555987,0.0015547955,0.0008584686,0.0006807613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060088915,0.000091007874,0.0033947295,0.00024726923,0.000027783535,0.0008991394,0.0011014753,0.006424328,0.029392887,0.9303308,0.0023891968,0.025100417],"study_design_scores_gemma":[0.00006899303,0.00015602869,0.0039970893,0.0000949477,0.00005512399,0.0018205532,0.00079305907,0.033498764,0.0235154,0.92086715,0.015031006,0.000101870624],"about_ca_topic_score_codex":0.00015304814,"about_ca_topic_score_gemma":0.00023603789,"teacher_disagreement_score":0.004975726,"about_ca_system_score_codex":0.00048737583,"about_ca_system_score_gemma":0.0002364492,"threshold_uncertainty_score":0.016645491},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12158562,0.010027428,0.3228449,0.0014981795,0.0011370364,0.00026615374,0.0015377076,0.0015326339,0.53957033],"genre_scores_gemma":[0.7412559,0.004868356,0.16224578,0.000930983,0.00030677058,0.00024423315,0.0012253737,0.00026166035,0.088661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960345,0.00007506414,0.000022185151,0.00010844693,0.000119610035,0.00007126599],"domain_scores_gemma":[0.99960166,0.00012708332,0.000041529664,0.000103127415,0.00007981497,0.00004674193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013642696,0.00029987152,0.00048521688,0.000855811,0.0010578664,0.00181745,0.0005721434,0.0008308273,0.01901156],"category_scores_gemma":[0.0011271863,0.00026279473,0.00045756774,0.00093245826,0.0012425801,0.0017045919,0.0012938189,0.00078544323,0.0036445963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071646245,0.000021876975,0.00042720424,0.00027152657,0.000019881028,0.0003710185,0.00023839642,0.0038707296,0.012455703,0.9020215,0.013781994,0.06644863],"study_design_scores_gemma":[0.00004065788,0.000110838555,0.00086236116,0.00012238699,0.000023660297,0.0019280629,0.00030687344,0.018213833,0.013034392,0.58561766,0.37968782,0.000051457],"about_ca_topic_score_codex":0.00046551094,"about_ca_topic_score_gemma":0.0006554861,"teacher_disagreement_score":0.01901156,"about_ca_system_score_codex":0.00034535132,"about_ca_system_score_gemma":0.00021827786,"threshold_uncertainty_score":0.0636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7818936,0.0002540041,0.17569849,0.00058952824,0.00010465904,0.00012341107,0.00083281635,0.0007884202,0.039715003],"genre_scores_gemma":[0.9278327,0.00014080213,0.06363065,0.00015917388,0.00004645779,0.00005705329,0.0005332931,0.000090741516,0.0075091785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935013,0.000109030385,0.000028951572,0.00013739424,0.00016341227,0.00021104972],"domain_scores_gemma":[0.99783784,0.00076943956,0.00031884582,0.00052695174,0.00033865156,0.00020830962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031515793,0.00049047737,0.00044287933,0.00097074197,0.0011940122,0.00087763177,0.0005080841,0.00046508582,0.0058171377],"category_scores_gemma":[0.0022906077,0.00039688495,0.0006879295,0.00063836586,0.0015011381,0.0011669969,0.00054274546,0.00095099135,0.00066785625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038796922,0.00022488889,0.0054151732,0.00025838875,0.00006962323,0.0016622351,0.0010056355,0.042612042,0.08486695,0.8126015,0.0070893015,0.043806195],"study_design_scores_gemma":[0.00006372307,0.00020212271,0.0039140107,0.000046555753,0.000043248725,0.0010888159,0.0004327511,0.078564055,0.040562835,0.8605222,0.014471541,0.00008817592],"about_ca_topic_score_codex":0.0016178087,"about_ca_topic_score_gemma":0.0031915968,"teacher_disagreement_score":0.0058171377,"about_ca_system_score_codex":0.00055538036,"about_ca_system_score_gemma":0.0007731226,"threshold_uncertainty_score":0.01946026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84664625,0.0002669735,0.12851678,0.00032581168,0.00008972434,0.00006021435,0.00041932674,0.00027999535,0.023395048],"genre_scores_gemma":[0.98231953,0.00014656447,0.010968555,0.000051925086,0.00004138822,0.00002918528,0.00017289404,0.00009957354,0.0061704037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952173,0.00007284146,0.0000117200925,0.000099075434,0.00012299391,0.00017173872],"domain_scores_gemma":[0.99852604,0.0006804162,0.00023287401,0.00016083692,0.00022487839,0.00017501108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004240753,0.0003246772,0.0002785356,0.0013397742,0.00060030434,0.0015720587,0.0007016172,0.00044175715,0.004094271],"category_scores_gemma":[0.0028685264,0.00022934309,0.00041989717,0.0010075412,0.0016645303,0.0015444241,0.0010023729,0.0011230947,0.00048387353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018910877,0.000059815353,0.0036599943,0.000115026276,0.000020560703,0.00026019005,0.0010558696,0.037496623,0.029566966,0.90271914,0.002526304,0.022330299],"study_design_scores_gemma":[0.000046648955,0.0000816037,0.008620586,0.0000374743,0.000018818211,0.000480453,0.00033011337,0.13300347,0.013592092,0.83489436,0.00878795,0.00010637112],"about_ca_topic_score_codex":0.0025720862,"about_ca_topic_score_gemma":0.0032510245,"teacher_disagreement_score":0.004094271,"about_ca_system_score_codex":0.0013735383,"about_ca_system_score_gemma":0.000533143,"threshold_uncertainty_score":0.01369673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49651012,0.002013605,0.14343123,0.0021239268,0.00084777357,0.00006176792,0.00071887294,0.00042951293,0.35386318],"genre_scores_gemma":[0.939628,0.00048298686,0.013596318,0.00037281352,0.00023799091,0.000049664446,0.0003048479,0.00017703178,0.045150314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993268,0.00012679238,0.000031086685,0.00015558768,0.00020145315,0.00015828671],"domain_scores_gemma":[0.9993431,0.00018349798,0.000078586825,0.00010474992,0.00015641829,0.00013362283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042644783,0.0003473165,0.000483067,0.0010943698,0.0014145641,0.0016786844,0.0006362555,0.0004906237,0.0084610265],"category_scores_gemma":[0.0017888781,0.00024134346,0.00052932935,0.00078192883,0.0030453221,0.0020326104,0.0020580373,0.0015387139,0.0013210928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014751411,0.0000052513874,0.00024178311,0.000012639626,0.000002524155,0.000058259448,0.00013512194,0.00034484928,0.00093370024,0.99089736,0.0011133887,0.0062404755],"study_design_scores_gemma":[0.0000129377195,0.000030458565,0.0008369511,0.000015833404,0.0000060737766,0.00027954526,0.00011373197,0.003534024,0.0011264761,0.97167844,0.02234397,0.00002166334],"about_ca_topic_score_codex":0.0009518679,"about_ca_topic_score_gemma":0.0014050511,"teacher_disagreement_score":0.0084610265,"about_ca_system_score_codex":0.0010720994,"about_ca_system_score_gemma":0.00035384958,"threshold_uncertainty_score":0.028304935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5536583,0.0010186173,0.4092245,0.002133865,0.0003637053,0.00021037104,0.0008950012,0.0029164779,0.029579038],"genre_scores_gemma":[0.88000995,0.00027723092,0.109903924,0.00039329665,0.00018944617,0.00054867886,0.0006240903,0.00058799254,0.0074653383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611926,0.0007381052,0.00061793224,0.0011383574,0.00088283204,0.00050342525],"domain_scores_gemma":[0.97644126,0.015283456,0.002552456,0.0022292726,0.0019926198,0.0015009202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023605803,0.00070830795,0.0010355568,0.0015360424,0.0023365193,0.004189397,0.0015887416,0.0017605091,0.0073507517],"category_scores_gemma":[0.019980932,0.001005821,0.0014819871,0.0013776139,0.0033068748,0.007959577,0.0031230918,0.002563225,0.001511076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010246744,0.00014870407,0.003947425,0.00040591697,0.00006647629,0.0005844106,0.0033986866,0.025454322,0.023277663,0.9042148,0.0027802528,0.034696568],"study_design_scores_gemma":[0.000112485395,0.00015383643,0.00079009234,0.000089749534,0.00006163679,0.00032338084,0.000431434,0.07254755,0.010372418,0.90989274,0.005128658,0.00009598519],"about_ca_topic_score_codex":0.0006475195,"about_ca_topic_score_gemma":0.0009059272,"teacher_disagreement_score":0.0073507517,"about_ca_system_score_codex":0.0024014898,"about_ca_system_score_gemma":0.0011244222,"threshold_uncertainty_score":0.024590671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8242471,0.0005773958,0.1676341,0.00036742416,0.00005655493,0.00005966741,0.00029748754,0.00037984195,0.0063802786],"genre_scores_gemma":[0.98576385,0.00026260823,0.011994288,0.000081992155,0.000053030937,0.00006215687,0.00032301425,0.00010255082,0.0013565094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986979,0.00041564435,0.000043471337,0.0003453216,0.00033108756,0.00016659341],"domain_scores_gemma":[0.98432827,0.009968232,0.0023502032,0.0016667647,0.0010468464,0.0006396645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014157075,0.0004233509,0.00067600707,0.002369662,0.0006166109,0.0012608058,0.002091396,0.0010918191,0.0027123722],"category_scores_gemma":[0.019566452,0.00045070358,0.0004308451,0.001615955,0.0018628121,0.0037513697,0.0011408738,0.00091072405,0.00036626068],"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.0007032851,0.00015871681,0.034606643,0.000352108,0.00014209506,0.0014776041,0.0008670418,0.39808455,0.030736292,0.4955273,0.004232394,0.033111945],"study_design_scores_gemma":[0.000034152217,0.00007370185,0.0040556397,0.000029727957,0.000023295208,0.00061566784,0.0001361813,0.8499706,0.005814543,0.13801378,0.0011882551,0.000044405384],"about_ca_topic_score_codex":0.0012455893,"about_ca_topic_score_gemma":0.0012813343,"teacher_disagreement_score":0.0027123722,"about_ca_system_score_codex":0.0008195993,"about_ca_system_score_gemma":0.00015878255,"threshold_uncertainty_score":0.009073794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9312056,0.0001785831,0.050192516,0.00019473583,0.000012736039,0.000029897217,0.00047677325,0.00015082872,0.017558305],"genre_scores_gemma":[0.9759278,0.000076711236,0.021407213,0.000025954332,0.000013852108,0.00004360807,0.0005406823,0.000034483142,0.0019296637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969757,0.000038909675,0.000023072225,0.00008429156,0.000096889176,0.000059200123],"domain_scores_gemma":[0.9994863,0.00015969152,0.00013489943,0.00007920449,0.000060723967,0.00007906759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013351075,0.00021959172,0.0004184463,0.0008978383,0.0009080514,0.0014831737,0.00052536646,0.00030527439,0.0024414745],"category_scores_gemma":[0.0011627764,0.0002758253,0.000328919,0.0006172318,0.0011104721,0.0011440483,0.0009956895,0.0004481594,0.00026103196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005087872,0.00010229082,0.01017852,0.00018862201,0.00004324703,0.00053333485,0.0006675405,0.021782303,0.0523372,0.8734876,0.0019684858,0.038202174],"study_design_scores_gemma":[0.00013204168,0.00018037857,0.008496,0.000056871384,0.00007103251,0.0016229992,0.0013683789,0.082431704,0.04683747,0.843278,0.01545688,0.00006830485],"about_ca_topic_score_codex":0.00079915853,"about_ca_topic_score_gemma":0.0008190064,"teacher_disagreement_score":0.0024414745,"about_ca_system_score_codex":0.00053682283,"about_ca_system_score_gemma":0.00029871447,"threshold_uncertainty_score":0.008167505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5473672,0.0012348922,0.15644264,0.0017645088,0.00075252756,0.00011496126,0.0007905804,0.0004617721,0.29107088],"genre_scores_gemma":[0.9372068,0.0006388001,0.015848588,0.00037257487,0.00044710387,0.000074605414,0.00039232327,0.000119594566,0.044899598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905306,0.00016498637,0.0000654378,0.00018799836,0.00025767914,0.00027078632],"domain_scores_gemma":[0.9986877,0.00039701318,0.00018558206,0.00015753749,0.00027431018,0.00029789665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054944697,0.00038802045,0.0004001193,0.0015025809,0.0022807426,0.0035251633,0.00040280342,0.0005837821,0.009055205],"category_scores_gemma":[0.0018648072,0.0002791657,0.00052232214,0.0011436027,0.003190881,0.0046766703,0.0022008114,0.001224691,0.0013684566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021658938,0.000009953438,0.00022714277,0.000012840526,0.0000012931397,0.00006687998,0.00021351219,0.00024965935,0.0008161578,0.99364495,0.00051583815,0.0042200675],"study_design_scores_gemma":[0.000015586262,0.000067088346,0.00056775694,0.00002512121,0.000007149064,0.0003087253,0.00040774661,0.0034215958,0.0023053663,0.97250056,0.020350022,0.000023168137],"about_ca_topic_score_codex":0.0017332854,"about_ca_topic_score_gemma":0.0016782561,"teacher_disagreement_score":0.009055205,"about_ca_system_score_codex":0.001040046,"about_ca_system_score_gemma":0.0009233789,"threshold_uncertainty_score":0.03029263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57039654,0.00039067795,0.25982496,0.0007459599,0.00037850536,0.000094626426,0.00027534616,0.00054673915,0.16734666],"genre_scores_gemma":[0.9573795,0.00022974178,0.02542663,0.00024174215,0.00015498891,0.00003189355,0.000118326585,0.00014892919,0.016268201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00006135107,0.00002593656,0.00008554981,0.00023531394,0.00007473909],"domain_scores_gemma":[0.9996387,0.00006386664,0.000050236562,0.00008649541,0.00009619078,0.00006446947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225973,0.0001999349,0.00030537107,0.00083969586,0.00089090597,0.0014247315,0.0006351413,0.0003969894,0.003245087],"category_scores_gemma":[0.00082972675,0.00019215657,0.00042283247,0.0005029536,0.0018779517,0.0016197745,0.0008810385,0.0011023134,0.0006792202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008671123,0.0000076459655,0.00020828703,0.000010314688,0.000002121374,0.0001146494,0.000086214466,0.000515393,0.0037110434,0.98917156,0.0006560371,0.005508094],"study_design_scores_gemma":[0.000009893659,0.000030455096,0.0008637662,0.000007080477,0.000007646001,0.00034930892,0.0001031238,0.009022277,0.005953968,0.9761426,0.0074792844,0.000030584553],"about_ca_topic_score_codex":0.00088108465,"about_ca_topic_score_gemma":0.0013437785,"teacher_disagreement_score":0.003245087,"about_ca_system_score_codex":0.0004855944,"about_ca_system_score_gemma":0.00040559022,"threshold_uncertainty_score":0.010855913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4292117,0.000935868,0.39635557,0.0017718527,0.0006660372,0.00012553448,0.0010726936,0.0003941848,0.16946654],"genre_scores_gemma":[0.90131015,0.0007360814,0.06493809,0.00056992663,0.00030462816,0.00014236166,0.0005388282,0.00014509379,0.03131481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951124,0.000103688166,0.000020136478,0.00010387454,0.000104374616,0.00015662391],"domain_scores_gemma":[0.9992518,0.00020125945,0.00008988587,0.00014626808,0.00018104826,0.00012960906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080808974,0.00064416765,0.00039794212,0.0014647878,0.0012200339,0.0016474655,0.0010963315,0.00065375166,0.0066632796],"category_scores_gemma":[0.0012884224,0.00024156952,0.00064095197,0.0012442617,0.0023105412,0.0029738476,0.0011344143,0.0016881839,0.0011039344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012648057,0.0000125560455,0.0002622482,0.000014124494,0.0000030305757,0.000024468583,0.00008176412,0.00079611276,0.00088628294,0.99033165,0.0010863161,0.00648884],"study_design_scores_gemma":[0.000007902856,0.000026213464,0.00062269537,0.000017232936,0.0000074433715,0.000118191936,0.00017300028,0.012387261,0.0026641686,0.9709438,0.0130059505,0.000026239577],"about_ca_topic_score_codex":0.0010756048,"about_ca_topic_score_gemma":0.0012250429,"teacher_disagreement_score":0.0066632796,"about_ca_system_score_codex":0.0012782619,"about_ca_system_score_gemma":0.0006986314,"threshold_uncertainty_score":0.022290945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12351933,0.0025972226,0.8243055,0.0035345375,0.00034884334,0.00017905426,0.0010607112,0.001675237,0.04277959],"genre_scores_gemma":[0.8676353,0.00220034,0.1096096,0.0010261311,0.00046105753,0.00062038284,0.001068139,0.0013610898,0.01601792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996236,0.0010804405,0.0001567888,0.00070024794,0.00089536817,0.0009311936],"domain_scores_gemma":[0.9172254,0.06853869,0.0035308942,0.0056171566,0.0024438761,0.0026439726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059769778,0.0019988678,0.0024407138,0.002092477,0.0026442572,0.0045082066,0.0044414965,0.0022166902,0.012884933],"category_scores_gemma":[0.05342409,0.0015750419,0.0019048223,0.0021101718,0.0055823494,0.0108543085,0.0066523496,0.005455294,0.0015695789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043005068,0.000083478684,0.0011560818,0.00033164243,0.000075772194,0.00019742404,0.00039003495,0.24453302,0.003508288,0.7316125,0.0067844717,0.010897214],"study_design_scores_gemma":[0.000046767676,0.000055065393,0.0002696166,0.000072590796,0.000035514633,0.0000954128,0.000078741046,0.34547976,0.0012855704,0.65007955,0.0024621321,0.000039225506],"about_ca_topic_score_codex":0.0036992517,"about_ca_topic_score_gemma":0.0038137457,"teacher_disagreement_score":0.012884933,"about_ca_system_score_codex":0.004197374,"about_ca_system_score_gemma":0.0025093153,"threshold_uncertainty_score":0.04310441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73716956,0.00016732095,0.21600029,0.00021776861,0.00006510792,0.000072069335,0.0002647854,0.0003135403,0.045729507],"genre_scores_gemma":[0.91830945,0.00016466615,0.070529595,0.000112614085,0.000044225137,0.00009073284,0.0005792486,0.00009356473,0.010075949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.0000644012,0.0000486353,0.00009912105,0.00013869235,0.000092564274],"domain_scores_gemma":[0.9989697,0.00041275873,0.00016834741,0.00021653456,0.00015099865,0.000081686136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028488872,0.00027957693,0.00032393576,0.00097058667,0.0011955746,0.0013381578,0.00048321922,0.000441449,0.0026021865],"category_scores_gemma":[0.0020285018,0.00031706473,0.0006184499,0.00083330774,0.0010605024,0.0012967507,0.00096611155,0.00062156457,0.0004628347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078372155,0.00003164031,0.0029253606,0.00007709753,0.000023953366,0.00080449943,0.0005686087,0.0065063145,0.015857928,0.93865967,0.0010797529,0.03338669],"study_design_scores_gemma":[0.000021121714,0.000056114288,0.0023260715,0.000034316374,0.000042190462,0.0010853559,0.00036110138,0.048438706,0.01328518,0.9149656,0.019344842,0.000039379804],"about_ca_topic_score_codex":0.0009185515,"about_ca_topic_score_gemma":0.0014904935,"teacher_disagreement_score":0.0026021865,"about_ca_system_score_codex":0.00047933173,"about_ca_system_score_gemma":0.0005588324,"threshold_uncertainty_score":0.008705199},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37200877,0.0004226055,0.58170396,0.00028196143,0.00028615652,0.00008030951,0.00031763813,0.0005264717,0.04437199],"genre_scores_gemma":[0.83270866,0.0004939611,0.15126221,0.00012234024,0.000054970897,0.000092385395,0.0003320512,0.00015564967,0.0147777675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979836,0.000042700096,0.0000125852475,0.000046158984,0.0000577988,0.000042355965],"domain_scores_gemma":[0.9997265,0.00004924043,0.000043592456,0.00009243038,0.000026870674,0.000061360006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017168003,0.00021010854,0.00034558977,0.0005585329,0.00068556843,0.00083196844,0.00056559045,0.00049583433,0.0047065117],"category_scores_gemma":[0.0005858858,0.0002676499,0.000413945,0.00073363923,0.00084680895,0.0008311349,0.0013052206,0.00085023185,0.00092967186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009252369,0.000052690462,0.00087099476,0.00009132444,0.0000150908145,0.0006502334,0.00048740028,0.010482068,0.035413425,0.90173596,0.0014814608,0.048626862],"study_design_scores_gemma":[0.000083400264,0.0003034059,0.0026575304,0.00007157542,0.00004216837,0.0032256497,0.0009778009,0.074368864,0.04650676,0.77403754,0.09764512,0.000080229656],"about_ca_topic_score_codex":0.00043495957,"about_ca_topic_score_gemma":0.00049987494,"teacher_disagreement_score":0.0047065117,"about_ca_system_score_codex":0.00030368104,"about_ca_system_score_gemma":0.0001728479,"threshold_uncertainty_score":0.015744805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4362875,0.0018153593,0.47246528,0.0009794927,0.00018096698,0.00043831283,0.0024710908,0.00050458254,0.08485735],"genre_scores_gemma":[0.8344551,0.0013139906,0.1323953,0.00041556003,0.000114837276,0.00037752395,0.0039536147,0.00015007073,0.02682411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995365,0.00007406038,0.00003224197,0.00011350191,0.00010850133,0.00013512433],"domain_scores_gemma":[0.99915135,0.0002801836,0.00010095992,0.00010602044,0.0001446311,0.00021682192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036481066,0.00050952815,0.00046812434,0.0016935421,0.00086137245,0.0013071601,0.00053965655,0.0005161768,0.007176793],"category_scores_gemma":[0.0017330296,0.00048585373,0.00065945025,0.0012100011,0.00077648344,0.001699397,0.0011516634,0.0010057421,0.0007267773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012972622,0.000077643526,0.0011549009,0.00033717515,0.000054370572,0.00042428065,0.00053003454,0.026249995,0.0071471394,0.9037198,0.005275919,0.05489897],"study_design_scores_gemma":[0.00005464208,0.00004788884,0.00068994705,0.00010047035,0.000035274632,0.00026601195,0.0003119804,0.05368941,0.0033134324,0.91719896,0.024268396,0.000023661567],"about_ca_topic_score_codex":0.0016206121,"about_ca_topic_score_gemma":0.0030054387,"teacher_disagreement_score":0.007176793,"about_ca_system_score_codex":0.0011051976,"about_ca_system_score_gemma":0.0006982334,"threshold_uncertainty_score":0.02400875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22322375,0.0036227263,0.6021045,0.0019455946,0.0003637722,0.00021295114,0.0011768518,0.00040420698,0.1669457],"genre_scores_gemma":[0.83428854,0.001482627,0.13789056,0.00032451827,0.00038896725,0.00014363666,0.0012976339,0.00016150383,0.024021933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710125,0.00070694834,0.00022805724,0.0008543449,0.00074699824,0.00036242057],"domain_scores_gemma":[0.9947483,0.002370923,0.00075525435,0.0010402983,0.000474824,0.0006104078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015040647,0.0008882505,0.0008365234,0.0021551894,0.0021502085,0.0041021416,0.0013504454,0.00090187934,0.014465876],"category_scores_gemma":[0.006400827,0.00073806057,0.0012445878,0.0017511942,0.0049860817,0.011773376,0.004632859,0.0036370838,0.001700997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012323419,0.000005828503,0.00021677307,0.000023287814,0.0000059332324,0.00006471219,0.00023244094,0.0006723778,0.0004740608,0.99197704,0.00071751256,0.005597712],"study_design_scores_gemma":[0.0000078891235,0.00002169862,0.0004194528,0.000023314324,0.000008937903,0.00044623783,0.00036493258,0.0038464125,0.00187606,0.9691836,0.023784734,0.000016691196],"about_ca_topic_score_codex":0.0005309886,"about_ca_topic_score_gemma":0.00046028834,"teacher_disagreement_score":0.014465876,"about_ca_system_score_codex":0.0011675389,"about_ca_system_score_gemma":0.00037127163,"threshold_uncertainty_score":0.04839313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4050624,0.00012251102,0.5675877,0.00030375048,0.000052434578,0.000059129965,0.00013975953,0.00025729873,0.026414959],"genre_scores_gemma":[0.84106296,0.00020844952,0.1488531,0.00013217171,0.00004025178,0.000100267105,0.00032013952,0.0001976968,0.009085124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996965,0.00008174401,0.00001196623,0.00006272709,0.00007217647,0.00007498198],"domain_scores_gemma":[0.9992005,0.00030681444,0.00007050885,0.00021675818,0.00010979167,0.000095559095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005847104,0.00040993604,0.00030456044,0.0009808232,0.00089989946,0.0009053076,0.000679519,0.0004593234,0.0028138233],"category_scores_gemma":[0.0021393,0.00024194799,0.0005487386,0.0009956027,0.0010225883,0.0022474302,0.0012615216,0.0009666801,0.00035581933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000710607,0.0000538694,0.0010622599,0.000056766912,0.000010413056,0.000105846106,0.00025027944,0.013268571,0.0134830745,0.933129,0.0011321341,0.037376713],"study_design_scores_gemma":[0.000032142885,0.00013258947,0.0018614891,0.000033499517,0.000046586763,0.00054944126,0.00037710293,0.16535927,0.026966812,0.7902285,0.014367986,0.0000445621],"about_ca_topic_score_codex":0.0009625096,"about_ca_topic_score_gemma":0.0014921246,"teacher_disagreement_score":0.0028138233,"about_ca_system_score_codex":0.0006706038,"about_ca_system_score_gemma":0.0006067244,"threshold_uncertainty_score":0.009413123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23693833,0.0011402881,0.7293204,0.0028595368,0.00019004755,0.00024784156,0.0016867826,0.00094929535,0.026667573],"genre_scores_gemma":[0.9324346,0.0007025921,0.05703286,0.00091365643,0.0002955216,0.00054168864,0.00084035547,0.00015255471,0.0070861196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99419564,0.0020088386,0.00028549897,0.001758446,0.0011219378,0.0006296664],"domain_scores_gemma":[0.97906464,0.0123344455,0.0026353952,0.0036438287,0.0013972713,0.0009243947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004044674,0.0005980993,0.0012690979,0.0016361028,0.0013625718,0.0023523655,0.0021252139,0.001994874,0.005243727],"category_scores_gemma":[0.029597528,0.0006787614,0.0010540893,0.0028088053,0.0042768274,0.010834279,0.002484931,0.0017958235,0.00080604176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026889026,0.00006295355,0.0014025539,0.00016747299,0.000051221643,0.00018256351,0.00027099557,0.04154843,0.0032615452,0.9310643,0.003226057,0.018492963],"study_design_scores_gemma":[0.000060348913,0.00008144209,0.0010096999,0.00004237969,0.000027032464,0.0004377326,0.00009927673,0.23978545,0.0025169277,0.7512751,0.0046202154,0.000044432174],"about_ca_topic_score_codex":0.0017390134,"about_ca_topic_score_gemma":0.0013476465,"teacher_disagreement_score":0.005243727,"about_ca_system_score_codex":0.0030289607,"about_ca_system_score_gemma":0.0015205938,"threshold_uncertainty_score":0.02197671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72917354,0.00083988317,0.20718667,0.00056936016,0.00010385212,0.000052054103,0.00043556528,0.00014653403,0.06149248],"genre_scores_gemma":[0.9682248,0.0004892703,0.020656848,0.000076228,0.00011549847,0.000061983985,0.0006229632,0.000053998567,0.009698433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952793,0.000073162024,0.00001490371,0.00009041536,0.00016345913,0.00013010229],"domain_scores_gemma":[0.99902534,0.00040009397,0.00016980755,0.000074070944,0.00011661177,0.00021407564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004455965,0.0006410033,0.00052991544,0.0016300009,0.0008233324,0.0023603712,0.0006236875,0.00044378056,0.0060014986],"category_scores_gemma":[0.0016193537,0.0003042943,0.0006194586,0.0008811636,0.0018820022,0.0022577248,0.0012252318,0.0016844495,0.0005226202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093244285,0.000060573915,0.0015348619,0.0000997766,0.000017318245,0.00022590406,0.00022073413,0.014347284,0.0056378967,0.9673688,0.001656464,0.008737188],"study_design_scores_gemma":[0.000062985295,0.00012190784,0.0027781974,0.000054658307,0.000027314785,0.00055007124,0.0004943805,0.1283858,0.005545876,0.85286266,0.00907141,0.000044720757],"about_ca_topic_score_codex":0.00094326783,"about_ca_topic_score_gemma":0.0006286537,"teacher_disagreement_score":0.0060014986,"about_ca_system_score_codex":0.000799095,"about_ca_system_score_gemma":0.00026790777,"threshold_uncertainty_score":0.02007705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79448706,0.0016972207,0.11393105,0.00047007352,0.00043891952,0.00013753632,0.0002691385,0.0004691379,0.088099964],"genre_scores_gemma":[0.96294105,0.0014107316,0.017899955,0.00020961397,0.00039203305,0.00011878956,0.00045735892,0.00015563985,0.016414894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999212,0.00019537476,0.000048718317,0.00018408454,0.00018004999,0.00017965223],"domain_scores_gemma":[0.99788755,0.00091961655,0.00040024362,0.0002708956,0.00023708967,0.00028452172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890089,0.00078225526,0.00055416557,0.0016914875,0.0013114049,0.0017227116,0.0006399927,0.0007271795,0.0050396724],"category_scores_gemma":[0.0027953056,0.0005840331,0.0010345185,0.0011728426,0.0027087217,0.0028371476,0.0021603093,0.0012240899,0.0010654371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013467396,0.000064759224,0.0012139791,0.00009360122,0.000025766712,0.00079949474,0.0011659446,0.0049476856,0.0069539086,0.9697253,0.0016914459,0.013183432],"study_design_scores_gemma":[0.000039555092,0.00008021805,0.0009713799,0.000033285167,0.000024986442,0.00041960808,0.0002600369,0.011554232,0.0025325632,0.97547907,0.00857988,0.000025178018],"about_ca_topic_score_codex":0.0015727063,"about_ca_topic_score_gemma":0.0017586973,"teacher_disagreement_score":0.0050396724,"about_ca_system_score_codex":0.00095458707,"about_ca_system_score_gemma":0.00040391178,"threshold_uncertainty_score":0.016859353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7499551,0.00059453107,0.20330387,0.001075831,0.00008894087,0.00007491401,0.00011839881,0.0004176798,0.044370662],"genre_scores_gemma":[0.9864846,0.00019772945,0.009589616,0.00010699704,0.000031576397,0.00003440121,0.00004880058,0.0000532699,0.0034528908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964,0.00010320929,0.000015998521,0.00006165877,0.000088016546,0.000091093265],"domain_scores_gemma":[0.9987563,0.00046815554,0.00015688053,0.00026938473,0.00018299086,0.00016628552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048238807,0.0002638504,0.0003921399,0.0011548795,0.0010473257,0.0013827729,0.00081028155,0.0006651877,0.0034307188],"category_scores_gemma":[0.0032702256,0.00024498822,0.000452179,0.00055705936,0.0017141323,0.0029319504,0.0014661814,0.0010883242,0.00029874124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024494555,0.000019300656,0.00050828716,0.000024980574,0.000004421629,0.00018032454,0.0003748986,0.0076668193,0.0029340074,0.98410416,0.00060792884,0.0035503285],"study_design_scores_gemma":[0.00001199917,0.000035295045,0.00035097194,0.000019316734,0.000006892371,0.00023646814,0.00037331847,0.12304373,0.0020467893,0.86921304,0.004643638,0.000018518014],"about_ca_topic_score_codex":0.0011468509,"about_ca_topic_score_gemma":0.0009265186,"teacher_disagreement_score":0.0034307188,"about_ca_system_score_codex":0.0010504829,"about_ca_system_score_gemma":0.00032692723,"threshold_uncertainty_score":0.011476934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45813572,0.00069599063,0.3498404,0.0017752983,0.0006838774,0.00009190039,0.00038466856,0.00047108493,0.18792112],"genre_scores_gemma":[0.9520779,0.00045311733,0.019625584,0.00033288507,0.00042794232,0.00007080222,0.000170489,0.0001512464,0.026689956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993211,0.00013642616,0.00003059714,0.00012308786,0.00022163462,0.00016715124],"domain_scores_gemma":[0.999148,0.0002936258,0.00010029666,0.0001390281,0.00017722693,0.00014180601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072963303,0.0004318805,0.00036169196,0.0012821106,0.0013958047,0.0023000971,0.000610425,0.00065563666,0.008767026],"category_scores_gemma":[0.0025581755,0.00025418523,0.00061168446,0.0008125896,0.0029717009,0.0045877844,0.002021074,0.0019014665,0.0010784699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000845764,0.0000054424618,0.00006235836,0.000005962441,8.1666e-7,0.000024295216,0.0000836628,0.00017121449,0.0005469581,0.99614006,0.00033009538,0.0026205024],"study_design_scores_gemma":[0.000006474009,0.000018791874,0.0002024726,0.00000957734,0.0000039021884,0.00017001922,0.00012643807,0.0053979387,0.0014098982,0.9875628,0.0050790566,0.000012605456],"about_ca_topic_score_codex":0.0006159871,"about_ca_topic_score_gemma":0.00059722096,"teacher_disagreement_score":0.008767026,"about_ca_system_score_codex":0.0007959866,"about_ca_system_score_gemma":0.0005468149,"threshold_uncertainty_score":0.029328644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89790803,0.0005993327,0.045958906,0.00044202327,0.00013429743,0.000039411512,0.00013508405,0.00013948111,0.0546434],"genre_scores_gemma":[0.9846475,0.00041568145,0.0075668525,0.00009038941,0.00016257158,0.000037667156,0.0002464041,0.00006441961,0.0067685083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996221,0.000090001624,0.00001528319,0.000087510365,0.000082444385,0.00010263345],"domain_scores_gemma":[0.9987508,0.0006178632,0.00023882861,0.0001243959,0.00009944717,0.00016871149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032373355,0.00047591512,0.000365765,0.0012762747,0.0014063482,0.001195606,0.0003008248,0.00043606161,0.0028859824],"category_scores_gemma":[0.0017531158,0.00024989067,0.00047793583,0.0005611703,0.0018940793,0.0011533853,0.0009507486,0.00071519363,0.0003159037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014696918,0.000041481646,0.002745438,0.000066556,0.000021101356,0.0006917179,0.0007830428,0.00926288,0.013716145,0.9600312,0.0014182081,0.011075252],"study_design_scores_gemma":[0.000029439496,0.00007384732,0.0025885706,0.000032881304,0.00002581272,0.00040479872,0.00027786935,0.04104579,0.00519165,0.9438356,0.0064666327,0.0000270801],"about_ca_topic_score_codex":0.0023853136,"about_ca_topic_score_gemma":0.0025072824,"teacher_disagreement_score":0.0028859824,"about_ca_system_score_codex":0.0010523414,"about_ca_system_score_gemma":0.0003653578,"threshold_uncertainty_score":0.009654522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5345097,0.001524044,0.42874914,0.0031654066,0.0002134014,0.00021957244,0.0005634431,0.0010053709,0.030049937],"genre_scores_gemma":[0.96598125,0.0009774698,0.023299884,0.0003631836,0.00019805357,0.0004309296,0.0003322649,0.00019297091,0.008224009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976412,0.0011115238,0.00007348563,0.00040410418,0.00038159618,0.00038810706],"domain_scores_gemma":[0.97306967,0.020077836,0.0021224977,0.0018367777,0.0011860372,0.0017070598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004998742,0.0007649842,0.0014168721,0.0022928035,0.0016706238,0.0024597277,0.0025131172,0.0017584934,0.006027237],"category_scores_gemma":[0.032609135,0.00089439494,0.0007952872,0.0010740765,0.0046833716,0.0062754843,0.0024768196,0.0030138902,0.0008080039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020740407,0.00004552089,0.0016728131,0.000094202725,0.000026184758,0.00017322997,0.00028810502,0.018799108,0.0027107948,0.9660275,0.0022175699,0.0077376617],"study_design_scores_gemma":[0.0001087212,0.00012529221,0.0015985647,0.000087864355,0.00003853709,0.00042385163,0.00015388883,0.35953924,0.002828665,0.63233846,0.002664014,0.00009287533],"about_ca_topic_score_codex":0.0011603698,"about_ca_topic_score_gemma":0.0008688664,"teacher_disagreement_score":0.006027237,"about_ca_system_score_codex":0.0020152817,"about_ca_system_score_gemma":0.000942669,"threshold_uncertainty_score":0.02643621},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16488886,0.006023823,0.5337382,0.011199603,0.0004878452,0.0006552056,0.00411328,0.003674186,0.27521902],"genre_scores_gemma":[0.86099184,0.0039854837,0.07538862,0.0043743677,0.0007614499,0.0021358996,0.0038276007,0.0018375014,0.046697337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994497,0.0013655704,0.00018246331,0.0009873492,0.0011971869,0.0017704553],"domain_scores_gemma":[0.9479067,0.04236847,0.0018702807,0.0025562604,0.0017667483,0.0035315913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039057508,0.0042762063,0.003089959,0.0036094752,0.0034947796,0.0073315287,0.007221481,0.003280082,0.02968604],"category_scores_gemma":[0.03786219,0.0015931186,0.0023953666,0.0037917062,0.005720423,0.016292669,0.007046205,0.008533512,0.004681176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005631578,0.0003664695,0.0015877924,0.00073380314,0.0001115438,0.00020765919,0.0009913738,0.08331976,0.0033475622,0.86283046,0.02109834,0.024842013],"study_design_scores_gemma":[0.00007470139,0.000083699015,0.00018995392,0.00011467213,0.000050330855,0.00010782647,0.00012607993,0.20127174,0.0012558595,0.79239213,0.0042822845,0.000050762294],"about_ca_topic_score_codex":0.0048613627,"about_ca_topic_score_gemma":0.006392521,"teacher_disagreement_score":0.02968604,"about_ca_system_score_codex":0.008665629,"about_ca_system_score_gemma":0.004290978,"threshold_uncertainty_score":0.09930968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716698,0.0002464294,0.18342923,0.00033809352,0.0001324894,0.00004355578,0.0001364856,0.000138418,0.043865487],"genre_scores_gemma":[0.9753362,0.00017770278,0.018438097,0.00009057364,0.00007008793,0.00003968509,0.000092509195,0.00005472052,0.0057004765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996045,0.000081867234,0.000016335094,0.00012279314,0.0000902703,0.00008422137],"domain_scores_gemma":[0.99911517,0.00029566712,0.00014333174,0.00010753259,0.00017543594,0.00016290089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055906177,0.00036258402,0.00026111514,0.0014197201,0.00084969203,0.0012528128,0.0008322757,0.0004013475,0.0047900793],"category_scores_gemma":[0.0016647324,0.0001714095,0.0005102494,0.0007737277,0.0022027516,0.002703888,0.0009462211,0.0009681041,0.00044115682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028736498,0.000015363095,0.00075151963,0.000021947453,0.0000038249686,0.00005057158,0.0001829095,0.0012365056,0.0042601936,0.98460037,0.00038513987,0.008462905],"study_design_scores_gemma":[0.000011299834,0.000066800996,0.0016530316,0.000014138338,0.000011097521,0.00027878908,0.00025086102,0.025697822,0.008522632,0.957375,0.0060868636,0.000031615247],"about_ca_topic_score_codex":0.0010231725,"about_ca_topic_score_gemma":0.0008373816,"teacher_disagreement_score":0.0047900793,"about_ca_system_score_codex":0.00085679785,"about_ca_system_score_gemma":0.000504988,"threshold_uncertainty_score":0.016024351},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1564458,0.0010614378,0.8176467,0.0030979244,0.000109520515,0.0003967359,0.0005247595,0.00035040645,0.02036674],"genre_scores_gemma":[0.90368354,0.0014994289,0.081108585,0.000869798,0.00031224996,0.000827257,0.00036578276,0.00011314877,0.011220136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954021,0.0025854895,0.00014149456,0.00088219775,0.0005298409,0.00045890652],"domain_scores_gemma":[0.98250335,0.012392773,0.0015821216,0.0016675576,0.00068168674,0.0011724897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005700413,0.0012316909,0.001962825,0.0012799187,0.0013079952,0.0023539595,0.002709196,0.0023875306,0.005613543],"category_scores_gemma":[0.017867824,0.00069559796,0.0020655831,0.0012053238,0.0059670247,0.0061844466,0.0031921917,0.004420659,0.00065857504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076188466,0.0000483225,0.0005353634,0.00007210153,0.000038537637,0.00012795991,0.00025050255,0.04686462,0.0007664179,0.9466486,0.0011581634,0.0034132458],"study_design_scores_gemma":[0.000096380645,0.00006539951,0.00032645382,0.000024512121,0.000021829534,0.00011076166,0.000060853738,0.34108555,0.00034487812,0.65635645,0.0014740452,0.00003283771],"about_ca_topic_score_codex":0.004555997,"about_ca_topic_score_gemma":0.0031715308,"teacher_disagreement_score":0.005700413,"about_ca_system_score_codex":0.0023898066,"about_ca_system_score_gemma":0.0015022526,"threshold_uncertainty_score":0.030147016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.673963,0.0009067998,0.2788772,0.0007947387,0.00007156503,0.0001143547,0.00053581205,0.0006190677,0.044117447],"genre_scores_gemma":[0.96110445,0.0005394868,0.030092398,0.00020664978,0.000091101545,0.00023339305,0.00033722026,0.00013500979,0.0072601875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861276,0.00039279283,0.00006674028,0.00025048916,0.00036529158,0.00031181792],"domain_scores_gemma":[0.99343055,0.0039369795,0.0006687368,0.00067108916,0.0005661953,0.00072643877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012364927,0.00061509537,0.0008790285,0.0014945448,0.0011768052,0.001806055,0.001123693,0.0010730389,0.00422733],"category_scores_gemma":[0.01545652,0.00075435,0.0008798623,0.0008741932,0.0023175813,0.0034139876,0.002424198,0.0013795142,0.00069697184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015875527,0.00005644185,0.002686538,0.0001431649,0.00004173888,0.00035481955,0.00046482222,0.02798624,0.008411138,0.94071966,0.0020502338,0.016926412],"study_design_scores_gemma":[0.000035238052,0.00008885515,0.0023080783,0.000054907447,0.000028558832,0.0005004797,0.00018339313,0.13517879,0.0045168116,0.85363376,0.0034212947,0.00004979604],"about_ca_topic_score_codex":0.0012530312,"about_ca_topic_score_gemma":0.0012476061,"teacher_disagreement_score":0.00422733,"about_ca_system_score_codex":0.0013419962,"about_ca_system_score_gemma":0.00063959113,"threshold_uncertainty_score":0.014141858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74737966,0.000523321,0.1971073,0.0007876793,0.00019056031,0.0001469803,0.00028794282,0.0004953456,0.053081263],"genre_scores_gemma":[0.96666884,0.00015565893,0.02796719,0.000119696175,0.00008688563,0.00009341936,0.00017176963,0.00007749628,0.0046590343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998629,0.00022918191,0.00011170521,0.00033097094,0.00050842203,0.0001908451],"domain_scores_gemma":[0.997968,0.001092167,0.00022644528,0.00022582417,0.000282967,0.00020455752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082513096,0.00033135983,0.0005762571,0.001199196,0.0015903399,0.0027091147,0.0007867684,0.0009224231,0.0035772386],"category_scores_gemma":[0.004131578,0.00041635477,0.0008295287,0.0008390721,0.0032631815,0.0032981217,0.0012193222,0.0015194237,0.0005804877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060031507,0.000026386584,0.000490679,0.00001922565,0.000004829515,0.00018307922,0.00045956983,0.001978506,0.005731892,0.98684573,0.00023072421,0.003969423],"study_design_scores_gemma":[0.000044968372,0.00008070027,0.0006898086,0.000017159253,0.00001415442,0.00019523407,0.00016587117,0.027180279,0.007616715,0.961266,0.002697086,0.00003201551],"about_ca_topic_score_codex":0.0017984058,"about_ca_topic_score_gemma":0.0017643456,"teacher_disagreement_score":0.0035772386,"about_ca_system_score_codex":0.0012131187,"about_ca_system_score_gemma":0.000892761,"threshold_uncertainty_score":0.011967063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3508357,0.0039023627,0.43299118,0.0041038427,0.0009614535,0.00019734066,0.0021623257,0.0008590369,0.20398669],"genre_scores_gemma":[0.9224367,0.002813628,0.051763143,0.0013703501,0.00087610533,0.0003292523,0.0015682048,0.00023784541,0.018604828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968991,0.0006326793,0.0002534252,0.0008427555,0.0007626804,0.0006093203],"domain_scores_gemma":[0.9940817,0.0029523238,0.0008161949,0.0010546454,0.0006308582,0.0004641274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025333455,0.00094502146,0.001744027,0.0021272504,0.0028178308,0.0036416573,0.0011751832,0.0019542407,0.009541619],"category_scores_gemma":[0.008968854,0.0006503289,0.0019910622,0.0021578665,0.0038824603,0.00751791,0.003763082,0.003950809,0.0022228612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108167864,0.000018137274,0.00070901593,0.00008928969,0.000020523394,0.00014588707,0.00015898752,0.0027684544,0.00085978006,0.9856221,0.0019673235,0.007532404],"study_design_scores_gemma":[0.00003430402,0.000055855362,0.0005978657,0.00005067514,0.000033931694,0.00041423022,0.00012074369,0.01326904,0.0012856838,0.9731257,0.0109653585,0.000046648343],"about_ca_topic_score_codex":0.0010163583,"about_ca_topic_score_gemma":0.0006482256,"teacher_disagreement_score":0.009541619,"about_ca_system_score_codex":0.0014888139,"about_ca_system_score_gemma":0.0010872739,"threshold_uncertainty_score":0.031919956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42345983,0.009685,0.3434128,0.0035523663,0.00055480294,0.00008342453,0.00028230474,0.00030222768,0.21866722],"genre_scores_gemma":[0.95958745,0.0018387634,0.021925025,0.00023541873,0.0004241382,0.0000589617,0.00011166887,0.000045866374,0.015772667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938405,0.00022130387,0.00003401374,0.000105052335,0.00017739329,0.00007816653],"domain_scores_gemma":[0.9992962,0.00034797407,0.00007185019,0.00009974831,0.000096633376,0.000087577915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010531779,0.0004293388,0.0003607979,0.0015061493,0.0013759068,0.0034613982,0.0006571634,0.00075325015,0.0036857543],"category_scores_gemma":[0.0017204948,0.00033797056,0.0005222798,0.0011743221,0.0043074605,0.0063475654,0.001849555,0.0013525519,0.0005327236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026541752,0.0000032415594,0.000044990546,0.000009720965,0.0000012196224,0.000023461613,0.00016499759,0.00028910764,0.0001837361,0.99756527,0.00012485568,0.0015868663],"study_design_scores_gemma":[0.0000030887054,0.0000061941446,0.000042481915,0.0000059907816,0.0000018473886,0.00003398712,0.000054764543,0.0014556192,0.00017494528,0.99661547,0.0016016974,0.000003920422],"about_ca_topic_score_codex":0.00080575264,"about_ca_topic_score_gemma":0.0005575194,"teacher_disagreement_score":0.0036857543,"about_ca_system_score_codex":0.0010959593,"about_ca_system_score_gemma":0.00049061066,"threshold_uncertainty_score":0.012330055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8154491,0.00038005877,0.08557093,0.0010773704,0.00019143918,0.000078511206,0.0012547544,0.0007916068,0.0952062],"genre_scores_gemma":[0.94043195,0.00021723856,0.025831467,0.00032494144,0.00010352576,0.00008617477,0.0014277531,0.00020300932,0.03137394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997179,0.00003163643,0.000013770753,0.000085197644,0.00006288626,0.000088483204],"domain_scores_gemma":[0.9993469,0.00014537455,0.00016237078,0.00013039072,0.000081288,0.00013364475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016153364,0.00060562993,0.00040024254,0.00048204124,0.0013134842,0.0014450634,0.0007277989,0.00055761664,0.010621875],"category_scores_gemma":[0.0006758528,0.00036729773,0.0010030093,0.00056935166,0.0008948799,0.0016196141,0.0014066542,0.0010491448,0.0020411701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008132356,0.00021165551,0.0081503065,0.00046460822,0.00011433835,0.0018399837,0.0015232065,0.005700099,0.06575202,0.8392311,0.017186219,0.0590132],"study_design_scores_gemma":[0.00010713945,0.00045130367,0.011816476,0.000082267165,0.00015541805,0.0052810702,0.001273595,0.026297884,0.050509505,0.79775256,0.10615947,0.00011330187],"about_ca_topic_score_codex":0.0013810286,"about_ca_topic_score_gemma":0.0017082545,"teacher_disagreement_score":0.010621875,"about_ca_system_score_codex":0.0005110988,"about_ca_system_score_gemma":0.000292184,"threshold_uncertainty_score":0.035533726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79693925,0.0008692178,0.12394118,0.0011507953,0.00019716343,0.00006456604,0.0005574512,0.00038202,0.07589842],"genre_scores_gemma":[0.9636196,0.00033019786,0.020916838,0.0002703112,0.000086081,0.00006882921,0.00052191596,0.000089876616,0.0140964985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993919,0.00012449485,0.000032343978,0.00014950529,0.00016461022,0.00013711241],"domain_scores_gemma":[0.9990777,0.00024619824,0.00021030995,0.00012371645,0.00013844478,0.0002036985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037958025,0.00049628876,0.00032786236,0.001523122,0.0010628647,0.0023874228,0.000859581,0.00064214185,0.0059496923],"category_scores_gemma":[0.001602484,0.00044400478,0.00041479766,0.0015575227,0.0015984693,0.0031748493,0.0012376279,0.0012620239,0.0005981181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036285357,0.000019885465,0.00092518004,0.000023956502,0.0000043638224,0.00006222466,0.00019981706,0.0016710671,0.0018070525,0.98398966,0.0012763911,0.009984191],"study_design_scores_gemma":[0.00001354918,0.000029610757,0.0012250568,0.00002339225,0.000008602598,0.0002438328,0.00035998336,0.018704215,0.0030605372,0.9646927,0.011606937,0.000031710166],"about_ca_topic_score_codex":0.0023186742,"about_ca_topic_score_gemma":0.0029363239,"teacher_disagreement_score":0.0059496923,"about_ca_system_score_codex":0.0011225278,"about_ca_system_score_gemma":0.00030355743,"threshold_uncertainty_score":0.01990372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8145558,0.0009185153,0.11208326,0.00202236,0.00016111461,0.00010364248,0.0008914526,0.0007448458,0.06851901],"genre_scores_gemma":[0.95576674,0.00041324532,0.030290144,0.0006064758,0.0000648813,0.00010133682,0.00074770633,0.0001510234,0.011858452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898833,0.00024651358,0.000056413824,0.00031911847,0.00013124853,0.00025831617],"domain_scores_gemma":[0.99572104,0.0022102043,0.0007159583,0.0005597179,0.00037467715,0.0004183243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009946853,0.0006019458,0.0008272483,0.0008291,0.0022586337,0.002116241,0.00081893656,0.0010355479,0.007783504],"category_scores_gemma":[0.0040892055,0.0006912958,0.001188331,0.0011229075,0.0033679695,0.0055402196,0.0017365663,0.0016393118,0.0010295048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022843637,0.000054221153,0.0017439347,0.00021512457,0.000057777484,0.00024367463,0.00064695656,0.0068289624,0.0034916403,0.9696824,0.004843462,0.011963437],"study_design_scores_gemma":[0.00003103418,0.000058754966,0.00089726027,0.000028887805,0.000039018683,0.00037847811,0.0002312948,0.0077492907,0.0019731787,0.98138547,0.0071909595,0.00003642561],"about_ca_topic_score_codex":0.0012299774,"about_ca_topic_score_gemma":0.0020809933,"teacher_disagreement_score":0.007783504,"about_ca_system_score_codex":0.0011813213,"about_ca_system_score_gemma":0.0008523631,"threshold_uncertainty_score":0.026038408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7460821,0.000509257,0.20866364,0.00032946444,0.00017698259,0.00015421702,0.00035555856,0.0009497515,0.04277895],"genre_scores_gemma":[0.965723,0.00027266247,0.022348339,0.00005170655,0.00011105844,0.00003424005,0.0002021885,0.00017638358,0.011080375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936885,0.000054737808,0.000023934073,0.00011758327,0.0002574665,0.00017747821],"domain_scores_gemma":[0.99925596,0.00018108494,0.00014085087,0.0001587306,0.00015723184,0.000106159525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005593104,0.00045918068,0.00045570018,0.0013681654,0.0013732368,0.0012344874,0.0004900224,0.00035072386,0.0071767257],"category_scores_gemma":[0.001990998,0.0003000271,0.0007408123,0.0007613581,0.0021749942,0.003490297,0.0019811597,0.0017978351,0.0014855427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003709977,0.000037378075,0.0031948867,0.00014436549,0.000018186658,0.00046538512,0.0010570999,0.003791096,0.04270662,0.8869978,0.0015998507,0.05961641],"study_design_scores_gemma":[0.000062838444,0.00026255444,0.0076813055,0.00006928807,0.000090452835,0.0010346045,0.0008675836,0.020250142,0.09773506,0.8312335,0.04057453,0.00013814606],"about_ca_topic_score_codex":0.0008623999,"about_ca_topic_score_gemma":0.0011337142,"teacher_disagreement_score":0.0071767257,"about_ca_system_score_codex":0.0008524765,"about_ca_system_score_gemma":0.0005845376,"threshold_uncertainty_score":0.024008572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8709653,0.00063549884,0.09306982,0.0033032345,0.00012285505,0.000046690595,0.0006753595,0.00034525877,0.03083592],"genre_scores_gemma":[0.9898302,0.00016579173,0.00658433,0.00025542578,0.00017722683,0.000056536945,0.00042083362,0.000046442063,0.0024633086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973425,0.0005355295,0.00012482685,0.0010275544,0.00051570765,0.0004537821],"domain_scores_gemma":[0.9817108,0.0126075,0.0016440033,0.0020126717,0.0008737266,0.0011511906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017210828,0.0004335728,0.001058515,0.00094639196,0.0015620259,0.0028212913,0.0012070724,0.001512818,0.006606916],"category_scores_gemma":[0.012993904,0.00040657137,0.0009878878,0.00082704495,0.004402271,0.011168275,0.0033713966,0.0024311373,0.0005005608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042272464,0.000079128586,0.007198772,0.00014728271,0.00003982438,0.0003133939,0.00095691095,0.005851302,0.0054470114,0.96371025,0.0029091148,0.012924332],"study_design_scores_gemma":[0.00005194092,0.00009896714,0.0031819933,0.000025532141,0.000038658007,0.0007459721,0.00040702755,0.027442656,0.003405724,0.9596609,0.004909875,0.00003075089],"about_ca_topic_score_codex":0.00076985324,"about_ca_topic_score_gemma":0.00065110094,"teacher_disagreement_score":0.006606916,"about_ca_system_score_codex":0.0012095402,"about_ca_system_score_gemma":0.00050867215,"threshold_uncertainty_score":0.022102296},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49006137,0.0007243123,0.30980098,0.0011422385,0.0003398013,0.00010057351,0.00026938517,0.00037160903,0.19718966],"genre_scores_gemma":[0.95225286,0.00022458145,0.024426144,0.00021786058,0.00011008233,0.000047181842,0.00011308301,0.00006797763,0.022540074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999198,0.00011397124,0.00003121951,0.00014340939,0.0003089774,0.0002043798],"domain_scores_gemma":[0.9989555,0.00029171945,0.00013976885,0.00017126765,0.0002377276,0.0002040278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005871419,0.0004233499,0.00042680796,0.001575251,0.0018234703,0.0018107184,0.00066345633,0.00067397533,0.006698338],"category_scores_gemma":[0.0019202003,0.00035963274,0.00065133744,0.00081854174,0.004188799,0.0029665893,0.002381385,0.0016437146,0.0008749887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011214597,0.00000499804,0.00019746974,0.000011474064,0.0000016044149,0.00003679682,0.00018395534,0.0001935017,0.0008566907,0.9958546,0.00038856574,0.002259217],"study_design_scores_gemma":[0.000010320367,0.000022035205,0.00091799133,0.00001327128,0.0000067345172,0.00017223941,0.00024667705,0.004695821,0.0019309564,0.98756,0.0044055074,0.000018456934],"about_ca_topic_score_codex":0.00092190166,"about_ca_topic_score_gemma":0.0015126085,"teacher_disagreement_score":0.006698338,"about_ca_system_score_codex":0.0010209788,"about_ca_system_score_gemma":0.000569833,"threshold_uncertainty_score":0.022408187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48883557,0.004722089,0.26823637,0.0034534808,0.00053874723,0.00011639602,0.0015711127,0.001186773,0.23133956],"genre_scores_gemma":[0.919781,0.0018679434,0.06309582,0.0005501625,0.00017524342,0.00023759891,0.0006594691,0.00035681127,0.013275827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989203,0.00021208679,0.00004003295,0.00022560185,0.00024984806,0.0003521454],"domain_scores_gemma":[0.99565756,0.0024570606,0.0002553761,0.0007172939,0.00035058238,0.00056202605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739586,0.001153754,0.0006975695,0.0019667905,0.0023887393,0.0029042761,0.0019976003,0.0008748427,0.00821698],"category_scores_gemma":[0.004556968,0.00049354497,0.0007125608,0.001371703,0.004085931,0.0042867567,0.0033104112,0.0027705873,0.0013770872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023871995,0.000069063615,0.0014840926,0.00020026747,0.000018658482,0.00007130202,0.00033548663,0.016823292,0.0070117405,0.9528373,0.0067514647,0.014158575],"study_design_scores_gemma":[0.0000394625,0.000052123047,0.0014707493,0.000110268644,0.000026487049,0.00015894533,0.00016032721,0.07944183,0.0059707905,0.8988167,0.013670893,0.00008148135],"about_ca_topic_score_codex":0.0046756803,"about_ca_topic_score_gemma":0.009218137,"teacher_disagreement_score":0.00821698,"about_ca_system_score_codex":0.0033951988,"about_ca_system_score_gemma":0.0011152836,"threshold_uncertainty_score":0.02748853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3979147,0.0019954783,0.41102582,0.0191952,0.0014161698,0.0004519115,0.0019075621,0.0025148753,0.16357833],"genre_scores_gemma":[0.88252085,0.00092595967,0.08361474,0.0033615658,0.00054108293,0.00040425302,0.0016854128,0.000491608,0.026454408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963599,0.0007105843,0.00015753615,0.0012527925,0.00080378575,0.00071542495],"domain_scores_gemma":[0.98197466,0.009522263,0.0013745667,0.004510671,0.0016147371,0.001003188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034214733,0.0011838238,0.0017068719,0.002020473,0.0038976504,0.003501641,0.0038996357,0.0027675433,0.015915897],"category_scores_gemma":[0.03216002,0.00088925526,0.0030358473,0.0027747366,0.004103673,0.012588635,0.00499411,0.007101803,0.0020459595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060534605,0.00023117384,0.0041683777,0.0002616911,0.00006150058,0.00033769573,0.000995017,0.02338237,0.002644135,0.92363834,0.019363958,0.024310386],"study_design_scores_gemma":[0.0001549364,0.00006220243,0.0010897452,0.000059270147,0.000049020884,0.00021384974,0.00019934299,0.104414225,0.0015200445,0.88069385,0.011484895,0.00005869835],"about_ca_topic_score_codex":0.009112182,"about_ca_topic_score_gemma":0.008407843,"teacher_disagreement_score":0.015915897,"about_ca_system_score_codex":0.0058231005,"about_ca_system_score_gemma":0.0023925868,"threshold_uncertainty_score":0.053243995},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21457344,0.002206189,0.27111506,0.0032275028,0.0030864791,0.00019849217,0.0008009647,0.0017567807,0.5030351],"genre_scores_gemma":[0.86689633,0.00095957523,0.069227,0.001501745,0.0007764951,0.00040779167,0.0009985934,0.0010829183,0.05814959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984811,0.00047164786,0.00006512525,0.00028286528,0.0004136852,0.00028557715],"domain_scores_gemma":[0.9981712,0.0005984918,0.00014660806,0.00058057485,0.00024868047,0.00025439987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006858275,0.00076837564,0.00084340264,0.0015596702,0.0028439604,0.0029029024,0.0017343037,0.0012353619,0.029890314],"category_scores_gemma":[0.0043024225,0.00069170963,0.0009611382,0.0009608599,0.0031472503,0.0038721156,0.0031910113,0.002792554,0.003618232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050244704,0.000025727322,0.0002577697,0.00006246546,0.000008762184,0.00014714853,0.00017438293,0.0014099083,0.0011675516,0.9821801,0.0052492293,0.009266607],"study_design_scores_gemma":[0.000022337485,0.000046372355,0.0001773127,0.000044816024,0.000007843588,0.00033932744,0.00016349461,0.009261404,0.0015619105,0.97001046,0.01833359,0.000031125568],"about_ca_topic_score_codex":0.00088728656,"about_ca_topic_score_gemma":0.0013329681,"teacher_disagreement_score":0.029890314,"about_ca_system_score_codex":0.000875932,"about_ca_system_score_gemma":0.0009549942,"threshold_uncertainty_score":0.09999311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4637005,0.0021093048,0.36622652,0.0017904133,0.00041683338,0.00012034931,0.0004018676,0.00047764782,0.16475661],"genre_scores_gemma":[0.96527207,0.0005616933,0.025178378,0.00028211303,0.00019730117,0.00010463338,0.0001670677,0.00008655001,0.008150198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988728,0.00024024198,0.00007508873,0.00030804318,0.00031783213,0.00018593129],"domain_scores_gemma":[0.99397945,0.0033097793,0.00064691214,0.0006942361,0.00052509265,0.0008445537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016958031,0.0005124093,0.0005182074,0.0030110248,0.0018448707,0.0041074883,0.0013027732,0.00078952877,0.005178091],"category_scores_gemma":[0.0060680932,0.00045477762,0.0007990329,0.0015021239,0.004333923,0.0071125473,0.0034379505,0.0021574579,0.00059670315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008930173,0.000005931381,0.00016388076,0.00000957926,0.0000023027198,0.000021854454,0.00010847838,0.00025019445,0.00029265988,0.9973067,0.00018934759,0.0016400246],"study_design_scores_gemma":[0.000010351974,0.000012976386,0.00019284459,0.000007717226,0.0000065054514,0.00009642372,0.00007992175,0.0029088785,0.00088341726,0.992751,0.0030415556,0.000008299455],"about_ca_topic_score_codex":0.00066396117,"about_ca_topic_score_gemma":0.00058017496,"teacher_disagreement_score":0.005178091,"about_ca_system_score_codex":0.0018087435,"about_ca_system_score_gemma":0.00046358796,"threshold_uncertainty_score":0.017322421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86415094,0.0006777488,0.06522864,0.00027062165,0.00013121786,0.000034206634,0.00018978032,0.00014936313,0.069167495],"genre_scores_gemma":[0.9783236,0.00021986745,0.013097615,0.00006915026,0.000033101947,0.000023632205,0.00027085116,0.00004776018,0.007914372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966705,0.00005362816,0.000020993919,0.000052112755,0.00011555161,0.0000907097],"domain_scores_gemma":[0.99956125,0.0000917695,0.000062828454,0.00012638167,0.00008541916,0.000072323455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019855512,0.0001822962,0.00033505418,0.00043975323,0.0008222676,0.0007999113,0.00033481698,0.0003938458,0.004124307],"category_scores_gemma":[0.0010381612,0.00013147133,0.00039642022,0.00029597688,0.0012216781,0.000601698,0.0006812481,0.00047813932,0.0004174027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003075865,0.00001879268,0.0059608845,0.000097005955,0.000018768018,0.00074614515,0.0015471077,0.017770622,0.02057323,0.9018458,0.0029835887,0.048130523],"study_design_scores_gemma":[0.000091001195,0.00018556065,0.0152848875,0.00014209963,0.00004069643,0.0029788627,0.0029420839,0.10148114,0.01637199,0.78394103,0.07645082,0.000089765505],"about_ca_topic_score_codex":0.0034164316,"about_ca_topic_score_gemma":0.0022281343,"teacher_disagreement_score":0.004124307,"about_ca_system_score_codex":0.0004977512,"about_ca_system_score_gemma":0.00019662986,"threshold_uncertainty_score":0.013797224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3299216,0.0031386155,0.3414827,0.0029606188,0.00084049994,0.0004052365,0.005348676,0.0016649044,0.3142372],"genre_scores_gemma":[0.8448696,0.0018813098,0.074976645,0.0008402399,0.0003781837,0.00039986565,0.004506222,0.00031668437,0.07183123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996569,0.00006160527,0.000019552208,0.000114655595,0.0000681053,0.000079122576],"domain_scores_gemma":[0.99925786,0.00020959336,0.00012225124,0.00018107699,0.00012349486,0.00010571309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019897244,0.00043311183,0.0003974699,0.0010757472,0.0013502126,0.0010702672,0.0007135522,0.0006522655,0.0150930565],"category_scores_gemma":[0.0014826913,0.00029121732,0.0004562874,0.0007519528,0.0008241876,0.0013354631,0.0010285911,0.0007613907,0.0018500094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067406145,0.000027360125,0.000532657,0.00009751149,0.000018885374,0.00041140293,0.00021428004,0.003471171,0.0030093659,0.9588244,0.00922844,0.024097243],"study_design_scores_gemma":[0.000028733015,0.000029060984,0.0007036429,0.00003454983,0.000016836042,0.000665421,0.000174328,0.01358109,0.0014045967,0.9348405,0.048501126,0.00002012671],"about_ca_topic_score_codex":0.0011142609,"about_ca_topic_score_gemma":0.0014360744,"teacher_disagreement_score":0.0150930565,"about_ca_system_score_codex":0.0008032966,"about_ca_system_score_gemma":0.00041998786,"threshold_uncertainty_score":0.050491333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33123955,0.0035007575,0.5143637,0.004059591,0.0006502661,0.00016452055,0.0019805774,0.0017172627,0.14232372],"genre_scores_gemma":[0.8016143,0.001628112,0.1402303,0.0015794958,0.00089021696,0.00026526616,0.0023475578,0.0011528198,0.05029199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707055,0.00046373627,0.0001727472,0.0010588736,0.000712361,0.0005217877],"domain_scores_gemma":[0.99122095,0.0030576696,0.00047765404,0.0035608208,0.000748702,0.00093419483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039146952,0.0011440804,0.0015450484,0.0020482272,0.003311881,0.0040070643,0.00274633,0.0014686434,0.012442873],"category_scores_gemma":[0.010203751,0.00073593535,0.0027611495,0.0026558128,0.0056704376,0.018083237,0.00839487,0.0034983766,0.0013075816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014608493,0.00005239149,0.0007099653,0.00010512655,0.000018442955,0.000103675615,0.00071608834,0.004169001,0.0007950431,0.9676257,0.0033288882,0.02222964],"study_design_scores_gemma":[0.00002044731,0.000051255814,0.00038538512,0.000036538004,0.000022824199,0.0001328286,0.0001535978,0.010075322,0.0006650433,0.9706631,0.017760722,0.00003291421],"about_ca_topic_score_codex":0.0037611858,"about_ca_topic_score_gemma":0.0032312586,"teacher_disagreement_score":0.012442873,"about_ca_system_score_codex":0.0022687474,"about_ca_system_score_gemma":0.0011761199,"threshold_uncertainty_score":0.04162562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64652383,0.000909494,0.16413374,0.0019401549,0.00021435124,0.000052274663,0.00028593236,0.0005345202,0.18540564],"genre_scores_gemma":[0.9739376,0.00020151584,0.011821886,0.00027212538,0.00013089583,0.00003791957,0.00017810936,0.00006882764,0.013351204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988047,0.00018272489,0.00005774895,0.0002727822,0.00038035843,0.0003017144],"domain_scores_gemma":[0.998374,0.00077607227,0.00023177537,0.00026583366,0.00017682521,0.0001755323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009237221,0.00040548408,0.00044229985,0.001580423,0.0016668362,0.0023139114,0.0009650756,0.0007296594,0.012591967],"category_scores_gemma":[0.0039474703,0.00043704602,0.0005047996,0.0013321901,0.003244287,0.0052145324,0.0024331536,0.0022860623,0.001490683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022614147,0.000015038432,0.0004862549,0.00001879795,0.0000022547958,0.00010974514,0.00037757593,0.00041838453,0.0014759755,0.99161243,0.00047089608,0.0049900813],"study_design_scores_gemma":[0.000009624541,0.000020127196,0.000604414,0.000016975071,0.0000054612424,0.00016954984,0.00022653725,0.0040534264,0.003361402,0.98551464,0.006000179,0.00001775423],"about_ca_topic_score_codex":0.0011372209,"about_ca_topic_score_gemma":0.0018725226,"teacher_disagreement_score":0.012591967,"about_ca_system_score_codex":0.0011619166,"about_ca_system_score_gemma":0.00041024055,"threshold_uncertainty_score":0.04212427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68998873,0.0021329746,0.061983604,0.039557442,0.0007826115,0.00016642186,0.0016331124,0.001547057,0.20220801],"genre_scores_gemma":[0.97191745,0.00081482314,0.0138044795,0.0034225145,0.00046599112,0.00019119805,0.0007359885,0.000112665904,0.008534791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814224,0.00042681742,0.000091734524,0.00048538766,0.0004931386,0.0003607659],"domain_scores_gemma":[0.9913066,0.00607916,0.0006393035,0.0007898821,0.0005924226,0.00059258874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012582833,0.00068144384,0.0009676979,0.0022708466,0.0028530227,0.0030280494,0.002089839,0.003324252,0.009998077],"category_scores_gemma":[0.01394437,0.00067632966,0.0009235211,0.0024397436,0.004695051,0.0056205643,0.004496322,0.0035528939,0.001066162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034335066,0.00006804788,0.0021038968,0.00015971872,0.00004204039,0.0004934049,0.0005691076,0.0059855557,0.0011556909,0.9530333,0.021422347,0.014623547],"study_design_scores_gemma":[0.00020370288,0.0000866426,0.0015164745,0.00008114316,0.00008286281,0.0012464535,0.00041695256,0.02658274,0.002582437,0.94201016,0.025102222,0.000088135865],"about_ca_topic_score_codex":0.0017360664,"about_ca_topic_score_gemma":0.0014218708,"teacher_disagreement_score":0.009998077,"about_ca_system_score_codex":0.0013972503,"about_ca_system_score_gemma":0.0007401066,"threshold_uncertainty_score":0.033446908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9671792,0.00013769857,0.022414472,0.00013572817,0.000011234028,0.000011362744,0.00014559606,0.00008343251,0.009881307],"genre_scores_gemma":[0.9932949,0.000056606048,0.005130229,0.000015966043,0.000012627,0.000016252076,0.00014064321,0.000008256315,0.0013243734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993081,0.00013154947,0.00006168688,0.0001769741,0.00017271482,0.00014890339],"domain_scores_gemma":[0.9977723,0.0009830517,0.0003264805,0.00032250493,0.00016184863,0.00043370144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060425996,0.00028038493,0.000451741,0.0011627476,0.0009826613,0.0014296767,0.0005796161,0.0003125741,0.002409298],"category_scores_gemma":[0.0019911733,0.00023778487,0.0004467227,0.00059664744,0.0022274505,0.001904556,0.0021666093,0.0006576023,0.0001971119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014566477,0.00002561564,0.0038305726,0.000057577072,0.00001757692,0.00017285258,0.0004936927,0.0033182045,0.0062424266,0.974919,0.00035680388,0.0104199955],"study_design_scores_gemma":[0.000049748833,0.00012479666,0.0047448175,0.000019781737,0.000046056815,0.0004972322,0.00032912387,0.022606438,0.011965008,0.9523494,0.0072213514,0.000046158126],"about_ca_topic_score_codex":0.00052397867,"about_ca_topic_score_gemma":0.0004906186,"teacher_disagreement_score":0.002409298,"about_ca_system_score_codex":0.0010639973,"about_ca_system_score_gemma":0.00034627027,"threshold_uncertainty_score":0.008059919},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8078992,0.0005299784,0.14312203,0.0014128096,0.00021306972,0.000060894385,0.0005667746,0.0010651791,0.04513008],"genre_scores_gemma":[0.9176389,0.00030706942,0.06306914,0.00039426843,0.00003342564,0.0001434842,0.00052469224,0.00033135535,0.017557627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928856,0.00011385044,0.0000321478,0.0001748525,0.00014411753,0.0002463463],"domain_scores_gemma":[0.9954608,0.0024363147,0.00045198397,0.0010169456,0.00023381895,0.00040017677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043741637,0.0006798931,0.0005193029,0.0004028818,0.0012585956,0.0017907209,0.0013691612,0.0006825074,0.010824769],"category_scores_gemma":[0.0027556457,0.0005153239,0.000764351,0.00061122316,0.0015756598,0.0038487911,0.00222985,0.0013894174,0.001208625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024662279,0.000323268,0.012315955,0.00071400753,0.00014764818,0.0015292784,0.0010911035,0.08521532,0.11894156,0.6825397,0.020152684,0.074563324],"study_design_scores_gemma":[0.00028693123,0.000289786,0.007019858,0.0000911074,0.000118764496,0.0016383353,0.0007421316,0.19342217,0.048195437,0.70375985,0.0443254,0.00011026511],"about_ca_topic_score_codex":0.0029702587,"about_ca_topic_score_gemma":0.0054352963,"teacher_disagreement_score":0.010824769,"about_ca_system_score_codex":0.0009962508,"about_ca_system_score_gemma":0.0008149194,"threshold_uncertainty_score":0.036212444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7074242,0.0007793087,0.23413526,0.0025846951,0.00012098116,0.00040027616,0.008306117,0.0007392666,0.04550989],"genre_scores_gemma":[0.8786737,0.0006041748,0.09909947,0.00047743318,0.0000608326,0.00032388666,0.008616555,0.00014177224,0.012002131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990146,0.00013484669,0.00007610197,0.00038183248,0.00019749819,0.00019511704],"domain_scores_gemma":[0.9949071,0.0027666248,0.00064929243,0.0008092301,0.0004830961,0.0003846371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048205737,0.0007137974,0.00077717716,0.0005364919,0.0012888311,0.0022870894,0.0019441443,0.00066429446,0.00700693],"category_scores_gemma":[0.003785605,0.00054725545,0.0009829866,0.0012344568,0.0011831953,0.0037605553,0.0014174896,0.0013430293,0.00095929217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023339621,0.00070065353,0.021462584,0.0022971595,0.000465185,0.0020113296,0.0020294278,0.08623396,0.09426894,0.61994755,0.016833523,0.1514157],"study_design_scores_gemma":[0.00036635605,0.00031168235,0.010010103,0.00018162334,0.0002747103,0.0033904167,0.0011820074,0.1286343,0.04589847,0.7622672,0.04735184,0.00013127993],"about_ca_topic_score_codex":0.0027238852,"about_ca_topic_score_gemma":0.0046419185,"teacher_disagreement_score":0.00700693,"about_ca_system_score_codex":0.0016182739,"about_ca_system_score_gemma":0.0011543432,"threshold_uncertainty_score":0.02344054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.712526,0.005497497,0.12671535,0.004352021,0.00011089021,0.000111520356,0.0013503177,0.00058303244,0.14875332],"genre_scores_gemma":[0.97008353,0.0020160193,0.02067791,0.00076102605,0.00012427331,0.000059352285,0.0007143766,0.000079152036,0.005484203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00014188846,0.00003264297,0.00016568552,0.00021851622,0.00017661572],"domain_scores_gemma":[0.9973145,0.0016938368,0.00034190752,0.00020283874,0.00021137019,0.00023543488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005378372,0.00037125306,0.00053538516,0.0020463257,0.0018639652,0.0018747575,0.00085030723,0.0008355364,0.0062511214],"category_scores_gemma":[0.002672434,0.00057949463,0.0006656846,0.0023648525,0.0028877708,0.0039548306,0.0020264527,0.001760256,0.0005933543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007455105,0.00005075815,0.0025117777,0.00022892472,0.00002753059,0.00061017193,0.0015628672,0.0054567633,0.0040393937,0.95933276,0.004073984,0.02203056],"study_design_scores_gemma":[0.000029011448,0.000047089507,0.0028423846,0.000065328066,0.000030594336,0.00069056614,0.0004839057,0.014589111,0.001066604,0.96885496,0.011273682,0.000026718493],"about_ca_topic_score_codex":0.0036506304,"about_ca_topic_score_gemma":0.0029748403,"teacher_disagreement_score":0.0062511214,"about_ca_system_score_codex":0.0018959922,"about_ca_system_score_gemma":0.0004550638,"threshold_uncertainty_score":0.02091211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79242253,0.001686067,0.161549,0.00090350315,0.0000958875,0.00011342701,0.00092143915,0.00044037806,0.041867718],"genre_scores_gemma":[0.9427022,0.0006153366,0.04993467,0.0002178151,0.000037514546,0.000067422974,0.00064350147,0.000094431074,0.0056871837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996191,0.00007446581,0.000021632279,0.00008500209,0.00007534338,0.00012438287],"domain_scores_gemma":[0.9985808,0.0005743988,0.00031836738,0.00015966162,0.00016795016,0.00019885812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025871658,0.0002616382,0.0004148202,0.00079180306,0.0010200639,0.0014756726,0.0005739557,0.00053697,0.004082804],"category_scores_gemma":[0.0018276725,0.00039612257,0.00036722107,0.0008106325,0.000968392,0.0016161313,0.0009932749,0.0007036632,0.00072435173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007137069,0.00009537192,0.007674239,0.0005083212,0.00007684712,0.0010985656,0.0013907044,0.040979944,0.044621162,0.8153356,0.010087804,0.077417634],"study_design_scores_gemma":[0.000056534307,0.00016210385,0.0062004225,0.00015272053,0.00007431988,0.0014701908,0.0010062455,0.09404193,0.023167755,0.8441434,0.029458348,0.0000660481],"about_ca_topic_score_codex":0.0013370343,"about_ca_topic_score_gemma":0.0020838869,"teacher_disagreement_score":0.004082804,"about_ca_system_score_codex":0.0008209453,"about_ca_system_score_gemma":0.00032870992,"threshold_uncertainty_score":0.013658345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8796855,0.00016774036,0.09608232,0.00022481557,0.000026038364,0.000026121785,0.00014908853,0.00010276259,0.023535676],"genre_scores_gemma":[0.98788774,0.00013469653,0.007560497,0.000079345766,0.0000350612,0.00003312166,0.00013098384,0.000031930467,0.004106551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997712,0.00004812753,0.0000073720844,0.000057997433,0.000053002368,0.000062298815],"domain_scores_gemma":[0.9992249,0.00033398555,0.00016154352,0.000104991246,0.000071984774,0.00010269751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022201847,0.00020473596,0.0002783049,0.00075441104,0.00058204896,0.0008068863,0.00034370902,0.0002445961,0.003519545],"category_scores_gemma":[0.0012428825,0.00021030456,0.00030562095,0.0004946188,0.0010478296,0.0014738258,0.00092364213,0.0006401056,0.0002514794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000875999,0.000024065335,0.0023800817,0.000062569605,0.000015708763,0.00024231852,0.0003610675,0.0056972154,0.010152274,0.96833605,0.00089818455,0.011742941],"study_design_scores_gemma":[0.000045156245,0.000120302786,0.005768518,0.000025492727,0.000032088377,0.0010276871,0.0004095482,0.052737195,0.01235188,0.91463095,0.012817553,0.000033639044],"about_ca_topic_score_codex":0.0003003259,"about_ca_topic_score_gemma":0.00031463738,"teacher_disagreement_score":0.003519545,"about_ca_system_score_codex":0.0002800972,"about_ca_system_score_gemma":0.00017395019,"threshold_uncertainty_score":0.0117740035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70189655,0.0007491162,0.26978475,0.00090300833,0.00010076663,0.00010560031,0.00057220476,0.00087071717,0.025017297],"genre_scores_gemma":[0.9495176,0.00027850704,0.04369762,0.0002808119,0.00007653095,0.00012383521,0.0005126646,0.00009645879,0.0054160003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880433,0.00024451004,0.00003592058,0.00039573808,0.00019176262,0.0003276865],"domain_scores_gemma":[0.99183625,0.003518016,0.00060278067,0.002442353,0.00066867867,0.0009319255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013287327,0.00047031353,0.000628701,0.00079266826,0.0019048795,0.0015158585,0.0015423226,0.00080046715,0.003177491],"category_scores_gemma":[0.0070852893,0.0007546638,0.00092493446,0.00089794444,0.0016654712,0.0029319227,0.0019724765,0.0012659343,0.00054136233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000872321,0.00028770798,0.017392483,0.00029642807,0.00014878335,0.0007792828,0.0015946756,0.15915148,0.036108885,0.69068336,0.018975414,0.073709175],"study_design_scores_gemma":[0.00015452996,0.0001787415,0.003909923,0.000048348906,0.00009876834,0.0011113267,0.0005021973,0.4861718,0.009677986,0.4786435,0.019451126,0.00005165902],"about_ca_topic_score_codex":0.0047833915,"about_ca_topic_score_gemma":0.0066526015,"teacher_disagreement_score":0.0047833915,"about_ca_system_score_codex":0.0015728776,"about_ca_system_score_gemma":0.001180639,"threshold_uncertainty_score":0.011412084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4529566,0.00035752993,0.48483336,0.00043334707,0.00014171722,0.000110388326,0.00048653246,0.0006615475,0.06001894],"genre_scores_gemma":[0.9157867,0.00030194464,0.0721481,0.00017810319,0.00010649266,0.00020688685,0.000841584,0.0001581405,0.010272098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998599,0.00027048573,0.000116343224,0.00029940697,0.00040875695,0.000306051],"domain_scores_gemma":[0.99726105,0.0009210072,0.0003550738,0.0007466215,0.0003882319,0.0003279311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512792,0.0006535623,0.0005072513,0.0011373569,0.0012735152,0.0019403988,0.0009700911,0.0006996868,0.0073125158],"category_scores_gemma":[0.004146905,0.0006896336,0.0006897598,0.0010462278,0.0015547251,0.0029383977,0.0017990916,0.0016391067,0.0014264086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010284219,0.000030064984,0.00048090026,0.00004262542,0.0000073248575,0.00030716832,0.00039624533,0.0022491869,0.012272943,0.9741735,0.00085987797,0.009077346],"study_design_scores_gemma":[0.00005559451,0.0001724541,0.0007529915,0.000048041242,0.000024278574,0.0010143408,0.00040270228,0.026888961,0.024300814,0.9294433,0.016839145,0.000057286456],"about_ca_topic_score_codex":0.00046538425,"about_ca_topic_score_gemma":0.0005811329,"teacher_disagreement_score":0.0073125158,"about_ca_system_score_codex":0.0007217705,"about_ca_system_score_gemma":0.0003708415,"threshold_uncertainty_score":0.02446276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6193225,0.0009229377,0.25987443,0.00165437,0.00037890128,0.00008989346,0.0006538507,0.00051951624,0.116583675],"genre_scores_gemma":[0.93915766,0.00035334018,0.038314372,0.0002055209,0.00024066678,0.00008007669,0.00031420312,0.00012593975,0.021208055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921834,0.00014529556,0.000044664794,0.00016374452,0.00023203112,0.00019586779],"domain_scores_gemma":[0.998389,0.00049405685,0.00020896982,0.00019692194,0.0002670589,0.0004439618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008688792,0.0004864536,0.00045538557,0.002278138,0.0016769336,0.0023862612,0.00065158855,0.0007536059,0.010068591],"category_scores_gemma":[0.002604753,0.00024245512,0.00061486714,0.0012213046,0.0024132128,0.0047563575,0.0019551625,0.0015992252,0.0009162342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013145533,0.0000056073486,0.00034768527,0.0000140689235,0.0000016976504,0.000041692278,0.00019595111,0.00038242445,0.0008944629,0.99355596,0.0006019394,0.003945451],"study_design_scores_gemma":[0.000010159662,0.00005445266,0.00075060764,0.000025241008,0.000008898933,0.00027909197,0.00038476085,0.010633827,0.0016865616,0.9729092,0.013218817,0.000038378825],"about_ca_topic_score_codex":0.0014868376,"about_ca_topic_score_gemma":0.0018673108,"teacher_disagreement_score":0.010068591,"about_ca_system_score_codex":0.0009882117,"about_ca_system_score_gemma":0.00047443353,"threshold_uncertainty_score":0.033682823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71229273,0.0017405263,0.19821079,0.0011382832,0.00018161713,0.000051042975,0.00041944225,0.00042146796,0.085544124],"genre_scores_gemma":[0.9458766,0.0008265907,0.029355897,0.00021351766,0.00017213609,0.000057520137,0.00030001238,0.00015963805,0.023037955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997316,0.000056304547,0.000008316785,0.000043921384,0.000093309885,0.00006652721],"domain_scores_gemma":[0.999468,0.00014477273,0.000083621344,0.00010599398,0.000087301516,0.00011024836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423271,0.00064731744,0.00040376492,0.002656625,0.00060529663,0.0016593026,0.0007429923,0.00060340593,0.0035429515],"category_scores_gemma":[0.0023385722,0.0002320804,0.00043533268,0.0012821527,0.0020459818,0.0028634558,0.0011852499,0.00085717795,0.00061450794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017629243,0.000007172996,0.00034716376,0.000017373102,0.0000050027943,0.000035932906,0.000068801586,0.0038097752,0.00063366396,0.9844637,0.0007484841,0.009845292],"study_design_scores_gemma":[0.000005698046,0.000011806683,0.0005523516,0.000010896833,0.0000046579607,0.00004572856,0.00006447309,0.017965907,0.0007554299,0.9767502,0.0038186498,0.000014234735],"about_ca_topic_score_codex":0.001949688,"about_ca_topic_score_gemma":0.0018237664,"teacher_disagreement_score":0.0035429515,"about_ca_system_score_codex":0.0011833074,"about_ca_system_score_gemma":0.00048050992,"threshold_uncertainty_score":0.011852384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71333057,0.0059131416,0.20066157,0.0022602037,0.00017890111,0.00023816421,0.0028302614,0.0005844073,0.07400269],"genre_scores_gemma":[0.90591234,0.0027733801,0.071352094,0.0007067396,0.00018693494,0.00013934204,0.004025731,0.00012626933,0.014777135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965155,0.0000501641,0.000019263023,0.00009871932,0.000084935484,0.00009528248],"domain_scores_gemma":[0.99924326,0.00024596442,0.00021654656,0.00008340314,0.00008674407,0.0001241644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002756166,0.0003938796,0.00037206995,0.0013063524,0.0008124471,0.0018471341,0.0006006469,0.00060604216,0.004439003],"category_scores_gemma":[0.0010763269,0.00048840453,0.0008423048,0.001868095,0.000978619,0.0015815768,0.0010418117,0.0010256456,0.0005130576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001421667,0.00009479109,0.0032635443,0.00027092022,0.00006251843,0.00042619844,0.0013452726,0.0121084945,0.012255525,0.91933066,0.008455888,0.04224397],"study_design_scores_gemma":[0.00004363573,0.00005980838,0.0038057968,0.00010866594,0.00007009373,0.0006513413,0.00061773934,0.023662183,0.0034394034,0.94611716,0.021398604,0.000025634807],"about_ca_topic_score_codex":0.003382597,"about_ca_topic_score_gemma":0.0039173663,"teacher_disagreement_score":0.004439003,"about_ca_system_score_codex":0.0014456979,"about_ca_system_score_gemma":0.00043644922,"threshold_uncertainty_score":0.014849901},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75446826,0.0005226332,0.1470187,0.0005429407,0.00013166567,0.00011605136,0.0004907131,0.0004320986,0.096276976],"genre_scores_gemma":[0.9640794,0.00025326837,0.020421673,0.00013336113,0.00009224935,0.00010426946,0.00039047014,0.00009263982,0.014432669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990453,0.00017713758,0.000051603787,0.00023204494,0.00028200666,0.00021187315],"domain_scores_gemma":[0.998971,0.00036691685,0.00014216163,0.00011663624,0.000111567664,0.00029173316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056776847,0.00062256504,0.0005062379,0.0011933617,0.0021010241,0.0022782476,0.0008025722,0.0005084443,0.010422341],"category_scores_gemma":[0.0014755257,0.0004998952,0.00073206756,0.0010129185,0.0026058485,0.004425558,0.0025872483,0.0016881091,0.000977437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010709227,0.000052379997,0.001064789,0.0000486093,0.000011574738,0.0002666237,0.0009816677,0.002033912,0.0062890174,0.9821177,0.0006215022,0.0064052152],"study_design_scores_gemma":[0.00003456035,0.00010719757,0.0016616131,0.000021452543,0.00002262368,0.0007458492,0.001283859,0.010300187,0.00923301,0.96345943,0.01308071,0.000049465776],"about_ca_topic_score_codex":0.0009500196,"about_ca_topic_score_gemma":0.001043548,"teacher_disagreement_score":0.010422341,"about_ca_system_score_codex":0.0008438347,"about_ca_system_score_gemma":0.0003593296,"threshold_uncertainty_score":0.034866214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48597795,0.01556391,0.371584,0.02539645,0.0012247913,0.0006334768,0.006331227,0.011322354,0.081965916],"genre_scores_gemma":[0.85722286,0.0033643001,0.11533306,0.0026279776,0.0008928556,0.0009496484,0.0052546547,0.0038119904,0.010542647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99017894,0.0037041074,0.00044009896,0.0020646136,0.0011577781,0.0024545249],"domain_scores_gemma":[0.9387662,0.048238676,0.001734085,0.0066936207,0.0016463142,0.002921205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079901945,0.0026669684,0.0030891793,0.0025097057,0.0028125248,0.0058980123,0.005612761,0.0035103157,0.015328391],"category_scores_gemma":[0.044904478,0.0015301672,0.0026167214,0.003635831,0.0034609458,0.0123628015,0.005293299,0.005862664,0.0037530505],"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.0077396603,0.0010375999,0.015711593,0.0028434792,0.00076026464,0.0006961414,0.0016875269,0.45543945,0.02296649,0.24650694,0.06399182,0.18061903],"study_design_scores_gemma":[0.0002931769,0.0001767659,0.001466546,0.0001344587,0.000177993,0.00018925802,0.00016254664,0.83781403,0.0023379163,0.15323307,0.0039474075,0.0000668217],"about_ca_topic_score_codex":0.0063446336,"about_ca_topic_score_gemma":0.007347405,"teacher_disagreement_score":0.015328391,"about_ca_system_score_codex":0.005192082,"about_ca_system_score_gemma":0.004680052,"threshold_uncertainty_score":0.05127853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43653488,0.0026696534,0.40352702,0.0013524443,0.0006751296,0.0001724776,0.0005270586,0.00031537423,0.15422598],"genre_scores_gemma":[0.9202725,0.0012055067,0.06147299,0.0002754848,0.0003582147,0.00009934635,0.00027121717,0.00006138923,0.015983392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951696,0.000096229895,0.000029993022,0.00008612742,0.00015810571,0.00011253612],"domain_scores_gemma":[0.9992605,0.00018028519,0.00019664755,0.000091494614,0.00018350624,0.000087459106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034544236,0.0006544736,0.00034075844,0.0016550575,0.00088903704,0.0019600564,0.00044093063,0.00078899035,0.006236591],"category_scores_gemma":[0.001692268,0.00034343865,0.00038947427,0.0011077415,0.0014144826,0.0018000382,0.0008294647,0.0013151579,0.0009110928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003283494,0.0000106924235,0.0001557087,0.000027864018,0.0000037090638,0.00018320951,0.000097699056,0.002868839,0.0047479435,0.9870697,0.00053207943,0.0042697233],"study_design_scores_gemma":[0.000028335791,0.000076499266,0.00050295773,0.000031529507,0.000007641464,0.0006635877,0.00017276852,0.037388396,0.009675179,0.94227374,0.009134314,0.00004494403],"about_ca_topic_score_codex":0.00067205913,"about_ca_topic_score_gemma":0.00047012838,"teacher_disagreement_score":0.006236591,"about_ca_system_score_codex":0.00074224576,"about_ca_system_score_gemma":0.00044241597,"threshold_uncertainty_score":0.020863473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65225977,0.0018751373,0.26879334,0.0073479987,0.00030012242,0.00013657399,0.0015040048,0.0005082616,0.067274794],"genre_scores_gemma":[0.948246,0.0006415678,0.040920578,0.0002919221,0.00029079895,0.00008107899,0.0008566834,0.00017362976,0.008497751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988832,0.00022754198,0.000037494174,0.00030024603,0.0002630805,0.00028852883],"domain_scores_gemma":[0.9951875,0.003191533,0.0003371379,0.00067892455,0.00026642857,0.00033836352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000920967,0.00034573,0.0008722831,0.0009856006,0.002441744,0.002412733,0.0009961687,0.0013345114,0.008515465],"category_scores_gemma":[0.0067023234,0.0005591742,0.0008202845,0.0012920382,0.0019417476,0.0067053274,0.0011708909,0.0011598986,0.00086996524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040201662,0.00013173367,0.007364154,0.00026042236,0.00009802695,0.00054510107,0.0013974076,0.028163154,0.008023348,0.83456963,0.013633976,0.10541113],"study_design_scores_gemma":[0.00003348026,0.0000539805,0.0033766383,0.00007997058,0.000049936327,0.00071011984,0.0009692825,0.06619411,0.0047866195,0.8993583,0.024340332,0.000047330603],"about_ca_topic_score_codex":0.0022133589,"about_ca_topic_score_gemma":0.0031166982,"teacher_disagreement_score":0.008515465,"about_ca_system_score_codex":0.0010464067,"about_ca_system_score_gemma":0.0005609901,"threshold_uncertainty_score":0.028487086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878785,0.0022528328,0.15828829,0.005591644,0.00010378177,0.00007221447,0.0028125306,0.0018528021,0.041147362],"genre_scores_gemma":[0.9616788,0.0011075563,0.02642234,0.0006418003,0.00017763946,0.00013247557,0.0017934194,0.00045105864,0.007594775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907625,0.00010006704,0.000026346721,0.0002386573,0.00023150416,0.00032716978],"domain_scores_gemma":[0.9872793,0.008935266,0.0013029258,0.0008633325,0.0007640048,0.00085508276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043707708,0.00072245795,0.0006823208,0.0010266536,0.0011282311,0.002398841,0.0012153803,0.0010345185,0.00433135],"category_scores_gemma":[0.0065229754,0.0005446564,0.00066318613,0.0013478845,0.0017185801,0.0056084516,0.0015395853,0.002203199,0.0009434578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010121414,0.00021324948,0.017614305,0.00082988024,0.00011473959,0.0010698277,0.002429329,0.08960424,0.059496153,0.70433515,0.03218015,0.09110076],"study_design_scores_gemma":[0.000112016874,0.00017422816,0.011587424,0.00011822633,0.00008609133,0.0020300501,0.0007155272,0.22815214,0.02145357,0.7017865,0.03370035,0.000083714054],"about_ca_topic_score_codex":0.003186669,"about_ca_topic_score_gemma":0.0041522984,"teacher_disagreement_score":0.00433135,"about_ca_system_score_codex":0.0013776236,"about_ca_system_score_gemma":0.0005974996,"threshold_uncertainty_score":0.01448983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.558352,0.0020553581,0.31273127,0.0021787141,0.001467023,0.00016156585,0.0021465027,0.0018508369,0.119056754],"genre_scores_gemma":[0.8212383,0.0008936808,0.13952065,0.0007470705,0.00032353518,0.00018247995,0.0019240859,0.00058924576,0.034581006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949217,0.000076985605,0.00005861366,0.00020038501,0.00009131706,0.00008054506],"domain_scores_gemma":[0.9992551,0.00026019994,0.000104047074,0.000114460294,0.00016638683,0.0000997739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028111486,0.00034022026,0.0004044273,0.0005386634,0.0011726901,0.0016324011,0.000306615,0.00088505825,0.006555213],"category_scores_gemma":[0.0014528781,0.00023697417,0.00036746764,0.0005245986,0.0020243987,0.0020047019,0.00097232807,0.0006513228,0.00279534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044424823,0.000054374996,0.0022150474,0.00047588028,0.000028428318,0.0016967056,0.0018052639,0.0013639601,0.07385907,0.8309531,0.006674657,0.08042912],"study_design_scores_gemma":[0.00006140333,0.00029006234,0.0021618681,0.0002212938,0.00006019759,0.004414314,0.00107492,0.008081459,0.062031154,0.7749122,0.14655241,0.00013875062],"about_ca_topic_score_codex":0.00037495286,"about_ca_topic_score_gemma":0.0003850471,"teacher_disagreement_score":0.006555213,"about_ca_system_score_codex":0.0003938839,"about_ca_system_score_gemma":0.0007305998,"threshold_uncertainty_score":0.021929324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314027,0.0003815981,0.11522125,0.00024668602,0.00007482512,0.00021615798,0.0019741685,0.0007853786,0.049697246],"genre_scores_gemma":[0.9536379,0.00021440485,0.033783738,0.00009849581,0.000033783366,0.00018592994,0.002042373,0.00023884127,0.009764523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989735,0.00012956631,0.00006275176,0.00018978996,0.00029963328,0.00034475146],"domain_scores_gemma":[0.99818796,0.0005227093,0.00020162159,0.0005258257,0.000335305,0.00022663391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043584596,0.000600109,0.000656758,0.0012460686,0.0022258507,0.0017354931,0.0008016801,0.00048287577,0.009925401],"category_scores_gemma":[0.0027561097,0.0004157737,0.00057417864,0.0016793398,0.0011975117,0.0017399399,0.0023129948,0.0008240231,0.00069616234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005601871,0.00021120453,0.0076687476,0.00031851782,0.00007338944,0.00083323923,0.0013496055,0.03344271,0.048749637,0.8443378,0.010438934,0.05201608],"study_design_scores_gemma":[0.000110702436,0.0002694903,0.010052098,0.00010254337,0.00014579162,0.001370972,0.0019059955,0.14923574,0.064580835,0.7364457,0.035684817,0.00009526143],"about_ca_topic_score_codex":0.0018919269,"about_ca_topic_score_gemma":0.003399128,"teacher_disagreement_score":0.009925401,"about_ca_system_score_codex":0.00095442246,"about_ca_system_score_gemma":0.0006613813,"threshold_uncertainty_score":0.03320378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34071514,0.0046123364,0.474143,0.010544863,0.0010585119,0.00009857768,0.0007693813,0.0022430848,0.16581522],"genre_scores_gemma":[0.90004754,0.0015741141,0.07374508,0.0019223077,0.00047476386,0.00012893444,0.0006727643,0.00067830796,0.020756103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982834,0.00034384173,0.000048236037,0.00052471395,0.0004923751,0.00030752277],"domain_scores_gemma":[0.9912544,0.004780564,0.0005153608,0.0025112587,0.0005110409,0.00042741967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017531418,0.00074665167,0.0009099711,0.0012871897,0.0011934526,0.002179099,0.0019808619,0.0017465599,0.012917992],"category_scores_gemma":[0.010973986,0.0005148854,0.001154424,0.0011181181,0.0031288825,0.0095565505,0.0030653675,0.0048370957,0.0018512382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003771674,0.00016027995,0.002914435,0.00024742016,0.000026378193,0.0002446118,0.00026588363,0.06970003,0.015014923,0.86389226,0.008281355,0.03887533],"study_design_scores_gemma":[0.000043075648,0.00012261576,0.0011614249,0.00006415867,0.000019101073,0.0002522962,0.000101533355,0.15041733,0.008685378,0.82315874,0.015929652,0.00004462292],"about_ca_topic_score_codex":0.0013798624,"about_ca_topic_score_gemma":0.0018554819,"teacher_disagreement_score":0.012917992,"about_ca_system_score_codex":0.0019201576,"about_ca_system_score_gemma":0.00091682497,"threshold_uncertainty_score":0.043214977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5128515,0.0010612595,0.41034532,0.0036367236,0.00025182526,0.0002185018,0.0015302572,0.001269145,0.06883546],"genre_scores_gemma":[0.91613495,0.00032253662,0.07393804,0.00040476152,0.00009971358,0.00021422391,0.0006431242,0.00039470653,0.007847971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678636,0.0007347559,0.00009284071,0.0010922172,0.00055255013,0.0007413086],"domain_scores_gemma":[0.9819786,0.010833053,0.00096545933,0.0042808936,0.0009268302,0.0010152225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026424583,0.00084459817,0.0011778902,0.0008952591,0.001405021,0.0031887689,0.0036617666,0.0016562161,0.009072241],"category_scores_gemma":[0.014389164,0.0006811902,0.0006675807,0.0011839839,0.0030877846,0.011193225,0.0036385856,0.003941305,0.00089669373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002142042,0.00072167267,0.006281996,0.0005317887,0.00008537014,0.00029929922,0.0007448058,0.15511853,0.02135435,0.65909517,0.014018629,0.13960637],"study_design_scores_gemma":[0.00020388061,0.00021692093,0.0034642667,0.000112061374,0.00005500119,0.0003161266,0.00044299685,0.4134292,0.014868022,0.5554376,0.011374925,0.000079065045],"about_ca_topic_score_codex":0.0020612963,"about_ca_topic_score_gemma":0.002964507,"teacher_disagreement_score":0.009072241,"about_ca_system_score_codex":0.0035934013,"about_ca_system_score_gemma":0.0024392144,"threshold_uncertainty_score":0.030349672},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20742495,0.0021491426,0.7638792,0.0019390165,0.00025610975,0.00009385699,0.00048441443,0.000835089,0.022938157],"genre_scores_gemma":[0.9238444,0.0028055562,0.06353148,0.00056696363,0.00069315085,0.00023102945,0.0005887218,0.00057112676,0.007167386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977422,0.00085753435,0.00007785049,0.00049851666,0.0005737733,0.00025015027],"domain_scores_gemma":[0.96862286,0.02248186,0.0024790461,0.0031240787,0.0020346874,0.0012575925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172653,0.0009887199,0.001341942,0.003903711,0.00091409095,0.0021321368,0.0034654813,0.0017422007,0.007971386],"category_scores_gemma":[0.038543623,0.00082392065,0.001288677,0.0022358182,0.0038668665,0.007985478,0.0027646625,0.0034829543,0.0011654994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015247245,0.000079550424,0.0033776413,0.00021786893,0.00004923286,0.00031941573,0.00033335757,0.11147054,0.0038734805,0.86257195,0.0032250078,0.014329467],"study_design_scores_gemma":[0.000028412302,0.000040644365,0.0015023216,0.000057190297,0.000024893856,0.00023847276,0.00007142818,0.45657182,0.0019192393,0.53768843,0.0018011522,0.000055988963],"about_ca_topic_score_codex":0.00263243,"about_ca_topic_score_gemma":0.0022418278,"teacher_disagreement_score":0.007971386,"about_ca_system_score_codex":0.0013072025,"about_ca_system_score_gemma":0.0005086772,"threshold_uncertainty_score":0.02666694},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29876193,0.00057387305,0.6616285,0.0039687743,0.000106732885,0.0005399981,0.0006486358,0.000371313,0.03340033],"genre_scores_gemma":[0.9507983,0.0004730947,0.034738805,0.00038774585,0.000111582274,0.00048401297,0.00016713003,0.00007186027,0.012767553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99239665,0.0043983897,0.00025755563,0.0011520627,0.0010833935,0.0007118953],"domain_scores_gemma":[0.958991,0.032127224,0.0029810718,0.0029831366,0.0010784584,0.0018391458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010086767,0.0010630727,0.0030084334,0.0011958486,0.0012071219,0.0033822895,0.003447311,0.0025592211,0.01069576],"category_scores_gemma":[0.032612145,0.00086074317,0.0013871487,0.0010579766,0.007012124,0.0061323093,0.0030145708,0.0029806416,0.0013033386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004141144,0.00007666686,0.0011561109,0.00010436591,0.00005930834,0.00034337575,0.0003113848,0.05053133,0.0014589796,0.93842536,0.0009151593,0.0062039047],"study_design_scores_gemma":[0.00025584266,0.00013247221,0.00049278745,0.000043973654,0.000033236072,0.00017970284,0.00010853464,0.42509973,0.00059099507,0.5718573,0.00114621,0.000059236427],"about_ca_topic_score_codex":0.0019191297,"about_ca_topic_score_gemma":0.0017739165,"teacher_disagreement_score":0.01069576,"about_ca_system_score_codex":0.0017788936,"about_ca_system_score_gemma":0.0011907507,"threshold_uncertainty_score":0.053344548},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35002017,0.007786052,0.4458746,0.010338923,0.0009980622,0.0003424713,0.0033877606,0.003608468,0.1776435],"genre_scores_gemma":[0.90129995,0.0015273448,0.072554894,0.0019212065,0.0009843953,0.00049375644,0.0021531784,0.0009909548,0.018074295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906489,0.0019984543,0.00041639747,0.0022183915,0.002872911,0.0018449635],"domain_scores_gemma":[0.953329,0.030710625,0.0028210261,0.007376322,0.0032200958,0.0025428976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068792934,0.0024480168,0.0026799773,0.0056204842,0.003802382,0.0055180383,0.007011384,0.0035391625,0.026658757],"category_scores_gemma":[0.044203524,0.0016740088,0.0022731633,0.0046753986,0.005513542,0.016719231,0.010427152,0.008324084,0.004952096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006307096,0.00030842042,0.004095017,0.00064501306,0.00017360764,0.00041953675,0.0011086211,0.057425994,0.008008671,0.86815965,0.025309317,0.033715386],"study_design_scores_gemma":[0.0000707118,0.00015214305,0.0011136247,0.00014352628,0.00012571407,0.00040541388,0.00023003409,0.24870566,0.0047041657,0.73440075,0.009831664,0.000116646675],"about_ca_topic_score_codex":0.0017600022,"about_ca_topic_score_gemma":0.0023976353,"teacher_disagreement_score":0.026658757,"about_ca_system_score_codex":0.0046047918,"about_ca_system_score_gemma":0.0017836476,"threshold_uncertainty_score":0.08918238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9132283,0.00043784623,0.04216004,0.00021894921,0.000075514574,0.000026578886,0.00013454573,0.00010736715,0.04361091],"genre_scores_gemma":[0.97362715,0.00032485908,0.01534231,0.00007657654,0.000053011565,0.00005581852,0.00028037527,0.000049490307,0.010190444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997099,0.000055135024,0.000015825171,0.000046842582,0.00008170707,0.000090544956],"domain_scores_gemma":[0.99957234,0.00012549106,0.000069644564,0.00007582055,0.0000534708,0.00010327398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003468868,0.00025930555,0.00027431888,0.00095565367,0.0006827491,0.0011119006,0.0004706499,0.00027384775,0.0041410215],"category_scores_gemma":[0.0012873681,0.0002032645,0.0003656104,0.00050329074,0.0011563671,0.001221557,0.0009577729,0.0005825673,0.0004207637],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005330866,0.000018002202,0.0010094017,0.000043584678,0.0000055537776,0.00014795201,0.00026656696,0.0045653684,0.0057302564,0.9731502,0.0010985086,0.013911384],"study_design_scores_gemma":[0.00003381357,0.00006880367,0.0022056631,0.00003984239,0.000012981706,0.0007520203,0.00038180125,0.056673408,0.009932455,0.9166553,0.013218081,0.000025787702],"about_ca_topic_score_codex":0.00058815285,"about_ca_topic_score_gemma":0.000756969,"teacher_disagreement_score":0.0041410215,"about_ca_system_score_codex":0.0007162265,"about_ca_system_score_gemma":0.0002451478,"threshold_uncertainty_score":0.013853133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15637347,0.0019746071,0.8027055,0.0020476845,0.00017862853,0.00006895727,0.00027495006,0.00051113253,0.035865057],"genre_scores_gemma":[0.89181066,0.001370867,0.09321909,0.00070360285,0.0006028068,0.00040222512,0.00032338177,0.00050383614,0.011063592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973386,0.0011813584,0.000094753195,0.0004692227,0.0006581643,0.00025782787],"domain_scores_gemma":[0.98803186,0.008550188,0.0009017548,0.0009782559,0.0009674832,0.000570511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004890369,0.00089266413,0.001241007,0.0050669457,0.0017108106,0.0041776095,0.0019228314,0.0008374773,0.0049233935],"category_scores_gemma":[0.017570946,0.0006595706,0.0018790773,0.0024619435,0.006677516,0.007497331,0.0034338848,0.0046511437,0.0007966601],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000507525,0.000008313767,0.00022418941,0.000017131895,0.000005742375,0.000034192904,0.00008667739,0.001790254,0.00015122471,0.995708,0.0002680168,0.0017011815],"study_design_scores_gemma":[0.0000056352637,0.0000076235297,0.00012201627,0.0000118631315,0.0000047884596,0.000041901436,0.000025306226,0.02531169,0.00023257772,0.97321814,0.0010090189,0.000009387786],"about_ca_topic_score_codex":0.0014255864,"about_ca_topic_score_gemma":0.0010814365,"teacher_disagreement_score":0.0050669457,"about_ca_system_score_codex":0.003348609,"about_ca_system_score_gemma":0.001156754,"threshold_uncertainty_score":0.025863051},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7828524,0.00037522617,0.19876707,0.00072508585,0.000059813876,0.00008611621,0.0006571472,0.00072971557,0.015747447],"genre_scores_gemma":[0.8734915,0.00034266294,0.11837477,0.00027940102,0.00004232315,0.00010746894,0.0018669835,0.00027309454,0.005221828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941504,0.00015908203,0.000029114992,0.00019289998,0.00010046659,0.000103489016],"domain_scores_gemma":[0.9958851,0.0014435456,0.000593769,0.0012137454,0.00046701054,0.00039686446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544707,0.0005580141,0.0005787053,0.00088778377,0.00089403667,0.0008925012,0.0010708214,0.0007254743,0.0030521383],"category_scores_gemma":[0.0040231906,0.0008165817,0.0007697608,0.0007707888,0.0012133301,0.0018102041,0.0018859135,0.0017273336,0.0006021547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009821852,0.00027804615,0.019449817,0.000804045,0.0001620007,0.0011524127,0.0023202377,0.046791207,0.116369285,0.712979,0.008832906,0.08987881],"study_design_scores_gemma":[0.00020033437,0.0004827103,0.007664712,0.00020472189,0.00023827692,0.002063422,0.0014136093,0.17382897,0.051643066,0.73930794,0.022852166,0.000099992765],"about_ca_topic_score_codex":0.0007828018,"about_ca_topic_score_gemma":0.0020229213,"teacher_disagreement_score":0.0030521383,"about_ca_system_score_codex":0.0007920182,"about_ca_system_score_gemma":0.0005424729,"threshold_uncertainty_score":0.010210454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2146348,0.01619661,0.6282604,0.012246825,0.0018046993,0.0002626293,0.0030125694,0.0050239693,0.11855744],"genre_scores_gemma":[0.8189657,0.0069539077,0.13561389,0.0030456218,0.004536635,0.0011268237,0.0030840847,0.0024764617,0.024196891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9870151,0.0023226484,0.00083301275,0.003640779,0.0037433614,0.0024450356],"domain_scores_gemma":[0.8789766,0.0922285,0.004315617,0.013015008,0.0062989215,0.0051653986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007264576,0.0023402392,0.0029404215,0.004677749,0.003914394,0.0063393903,0.006618493,0.0035867011,0.013966726],"category_scores_gemma":[0.09312141,0.001550283,0.0022905588,0.0034911016,0.007192266,0.020104151,0.008013384,0.00948838,0.004251227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017567959,0.00083393493,0.015865207,0.0016020433,0.00026627575,0.0009081167,0.0019729813,0.048469026,0.027204532,0.73226094,0.030893544,0.1379666],"study_design_scores_gemma":[0.00008589874,0.00021796695,0.0038774638,0.00037864552,0.0002061793,0.0012922462,0.00023593596,0.20697956,0.010430788,0.7619141,0.014146272,0.00023494531],"about_ca_topic_score_codex":0.0018371468,"about_ca_topic_score_gemma":0.0024739148,"teacher_disagreement_score":0.013966726,"about_ca_system_score_codex":0.0057257656,"about_ca_system_score_gemma":0.0032017329,"threshold_uncertainty_score":0.046723425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.948085,0.0005278248,0.03899285,0.0009147612,0.00006171447,0.000028494671,0.00033919374,0.00048270472,0.010567436],"genre_scores_gemma":[0.993174,0.00033493608,0.0041619637,0.000072781644,0.00007157766,0.00005904552,0.00030233452,0.00009644217,0.0017267417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919444,0.00018496752,0.000023169754,0.00019749718,0.00019694008,0.00020300763],"domain_scores_gemma":[0.98856854,0.0063164076,0.0016861231,0.0011354174,0.0011250591,0.0011684468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014729068,0.00042921279,0.0006839673,0.0030228903,0.0009783957,0.0016233063,0.0017179095,0.0011057552,0.0027810081],"category_scores_gemma":[0.02148148,0.0005299612,0.000600843,0.0010006869,0.0034188922,0.0022881594,0.0015460389,0.0015498498,0.0003272185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040490375,0.00012256946,0.026642613,0.00025363968,0.000060739618,0.0007808771,0.001152647,0.108438656,0.021402717,0.8124893,0.005561998,0.022689475],"study_design_scores_gemma":[0.00005688438,0.00010717434,0.02198496,0.00009150146,0.000047007085,0.0012227182,0.0005418307,0.6218087,0.008795637,0.34237862,0.00280383,0.00016111544],"about_ca_topic_score_codex":0.002891666,"about_ca_topic_score_gemma":0.002055437,"teacher_disagreement_score":0.0030228903,"about_ca_system_score_codex":0.0022549457,"about_ca_system_score_gemma":0.00091430574,"threshold_uncertainty_score":0.016360879},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59601825,0.0007884159,0.35028616,0.0015270751,0.000061268875,0.00011816295,0.0011496957,0.00089698465,0.049153976],"genre_scores_gemma":[0.9299782,0.00063808926,0.053296514,0.0005309278,0.00006533996,0.0001566387,0.0017894086,0.00023711997,0.013307785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993262,0.00009117303,0.000034808276,0.00020975329,0.00020641157,0.00013159102],"domain_scores_gemma":[0.9957014,0.0020025452,0.0005468132,0.00080196594,0.00057326845,0.00037390552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002005,0.00054550567,0.0006546046,0.00073127303,0.0012605254,0.0017247908,0.0014158613,0.0010352663,0.007952795],"category_scores_gemma":[0.004233372,0.0008514537,0.001190041,0.001061584,0.0025362016,0.0060827266,0.002194904,0.0018397289,0.0010554615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001973186,0.000049523005,0.004001452,0.00024009765,0.000043617456,0.00035683537,0.0006094719,0.018939953,0.008276926,0.9402299,0.003524806,0.023530046],"study_design_scores_gemma":[0.000081011625,0.00024979387,0.0031746551,0.000049555147,0.0000968779,0.0016846388,0.0003709011,0.058411762,0.012758836,0.89551216,0.027562967,0.00004678713],"about_ca_topic_score_codex":0.0009790531,"about_ca_topic_score_gemma":0.0014388497,"teacher_disagreement_score":0.007952795,"about_ca_system_score_codex":0.0009153046,"about_ca_system_score_gemma":0.00046204613,"threshold_uncertainty_score":0.026604772},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26839584,0.0018585369,0.4640664,0.0026835594,0.0005172091,0.00023741134,0.0007618878,0.00054557784,0.2609336],"genre_scores_gemma":[0.926069,0.0009216073,0.039898843,0.00046062522,0.0005081051,0.00022709978,0.00055879145,0.00012309391,0.031232761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992872,0.00013602413,0.000038777336,0.00011899964,0.0002944011,0.00012463814],"domain_scores_gemma":[0.9991405,0.00026974294,0.00012633184,0.00010284937,0.00016674085,0.0001937041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086472527,0.0007944548,0.0004348464,0.0020661121,0.0017333531,0.0025713095,0.00081794104,0.00087858806,0.010425932],"category_scores_gemma":[0.0019292689,0.00030446172,0.001292855,0.00094276416,0.0026404057,0.0058691325,0.0023306466,0.0018719424,0.0012578892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001828229,0.0000055820537,0.00005405632,0.0000075070916,0.000001329242,0.00004431274,0.00007708287,0.00056252774,0.0002322262,0.9978064,0.0002185966,0.0009885449],"study_design_scores_gemma":[0.0000027000044,0.000005159827,0.000051897616,0.0000051211086,0.0000017795124,0.0000701088,0.000045847682,0.003667612,0.00020233075,0.9939956,0.0019464726,0.0000053056915],"about_ca_topic_score_codex":0.001117047,"about_ca_topic_score_gemma":0.0012242286,"teacher_disagreement_score":0.010425932,"about_ca_system_score_codex":0.0013443519,"about_ca_system_score_gemma":0.00074982684,"threshold_uncertainty_score":0.034878194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1746871,0.031338368,0.44865334,0.020074774,0.0052990466,0.00023583345,0.0012356829,0.001762392,0.31671342],"genre_scores_gemma":[0.80051327,0.012593977,0.13618359,0.0045110635,0.005881298,0.00067725097,0.00077552994,0.001222295,0.037641726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942731,0.0012017052,0.000568465,0.0017723419,0.0012050826,0.0009793134],"domain_scores_gemma":[0.96533495,0.028093763,0.0010559178,0.0034041896,0.0010763959,0.001034764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040439214,0.0025741493,0.0019906112,0.0026937195,0.0038873632,0.005203381,0.0032786794,0.002428214,0.010471413],"category_scores_gemma":[0.023142511,0.0021488888,0.0024429325,0.002796099,0.0091325175,0.021643821,0.0078021307,0.010127275,0.0040945434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012198476,0.00019548334,0.0046275496,0.0010815819,0.00012458998,0.0015140144,0.0019815431,0.013331778,0.017990353,0.84143096,0.02334019,0.09316214],"study_design_scores_gemma":[0.000063122265,0.00016831994,0.0011409714,0.00021021279,0.00010637838,0.0011678239,0.00018571784,0.020105055,0.007155648,0.9378823,0.03170661,0.000107859625],"about_ca_topic_score_codex":0.0011916636,"about_ca_topic_score_gemma":0.0012123049,"teacher_disagreement_score":0.010471413,"about_ca_system_score_codex":0.0025202637,"about_ca_system_score_gemma":0.0011327809,"threshold_uncertainty_score":0.035030305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71734726,0.0011029764,0.16776127,0.0013211957,0.00032865212,0.00008816824,0.0003186709,0.00017892738,0.11155289],"genre_scores_gemma":[0.9530435,0.000580059,0.02701214,0.00018404268,0.00025136565,0.00009678217,0.00023589848,0.00005989357,0.018536283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944764,0.00007904123,0.000035961926,0.00012106908,0.00021970374,0.00009658804],"domain_scores_gemma":[0.99931693,0.00023702026,0.00011098528,0.00011142168,0.00008923523,0.00013434829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045335636,0.00036462257,0.00042164544,0.0013547777,0.0014819899,0.0034853749,0.0006741883,0.0005518871,0.008124616],"category_scores_gemma":[0.0014159395,0.0002631929,0.0005299758,0.0010320619,0.0032272802,0.004326951,0.0016690205,0.0016408992,0.0007935279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030837506,0.000007638586,0.00043920847,0.000019309955,0.0000023011437,0.0000672974,0.00022205569,0.0004503187,0.0010664581,0.9913942,0.0003419375,0.0059583457],"study_design_scores_gemma":[0.000015059197,0.00005491159,0.0010853666,0.000025685444,0.000011924649,0.0005746829,0.0008103138,0.0062899017,0.0037079768,0.96952516,0.017870774,0.000028316248],"about_ca_topic_score_codex":0.0006637499,"about_ca_topic_score_gemma":0.0004754,"teacher_disagreement_score":0.008124616,"about_ca_system_score_codex":0.0007661796,"about_ca_system_score_gemma":0.00043073998,"threshold_uncertainty_score":0.02717954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.344844,0.0005224187,0.6281237,0.0002350066,0.00009401291,0.000023719256,0.00015213405,0.00033834367,0.02566655],"genre_scores_gemma":[0.9496785,0.00035373136,0.042996068,0.000051344286,0.000028905135,0.000023193677,0.00013970087,0.00009868869,0.0066298107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999198,0.000017328271,0.0000033552492,0.000012891704,0.000029123748,0.000017550297],"domain_scores_gemma":[0.9998324,0.00005463773,0.000019112618,0.00003497789,0.00003459073,0.000024381663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022987595,0.0003272687,0.0003486144,0.0009319395,0.00034975304,0.0009899489,0.0004966079,0.00038137537,0.0031358625],"category_scores_gemma":[0.000982123,0.00013245383,0.00024684492,0.0004023429,0.0008117147,0.0013153282,0.0005643769,0.00075984973,0.0005860821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007396944,0.000030169975,0.00076525076,0.00006453754,0.00001230747,0.00013028897,0.00014742417,0.1074135,0.008394955,0.8491419,0.0009131267,0.032912675],"study_design_scores_gemma":[0.000010276841,0.000026573021,0.00041215037,0.000013759475,0.000005764488,0.00010047297,0.00012092154,0.5577331,0.0034504468,0.4341385,0.003973584,0.00001458234],"about_ca_topic_score_codex":0.0010170799,"about_ca_topic_score_gemma":0.00061670085,"teacher_disagreement_score":0.0031358625,"about_ca_system_score_codex":0.00043123856,"about_ca_system_score_gemma":0.0002806222,"threshold_uncertainty_score":0.010490477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8306363,0.0005258521,0.092736945,0.00069646543,0.0001232034,0.0000833488,0.0009941721,0.00047498304,0.073728666],"genre_scores_gemma":[0.9526572,0.00042709173,0.029727532,0.00016934235,0.00015181936,0.00007712174,0.0010545057,0.0000901145,0.015645195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991505,0.0001318652,0.00005933504,0.00019591427,0.00021170275,0.0002507192],"domain_scores_gemma":[0.9980558,0.0005233783,0.00038448378,0.00033264366,0.0003021162,0.00040155146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041215052,0.00036632808,0.0003678991,0.0012342628,0.0014189226,0.0017161409,0.0007059745,0.00050840067,0.0059407875],"category_scores_gemma":[0.0021476103,0.0004806455,0.000547716,0.0013369857,0.0015972272,0.0025894656,0.0011622299,0.001082608,0.0005710552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009705252,0.000048161826,0.0019988497,0.00007019906,0.00001326307,0.00023017342,0.00041952444,0.0065649077,0.0049459958,0.96002376,0.0025039534,0.023084147],"study_design_scores_gemma":[0.000030643434,0.00008686824,0.00223766,0.00003557505,0.000032804604,0.00043843756,0.00032555635,0.02934048,0.006068587,0.9361899,0.025167266,0.000046149584],"about_ca_topic_score_codex":0.0036528565,"about_ca_topic_score_gemma":0.003908644,"teacher_disagreement_score":0.0059407875,"about_ca_system_score_codex":0.0013169685,"about_ca_system_score_gemma":0.0007647852,"threshold_uncertainty_score":0.019873917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39664266,0.001142037,0.4567678,0.0014544184,0.00041002754,0.00015663126,0.00045430992,0.00052076456,0.14245151],"genre_scores_gemma":[0.96601874,0.00028575218,0.020246128,0.0003459762,0.00009311166,0.000107712905,0.00017911219,0.00009067517,0.012632934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995408,0.00014084991,0.000018677678,0.00006851298,0.00013396368,0.00009723766],"domain_scores_gemma":[0.9995993,0.00012967888,0.00004736312,0.00008208086,0.000054735494,0.000086943626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003529285,0.00028054405,0.00033305294,0.0006269741,0.00080686284,0.00088587543,0.000505373,0.0009433203,0.008154879],"category_scores_gemma":[0.0012257332,0.00024146521,0.0004407632,0.00039998489,0.0016945815,0.0017307658,0.0012837963,0.00090357853,0.000587033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000607273,0.000010077417,0.00005780231,0.000014573919,0.0000023652387,0.000042035397,0.000058671205,0.0022572917,0.0010347385,0.9946578,0.0004308293,0.0014275933],"study_design_scores_gemma":[0.000014180927,0.000019002471,0.0001481204,0.000011297882,0.0000028811482,0.00008567532,0.000057574463,0.035594177,0.0005295575,0.9600675,0.0034587202,0.000011251905],"about_ca_topic_score_codex":0.000924449,"about_ca_topic_score_gemma":0.00071443233,"teacher_disagreement_score":0.008154879,"about_ca_system_score_codex":0.00058584753,"about_ca_system_score_gemma":0.000412554,"threshold_uncertainty_score":0.027280748},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17178558,0.0008332302,0.71533835,0.0019151752,0.00054468476,0.00022234372,0.0007194946,0.000945917,0.107695304],"genre_scores_gemma":[0.77145004,0.0010235858,0.18838832,0.0020365075,0.0005301392,0.00041496658,0.0010759853,0.0004909827,0.0345894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998312,0.00034637205,0.00007942523,0.0005704939,0.00040693555,0.000284895],"domain_scores_gemma":[0.99357104,0.0033351213,0.00054853165,0.0012102433,0.0006590388,0.00067611743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021547484,0.00086971873,0.001025189,0.0013460027,0.0016092523,0.0019646015,0.0018272436,0.0010226839,0.015310005],"category_scores_gemma":[0.008009387,0.00041705786,0.0012909004,0.0011910821,0.0021412605,0.006014766,0.0040724636,0.0030669342,0.0019843217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014938545,0.000048371425,0.0006677049,0.00013526597,0.000029349889,0.00022478602,0.00033335484,0.005177023,0.0038695168,0.9702232,0.003036748,0.016105268],"study_design_scores_gemma":[0.00005950485,0.00015166272,0.00070265704,0.000043107084,0.0000538892,0.00043740452,0.00011026324,0.037383314,0.0060147,0.9365689,0.018438114,0.000036529214],"about_ca_topic_score_codex":0.0004990113,"about_ca_topic_score_gemma":0.0005939592,"teacher_disagreement_score":0.015310005,"about_ca_system_score_codex":0.0010679613,"about_ca_system_score_gemma":0.0005856401,"threshold_uncertainty_score":0.05121714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16254877,0.002492926,0.6588595,0.0018331405,0.0009070499,0.0001351715,0.00024217923,0.0006983757,0.17228302],"genre_scores_gemma":[0.7755811,0.002612471,0.1785512,0.0010844874,0.0016175861,0.00022652409,0.0002711534,0.00059869385,0.03945671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925333,0.00021625034,0.00003788616,0.000105085586,0.00027658496,0.00011078238],"domain_scores_gemma":[0.99909985,0.00038442353,0.00007947032,0.00012923084,0.00018448249,0.0001226063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010339913,0.0009036004,0.0005415249,0.002435304,0.0011821351,0.0016438384,0.00086837064,0.00069375255,0.008759628],"category_scores_gemma":[0.003151084,0.00043066154,0.00091015105,0.0012649695,0.0027738265,0.0038113117,0.0017555108,0.002331617,0.001803024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011995344,0.000013675148,0.000045379224,0.000027567028,0.0000020324972,0.000059984446,0.00014350393,0.000911391,0.0010557037,0.9891623,0.0007837412,0.007782678],"study_design_scores_gemma":[0.0000054290845,0.000019308665,0.00006966433,0.00001888006,0.0000027349392,0.00010831992,0.00005453372,0.012904014,0.0012056839,0.9810878,0.0045069987,0.000016627451],"about_ca_topic_score_codex":0.0008631011,"about_ca_topic_score_gemma":0.001194742,"teacher_disagreement_score":0.008759628,"about_ca_system_score_codex":0.0010516936,"about_ca_system_score_gemma":0.00061546924,"threshold_uncertainty_score":0.029303849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.765566,0.0009545588,0.17458552,0.00089780486,0.00011100337,0.000074845506,0.00085566216,0.00046194502,0.056492724],"genre_scores_gemma":[0.94888294,0.00072872214,0.03930929,0.00029094602,0.00006507752,0.00012057462,0.0012675477,0.000107347405,0.009227663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999711,0.00008163534,0.000014446604,0.000055971082,0.00007369612,0.00006328615],"domain_scores_gemma":[0.99921715,0.00021089488,0.00014880057,0.00019889226,0.00011677641,0.00010758563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014032469,0.00021563833,0.00023820876,0.00036982418,0.00051463494,0.00083496614,0.00042522256,0.00028658754,0.0031669422],"category_scores_gemma":[0.0010472673,0.00033834326,0.00042711486,0.00042545403,0.0006466919,0.0014686498,0.0013698981,0.0006089961,0.0004737807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023108031,0.000035490408,0.0032643613,0.0002316911,0.00005470187,0.001009429,0.0005985607,0.0355317,0.03622462,0.889088,0.0070634107,0.02666704],"study_design_scores_gemma":[0.000038981947,0.000063404535,0.0049692807,0.000064260494,0.000041742347,0.00083583477,0.00039522856,0.08370148,0.012287957,0.8779308,0.019634858,0.000036138394],"about_ca_topic_score_codex":0.0013477292,"about_ca_topic_score_gemma":0.0016629724,"teacher_disagreement_score":0.0031669422,"about_ca_system_score_codex":0.000492802,"about_ca_system_score_gemma":0.0003425463,"threshold_uncertainty_score":0.010594487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92929125,0.00038279648,0.04340513,0.00034817174,0.000044268738,0.000051651117,0.0003705198,0.00017788332,0.025928363],"genre_scores_gemma":[0.98687786,0.00018351676,0.00859111,0.00006772415,0.000028922486,0.000033349348,0.000608873,0.000031124524,0.0035775148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990626,0.00008142857,0.00005876748,0.0002348873,0.00033385615,0.00022857275],"domain_scores_gemma":[0.99729484,0.00096862373,0.00040640638,0.00042040844,0.00025759757,0.0006521832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050236087,0.0006036116,0.0008250771,0.0013717964,0.0017542838,0.0037882167,0.0008648204,0.00072034495,0.0063522076],"category_scores_gemma":[0.003696755,0.000946492,0.00068063376,0.0013272788,0.0027203541,0.004398298,0.0026415135,0.0013393889,0.0004840952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040121682,0.00009233427,0.010592347,0.00014264969,0.00005259352,0.0009723319,0.0009874136,0.009620713,0.01629625,0.9288345,0.0021904025,0.029817328],"study_design_scores_gemma":[0.00006131433,0.00007112987,0.0058236094,0.000038341328,0.000046496476,0.0014386661,0.0009207172,0.035815537,0.009961458,0.93479216,0.010985316,0.0000453146],"about_ca_topic_score_codex":0.001393144,"about_ca_topic_score_gemma":0.0016965251,"teacher_disagreement_score":0.0063522076,"about_ca_system_score_codex":0.0013362544,"about_ca_system_score_gemma":0.00044917324,"threshold_uncertainty_score":0.021250308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78553456,0.0033543108,0.09705305,0.0040703896,0.00034125426,0.00007607767,0.00032755846,0.000193264,0.109049514],"genre_scores_gemma":[0.98113316,0.0009910424,0.012189577,0.00037827145,0.0003961953,0.000057265992,0.0002870022,0.000033724453,0.004533852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979785,0.00043614348,0.0001397787,0.000363187,0.0006429863,0.0004394012],"domain_scores_gemma":[0.99469984,0.002707946,0.0007686293,0.0004949705,0.00044235104,0.0008863573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017889795,0.0007617064,0.0011390358,0.002352324,0.0036729905,0.00357707,0.0017702052,0.0024927668,0.007076479],"category_scores_gemma":[0.0057015535,0.00061706005,0.0008964766,0.004151143,0.008061153,0.007856592,0.003174419,0.0029584372,0.0012812135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009297373,0.00006978396,0.00068284234,0.000087162916,0.000012358263,0.0011261388,0.0005088507,0.0013943719,0.001035861,0.98856467,0.0012883282,0.0051366915],"study_design_scores_gemma":[0.000031310603,0.000025764146,0.00022396802,0.000022246542,0.000006678076,0.0008475025,0.00027736893,0.0047831065,0.00077678653,0.9913173,0.0016600408,0.000027938058],"about_ca_topic_score_codex":0.0008717776,"about_ca_topic_score_gemma":0.0006135175,"teacher_disagreement_score":0.007076479,"about_ca_system_score_codex":0.00090630277,"about_ca_system_score_gemma":0.0006001198,"threshold_uncertainty_score":0.023673177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67069256,0.00048516112,0.1865728,0.0015343381,0.00035123393,0.00009885532,0.00048332193,0.000905497,0.1388763],"genre_scores_gemma":[0.97802496,0.00025046626,0.016027818,0.0002917126,0.000075938944,0.00009026431,0.0002054785,0.00004670331,0.0049868226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991103,0.00008241333,0.000069788715,0.00021075593,0.00033158995,0.00019518058],"domain_scores_gemma":[0.9975563,0.0013126767,0.00030926007,0.00040336038,0.0001815056,0.00023677782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005637895,0.0003382315,0.000411531,0.0004645758,0.0012634866,0.0017089718,0.00065207377,0.0006462532,0.0056610303],"category_scores_gemma":[0.005181153,0.00027001512,0.0006289839,0.0004910937,0.0028033974,0.0030005435,0.0026317178,0.001428809,0.00048218857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012721334,0.000029697816,0.0018647081,0.00015036458,0.000013003498,0.00034300174,0.0006785327,0.009883001,0.01129114,0.95798486,0.0021577424,0.015476794],"study_design_scores_gemma":[0.000057279605,0.00008417557,0.0011159695,0.000041088028,0.000034605033,0.0004775483,0.00051672384,0.028224625,0.018152941,0.937334,0.013913363,0.000047660084],"about_ca_topic_score_codex":0.0012762158,"about_ca_topic_score_gemma":0.0010634267,"teacher_disagreement_score":0.0056610303,"about_ca_system_score_codex":0.0007148011,"about_ca_system_score_gemma":0.0005465134,"threshold_uncertainty_score":0.018938065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046011347,0.00028392012,0.86150414,0.0035534534,0.0005278826,0.0006248361,0.0016257247,0.0005925679,0.0852761],"genre_scores_gemma":[0.1534838,0.00043972794,0.80543494,0.00063658925,0.0002716031,0.0008278665,0.0023182963,0.00036788714,0.036219258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895823,0.00015793373,0.000068391986,0.00027638228,0.0002909548,0.0002481066],"domain_scores_gemma":[0.998965,0.00054085813,0.0000642549,0.00012765726,0.00021094305,0.000091234084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084826583,0.001288952,0.0011012255,0.0009140979,0.002014762,0.0021528157,0.0018885263,0.0031098952,0.022215884],"category_scores_gemma":[0.004868263,0.00058382686,0.0024979915,0.0010379332,0.0015359159,0.0026310096,0.0031659475,0.0036777803,0.003143105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096554744,0.0002657709,0.00044113563,0.00045832412,0.00006471125,0.0006775113,0.00036706217,0.06269399,0.0034844244,0.8361922,0.025511527,0.069746785],"study_design_scores_gemma":[0.0001244768,0.000076267825,0.00016911821,0.00007880509,0.00005275864,0.00029687653,0.00028434227,0.09682648,0.0020042637,0.8741067,0.02594345,0.000036429912],"about_ca_topic_score_codex":0.0017091727,"about_ca_topic_score_gemma":0.002844105,"teacher_disagreement_score":0.022215884,"about_ca_system_score_codex":0.00092733547,"about_ca_system_score_gemma":0.0029723197,"threshold_uncertainty_score":0.07431948},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7073993,0.00092027144,0.1984844,0.0014961758,0.00017850229,0.000092296825,0.0014542531,0.0015316654,0.08844301],"genre_scores_gemma":[0.8961159,0.00033128154,0.08803041,0.00043088154,0.00014390035,0.00014139242,0.0006996306,0.00033699142,0.013769721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994491,0.00010258604,0.00005832903,0.00014130476,0.00011576364,0.00013289072],"domain_scores_gemma":[0.9986046,0.0006371903,0.0001995047,0.00018162305,0.00021085606,0.00016624632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031071386,0.00040880684,0.00050722715,0.0008863351,0.0009536162,0.0016987653,0.00044685087,0.0008162915,0.0067566056],"category_scores_gemma":[0.00290714,0.0003321733,0.00037197876,0.00057820417,0.0015078923,0.00211336,0.0013408682,0.0007969486,0.002462967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005813354,0.00007986302,0.0020578154,0.00044319013,0.000034346627,0.0010739675,0.0011418699,0.0066939825,0.117002845,0.8116349,0.006079539,0.05317638],"study_design_scores_gemma":[0.00006486658,0.00025700484,0.001424677,0.00011928525,0.00005183188,0.0015944643,0.00052873837,0.024567993,0.049409114,0.9035307,0.018341491,0.000109822526],"about_ca_topic_score_codex":0.000359238,"about_ca_topic_score_gemma":0.00060794066,"teacher_disagreement_score":0.0067566056,"about_ca_system_score_codex":0.0004888211,"about_ca_system_score_gemma":0.0005763532,"threshold_uncertainty_score":0.022603095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3592966,0.0014249786,0.49039182,0.022102572,0.0007527124,0.00056127657,0.0016142313,0.0010923184,0.12276358],"genre_scores_gemma":[0.89442927,0.00036413322,0.06651258,0.0016468791,0.00021651905,0.00020480169,0.00068459427,0.00015782501,0.03578336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980489,0.0006835936,0.00006165017,0.00059206714,0.00029177815,0.00032206133],"domain_scores_gemma":[0.99427116,0.0032701327,0.00054681307,0.0009789473,0.00029167172,0.0006413575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019949765,0.000784875,0.00100026,0.00039694284,0.0018763794,0.0015043103,0.0024780133,0.003281818,0.011387956],"category_scores_gemma":[0.014222807,0.0003621194,0.00093528954,0.0006268301,0.0027164125,0.004700533,0.0025430252,0.0031645105,0.0011863636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013016005,0.00046176114,0.0061618704,0.00035307955,0.00015163209,0.00075182784,0.0010024378,0.09097154,0.002810382,0.7574563,0.04982454,0.08875308],"study_design_scores_gemma":[0.00029707878,0.00040332242,0.0012130898,0.00009561684,0.000051480034,0.00087575126,0.0005479658,0.426531,0.004441638,0.5191123,0.04636616,0.00006466465],"about_ca_topic_score_codex":0.004182232,"about_ca_topic_score_gemma":0.003817211,"teacher_disagreement_score":0.011387956,"about_ca_system_score_codex":0.0017632381,"about_ca_system_score_gemma":0.0015126049,"threshold_uncertainty_score":0.038096488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6919186,0.0029035737,0.145499,0.005568814,0.00037324795,0.00008765106,0.00047458045,0.00030366253,0.15287085],"genre_scores_gemma":[0.9708307,0.0008422098,0.019987294,0.00044014503,0.00026735946,0.000080231854,0.00018227358,0.00010130289,0.007268498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992137,0.0002195453,0.000021874308,0.00017343015,0.00022523035,0.0001460835],"domain_scores_gemma":[0.99648607,0.0023606715,0.00029594052,0.00033939746,0.00024743503,0.0002705639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089878164,0.00047416452,0.0004375648,0.0021263105,0.0019926745,0.0019201301,0.0009459227,0.0009342426,0.006768632],"category_scores_gemma":[0.004849757,0.00038372687,0.00040651613,0.0012242835,0.0055271336,0.004165435,0.001919147,0.0026012894,0.00045452276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003138381,0.000010173957,0.0002935061,0.000033222794,0.000003824527,0.000028800832,0.00016707071,0.0037857227,0.0011300371,0.9899407,0.0009586779,0.0036169067],"study_design_scores_gemma":[0.000013194506,0.000013536279,0.00038512333,0.000019807567,0.000004888355,0.00004361429,0.00009097673,0.013935747,0.0005796137,0.98083246,0.0040649595,0.000016088885],"about_ca_topic_score_codex":0.0022177347,"about_ca_topic_score_gemma":0.0020525428,"teacher_disagreement_score":0.006768632,"about_ca_system_score_codex":0.001973004,"about_ca_system_score_gemma":0.00068992673,"threshold_uncertainty_score":0.022643387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21061036,0.005014405,0.39720553,0.0085189575,0.0019676443,0.00018169166,0.0006342524,0.0009997637,0.37486738],"genre_scores_gemma":[0.8386104,0.006957514,0.1201149,0.0036363392,0.0021434736,0.0002248996,0.0009480247,0.0006855868,0.026678784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984427,0.0003168145,0.00009172451,0.00037017124,0.000516341,0.000262212],"domain_scores_gemma":[0.99182254,0.0057456004,0.0003773291,0.0011501051,0.0005168927,0.0003875546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014036782,0.0008545605,0.0007127903,0.0012572076,0.0013201652,0.001611293,0.0015243043,0.0008544075,0.0086530335],"category_scores_gemma":[0.007301378,0.00057235727,0.0010493806,0.0012756579,0.005507986,0.0064354492,0.0038660201,0.006757556,0.001116406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072424504,0.0000649458,0.0010461687,0.000153507,0.000012572296,0.00043045255,0.0008643244,0.0020819474,0.005399723,0.94938755,0.0058762147,0.034610182],"study_design_scores_gemma":[0.000022397357,0.00008903257,0.0009687879,0.000040700084,0.000024449633,0.00055094657,0.00031347715,0.004593712,0.004297122,0.9547704,0.03429721,0.000031726107],"about_ca_topic_score_codex":0.0017453325,"about_ca_topic_score_gemma":0.0013906262,"teacher_disagreement_score":0.0086530335,"about_ca_system_score_codex":0.0009123451,"about_ca_system_score_gemma":0.00063125486,"threshold_uncertainty_score":0.028947294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79418254,0.00024405889,0.17017306,0.00029154032,0.00009237054,0.000074289586,0.0004209958,0.00034310427,0.034177985],"genre_scores_gemma":[0.96655375,0.00017897671,0.022508869,0.00007511492,0.000057733716,0.000044500717,0.00037317607,0.0001163021,0.010091545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877447,0.00021011624,0.00007030794,0.00033673353,0.00035967585,0.00024859808],"domain_scores_gemma":[0.9984491,0.0003513226,0.00029102125,0.00043056218,0.00025012417,0.00022792883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096708967,0.0003946471,0.00038773625,0.0012636755,0.0014222147,0.0010626313,0.00065930194,0.00047723704,0.0058706403],"category_scores_gemma":[0.0020705548,0.00029817814,0.0010443039,0.0006822239,0.0019654806,0.00409572,0.0015059422,0.0011483774,0.000837226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007364024,0.000018756398,0.00084206345,0.00004023954,0.0000106544485,0.00011893,0.0003771008,0.0029635122,0.0045021377,0.9812463,0.0006515581,0.009155104],"study_design_scores_gemma":[0.000012851368,0.00008908605,0.0015827629,0.00002512205,0.0000261926,0.00038711904,0.00029787843,0.018991532,0.008417034,0.96158785,0.008532978,0.000049607643],"about_ca_topic_score_codex":0.0009019089,"about_ca_topic_score_gemma":0.00068891695,"teacher_disagreement_score":0.0058706403,"about_ca_system_score_codex":0.00095883204,"about_ca_system_score_gemma":0.0004336904,"threshold_uncertainty_score":0.019639254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90662533,0.0007167137,0.055031624,0.00050587463,0.00006617494,0.00002197199,0.00011154701,0.0003352439,0.036585495],"genre_scores_gemma":[0.9924306,0.0001397212,0.004841667,0.000089235175,0.000026975498,0.000022433258,0.00005124198,0.000063894775,0.002334221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999393,0.00013122971,0.000022846665,0.00019481176,0.00010406431,0.00015411539],"domain_scores_gemma":[0.9961731,0.0014161544,0.0007337886,0.0005503502,0.00039778894,0.00072887714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007915855,0.00034252866,0.00039047896,0.0014461046,0.0011946174,0.0015866025,0.00088635704,0.0006406316,0.0037980753],"category_scores_gemma":[0.005597744,0.00040929834,0.00037204314,0.00047956067,0.0019949414,0.0026399372,0.0019123335,0.0010434645,0.0003529872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016317924,0.000051884403,0.0036088303,0.000080479775,0.000021581596,0.00021162082,0.00047393967,0.01510636,0.010012928,0.95800894,0.0016804865,0.010579796],"study_design_scores_gemma":[0.00003201219,0.00008087935,0.0044359583,0.00005094856,0.000031005184,0.00061676133,0.0003963631,0.116556145,0.0071765273,0.8655345,0.0050274264,0.00006147129],"about_ca_topic_score_codex":0.0015174067,"about_ca_topic_score_gemma":0.0018035029,"teacher_disagreement_score":0.0037980753,"about_ca_system_score_codex":0.001186441,"about_ca_system_score_gemma":0.00033169548,"threshold_uncertainty_score":0.012705803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93493956,0.0009229527,0.02598139,0.0004821126,0.00009474896,0.000047343747,0.00021008428,0.0001123304,0.037209563],"genre_scores_gemma":[0.98666745,0.0004367048,0.0064141457,0.00004841505,0.00007839825,0.000025495405,0.00025675638,0.000035964535,0.00603663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996257,0.000044060373,0.000025668467,0.000088194596,0.0000905615,0.00012583032],"domain_scores_gemma":[0.9990017,0.00022124537,0.00025115444,0.00009248501,0.00012661604,0.00030687038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039967368,0.0008418314,0.0004482325,0.0025636787,0.0016853245,0.0026335092,0.0008243725,0.0005406909,0.0065810685],"category_scores_gemma":[0.001353976,0.00033577098,0.0005519373,0.0012154146,0.0020812766,0.0030927192,0.0026191194,0.0010321337,0.0006767685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007387813,0.00008125231,0.007412698,0.0001591793,0.000026176502,0.00082639203,0.0012756826,0.0016149046,0.012726192,0.96104276,0.001227856,0.013533139],"study_design_scores_gemma":[0.00002989633,0.00015915428,0.009098705,0.00009779287,0.000074264615,0.0023475292,0.0021410952,0.017526915,0.019923797,0.9252842,0.023235686,0.00008088246],"about_ca_topic_score_codex":0.0007732276,"about_ca_topic_score_gemma":0.00097517297,"teacher_disagreement_score":0.0065810685,"about_ca_system_score_codex":0.0007459522,"about_ca_system_score_gemma":0.00029416574,"threshold_uncertainty_score":0.02201587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37285078,0.0010744411,0.44356668,0.00091993756,0.000325231,0.00018465391,0.0007017691,0.00036405982,0.18001254],"genre_scores_gemma":[0.90327615,0.0009670384,0.05860839,0.00039910353,0.0005042275,0.00011994798,0.000569244,0.00013986077,0.035415992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992661,0.00016135401,0.000042017073,0.00017083617,0.00022071817,0.00013899017],"domain_scores_gemma":[0.9989849,0.00026413382,0.0002120467,0.00017166087,0.0001631654,0.00020403827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094732747,0.0006116005,0.0003724026,0.0012117011,0.0012275664,0.0020206913,0.000688801,0.00046192497,0.011321907],"category_scores_gemma":[0.0017494431,0.00037729696,0.00085981446,0.00092692603,0.0031961175,0.0053628716,0.0019811606,0.0013462257,0.0013412519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010756983,0.000011584368,0.00023982009,0.0000146081375,0.0000025941367,0.00007391817,0.00016022868,0.00057719083,0.0008464529,0.9938491,0.00030009836,0.0039135953],"study_design_scores_gemma":[0.0000052656064,0.000026623571,0.00041544682,0.00001001657,0.000004984905,0.000262504,0.00010847629,0.0024707746,0.0023891279,0.9876928,0.006593955,0.000020215473],"about_ca_topic_score_codex":0.00036250244,"about_ca_topic_score_gemma":0.00038730385,"teacher_disagreement_score":0.011321907,"about_ca_system_score_codex":0.00046745036,"about_ca_system_score_gemma":0.0006863265,"threshold_uncertainty_score":0.037875533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8359873,0.0004993293,0.11449787,0.0033288903,0.00013627639,0.00013594655,0.00082019536,0.00090999773,0.043684296],"genre_scores_gemma":[0.9857917,0.00023969782,0.009703745,0.0005159551,0.000052140036,0.00007952416,0.00040826717,0.0000766822,0.0031323836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992416,0.00014191102,0.00003107849,0.00025162476,0.00017953973,0.00015430691],"domain_scores_gemma":[0.99674904,0.0014492841,0.0005664026,0.00073010306,0.00026938642,0.00023573264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775387,0.0003758352,0.00056023395,0.00048127567,0.0014425465,0.0012562512,0.00080894533,0.0007688411,0.005926488],"category_scores_gemma":[0.00561916,0.00043710874,0.0005787136,0.00062283716,0.0022139298,0.0020146442,0.0010965926,0.0012867894,0.0007943041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011609319,0.0003014183,0.02005888,0.00032702365,0.00012356704,0.00071752525,0.00075530884,0.02156975,0.029322285,0.8160675,0.012183976,0.09741174],"study_design_scores_gemma":[0.00017253705,0.0002873944,0.012637717,0.00007907214,0.0001291325,0.0014624365,0.00061812386,0.051070526,0.023914412,0.8823046,0.027256284,0.00006784918],"about_ca_topic_score_codex":0.0008248358,"about_ca_topic_score_gemma":0.0011717003,"teacher_disagreement_score":0.005926488,"about_ca_system_score_codex":0.0007253612,"about_ca_system_score_gemma":0.0005242357,"threshold_uncertainty_score":0.019826055},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66894937,0.0014602161,0.28732416,0.0006805147,0.00014370149,0.000101369806,0.0006247831,0.00060599676,0.04010992],"genre_scores_gemma":[0.9342486,0.000951808,0.05058305,0.00022335688,0.00017154017,0.0001005803,0.0009300867,0.000396213,0.012394877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991628,0.00015238505,0.00005212055,0.00031936023,0.00017123065,0.00014204296],"domain_scores_gemma":[0.9953432,0.0019467334,0.0008548421,0.00080838165,0.0004871171,0.0005598247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006727227,0.00062431704,0.0006751048,0.0009777835,0.0011740739,0.0021404885,0.0010277516,0.0005892863,0.008605893],"category_scores_gemma":[0.005117258,0.000657366,0.0007945684,0.0013127051,0.0025741311,0.0053436486,0.002437551,0.0013661679,0.0011664635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022695167,0.00006457311,0.004381177,0.00017341034,0.000035979243,0.0004945318,0.001175331,0.0072984053,0.007039102,0.9466459,0.0042651584,0.028199485],"study_design_scores_gemma":[0.00004414407,0.00017124711,0.002485348,0.00003675692,0.000047828995,0.0018991254,0.00054760673,0.026687894,0.0045333793,0.94324225,0.020270696,0.000033659733],"about_ca_topic_score_codex":0.001434058,"about_ca_topic_score_gemma":0.0011783869,"teacher_disagreement_score":0.008605893,"about_ca_system_score_codex":0.0007043184,"about_ca_system_score_gemma":0.00039097003,"threshold_uncertainty_score":0.02878958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8498121,0.0013074976,0.07836396,0.0011125876,0.00040441586,0.00019440129,0.0015453218,0.0005515185,0.0667083],"genre_scores_gemma":[0.9587285,0.0009367092,0.022249022,0.00023270796,0.00013915876,0.000057834513,0.0020772112,0.000092207294,0.015486496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994338,0.00008544696,0.000056455563,0.00018000085,0.0001339809,0.00011019876],"domain_scores_gemma":[0.99820685,0.00070285815,0.00030715278,0.0002508362,0.0002064078,0.00032587006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036586635,0.00035320854,0.00048747525,0.0019200487,0.0011943682,0.0020621163,0.0004954368,0.0006741141,0.003979495],"category_scores_gemma":[0.0017615964,0.00036559088,0.0005060778,0.0013613882,0.001698606,0.0026701705,0.0008380294,0.0010444481,0.00070324395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032571724,0.00009785394,0.007721946,0.0003837265,0.00003460521,0.0009279701,0.0015216437,0.0036417947,0.01381754,0.92210644,0.0070622107,0.042358488],"study_design_scores_gemma":[0.00006598557,0.00015999921,0.00908032,0.00012221381,0.00007763213,0.0017376422,0.001000761,0.018028032,0.008462594,0.9114943,0.049695607,0.00007491285],"about_ca_topic_score_codex":0.0009366772,"about_ca_topic_score_gemma":0.0010160683,"teacher_disagreement_score":0.003979495,"about_ca_system_score_codex":0.0010702019,"about_ca_system_score_gemma":0.00058830675,"threshold_uncertainty_score":0.013312757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85417384,0.00028527604,0.1269474,0.00025595108,0.000046929195,0.00005442387,0.0011048659,0.00037173455,0.016759686],"genre_scores_gemma":[0.9624388,0.0001836735,0.025436858,0.00008077885,0.00003864886,0.0001264525,0.0017156743,0.00010410016,0.009875029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.00009307313,0.00005791208,0.00021962957,0.00019113712,0.00018304176],"domain_scores_gemma":[0.9981426,0.00053514756,0.00029273902,0.00028924158,0.00031390588,0.00042645383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940444,0.00044233463,0.0005458562,0.0012303565,0.002241218,0.0014017039,0.00073732773,0.00041429044,0.006350354],"category_scores_gemma":[0.001712348,0.00046644037,0.0009453344,0.0011683801,0.0012929703,0.0027383324,0.0023249767,0.0007665535,0.00064102036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039621833,0.00006934162,0.0129150385,0.00021777287,0.000096508484,0.0007992106,0.0014765699,0.018411372,0.017214764,0.91770285,0.004971149,0.025729174],"study_design_scores_gemma":[0.00008205475,0.00025626796,0.013681121,0.00009400718,0.00012218348,0.0038856855,0.001980173,0.09371877,0.031394787,0.8178188,0.036797166,0.0001689177],"about_ca_topic_score_codex":0.0015198339,"about_ca_topic_score_gemma":0.0013475182,"teacher_disagreement_score":0.006350354,"about_ca_system_score_codex":0.0010541094,"about_ca_system_score_gemma":0.00047329883,"threshold_uncertainty_score":0.021244109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79905474,0.0011670783,0.13913727,0.0012938415,0.00026873781,0.00026488458,0.002339899,0.0011760367,0.055297613],"genre_scores_gemma":[0.94384974,0.0004935425,0.029079186,0.000494714,0.000097943324,0.0002672263,0.0028156384,0.00038167697,0.022520399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988582,0.00016151211,0.000061097,0.000359092,0.00021042243,0.00034964492],"domain_scores_gemma":[0.99806315,0.0005828058,0.0003721656,0.00038468957,0.00022483032,0.000372379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000444172,0.00075966335,0.0008031945,0.0013102932,0.002224992,0.0025866025,0.0015127122,0.0010640246,0.009919218],"category_scores_gemma":[0.001980202,0.000976036,0.0008783148,0.0016972293,0.002837489,0.0032218471,0.002280171,0.0011544087,0.0015911616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071613805,0.00013307176,0.0035323503,0.0004090039,0.00008102043,0.002534436,0.0027557958,0.038955376,0.019051706,0.8660931,0.01455843,0.05117957],"study_design_scores_gemma":[0.00012745532,0.00006631228,0.0025148827,0.00006179028,0.000044542045,0.0009205201,0.0005337458,0.02784753,0.004944314,0.93908197,0.023772545,0.00008439224],"about_ca_topic_score_codex":0.0049058576,"about_ca_topic_score_gemma":0.0051572765,"teacher_disagreement_score":0.009919218,"about_ca_system_score_codex":0.0020286003,"about_ca_system_score_gemma":0.00077267695,"threshold_uncertainty_score":0.033183098},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19661273,0.00087999064,0.5951435,0.0020901882,0.00091678376,0.00029938034,0.0008863108,0.00075126305,0.20241986],"genre_scores_gemma":[0.72390735,0.0008135569,0.23162204,0.00127502,0.0006669149,0.0006272652,0.00078972185,0.0005534374,0.03974471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986791,0.00026288105,0.000089171815,0.0003383817,0.0004276373,0.00020283056],"domain_scores_gemma":[0.9979861,0.0006672177,0.00028310655,0.00044923995,0.00044119835,0.00017307342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012531541,0.0007742676,0.00084400724,0.0012410489,0.0016132777,0.0016689696,0.0012576585,0.0006727858,0.0095224315],"category_scores_gemma":[0.0042573498,0.00044812053,0.0014218931,0.001331097,0.003077787,0.004744871,0.0018016769,0.0030706222,0.0017754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002854787,0.000010768897,0.00021499541,0.000034011475,0.0000047580734,0.00009628458,0.0001882089,0.00072455953,0.0024995804,0.9867393,0.001300926,0.008158063],"study_design_scores_gemma":[0.000028639332,0.00005345273,0.00050987175,0.00002375507,0.000014948867,0.00034275439,0.00010899522,0.007408216,0.0029575594,0.96466595,0.023850579,0.000035082146],"about_ca_topic_score_codex":0.0017365374,"about_ca_topic_score_gemma":0.0015231791,"teacher_disagreement_score":0.0095224315,"about_ca_system_score_codex":0.0014537686,"about_ca_system_score_gemma":0.0010559532,"threshold_uncertainty_score":0.031855702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7181075,0.0017010331,0.23581594,0.0012221873,0.00015144133,0.000106630876,0.0006544553,0.0009914358,0.041249298],"genre_scores_gemma":[0.9772535,0.00023124958,0.018266043,0.00020764334,0.000102094724,0.000074537325,0.00026233713,0.00011566752,0.0034869707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976418,0.0002896092,0.00020102834,0.00068584527,0.00077023386,0.0004115633],"domain_scores_gemma":[0.992007,0.0049158107,0.0009643893,0.0008656197,0.00081080175,0.00043636397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001028714,0.000415871,0.0007967823,0.0017086498,0.0014244994,0.0026083295,0.0010598268,0.0011624858,0.005690627],"category_scores_gemma":[0.009459226,0.0005422087,0.00094035466,0.0009034688,0.00315302,0.0042582853,0.002424836,0.0018482818,0.0013559181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047384432,0.000055455606,0.0032584942,0.0002766394,0.00004646264,0.0006151177,0.0017629446,0.010547942,0.033935692,0.92133635,0.0020351727,0.025655903],"study_design_scores_gemma":[0.000044736422,0.000136216,0.0012841352,0.00005860762,0.00005170531,0.0007041508,0.0002826124,0.035772778,0.021517701,0.93488747,0.0051766965,0.000083318875],"about_ca_topic_score_codex":0.0007638001,"about_ca_topic_score_gemma":0.00051521533,"teacher_disagreement_score":0.005690627,"about_ca_system_score_codex":0.0014959957,"about_ca_system_score_gemma":0.0008150315,"threshold_uncertainty_score":0.019037068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4252819,0.0015446282,0.50563455,0.00062469894,0.00029991224,0.00017023551,0.00077210605,0.00091327645,0.06475869],"genre_scores_gemma":[0.8953801,0.00045871068,0.08737987,0.0003785536,0.0002942172,0.00015559347,0.0010134669,0.00023533293,0.014704218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837023,0.00022139332,0.00013346474,0.0005070161,0.00044711208,0.000320883],"domain_scores_gemma":[0.99757594,0.0006338293,0.00050430495,0.00047165775,0.00057313713,0.00024106169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328976,0.00067100086,0.0005374293,0.0015629476,0.001914284,0.0018151478,0.0010875149,0.0012563469,0.007745071],"category_scores_gemma":[0.0029923453,0.00043839167,0.00068956456,0.0015229558,0.0020177192,0.0045229816,0.001264378,0.001284335,0.0013369323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010877769,0.000037186965,0.00086308806,0.000110578825,0.000013672885,0.00042198572,0.0005195961,0.0042593046,0.012294964,0.9563169,0.001689452,0.023364518],"study_design_scores_gemma":[0.000018954628,0.00014156997,0.000822042,0.000047962134,0.000022396674,0.0014309805,0.0005168335,0.020528926,0.010580173,0.94059306,0.025210334,0.00008671793],"about_ca_topic_score_codex":0.00073272607,"about_ca_topic_score_gemma":0.0006371967,"teacher_disagreement_score":0.007745071,"about_ca_system_score_codex":0.0010270273,"about_ca_system_score_gemma":0.00055132323,"threshold_uncertainty_score":0.025909781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5922788,0.00071645057,0.3765262,0.00030729122,0.00011489694,0.00013866025,0.0005033773,0.0009335601,0.028480796],"genre_scores_gemma":[0.89567554,0.0003027613,0.094444565,0.00014709184,0.000043895358,0.00009534014,0.00065204443,0.0003945584,0.008244273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866223,0.0002853907,0.00005883397,0.00049017696,0.00025857167,0.00024484692],"domain_scores_gemma":[0.99368274,0.0021280341,0.00070284895,0.0018102415,0.000992815,0.0006834338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006864651,0.0006251691,0.00064521586,0.00086370046,0.0013377838,0.0016567957,0.001553182,0.0009263658,0.0058151167],"category_scores_gemma":[0.0046091434,0.0006385131,0.0008129432,0.0013618221,0.0019672557,0.0032074207,0.001972637,0.0010550774,0.000833608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095175137,0.00018165204,0.005553802,0.0006931109,0.00014175111,0.00078709435,0.0015540062,0.14329275,0.10072222,0.6545864,0.0075701927,0.083965234],"study_design_scores_gemma":[0.00009359291,0.0005729807,0.004200136,0.000101953076,0.00014089275,0.0015144726,0.0005668237,0.28645274,0.05868094,0.62219226,0.025356809,0.00012632603],"about_ca_topic_score_codex":0.0020719878,"about_ca_topic_score_gemma":0.002849609,"teacher_disagreement_score":0.0058151167,"about_ca_system_score_codex":0.0016335953,"about_ca_system_score_gemma":0.0006803235,"threshold_uncertainty_score":0.019453526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7939009,0.0020318034,0.101473786,0.0015870779,0.00008998734,0.00017351768,0.003577958,0.0006113058,0.09655364],"genre_scores_gemma":[0.9803821,0.000573887,0.0115557,0.00024594506,0.00007098934,0.00010283489,0.0015693336,0.00006130102,0.005438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990119,0.00009823854,0.000035793575,0.00032398428,0.0002365503,0.00029347328],"domain_scores_gemma":[0.9971982,0.001049934,0.00044565438,0.0005205266,0.00032606872,0.00045959515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028893957,0.00039494876,0.0005304908,0.0014477031,0.0013525885,0.0017182464,0.00087721663,0.0005726822,0.0057648635],"category_scores_gemma":[0.0027172226,0.0003675261,0.0006049532,0.0015112587,0.0021305457,0.0027665906,0.0019583036,0.0009271755,0.0005862028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014472233,0.0000318156,0.00394577,0.00012531437,0.000041183364,0.00030588437,0.00072328607,0.008274337,0.005116421,0.9510841,0.0048193876,0.0253878],"study_design_scores_gemma":[0.000043287746,0.000060472325,0.005185062,0.000061743536,0.00004030931,0.0008220492,0.00066847296,0.01469894,0.0025027762,0.9461139,0.029771173,0.00003186619],"about_ca_topic_score_codex":0.003961096,"about_ca_topic_score_gemma":0.0029353467,"teacher_disagreement_score":0.0057648635,"about_ca_system_score_codex":0.0016041641,"about_ca_system_score_gemma":0.00057504507,"threshold_uncertainty_score":0.01928544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61870426,0.002099047,0.13810454,0.0020421678,0.0002238569,0.00007099501,0.00031895225,0.00027202402,0.2381641],"genre_scores_gemma":[0.9770164,0.0002924597,0.0077517694,0.0001642595,0.00011889883,0.000023818395,0.00011034878,0.00004472752,0.014477262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986003,0.00036994202,0.00009224327,0.00038777725,0.00031709005,0.00023261276],"domain_scores_gemma":[0.99885535,0.00052934664,0.00011568495,0.000215582,0.0001654852,0.00011847611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010990425,0.00048622873,0.0007102587,0.0016491801,0.0022551795,0.003559722,0.00059411966,0.000773752,0.0066954633],"category_scores_gemma":[0.0034461827,0.00039107702,0.000852027,0.0007521406,0.007034891,0.0044780886,0.003292366,0.0019108097,0.0007908797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012851436,0.000004617775,0.00022142578,0.000012926908,0.000004429122,0.000082127335,0.00047818254,0.0002140154,0.0003437524,0.99630415,0.0001279182,0.0021936693],"study_design_scores_gemma":[0.000006513221,0.000010919229,0.00028572662,0.000013379705,0.0000070808915,0.00013640689,0.0002557912,0.0010430177,0.0006806202,0.9916728,0.005876475,0.000011343951],"about_ca_topic_score_codex":0.0015049436,"about_ca_topic_score_gemma":0.0010710882,"teacher_disagreement_score":0.0066954633,"about_ca_system_score_codex":0.0012043116,"about_ca_system_score_gemma":0.0003722709,"threshold_uncertainty_score":0.022398531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4030089,0.0008194453,0.5084274,0.0017311488,0.00028235323,0.00036339698,0.0019129615,0.0006077495,0.082846686],"genre_scores_gemma":[0.90219826,0.0007726051,0.069505,0.00084368954,0.00020595347,0.00026957245,0.0017257739,0.00016353406,0.024315644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986706,0.0003015709,0.000049291357,0.0004924355,0.0002713412,0.00021485052],"domain_scores_gemma":[0.99696714,0.0009828063,0.0005576601,0.00062513526,0.00051141303,0.00035590745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005243117,0.00055406836,0.0005186415,0.0016814828,0.001482558,0.001591288,0.0011609304,0.00092693756,0.008005981],"category_scores_gemma":[0.004551307,0.00042559463,0.00072605704,0.0015753552,0.0015745274,0.0027960541,0.00150667,0.0010825889,0.0012902755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007527216,0.00004752755,0.0010755988,0.00007773935,0.000038296137,0.00034720503,0.0005635923,0.005411489,0.0048368797,0.9664216,0.0045074676,0.016597243],"study_design_scores_gemma":[0.00002597118,0.000034465203,0.0010631355,0.000022526738,0.0000325289,0.0007575984,0.00025843948,0.01812288,0.0018786163,0.9580748,0.019698689,0.000030256144],"about_ca_topic_score_codex":0.001008357,"about_ca_topic_score_gemma":0.0013242295,"teacher_disagreement_score":0.008005981,"about_ca_system_score_codex":0.00091731385,"about_ca_system_score_gemma":0.00046745967,"threshold_uncertainty_score":0.026782632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024073223,0.011512749,0.6121975,0.01888639,0.012228177,0.00043528306,0.0022566484,0.002260589,0.3161493],"genre_scores_gemma":[0.45837605,0.015808422,0.31340057,0.014175221,0.0070421123,0.0011841407,0.0023162214,0.0019622426,0.18573491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936336,0.000091498805,0.000033998575,0.00013097402,0.0002625459,0.00011760763],"domain_scores_gemma":[0.999313,0.00025683534,0.000041999938,0.00007845746,0.00022547971,0.00008414744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978399,0.0018224724,0.0008668697,0.0018639322,0.0018841451,0.0015948595,0.0014420521,0.001379806,0.031078333],"category_scores_gemma":[0.002446862,0.00059687893,0.0019177336,0.0016892304,0.0024179514,0.0035762088,0.004119686,0.0046643056,0.008302086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093751216,0.000103904546,0.00023526474,0.00045409054,0.00006792471,0.00050930324,0.00042412826,0.0013453142,0.0062972666,0.8989773,0.039309826,0.05218198],"study_design_scores_gemma":[0.000043497923,0.000077054974,0.00078835315,0.00010459386,0.000045668323,0.0002983523,0.00008897887,0.0018250833,0.002277983,0.8497376,0.14466509,0.000047701284],"about_ca_topic_score_codex":0.0023064315,"about_ca_topic_score_gemma":0.0018874274,"teacher_disagreement_score":0.031078333,"about_ca_system_score_codex":0.0013353582,"about_ca_system_score_gemma":0.0007847632,"threshold_uncertainty_score":0.10396743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9302115,0.00091382983,0.024977751,0.00029441243,0.00010632468,0.00003726685,0.00008424871,0.000092459515,0.043282244],"genre_scores_gemma":[0.9813768,0.00046729913,0.008055465,0.00010557652,0.00012133971,0.000060798244,0.00012710087,0.000075504686,0.009610093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996094,0.00006893684,0.00002455788,0.00006189738,0.00011501964,0.00012020836],"domain_scores_gemma":[0.9988668,0.00056729076,0.0001931385,0.00006388937,0.00015452699,0.00015441106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032862593,0.00055256765,0.00046457382,0.0015291615,0.0015906836,0.0023908403,0.00035009364,0.00073412084,0.0051003],"category_scores_gemma":[0.0023979305,0.00031068246,0.000436955,0.0006741494,0.0028870706,0.0020597195,0.0013284271,0.00094469596,0.0005908444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020743009,0.000047725665,0.0016977276,0.00016510994,0.000013264028,0.0005394253,0.0008808287,0.0030777357,0.012514862,0.9637037,0.0018461361,0.015306158],"study_design_scores_gemma":[0.000059233622,0.00012333649,0.0015375956,0.00013749945,0.000037062888,0.0008019756,0.0006748869,0.019265374,0.009574772,0.9520914,0.015646633,0.00005016436],"about_ca_topic_score_codex":0.00089555245,"about_ca_topic_score_gemma":0.0010850091,"teacher_disagreement_score":0.0051003,"about_ca_system_score_codex":0.00087906246,"about_ca_system_score_gemma":0.0004446085,"threshold_uncertainty_score":0.017062247},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34570846,0.002587975,0.5466328,0.0014429383,0.00052293815,0.00013081449,0.00028958847,0.00091835763,0.101766065],"genre_scores_gemma":[0.8794708,0.0011597299,0.09942086,0.0004899545,0.00016774102,0.00016458025,0.00024178169,0.00027016693,0.01861431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883527,0.00028852568,0.00007550338,0.00025608443,0.00033659927,0.00020805105],"domain_scores_gemma":[0.999084,0.00030054906,0.000107549546,0.0002834372,0.000099823614,0.00012467008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016829362,0.00070116465,0.0005516996,0.0013505624,0.0013388799,0.0021520292,0.0008625256,0.000663933,0.004887432],"category_scores_gemma":[0.0026763997,0.00058061717,0.0011933418,0.00097126054,0.003271202,0.0051589427,0.004251897,0.0029783952,0.0012661604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003662675,0.0000071557533,0.000111983834,0.000041574294,0.0000042165593,0.00010926429,0.0003556986,0.0006475159,0.0015764683,0.9915856,0.0005589207,0.0049649207],"study_design_scores_gemma":[0.00003664039,0.00009509814,0.00034729805,0.000053953867,0.000029461466,0.00072386436,0.0002715398,0.0039768694,0.004938886,0.96776474,0.0217126,0.000049060385],"about_ca_topic_score_codex":0.00028674936,"about_ca_topic_score_gemma":0.00026207985,"teacher_disagreement_score":0.004887432,"about_ca_system_score_codex":0.00081144477,"about_ca_system_score_gemma":0.00042551348,"threshold_uncertainty_score":0.01635009},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85429466,0.00064850046,0.108865894,0.0002712877,0.00009551007,0.00003687924,0.00019932319,0.00021476467,0.035373125],"genre_scores_gemma":[0.98691505,0.00022188204,0.008053341,0.00006300744,0.00007452352,0.00002406226,0.00011283956,0.00003131963,0.0045041335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994981,0.000092205475,0.0000352638,0.00012697336,0.000118229334,0.00012923639],"domain_scores_gemma":[0.99895227,0.0004047479,0.00013029152,0.00017760265,0.00020068802,0.00013445047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069445075,0.0004386956,0.0005131412,0.0011701939,0.00073912204,0.0016721936,0.00068891916,0.00041040796,0.005102074],"category_scores_gemma":[0.0025079038,0.00031391619,0.00047863522,0.00088882697,0.0023031817,0.0038914203,0.0011576943,0.0008115882,0.00045114997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007890331,0.000017749513,0.0016304118,0.0000625614,0.000010208855,0.00023196325,0.0002105919,0.002890536,0.0030548654,0.9769611,0.0008459308,0.0140052],"study_design_scores_gemma":[0.000018383671,0.00006154475,0.0017744319,0.000024035346,0.000022501688,0.0010279124,0.00018228775,0.02752792,0.0051204646,0.9575809,0.006617646,0.00004189285],"about_ca_topic_score_codex":0.0005438555,"about_ca_topic_score_gemma":0.00040687082,"teacher_disagreement_score":0.005102074,"about_ca_system_score_codex":0.0006399915,"about_ca_system_score_gemma":0.00042721626,"threshold_uncertainty_score":0.017068148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12234799,0.0051445747,0.5609155,0.00879666,0.0018083577,0.00006846019,0.00039415061,0.00035816018,0.3001662],"genre_scores_gemma":[0.8324739,0.005621015,0.10020278,0.00224459,0.001622291,0.000105252,0.0002547508,0.00033703452,0.05713838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994394,0.00017448276,0.000027900283,0.00009284171,0.00017043404,0.00009486209],"domain_scores_gemma":[0.99912614,0.0003216025,0.00007799909,0.00014038643,0.00020823018,0.00012568783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015653746,0.0008114158,0.00057201885,0.0026799913,0.0016821248,0.0030847182,0.0014191112,0.0010771105,0.009251582],"category_scores_gemma":[0.0030643125,0.0002679461,0.00060130074,0.0018389409,0.004119492,0.009237371,0.0022269154,0.0027769662,0.002155262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014125919,0.00000252099,0.000022789207,0.0000092825985,6.9994957e-7,0.000012575978,0.000059268932,0.0002142714,0.00010140894,0.9967836,0.000441733,0.002350504],"study_design_scores_gemma":[0.000001849982,0.0000065250656,0.000038345806,0.000011787906,0.0000017199549,0.00003853343,0.00005716419,0.002250402,0.00021900405,0.9905199,0.0068472917,0.00000750248],"about_ca_topic_score_codex":0.0019483124,"about_ca_topic_score_gemma":0.0021721108,"teacher_disagreement_score":0.009251582,"about_ca_system_score_codex":0.0015507155,"about_ca_system_score_gemma":0.0010197476,"threshold_uncertainty_score":0.030949652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71837145,0.0008259359,0.22140393,0.0027371868,0.00018483863,0.00019979685,0.0004739047,0.00045330383,0.055349737],"genre_scores_gemma":[0.95544255,0.0003261481,0.03270052,0.00037017986,0.00013713333,0.00034657217,0.00020198531,0.00017706746,0.010297844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967777,0.0013147511,0.00018575181,0.00063614326,0.00063354714,0.0004521022],"domain_scores_gemma":[0.9783972,0.015202179,0.0022581264,0.0021571836,0.0010738588,0.0009115129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004299029,0.00044854623,0.0009589151,0.0015700206,0.0019601795,0.003394708,0.0012057981,0.0013663175,0.00841116],"category_scores_gemma":[0.034325622,0.0006722436,0.0006307644,0.0012565384,0.0041627223,0.0074012657,0.0025362195,0.0024271484,0.0013365822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015563458,0.000048079957,0.0015509007,0.00005708199,0.000012062593,0.0000922443,0.00038195623,0.0059332424,0.0014236488,0.97707635,0.00093385606,0.012334991],"study_design_scores_gemma":[0.000034272456,0.00007411999,0.00065885193,0.00002434315,0.000013628196,0.00020115111,0.0001392435,0.023172347,0.0016665035,0.9714315,0.0025505638,0.000033469754],"about_ca_topic_score_codex":0.0003954106,"about_ca_topic_score_gemma":0.00046787073,"teacher_disagreement_score":0.00841116,"about_ca_system_score_codex":0.0014630292,"about_ca_system_score_gemma":0.0010464989,"threshold_uncertainty_score":0.02813816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88406795,0.0009854013,0.09239284,0.0008471311,0.00007169005,0.00003623435,0.00040465634,0.00023976146,0.020954292],"genre_scores_gemma":[0.97419125,0.00037243337,0.020462086,0.00009084097,0.000073189054,0.00004627259,0.0003856958,0.00010822317,0.0042699617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929523,0.00012714059,0.000037348407,0.00024739065,0.00013857176,0.00015432342],"domain_scores_gemma":[0.99684614,0.0015434072,0.00054368796,0.000302914,0.00023766584,0.00052620866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076204224,0.00050839485,0.0007660325,0.0010858574,0.0010881543,0.0015281404,0.0011787175,0.0007650797,0.0047388086],"category_scores_gemma":[0.0048299553,0.0004926299,0.00059240893,0.0007333401,0.0010626789,0.0022346505,0.0010831311,0.00089819904,0.0002560533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007175361,0.00028216682,0.024616485,0.0006951289,0.00031662543,0.0013969997,0.000598188,0.19891864,0.039618496,0.64992523,0.008884169,0.074030384],"study_design_scores_gemma":[0.00008543366,0.00023536496,0.00969753,0.0000826401,0.00014610533,0.0020099976,0.00045216217,0.37162223,0.01586191,0.5887392,0.010994795,0.00007257613],"about_ca_topic_score_codex":0.00045153074,"about_ca_topic_score_gemma":0.00082292175,"teacher_disagreement_score":0.0047388086,"about_ca_system_score_codex":0.0010732971,"about_ca_system_score_gemma":0.00034565746,"threshold_uncertainty_score":0.015852869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25089484,0.005735662,0.4173034,0.010242448,0.0015507576,0.000092608396,0.0008555648,0.0004056829,0.312919],"genre_scores_gemma":[0.8938335,0.0028007259,0.06478192,0.0020634735,0.0010111906,0.00015589145,0.0005357152,0.00021002832,0.03460748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998453,0.00028156678,0.00006400978,0.00030182395,0.00057325687,0.0003263545],"domain_scores_gemma":[0.9968231,0.0017665148,0.00018170408,0.00026536855,0.0006084302,0.00035494257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016387547,0.0004975444,0.0010296186,0.0020213288,0.0015948162,0.0024169232,0.0012631381,0.0011476759,0.0073323343],"category_scores_gemma":[0.011874726,0.00041974173,0.00085868983,0.0018050718,0.003746036,0.006243309,0.0027571437,0.0039366577,0.0009880813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013240149,0.000004487095,0.00017030865,0.000019848201,0.0000030601807,0.000039555995,0.000049369082,0.00065018894,0.0005026401,0.993922,0.001149601,0.0034757825],"study_design_scores_gemma":[0.000005851701,0.00001037919,0.00028837562,0.000021811173,0.0000035973014,0.00010316227,0.00004105167,0.010363657,0.00043839277,0.98301077,0.0056971773,0.000015757189],"about_ca_topic_score_codex":0.002106929,"about_ca_topic_score_gemma":0.0014336673,"teacher_disagreement_score":0.0073323343,"about_ca_system_score_codex":0.002506337,"about_ca_system_score_gemma":0.0008324118,"threshold_uncertainty_score":0.0245291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06709658,0.0019998231,0.8677091,0.0011354258,0.00049061544,0.00015668935,0.00026516386,0.0018945666,0.059252035],"genre_scores_gemma":[0.5658866,0.0013754742,0.40560842,0.00030985748,0.00050425396,0.00023493086,0.00062278396,0.0006609713,0.024796696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887437,0.00027583327,0.000084533414,0.0002855145,0.00032243683,0.00015722426],"domain_scores_gemma":[0.99904865,0.00043017764,0.00007478874,0.00026790542,0.00010633132,0.0000721491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011355532,0.0008787614,0.0008275282,0.0011788101,0.0014573892,0.0038741434,0.00164247,0.0008577213,0.014073389],"category_scores_gemma":[0.0033470944,0.00054632674,0.0011384371,0.0015817614,0.003263985,0.008329639,0.002859687,0.0017248129,0.0035963166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016896919,0.00005054627,0.0005826122,0.00020452974,0.000021668497,0.00012963437,0.00038201624,0.0031134079,0.0032631548,0.90186036,0.005662018,0.084561035],"study_design_scores_gemma":[0.00003747059,0.00007815368,0.00021099279,0.000041105028,0.00001566446,0.00023981484,0.00013637642,0.012794993,0.0059801387,0.9580066,0.02242611,0.00003255585],"about_ca_topic_score_codex":0.00057646807,"about_ca_topic_score_gemma":0.0004900292,"teacher_disagreement_score":0.014073389,"about_ca_system_score_codex":0.0012162043,"about_ca_system_score_gemma":0.00070126087,"threshold_uncertainty_score":0.04708022},"labels":[],"label_agreement":null}]}