{"meta":{"query_hash":"94f91cfdcf51","filters":{"venue":"Journal of Combinatorial Theory Series A"},"cohort_total":210,"direct_labels_cover":0,"predictions_cover":210,"exported":210,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/94f91cfdcf51","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorial+Theory+Series+A"},"results":[{"id":"W1412351404","doi":"10.1016/j.jcta.2015.08.005","title":"Littlewood–Richardson rules for symmetric skew quasisymmetric Schur functions","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Skew; Symmetric function; Combinatorics; Conjecture; Schur polynomial; Discrete mathematics; Pure mathematics; Macdonald polynomials; Computer science; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.06107878497430066,"score_gpt":0.3255539238221512,"score_spread":0.26447513884785057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1412351404","genre_codex":"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.47333995,0.0009575033,0.21463132,0.0016330631,0.0012983156,0.0001645668,0.0003662649,0.0006093689,0.30699962],"genre_scores_gemma":[0.92502236,0.0006341516,0.027695702,0.00061188266,0.00044692797,0.000098374425,0.00022805348,0.0003466171,0.044915862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990074,0.00023740872,0.00007797531,0.00014610545,0.00033339037,0.00019771083],"domain_scores_gemma":[0.9987012,0.0005416554,0.00011926298,0.00019028732,0.0002232167,0.00022424788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017972387,0.00073490373,0.0009995893,0.0023624864,0.0029446098,0.00450673,0.0012994286,0.0012196476,0.006769851],"category_scores_gemma":[0.0034246042,0.000669748,0.0012190643,0.0013881801,0.0036723956,0.004468781,0.0015598424,0.003011009,0.0017956696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016973298,0.000014529554,0.00009550171,0.000009048351,0.0000032359646,0.00007175766,0.00013124538,0.00019662228,0.00046555852,0.99533457,0.0007512311,0.0029097896],"study_design_scores_gemma":[0.000010547086,0.000009552355,0.000121171426,0.0000060243647,0.000005573008,0.00007838635,0.000052741165,0.0011767825,0.00056023116,0.9955037,0.0024616227,0.000013696145],"about_ca_topic_score_codex":0.00123626,"about_ca_topic_score_gemma":0.0017993741,"teacher_disagreement_score":0.006769851,"about_ca_system_score_codex":0.0014030968,"about_ca_system_score_gemma":0.0007257972,"threshold_uncertainty_score":0.02264744},"labels":[],"label_agreement":null},{"id":"W1505344614","doi":"10.1016/j.jcta.2010.04.002","title":"Bases for diagonally alternating harmonic polynomials of low degree","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Combinatorics; Bijection; Diagonal; Degree (music); Mathematics; Operator (biology); Space (punctuation); Basis (linear algebra); Arithmetic; Physics; Geometry; Chemistry; Computer science","score_opus":0.03908528554895011,"score_gpt":0.3204968679921958,"score_spread":0.28141158244324566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505344614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69003,0.0007385272,0.14589013,0.0018869261,0.0014165773,0.00016096332,0.0005422129,0.00057070237,0.158764],"genre_scores_gemma":[0.9328266,0.00049503706,0.022221714,0.0004453862,0.0008307232,0.00012302569,0.0004602861,0.00032258884,0.042274714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994229,0.000095003925,0.000022224976,0.00008482711,0.00018696566,0.00018802332],"domain_scores_gemma":[0.9991611,0.00021199048,0.00009715428,0.00007529342,0.00013018411,0.00032417115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068559754,0.0015375657,0.0009211637,0.0027169513,0.0025927052,0.003870494,0.0016302855,0.0012749782,0.014790091],"category_scores_gemma":[0.001663906,0.00062429084,0.0005944372,0.0015381757,0.0027130274,0.002568519,0.0032565051,0.0036953818,0.0030285302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010674275,0.00009071597,0.00018386541,0.000032298492,0.0000062789945,0.000109408276,0.00027286427,0.00040391623,0.0043939464,0.9827071,0.0014816046,0.010211248],"study_design_scores_gemma":[0.00007508035,0.00006707086,0.00035304902,0.000022802855,0.00001412452,0.00019363468,0.00024242153,0.0054079336,0.002346738,0.9867792,0.0044648033,0.000033189444],"about_ca_topic_score_codex":0.00066633004,"about_ca_topic_score_gemma":0.0012789341,"teacher_disagreement_score":0.014790091,"about_ca_system_score_codex":0.0012413652,"about_ca_system_score_gemma":0.00062950683,"threshold_uncertainty_score":0.049477756},"labels":[],"label_agreement":null},{"id":"W1537254652","doi":"10.1016/j.jcta.2017.05.003","title":"Multiplicative structures of the immaculate basis of non-commutative symmetric functions","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Mathematics; Commutative property; Multiplicative function; Symmetric function; Complete homogeneous symmetric polynomial; Commutative algebra; Pure mathematics; Polytope; Commutative ring; Ring of symmetric functions; Algebra over a field; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.025214483721400043,"score_gpt":0.32178409444127204,"score_spread":0.296569610719872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537254652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7408006,0.00093509286,0.11543683,0.0013715721,0.0004789844,0.000078991696,0.00035879083,0.00020317695,0.1403359],"genre_scores_gemma":[0.9503859,0.0005217032,0.017241174,0.00037137087,0.00056204916,0.00008473883,0.0003182618,0.00010864827,0.030406024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988715,0.00029634128,0.00006481321,0.00016992363,0.00035941694,0.00023806833],"domain_scores_gemma":[0.99881077,0.00029947676,0.00016595746,0.00015422565,0.00026694985,0.00030264992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012521292,0.0010069582,0.0009323011,0.0025825151,0.0024164957,0.0037098622,0.0013992399,0.0008199196,0.007654685],"category_scores_gemma":[0.0017378259,0.00065584417,0.0009384302,0.0012789037,0.0031616795,0.0037756395,0.0022860789,0.0025513517,0.0015422623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021496582,0.000021651242,0.00009780254,0.000009270172,0.000004386413,0.000035756657,0.00011995652,0.00018125925,0.00091058033,0.99656725,0.00027601884,0.001754541],"study_design_scores_gemma":[0.000019090257,0.00003481636,0.00027745805,0.0000074862182,0.000008953015,0.00010169957,0.000082485756,0.0019227677,0.0010290396,0.9947701,0.0017289997,0.000016876955],"about_ca_topic_score_codex":0.0007292802,"about_ca_topic_score_gemma":0.00085681217,"teacher_disagreement_score":0.007654685,"about_ca_system_score_codex":0.0011094707,"about_ca_system_score_gemma":0.0008830021,"threshold_uncertainty_score":0.025607526},"labels":[],"label_agreement":null},{"id":"W1579458986","doi":"10.1006/jcta.2000.3159","title":"Orthogonal Frames in the Leech Lattice and a Type II Code over Z22","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leech; Lattice (music); Basis (linear algebra); Mathematics; Orthogonal basis; Combinatorics; Code (set theory); Type (biology); Discrete mathematics; Pure mathematics; Computer science; Physics; Geometry; Programming language; Biology; Quantum mechanics","score_opus":0.011505245931273068,"score_gpt":0.2479558214037235,"score_spread":0.23645057547245044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579458986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84257996,0.000667829,0.060530055,0.0027683899,0.000487681,0.00006369571,0.00042263436,0.00024646142,0.09223346],"genre_scores_gemma":[0.9684895,0.0002663568,0.01018299,0.00037098737,0.00028628696,0.00005471041,0.00018259045,0.00006553014,0.020100981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993498,0.00017435932,0.00002558653,0.000077032506,0.00015984722,0.00021333531],"domain_scores_gemma":[0.9989838,0.00029236244,0.00020056311,0.00011161485,0.00013005418,0.00028156742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068576937,0.00063803565,0.00074418465,0.0016462418,0.002319132,0.00323291,0.000757062,0.0014465945,0.004958604],"category_scores_gemma":[0.0015955763,0.00038255294,0.00052130874,0.0012395527,0.0030720457,0.0024676425,0.0015194432,0.0019692567,0.00065266783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010476567,0.000021639544,0.00019061632,0.000009628413,0.0000031962038,0.00015193013,0.00013197426,0.0008727313,0.0010891974,0.9943983,0.00085580384,0.0021700468],"study_design_scores_gemma":[0.00006455104,0.000043087988,0.00024769094,0.000013831611,0.0000054175594,0.00014406782,0.00018089669,0.007992251,0.00093467656,0.98786616,0.0024731332,0.000034325887],"about_ca_topic_score_codex":0.0025529808,"about_ca_topic_score_gemma":0.0025910817,"teacher_disagreement_score":0.004958604,"about_ca_system_score_codex":0.0013511016,"about_ca_system_score_gemma":0.0010818554,"threshold_uncertainty_score":0.016588151},"labels":[],"label_agreement":null},{"id":"W1696036094","doi":"10.1016/j.jcta.2016.02.002","title":"Combinatorics of the zeta map on rational Dyck paths","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"York University; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Bijection; Mathematics; Combinatorics; Path (computing); Riemann zeta function; Bijection, injection and surjection; Pure mathematics; Computer science","score_opus":0.026855416507147414,"score_gpt":0.2944627365106263,"score_spread":0.2676073200034789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696036094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81366605,0.0011031921,0.05295533,0.0038321523,0.00059925654,0.00008827771,0.00056481874,0.00034894707,0.12684204],"genre_scores_gemma":[0.96232367,0.0009704997,0.0061861603,0.00034792538,0.0005883412,0.00009405666,0.0004139237,0.00019985325,0.028875515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.00019093258,0.00004133253,0.0001813465,0.00024269114,0.00018448957],"domain_scores_gemma":[0.99875546,0.00046363476,0.00021713118,0.000104605184,0.00012668048,0.00033251068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010250991,0.0015857152,0.00151726,0.0054466575,0.0025164543,0.0065371683,0.0018842905,0.0017049253,0.013273825],"category_scores_gemma":[0.0029016496,0.00093670754,0.0009917794,0.0025611462,0.004298235,0.0064931065,0.004254286,0.0038051992,0.0016659771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067052155,0.00003395773,0.00045745223,0.000034661847,0.0000075862636,0.0001775854,0.00024138902,0.0008654194,0.00068440434,0.993068,0.00096565316,0.0033968503],"study_design_scores_gemma":[0.000029819701,0.000013139068,0.0002866315,0.000016621525,0.000008349525,0.000119001794,0.00012979562,0.0030340583,0.00026235645,0.9945478,0.001538039,0.000014370019],"about_ca_topic_score_codex":0.0016633271,"about_ca_topic_score_gemma":0.0013055222,"teacher_disagreement_score":0.013273825,"about_ca_system_score_codex":0.0025296297,"about_ca_system_score_gemma":0.00079488824,"threshold_uncertainty_score":0.0444054},"labels":[],"label_agreement":null},{"id":"W1708227213","doi":"10.1016/j.jcta.2015.09.002","title":"M-vector analogue for the cd-index","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polytope; h-vector; Mathematics; Conjecture; Lattice (music); Combinatorics; Lie algebra; Partially ordered set; SPHERES; Pure mathematics; Simplicial complex; Physics","score_opus":0.054527018428424404,"score_gpt":0.3246458590949017,"score_spread":0.2701188406664773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1708227213","genre_codex":"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.13967414,0.0023406085,0.12883401,0.008540058,0.0066678943,0.00008217014,0.00081628055,0.00051209814,0.7125327],"genre_scores_gemma":[0.8799127,0.0013759403,0.03394064,0.003546915,0.0051686536,0.00014828931,0.00050107436,0.0002990711,0.0751067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930394,0.00013569134,0.000049153947,0.00018632668,0.0001759683,0.00014886798],"domain_scores_gemma":[0.99898607,0.00024205161,0.00018028708,0.00015133875,0.00020024438,0.00024005712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007837046,0.00096620317,0.00084650645,0.0036441495,0.002344933,0.0046799183,0.0013200464,0.0019330464,0.01779873],"category_scores_gemma":[0.0027809858,0.00029289606,0.0005975051,0.002438066,0.0035752044,0.0050278627,0.002590574,0.0032503183,0.0026592328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013402098,0.000007937203,0.000045115292,0.000010557588,0.0000013663088,0.00003820689,0.00003804581,0.0000538332,0.00027086245,0.9952005,0.0015971324,0.002723043],"study_design_scores_gemma":[0.000009549342,0.000011769799,0.000108876986,0.0000118826265,0.0000028313539,0.00016110783,0.00003395074,0.000943836,0.00026068932,0.99012893,0.008315716,0.000010807477],"about_ca_topic_score_codex":0.000648639,"about_ca_topic_score_gemma":0.00047252214,"teacher_disagreement_score":0.01779873,"about_ca_system_score_codex":0.0015870936,"about_ca_system_score_gemma":0.0006499701,"threshold_uncertainty_score":0.059542656},"labels":[],"label_agreement":null},{"id":"W1750697786","doi":"10.1016/j.jcta.2011.01.009","title":"The Murnaghan–Nakayama rule for k-Schur functions","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Schur's theorem; Algebra over a field; Pure mathematics; Chemistry; Computer science; Mathematics","score_opus":0.04393758315576886,"score_gpt":0.2911379965500908,"score_spread":0.24720041339432197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750697786","genre_codex":"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.30241135,0.0022987088,0.22288997,0.0034195483,0.0027914424,0.00012971197,0.00036925488,0.0005237802,0.46516618],"genre_scores_gemma":[0.89235765,0.0016194043,0.050452966,0.0011079855,0.0009952228,0.00011619504,0.00021397664,0.00036627587,0.05277032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990689,0.00018692529,0.00006392283,0.00018757208,0.0003295709,0.00016308686],"domain_scores_gemma":[0.9989391,0.00034222406,0.00008423645,0.00021257313,0.00029077558,0.00013110359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212272,0.00059709913,0.00086736964,0.0020275079,0.0026312587,0.003163378,0.0012187376,0.001330799,0.0055947774],"category_scores_gemma":[0.0037186402,0.00045008727,0.0008394979,0.0013522718,0.0033944373,0.0044626477,0.0016962183,0.0030653863,0.0022489189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027367063,0.00001475056,0.000151887,0.00002585764,0.000005377097,0.00011882111,0.0001785745,0.00020950873,0.000982275,0.98269355,0.002100382,0.013491761],"study_design_scores_gemma":[0.0000069586595,0.000008636521,0.00015660546,0.000007968015,0.0000043344735,0.000119937045,0.000033553762,0.0009267208,0.0005967164,0.9932508,0.0048731077,0.000014718549],"about_ca_topic_score_codex":0.0011314868,"about_ca_topic_score_gemma":0.0013563352,"teacher_disagreement_score":0.0055947774,"about_ca_system_score_codex":0.00095109554,"about_ca_system_score_gemma":0.0007894724,"threshold_uncertainty_score":0.018716455},"labels":[],"label_agreement":null},{"id":"W1757536559","doi":"10.1016/j.jcta.2016.08.001","title":"A bijection for rooted maps on general surfaces","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Bijection; Mathematics; Combinatorics; Euler characteristic; Bipartite graph; Bijection, injection and surjection; Surface (topology); Exponent; RADIUS; Euler's formula; Infinity; Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.024046128702391832,"score_gpt":0.29431008359529254,"score_spread":0.2702639548929007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757536559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60847193,0.0013007729,0.20514493,0.002282703,0.0012776419,0.00020621138,0.00046194484,0.0006063948,0.18024756],"genre_scores_gemma":[0.86877984,0.0014501357,0.055316877,0.00095023855,0.000738117,0.00022291657,0.0006256866,0.0007793764,0.07113681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907935,0.00015123731,0.00006876078,0.00026367078,0.0002493237,0.00018778167],"domain_scores_gemma":[0.99787676,0.00074277556,0.0002459389,0.0002611811,0.00042445463,0.0004489886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078872644,0.000666218,0.00082980463,0.0044572614,0.004026578,0.0055670994,0.0015748274,0.0028515065,0.009779644],"category_scores_gemma":[0.0038187345,0.0008520278,0.0011057752,0.0021501356,0.002962977,0.008529696,0.0037376247,0.004006684,0.0018071678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001552079,0.000029225052,0.00011967288,0.000022215318,0.0000035857875,0.00008704287,0.00035425762,0.0002903563,0.0010205348,0.9930187,0.0006379252,0.0044009914],"study_design_scores_gemma":[0.000013734904,0.000019634605,0.00023571786,0.000017821269,0.00000630213,0.00029926252,0.00024662886,0.0018482212,0.00047121904,0.98994,0.0068835965,0.000017842442],"about_ca_topic_score_codex":0.0008790888,"about_ca_topic_score_gemma":0.0009132187,"teacher_disagreement_score":0.009779644,"about_ca_system_score_codex":0.0014348277,"about_ca_system_score_gemma":0.0005732791,"threshold_uncertainty_score":0.032716155},"labels":[],"label_agreement":null},{"id":"W1795149005","doi":"10.1016/j.jcta.2017.03.009","title":"Staircase diagrams and enumeration of smooth Schubert varieties","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Bijection; Mathematics; Schubert polynomial; Combinatorics; Graph; Type (biology); Decomposition; Set (abstract data type); Schubert variety; Computer science","score_opus":0.026292482925520135,"score_gpt":0.31090658259987963,"score_spread":0.2846140996743595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795149005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8274994,0.0007015675,0.07708411,0.0006351041,0.00011807616,0.00005315374,0.00037107134,0.00028415475,0.09325331],"genre_scores_gemma":[0.97146857,0.00036787393,0.01092682,0.00008714317,0.000060901915,0.000039489285,0.0003184593,0.000068946705,0.016661802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943763,0.00015307844,0.000036689944,0.00008862322,0.00014321879,0.00014075426],"domain_scores_gemma":[0.9989165,0.0005465783,0.0001456538,0.000100850564,0.00015317718,0.00013733751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044557865,0.00042379549,0.00065846206,0.002896916,0.0022908996,0.0048186714,0.0008359768,0.0011921319,0.008543409],"category_scores_gemma":[0.002492373,0.0005809604,0.0005245416,0.0024641578,0.0016731039,0.003619181,0.0015556181,0.0013826987,0.0010615618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004297341,0.000020250554,0.0006126734,0.00002492215,0.0000053994395,0.000078159224,0.0003548991,0.0006432576,0.00089014455,0.9904991,0.0007073921,0.0061207423],"study_design_scores_gemma":[0.000010367299,0.000008570631,0.00046639238,0.000016667624,0.000009489746,0.00012629233,0.0002527882,0.0027103277,0.0007690702,0.9920859,0.003533018,0.000011187104],"about_ca_topic_score_codex":0.0011134716,"about_ca_topic_score_gemma":0.001818433,"teacher_disagreement_score":0.008543409,"about_ca_system_score_codex":0.0009981623,"about_ca_system_score_gemma":0.00054528314,"threshold_uncertainty_score":0.028580546},"labels":[],"label_agreement":null},{"id":"W1861968797","doi":"10.1016/j.jcta.2015.11.003","title":"Critical exponents of graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; UPS Foundation; National Science Foundation","keywords":"Chordal graph; Mathematics; Combinatorics; Critical exponent; Bipartite graph; Exponent; Treewidth; Indifference graph; Conjecture; Pathwidth; Invariant (physics); Discrete mathematics; Graph; Line graph","score_opus":0.04989356602177974,"score_gpt":0.3323412379104951,"score_spread":0.28244767188871533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861968797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6606956,0.010008663,0.05779233,0.014312901,0.0025048705,0.00015683041,0.00049759104,0.00073313015,0.2532981],"genre_scores_gemma":[0.9712406,0.0025631287,0.005154651,0.0006069483,0.0023404015,0.00012767907,0.00024442095,0.00020941073,0.01751283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938726,0.0002059664,0.000028622571,0.00009440753,0.00016865775,0.0001149965],"domain_scores_gemma":[0.99469805,0.0025179733,0.00071025407,0.00031020536,0.00062028796,0.0011432564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866945,0.0015074974,0.0014607655,0.008700718,0.0024536664,0.0051793465,0.0012296411,0.0017143632,0.009789596],"category_scores_gemma":[0.013235913,0.00095645705,0.00066309766,0.002132697,0.0052782386,0.0057259775,0.0027853623,0.003802236,0.0009059747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027718945,0.000015298792,0.00032582172,0.00004049883,0.000008129143,0.000058991744,0.00025740085,0.00064178306,0.00045041938,0.99398285,0.0020652632,0.0021258052],"study_design_scores_gemma":[0.000020306847,0.0000067176475,0.00031330902,0.000028567634,0.0000063997068,0.000059293117,0.00007867642,0.0026700627,0.00013860679,0.9949562,0.0017140418,0.000007816171],"about_ca_topic_score_codex":0.0012093085,"about_ca_topic_score_gemma":0.0012160717,"teacher_disagreement_score":0.009789596,"about_ca_system_score_codex":0.002373466,"about_ca_system_score_gemma":0.00080104027,"threshold_uncertainty_score":0.032749414},"labels":[],"label_agreement":null},{"id":"W1929335507","doi":"10.1016/j.jcta.2018.04.004","title":"Extremal hypergraphs for Ryser's Conjecture","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Hypergraph; Conjecture; Combinatorics; Bipartite graph; Mathematics; Social connectedness; Independence number; Vertex (graph theory); Matching (statistics); Discrete mathematics; Base (topology); Graph","score_opus":0.010925980757902062,"score_gpt":0.2467997779114212,"score_spread":0.23587379715351914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929335507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6609606,0.0021345825,0.15314844,0.023436274,0.00078218774,0.000113069946,0.0011924221,0.0012053032,0.15702714],"genre_scores_gemma":[0.9691871,0.0009737344,0.015334209,0.0016756568,0.0007992773,0.0000820686,0.0008066431,0.00023239986,0.010908907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803096,0.0006297266,0.00009668948,0.0005423765,0.00038685824,0.000313299],"domain_scores_gemma":[0.98946244,0.0069888406,0.00064781477,0.0015616006,0.00068385503,0.0006554976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023681724,0.00070725335,0.0023488957,0.0023572329,0.0033550824,0.0052455007,0.0021013492,0.0036175908,0.014590461],"category_scores_gemma":[0.014689126,0.0010774374,0.0012902995,0.0025176841,0.004524586,0.0131394565,0.004236839,0.005964805,0.0015907169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008457554,0.000038836446,0.0007875312,0.00007122165,0.000015668851,0.000118734504,0.00031996894,0.0019325077,0.00036476212,0.98819643,0.004030503,0.004039139],"study_design_scores_gemma":[0.000016426966,0.000006173203,0.00021101988,0.000014128177,0.000011363184,0.000071283524,0.00012186937,0.00492782,0.00013300584,0.9930662,0.0014105177,0.000010191082],"about_ca_topic_score_codex":0.0011511319,"about_ca_topic_score_gemma":0.0011323188,"teacher_disagreement_score":0.014590461,"about_ca_system_score_codex":0.0015147055,"about_ca_system_score_gemma":0.000769496,"threshold_uncertainty_score":0.048810005},"labels":[],"label_agreement":null},{"id":"W1965328002","doi":"10.1006/jcta.2000.3144","title":"Logarithmic Concavity and sl2(C)","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"SL2(R); Logarithm; Mathematics; Combinatorics; Graph; Sequence (biology); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01844273816181695,"score_gpt":0.27882510868235116,"score_spread":0.2603823705205342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965328002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64398044,0.0012050382,0.039199628,0.0060969437,0.00029759205,0.0000485015,0.00046377946,0.00049503957,0.30821306],"genre_scores_gemma":[0.9663014,0.00038356084,0.0046999245,0.0007637619,0.00030557977,0.00004863429,0.00019295095,0.00011556952,0.02718854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993113,0.00019267609,0.000028888391,0.00013374952,0.00017909579,0.0001541963],"domain_scores_gemma":[0.99648994,0.001975393,0.00037930868,0.00027649404,0.0004482293,0.00043068294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006668907,0.0005632655,0.0007565788,0.0019968818,0.002863672,0.0037055186,0.0011378163,0.0012426688,0.01154134],"category_scores_gemma":[0.004932665,0.00053591456,0.00048916537,0.0019283841,0.004104589,0.0048542814,0.0026549262,0.0032539496,0.0011132805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055698223,0.00002987168,0.00037663983,0.000022373517,0.0000037026748,0.0000883426,0.00021343004,0.00030855127,0.00043923143,0.9927551,0.0022623297,0.0034448032],"study_design_scores_gemma":[0.000014081617,0.000008858123,0.0004374455,0.000008129508,0.0000046168916,0.00015921732,0.00006352451,0.0019279624,0.00031371802,0.9947332,0.0023190076,0.000010150109],"about_ca_topic_score_codex":0.0024798703,"about_ca_topic_score_gemma":0.002561157,"teacher_disagreement_score":0.01154134,"about_ca_system_score_codex":0.001403846,"about_ca_system_score_gemma":0.0007130257,"threshold_uncertainty_score":0.038609624},"labels":[],"label_agreement":null},{"id":"W1967329424","doi":"10.1016/j.jcta.2009.07.010","title":"Extensions and restrictions of Wythoff's game preserving its <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">P</mml:mi></mml:math> positions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Fibonacci number; Morphism; Set (abstract data type); Computer science; Word (group theory); Discrete mathematics; Mathematics; Combinatorics; Programming language; Geometry","score_opus":0.013300653658497575,"score_gpt":0.23385288848705402,"score_spread":0.22055223482855643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967329424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4034362,0.00041430458,0.27031764,0.0014618096,0.000301551,0.0002647134,0.0007597399,0.00046872618,0.3225753],"genre_scores_gemma":[0.9051988,0.0003188287,0.03177995,0.00028267707,0.00011728236,0.0002404349,0.00065401377,0.00019729993,0.06121066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805886,0.0004646867,0.00017045216,0.00038683935,0.00041186257,0.000507224],"domain_scores_gemma":[0.99653685,0.0012986559,0.00022157108,0.00062808447,0.0005097783,0.0008050955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099513,0.0005647821,0.00066063856,0.0012087886,0.0020173064,0.0036322316,0.0013244862,0.0008977725,0.008649418],"category_scores_gemma":[0.0052495305,0.0004719945,0.0013734128,0.0008983133,0.002587284,0.0074282987,0.003295262,0.0028039266,0.0013785128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090678746,0.000049839487,0.0001892086,0.000015534299,0.0000070800297,0.0001355022,0.00035542873,0.0011189379,0.00085531507,0.9919891,0.0008551923,0.0043382645],"study_design_scores_gemma":[0.000036930604,0.00004979984,0.0002599323,0.000019280686,0.000015030471,0.00021055884,0.0002496369,0.01100066,0.0013247398,0.97744876,0.0093607055,0.000023994011],"about_ca_topic_score_codex":0.003116636,"about_ca_topic_score_gemma":0.0027726316,"teacher_disagreement_score":0.008649418,"about_ca_system_score_codex":0.0012907363,"about_ca_system_score_gemma":0.0014689806,"threshold_uncertainty_score":0.028935134},"labels":[],"label_agreement":null},{"id":"W1967421215","doi":"10.1016/j.jcta.2006.08.002","title":"On the maximum number of edges in quasi-planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Planar; Simple (philosophy); Upper and lower bounds; Pairwise comparison; Book embedding; Multiple edges; Matching (statistics); Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","score_opus":0.007860445494885649,"score_gpt":0.2300400927524089,"score_spread":0.22217964725752323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967421215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5614416,0.0038140775,0.38746515,0.0067886757,0.00042895155,0.00018154415,0.0013694239,0.0005881273,0.037922405],"genre_scores_gemma":[0.8480338,0.0029127148,0.13610156,0.00078796677,0.000460127,0.00022106343,0.0010209434,0.0005274127,0.009934493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858785,0.0005880651,0.000086242886,0.00027945545,0.00024004384,0.00021843091],"domain_scores_gemma":[0.96258026,0.031376217,0.001949672,0.0015614401,0.0010250888,0.0015073103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002961802,0.0011967283,0.0017122208,0.0026496628,0.0017688172,0.0034974925,0.003604519,0.0027672881,0.009374524],"category_scores_gemma":[0.02458485,0.0016514803,0.0010557546,0.0023166698,0.0034876661,0.01024763,0.0028789572,0.0027740125,0.0006754501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014311244,0.0002556778,0.005881459,0.0012061485,0.00015526701,0.00036590375,0.0008183516,0.19415045,0.014801925,0.68758607,0.012563778,0.08078387],"study_design_scores_gemma":[0.00011221874,0.0001381743,0.0018931713,0.00015129612,0.000078052624,0.00027290694,0.00036789422,0.22499523,0.0030448162,0.76562095,0.003280341,0.000044947785],"about_ca_topic_score_codex":0.00089972967,"about_ca_topic_score_gemma":0.0017590952,"teacher_disagreement_score":0.009374524,"about_ca_system_score_codex":0.0015968888,"about_ca_system_score_gemma":0.00061277155,"threshold_uncertainty_score":0.031360924},"labels":[],"label_agreement":null},{"id":"W1967885750","doi":"10.1006/jcta.2002.3304","title":"Permutations with Low Discrepancy Consecutive k-sums","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Permutation (music); Mathematics; Modulo; Parity of a permutation; Cyclic permutation; Line (geometry); Discrete mathematics; Symmetric group; Physics","score_opus":0.027057550137999764,"score_gpt":0.2996241831864421,"score_spread":0.2725666330484423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967885750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8502292,0.00050493877,0.0592311,0.0018794643,0.0006761304,0.000085204636,0.00035848282,0.0006118748,0.086423576],"genre_scores_gemma":[0.9623545,0.0002391359,0.017292429,0.00037630778,0.0002506988,0.000102405545,0.00037502323,0.00028441782,0.018725108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825925,0.00048318435,0.00015173311,0.00032489697,0.00042390314,0.00035711649],"domain_scores_gemma":[0.99455994,0.0025485202,0.00069258886,0.0010300145,0.00043062118,0.0007382325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013071116,0.00095316797,0.0012824526,0.0018935268,0.0028810974,0.004717738,0.001598254,0.0028458796,0.009633852],"category_scores_gemma":[0.009837457,0.0011902467,0.0009436655,0.0016976594,0.0035964022,0.005282203,0.0045657195,0.0039530373,0.0022754734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039905292,0.0000657499,0.0012149409,0.00007343918,0.000015853357,0.00046689177,0.000321985,0.0017275244,0.0034527038,0.9822547,0.0022405826,0.007766713],"study_design_scores_gemma":[0.000052802043,0.000045130746,0.0005993784,0.000031520733,0.000019723233,0.00069909095,0.00014544824,0.005932947,0.0019117298,0.9874069,0.0031221663,0.000033254324],"about_ca_topic_score_codex":0.00027066414,"about_ca_topic_score_gemma":0.0004429593,"teacher_disagreement_score":0.009633852,"about_ca_system_score_codex":0.0010017715,"about_ca_system_score_gemma":0.0007412303,"threshold_uncertainty_score":0.03222841},"labels":[],"label_agreement":null},{"id":"W1968759207","doi":"10.1016/j.jcta.2006.11.005","title":"Maximum distance separable codes and arcs in projective spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Projective test; Separable space; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.004965791969250566,"score_gpt":0.21562679224028844,"score_spread":0.21066100027103787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968759207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5190907,0.003330232,0.36602807,0.006225011,0.00032406987,0.000092135735,0.0010482165,0.00065430894,0.10320729],"genre_scores_gemma":[0.93301624,0.0019452818,0.0403325,0.00035779295,0.00040671203,0.00010815839,0.0005064201,0.00015381307,0.023172958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871075,0.00043301244,0.00006689237,0.00023046494,0.0003527511,0.00020607583],"domain_scores_gemma":[0.9911281,0.0064082565,0.00085795793,0.00065415754,0.0003803079,0.00057121424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010818858,0.00083077664,0.0009667465,0.0021745875,0.0018769152,0.004197976,0.0013517734,0.0016132877,0.0056888517],"category_scores_gemma":[0.009845816,0.0008782332,0.00061895256,0.0037371346,0.003978319,0.0074877185,0.0035964807,0.0042162524,0.0006835825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006788616,0.000016073465,0.00023360195,0.00003932177,0.000005289912,0.000036834026,0.0001599396,0.0039639515,0.00036216158,0.98837876,0.0009540081,0.0057821344],"study_design_scores_gemma":[0.000013581837,0.000013189201,0.0001432512,0.000015170083,0.0000062373188,0.00007276079,0.000060647933,0.009916791,0.00048742865,0.98735714,0.0019044667,0.000009385085],"about_ca_topic_score_codex":0.0008644171,"about_ca_topic_score_gemma":0.00088028365,"teacher_disagreement_score":0.0056888517,"about_ca_system_score_codex":0.0018991494,"about_ca_system_score_gemma":0.00079487124,"threshold_uncertainty_score":0.019031107},"labels":[],"label_agreement":null},{"id":"W1969686332","doi":"10.1006/jcta.2002.3268","title":"Vanishing Ideals of Lattice Diagram Determinants","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Lattice (music); Diagram; Mathematics; Homogeneous; Combinatorics; Ideal (ethics); Partition (number theory); Quadrant (abdomen); Space (punctuation); Mathematical physics; Pure mathematics; Physics; Computer science; Philosophy; Statistics","score_opus":0.0406839642677423,"score_gpt":0.3068111698883582,"score_spread":0.2661272056206159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969686332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.717169,0.0006696269,0.08271246,0.0027522414,0.00090004574,0.00011151861,0.00027370977,0.0007503658,0.19466098],"genre_scores_gemma":[0.97275645,0.00026014016,0.00623251,0.000254521,0.0005628563,0.00004573474,0.00014188956,0.00019604227,0.019549869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982874,0.00039074646,0.0000765225,0.00026216096,0.0004974049,0.00048569997],"domain_scores_gemma":[0.99631846,0.0014967454,0.00037866717,0.00026788563,0.00048757528,0.0010506767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016842402,0.0008815234,0.0015099805,0.004727162,0.003945643,0.0059451708,0.0015472989,0.0012867564,0.011953392],"category_scores_gemma":[0.005211125,0.0011290605,0.0010986521,0.0018520217,0.0058707823,0.0077425945,0.0037500495,0.0042146193,0.0017026163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052770076,0.00005613934,0.00033856998,0.000017053106,0.000004672961,0.00008726931,0.00031026025,0.00023298954,0.0006519392,0.99531823,0.00075389113,0.0021761586],"study_design_scores_gemma":[0.00003062184,0.000025695028,0.00038189613,0.000010517017,0.000012826989,0.00021752118,0.00015675848,0.002619711,0.0008378035,0.99392736,0.0017555564,0.000023739281],"about_ca_topic_score_codex":0.0013160877,"about_ca_topic_score_gemma":0.0013495114,"teacher_disagreement_score":0.011953392,"about_ca_system_score_codex":0.0017762538,"about_ca_system_score_gemma":0.0010481552,"threshold_uncertainty_score":0.03998804},"labels":[],"label_agreement":null},{"id":"W1970396807","doi":"10.1016/j.jcta.2010.02.006","title":"Laurent polynomials and Eulerian numbers","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Laurent polynomial; Mathematics; Eulerian path; Constant (computer programming); Zero (linguistics); Polynomial; Ideal (ethics); Laurent series; Pure mathematics; Sequence (biology); Degree (music); Discrete mathematics; Combinatorics; Mathematical analysis; Computer science; Physics; Lagrangian","score_opus":0.01400517660512065,"score_gpt":0.2873138421584913,"score_spread":0.2733086655533707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970396807","genre_codex":"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.33519733,0.04175806,0.07143821,0.026601754,0.0055815997,0.000040118015,0.00055338134,0.0002649656,0.5185646],"genre_scores_gemma":[0.9016846,0.011834155,0.008202785,0.00087801466,0.0043478105,0.000033133652,0.00027814123,0.000079775564,0.07266163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955684,0.00012270136,0.000022467677,0.000072175884,0.00015163809,0.00007401091],"domain_scores_gemma":[0.99835855,0.0008695509,0.0002452143,0.00012512431,0.0002190549,0.00018252939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096837437,0.00092094124,0.00089010206,0.0029187582,0.0017863145,0.0045474796,0.0008168478,0.0012129211,0.009389068],"category_scores_gemma":[0.0047549494,0.00054308336,0.0004251585,0.0033611166,0.0041597467,0.0052369805,0.0013437043,0.004246752,0.0014114489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016029819,0.000014192803,0.00014992853,0.000016870708,0.0000030177182,0.000029898558,0.00013523076,0.00043345318,0.00014916598,0.9938123,0.001479856,0.0037600822],"study_design_scores_gemma":[0.000006322142,0.0000035961414,0.00018891203,0.000010001702,0.0000036773088,0.000040952305,0.000039164483,0.00065019826,0.000066281165,0.99269617,0.0062888972,0.000005909672],"about_ca_topic_score_codex":0.0016386627,"about_ca_topic_score_gemma":0.0022225142,"teacher_disagreement_score":0.009389068,"about_ca_system_score_codex":0.002304637,"about_ca_system_score_gemma":0.000813386,"threshold_uncertainty_score":0.03140956},"labels":[],"label_agreement":null},{"id":"W1973306860","doi":"10.1006/jcta.2001.3173","title":"Complementary Algorithms for Tableaux","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Equivalence (formal languages); Class (philosophy); Set (abstract data type); Diagram; Computer science; A priori and a posteriori; Mathematics; Algorithm; Column (typography); Combinatorics; Discrete mathematics; Programming language; Artificial intelligence; Connection (principal bundle)","score_opus":0.05499614994011755,"score_gpt":0.34642994031474017,"score_spread":0.29143379037462264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973306860","genre_codex":"methods","genre_gemma":"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.07809851,0.0014703189,0.769751,0.00275635,0.00069537247,0.0002466797,0.00074225606,0.0015507714,0.14468868],"genre_scores_gemma":[0.51703525,0.0012139104,0.40549374,0.0012166747,0.0005325959,0.0005319496,0.0016512077,0.0011667273,0.07115787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977189,0.0006542316,0.00013824897,0.00045042168,0.0007452189,0.00029297607],"domain_scores_gemma":[0.99329835,0.004866967,0.00019388204,0.0008175407,0.00054601504,0.00027736346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018625922,0.0010505299,0.0018089286,0.0025277908,0.0030523832,0.0069922446,0.002603859,0.0023077861,0.02437892],"category_scores_gemma":[0.010807845,0.0012614141,0.0024262469,0.0033569245,0.0032974868,0.00921832,0.0046580383,0.0055895117,0.0028796855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041663217,0.000036015746,0.00011708308,0.00004622481,0.000012394414,0.000017993136,0.00010387855,0.0018514293,0.0003085914,0.9762333,0.0038400593,0.017391384],"study_design_scores_gemma":[0.000021610005,0.000009592172,0.000040820552,0.000017389317,0.00001234836,0.000021832817,0.00002566396,0.014897629,0.00038200303,0.98038185,0.004179379,0.000009796176],"about_ca_topic_score_codex":0.0020073412,"about_ca_topic_score_gemma":0.003947223,"teacher_disagreement_score":0.02437892,"about_ca_system_score_codex":0.003468865,"about_ca_system_score_gemma":0.0019972697,"threshold_uncertainty_score":0.081555605},"labels":[],"label_agreement":null},{"id":"W1974325710","doi":"10.1016/j.jcta.2011.10.001","title":"Sets of orthogonal hypercubes of class r","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; University College Dublin","keywords":"Hypercube; Combinatorics; Orthogonality; Mathematics; Class (philosophy); Power of two; Discrete mathematics; Prime (order theory); Computer science; Arithmetic; Geometry","score_opus":0.01977501702963548,"score_gpt":0.22370991365212553,"score_spread":0.20393489662249004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974325710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75014067,0.001285877,0.14981079,0.0005286303,0.00028963148,0.00016355459,0.001899228,0.00032210862,0.09555945],"genre_scores_gemma":[0.9441853,0.00057136273,0.036498845,0.00016841924,0.0001517835,0.00031957778,0.0020811383,0.00010452951,0.015918856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991435,0.0002113809,0.00006928913,0.0001662133,0.0002433701,0.00016629368],"domain_scores_gemma":[0.9981932,0.0007647644,0.0003284299,0.00022552365,0.00026475487,0.00022334604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042783,0.00059366715,0.0007518224,0.001875381,0.0013915462,0.0027498244,0.0011273581,0.00064520544,0.006964264],"category_scores_gemma":[0.0025212623,0.0005820559,0.0006061508,0.0011561778,0.0011569071,0.0015534164,0.0020269647,0.0006032509,0.00066246977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050502457,0.00012803102,0.002752715,0.00026336682,0.000093839735,0.00041300946,0.00038595323,0.010659596,0.010983372,0.93936455,0.00521841,0.029232135],"study_design_scores_gemma":[0.00014494875,0.00016770166,0.0053844904,0.00016561816,0.0000771044,0.0012591426,0.00070853694,0.082652986,0.012431987,0.8750384,0.021869553,0.000099409604],"about_ca_topic_score_codex":0.0005890794,"about_ca_topic_score_gemma":0.0006447201,"teacher_disagreement_score":0.006964264,"about_ca_system_score_codex":0.00067787064,"about_ca_system_score_gemma":0.00045613822,"threshold_uncertainty_score":0.023297787},"labels":[],"label_agreement":null},{"id":"W1974746744","doi":"10.1016/j.jcta.2009.11.002","title":"Quasisymmetric Schur functions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.02374640907156703,"score_gpt":0.30137025831362535,"score_spread":0.2776238492420583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974746744","genre_codex":"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.43081734,0.0013201097,0.09091924,0.003476167,0.0018039596,0.00010465249,0.00053297717,0.00045652039,0.47056907],"genre_scores_gemma":[0.899812,0.00078302354,0.010012895,0.0006606349,0.001162764,0.000062483596,0.00030586263,0.00020729873,0.086993024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993882,0.00012936199,0.000029331699,0.00008938726,0.00024104449,0.00012269188],"domain_scores_gemma":[0.9989429,0.00028628964,0.000120431614,0.00014694278,0.00026066147,0.00024274692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081476255,0.00091420196,0.0007894205,0.0027152838,0.0021856306,0.0032561184,0.0008190188,0.0009405965,0.018573934],"category_scores_gemma":[0.0019144069,0.0004965561,0.00068250357,0.0014725751,0.0027293842,0.003930558,0.0017002174,0.0025739865,0.0024549153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015651818,0.000009253499,0.000049431197,0.000007989775,0.0000019443635,0.00002955139,0.00004796202,0.00008706892,0.00044240194,0.99607074,0.00088749,0.0023505292],"study_design_scores_gemma":[0.000013746017,0.000015244825,0.00025236173,0.000008604024,0.000007660317,0.00025143876,0.00006449395,0.0019099233,0.00082967477,0.99108875,0.005541892,0.00001626306],"about_ca_topic_score_codex":0.00063960487,"about_ca_topic_score_gemma":0.00084033224,"teacher_disagreement_score":0.018573934,"about_ca_system_score_codex":0.0013406307,"about_ca_system_score_gemma":0.00068490335,"threshold_uncertainty_score":0.062135994},"labels":[],"label_agreement":null},{"id":"W1976554601","doi":"10.1016/j.jcta.2013.09.002","title":"Lyndon words and Fibonacci numbers","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Fibonacci number; Combinatorics; Concatenation (mathematics); Word (group theory); Mathematics; Golden ratio; Upper and lower bounds; Closure (psychology); Aperiodic graph; Combinatorics on words; Word length; Discrete mathematics; Computer science; Geometry","score_opus":0.004193574610920123,"score_gpt":0.20143033041803673,"score_spread":0.1972367558071166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976554601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47894293,0.011722846,0.20561829,0.0053583174,0.0018852709,0.000101551,0.00047977417,0.00052806875,0.2953629],"genre_scores_gemma":[0.93990964,0.001756281,0.018782523,0.00051534653,0.000813983,0.00012088454,0.00024956823,0.000088712775,0.03776295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993082,0.00019690166,0.000052477346,0.00012504603,0.00020475002,0.00011254525],"domain_scores_gemma":[0.99772686,0.0014120792,0.00023754733,0.00018508975,0.0002645242,0.00017394937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010420345,0.00062379066,0.00096987066,0.0027795383,0.00333477,0.0049919756,0.0010025626,0.001711357,0.008869104],"category_scores_gemma":[0.0045833834,0.0007144895,0.00075294444,0.0028300835,0.004380608,0.005369667,0.001569673,0.00217446,0.0012495939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020726646,0.000009240641,0.00012958603,0.000015939513,0.000002388845,0.00007647778,0.00029364834,0.00023326243,0.00030124967,0.9949561,0.0007051032,0.0032562176],"study_design_scores_gemma":[0.0000066920124,0.000004893656,0.00007601351,0.00000716386,0.0000037783448,0.00007653521,0.000074512005,0.00069440674,0.00012886287,0.99624455,0.0026737843,0.000008860176],"about_ca_topic_score_codex":0.001031424,"about_ca_topic_score_gemma":0.0014389724,"teacher_disagreement_score":0.008869104,"about_ca_system_score_codex":0.0016806728,"about_ca_system_score_gemma":0.000757149,"threshold_uncertainty_score":0.02967012},"labels":[],"label_agreement":null},{"id":"W1979399949","doi":"10.1016/j.jcta.2014.12.006","title":"Directed graphs and boron trees","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Disjoint sets; Class (philosophy); Combinatorics; Mathematics; Extension (predicate logic); Tree (set theory); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.026216392693924135,"score_gpt":0.2959892680415045,"score_spread":0.2697728753475804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979399949","genre_codex":"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.1981845,0.009980107,0.16576542,0.012669564,0.0016274365,0.000075488315,0.001116809,0.0003520955,0.6102286],"genre_scores_gemma":[0.85867,0.005601797,0.043927275,0.002289309,0.00096571253,0.000098351724,0.0008850668,0.00019819397,0.08736435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996768,0.000115334755,0.000016413609,0.00006183424,0.000081210375,0.00004840607],"domain_scores_gemma":[0.99918324,0.0003967967,0.000104813196,0.000074883246,0.00013469964,0.000105541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004838242,0.00039309767,0.0006645097,0.001797071,0.0018426523,0.002967152,0.000745577,0.00135266,0.010120749],"category_scores_gemma":[0.0019892002,0.0004673844,0.0004793717,0.0017538137,0.0022195429,0.004195031,0.0013612645,0.0025169104,0.0013465041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006169178,0.0000039733404,0.00003598637,0.000009873881,0.0000014770895,0.000009122604,0.00004500103,0.00016347134,0.00008952536,0.99718887,0.00091127696,0.0015352647],"study_design_scores_gemma":[0.0000032143216,0.0000013222104,0.000037726255,0.000006314588,0.000002436695,0.0000196566,0.00003841872,0.000446961,0.000044277145,0.9948973,0.0044997367,0.0000026755808],"about_ca_topic_score_codex":0.0020086344,"about_ca_topic_score_gemma":0.002721046,"teacher_disagreement_score":0.010120749,"about_ca_system_score_codex":0.0013159523,"about_ca_system_score_gemma":0.00044375242,"threshold_uncertainty_score":0.033857286},"labels":[],"label_agreement":null},{"id":"W1981620429","doi":"10.1016/j.jcta.2011.11.006","title":"Combinatorial variations on Cantorʼs diagonal","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Diagonal; Cantor's diagonal argument; Combinatorics; Equivalence relation; Class (philosophy); Equivalence (formal languages); Relation (database); Square (algebra); Discrete mathematics; Cantor set; Geometry","score_opus":0.03823127826310168,"score_gpt":0.27948129278037176,"score_spread":0.24125001451727007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981620429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70485955,0.0013272328,0.05068852,0.0027624827,0.0015548386,0.0000953884,0.0006268555,0.000531571,0.23755354],"genre_scores_gemma":[0.95164514,0.0004078551,0.009870556,0.0003622871,0.0007588293,0.000060320235,0.00024812514,0.00022213983,0.036424667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919635,0.00013407343,0.00003622564,0.00017605173,0.0002525967,0.00020465018],"domain_scores_gemma":[0.9984983,0.00037738527,0.0002533055,0.00016524662,0.00026081796,0.00044501128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000597484,0.00083340897,0.00091242156,0.00482479,0.0030481566,0.0034401042,0.0015683935,0.0013030532,0.013607415],"category_scores_gemma":[0.0024331107,0.00050468725,0.0007919423,0.0017831171,0.0039361864,0.0027933563,0.0020039312,0.0025823063,0.000937591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020568326,0.000009642681,0.00008035564,0.000008578873,0.0000032888238,0.00006557586,0.00010716778,0.000255879,0.0005286337,0.99620914,0.00078633794,0.0019248552],"study_design_scores_gemma":[0.000022830336,0.00003075634,0.0007328621,0.00001433453,0.0000097798975,0.0002599328,0.00013978689,0.0040202476,0.0005528927,0.9873073,0.0068758456,0.00003344787],"about_ca_topic_score_codex":0.00334305,"about_ca_topic_score_gemma":0.0033463894,"teacher_disagreement_score":0.013607415,"about_ca_system_score_codex":0.002463729,"about_ca_system_score_gemma":0.00070996635,"threshold_uncertainty_score":0.04552132},"labels":[],"label_agreement":null},{"id":"W1982890265","doi":"10.1016/j.jcta.2012.03.013","title":"On triple systems and strongly regular graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Strongly regular graph; Mathematics; Graph; Automorphism; Latin square; Discrete mathematics; Line graph; Pathwidth; Chemistry","score_opus":0.005895100764086992,"score_gpt":0.19247226673729487,"score_spread":0.18657716597320786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982890265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5064658,0.0038430942,0.30322385,0.0063801887,0.0010195371,0.0001322891,0.0006329774,0.00030483608,0.17799735],"genre_scores_gemma":[0.9458451,0.002197345,0.026713708,0.00083457906,0.0010838143,0.00013515334,0.0004951654,0.00013526759,0.02255989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992011,0.00027797066,0.000042165106,0.0001553315,0.00016183035,0.00016155525],"domain_scores_gemma":[0.99667346,0.0019219012,0.00039107804,0.00028867653,0.00036516468,0.00035975574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010171831,0.0008309021,0.001194735,0.0026827725,0.0027183108,0.003216992,0.0010193888,0.0017970745,0.008003532],"category_scores_gemma":[0.00426602,0.0006757965,0.0010016684,0.0024846592,0.0037722834,0.0057229,0.0020484028,0.00292248,0.00066962483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016692418,0.000013434779,0.00012853312,0.000019988498,0.000004092698,0.000055895245,0.00015947023,0.0010620921,0.0002965282,0.99535036,0.00090043,0.0019925467],"study_design_scores_gemma":[0.0000045292913,0.0000054036072,0.00007188791,0.000009586014,0.0000028093925,0.000035881912,0.000054176766,0.0036902807,0.00005728879,0.99522686,0.0008361214,0.0000050975113],"about_ca_topic_score_codex":0.0018829457,"about_ca_topic_score_gemma":0.002232338,"teacher_disagreement_score":0.008003532,"about_ca_system_score_codex":0.0015292197,"about_ca_system_score_gemma":0.00061004236,"threshold_uncertainty_score":0.026774466},"labels":[],"label_agreement":null},{"id":"W1985237288","doi":"10.1016/j.jcta.2014.08.002","title":"Descent sets on 321-avoiding involutions and hook decompositions of partitions","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca; National Sanitarium Association; Simons Foundation; National Science Foundation","keywords":"Bijection, injection and surjection; Mathematics; Descent (aeronautics); Combinatorics; Hook; Set (abstract data type); Diagram; Index (typography); Binomial coefficient; Bijection; Statistics; Computer science; Physics","score_opus":0.026322335408093915,"score_gpt":0.3024315229464988,"score_spread":0.27610918753840485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985237288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8889588,0.00021421992,0.04738164,0.00039127946,0.00026395527,0.00004117838,0.0001979186,0.00019587505,0.062355053],"genre_scores_gemma":[0.96744007,0.00017863723,0.007888198,0.00017016025,0.0001621562,0.00005365678,0.0002971655,0.00016860114,0.023641286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936527,0.0001261356,0.000035478293,0.000101781894,0.00016806238,0.00020321494],"domain_scores_gemma":[0.9990006,0.00029155266,0.0001728401,0.00011879364,0.00010715124,0.000309125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006096547,0.0008708531,0.0009227449,0.003351395,0.0030455105,0.004068265,0.0012587167,0.0012999343,0.0073108263],"category_scores_gemma":[0.0016813347,0.0008324844,0.0013772504,0.001340496,0.0033394597,0.002589751,0.0027377934,0.002418875,0.0013237491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006367323,0.00004189786,0.0006093612,0.00001431433,0.000007720963,0.00017363366,0.0004735664,0.0006641503,0.0019232484,0.9923455,0.0006126745,0.0030702092],"study_design_scores_gemma":[0.000025583746,0.000028291737,0.0011736373,0.00002060096,0.000013988714,0.0001779811,0.0003498074,0.003745324,0.0007343671,0.9920266,0.0016824264,0.000021434198],"about_ca_topic_score_codex":0.0010821017,"about_ca_topic_score_gemma":0.0016724007,"teacher_disagreement_score":0.0073108263,"about_ca_system_score_codex":0.0015255176,"about_ca_system_score_gemma":0.00047264667,"threshold_uncertainty_score":0.024457216},"labels":[],"label_agreement":null},{"id":"W1985908622","doi":"10.1016/j.jcta.2009.02.007","title":"On decompositions of complete hypergraphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Hypergraph; Combinatorics; Partition (number theory); Mathematics; Discrete mathematics","score_opus":0.005404203268405634,"score_gpt":0.1992977980009139,"score_spread":0.19389359473250828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985908622","genre_codex":"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.3927959,0.00327265,0.44316223,0.0018447244,0.00041033182,0.00022587874,0.0018016105,0.00036518087,0.15612155],"genre_scores_gemma":[0.77777904,0.0033464571,0.141207,0.0007452833,0.0005106958,0.00026472248,0.0031283374,0.0005056236,0.07251295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939835,0.00019119568,0.000033847384,0.00011470008,0.00013829111,0.00012364611],"domain_scores_gemma":[0.99762744,0.0010543594,0.00030603912,0.00025295428,0.0003220331,0.00043716337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083351374,0.00096453837,0.00082284457,0.0030159915,0.0013052473,0.0036790892,0.00092178397,0.00091072446,0.009855652],"category_scores_gemma":[0.0031530873,0.0010364688,0.0010784509,0.0023000685,0.0018304165,0.0039973077,0.0019412495,0.0023425661,0.0011964206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050184823,0.00003464227,0.0004126475,0.00006453329,0.000021662956,0.000113893526,0.00045518109,0.0038487434,0.0012566622,0.97721475,0.0042598983,0.01226712],"study_design_scores_gemma":[0.0000097196125,0.000006901406,0.00024955082,0.000034963905,0.000010044781,0.00006576428,0.00013978401,0.008481467,0.0001653812,0.9874715,0.003358706,0.000006108444],"about_ca_topic_score_codex":0.001508634,"about_ca_topic_score_gemma":0.0024170957,"teacher_disagreement_score":0.009855652,"about_ca_system_score_codex":0.0013164468,"about_ca_system_score_gemma":0.00047695235,"threshold_uncertainty_score":0.032970488},"labels":[],"label_agreement":null},{"id":"W1988752459","doi":"10.1016/j.jcta.2010.11.015","title":"On polynomial integrals over the orthogonal group","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Haar measure; Group (periodic table); Measure (data warehouse); Combinatorics; Polynomial; Type (biology); Haar; Pure mathematics; Mathematical analysis; Physics; Computer science; Quantum mechanics","score_opus":0.015585444995203382,"score_gpt":0.2842858870133922,"score_spread":0.2687004420181888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988752459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54946834,0.008816743,0.12620275,0.007632377,0.0021118112,0.000056636658,0.00032372025,0.00022146072,0.30516616],"genre_scores_gemma":[0.939307,0.0055462644,0.011382953,0.0006122632,0.003037313,0.000040684416,0.00023940037,0.00017739237,0.039656714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911815,0.00022709316,0.000045490546,0.00011802141,0.00032144634,0.00016973232],"domain_scores_gemma":[0.99794525,0.00096930633,0.0002671666,0.00016593924,0.00034619094,0.00030617687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016859623,0.00144658,0.0016356767,0.004940741,0.002756351,0.004270016,0.0012332117,0.001544194,0.0076631657],"category_scores_gemma":[0.004983603,0.000590029,0.00101689,0.0037577641,0.0048325416,0.008017468,0.0027798156,0.0031348194,0.0008965663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002481774,0.000020971625,0.00012262349,0.000022970724,0.000006051226,0.00007236229,0.00015314552,0.0007963284,0.000308496,0.9941859,0.00076812226,0.0035181593],"study_design_scores_gemma":[0.000007295677,0.000008201138,0.00014966424,0.000014308783,0.000005625771,0.00008321272,0.000049165224,0.0026855248,0.000113039525,0.995531,0.001344566,0.000008505272],"about_ca_topic_score_codex":0.0017371791,"about_ca_topic_score_gemma":0.0013924503,"teacher_disagreement_score":0.0076631657,"about_ca_system_score_codex":0.002907834,"about_ca_system_score_gemma":0.0010634931,"threshold_uncertainty_score":0.025635839},"labels":[],"label_agreement":null},{"id":"W1989541938","doi":"10.1016/j.jcta.2009.09.001","title":"Map operations and k-orbit maps","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Orbit (dynamics); Automorphism group; Mathematics; Automorphism; Heteroclinic orbit; Truncation (statistics); Genus; Physics; Combinatorics; Homoclinic orbit; Bifurcation; Biology","score_opus":0.02877329543576233,"score_gpt":0.31500807998242664,"score_spread":0.2862347845466643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989541938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58570886,0.0066491705,0.09475059,0.0071201837,0.0017550546,0.00005896296,0.0005317254,0.0004416631,0.3029838],"genre_scores_gemma":[0.9614098,0.0018882756,0.0068855914,0.0003141893,0.00070404704,0.000042043837,0.00019082296,0.0000912518,0.028474083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.00014155557,0.000052923264,0.00014534555,0.00018293985,0.00016672215],"domain_scores_gemma":[0.9983309,0.00084938423,0.00021635526,0.00017689278,0.00018682674,0.0002395949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007014681,0.0007200523,0.0007851331,0.003062916,0.0031064218,0.0052615884,0.0009512432,0.0013560246,0.011551288],"category_scores_gemma":[0.0024276427,0.00055915373,0.0009169866,0.0031285924,0.0062601026,0.009529382,0.0031564897,0.003299752,0.0012203528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023352053,0.000012412381,0.00012395367,0.000013586337,0.0000036230595,0.000050472914,0.00037620292,0.00013955463,0.00023524671,0.9957802,0.0004932212,0.0027481995],"study_design_scores_gemma":[0.000007973809,0.000008329238,0.00015827484,0.0000065555623,0.0000065383238,0.000090007095,0.00017048352,0.0003879889,0.00019951319,0.99623376,0.0027222137,0.000008356449],"about_ca_topic_score_codex":0.0011944933,"about_ca_topic_score_gemma":0.0009403299,"teacher_disagreement_score":0.011551288,"about_ca_system_score_codex":0.0015899651,"about_ca_system_score_gemma":0.00069989887,"threshold_uncertainty_score":0.038642943},"labels":[],"label_agreement":null},{"id":"W1993463637","doi":"10.1016/j.jcta.2012.03.011","title":"Piercing quasi-rectangles—On a problem of Danzer and Rogers","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rectangle; Square (algebra); Unit square; Combinatorics; Mathematics; Center (category theory); Unit (ring theory); Rotation (mathematics); Trajectory; Geometry; Physics; Crystallography","score_opus":0.00868938134234849,"score_gpt":0.2312529134461897,"score_spread":0.22256353210384122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993463637","genre_codex":"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.15151197,0.006389629,0.7544766,0.013132584,0.0018402174,0.00019933123,0.00037363847,0.0005129099,0.07156315],"genre_scores_gemma":[0.53171325,0.008449457,0.373906,0.0020712435,0.0015594354,0.00019574285,0.00093818497,0.0010207159,0.08014599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986811,0.00048348375,0.00007899877,0.0003211685,0.00024637385,0.00018887238],"domain_scores_gemma":[0.9964318,0.0024273184,0.00013389465,0.000554035,0.00023416044,0.00021879317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020272252,0.00093592564,0.0022330775,0.0011674878,0.0027750072,0.0034541094,0.0028003065,0.0040691597,0.010920148],"category_scores_gemma":[0.0112456,0.0013388724,0.0021163386,0.0024277407,0.0031651633,0.008159748,0.0050607617,0.004329376,0.0019278857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013772372,0.000049886214,0.0002972127,0.00015892861,0.000026370446,0.00024458682,0.00042043458,0.023567745,0.0014264984,0.9236798,0.010919021,0.039071888],"study_design_scores_gemma":[0.000046637968,0.000039866998,0.00018994321,0.000067510315,0.00002214569,0.00025772088,0.0004630118,0.06442342,0.0010499118,0.907519,0.0258846,0.000036311016],"about_ca_topic_score_codex":0.0022236302,"about_ca_topic_score_gemma":0.0012466689,"teacher_disagreement_score":0.010920148,"about_ca_system_score_codex":0.000990657,"about_ca_system_score_gemma":0.0007220329,"threshold_uncertainty_score":0.036531508},"labels":[],"label_agreement":null},{"id":"W1993609467","doi":"10.1016/s0097-3165(03)00053-0","title":"Decompositions of complete multigraphs derived from Hadamard matrices","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hadamard transform; Mathematics; Combinatorics; Mathematical analysis","score_opus":0.0073355197483380655,"score_gpt":0.19867845312648041,"score_spread":0.19134293337814234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993609467","genre_codex":"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.30952197,0.0014736215,0.6063454,0.00057538756,0.0003552386,0.00014165092,0.000857338,0.00039264877,0.08033676],"genre_scores_gemma":[0.8125122,0.0011136486,0.14994413,0.00038927005,0.000322459,0.00017525941,0.0011250557,0.00032718203,0.03409076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997392,0.00006355128,0.000016994516,0.0000518197,0.000076484626,0.000051854946],"domain_scores_gemma":[0.9991585,0.00024946666,0.00013266192,0.00012688542,0.00019127454,0.0001412075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003506025,0.0006007651,0.0005654139,0.0019561567,0.0009180947,0.0016845248,0.00062411686,0.00064877875,0.004849168],"category_scores_gemma":[0.0013331211,0.0005626952,0.00081011595,0.00089488155,0.0007848428,0.0013408898,0.0006914858,0.0011822387,0.00078656187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005071674,0.000028578133,0.00020567153,0.00005359044,0.000016558315,0.00016424138,0.0002275326,0.008657667,0.0047991294,0.97290707,0.0023704886,0.010518865],"study_design_scores_gemma":[0.000014478492,0.000023740411,0.00039383676,0.000029589464,0.000014898481,0.00020827615,0.000102255384,0.043757647,0.0013414727,0.9487214,0.0053734086,0.000018985247],"about_ca_topic_score_codex":0.0006931944,"about_ca_topic_score_gemma":0.0011734404,"teacher_disagreement_score":0.004849168,"about_ca_system_score_codex":0.0005723275,"about_ca_system_score_gemma":0.00036691662,"threshold_uncertainty_score":0.01622206},"labels":[],"label_agreement":null},{"id":"W1994066278","doi":"10.1006/jcta.2001.3231","title":"A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; School of Mathematics, Institute for Research in Fundamental Sciences","keywords":"Mathematics; Combinatorics; Hadamard transform; Diagonal; Graph; Hadamard matrix; Block (permutation group theory); Block matrix; Order (exchange); Discrete mathematics; Geometry; Physics; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.006470355454004183,"score_gpt":0.20229150830952286,"score_spread":0.19582115285551868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994066278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385669,0.000350902,0.100571916,0.0023080597,0.00032492122,0.00009352425,0.00037446915,0.0002269483,0.057182383],"genre_scores_gemma":[0.9626895,0.00010959962,0.025567792,0.0002410333,0.00007529217,0.000033095603,0.00015060882,0.00004005737,0.011093001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997309,0.00007456987,0.000011667806,0.00006162428,0.00006357063,0.000057672558],"domain_scores_gemma":[0.99922824,0.00033740257,0.00009474026,0.000097755656,0.00010335439,0.00013854438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029109212,0.00040428623,0.00051869417,0.00076231384,0.0010768283,0.0013981741,0.00060328376,0.0014718839,0.004399979],"category_scores_gemma":[0.0014695409,0.0003557093,0.0003454776,0.0007642679,0.0011311166,0.0013663957,0.00052453735,0.001184315,0.00037787578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003233018,0.00007579132,0.00053930335,0.00005920889,0.000017415285,0.0013300484,0.00036124513,0.0034291379,0.014422223,0.9701905,0.0024523458,0.0067994515],"study_design_scores_gemma":[0.0000943867,0.000100489924,0.0006935359,0.000018794115,0.000024066712,0.0009969445,0.00027511496,0.043919973,0.0060373736,0.94177127,0.0060133487,0.000054768137],"about_ca_topic_score_codex":0.00095255836,"about_ca_topic_score_gemma":0.001394741,"teacher_disagreement_score":0.004399979,"about_ca_system_score_codex":0.0005874624,"about_ca_system_score_gemma":0.00047582417,"threshold_uncertainty_score":0.014719427},"labels":[],"label_agreement":null},{"id":"W1994907374","doi":"10.1016/j.jcta.2004.01.009","title":"Labelled and unlabelled enumeration of k-gonal 2-trees","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Combinatorics; Mathematics","score_opus":0.016552700683581934,"score_gpt":0.2807712878681287,"score_spread":0.26421858718454677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994907374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7947783,0.00052038586,0.08591792,0.0009810827,0.0001847437,0.0000845253,0.0014184616,0.00043899752,0.1156756],"genre_scores_gemma":[0.9074588,0.0003903722,0.055888038,0.00038508166,0.00007242256,0.00012202598,0.0027010394,0.0003080245,0.032674246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904865,0.00027891036,0.00007436571,0.00014400751,0.00023089319,0.00022312767],"domain_scores_gemma":[0.99699533,0.0015662132,0.0003393896,0.00033820965,0.00042055923,0.0003402494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000685706,0.00048287917,0.00066297635,0.0015311,0.0021736233,0.004379901,0.0014329173,0.0016745405,0.010461984],"category_scores_gemma":[0.003828639,0.0006457443,0.0006900872,0.001962754,0.0015671791,0.0029618205,0.0019234034,0.0015186099,0.0014191457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048859534,0.0001852119,0.004121781,0.00025012274,0.000031520256,0.000671992,0.0012165576,0.00962956,0.007726913,0.9389218,0.005157609,0.031598393],"study_design_scores_gemma":[0.000039201735,0.000033371103,0.003088631,0.00010936121,0.00003371842,0.000546585,0.00064814027,0.030790113,0.002698198,0.9508548,0.011119505,0.000038509334],"about_ca_topic_score_codex":0.0013320524,"about_ca_topic_score_gemma":0.0038081917,"teacher_disagreement_score":0.010461984,"about_ca_system_score_codex":0.0010671635,"about_ca_system_score_gemma":0.00063151994,"threshold_uncertainty_score":0.034998834},"labels":[],"label_agreement":null},{"id":"W1996052195","doi":"10.1006/jcta.2000.3143","title":"New Codes from Old; A New Geometric Construction","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Western University","funders":"","keywords":"Computer science; Engineering drawing; Mathematics; Engineering","score_opus":0.0095552161052839,"score_gpt":0.22841441317189198,"score_spread":0.21885919706660809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996052195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.040253013,0.00097395823,0.90795124,0.0018685176,0.0012926062,0.0001292513,0.0004425861,0.0011234898,0.045965277],"genre_scores_gemma":[0.339404,0.0016158487,0.6064212,0.00097123923,0.0009574947,0.00038122284,0.0009015656,0.0017631978,0.047584333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986229,0.0002535225,0.00007217065,0.00028424573,0.0006310979,0.00013617451],"domain_scores_gemma":[0.99733436,0.0006886805,0.0001568503,0.0010251055,0.00050763413,0.00028735757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082195783,0.0008723118,0.00083002215,0.0023086525,0.0018492427,0.0030263513,0.0020048039,0.0015107767,0.007888401],"category_scores_gemma":[0.004741852,0.0007816848,0.00083532906,0.0015779269,0.003958405,0.005527747,0.0052186274,0.0033067854,0.0020131604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033431796,0.000021013864,0.00018329763,0.000061084495,0.000007384408,0.0000679016,0.00020841455,0.0026371612,0.0019162862,0.95009637,0.0062616593,0.038505886],"study_design_scores_gemma":[0.000024957108,0.000042042433,0.0001335703,0.00004590919,0.000024886782,0.00039634306,0.00010468088,0.021852104,0.004956373,0.9110356,0.06134436,0.000039198356],"about_ca_topic_score_codex":0.00053851045,"about_ca_topic_score_gemma":0.0008357697,"teacher_disagreement_score":0.007888401,"about_ca_system_score_codex":0.0009836194,"about_ca_system_score_gemma":0.00070081133,"threshold_uncertainty_score":0.02638936},"labels":[],"label_agreement":null},{"id":"W1996369432","doi":"10.1016/j.jcta.2005.05.002","title":"Inequalities between Littlewood–Richardson coefficients","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Université du Québec à Montréal","funders":"","keywords":"Inequality; Mathematics; Mathematical economics; Applied mathematics; Economics; Mathematical analysis","score_opus":0.03674467252206416,"score_gpt":0.32052073444180434,"score_spread":0.2837760619197402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996369432","genre_codex":"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.24222791,0.010574162,0.1718595,0.010423438,0.0018679267,0.000107603446,0.0009404285,0.00036538288,0.5616335],"genre_scores_gemma":[0.90112114,0.0042424705,0.027219526,0.0013474567,0.0017991886,0.00014745489,0.0005261516,0.0003217225,0.06327476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976447,0.00075125217,0.00013474592,0.00041286534,0.00066698954,0.00038947712],"domain_scores_gemma":[0.986662,0.009084589,0.0008725177,0.0007681122,0.0014516342,0.0011612204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003837734,0.0013533294,0.0012482039,0.0057363,0.0019481907,0.005060877,0.0023932606,0.0015080414,0.020700235],"category_scores_gemma":[0.020356018,0.00092293473,0.00095694873,0.0037107961,0.004880023,0.011910004,0.003766924,0.006488014,0.0025861422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004195308,0.000010352957,0.00019243777,0.000034986148,0.000007889316,0.00004690414,0.0001240705,0.00030842665,0.0004300697,0.9935179,0.0017402548,0.0035448116],"study_design_scores_gemma":[0.000016581473,0.000012026314,0.0005287767,0.000039345505,0.000023498618,0.00015104149,0.00007847394,0.0033056648,0.00047750227,0.9891083,0.0062354584,0.000023321158],"about_ca_topic_score_codex":0.0018924573,"about_ca_topic_score_gemma":0.0022131063,"teacher_disagreement_score":0.020700235,"about_ca_system_score_codex":0.0029003876,"about_ca_system_score_gemma":0.0010692959,"threshold_uncertainty_score":0.06924921},"labels":[],"label_agreement":null},{"id":"W1997415583","doi":"10.1016/j.jcta.2011.07.005","title":"Binary bubble languages and cool-lex order","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Guelph; University of Victoria","funders":"","keywords":"Substring; Mathematics; Combinatorics; Lexicographical order; Binary number; String (physics); Discrete mathematics; Order (exchange); De Bruijn sequence; Set (abstract data type); Computer science; Arithmetic","score_opus":0.010322232063146836,"score_gpt":0.2343718908907133,"score_spread":0.22404965882756647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997415583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47769445,0.0015643642,0.35148278,0.005280449,0.00047899972,0.00012089938,0.0014643616,0.0017730413,0.16014057],"genre_scores_gemma":[0.9339766,0.00034090565,0.02361017,0.0005333175,0.00019474373,0.00010381777,0.0006340515,0.00045252166,0.04015384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994276,0.00013695042,0.000042261472,0.00010989959,0.0001296273,0.00015352441],"domain_scores_gemma":[0.9964982,0.0020580685,0.00024118669,0.00042400247,0.00041593993,0.0003626016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007067167,0.00032732892,0.0007383603,0.0011476392,0.0020174312,0.0038303505,0.0006996305,0.0009580079,0.01434001],"category_scores_gemma":[0.0042239875,0.00062741287,0.0005880105,0.0010914193,0.0029526888,0.008068656,0.0022871394,0.0025909697,0.0014522169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042964413,0.000010982605,0.0001758818,0.000018744075,0.0000020816206,0.00003568777,0.0003427168,0.00027938274,0.0005572475,0.9949633,0.0009161311,0.0026548866],"study_design_scores_gemma":[0.0000134401835,0.0000097665625,0.0001395859,0.000008873436,0.0000049391642,0.000059851525,0.0001854686,0.001804882,0.00058463565,0.9935254,0.0036512057,0.0000120754],"about_ca_topic_score_codex":0.0017570399,"about_ca_topic_score_gemma":0.0021738498,"teacher_disagreement_score":0.01434001,"about_ca_system_score_codex":0.0012176341,"about_ca_system_score_gemma":0.00088944286,"threshold_uncertainty_score":0.047972143},"labels":[],"label_agreement":null},{"id":"W1999618093","doi":"10.1016/j.jcta.2011.02.006","title":"A bijection for covered maps, or a shortcut between Harer–Zagierʼs and Jacksonʼs formulas","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bijection; Bipartite graph; Combinatorics; Genus; Tree (set theory); Mathematics; Botany; Biology; Graph","score_opus":0.09212673232476869,"score_gpt":0.32207747192891456,"score_spread":0.22995073960414586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999618093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.14004168,0.0057490803,0.5670956,0.017510451,0.0023661915,0.0001035883,0.00077414396,0.00061775936,0.26574147],"genre_scores_gemma":[0.7707057,0.0048826644,0.15394764,0.006817857,0.0022869783,0.0003038516,0.0006257682,0.000647713,0.059781976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992901,0.00018525976,0.000066935776,0.00018548816,0.00017901944,0.00009307498],"domain_scores_gemma":[0.9988381,0.00055783807,0.000080910424,0.0002073372,0.00019195721,0.00012383054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016030091,0.00057165313,0.0007163433,0.0021198692,0.0023141515,0.002988025,0.001167058,0.0021881931,0.007815985],"category_scores_gemma":[0.005422832,0.00048078803,0.0010027532,0.0018167262,0.0032789956,0.013825512,0.0035075226,0.004769248,0.0009806145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066425923,0.000005531088,0.000071285314,0.000020443345,0.0000031166062,0.000027576796,0.00012238525,0.000043915723,0.00021140851,0.9918418,0.0012520129,0.0063938457],"study_design_scores_gemma":[0.000005049578,0.00000793341,0.00011490134,0.000011519071,0.000005442158,0.00014090928,0.00004465266,0.00045179404,0.00020293995,0.99043614,0.008570283,0.000008513011],"about_ca_topic_score_codex":0.0006775325,"about_ca_topic_score_gemma":0.00067341764,"teacher_disagreement_score":0.007815985,"about_ca_system_score_codex":0.00080885744,"about_ca_system_score_gemma":0.0005420535,"threshold_uncertainty_score":0.026147068},"labels":[],"label_agreement":null},{"id":"W1999694424","doi":"10.1016/j.jcta.2010.11.014","title":"Asymptotic enumeration and limit laws for graphs of fixed genus","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Enumeration; Genus; Planar graph; Planar; Exponential function; Graph; Limit (mathematics); Exponential growth; Discrete mathematics; Surface (topology); Random graph; Limit of a function; Mathematical analysis; Geometry; Computer science","score_opus":0.017847354399316555,"score_gpt":0.28617199868673954,"score_spread":0.268324644287423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999694424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77102655,0.0015881832,0.18713792,0.0044966307,0.00015022175,0.00007654648,0.00044093103,0.00064286124,0.034440108],"genre_scores_gemma":[0.96793735,0.0012075618,0.020656038,0.00054378307,0.00044291795,0.0001807948,0.000673804,0.000401923,0.007955696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987841,0.0004215883,0.00005540429,0.0002071331,0.00030950372,0.00022234264],"domain_scores_gemma":[0.9805351,0.01373782,0.0015937972,0.0013933866,0.0014074021,0.0013324551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033228605,0.0008466383,0.001892323,0.005957428,0.0027027812,0.005447688,0.0036858036,0.002675421,0.005763382],"category_scores_gemma":[0.031301536,0.001087649,0.0015993499,0.0026915504,0.0064286566,0.009609157,0.003147692,0.003953311,0.00045433475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028897228,0.000042138352,0.00092356163,0.000047472673,0.0000113278375,0.00007534258,0.0003140936,0.005191996,0.00057271385,0.98893076,0.0012710944,0.0025906547],"study_design_scores_gemma":[0.00001127819,0.0000073169217,0.0005157099,0.000022865868,0.00000835437,0.00010517408,0.000084839376,0.04555707,0.00018139085,0.95303017,0.00046199645,0.000013856318],"about_ca_topic_score_codex":0.001993682,"about_ca_topic_score_gemma":0.00220651,"teacher_disagreement_score":0.005957428,"about_ca_system_score_codex":0.002718329,"about_ca_system_score_gemma":0.0011415036,"threshold_uncertainty_score":0.019722939},"labels":[],"label_agreement":null},{"id":"W2001092675","doi":"10.1016/j.jcta.2007.04.005","title":"On generalized separating hash families","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Hash function; Double hashing; Mathematics; Hash chain; SHA-2; Collision resistance; Computer science; Theoretical computer science; Hash table; Computer security","score_opus":0.005995814983847147,"score_gpt":0.21914593369610458,"score_spread":0.21315011871225742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001092675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5775653,0.0012872065,0.27549687,0.00399569,0.00048267114,0.00015988978,0.0006472283,0.0005989652,0.13976619],"genre_scores_gemma":[0.9314954,0.0009631441,0.024797495,0.00077479385,0.0004475445,0.00011795457,0.000514889,0.0002960184,0.04059287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.00041851998,0.000056814017,0.00027614273,0.0003296088,0.00030761852],"domain_scores_gemma":[0.9939464,0.0033366198,0.00048737612,0.0010366524,0.0005023031,0.00069072144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376566,0.0010856283,0.0016427477,0.0020339603,0.0036604237,0.00353064,0.0016862924,0.0020497474,0.016223764],"category_scores_gemma":[0.008273549,0.0011383665,0.0011831023,0.002811829,0.0041130846,0.0096600335,0.0060871877,0.0043093264,0.0015360109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008235095,0.000021704149,0.00021697766,0.000025556063,0.0000074809013,0.000056384077,0.0002726479,0.0018925471,0.00044033682,0.9899727,0.0015901433,0.0054211887],"study_design_scores_gemma":[0.000016980595,0.000012085659,0.00011975364,0.000015736687,0.000009998841,0.00007733173,0.00010612073,0.009783623,0.000317666,0.9874878,0.0020391878,0.000013725102],"about_ca_topic_score_codex":0.0012596216,"about_ca_topic_score_gemma":0.0011522098,"teacher_disagreement_score":0.016223764,"about_ca_system_score_codex":0.002147168,"about_ca_system_score_gemma":0.00080777414,"threshold_uncertainty_score":0.054273903},"labels":[],"label_agreement":null},{"id":"W2001303594","doi":"10.1016/j.jcta.2008.01.012","title":"The 2-adic valuation of a sequence arising from a rational integral","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Benford’s Law and Fraud Detection","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Science Foundation","keywords":"Valuation (finance); Sequence (biology); Quartic function; Mathematics; Integer sequence; Discrete mathematics; Pure mathematics; Economics; Chemistry; Finance","score_opus":0.07428530349154007,"score_gpt":0.299901273683655,"score_spread":0.22561597019211493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001303594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8041639,0.00082047854,0.09484634,0.0022797352,0.00051445694,0.00004538194,0.00019906109,0.00019874734,0.09693191],"genre_scores_gemma":[0.9760415,0.00039124434,0.009878335,0.00017313479,0.000322347,0.000023673962,0.0001189238,0.000066500594,0.012984268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988477,0.00023887616,0.000066409535,0.00021929793,0.000371758,0.00025592622],"domain_scores_gemma":[0.997825,0.0010978162,0.0002812392,0.00019553347,0.00024611666,0.00035435273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014539853,0.0010671548,0.0011463686,0.004062259,0.0025298644,0.0059719766,0.0012877316,0.0023091743,0.0060894843],"category_scores_gemma":[0.0061763427,0.0005938182,0.0008130837,0.002689034,0.0053452053,0.008302714,0.0026457706,0.0028322926,0.00086118164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071525144,0.000026840762,0.000479475,0.000021039144,0.0000075107146,0.00038607392,0.00033689803,0.00063450733,0.0014439895,0.99167705,0.0005041237,0.004411031],"study_design_scores_gemma":[0.00001888124,0.000027118389,0.00035458888,0.000018566152,0.00000967101,0.0007998072,0.00010601737,0.00403685,0.0009324166,0.9907301,0.0029447095,0.00002119648],"about_ca_topic_score_codex":0.00044667057,"about_ca_topic_score_gemma":0.00020121317,"teacher_disagreement_score":0.0060894843,"about_ca_system_score_codex":0.0017208454,"about_ca_system_score_gemma":0.0007004748,"threshold_uncertainty_score":0.020371318},"labels":[],"label_agreement":null},{"id":"W2001779588","doi":"10.1006/jcta.1999.3036","title":"Some New Bounds for Cover-Free Families","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cover (algebra); Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Engineering; Mathematical analysis","score_opus":0.015494861498290434,"score_gpt":0.26975640607044293,"score_spread":0.2542615445721525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001779588","genre_codex":"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.15815997,0.021447914,0.4793305,0.019680502,0.0022251864,0.00027350144,0.0022312396,0.0015015397,0.3151497],"genre_scores_gemma":[0.76997054,0.017916389,0.13581844,0.005734641,0.008688059,0.0012460573,0.0026775233,0.0017184769,0.05622983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994601,0.0012961635,0.0003093819,0.0010322834,0.0018705006,0.00089070667],"domain_scores_gemma":[0.9557791,0.035368055,0.0014340909,0.0021541717,0.0021860362,0.0030785657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096195955,0.003273104,0.004046259,0.013693432,0.005410263,0.009967399,0.0069536013,0.0045122104,0.023510888],"category_scores_gemma":[0.040683478,0.0024546469,0.003919853,0.011357533,0.007494284,0.03566505,0.010780834,0.015896795,0.002621583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012263792,0.0001316716,0.0007945025,0.0002533524,0.00005088044,0.000146319,0.0008471211,0.0033633832,0.0007502225,0.96737546,0.008318814,0.017845597],"study_design_scores_gemma":[0.000018079954,0.000028626797,0.0005381005,0.00010174781,0.00007451046,0.00015328864,0.00015480784,0.013362502,0.00039113362,0.978115,0.0070191333,0.00004291776],"about_ca_topic_score_codex":0.001836769,"about_ca_topic_score_gemma":0.0023897942,"teacher_disagreement_score":0.023510888,"about_ca_system_score_codex":0.006625045,"about_ca_system_score_gemma":0.0011451315,"threshold_uncertainty_score":0.078651786},"labels":[],"label_agreement":null},{"id":"W2001861700","doi":"10.1016/j.jcta.2012.05.004","title":"Character-theoretic techniques for near-central enumerative problems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Centralizer and normalizer; Factorization; Mathematics; Combinatorics; Enumeration; Genus; Symmetric group; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.024414076731989923,"score_gpt":0.30196833595456946,"score_spread":0.27755425922257954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001861700","genre_codex":"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.13062197,0.0016015776,0.7553225,0.005179448,0.0006635794,0.000180507,0.00041426695,0.0007165735,0.105299614],"genre_scores_gemma":[0.7765605,0.0017704873,0.17380866,0.0012311279,0.0016679993,0.00042982964,0.001071941,0.00059921894,0.042860273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970926,0.0011684198,0.00018183277,0.00048465948,0.0006692193,0.00040326497],"domain_scores_gemma":[0.98979867,0.006610258,0.00050527975,0.0013882705,0.000950725,0.00074692717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040184646,0.001635065,0.0019911001,0.0066732387,0.004777344,0.005951075,0.0050917175,0.0024499716,0.011040367],"category_scores_gemma":[0.019025965,0.0011533304,0.0026642112,0.0061122864,0.0057502543,0.017202456,0.009659669,0.012039835,0.001496003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004073281,0.00007272809,0.00036154257,0.00006642943,0.000014871399,0.00007340764,0.000415483,0.0018928577,0.00043226988,0.98578274,0.0018389815,0.009007904],"study_design_scores_gemma":[0.000010829096,0.000014236479,0.00013124186,0.000022047241,0.000019917146,0.00006586981,0.00012933301,0.01168548,0.00029940312,0.9852078,0.002399917,0.000013920199],"about_ca_topic_score_codex":0.0008249847,"about_ca_topic_score_gemma":0.0011557869,"teacher_disagreement_score":0.011040367,"about_ca_system_score_codex":0.0026698096,"about_ca_system_score_gemma":0.0011937397,"threshold_uncertainty_score":0.03693366},"labels":[],"label_agreement":null},{"id":"W2003130149","doi":"10.1016/j.jcta.2004.10.006","title":"On a conjecture of Brown concerning accessible sets","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Pure mathematics","score_opus":0.023209250469334558,"score_gpt":0.3031206753338589,"score_spread":0.27991142486452436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003130149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33680585,0.0050394554,0.15740977,0.18528375,0.005044502,0.00010933904,0.0013850147,0.0010871405,0.30783513],"genre_scores_gemma":[0.94597656,0.0016446649,0.015092005,0.007045118,0.0039209165,0.00015263696,0.0007391445,0.00028354416,0.025145454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997018,0.0010030093,0.00015478914,0.0007859084,0.0006014209,0.00043703633],"domain_scores_gemma":[0.9697269,0.022873769,0.00090938725,0.0032063425,0.0020097555,0.0012738128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005026513,0.00074825046,0.002684235,0.0025075842,0.005752949,0.005655925,0.003159923,0.006671061,0.0152646685],"category_scores_gemma":[0.028548053,0.0010604459,0.0020090644,0.003804964,0.015715085,0.03096648,0.007925968,0.010044504,0.0016775979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053935964,0.000023737859,0.0001650365,0.000033379118,0.0000042860966,0.000046556277,0.00035047552,0.00030321904,0.0001059678,0.9921423,0.0050626034,0.0017083974],"study_design_scores_gemma":[0.000014654232,0.000005819896,0.000070117676,0.00001422895,0.000004973077,0.00003173396,0.00007173579,0.00060602307,0.000072240044,0.99693274,0.0021680696,0.000007547187],"about_ca_topic_score_codex":0.0018813726,"about_ca_topic_score_gemma":0.0010738366,"teacher_disagreement_score":0.0152646685,"about_ca_system_score_codex":0.0026361484,"about_ca_system_score_gemma":0.00121407,"threshold_uncertainty_score":0.051065385},"labels":[],"label_agreement":null},{"id":"W2003267114","doi":"10.1006/jcta.2000.3164","title":"Strongly Regular (α, β)-Geometries","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Strongly regular graph; Graph; Point (geometry); Class (philosophy); Geometry; Pure mathematics; Combinatorics; Computer science; Line graph; Artificial intelligence","score_opus":0.04099810295209044,"score_gpt":0.3186384195708372,"score_spread":0.2776403166187468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003267114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232103,0.0008361118,0.09120583,0.003041459,0.00038095,0.00005328255,0.00059604016,0.00041286237,0.18026318],"genre_scores_gemma":[0.968311,0.0003184503,0.0150552215,0.0002717156,0.00016976534,0.000027748072,0.0002996909,0.00006365944,0.0154826185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992029,0.00023884354,0.000055545363,0.00023048419,0.0001497264,0.0001225259],"domain_scores_gemma":[0.9982291,0.00061779114,0.0002870654,0.00029105064,0.00025847286,0.00031665282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080006453,0.0008089449,0.00071429415,0.0011921836,0.0017500804,0.003379751,0.00061846845,0.0009186464,0.0053561074],"category_scores_gemma":[0.0019298309,0.00064057915,0.0004872869,0.00097653735,0.0031771753,0.0043105436,0.002009709,0.0021608009,0.0007164832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004169726,0.000006903759,0.00027523213,0.000012703795,0.000005780808,0.000067116416,0.00015334015,0.00021930448,0.0008611719,0.99641055,0.00055679044,0.0013894257],"study_design_scores_gemma":[0.000020606329,0.000022170152,0.00036004884,0.0000066512107,0.000010716676,0.00029899724,0.00016198937,0.0009329325,0.00071341835,0.99405813,0.0034048124,0.000009552301],"about_ca_topic_score_codex":0.00043977253,"about_ca_topic_score_gemma":0.0005327752,"teacher_disagreement_score":0.0053561074,"about_ca_system_score_codex":0.00081479124,"about_ca_system_score_gemma":0.00028976938,"threshold_uncertainty_score":0.017917931},"labels":[],"label_agreement":null},{"id":"W2003770393","doi":"10.1016/s0097-3165(02)00018-3","title":"Some new triplewhist tournaments TWh(v)","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Tournament; Mathematics; Product (mathematics); Frame (networking); Combinatorics; Physics; Geometry; Engineering; Mechanical engineering","score_opus":0.006672644512148106,"score_gpt":0.19728052111862196,"score_spread":0.19060787660647385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003770393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8474186,0.00040563804,0.06990958,0.0006819398,0.000482309,0.0001606266,0.0005915085,0.00025051326,0.080099255],"genre_scores_gemma":[0.9529918,0.00015033325,0.021600597,0.0002540172,0.00009399166,0.00009706207,0.000612441,0.000083333325,0.024116457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953794,0.00007684741,0.00002417885,0.00010758076,0.000083846484,0.00016956269],"domain_scores_gemma":[0.99899906,0.00027851807,0.00010075228,0.00009040605,0.0001288844,0.00040247003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041454486,0.00039461793,0.00059226045,0.00085136073,0.002797405,0.0032205167,0.0010694248,0.0011379388,0.009512363],"category_scores_gemma":[0.0015151737,0.0003789136,0.00077639025,0.0013351485,0.00074073323,0.0011993347,0.00092535495,0.0015274029,0.00047054267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005507934,0.00023674287,0.0038969258,0.00017436725,0.0001370649,0.0012409675,0.00086286943,0.009906886,0.013836821,0.9093265,0.016612928,0.04321715],"study_design_scores_gemma":[0.00027947171,0.0003419558,0.00517776,0.000051549574,0.00012651423,0.0016060187,0.00097460556,0.09571569,0.0063028387,0.8558955,0.033434838,0.00009324119],"about_ca_topic_score_codex":0.0013497511,"about_ca_topic_score_gemma":0.0028250713,"teacher_disagreement_score":0.009512363,"about_ca_system_score_codex":0.00080510875,"about_ca_system_score_gemma":0.0005373775,"threshold_uncertainty_score":0.031822026},"labels":[],"label_agreement":null},{"id":"W2005295899","doi":"10.1006/jcta.2000.3060","title":"Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Affine transformation; Mathematics; Hadamard transform; Combinatorics; Upper and lower bounds; Prime power; Order (exchange); Combinatorial design; Hadamard matrix; Discrete mathematics; Prime (order theory); Pure mathematics; Mathematical analysis","score_opus":0.007386910017196912,"score_gpt":0.20423052351866688,"score_spread":0.19684361350146998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005295899","genre_codex":"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.42218602,0.007833664,0.44859433,0.010116207,0.0008952556,0.00044079366,0.0037641092,0.0019535185,0.104216024],"genre_scores_gemma":[0.84572387,0.003383929,0.12140477,0.0012350454,0.0016730843,0.00070855825,0.0021607755,0.00042641442,0.02328353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887045,0.0034705927,0.0007437145,0.0019714688,0.0034610373,0.0016486626],"domain_scores_gemma":[0.90496284,0.06919179,0.0059844335,0.01123902,0.005014541,0.003607415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008513971,0.0023006366,0.0025881466,0.003288533,0.0029416909,0.007945414,0.0047902022,0.0035367853,0.014835809],"category_scores_gemma":[0.054886185,0.001939183,0.0021039916,0.0034934643,0.005075212,0.011021261,0.0034911362,0.0042229164,0.0022804292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028432717,0.00042548752,0.005559407,0.00083588605,0.0002834712,0.0003924424,0.00046823232,0.100174144,0.019580696,0.77886605,0.014104953,0.07646595],"study_design_scores_gemma":[0.00030185867,0.0004631857,0.0017878053,0.00017065003,0.00020297396,0.0010451269,0.00015824054,0.1838071,0.0118264295,0.79178673,0.008296436,0.00015343988],"about_ca_topic_score_codex":0.0008028548,"about_ca_topic_score_gemma":0.0015885124,"teacher_disagreement_score":0.014835809,"about_ca_system_score_codex":0.004158204,"about_ca_system_score_gemma":0.003861949,"threshold_uncertainty_score":0.0496307},"labels":[],"label_agreement":null},{"id":"W2005621996","doi":"10.1016/j.jcta.2005.04.011","title":"Constructions of generalized Sidon sets","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Interleaving; Set (abstract data type); Integer (computer science); Property (philosophy); Mathematics; Yield (engineering); Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.005009242748111012,"score_gpt":0.23367982182243097,"score_spread":0.22867057907431995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005621996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39631665,0.000903799,0.26144484,0.0015484432,0.0011324607,0.00018054747,0.00044493043,0.0007243858,0.33730385],"genre_scores_gemma":[0.8438379,0.0005203642,0.09389697,0.00061178376,0.0001736612,0.0002551849,0.0006511671,0.0003475217,0.05970544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993476,0.00014939219,0.000049973827,0.000110198926,0.00020207521,0.0001408266],"domain_scores_gemma":[0.9994166,0.0001662085,0.000050518385,0.0001211895,0.00011003377,0.00013540723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073301134,0.0009265437,0.0009938466,0.0028316476,0.0034063854,0.0033493745,0.0012898048,0.00095280656,0.008830987],"category_scores_gemma":[0.001410748,0.0006593497,0.0014258858,0.0015427639,0.0023344373,0.002265279,0.0038545064,0.0024816473,0.0010566944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015990097,0.000009191092,0.00009614447,0.000013064895,0.0000037361756,0.000050321,0.000120646015,0.0002995701,0.0005276357,0.99551165,0.0005227713,0.002829424],"study_design_scores_gemma":[0.00001763074,0.000016572914,0.00019421773,0.000027466815,0.000012339185,0.00015658101,0.00018658028,0.0035368802,0.0012154856,0.984153,0.010467484,0.000015829963],"about_ca_topic_score_codex":0.0006840354,"about_ca_topic_score_gemma":0.0014051729,"teacher_disagreement_score":0.008830987,"about_ca_system_score_codex":0.0018051192,"about_ca_system_score_gemma":0.0005885633,"threshold_uncertainty_score":0.029542625},"labels":[],"label_agreement":null},{"id":"W2006143633","doi":"10.1006/jcta.2001.3189","title":"A Theory of Ternary Complementary Pairs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Binary Golay code; Complementary sequences; Autocorrelation; Ternary operation; Zero (linguistics); Mathematics; Combinatorics; Binary number; Discrete mathematics; Algorithm; Arithmetic; Computer science; Statistics","score_opus":0.009776670719507887,"score_gpt":0.20789294868449082,"score_spread":0.19811627796498293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006143633","genre_codex":"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.056228433,0.006014965,0.5127748,0.0047701667,0.0016349263,0.00012340175,0.00065041735,0.0004022014,0.41740072],"genre_scores_gemma":[0.76316214,0.005032128,0.15071745,0.0029994468,0.0023010229,0.0004732976,0.00076072343,0.00025089737,0.07430288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873966,0.0003854332,0.00006908757,0.00023919065,0.00037212324,0.00019444281],"domain_scores_gemma":[0.9973302,0.0015934324,0.00016574781,0.0002465157,0.00046716732,0.00019700242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012348819,0.0008387135,0.0010616771,0.0037894843,0.004206528,0.0056678895,0.0014039597,0.0023280238,0.01650871],"category_scores_gemma":[0.0040885084,0.0009128951,0.0013237465,0.0033451302,0.0046165567,0.008153194,0.0031606785,0.0031451718,0.0022079612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002282666,0.0000019120685,0.000009481052,0.0000066219473,0.0000010271478,0.000009326792,0.000030071384,0.00009430935,0.0000405727,0.9982823,0.00048816475,0.0010340539],"study_design_scores_gemma":[0.0000050107515,0.0000036351787,0.000013461859,0.000012062025,0.000003847901,0.000052975058,0.00003098994,0.0013186574,0.00010119839,0.99243426,0.0060189236,0.000005003617],"about_ca_topic_score_codex":0.0010399182,"about_ca_topic_score_gemma":0.0009054875,"teacher_disagreement_score":0.01650871,"about_ca_system_score_codex":0.002221178,"about_ca_system_score_gemma":0.0012332146,"threshold_uncertainty_score":0.0552271},"labels":[],"label_agreement":null},{"id":"W2009560547","doi":"10.1016/j.jcta.2005.05.004","title":"The stationary measure of a 2-type totally asymmetric exclusion process","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Asymmetric simple exclusion process; Measure (data warehouse); Mathematics; Class (philosophy); Process (computing); Type (biology); Statistical physics; Space (punctuation); Simple (philosophy); Pure mathematics; Combinatorics; Computer science; Physics; Statistics; Artificial intelligence; Data mining","score_opus":0.019942808961524016,"score_gpt":0.3038591216700842,"score_spread":0.2839163127085602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009560547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7975141,0.0005272113,0.16970497,0.0016209543,0.00034235485,0.0000931114,0.00039835402,0.00027623458,0.029522683],"genre_scores_gemma":[0.9815462,0.0002619194,0.007166739,0.00020239408,0.00032808594,0.00007605428,0.00021807641,0.00007093631,0.010129597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990458,0.00026362092,0.00005318739,0.00016684641,0.00022981522,0.00024059427],"domain_scores_gemma":[0.99604356,0.0016663463,0.0007043576,0.00024558423,0.00045340156,0.00088669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021530483,0.0008810578,0.0015771631,0.0024349855,0.0016268487,0.004122729,0.0021799712,0.0026498656,0.0057327957],"category_scores_gemma":[0.0046195774,0.0006093854,0.00095432653,0.0013139753,0.0037849683,0.0039519747,0.0014780781,0.0016431496,0.00062282116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010946076,0.00005337948,0.0005071614,0.000032307576,0.000019663,0.00024305134,0.00012435178,0.0069254143,0.0033748152,0.9862586,0.0007720761,0.0015797059],"study_design_scores_gemma":[0.00007177328,0.00006615873,0.00092405564,0.000018336295,0.000017165139,0.0003928609,0.00009487716,0.1727588,0.0010635481,0.82355213,0.0009708114,0.00006949515],"about_ca_topic_score_codex":0.0011267402,"about_ca_topic_score_gemma":0.0006985921,"teacher_disagreement_score":0.0057327957,"about_ca_system_score_codex":0.0016184394,"about_ca_system_score_gemma":0.0013355426,"threshold_uncertainty_score":0.019178152},"labels":[],"label_agreement":null},{"id":"W2010902762","doi":"10.1016/s0097-3165(02)00015-8","title":"Doubly regular digraphs and symmetric designs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Digraph; Adjacency matrix; Combinatorics; Mathematics; Versa; Incidence matrix; Matrix (chemical analysis); Carry (investment); Skew; Construct (python library); Adjacency list; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.008512606908426673,"score_gpt":0.19182302294834708,"score_spread":0.1833104160399204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010902762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53523725,0.0011285326,0.32651404,0.0025091707,0.00048991403,0.00015165911,0.00084567367,0.0003826552,0.13274112],"genre_scores_gemma":[0.94231397,0.0007207748,0.030178899,0.00046040062,0.00023031198,0.00010116032,0.00032943208,0.000054467444,0.025610734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953413,0.00014674105,0.000027256245,0.00011178631,0.00010182239,0.00007816313],"domain_scores_gemma":[0.9976059,0.0011491623,0.00039969015,0.00035320717,0.0002616437,0.00023040525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005250386,0.00045006498,0.0005929365,0.0013639617,0.0013867526,0.0022416261,0.00064671214,0.0010766247,0.006265124],"category_scores_gemma":[0.0032981874,0.0005810454,0.00048871705,0.0011228716,0.0013315977,0.0022594861,0.0008848386,0.0011795138,0.0006559801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025841768,0.000018142708,0.00016630188,0.00001888487,0.000004660099,0.00006737902,0.000074054886,0.0012231154,0.00053577387,0.9924225,0.00091847853,0.004524772],"study_design_scores_gemma":[0.000015208398,0.00001154994,0.00010078192,0.000009244014,0.000008217595,0.000129175,0.00004659191,0.006060492,0.000313528,0.9905572,0.002740479,0.0000074794375],"about_ca_topic_score_codex":0.000592294,"about_ca_topic_score_gemma":0.0010590103,"teacher_disagreement_score":0.006265124,"about_ca_system_score_codex":0.00086221704,"about_ca_system_score_gemma":0.0006364984,"threshold_uncertainty_score":0.02095896},"labels":[],"label_agreement":null},{"id":"W2010930039","doi":"10.1016/j.jcta.2012.04.005","title":"Generalised quadrangles with a group of automorphisms acting primitively on points and lines","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Transitive relation; Automorphism; Quadrangle; Mathematics; Combinatorics; Type (biology); Group (periodic table); Simple (philosophy); Flag (linear algebra); Automorphisms of the symmetric and alternating groups; Outer automorphism group; Pure mathematics; Automorphism group; Algebra over a field; Physics; Geography; Geology; Paleontology","score_opus":0.04801010565271538,"score_gpt":0.3074660429841423,"score_spread":0.2594559373314269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010930039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7906802,0.00038836326,0.13003132,0.0008534688,0.00070530706,0.00017173991,0.00026772913,0.0004124843,0.07648939],"genre_scores_gemma":[0.9440392,0.00023933519,0.021428257,0.00021471633,0.00019263115,0.00007044787,0.0002236281,0.0001438623,0.033447817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890494,0.00030191624,0.000070939495,0.00023217016,0.00027250894,0.00021755793],"domain_scores_gemma":[0.99874496,0.00026541506,0.00030538195,0.00033565308,0.00011577612,0.0002328849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049927155,0.00090280746,0.0010299211,0.001302287,0.0015391081,0.0026897695,0.0011736758,0.0012740787,0.007939853],"category_scores_gemma":[0.0017098889,0.0006363013,0.0011153442,0.0013890358,0.0045195245,0.0026824868,0.0030562778,0.0026722003,0.0013891443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027721416,0.000059217546,0.000546526,0.000047090212,0.00002421515,0.00079494383,0.0006366608,0.0032758492,0.006341155,0.9755265,0.00078726653,0.011683385],"study_design_scores_gemma":[0.00014272681,0.00016892684,0.0010735022,0.00002467353,0.000029884715,0.00080593786,0.00047325494,0.0059431777,0.0025563545,0.9768033,0.011934026,0.00004428349],"about_ca_topic_score_codex":0.0013169603,"about_ca_topic_score_gemma":0.0017864719,"teacher_disagreement_score":0.007939853,"about_ca_system_score_codex":0.00068169937,"about_ca_system_score_gemma":0.00044838357,"threshold_uncertainty_score":0.026561439},"labels":[],"label_agreement":null},{"id":"W2011862520","doi":"10.1006/jcta.2000.3090","title":"Noncommutative Pieri Operators on Posets","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Hopf algebra; Mathematics; Representation theory of Hopf algebras; Noncommutative geometry; Symmetric function; Morphism; Algebra over a field; Eulerian path; Partially ordered set; Pure mathematics; Cellular algebra; Symmetric algebra; Quasitriangular Hopf algebra; Filtered algebra; Division algebra; Combinatorics; Algebra representation; Lagrangian","score_opus":0.019100193308127778,"score_gpt":0.30764671394888776,"score_spread":0.28854652064076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011862520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60179156,0.001485936,0.14134353,0.003992519,0.0016738253,0.00013133883,0.00044374503,0.00047076878,0.24866681],"genre_scores_gemma":[0.9173585,0.0009634462,0.01594259,0.000688889,0.0012303798,0.0001342897,0.00030038142,0.00024390698,0.06313751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978915,0.00042301012,0.00013832764,0.0003754937,0.00067959767,0.0004920842],"domain_scores_gemma":[0.9975369,0.0008935651,0.00038481044,0.00027348244,0.00024220627,0.00066901644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020563987,0.0018603057,0.001503963,0.005200507,0.004981901,0.00849164,0.0016207263,0.0019613795,0.013850629],"category_scores_gemma":[0.003187384,0.0017352023,0.0017196195,0.0047304635,0.006824769,0.016500102,0.006639386,0.00580245,0.0016560331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014836834,0.000019717456,0.000071413226,0.000010260008,0.0000034138423,0.00011476498,0.00031100112,0.00012142968,0.00042253357,0.99765307,0.00031062023,0.0009468311],"study_design_scores_gemma":[0.000012410713,0.000018244204,0.00016209616,0.0000069489506,0.0000068940253,0.00025838154,0.00023398167,0.0007560758,0.00048530306,0.9958211,0.0022214886,0.00001694022],"about_ca_topic_score_codex":0.0004029198,"about_ca_topic_score_gemma":0.00064228073,"teacher_disagreement_score":0.013850629,"about_ca_system_score_codex":0.0019131711,"about_ca_system_score_gemma":0.00087137514,"threshold_uncertainty_score":0.046334982},"labels":[],"label_agreement":null},{"id":"W2011867530","doi":"10.1016/j.jcta.2013.01.014","title":"A multivariate hook formula for labelled trees","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Mathematical proof; Enumeration; Hook; Combinatorics; Vertex (graph theory); Binary tree; Combinatorial proof; Binary number; Discrete mathematics; Graph; Arithmetic","score_opus":0.025869195108072462,"score_gpt":0.305206108392345,"score_spread":0.27933691328427257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011867530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45025218,0.0016536339,0.34993997,0.0039508874,0.0010445921,0.000081906845,0.0006939418,0.0010382062,0.19134456],"genre_scores_gemma":[0.93459094,0.0006893137,0.027727379,0.0008415658,0.00078875275,0.000065440305,0.00042993922,0.00037861432,0.034488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994436,0.000113072616,0.000032969023,0.00011287524,0.0001904353,0.000107090236],"domain_scores_gemma":[0.9987556,0.00051062467,0.00017477256,0.00017420412,0.0001637483,0.00022105231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000921863,0.0006503667,0.0011166965,0.0027316774,0.0019152144,0.0033955635,0.0015416853,0.0019903062,0.010505154],"category_scores_gemma":[0.0034231418,0.0006062802,0.0009926561,0.0024321608,0.0024596024,0.0070516653,0.0026846514,0.0035563698,0.001412651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021019257,0.000021191106,0.00035624296,0.000029703257,0.000006050758,0.00010590027,0.00017605118,0.00040979622,0.00074516475,0.9912396,0.0013983616,0.005490944],"study_design_scores_gemma":[0.000009735333,0.000009047197,0.00043266916,0.000016232389,0.00001248294,0.000114428214,0.00005714646,0.004964208,0.00022001028,0.99169827,0.0024485483,0.000017133902],"about_ca_topic_score_codex":0.0011787113,"about_ca_topic_score_gemma":0.0016293747,"teacher_disagreement_score":0.010505154,"about_ca_system_score_codex":0.0016759544,"about_ca_system_score_gemma":0.00050415355,"threshold_uncertainty_score":0.035143197},"labels":[],"label_agreement":null},{"id":"W2012291069","doi":"10.1006/jcta.2000.3089","title":"Multiple Left Regular Representations Generated by Alternants","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Coxeter group; Diagonal; Span (engineering); Lattice (music); Geometry; Physics","score_opus":0.018343020946209466,"score_gpt":0.2933913306558475,"score_spread":0.275048309709638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012291069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74922365,0.00034379488,0.07613135,0.001774807,0.0009488485,0.00008088632,0.00029934404,0.0009896365,0.1702076],"genre_scores_gemma":[0.95215786,0.00017698016,0.012744632,0.00047993407,0.00046997445,0.000048078724,0.00018784471,0.0004128603,0.033321876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991999,0.00013217238,0.000042345997,0.00015184104,0.00023343711,0.00024021271],"domain_scores_gemma":[0.99912506,0.00024908315,0.0001571354,0.00016126235,0.00011150891,0.00019601785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005162654,0.0008975536,0.00097390095,0.0019841373,0.0018033346,0.0039849565,0.0011577229,0.0016274063,0.020713767],"category_scores_gemma":[0.0013961783,0.0005120336,0.000894952,0.0012897293,0.00202397,0.004219503,0.0024732794,0.0026225233,0.0027388597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015998993,0.000092197304,0.0002767448,0.000028409617,0.000013247025,0.00068370934,0.0003222495,0.00036400324,0.008048589,0.9758756,0.0018222784,0.012312974],"study_design_scores_gemma":[0.000061365885,0.00006761948,0.00046755772,0.000021110503,0.000031553493,0.0012805616,0.00023332158,0.0071805874,0.005405209,0.97846633,0.0067444565,0.000040286202],"about_ca_topic_score_codex":0.00022449341,"about_ca_topic_score_gemma":0.0003640965,"teacher_disagreement_score":0.020713767,"about_ca_system_score_codex":0.00082659663,"about_ca_system_score_gemma":0.0002807881,"threshold_uncertainty_score":0.06929451},"labels":[],"label_agreement":null},{"id":"W2012333844","doi":"10.1016/j.jcta.2014.10.009","title":"Dyck path triangulations and extendability","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"York University; Government of Canada","keywords":"Matroid; Triangulation; Mathematics; Combinatorics; Cartesian product; Path (computing); Product (mathematics); Oriented matroid; Discrete mathematics; Graphic matroid; Geometry; Computer science","score_opus":0.01809792919344944,"score_gpt":0.29258203959829643,"score_spread":0.274484110404847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012333844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59748024,0.0019741992,0.11421382,0.00237152,0.00045944666,0.00008173324,0.00076099567,0.00022448163,0.28243357],"genre_scores_gemma":[0.92919964,0.0015535176,0.02207424,0.00032371943,0.00021408459,0.00007309218,0.0005758155,0.00013755773,0.045848325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995358,0.0000842912,0.000025671077,0.00011911282,0.00012773067,0.00010741415],"domain_scores_gemma":[0.9986187,0.0005994452,0.00018977307,0.00019897455,0.00015457218,0.00023855983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004431585,0.0005313141,0.000862047,0.0024342614,0.0018896124,0.0024413248,0.0011852606,0.0011078243,0.015321022],"category_scores_gemma":[0.0026287832,0.00060631084,0.00073673244,0.001980171,0.0033177258,0.0058979816,0.004783816,0.004449913,0.00093912525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002034068,0.000009921011,0.000219091,0.000018088958,0.0000034401876,0.00007166942,0.00021734457,0.0006323682,0.0002609822,0.99446046,0.0005767465,0.003509472],"study_design_scores_gemma":[0.000010022966,0.000007765043,0.00031940607,0.00001467723,0.000006151025,0.00012300537,0.00026417588,0.0012825648,0.000141942,0.9935608,0.0042623556,0.000007027124],"about_ca_topic_score_codex":0.0016386353,"about_ca_topic_score_gemma":0.0017823686,"teacher_disagreement_score":0.015321022,"about_ca_system_score_codex":0.0009418372,"about_ca_system_score_gemma":0.00031347535,"threshold_uncertainty_score":0.051253915},"labels":[],"label_agreement":null},{"id":"W2012585113","doi":"10.1016/j.jcta.2007.10.001","title":"A multi-dimensional approach to the construction and enumeration of Golay complementary sequences","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Mathematics; Complementary sequences; Enumeration; Sequence (biology); Ternary Golay code; Construct (python library); Combinatorics; Algorithm; Computer science; Decoding methods; Biology; Genetics","score_opus":0.016699250436633516,"score_gpt":0.22630774308162727,"score_spread":0.20960849264499376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012585113","genre_codex":"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.010584035,0.0003967365,0.9720909,0.00026653922,0.00012262318,0.000043194883,0.00011651035,0.00014794791,0.016231602],"genre_scores_gemma":[0.13399936,0.0009211207,0.8535154,0.00027825742,0.0002167995,0.00020929787,0.00036697104,0.00015539791,0.010337365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988417,0.00048093408,0.00008195023,0.00012271768,0.00038565203,0.000087031476],"domain_scores_gemma":[0.9982419,0.0008581676,0.00008461745,0.00045752616,0.00028867373,0.000069097274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067883777,0.0005987832,0.0008463032,0.0024084067,0.0013090682,0.0026332552,0.0013662799,0.0008384802,0.0052366904],"category_scores_gemma":[0.0042535486,0.0006305006,0.0008591441,0.0023969393,0.0013887394,0.002057267,0.002352775,0.0021282204,0.0018096588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041798656,0.000041925134,0.00020690427,0.000081114864,0.000011796578,0.00008955149,0.00012646259,0.014862171,0.0053335363,0.8961849,0.0026298556,0.080390066],"study_design_scores_gemma":[0.000010325387,0.000040235864,0.00015804879,0.000057353605,0.00001163691,0.00030163175,0.00006431034,0.13600639,0.006049392,0.8402415,0.01701876,0.000040366],"about_ca_topic_score_codex":0.00042944666,"about_ca_topic_score_gemma":0.0008064739,"teacher_disagreement_score":0.0052366904,"about_ca_system_score_codex":0.0006991982,"about_ca_system_score_gemma":0.00075692317,"threshold_uncertainty_score":0.01751846},"labels":[],"label_agreement":null},{"id":"W2013425391","doi":"10.1016/j.jcta.2012.12.008","title":"On the number of pentagons in triangle-free graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":164,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.017312287981244973,"score_gpt":0.2730303166830055,"score_spread":0.2557180287017605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013425391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.826439,0.0021411665,0.062013354,0.0046933987,0.0006334684,0.00006670086,0.000649228,0.00032809368,0.103035666],"genre_scores_gemma":[0.97325224,0.0009641152,0.013752339,0.00039631597,0.00037967533,0.000099293524,0.00044927912,0.00014365255,0.01056316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982665,0.0004997781,0.00011260499,0.00033815939,0.00050540897,0.0002776447],"domain_scores_gemma":[0.976942,0.016046235,0.0022186672,0.0010638938,0.0011116109,0.0026175918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023687605,0.0007013849,0.0015618994,0.004023594,0.002903282,0.0057141236,0.0041941544,0.0024148019,0.012614319],"category_scores_gemma":[0.017328637,0.0011474179,0.0008980985,0.0028257915,0.005938004,0.009762311,0.0029153798,0.0031386514,0.0008151376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038197896,0.00009935806,0.0027385051,0.00018692068,0.00003353036,0.00018083278,0.00057722576,0.0086889025,0.0021413893,0.96896464,0.0033480898,0.012658673],"study_design_scores_gemma":[0.00003472792,0.000032565516,0.00079587405,0.00005959414,0.00002170494,0.00027656174,0.00029463353,0.018607775,0.00074674946,0.9775039,0.0016008724,0.000025213685],"about_ca_topic_score_codex":0.0012894474,"about_ca_topic_score_gemma":0.0016970162,"teacher_disagreement_score":0.012614319,"about_ca_system_score_codex":0.0017974227,"about_ca_system_score_gemma":0.0007655643,"threshold_uncertainty_score":0.042199075},"labels":[],"label_agreement":null},{"id":"W2013789449","doi":"10.1016/j.jcta.2014.11.005","title":"Half-turn symmetric alternating sign matrices and Tokuyama type factorisation for orthogonal group characters","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sign (mathematics); Factorization; Orthogonal group; Group (periodic table); Character (mathematics); Combinatorics; Type (biology); General linear group; Pure mathematics; Weyl group; Symmetric group; Geometry; Mathematical analysis; Physics","score_opus":0.01843054326254419,"score_gpt":0.2820732678088319,"score_spread":0.26364272454628773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013789449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.724897,0.00043782676,0.11873096,0.0014361838,0.0011317105,0.00011883439,0.00019734417,0.00051470066,0.15253533],"genre_scores_gemma":[0.946666,0.00027158757,0.01937221,0.0004530465,0.0004133845,0.00009018068,0.00015282193,0.0002824169,0.032298394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995285,0.00010490002,0.000024760076,0.00009142547,0.00010289785,0.00014747016],"domain_scores_gemma":[0.9994918,0.00012461386,0.00007572036,0.000097720935,0.00007476856,0.0001352601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051721156,0.0010905385,0.00072895014,0.0019629484,0.002164182,0.0028137325,0.0010185989,0.0018537042,0.011510661],"category_scores_gemma":[0.0016652769,0.00058482157,0.00097178813,0.0010499436,0.0031050472,0.0045112013,0.0018070715,0.00224544,0.0015219063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005319738,0.000022891913,0.00010547254,0.000012422435,0.0000032811122,0.00015509508,0.00020516294,0.00022292027,0.0023033302,0.9926674,0.0006800386,0.0035688593],"study_design_scores_gemma":[0.00002295933,0.000027049657,0.00015442865,0.000008123174,0.000006522648,0.0002623785,0.00016724429,0.0026558721,0.0014171345,0.99339527,0.0018593122,0.000023735172],"about_ca_topic_score_codex":0.00036789334,"about_ca_topic_score_gemma":0.0004354213,"teacher_disagreement_score":0.011510661,"about_ca_system_score_codex":0.0006374582,"about_ca_system_score_gemma":0.00059163535,"threshold_uncertainty_score":0.038507044},"labels":[],"label_agreement":null},{"id":"W2013850021","doi":"10.1016/j.jcta.2012.06.006","title":"Near-central permutation factorization and Strahovʼs generalized Murnaghan–Nakayama rule","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Factorization; Permutation (music); Centralizer and normalizer; Vertex (graph theory); Symmetric group; Graph; Algorithm; Physics","score_opus":0.03523002347532969,"score_gpt":0.3127356246100759,"score_spread":0.2775056011347462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013850021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51299226,0.0015809434,0.15879543,0.0030921828,0.0017326205,0.000092552735,0.00027915236,0.00043882648,0.32099602],"genre_scores_gemma":[0.94139814,0.00042933103,0.0203998,0.0005997038,0.0004616525,0.000044019882,0.000097983764,0.00013469583,0.036434546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940586,0.000106013664,0.000026986409,0.0001679042,0.00015042814,0.00014275947],"domain_scores_gemma":[0.9995154,0.00013835283,0.00004834981,0.00011257374,0.00009981673,0.000085451575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006491461,0.00047093662,0.0010109257,0.001133677,0.0028428084,0.0017425929,0.0010710179,0.0012406335,0.006683506],"category_scores_gemma":[0.0018373915,0.00038526888,0.00084077235,0.0008574332,0.003542071,0.0038674688,0.0019044725,0.0023232873,0.0014162079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031091986,0.000013013309,0.00008066739,0.000012108831,0.0000037079017,0.00010458827,0.00016636588,0.0002013828,0.0006949688,0.9933206,0.0008379128,0.004533633],"study_design_scores_gemma":[0.000009170058,0.000010267881,0.00011549517,0.000005037511,0.0000045550973,0.00013382515,0.00005471247,0.000938278,0.00037358355,0.9961836,0.0021589801,0.00001251634],"about_ca_topic_score_codex":0.0010493377,"about_ca_topic_score_gemma":0.0011364088,"teacher_disagreement_score":0.006683506,"about_ca_system_score_codex":0.00070385577,"about_ca_system_score_gemma":0.0008028578,"threshold_uncertainty_score":0.022358537},"labels":[],"label_agreement":null},{"id":"W2014086479","doi":"10.1016/j.jcta.2014.09.002","title":"Categorification and Heisenberg doubles arising from towers of algebras","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fock space; Mathematics; Categorification; Hopf algebra; Pure mathematics; Algebra over a field; Heisenberg group; Ring (chemistry); Representation theory; Generalization; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.01531627639064651,"score_gpt":0.2563569798345632,"score_spread":0.24104070344391668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014086479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8040118,0.0010945759,0.04322032,0.001430962,0.0005156189,0.00008304337,0.00022460468,0.00028292937,0.14913616],"genre_scores_gemma":[0.98149717,0.00028168687,0.005496269,0.00018172854,0.00020334219,0.00004188403,0.0001362632,0.000051660325,0.01211002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999183,0.00017942597,0.000054508077,0.0001304304,0.00022319981,0.00022931518],"domain_scores_gemma":[0.9986761,0.00046600087,0.0002086519,0.00016346786,0.00014676925,0.0003388858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011391194,0.0009542266,0.0011993787,0.0034461482,0.0034744644,0.005015526,0.0013923409,0.0019288494,0.008052506],"category_scores_gemma":[0.0022921993,0.0007535065,0.0011666102,0.0015125717,0.0053173606,0.0069999592,0.0033563457,0.0022748075,0.00062762725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020057272,0.000016373531,0.00020826263,0.00001371247,0.0000045082907,0.00015020477,0.00028177394,0.00028884527,0.0003864379,0.9974605,0.00030369152,0.0008655629],"study_design_scores_gemma":[0.000019382904,0.000011327143,0.0002400655,0.000011211364,0.0000058318533,0.00016867103,0.00022593206,0.0012808263,0.00022121778,0.9968701,0.0009323245,0.000013199347],"about_ca_topic_score_codex":0.0011291513,"about_ca_topic_score_gemma":0.0014293146,"teacher_disagreement_score":0.008052506,"about_ca_system_score_codex":0.0017739758,"about_ca_system_score_gemma":0.00062672823,"threshold_uncertainty_score":0.02693832},"labels":[],"label_agreement":null},{"id":"W2016962604","doi":"10.1016/j.jcta.2008.06.010","title":"Linear spaces with small generated subspaces","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear subspace; Mathematics; Computer science; Pure mathematics","score_opus":0.011310246464176856,"score_gpt":0.18218775532860096,"score_spread":0.1708775088644241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016962604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53778756,0.0017268473,0.29454267,0.0044376464,0.0006542258,0.00015135965,0.00093716296,0.0006884303,0.15907408],"genre_scores_gemma":[0.9361922,0.0007238966,0.016723437,0.00054183643,0.0007018789,0.000157289,0.00058596605,0.0001553959,0.044218197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987954,0.00050303177,0.000043130218,0.00018042396,0.0002882746,0.00018977857],"domain_scores_gemma":[0.99703586,0.0016380773,0.00029103702,0.00030131682,0.000303224,0.00043051838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007206893,0.0011823542,0.0009362913,0.002306727,0.0012975279,0.0031804014,0.0008822385,0.00092472165,0.011711981],"category_scores_gemma":[0.0029575767,0.0005839766,0.0007509574,0.0015840431,0.0026772995,0.003784735,0.003053276,0.003016928,0.001488038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006024404,0.000037590584,0.00013160115,0.000032283268,0.000013048819,0.00004788283,0.00013355148,0.0013483124,0.0011415614,0.9909243,0.0015003281,0.004629379],"study_design_scores_gemma":[0.000026107036,0.00003529736,0.00014976125,0.000009982945,0.000009291066,0.00013263723,0.00007569646,0.007673728,0.001101791,0.98773056,0.0030417768,0.000013378369],"about_ca_topic_score_codex":0.00029544206,"about_ca_topic_score_gemma":0.00033800377,"teacher_disagreement_score":0.011711981,"about_ca_system_score_codex":0.0007195203,"about_ca_system_score_gemma":0.00046663827,"threshold_uncertainty_score":0.039180517},"labels":[],"label_agreement":null},{"id":"W2017008783","doi":"10.1016/j.jcta.2010.05.006","title":"Symmetric bilinear forms over finite fields of even characteristic","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Bilinear form; Rank (graph theory); Combinatorics; Vector space; Finite field; Space (punctuation); Set (abstract data type); Bilinear interpolation; Distribution (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.006065735391801461,"score_gpt":0.2239817132919832,"score_spread":0.21791597790018172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017008783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77763516,0.0013967967,0.08988648,0.004876099,0.0010298636,0.00018413528,0.00082082977,0.00053014903,0.12364053],"genre_scores_gemma":[0.97637683,0.000648211,0.0050785127,0.00023474563,0.00041746808,0.00005690952,0.00018085774,0.00008412992,0.016922249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832183,0.0003492569,0.000099511264,0.0002380204,0.0004361022,0.00055530504],"domain_scores_gemma":[0.9962691,0.0016711628,0.0005649034,0.0005999052,0.00033780508,0.00055715203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018211605,0.0014880104,0.0015335309,0.0027043032,0.0026017334,0.005236315,0.0010010136,0.001092639,0.011220448],"category_scores_gemma":[0.0041070906,0.00095295184,0.0007530801,0.003196086,0.004477357,0.009950891,0.003668664,0.0033868544,0.0018096779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001655214,0.000074792275,0.0005481734,0.000049574137,0.000010161534,0.00014856471,0.00042390559,0.0009483848,0.0011816163,0.9863511,0.0012331061,0.008865218],"study_design_scores_gemma":[0.000052688785,0.000050803515,0.00022461399,0.000024195051,0.000016675274,0.00023840861,0.00013291108,0.0023761883,0.0014354711,0.99161035,0.0038102076,0.000027348584],"about_ca_topic_score_codex":0.0004235297,"about_ca_topic_score_gemma":0.00044930557,"teacher_disagreement_score":0.011220448,"about_ca_system_score_codex":0.002192895,"about_ca_system_score_gemma":0.002039018,"threshold_uncertainty_score":0.037536144},"labels":[],"label_agreement":null},{"id":"W2017325803","doi":"10.1016/j.jcta.2012.01.006","title":"Fixed points avoiding Abelian k-powers","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Abelian group; Mathematics; Invertible matrix; Fixed point; Decidability; Pure mathematics; Matrix (chemical analysis); Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.009556108663495173,"score_gpt":0.23177425499645135,"score_spread":0.22221814633295617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017325803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8560104,0.00053233263,0.057514265,0.0007539585,0.0004020272,0.000073237636,0.000108616885,0.00034480455,0.08426036],"genre_scores_gemma":[0.97376055,0.00020857484,0.0063709696,0.00008793945,0.00012090408,0.000055153992,0.00006652816,0.000115676616,0.019213693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928147,0.00015926082,0.000046247183,0.00013079279,0.00018509268,0.00019712636],"domain_scores_gemma":[0.99720806,0.0014587868,0.00029773088,0.0003467659,0.0003284357,0.0003601745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065658684,0.0006820802,0.001162931,0.0019655873,0.002893125,0.0039833896,0.0013793914,0.0016060767,0.008164219],"category_scores_gemma":[0.003713962,0.0008140001,0.0012112481,0.0011982295,0.0035808245,0.004722599,0.0032224504,0.0027909027,0.0015615165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001793646,0.000047129466,0.0003772021,0.000048732294,0.000018899427,0.00046282323,0.0007040029,0.0011287419,0.0038129352,0.9886439,0.0007234669,0.0038528587],"study_design_scores_gemma":[0.000065766435,0.00004553076,0.00019973556,0.000022686369,0.000021885096,0.00036480837,0.0003400018,0.00437344,0.0021627832,0.9900802,0.0023013104,0.000021853273],"about_ca_topic_score_codex":0.00046049614,"about_ca_topic_score_gemma":0.00052047905,"teacher_disagreement_score":0.008164219,"about_ca_system_score_codex":0.0010739875,"about_ca_system_score_gemma":0.0003675228,"threshold_uncertainty_score":0.02731204},"labels":[],"label_agreement":null},{"id":"W2018135193","doi":"10.1016/j.jcta.2005.07.013","title":"Further explorations into ternary complementary pairs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Ternary operation; Equivalence (formal languages); Product (mathematics); Computer science; Combinatorics; Mathematics; Discrete mathematics; Geometry","score_opus":0.0062114698178719506,"score_gpt":0.19757699805860948,"score_spread":0.19136552824073752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018135193","genre_codex":"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.18807565,0.00237056,0.29896167,0.0044777887,0.001236169,0.00018958352,0.00044652363,0.00035701832,0.50388515],"genre_scores_gemma":[0.80389947,0.0021582455,0.13957149,0.001663766,0.0005993629,0.00024902343,0.00044239918,0.00027140154,0.05114479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.0002702409,0.000028529481,0.000094506,0.00014000648,0.000097545744],"domain_scores_gemma":[0.99754035,0.001547624,0.00011230084,0.00031585453,0.00035940993,0.00012455834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071635563,0.0006347966,0.0007664063,0.0017088474,0.0023688383,0.0032018835,0.0008585635,0.0014871301,0.04164156],"category_scores_gemma":[0.005436562,0.00035731675,0.00087919267,0.0019740297,0.0017176069,0.004955558,0.0017970138,0.0014648081,0.0026414015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027661454,0.00003302878,0.00012415307,0.00005571256,0.0000027154813,0.00008426518,0.00011981408,0.0008139843,0.0007972644,0.98287576,0.0017295337,0.013336121],"study_design_scores_gemma":[0.0000117425625,0.000021824475,0.000072852396,0.000052075833,0.000010297822,0.00029553825,0.00020970896,0.008420724,0.0012479532,0.9766326,0.013012114,0.000012621645],"about_ca_topic_score_codex":0.00044364601,"about_ca_topic_score_gemma":0.0006503161,"teacher_disagreement_score":0.04164156,"about_ca_system_score_codex":0.0007467844,"about_ca_system_score_gemma":0.0008106619,"threshold_uncertainty_score":0.13930494},"labels":[],"label_agreement":null},{"id":"W2019253309","doi":"10.1016/j.jcta.2004.11.012","title":"Self-duality of chiral polytopes","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Synthesis and Properties of Aromatic Compounds","field":"Chemistry","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Polytope; Duality (order theory); Rank (graph theory); Automorphism; Dual (grammatical number); Combinatorics; Mathematics; Polarity (international relations); Pure mathematics; Chemistry; Philosophy; Linguistics","score_opus":0.008744218932907045,"score_gpt":0.22444105967977687,"score_spread":0.21569684074686982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019253309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8490104,0.00037597775,0.030139351,0.0004431469,0.00021969878,0.000046543177,0.00009863015,0.00011590448,0.11955042],"genre_scores_gemma":[0.9793386,0.00020176214,0.0059255436,0.00013127086,0.000121323406,0.000036620826,0.000097164666,0.0000751488,0.014072628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996896,0.000068788744,0.000015285417,0.000046777703,0.000107269836,0.0000723649],"domain_scores_gemma":[0.9994134,0.00017122232,0.000078661564,0.0000767103,0.0000890619,0.00017096844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034947458,0.00035072918,0.00047044264,0.0015383888,0.0012420074,0.002276505,0.00040114246,0.00050307583,0.0050628437],"category_scores_gemma":[0.00087842526,0.0003065317,0.00041023426,0.00046142942,0.0014828995,0.0011893825,0.0008677201,0.0009072587,0.0003894505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035301113,0.000043049975,0.0001441329,0.000015384248,0.000003838686,0.0000689661,0.00007100415,0.0010311136,0.0044947853,0.99048257,0.0005473519,0.0030624573],"study_design_scores_gemma":[0.000043695793,0.000084608735,0.0005865378,0.000017696433,0.0000086061655,0.00035119752,0.00011764316,0.017569952,0.008055645,0.9685762,0.0045669205,0.00002120138],"about_ca_topic_score_codex":0.00019901132,"about_ca_topic_score_gemma":0.00030377688,"teacher_disagreement_score":0.0050628437,"about_ca_system_score_codex":0.0006380253,"about_ca_system_score_gemma":0.00036342168,"threshold_uncertainty_score":0.016936898},"labels":[],"label_agreement":null},{"id":"W2022058915","doi":"10.1016/j.jcta.2007.11.007","title":"The number of possibilities for random dating","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Induced subgraph isomorphism problem; Mathematics; Random graph; Graph; Set (abstract data type); Discrete mathematics; Computer science; Line graph; Voltage graph; Programming language","score_opus":0.02580193314037548,"score_gpt":0.3056127799729388,"score_spread":0.2798108468325633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022058915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5297794,0.0044308957,0.19914408,0.022366175,0.00049394777,0.0001775526,0.0019388077,0.0012452034,0.24042395],"genre_scores_gemma":[0.9704746,0.0006800959,0.017485399,0.00047404418,0.000270693,0.00015226583,0.00026487446,0.00016702474,0.010030971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99298394,0.0033561834,0.0004443768,0.0013742096,0.0011512394,0.0006900125],"domain_scores_gemma":[0.9146667,0.06278479,0.0039999997,0.013326069,0.0018557413,0.0033667125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010418943,0.0005664479,0.002648909,0.0027437522,0.0053228987,0.010799039,0.004528337,0.0064652134,0.02683864],"category_scores_gemma":[0.073862664,0.0021607114,0.0019860296,0.0028741537,0.007363716,0.022558112,0.004438828,0.006285284,0.002242774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014090358,0.000040530296,0.0011958292,0.00007178616,0.000034207882,0.000103310085,0.00021860027,0.0030601507,0.0001937343,0.98399884,0.002388227,0.008553797],"study_design_scores_gemma":[0.000028882721,0.0000083514415,0.00015683995,0.000022454431,0.000019302068,0.0003010306,0.00010437227,0.006244806,0.00016927144,0.9910706,0.0018541944,0.000019788014],"about_ca_topic_score_codex":0.00026786563,"about_ca_topic_score_gemma":0.00038782976,"teacher_disagreement_score":0.02683864,"about_ca_system_score_codex":0.0015242535,"about_ca_system_score_gemma":0.0011049081,"threshold_uncertainty_score":0.089784145},"labels":[],"label_agreement":null},{"id":"W2022062611","doi":"10.1016/j.jcta.2013.06.004","title":"Extensions of a result of Elekes and Rónyai","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Cartesian product; Combinatorics; Conjecture; Mathematics; Cartesian coordinate system; Product (mathematics); Graph; Line (geometry); Discrete geometry; Discrete mathematics; Geometry","score_opus":0.006129390363911423,"score_gpt":0.21493981736942236,"score_spread":0.20881042700551095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022062611","genre_codex":"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.096623115,0.009667381,0.44413397,0.014908756,0.007981532,0.00032342196,0.0019003208,0.0011336695,0.4233279],"genre_scores_gemma":[0.65444523,0.010266761,0.17814784,0.007110191,0.009293335,0.0005424578,0.0026989274,0.0013481259,0.13614714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808645,0.00040194963,0.00014121119,0.0005466976,0.00058882573,0.00023481427],"domain_scores_gemma":[0.99401087,0.0025048049,0.00046391287,0.0014549309,0.0008904312,0.0006750711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018173652,0.001812294,0.0024132885,0.005022253,0.0033492185,0.0033965153,0.0031811118,0.0020737476,0.024916336],"category_scores_gemma":[0.010900728,0.0007880398,0.0041124476,0.003856453,0.0034850717,0.010934062,0.010490695,0.0046502254,0.0038133452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018175253,0.00014178464,0.00080397277,0.00036446156,0.00006444813,0.0003138842,0.00041683714,0.0027057477,0.0023536298,0.9507885,0.015190389,0.0266747],"study_design_scores_gemma":[0.000038096707,0.00008089939,0.00072941784,0.00007139366,0.000077609875,0.0004016501,0.00016360245,0.010129639,0.00080323394,0.9532425,0.03422316,0.000038761314],"about_ca_topic_score_codex":0.0012002953,"about_ca_topic_score_gemma":0.0008330918,"teacher_disagreement_score":0.024916336,"about_ca_system_score_codex":0.0012198822,"about_ca_system_score_gemma":0.0010438444,"threshold_uncertainty_score":0.0833534},"labels":[],"label_agreement":null},{"id":"W2022449958","doi":"10.1016/j.jcta.2004.07.010","title":"Almost disjoint families of 3-term arithmetic progressions","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Disjoint sets; Arithmetic; Term (time); Mathematics; Arithmetic progression; Point (geometry); Combinatorics; Discrete mathematics; Geometry","score_opus":0.016629102650738782,"score_gpt":0.28815015757052165,"score_spread":0.27152105491978284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022449958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.734905,0.0019349216,0.09947485,0.0014072108,0.00030853137,0.00007424524,0.0004947901,0.0006613343,0.1607391],"genre_scores_gemma":[0.9486359,0.0008010807,0.022770938,0.0003491745,0.00021277925,0.00017274827,0.0004969161,0.0001997123,0.02636079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988972,0.0002602276,0.00006879738,0.00019152128,0.0003643979,0.00021780745],"domain_scores_gemma":[0.99707353,0.0015953995,0.00028591364,0.00025410898,0.00033289546,0.00045814092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012215652,0.00096508575,0.0010925198,0.0037467675,0.0036102694,0.004422189,0.0018355611,0.0016073204,0.010818194],"category_scores_gemma":[0.0042929095,0.0009921257,0.0012807462,0.0027847956,0.0031498636,0.005914023,0.0038594073,0.003020085,0.0012340007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007537343,0.000029682782,0.00029793943,0.00003843755,0.0000142216095,0.00027973208,0.00042351143,0.00052058004,0.0011220364,0.991459,0.0007776593,0.0049617593],"study_design_scores_gemma":[0.000029601852,0.000019726722,0.00043616662,0.000030457573,0.000026281996,0.0005394374,0.00017470265,0.0023047011,0.0008834687,0.9916407,0.0038884727,0.000026300877],"about_ca_topic_score_codex":0.00061559625,"about_ca_topic_score_gemma":0.00078464276,"teacher_disagreement_score":0.010818194,"about_ca_system_score_codex":0.0016787077,"about_ca_system_score_gemma":0.00059353194,"threshold_uncertainty_score":0.03619045},"labels":[],"label_agreement":null},{"id":"W2022838882","doi":"10.1016/j.jcta.2004.11.004","title":"Sieve methods in combinatorics","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Sieve (category theory); Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Abelian group; Interpretation (philosophy); Context (archaeology); Simple (philosophy); Discrete mathematics; Computer science; Graph; Geography","score_opus":0.03187556135946576,"score_gpt":0.37317404036418095,"score_spread":0.3412984790047152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022838882","genre_codex":"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.025983468,0.019555027,0.7879161,0.006486108,0.0024583545,0.000085006875,0.00030411998,0.0009661605,0.15624562],"genre_scores_gemma":[0.4174387,0.027713602,0.32467788,0.0027843204,0.006238319,0.0006021972,0.00074902247,0.0017594929,0.21803649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987808,0.0005252481,0.000050874838,0.00016402955,0.00039349395,0.000085624684],"domain_scores_gemma":[0.99677724,0.0020398996,0.00012915414,0.0005451342,0.0003329194,0.00017559838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019863946,0.0016504421,0.002321388,0.006474765,0.0021672556,0.004400255,0.0022207375,0.0020806289,0.016058534],"category_scores_gemma":[0.0067316564,0.0013895498,0.0014955257,0.00580489,0.005373012,0.008386939,0.0030820507,0.008030346,0.0041865315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010375603,0.000025859958,0.000081597296,0.00006904727,0.000014056906,0.000012140239,0.00009022622,0.00084844325,0.0001706995,0.9741149,0.0036515913,0.020910967],"study_design_scores_gemma":[0.0000070359442,0.0000043990153,0.000053307616,0.000029895878,0.0000067626534,0.000027663673,0.000021850525,0.0039432277,0.00012534061,0.98519856,0.010574868,0.0000071230857],"about_ca_topic_score_codex":0.0008614135,"about_ca_topic_score_gemma":0.0015430386,"teacher_disagreement_score":0.016058534,"about_ca_system_score_codex":0.0015756359,"about_ca_system_score_gemma":0.0008746944,"threshold_uncertainty_score":0.05372113},"labels":[],"label_agreement":null},{"id":"W2023034313","doi":"10.1016/j.jcta.2005.01.006","title":"A simple proof that a word of length n has at most <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:math> distinct squares","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Word (group theory); Simple (philosophy); Scroll; Mathematics; Computer science; Theology; Philosophy; Geometry","score_opus":0.015236540240838172,"score_gpt":0.2316709412900469,"score_spread":0.21643440104920872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023034313","genre_codex":"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.030683285,0.0008606575,0.72108793,0.012387618,0.004600397,0.00090455497,0.003352564,0.0036870013,0.22243592],"genre_scores_gemma":[0.45445517,0.0010409547,0.3638878,0.00836513,0.0020696723,0.0010405097,0.003583799,0.0013609666,0.16419594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983991,0.0002484345,0.00015685914,0.0005393938,0.0004700461,0.00018622828],"domain_scores_gemma":[0.99495524,0.0021515177,0.0003417972,0.0008536972,0.0013560513,0.0003416476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016462386,0.0012834907,0.00079746783,0.0007116178,0.0024535027,0.0020619035,0.0013210456,0.0013548726,0.047139607],"category_scores_gemma":[0.0061221225,0.0008209007,0.0027004543,0.00074161333,0.0028357382,0.006208493,0.0048865112,0.003278025,0.014594499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005666144,0.00037667181,0.0016994759,0.0014756477,0.00019860845,0.0017854852,0.0025516343,0.0013890357,0.05913178,0.66226983,0.15190825,0.11664694],"study_design_scores_gemma":[0.00017695973,0.000278991,0.002156111,0.0002492419,0.00016169043,0.0024758638,0.00064976205,0.004255858,0.028475692,0.75752884,0.20344679,0.000144224],"about_ca_topic_score_codex":0.0014936045,"about_ca_topic_score_gemma":0.0032456843,"teacher_disagreement_score":0.047139607,"about_ca_system_score_codex":0.00099844,"about_ca_system_score_gemma":0.0019517434,"threshold_uncertainty_score":0.15769774},"labels":[],"label_agreement":null},{"id":"W2026069272","doi":"10.1016/j.jcta.2013.05.009","title":"Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Monomial; Mathematics; h-vector; Simplicial approximation theorem; Monomial ideal; Ideal (ethics); Abstract simplicial complex; Combinatorics; Simplicial complex; Quadratic equation; Class (philosophy); Graph; Simplicial homology; Pure mathematics; Discrete mathematics; Polynomial ring; Polynomial; Mathematical analysis; Simplicial set; Geometry","score_opus":0.028284822655334035,"score_gpt":0.32253687212060933,"score_spread":0.2942520494652753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026069272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68552256,0.0011831862,0.12590808,0.005111681,0.002040063,0.00046045746,0.0018730188,0.0013412148,0.1765597],"genre_scores_gemma":[0.9773517,0.0002124658,0.00970528,0.00041155374,0.00037069168,0.000084238585,0.0008001875,0.00012903746,0.010934806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982333,0.00015740126,0.00019406216,0.0005130974,0.0002851172,0.0006170018],"domain_scores_gemma":[0.99463874,0.0020192447,0.00046021587,0.0004751581,0.00078303873,0.0016236162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418876,0.00069129973,0.0017367369,0.001607791,0.0042973002,0.0039398884,0.0019749543,0.0019443348,0.017736373],"category_scores_gemma":[0.007319098,0.0011308021,0.0014905724,0.0012119106,0.0049447683,0.008816329,0.006112228,0.00463915,0.0031177045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049335696,0.0001396681,0.0016552904,0.00016247432,0.00005890527,0.0013392031,0.00113025,0.0007542481,0.008764502,0.97578406,0.0033028955,0.0064150603],"study_design_scores_gemma":[0.00031150947,0.00020759634,0.0018897203,0.000053032796,0.00007253662,0.002215842,0.0016101364,0.0027211078,0.012405547,0.9592237,0.019159084,0.00013018705],"about_ca_topic_score_codex":0.00092737883,"about_ca_topic_score_gemma":0.0009340882,"teacher_disagreement_score":0.017736373,"about_ca_system_score_codex":0.0010978836,"about_ca_system_score_gemma":0.0012556148,"threshold_uncertainty_score":0.0593341},"labels":[],"label_agreement":null},{"id":"W2027087977","doi":"10.1016/s0097-3165(03)00005-0","title":"Embeddings of polar spaces","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Polar; Statement (logic); Field (mathematics); Mathematics; Geometry; Pure mathematics; Physics; Epistemology; Philosophy; Quantum mechanics","score_opus":0.003612113548295665,"score_gpt":0.19326118582976112,"score_spread":0.18964907228146546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027087977","genre_codex":"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.28609616,0.0021969338,0.35683236,0.0052017095,0.0010767374,0.000106023675,0.000982724,0.00055562315,0.34695172],"genre_scores_gemma":[0.89916676,0.001737057,0.032636162,0.0006465756,0.00058268465,0.00009356338,0.0011577298,0.00036369325,0.0636157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995352,0.0001307635,0.00002685137,0.000120303106,0.00010994172,0.00007698878],"domain_scores_gemma":[0.9991301,0.00030807315,0.00011130718,0.0001119252,0.00016379268,0.0001748091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005612596,0.0009131774,0.0005465171,0.0018902501,0.0013525834,0.0039581642,0.0006153232,0.0007907607,0.014611358],"category_scores_gemma":[0.0020756668,0.00060213456,0.0006279623,0.0011221305,0.0026859143,0.005835425,0.0031062916,0.0033122732,0.0020360132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027504833,0.0000098705605,0.000110979236,0.0000142164545,0.000003604795,0.000029929566,0.00017584342,0.00029327045,0.00031579364,0.99405485,0.0010118526,0.003952284],"study_design_scores_gemma":[0.000010042079,0.000013520894,0.00013222208,0.000010281897,0.0000058649443,0.00008018735,0.00024396974,0.0016175172,0.00024396856,0.9902355,0.0074007576,0.0000061108963],"about_ca_topic_score_codex":0.0006377611,"about_ca_topic_score_gemma":0.00055104186,"teacher_disagreement_score":0.014611358,"about_ca_system_score_codex":0.0007208271,"about_ca_system_score_gemma":0.0002591617,"threshold_uncertainty_score":0.04887986},"labels":[],"label_agreement":null},{"id":"W2027965373","doi":"10.1016/s0097-3165(03)00100-6","title":"Independent Deuber sets in graphs on the natural numbers","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Natural (archaeology); Natural number; Mathematics; Combinatorics; Geography; Archaeology","score_opus":0.01538640533843842,"score_gpt":0.2696220057074402,"score_spread":0.2542356003690018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027965373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82201946,0.0009586708,0.06910956,0.0011925634,0.00017592408,0.000058833524,0.0002618238,0.00019543941,0.10602784],"genre_scores_gemma":[0.9646591,0.0005095969,0.017003544,0.0001996958,0.00010851538,0.000114588416,0.00022532027,0.00008505611,0.017094595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911255,0.0002380075,0.000066354456,0.00018998193,0.00024254559,0.0001506086],"domain_scores_gemma":[0.9950517,0.0029186842,0.0006001552,0.0004278853,0.00044308792,0.00055854255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011100083,0.0005305917,0.0009634257,0.0043599657,0.0037292922,0.004381099,0.0014613152,0.0014991944,0.0055864276],"category_scores_gemma":[0.0054347473,0.0009911663,0.00087279617,0.001726754,0.003401484,0.007890984,0.0032126734,0.0022493438,0.00059425476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027665581,0.000023015153,0.00031119684,0.000018035364,0.0000048540046,0.00007233077,0.00026307916,0.00051386823,0.0004921462,0.9954384,0.000305633,0.0025297664],"study_design_scores_gemma":[0.000010275359,0.000008482554,0.0002453115,0.00001574159,0.000007938381,0.00014718922,0.00019338084,0.0023349249,0.0005181947,0.99522203,0.0012866488,0.0000099158815],"about_ca_topic_score_codex":0.00066476496,"about_ca_topic_score_gemma":0.0012864413,"teacher_disagreement_score":0.0055864276,"about_ca_system_score_codex":0.0012911299,"about_ca_system_score_gemma":0.00044743464,"threshold_uncertainty_score":0.01868844},"labels":[],"label_agreement":null},{"id":"W2028350743","doi":"10.1016/j.jcta.2008.06.011","title":"Classifying lattice walks restricted to the quarter plane","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Random walk; Mathematics; Quadrant (abdomen); Lattice (music); Transcendental number; Combinatorics; Algebraic number; Discrete mathematics; Mathematical analysis; Physics; Statistics","score_opus":0.037828813530528874,"score_gpt":0.29186427533078096,"score_spread":0.2540354618002521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028350743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91976124,0.00021128081,0.015502611,0.00087105605,0.00017503121,0.00004193732,0.00026665055,0.0002502049,0.06291999],"genre_scores_gemma":[0.9793195,0.0002682098,0.004827468,0.0003196161,0.00024631072,0.000041765918,0.00051011634,0.0001648695,0.014302224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995376,0.000088092434,0.00002373763,0.000064538115,0.00015086564,0.00013529598],"domain_scores_gemma":[0.99866724,0.0004074765,0.00029707435,0.00018402874,0.0001502678,0.00029402017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734471,0.00038387705,0.00066901057,0.0020711895,0.0017026017,0.003995789,0.00069432927,0.0014380483,0.008497544],"category_scores_gemma":[0.0017580095,0.00039501238,0.00041428473,0.0013298746,0.0015713845,0.002985397,0.0013307831,0.0017365988,0.0011016331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001281008,0.00008982991,0.001357196,0.000030054176,0.000008456104,0.00016783252,0.00021298772,0.0012970762,0.0036332957,0.98394936,0.0023341554,0.0067915707],"study_design_scores_gemma":[0.000080797225,0.00003863406,0.001915955,0.000026253641,0.000011273829,0.00043747143,0.00038310734,0.019070903,0.0015227118,0.9721686,0.004322226,0.00002203676],"about_ca_topic_score_codex":0.0012257122,"about_ca_topic_score_gemma":0.0013337516,"teacher_disagreement_score":0.008497544,"about_ca_system_score_codex":0.00070539647,"about_ca_system_score_gemma":0.00049659825,"threshold_uncertainty_score":0.028427064},"labels":[],"label_agreement":null},{"id":"W2028399610","doi":"10.1016/j.jcta.2007.07.010","title":"On sets of integers whose shifted products are powers","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Integer (computer science); Combinatorics; Mathematics; Property (philosophy); Discrete mathematics; Binary logarithm; Computer science","score_opus":0.01633077978276656,"score_gpt":0.28504268758100726,"score_spread":0.2687119077982407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028399610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7023846,0.0019510521,0.16514854,0.0021557494,0.0006161547,0.00008900268,0.00056596776,0.00042991317,0.12665899],"genre_scores_gemma":[0.9366693,0.0013706706,0.031583197,0.0006800257,0.0006232267,0.00022936043,0.0006962015,0.00031563328,0.027832463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975746,0.0006573921,0.00018448282,0.0004991229,0.00068612554,0.00039828877],"domain_scores_gemma":[0.989356,0.0066811903,0.0011528081,0.0010957675,0.00078690785,0.00092744944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021360747,0.0011093614,0.0017415961,0.005193003,0.004384255,0.0065822094,0.0025831638,0.0017291222,0.0067043747],"category_scores_gemma":[0.011654323,0.0013396523,0.0015686316,0.004395626,0.0060452237,0.014470833,0.0046592476,0.0030526419,0.0012383125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005035914,0.000021215084,0.0001922561,0.00002408188,0.000006763698,0.00011548316,0.0003689881,0.0004008716,0.0005032537,0.99514765,0.00052233477,0.0026468101],"study_design_scores_gemma":[0.00000979439,0.00000865156,0.000101982245,0.000021746515,0.000009065608,0.00013661082,0.00012777212,0.0015825997,0.00029903385,0.9966072,0.0010860331,0.000009500765],"about_ca_topic_score_codex":0.0008083862,"about_ca_topic_score_gemma":0.0007413109,"teacher_disagreement_score":0.0067043747,"about_ca_system_score_codex":0.0019266694,"about_ca_system_score_gemma":0.00064954965,"threshold_uncertainty_score":0.022428334},"labels":[],"label_agreement":null},{"id":"W2028910286","doi":"10.1016/j.jcta.2006.06.007","title":"Semisymmetric graphs from polytopes","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Symmetric graph; Transitive relation; Vertex (graph theory); Graph; Toroid; Discrete mathematics; Line graph; Voltage graph","score_opus":0.022371334077596366,"score_gpt":0.2853764405316327,"score_spread":0.2630051064540363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028910286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45289636,0.0015390046,0.23095118,0.005230063,0.0018237131,0.0002652581,0.0017755566,0.0006407699,0.30487806],"genre_scores_gemma":[0.89495623,0.0015594087,0.035311162,0.0011891125,0.0009858473,0.00018891388,0.0016271587,0.00047703026,0.06370524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943334,0.00013487157,0.000035740577,0.00013812566,0.00016870398,0.00008916694],"domain_scores_gemma":[0.9983646,0.000719862,0.00024316112,0.00022919971,0.00018204478,0.00026110306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043248307,0.0009987026,0.0010659711,0.0020578483,0.0020646525,0.0041171336,0.0012095592,0.0014723038,0.01727058],"category_scores_gemma":[0.002064407,0.000872856,0.0010602014,0.0018681074,0.0026084683,0.006774832,0.0025720238,0.004067413,0.0018366422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014641657,0.000013465956,0.000056870274,0.000020667903,0.000003082651,0.000057992493,0.00011509364,0.00032801356,0.00033519513,0.99522936,0.0013493544,0.0024761665],"study_design_scores_gemma":[0.000007667744,0.000003849052,0.00006515992,0.0000067160236,0.000003532257,0.00009048613,0.000059934206,0.00078868965,0.00014370614,0.9961339,0.0026914172,0.000004909004],"about_ca_topic_score_codex":0.00074798305,"about_ca_topic_score_gemma":0.001228608,"teacher_disagreement_score":0.01727058,"about_ca_system_score_codex":0.0011393673,"about_ca_system_score_gemma":0.00048330144,"threshold_uncertainty_score":0.057775915},"labels":[],"label_agreement":null},{"id":"W2029485128","doi":"10.1016/j.jcta.2004.02.002","title":"A hypergraph extension of the bipartite Turán problem","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Extension (predicate logic); Hypergraph; Combinatorics; Upper and lower bounds; Mathematics; Bipartite graph; Element (criminal law); Set (abstract data type); Computer science; Graph; Law; Mathematical analysis; Political science","score_opus":0.014395830166834702,"score_gpt":0.25527151260474595,"score_spread":0.24087568243791124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029485128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44061226,0.0015618973,0.32882845,0.009328143,0.00042606887,0.00020527757,0.0009611212,0.00049781863,0.21757898],"genre_scores_gemma":[0.8939923,0.0012616938,0.055117395,0.0011764115,0.00077422603,0.00020499584,0.0008503756,0.00020684811,0.046415653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.0003956387,0.00002564444,0.00014707368,0.00011600228,0.000094960174],"domain_scores_gemma":[0.997003,0.0018495433,0.00023836292,0.00024228981,0.00026100146,0.00040575274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009358739,0.00040926167,0.0009574732,0.0010888801,0.0015761934,0.0025768261,0.0017061465,0.001862891,0.009529248],"category_scores_gemma":[0.005584028,0.00038231505,0.0007761872,0.0018665423,0.0017138598,0.00625246,0.0022838416,0.002621633,0.0007178375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055003657,0.00007388694,0.00020752521,0.00005347957,0.0000099575245,0.00009750882,0.00012161653,0.005436601,0.00035776038,0.98116285,0.0046558976,0.0077677714],"study_design_scores_gemma":[0.000018170194,0.0000116138945,0.00013589789,0.000014253233,0.0000075213698,0.00007555205,0.00006262823,0.03229068,0.00013771963,0.9638388,0.0033987649,0.00000838172],"about_ca_topic_score_codex":0.001450137,"about_ca_topic_score_gemma":0.0015442896,"teacher_disagreement_score":0.009529248,"about_ca_system_score_codex":0.0010044196,"about_ca_system_score_gemma":0.00089812675,"threshold_uncertainty_score":0.03187853},"labels":[],"label_agreement":null},{"id":"W2031011579","doi":"10.1016/j.jcta.2005.09.002","title":"Alternating sign matrices with one −1 under vertical reflection","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sign (mathematics); Reflection (computer programming); Mathematics; Materials science; Computer science; Mathematical analysis; Programming language","score_opus":0.033370355862873236,"score_gpt":0.31450391040521974,"score_spread":0.2811335545423465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031011579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53656185,0.00036314395,0.15884681,0.0026105205,0.0036926584,0.00024155978,0.00044073758,0.001765212,0.29547757],"genre_scores_gemma":[0.85932285,0.00049647084,0.03807204,0.0015786542,0.0011267116,0.0002521394,0.0004289277,0.0011294835,0.097592756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998448,0.00037819668,0.00009213022,0.0002730267,0.00042864087,0.00037996666],"domain_scores_gemma":[0.99817204,0.00039071697,0.0002999127,0.00037272664,0.0003215495,0.00044315387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009996436,0.0021498236,0.00093721197,0.0019077548,0.0025720862,0.0041831816,0.0014298653,0.002342155,0.014590365],"category_scores_gemma":[0.0033314752,0.0010211787,0.0009156369,0.0012797004,0.003856453,0.005084348,0.002767363,0.0038760942,0.0044422513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014723538,0.000058351987,0.00016607723,0.000025873247,0.000007709124,0.00029100492,0.00017509445,0.00027525346,0.008308999,0.9763141,0.003063831,0.011166578],"study_design_scores_gemma":[0.0000636126,0.000086929285,0.00021579587,0.000024236551,0.000018111046,0.00080857996,0.00012858053,0.0026456055,0.008036088,0.9815347,0.006391522,0.000046324232],"about_ca_topic_score_codex":0.0002894654,"about_ca_topic_score_gemma":0.00041688973,"teacher_disagreement_score":0.014590365,"about_ca_system_score_codex":0.00068104715,"about_ca_system_score_gemma":0.0011528494,"threshold_uncertainty_score":0.048809588},"labels":[],"label_agreement":null},{"id":"W2033949361","doi":"10.1016/j.jcta.2012.07.010","title":"Subsets of products of finite sets of positive upper density","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sequence (biology); Combinatorics; Mathematics; Physics; Chemistry","score_opus":0.018095933409191654,"score_gpt":0.2742560461828031,"score_spread":0.25616011277361145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033949361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7909124,0.0011085342,0.15671098,0.00063258345,0.000110594876,0.00006804643,0.00093537086,0.00037320555,0.049148355],"genre_scores_gemma":[0.9675075,0.0004171315,0.020978035,0.00013500908,0.00013435006,0.0001769466,0.0010955116,0.0001402454,0.009415326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833715,0.00037147166,0.00018124777,0.00039111602,0.00048318127,0.00023585076],"domain_scores_gemma":[0.9902069,0.005991311,0.00089998316,0.00087903405,0.00099015,0.0010326967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015307998,0.00075490586,0.0016399964,0.0033913576,0.0031389333,0.0065734354,0.0019522802,0.0009956544,0.006963884],"category_scores_gemma":[0.0077771726,0.0015195141,0.0014587458,0.0025035858,0.003925228,0.0072802254,0.003438009,0.0016413289,0.0006868309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014261073,0.000044054003,0.0016247587,0.0000590266,0.00004052585,0.00027611613,0.00067443616,0.0010924843,0.0015263902,0.99010706,0.0006256382,0.0037869331],"study_design_scores_gemma":[0.00003019236,0.00003466712,0.0012645967,0.000048582744,0.000054401422,0.00078735984,0.0006254628,0.008631906,0.0020022015,0.9835348,0.0029562048,0.000029678104],"about_ca_topic_score_codex":0.0009354794,"about_ca_topic_score_gemma":0.0008298687,"teacher_disagreement_score":0.006963884,"about_ca_system_score_codex":0.001319646,"about_ca_system_score_gemma":0.00057260116,"threshold_uncertainty_score":0.023296475},"labels":[],"label_agreement":null},{"id":"W2035044354","doi":"10.1016/j.jcta.2010.11.003","title":"An Erdős–Ko–Rado theorem for the derangement graph of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">PGL</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> acting on the projective line","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Derangement; Pencil (optics); Mathematics; Coset; Point (geometry); Projective test; Graph; Discrete mathematics; Pure mathematics; Physics; Geometry","score_opus":0.02436183775028209,"score_gpt":0.27203609666789197,"score_spread":0.24767425891760989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035044354","genre_codex":"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.26178035,0.0025860604,0.3114328,0.009223275,0.00076803035,0.00014985686,0.0022294295,0.00083527307,0.41099477],"genre_scores_gemma":[0.8794378,0.002853529,0.03676262,0.0016391292,0.0007861985,0.0002669984,0.0019428708,0.0002923315,0.07601855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999241,0.00015882228,0.0000413763,0.00025392073,0.00017303559,0.00013188898],"domain_scores_gemma":[0.99770856,0.0010042355,0.00038809917,0.00029659618,0.00033335312,0.0002691068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090439164,0.00078326557,0.0008456555,0.002309461,0.002502374,0.0031647678,0.0011249487,0.0010768679,0.017213205],"category_scores_gemma":[0.0029841068,0.00051423704,0.00084034546,0.0016657201,0.003321244,0.005163384,0.002155406,0.002789218,0.003729948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026548838,0.000010041633,0.00020624688,0.000035588935,0.000009073781,0.000039213595,0.00011362965,0.00058093964,0.00041679287,0.9891788,0.003700987,0.0056821518],"study_design_scores_gemma":[0.0000290085,0.000021728933,0.0005460135,0.000023024206,0.000022065033,0.00014152745,0.0001123687,0.0033869625,0.0006626754,0.97830635,0.01673071,0.000017590519],"about_ca_topic_score_codex":0.0013238165,"about_ca_topic_score_gemma":0.0010881652,"teacher_disagreement_score":0.017213205,"about_ca_system_score_codex":0.001403153,"about_ca_system_score_gemma":0.00065832277,"threshold_uncertainty_score":0.05758387},"labels":[],"label_agreement":null},{"id":"W2036754114","doi":"10.1016/j.jcta.2013.12.004","title":"On balanced incomplete block designs with specified weak chromatic number","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Lambda; Block (permutation group theory); Combinatorics; Block design; Discrete mathematics; Physics; Optics","score_opus":0.007952064428015451,"score_gpt":0.19136564150939853,"score_spread":0.18341357708138306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036754114","genre_codex":"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.2655379,0.0005598968,0.6724446,0.0005813561,0.000119807264,0.0001838586,0.00059733406,0.00034099023,0.059634253],"genre_scores_gemma":[0.84380025,0.0008992684,0.12982556,0.0004114866,0.000116570176,0.00035425133,0.00054507033,0.00016997976,0.02387761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988809,0.00046165273,0.00004173416,0.00015124159,0.0003017823,0.0001628248],"domain_scores_gemma":[0.9961117,0.0022455202,0.0004809777,0.00049006345,0.0004716878,0.000200167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014881203,0.0011900488,0.0007098473,0.0011141878,0.00072706863,0.0019369391,0.00077940355,0.0009602701,0.0059613455],"category_scores_gemma":[0.005155496,0.0006345952,0.00036978576,0.001262636,0.001187393,0.0019398789,0.0012370881,0.0007861269,0.00091791846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044975293,0.000049091544,0.00084456167,0.00010267077,0.000027675345,0.000118908385,0.00016023409,0.06121835,0.013708583,0.8985869,0.0027036362,0.022029676],"study_design_scores_gemma":[0.0001466196,0.0002278655,0.0005444416,0.00010874593,0.000051757055,0.0002105501,0.0001037095,0.2753896,0.0077724857,0.70774627,0.007644114,0.000053803476],"about_ca_topic_score_codex":0.0012577268,"about_ca_topic_score_gemma":0.0027658343,"teacher_disagreement_score":0.0059613455,"about_ca_system_score_codex":0.0014823244,"about_ca_system_score_gemma":0.0011279167,"threshold_uncertainty_score":0.01994276},"labels":[],"label_agreement":null},{"id":"W2037565534","doi":"10.1016/j.jcta.2012.05.003","title":"Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Integer (computer science); Prime (order theory); Coprime integers; Discrete mathematics; Prime power; Sequence (biology); Character (mathematics); Binary number; Arithmetic","score_opus":0.015578767243669647,"score_gpt":0.24843029463459676,"score_spread":0.23285152739092713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037565534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7407388,0.002075244,0.12458292,0.014666697,0.0012971754,0.000059644066,0.00035787481,0.00047272214,0.11574895],"genre_scores_gemma":[0.98258305,0.00040770858,0.007741286,0.0009863916,0.00078055065,0.000052016043,0.00014320512,0.000073986346,0.0072318166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969387,0.0008250598,0.00016963073,0.000478593,0.00081957097,0.0007685505],"domain_scores_gemma":[0.9911028,0.0050112074,0.0008027974,0.0012837012,0.0007112662,0.001088189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055879825,0.00096594123,0.002251015,0.0028225887,0.004879433,0.006205837,0.0019323573,0.0032028062,0.00557193],"category_scores_gemma":[0.018851932,0.001097676,0.0017851669,0.0025673574,0.010413581,0.010118383,0.0066055013,0.0067050923,0.00081028196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003910248,0.00001967907,0.0003693845,0.000016039303,0.000007725567,0.000092050075,0.00014355268,0.00071066886,0.00018999675,0.9955485,0.0012358308,0.0016274315],"study_design_scores_gemma":[0.000014369029,0.000009491471,0.00015168784,0.000010500943,0.000007618542,0.00008617989,0.000034995333,0.0027737657,0.00020368933,0.9960179,0.0006713448,0.000018500907],"about_ca_topic_score_codex":0.0010532461,"about_ca_topic_score_gemma":0.00081056997,"teacher_disagreement_score":0.006205837,"about_ca_system_score_codex":0.002062709,"about_ca_system_score_gemma":0.0014738932,"threshold_uncertainty_score":0.0295524},"labels":[],"label_agreement":null},{"id":"W2038004087","doi":"10.1016/s0097-3165(03)00098-0","title":"Cycle decompositions IV: complete directed graphs and fixed length directed cycles","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Directed graph; Discrete mathematics","score_opus":0.006390053528123849,"score_gpt":0.2002197457387437,"score_spread":0.19382969221061985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038004087","genre_codex":"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.27078795,0.0046604215,0.5782939,0.0022531727,0.00048134083,0.00052362937,0.0022039227,0.00044112306,0.14035445],"genre_scores_gemma":[0.80099815,0.004236653,0.14365712,0.0010258686,0.0005350745,0.0005738826,0.0027260918,0.0003076463,0.04593943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999395,0.0001291394,0.000033901477,0.00018953445,0.00013290369,0.0001193949],"domain_scores_gemma":[0.99786514,0.0009297018,0.00033886338,0.00024669402,0.00033454472,0.00028502807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006441038,0.00095260236,0.00083628274,0.0024679373,0.0013344181,0.0035274706,0.0011761093,0.0012936181,0.0073470366],"category_scores_gemma":[0.003621773,0.00084429595,0.001080164,0.0027801835,0.0016772194,0.0037616699,0.0013336736,0.0024372323,0.00077462994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069573114,0.000035199948,0.0003661841,0.00010651444,0.000023906066,0.00010539678,0.00028286534,0.005527225,0.0015538184,0.97064227,0.004555373,0.016731644],"study_design_scores_gemma":[0.000021227042,0.000009983397,0.00020134088,0.000034104767,0.000017622826,0.00010888885,0.00011757255,0.01351463,0.0004667804,0.98023784,0.0052593034,0.000010740428],"about_ca_topic_score_codex":0.0021423602,"about_ca_topic_score_gemma":0.002162181,"teacher_disagreement_score":0.0073470366,"about_ca_system_score_codex":0.0014042652,"about_ca_system_score_gemma":0.0009152366,"threshold_uncertainty_score":0.024578333},"labels":[],"label_agreement":null},{"id":"W2039267601","doi":"10.1016/s0097-3165(02)00020-1","title":"Sets of three pairwise orthogonal Steiner triple systems","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; California Institute of Technology","keywords":"Steiner system; Disjoint sets; Combinatorics; Pairwise comparison; Mathematics; Order (exchange); Triple system; Discrete mathematics; Pure mathematics; Statistics","score_opus":0.008658855848408292,"score_gpt":0.1943711763680776,"score_spread":0.18571232051966932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039267601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77916324,0.00039680646,0.08839164,0.0007231066,0.00024667755,0.000121688165,0.0013151971,0.00023557404,0.12940592],"genre_scores_gemma":[0.96206594,0.00021307061,0.022769468,0.00016469815,0.000048477676,0.00013448799,0.0014365646,0.000068994166,0.013098332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999286,0.000132136,0.000059170783,0.000097551936,0.00026060035,0.00016446818],"domain_scores_gemma":[0.99901843,0.00029385387,0.00016389751,0.0001222884,0.000205659,0.00019586313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035409036,0.0006374248,0.0009638857,0.0021762953,0.0028568695,0.0035108377,0.0009348245,0.0012713155,0.010445766],"category_scores_gemma":[0.0012742268,0.0005715785,0.0008463112,0.0020660835,0.0015779751,0.0016712204,0.0024063406,0.001386083,0.0012608579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000265407,0.000077350094,0.0012381428,0.000112453825,0.0000581457,0.0009227058,0.0006168294,0.004914501,0.009140336,0.9634147,0.0035196524,0.015719894],"study_design_scores_gemma":[0.00008550691,0.000103916165,0.0018712941,0.000082950064,0.00007619334,0.001214595,0.0015275175,0.024159413,0.006849513,0.9510873,0.012862865,0.00007888452],"about_ca_topic_score_codex":0.00085025217,"about_ca_topic_score_gemma":0.00084962806,"teacher_disagreement_score":0.010445766,"about_ca_system_score_codex":0.0008768974,"about_ca_system_score_gemma":0.0005986525,"threshold_uncertainty_score":0.034944594},"labels":[],"label_agreement":null},{"id":"W2039325744","doi":"10.1016/j.jcta.2005.09.007","title":"A combinatorial proof of the Rogers–Ramanujan and Schur identities","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorial proof; Ramanujan's sum; Mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.015835563125030552,"score_gpt":0.2794830966889912,"score_spread":0.26364753356396065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039325744","genre_codex":"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.115253836,0.005244072,0.25231227,0.010544546,0.0028540809,0.00012084951,0.00057270966,0.00046166868,0.61263597],"genre_scores_gemma":[0.8337961,0.004134937,0.08308787,0.0021215149,0.0037720369,0.00021858446,0.00046997177,0.00035169226,0.07204732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989562,0.00028644447,0.000057718837,0.00013578845,0.00045785334,0.0001058998],"domain_scores_gemma":[0.99701476,0.0016421821,0.00024400074,0.0003765077,0.00047731606,0.00024528414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015360503,0.001259324,0.0014179305,0.0028797374,0.0026160781,0.004083675,0.0022720702,0.0017333647,0.014441329],"category_scores_gemma":[0.005553429,0.0008851801,0.0014975487,0.0020322034,0.004111171,0.005704571,0.003990407,0.0059113577,0.0024921636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060922944,0.0000143521,0.000035580073,0.000018723276,0.0000032280973,0.000057804722,0.00005519896,0.00020256768,0.00023937123,0.99585825,0.0012310037,0.0022778371],"study_design_scores_gemma":[0.000011701176,0.0000070554297,0.00011564516,0.000013948133,0.000007229601,0.00015925767,0.000033605946,0.0017643515,0.00023391619,0.9917463,0.0058940295,0.0000129312975],"about_ca_topic_score_codex":0.00089389016,"about_ca_topic_score_gemma":0.0008979573,"teacher_disagreement_score":0.014441329,"about_ca_system_score_codex":0.0016512587,"about_ca_system_score_gemma":0.00094736536,"threshold_uncertainty_score":0.048311114},"labels":[],"label_agreement":null},{"id":"W2040192988","doi":"10.1016/j.jcta.2015.01.005","title":"Simple recurrence formulas to count maps on orientable surfaces","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Generating function; Bijection; Bipartite graph; Combinatorics; Simple (philosophy); Genus; Recurrence relation; Interpretation (philosophy); Discrete mathematics; Graph","score_opus":0.0453241027719853,"score_gpt":0.32527315538470486,"score_spread":0.2799490526127196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040192988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6234409,0.0035858736,0.19502777,0.0033861657,0.0021965478,0.00023454076,0.00051701325,0.0011383961,0.17047288],"genre_scores_gemma":[0.91952825,0.0016281819,0.030522857,0.00093255605,0.001687167,0.00024607824,0.00049326796,0.0006809309,0.044280622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990397,0.00023395258,0.00008464034,0.00015793939,0.00029466354,0.00018908676],"domain_scores_gemma":[0.99769574,0.0011595599,0.0003645323,0.00017593411,0.00034131485,0.00026291516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011165742,0.0018806313,0.0018300565,0.005426655,0.0024019538,0.005011732,0.003029344,0.0024632942,0.011802182],"category_scores_gemma":[0.0073919147,0.0011399573,0.0015226426,0.0038132966,0.0031081971,0.008627909,0.0028530497,0.0038078243,0.0016448308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025486368,0.00003749445,0.00019723295,0.00005235042,0.000009167788,0.00023732097,0.00041129717,0.00061176764,0.00048939284,0.9900865,0.001630972,0.0062110005],"study_design_scores_gemma":[0.000014002481,0.000010615692,0.00014205482,0.00001847383,0.000015935191,0.00013450172,0.00010968397,0.004793299,0.00028075854,0.99268484,0.001779351,0.00001636004],"about_ca_topic_score_codex":0.0013958126,"about_ca_topic_score_gemma":0.0020632304,"teacher_disagreement_score":0.011802182,"about_ca_system_score_codex":0.002158422,"about_ca_system_score_gemma":0.000644671,"threshold_uncertainty_score":0.039482176},"labels":[],"label_agreement":null},{"id":"W2040288558","doi":"10.1006/jcta.2001.3209","title":"Compactness Theorems for Geometric Packings","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rectangle; Combinatorics; Mathematics; Square (algebra); Unit square; Compact space; Geometry; Pure mathematics","score_opus":0.018106030893622956,"score_gpt":0.22845005799612392,"score_spread":0.21034402710250097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040288558","genre_codex":"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.36824533,0.0066136774,0.40877554,0.0062065907,0.000722796,0.00014835119,0.00095772994,0.00072523823,0.20760469],"genre_scores_gemma":[0.9005105,0.0030089938,0.06573115,0.0016008866,0.0016190554,0.00033023217,0.0013900037,0.0005399729,0.025269212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986493,0.00038867228,0.00010448977,0.0003003046,0.00039187723,0.00016529288],"domain_scores_gemma":[0.99050784,0.0066433935,0.00068003533,0.00091342174,0.0006099132,0.000645458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002682678,0.0014118219,0.0018528372,0.004144358,0.002586547,0.0036833687,0.0023482542,0.0017822956,0.008398169],"category_scores_gemma":[0.008180718,0.0018508778,0.002462584,0.0028177598,0.005211135,0.014217025,0.0056511983,0.005356745,0.0010369527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003826062,0.000029685676,0.00033993763,0.00007341343,0.000019212812,0.00007013234,0.00032366635,0.00091035943,0.00074121356,0.99025625,0.0021092023,0.005088734],"study_design_scores_gemma":[0.000018734418,0.000027349293,0.0006382039,0.000021284888,0.000016868802,0.00018814983,0.000079877995,0.0052218153,0.00048016812,0.98951435,0.0037777643,0.000015428099],"about_ca_topic_score_codex":0.000642323,"about_ca_topic_score_gemma":0.00066175486,"teacher_disagreement_score":0.008398169,"about_ca_system_score_codex":0.0016473511,"about_ca_system_score_gemma":0.00038942005,"threshold_uncertainty_score":0.028094709},"labels":[],"label_agreement":null},{"id":"W2040687890","doi":"10.1016/j.jcta.2005.10.004","title":"On the work of Basil Gordon","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Congruence relation; Ramanujan's sum; Partition (number theory); Modular form; Ramanujan theta function; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.01750865563763116,"score_gpt":0.2667803809036236,"score_spread":0.24927172526599245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040687890","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042304665,0.033145122,0.011049524,0.15038976,0.01429887,0.000024106372,0.0001396648,0.00025453718,0.7483938],"genre_scores_gemma":[0.6711064,0.017485296,0.0052541676,0.0136023825,0.007871502,0.000047785616,0.0000918844,0.0005540005,0.28398654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990476,0.0004234578,0.000027268687,0.00012685273,0.00021021237,0.00016460859],"domain_scores_gemma":[0.9987319,0.000620082,0.000053545456,0.00020388838,0.00019138023,0.00019916627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019238759,0.0005863221,0.0008601168,0.0014266906,0.006310972,0.0040976927,0.0008572277,0.0031096174,0.010871616],"category_scores_gemma":[0.004959738,0.00029964605,0.00040373584,0.0015432994,0.008360968,0.006539401,0.0032870031,0.0035303277,0.0024625163],"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.000013006859,0.000006797597,0.000030897812,0.000015842916,0.0000025146721,0.00003610202,0.0006875204,0.00013903173,0.000072301795,0.9702336,0.024350306,0.0044120303],"study_design_scores_gemma":[0.000010645531,0.000007853087,0.00009672409,0.000054063403,0.000003145922,0.00005014205,0.00045564515,0.00032983746,0.00008783126,0.86954,0.12935026,0.000013796707],"about_ca_topic_score_codex":0.0027314734,"about_ca_topic_score_gemma":0.0025457335,"teacher_disagreement_score":0.010871616,"about_ca_system_score_codex":0.0027549188,"about_ca_system_score_gemma":0.0016762281,"threshold_uncertainty_score":0.036369205},"labels":[],"label_agreement":null},{"id":"W2042105004","doi":"10.1016/j.jcta.2006.04.002","title":"The small octagon with longest perimeter","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Perimeter; Regular polygon; Mathematics; Trigonometry; Series (stratigraphy); Unit (ring theory); Interval (graph theory); Combinatorics; Arithmetic; Algorithm; Computer science; Mathematical analysis; Geometry; Mathematics education","score_opus":0.006864764530871105,"score_gpt":0.21850662028562967,"score_spread":0.21164185575475858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042105004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69836324,0.00154811,0.13881898,0.0024448696,0.00079640496,0.000121108336,0.00083093776,0.000589462,0.156487],"genre_scores_gemma":[0.9365325,0.0005512816,0.0403595,0.00032843582,0.00021965033,0.000058479513,0.00041331083,0.00021835166,0.021318503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997925,0.00004422594,0.000009994409,0.00005047689,0.00006244802,0.00004033721],"domain_scores_gemma":[0.9995228,0.00017293308,0.00006752783,0.00006589917,0.000053958884,0.00011687386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013405138,0.00032363881,0.0006926219,0.0008907732,0.0011031327,0.0019046158,0.0006523815,0.0010610926,0.009088211],"category_scores_gemma":[0.001675565,0.00038574077,0.00035313243,0.00083123386,0.0014584882,0.001414294,0.0012161869,0.0012129482,0.0012777268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000664297,0.000088271896,0.0018820197,0.00023974612,0.000024798632,0.00078508136,0.0003378516,0.011296216,0.010454424,0.8838125,0.016090486,0.07432431],"study_design_scores_gemma":[0.00012717191,0.00011108921,0.001140337,0.000042676547,0.000022618855,0.00087677024,0.00041304066,0.041783754,0.002872336,0.930385,0.022189507,0.000035626934],"about_ca_topic_score_codex":0.0007518654,"about_ca_topic_score_gemma":0.00075899216,"teacher_disagreement_score":0.009088211,"about_ca_system_score_codex":0.00030912276,"about_ca_system_score_gemma":0.0003773576,"threshold_uncertainty_score":0.030403137},"labels":[],"label_agreement":null},{"id":"W2043024709","doi":"10.1016/j.jcta.2015.03.007","title":"Large sets of complex and real equiangular lines","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equiangular polygon; Mathematics; Combinatorics; Computer science; Geometry","score_opus":0.05458883067344754,"score_gpt":0.3330086423460021,"score_spread":0.27841981167255453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043024709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8814378,0.0009300133,0.08884449,0.001282453,0.00011314128,0.00004505267,0.0005955275,0.00027888853,0.026472619],"genre_scores_gemma":[0.98463863,0.00023828399,0.009778135,0.00013803634,0.00011839777,0.000075120384,0.0004979466,0.00005315922,0.0044623003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920803,0.00019616746,0.000046591373,0.00017955046,0.00027138292,0.0000984181],"domain_scores_gemma":[0.9887692,0.0071757976,0.0011829034,0.0009941893,0.0010640639,0.0008139068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009321398,0.0005126164,0.0012237927,0.0033411726,0.001521681,0.004551689,0.0016413775,0.0015039931,0.0071086083],"category_scores_gemma":[0.012943468,0.0007512004,0.0006163747,0.001499952,0.0034229043,0.004083778,0.0020706228,0.0015819488,0.00040691975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016560144,0.00006132901,0.003220505,0.00010176133,0.000056482393,0.0004944271,0.00043906595,0.016625244,0.003449507,0.96726215,0.0021251128,0.005998777],"study_design_scores_gemma":[0.00007375905,0.000043749667,0.0049331067,0.00005762907,0.00003530335,0.0007182585,0.00048896385,0.124271564,0.0022270768,0.8632146,0.0038873171,0.000048682625],"about_ca_topic_score_codex":0.0005520757,"about_ca_topic_score_gemma":0.00049632706,"teacher_disagreement_score":0.0071086083,"about_ca_system_score_codex":0.0012259685,"about_ca_system_score_gemma":0.00031087772,"threshold_uncertainty_score":0.023780644},"labels":[],"label_agreement":null},{"id":"W2044138171","doi":"10.1016/j.jcta.2005.08.004","title":"Möbius functions and semigroup representation theory","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Semilattice; Mathematics; Semigroup; Inverse semigroup; Krohn–Rhodes theory; Pure mathematics; Algebra over a field; Representation (politics); Bicyclic semigroup; Inverse; Product (mathematics); Representation theory; Eigenvalues and eigenvectors; Matrix (chemical analysis); Special classes of semigroups","score_opus":0.008332151884208635,"score_gpt":0.23615552530717582,"score_spread":0.22782337342296718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044138171","genre_codex":"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.32947427,0.022383789,0.34315252,0.024301982,0.0026997584,0.000062259904,0.0004776497,0.00059244543,0.27685535],"genre_scores_gemma":[0.94255656,0.0034250026,0.016863195,0.00082028634,0.0017954357,0.000088214576,0.00017942685,0.00009344725,0.034178406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993882,0.00023629799,0.000036719175,0.00010249863,0.00014259326,0.000093691415],"domain_scores_gemma":[0.9976484,0.0016147381,0.0001648946,0.00019922988,0.00022876632,0.00014391556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012668655,0.0006810166,0.0011035117,0.0022365917,0.0020701045,0.00437149,0.0009077473,0.0016091918,0.0071613304],"category_scores_gemma":[0.004121486,0.0005636767,0.0007989659,0.0022000482,0.005255343,0.007533314,0.0015894882,0.00331664,0.00083776703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062681197,0.000004741552,0.00003202726,0.000008105556,0.0000014909486,0.000011412889,0.00011309477,0.00014784605,0.00008568072,0.99765176,0.00038405988,0.001553511],"study_design_scores_gemma":[0.000004322232,0.0000030750282,0.000030628282,0.00000397161,0.0000018712063,0.000022847586,0.00002718009,0.00061130134,0.000052077812,0.99771523,0.0015235574,0.000003961019],"about_ca_topic_score_codex":0.0008596232,"about_ca_topic_score_gemma":0.00067960354,"teacher_disagreement_score":0.0071613304,"about_ca_system_score_codex":0.0018742809,"about_ca_system_score_gemma":0.00077233504,"threshold_uncertainty_score":0.023957014},"labels":[],"label_agreement":null},{"id":"W2044637983","doi":"10.1006/jcta.1999.3007","title":"Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Van der Waerden's theorem; Generalization; Mathematics; Clique; Combinatorics; Independent set; Graph; Set (abstract data type); Natural number; Arithmetic progression; Discrete mathematics; Arithmetic; Computer science","score_opus":0.017421382214355567,"score_gpt":0.2850047353484325,"score_spread":0.26758335313407694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044637983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80067843,0.0010113412,0.077044,0.002652914,0.00030565515,0.000111564084,0.0004245978,0.00038865715,0.1173828],"genre_scores_gemma":[0.9601596,0.00058262085,0.01796594,0.0002489785,0.00027230874,0.000164395,0.00032671832,0.000098035445,0.020181457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992335,0.0001909018,0.000043096417,0.00015549378,0.00023089693,0.00014620571],"domain_scores_gemma":[0.9934934,0.0043309843,0.00074048666,0.0003276457,0.00048247084,0.00062502857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011956607,0.00052089896,0.00065925764,0.0032101949,0.003001047,0.0040588905,0.0015123419,0.0013673962,0.007206065],"category_scores_gemma":[0.008545567,0.00080931815,0.0008851881,0.0018566782,0.0035266443,0.0077419057,0.0019448311,0.0027468826,0.0006568563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043292457,0.00003578636,0.00024503632,0.000028342352,0.000004078223,0.00010038447,0.00036691935,0.0010999243,0.00049602374,0.9936706,0.00078862027,0.0031210936],"study_design_scores_gemma":[0.000020437667,0.0000104317805,0.00019432667,0.000012320277,0.000006146944,0.00007924635,0.00008542561,0.0034285423,0.00022845672,0.9948502,0.0010739586,0.00001046141],"about_ca_topic_score_codex":0.0011839111,"about_ca_topic_score_gemma":0.0023565455,"teacher_disagreement_score":0.007206065,"about_ca_system_score_codex":0.0014507365,"about_ca_system_score_gemma":0.0009890947,"threshold_uncertainty_score":0.024106622},"labels":[],"label_agreement":null},{"id":"W2045430869","doi":"10.1016/j.jcta.2014.12.003","title":"Combinatorics of labelled parallelogram polyominoes","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; National Science Foundation","keywords":"Polyomino; Parallelogram; Enumeration; Mathematics; Combinatorics; Connection (principal bundle); Discrete mathematics; Geometry; Computer science","score_opus":0.018793619843996356,"score_gpt":0.28743853764086785,"score_spread":0.2686449177968715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045430869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64471006,0.0006600725,0.09887557,0.003116077,0.0005778743,0.00019879079,0.001330464,0.00047617833,0.25005502],"genre_scores_gemma":[0.9096512,0.0009698115,0.034966763,0.0008309521,0.0005069935,0.0003391966,0.0015907319,0.00034158598,0.05080286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991273,0.00018879375,0.00006856331,0.00017322773,0.0002713227,0.0001707087],"domain_scores_gemma":[0.99824995,0.0007313538,0.00039824896,0.00020860901,0.00014492859,0.0002668491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373853,0.0008572151,0.0011411764,0.0026515357,0.0030067577,0.0061727725,0.0018288714,0.0017823024,0.019805383],"category_scores_gemma":[0.002476479,0.00091833755,0.0011265015,0.0031681077,0.0035196117,0.004923594,0.0029402324,0.002724629,0.0016423357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006529754,0.000043529086,0.0003170995,0.00004365742,0.000009154365,0.00014933961,0.00014586237,0.0015179283,0.00076211855,0.9906358,0.0013976705,0.004912376],"study_design_scores_gemma":[0.000031163618,0.0000116969495,0.00031429084,0.00002346409,0.0000110250485,0.00013555345,0.000114729366,0.003466839,0.00037080224,0.9920284,0.0034773455,0.0000146584225],"about_ca_topic_score_codex":0.0012631062,"about_ca_topic_score_gemma":0.001997206,"teacher_disagreement_score":0.019805383,"about_ca_system_score_codex":0.001784552,"about_ca_system_score_gemma":0.00083583343,"threshold_uncertainty_score":0.06625557},"labels":[],"label_agreement":null},{"id":"W2048141192","doi":"10.1016/j.jcta.2009.12.002","title":"The Non-Commutative Cycle Lemma","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Lemma (botany); Commutative property; Mathematics; Reduction (mathematics); Pure mathematics; Group (periodic table); Commutative ring; Combinatorics; Discrete mathematics; Physics; Geometry; Quantum mechanics","score_opus":0.012126769500237842,"score_gpt":0.2984994572973665,"score_spread":0.28637268779712866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048141192","genre_codex":"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.19196333,0.0070670852,0.35051948,0.014815852,0.0023391144,0.00013846857,0.0010182719,0.00059564476,0.43154278],"genre_scores_gemma":[0.901577,0.0030523129,0.021924088,0.0031668597,0.0019095166,0.00019890505,0.00045167358,0.0003747446,0.06734494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991161,0.00022180227,0.00003740761,0.0002520055,0.00024944157,0.00012323158],"domain_scores_gemma":[0.9960486,0.002175797,0.00029497506,0.0005956097,0.0005702094,0.00031485988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001069947,0.00050819287,0.0010414504,0.0015205612,0.0016836214,0.0026513757,0.0010552664,0.0012650416,0.012974374],"category_scores_gemma":[0.007308986,0.00047770242,0.00080566545,0.0013548182,0.0031749124,0.0063113375,0.002397984,0.0034303227,0.0019341038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013030761,0.000005835698,0.00008420657,0.000014965325,0.000003988731,0.000034404344,0.000042579097,0.00014879234,0.00027421679,0.9950275,0.001903202,0.002447342],"study_design_scores_gemma":[0.000008473143,0.000005280457,0.00013209667,0.0000062977383,0.0000047931094,0.00011332465,0.000013792306,0.0016620061,0.00029017832,0.9937435,0.004012495,0.0000076718825],"about_ca_topic_score_codex":0.0009286909,"about_ca_topic_score_gemma":0.0007346299,"teacher_disagreement_score":0.012974374,"about_ca_system_score_codex":0.00085215166,"about_ca_system_score_gemma":0.000860687,"threshold_uncertainty_score":0.043403625},"labels":[],"label_agreement":null},{"id":"W2048145627","doi":"10.1016/j.jcta.2009.05.001","title":"Avoider–Enforcer: The rules of the game","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Complete graph; Monotonic function; Set (abstract data type); Monotone polygon; Element (criminal law); Mathematical economics; Mathematics; Graph; Combinatorics; Computer science; Law","score_opus":0.005057344982118709,"score_gpt":0.23138600549454463,"score_spread":0.22632866051242592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048145627","genre_codex":"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.15604456,0.00035850453,0.7445896,0.0051036933,0.00029834776,0.0003015245,0.00043736462,0.00043584395,0.092430495],"genre_scores_gemma":[0.88160425,0.00032461007,0.09462499,0.0006767069,0.00014709392,0.00024327503,0.00013982879,0.00020528563,0.02203386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648273,0.0014668683,0.00019347241,0.0007887405,0.00064507534,0.00042308503],"domain_scores_gemma":[0.98533463,0.009836271,0.0010397915,0.0016977506,0.00080291415,0.0012885687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043129693,0.00073813734,0.0015751392,0.00094616786,0.0020921354,0.0062621706,0.0028225994,0.0031184487,0.010333281],"category_scores_gemma":[0.023726912,0.00080046564,0.0009530934,0.0006719394,0.00432729,0.0070642736,0.0022354692,0.0039672717,0.0011652963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001305206,0.0000446354,0.0007384974,0.00005721316,0.000040728642,0.00013233625,0.00026741961,0.00821627,0.001519408,0.97420204,0.0031348018,0.011516097],"study_design_scores_gemma":[0.000041341023,0.000026170213,0.00022309883,0.000012871894,0.000021304497,0.0001258751,0.0000837105,0.060198266,0.0004604572,0.9365501,0.002233361,0.000023467353],"about_ca_topic_score_codex":0.002417127,"about_ca_topic_score_gemma":0.0029654938,"teacher_disagreement_score":0.010333281,"about_ca_system_score_codex":0.0011052723,"about_ca_system_score_gemma":0.0019840496,"threshold_uncertainty_score":0.03456825},"labels":[],"label_agreement":null},{"id":"W2048170084","doi":"10.1016/j.jcta.2009.12.009","title":"A new source of seed pairs for Golay sequences of length <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mn>2</mml:mn><mml:mi>m</mml:mi></mml:msup></mml:math>","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Mathematics; Complementary sequences; Sequence (biology); Phase (matter); Combinatorics; Statistics; Physics; Biology; Genetics","score_opus":0.011752440008418715,"score_gpt":0.2305285340564384,"score_spread":0.21877609404801968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048170084","genre_codex":"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.011017491,0.0005145289,0.9182269,0.00047628593,0.0010929548,0.00037560434,0.0036389984,0.04279898,0.02185825],"genre_scores_gemma":[0.09094388,0.00052462285,0.8474886,0.00028312026,0.0005106906,0.00064770906,0.009842924,0.009013014,0.04074544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901307,0.00013383117,0.0000858293,0.00018828278,0.0005019978,0.00007697197],"domain_scores_gemma":[0.99701357,0.00087645475,0.00014608302,0.0009884695,0.0008442886,0.0001310568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009666925,0.0015774822,0.0008834229,0.003437926,0.0009511608,0.0013698648,0.0017016043,0.001216523,0.034125987],"category_scores_gemma":[0.007921894,0.0009218178,0.00080186385,0.0019464958,0.0004783105,0.0018853596,0.0023032562,0.0017571627,0.025241919],"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.0015099691,0.0003883825,0.0012523356,0.0008122541,0.0000894294,0.0017057202,0.0005600618,0.0073663117,0.065911345,0.12599815,0.088486925,0.70591915],"study_design_scores_gemma":[0.00065967365,0.00064053776,0.0014591195,0.0003618169,0.00014106004,0.0041563357,0.0001005967,0.1402334,0.22664928,0.13470596,0.49056765,0.00032457453],"about_ca_topic_score_codex":0.00047146145,"about_ca_topic_score_gemma":0.00078013254,"teacher_disagreement_score":0.034125987,"about_ca_system_score_codex":0.0007734995,"about_ca_system_score_gemma":0.0011378125,"threshold_uncertainty_score":0.1141628},"labels":[],"label_agreement":null},{"id":"W2049223273","doi":"10.1016/j.jcta.2007.12.003","title":"Partition identities and the coin exchange problem","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partition (number theory); Mathematics; Mathematical economics; Computer science; Combinatorics","score_opus":0.027337613386615944,"score_gpt":0.2756742187194449,"score_spread":0.24833660533282897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049223273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42506057,0.003063585,0.20313692,0.022183957,0.0013445091,0.00015084138,0.0006166034,0.0002751323,0.34416777],"genre_scores_gemma":[0.942122,0.0012124173,0.014199097,0.0009225238,0.0006687439,0.00018086245,0.00028786203,0.00014653393,0.040260028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997929,0.00091024034,0.000086664026,0.0002315126,0.00043340732,0.00040930416],"domain_scores_gemma":[0.9950977,0.0028610446,0.0004382174,0.0007604445,0.00037097724,0.00047164643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002978813,0.0005496693,0.0018061737,0.0015768057,0.0058469884,0.007120333,0.0020078153,0.004744177,0.015258277],"category_scores_gemma":[0.012956267,0.0007478901,0.0011157618,0.002486292,0.006706798,0.0135402605,0.004208414,0.005446492,0.0015655392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009668326,0.0000060874117,0.00002880256,0.0000043378536,0.0000012060785,0.000013900446,0.00004280377,0.00021339889,0.000028417715,0.9985757,0.0004750456,0.00060063874],"study_design_scores_gemma":[0.0000067261403,0.0000012649439,0.000024203706,0.0000041835947,0.0000016489388,0.000016338561,0.000028928893,0.0011229403,0.00002659649,0.9981027,0.0006613786,0.000003148954],"about_ca_topic_score_codex":0.0019140189,"about_ca_topic_score_gemma":0.0015538039,"teacher_disagreement_score":0.015258277,"about_ca_system_score_codex":0.002096243,"about_ca_system_score_gemma":0.0019028236,"threshold_uncertainty_score":0.051044047},"labels":[],"label_agreement":null},{"id":"W2049742021","doi":"10.1016/s0097-3165(03)00048-7","title":"On intervals in some posets of forests","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Factorization; Binary number; Mathematics; Combinatorics; Binary tree; Arithmetic; Algorithm","score_opus":0.022020894112846027,"score_gpt":0.3075137463898115,"score_spread":0.28549285227696547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049742021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6083112,0.0023140644,0.26838782,0.0018273679,0.0004435552,0.00015302275,0.00099305,0.0004554623,0.11711449],"genre_scores_gemma":[0.92250395,0.001400232,0.055159736,0.0004030762,0.0007520211,0.00022815121,0.0010673931,0.00021693886,0.01826858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881554,0.000283284,0.00010385025,0.0002692407,0.0002583969,0.00026974033],"domain_scores_gemma":[0.99562967,0.0026723696,0.0005182391,0.00022944323,0.00027510038,0.00067517615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014103579,0.00084194966,0.0012657468,0.0031550094,0.0034198053,0.005496529,0.0016945332,0.001198367,0.010173249],"category_scores_gemma":[0.004267515,0.0011246969,0.00206676,0.003906421,0.002996069,0.0077989856,0.0025668691,0.003927365,0.0007541551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102145335,0.00006190325,0.0007652993,0.00005125489,0.000015079231,0.00031411534,0.000977274,0.001498739,0.00088713126,0.9888143,0.0009852696,0.005527521],"study_design_scores_gemma":[0.000025622716,0.00003083168,0.000464435,0.000022899161,0.000019356248,0.00023526333,0.00032671675,0.0036591727,0.00028399777,0.9930547,0.0018632002,0.000013954697],"about_ca_topic_score_codex":0.0016711656,"about_ca_topic_score_gemma":0.0017821091,"teacher_disagreement_score":0.010173249,"about_ca_system_score_codex":0.0011545313,"about_ca_system_score_gemma":0.0004978912,"threshold_uncertainty_score":0.03403294},"labels":[],"label_agreement":null},{"id":"W2050823015","doi":"10.1006/jcta.2001.3230","title":"Tree-like Properties of Cycle Factorizations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Combinatorics; Mathematics; Vertex (graph theory); Factorization; Generalization; Tree (set theory); Tuple; Product (mathematics); Degree (music); Class (philosophy); Set (abstract data type); Discrete mathematics; Computer science; Graph; Algorithm; Physics","score_opus":0.010848599789244946,"score_gpt":0.17369882893564886,"score_spread":0.16285022914640393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050823015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7173922,0.00090691226,0.19208144,0.0011976906,0.00016480885,0.00014164984,0.0012532289,0.0005558253,0.08630625],"genre_scores_gemma":[0.96347135,0.00059630675,0.025849896,0.00022082213,0.00016236736,0.0000790687,0.00087880885,0.00015658858,0.008584868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996525,0.000060239938,0.00002102752,0.00009195213,0.00009234099,0.000081914666],"domain_scores_gemma":[0.99677306,0.0017015492,0.00049755035,0.00031278003,0.0003847227,0.00033029163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281021,0.00033708182,0.0005799226,0.0016537713,0.0014559292,0.002783493,0.00051559095,0.00081608345,0.009673486],"category_scores_gemma":[0.0046364097,0.000503714,0.0005093215,0.0016542855,0.0012166799,0.0032883268,0.000715214,0.0011733286,0.00080487976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010899038,0.00005176606,0.0011184749,0.00008101919,0.000012663276,0.0002006878,0.00054559467,0.0028759637,0.004736212,0.97375226,0.0032375008,0.013278849],"study_design_scores_gemma":[0.000022362372,0.000024899278,0.0005968918,0.000022968936,0.000013361488,0.0002590055,0.00017271479,0.011866044,0.00094370014,0.9821708,0.0038907109,0.000016514756],"about_ca_topic_score_codex":0.0011778735,"about_ca_topic_score_gemma":0.00181064,"teacher_disagreement_score":0.009673486,"about_ca_system_score_codex":0.000659515,"about_ca_system_score_gemma":0.00045495623,"threshold_uncertainty_score":0.03236103},"labels":[],"label_agreement":null},{"id":"W2051380353","doi":"10.1006/jcta.2000.3088","title":"Generalized Binomial Coefficients for Molecular Species","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Analytical Chemistry and Chromatography","field":"Chemistry","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Binomial coefficient; Mathematics; Integer (computer science); Combinatorics; Binomial (polynomial); Context (archaeology); Binomial theorem; Polynomial; Gaussian binomial coefficient; Central binomial coefficient; Negative binomial distribution; Type (biology); Discrete mathematics; Mathematical analysis; Statistics; Poisson distribution","score_opus":0.007057883494237132,"score_gpt":0.22621747799479183,"score_spread":0.2191595945005547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051380353","genre_codex":"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.2208283,0.007868405,0.55177176,0.007278505,0.0032360342,0.0003062796,0.00088227494,0.00093908363,0.20688951],"genre_scores_gemma":[0.8387092,0.00590581,0.090662986,0.0018210596,0.0026983088,0.00048395406,0.0006246249,0.00062735734,0.058466736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985145,0.0005643255,0.00007335103,0.00016541721,0.0004539567,0.00022845148],"domain_scores_gemma":[0.99373007,0.003541532,0.00066740596,0.0005085954,0.0008595178,0.00069286884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033283404,0.0015427271,0.0016270354,0.0068688146,0.0017577142,0.003465348,0.0022863322,0.0018210238,0.010386108],"category_scores_gemma":[0.014080172,0.001097029,0.0010672889,0.003589335,0.0043855063,0.0068432237,0.0027163504,0.0038380001,0.0016440182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011017175,0.000010010848,0.000078559,0.000034291683,0.000005080218,0.000038244158,0.00005912468,0.0013234924,0.00025746302,0.99372995,0.0016116872,0.0028410188],"study_design_scores_gemma":[0.000008798913,0.0000048349757,0.000120792014,0.000021853184,0.000006103088,0.00010567172,0.000016215208,0.012258696,0.00013474603,0.9853307,0.0019684953,0.000023054812],"about_ca_topic_score_codex":0.0012230905,"about_ca_topic_score_gemma":0.0015750374,"teacher_disagreement_score":0.010386108,"about_ca_system_score_codex":0.0023455936,"about_ca_system_score_gemma":0.0013010888,"threshold_uncertainty_score":0.034744978},"labels":[],"label_agreement":null},{"id":"W2051748292","doi":"10.1006/jcta.2001.3225","title":"The Largest Small Octagon","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Quadratic growth; Conjecture; Combinatorics; Unit (ring theory); Mathematics; Quadratic equation; Computer science; Geometry; Algorithm; Mathematics education","score_opus":0.019666642754590416,"score_gpt":0.2502709973929753,"score_spread":0.2306043546383849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051748292","genre_codex":"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.38807613,0.0020023657,0.10678275,0.0037617038,0.0014779972,0.00018468825,0.0018815363,0.0011018993,0.49473086],"genre_scores_gemma":[0.84868234,0.00093922275,0.045157097,0.0008118597,0.0002916145,0.000112304806,0.001685796,0.0005634606,0.10175629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997379,0.000040599127,0.000012402196,0.00008154269,0.00007355529,0.000053993197],"domain_scores_gemma":[0.99966264,0.00008986976,0.000030963314,0.00006409992,0.0000694404,0.000082973376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010792897,0.00046332955,0.0007073797,0.00082880544,0.0017879725,0.0024811046,0.0007204466,0.0008043591,0.027791275],"category_scores_gemma":[0.0012330877,0.0004207659,0.00045223162,0.0008189654,0.0013129483,0.0017265051,0.0013919517,0.0018672859,0.004986254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005233211,0.000102123035,0.0012547369,0.00030750263,0.000027172193,0.0004686768,0.0004118275,0.0029984545,0.012599892,0.8326873,0.036786865,0.11183202],"study_design_scores_gemma":[0.00008902894,0.000098361554,0.0010862238,0.00008710013,0.000043085838,0.0007698389,0.0007520666,0.008683192,0.00474275,0.8617042,0.121908344,0.0000358318],"about_ca_topic_score_codex":0.00094952056,"about_ca_topic_score_gemma":0.0014532524,"teacher_disagreement_score":0.027791275,"about_ca_system_score_codex":0.00037522515,"about_ca_system_score_gemma":0.0004538744,"threshold_uncertainty_score":0.09297103},"labels":[],"label_agreement":null},{"id":"W2052391167","doi":"10.1016/j.jcta.2009.03.002","title":"On the asymptotic existence of cocyclic Hadamard matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Hadamard transform; Hadamard matrix; Hadamard's inequality; Hadamard three-lines theorem; Mathematics; Hadamard's maximal determinant problem; Complex Hadamard matrix; Order (exchange); Combinatorics; Hadamard product; Binary number; Matrix (chemical analysis); Hadamard three-circle theorem; Pure mathematics; Arithmetic; Mathematical analysis; Chemistry","score_opus":0.006055257048665549,"score_gpt":0.19579576174781926,"score_spread":0.1897405046991537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052391167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321671,0.0030122695,0.21238934,0.004176154,0.00054211385,0.00008639545,0.0004083163,0.00044211757,0.14677618],"genre_scores_gemma":[0.9784064,0.0008567138,0.011975053,0.00037102288,0.00039357736,0.00005800266,0.00022631085,0.00006995963,0.0076431544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988154,0.00042536916,0.000049905124,0.00016873995,0.0003340057,0.00020661282],"domain_scores_gemma":[0.98035336,0.014142716,0.0010924543,0.001150709,0.0022684997,0.0009922063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016513075,0.00067448965,0.0010575922,0.0028375927,0.0015176667,0.0030897462,0.0014184281,0.0016860925,0.006515159],"category_scores_gemma":[0.027250564,0.00075385446,0.0005652727,0.001779444,0.0033858519,0.003871505,0.0027106549,0.0029094545,0.00063319603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015243923,0.000053415093,0.0009059805,0.00010825984,0.00001894263,0.00019679278,0.00031004468,0.009789477,0.00222907,0.9749536,0.0029092662,0.008372767],"study_design_scores_gemma":[0.000041754836,0.00004938076,0.0006010552,0.00006913064,0.000016633623,0.00037313302,0.00021961254,0.09934558,0.0013759925,0.895944,0.0019191807,0.00004458598],"about_ca_topic_score_codex":0.0013486851,"about_ca_topic_score_gemma":0.0012307914,"teacher_disagreement_score":0.006515159,"about_ca_system_score_codex":0.0013111907,"about_ca_system_score_gemma":0.0009961649,"threshold_uncertainty_score":0.021795332},"labels":[],"label_agreement":null},{"id":"W2053703089","doi":"10.1016/j.jcta.2009.11.009","title":"Annular embeddings of permutations for arbitrary genus","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Permutation (music); Disjoint sets; Genus; Conjugacy class; Distribution (mathematics); Graph; Surface (topology); Discrete mathematics; Geometry; Physics; Mathematical analysis","score_opus":0.022631482739046225,"score_gpt":0.32264862219851426,"score_spread":0.300017139459468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053703089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81413233,0.0008301856,0.07748833,0.0013353123,0.00058539084,0.00005923457,0.00020132925,0.00047218197,0.10489572],"genre_scores_gemma":[0.9661767,0.00060434255,0.0140439905,0.00024354576,0.00024260249,0.00004936846,0.00018912145,0.00023399819,0.018216334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994117,0.00013165124,0.000051282568,0.00010500567,0.00013901904,0.000161362],"domain_scores_gemma":[0.9987753,0.00045666593,0.00014537609,0.00022238182,0.00012917987,0.00027113222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075679226,0.0009261126,0.0007464681,0.0015915706,0.0019318453,0.0036090275,0.0008969337,0.0011604843,0.0068949643],"category_scores_gemma":[0.0026093768,0.0005958186,0.0009288653,0.00097261433,0.0033459282,0.004712821,0.003286919,0.0025055623,0.0011055203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007365008,0.000022562308,0.00036038965,0.00002009928,0.0000045918355,0.00020846249,0.00058335986,0.00039201733,0.0017882946,0.991008,0.00076399295,0.0047746445],"study_design_scores_gemma":[0.000022888784,0.000027835718,0.00058809004,0.000020394882,0.000018083601,0.00030718255,0.00041643067,0.0027506298,0.0007747431,0.9901182,0.0049381563,0.000017304834],"about_ca_topic_score_codex":0.00078255864,"about_ca_topic_score_gemma":0.0010416509,"teacher_disagreement_score":0.0068949643,"about_ca_system_score_codex":0.0009760551,"about_ca_system_score_gemma":0.00039131517,"threshold_uncertainty_score":0.023065984},"labels":[],"label_agreement":null},{"id":"W2054188207","doi":"10.1016/j.jcta.2009.11.008","title":"On cycle systems with specified weak chromatic number","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Combinatorics; Mathematics; Order (exchange); Physics","score_opus":0.0037975787769110926,"score_gpt":0.1871654017250892,"score_spread":0.1833678229481781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054188207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6916661,0.0008429645,0.20370542,0.0019854757,0.00034540516,0.00021481822,0.00073311006,0.00038884775,0.10011777],"genre_scores_gemma":[0.95958185,0.0004334636,0.017271712,0.00026733684,0.0001225229,0.00013733005,0.00037556782,0.00013820849,0.021671971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.00010348074,0.000017742375,0.000077825534,0.0000925902,0.00013399529],"domain_scores_gemma":[0.99734336,0.0013674193,0.00026721205,0.00026653582,0.00035815215,0.00039731906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059260207,0.0008560976,0.0008153364,0.0018253704,0.0019937067,0.0026356094,0.0011040932,0.0014274714,0.011687159],"category_scores_gemma":[0.003930304,0.00053575705,0.00052837137,0.0016642428,0.002106198,0.0032036405,0.0022800341,0.0015504298,0.00074139354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106533145,0.000022348604,0.0003449981,0.000043314154,0.000007138821,0.00006200479,0.00015848281,0.010876566,0.0019408466,0.9813565,0.0017033156,0.0033778795],"study_design_scores_gemma":[0.00003754472,0.000042063533,0.00026666326,0.000028383465,0.000010815952,0.00006779261,0.00016302681,0.07046106,0.001081008,0.92540455,0.0024110442,0.00002605532],"about_ca_topic_score_codex":0.0026647397,"about_ca_topic_score_gemma":0.0040747677,"teacher_disagreement_score":0.011687159,"about_ca_system_score_codex":0.001955356,"about_ca_system_score_gemma":0.001080042,"threshold_uncertainty_score":0.03909743},"labels":[],"label_agreement":null},{"id":"W2056514476","doi":"10.1016/j.jcta.2005.11.005","title":"On the number of factorizations of a full cycle","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Algebraic number; Argument (complex analysis); Product (mathematics); Expression (computer science); Algebraic expression; Combinatorics; Algebra over a field; Pure mathematics; Computer science; Chemistry; Geometry","score_opus":0.014686246693888579,"score_gpt":0.28482919259603057,"score_spread":0.270142945902142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056514476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85908574,0.001751892,0.062219374,0.004447545,0.0005694836,0.00014604273,0.0019987936,0.00044985182,0.06933118],"genre_scores_gemma":[0.96703637,0.0006093919,0.019798344,0.0003576248,0.00038788165,0.00012531599,0.0012339345,0.00012692806,0.010324147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760926,0.00050458993,0.00016615936,0.00061387074,0.00053156744,0.0005745685],"domain_scores_gemma":[0.98019546,0.012165721,0.0019810952,0.0015025111,0.0014402716,0.0027149937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027905286,0.0010011371,0.0016745308,0.0031568964,0.00441742,0.006456567,0.0024060144,0.0026864826,0.018563228],"category_scores_gemma":[0.018861588,0.0010856573,0.0013979452,0.0019201959,0.0048407535,0.010420796,0.0030279083,0.0028402358,0.0014468177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018024648,0.00021669289,0.007244276,0.00036724439,0.00011959891,0.0003163812,0.0009470531,0.010376525,0.006311815,0.92751503,0.011478879,0.03330415],"study_design_scores_gemma":[0.00012769246,0.00013940598,0.0020098072,0.00012092977,0.000091175745,0.0005205854,0.0003964212,0.022788646,0.0017763469,0.9664646,0.0054925764,0.00007173543],"about_ca_topic_score_codex":0.0016329956,"about_ca_topic_score_gemma":0.0018995951,"teacher_disagreement_score":0.018563228,"about_ca_system_score_codex":0.0018674432,"about_ca_system_score_gemma":0.0013553706,"threshold_uncertainty_score":0.06210023},"labels":[],"label_agreement":null},{"id":"W2058026608","doi":"10.1016/j.jcta.2011.10.004","title":"A combinatorial result with applications to self-interacting random walks","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Random walk; Simple (philosophy); Simple random sample; Series (stratigraphy); Mathematics; Combinatorics; Statistical physics; Discrete mathematics; Physics; Statistics; Demography; Population","score_opus":0.029100928343866277,"score_gpt":0.2923464822287513,"score_spread":0.263245553884885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058026608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.114220545,0.005141909,0.74734765,0.009001584,0.0022500332,0.000106334126,0.00042908557,0.00065609685,0.120846815],"genre_scores_gemma":[0.8427285,0.004972899,0.1031868,0.003264795,0.006605749,0.0002729565,0.0007529534,0.00061334553,0.037602063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856514,0.0005937758,0.00010247245,0.00023451209,0.00038357492,0.000120578414],"domain_scores_gemma":[0.9879374,0.008078857,0.0009045876,0.000938291,0.0010234051,0.0011174338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458826,0.001446923,0.0019194448,0.004378631,0.0024643946,0.0048056412,0.0023843993,0.0032604872,0.008182266],"category_scores_gemma":[0.012485653,0.00082044903,0.0023049058,0.0041381535,0.003988054,0.0062712394,0.004257503,0.0034207464,0.0009593579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016252123,0.000040106792,0.0002580276,0.00006259173,0.000017181419,0.0001672226,0.00007760001,0.0037371775,0.0005404806,0.9883945,0.002432693,0.004256262],"study_design_scores_gemma":[0.000011684888,0.000012167697,0.00019495217,0.000011986767,0.000017272587,0.00019125493,0.000030913467,0.036606744,0.000166558,0.96035236,0.0023855283,0.000018508968],"about_ca_topic_score_codex":0.0006687743,"about_ca_topic_score_gemma":0.00079062354,"teacher_disagreement_score":0.008182266,"about_ca_system_score_codex":0.001090873,"about_ca_system_score_gemma":0.0007494429,"threshold_uncertainty_score":0.02737236},"labels":[],"label_agreement":null},{"id":"W2058306224","doi":"10.1016/j.jcta.2010.10.010","title":"A self paired Hopf algebra on double posets and a Littlewood–Richardson rule","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Hopf algebra; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.0366604297994211,"score_gpt":0.2733523688405685,"score_spread":0.2366919390411474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058306224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60481435,0.0011843093,0.124427296,0.0015750177,0.0013671793,0.00013158,0.0002735402,0.00046977884,0.26575702],"genre_scores_gemma":[0.9429516,0.00040723517,0.013390985,0.00033558253,0.000589321,0.000053718533,0.00014250407,0.00010794487,0.042020984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932826,0.00011757693,0.00004179265,0.00015257331,0.0002107416,0.00014906625],"domain_scores_gemma":[0.99939454,0.00012971775,0.00009052002,0.0000693525,0.00009375038,0.00022203849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008134317,0.00093639025,0.0013551436,0.0031931098,0.0035406458,0.0037007208,0.0010828158,0.0014047233,0.008515992],"category_scores_gemma":[0.001252301,0.00067518326,0.0011812858,0.0015776219,0.003845175,0.006061321,0.0027472654,0.0026569283,0.0012242992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002618419,0.000028458011,0.00009429658,0.000014242411,0.000006567608,0.00020790614,0.00015688999,0.00024616113,0.0008935069,0.9960542,0.00033774733,0.0019337786],"study_design_scores_gemma":[0.0000177402,0.00003204175,0.0001659726,0.0000070585284,0.000011072498,0.00025961033,0.00012679225,0.0014112947,0.000719521,0.9951945,0.002032898,0.000021563552],"about_ca_topic_score_codex":0.0006902428,"about_ca_topic_score_gemma":0.0008122958,"teacher_disagreement_score":0.008515992,"about_ca_system_score_codex":0.0010097846,"about_ca_system_score_gemma":0.00060567266,"threshold_uncertainty_score":0.028488815},"labels":[],"label_agreement":null},{"id":"W2060399644","doi":"10.1016/j.jcta.2004.03.004","title":"The peak algebra and the Hecke–Clifford algebras at q=0","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Clifford algebra; Mathematics; Noncommutative geometry; Algebra over a field; Formalism (music); Pure mathematics; Classification of Clifford algebras; Algebra representation; Division algebra; Hecke algebra; Hopf algebra","score_opus":0.013083767121128105,"score_gpt":0.26680467631292404,"score_spread":0.2537209091917959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060399644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6875529,0.002784317,0.058526404,0.0037585285,0.0006782551,0.000065010325,0.00028649083,0.00046464108,0.24588344],"genre_scores_gemma":[0.97463685,0.0005358552,0.0040472625,0.000288128,0.00047484395,0.000021074378,0.000115907314,0.000055346223,0.019824607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962723,0.000058194953,0.00001281414,0.00006109712,0.00010545939,0.00013509535],"domain_scores_gemma":[0.99931264,0.00016715124,0.00010057545,0.0000743382,0.00011964447,0.00022575934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008500257,0.0005504959,0.0007619591,0.002667695,0.0029167426,0.0037020098,0.0013832971,0.0013169766,0.008820646],"category_scores_gemma":[0.0019591118,0.000412929,0.00057655544,0.0017082285,0.0040745568,0.005388275,0.0015730244,0.0019802463,0.0010511361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029225088,0.000016659991,0.00013575506,0.00001409366,0.0000028799104,0.000058313406,0.000106748725,0.0003238103,0.00055307435,0.9960122,0.00055911345,0.0021882027],"study_design_scores_gemma":[0.000011802945,0.0000098604505,0.00022987087,0.000005547588,0.0000029488963,0.00009247047,0.00009238382,0.0013812063,0.0003671678,0.9967769,0.0010178176,0.000012059887],"about_ca_topic_score_codex":0.0028372922,"about_ca_topic_score_gemma":0.002382004,"teacher_disagreement_score":0.008820646,"about_ca_system_score_codex":0.0014857125,"about_ca_system_score_gemma":0.0016820184,"threshold_uncertainty_score":0.029507995},"labels":[],"label_agreement":null},{"id":"W2061558558","doi":"10.1016/j.jcta.2011.03.001","title":"A new perspective on k-triangulations","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Regular polygon; Connection (principal bundle); Mathematics; Perspective (graphical); Simplicial complex; Geometry; Graph","score_opus":0.047996022444638534,"score_gpt":0.31770253718352276,"score_spread":0.26970651473888424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061558558","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.03817849,0.017258648,0.2644332,0.03226204,0.006561717,0.00005683406,0.0007935389,0.00024956884,0.6402061],"genre_scores_gemma":[0.67131466,0.026632285,0.14372107,0.00790713,0.011759638,0.00019374586,0.0008144513,0.0006540126,0.13700299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991535,0.00031016106,0.00005192311,0.0001763411,0.00018635407,0.00012163957],"domain_scores_gemma":[0.9986339,0.00059231,0.00011099438,0.00021046527,0.00025087915,0.0002015415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009208487,0.0010331656,0.0012466682,0.004449871,0.0037113375,0.0054788566,0.00223441,0.0028840853,0.017766962],"category_scores_gemma":[0.0022494914,0.0007126405,0.0010225261,0.0042969617,0.009753511,0.01612479,0.003928516,0.0073033967,0.0025082163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019608835,0.0000013250435,0.000010399975,0.000012518281,6.4115085e-7,0.00001178102,0.00006910262,0.0000834282,0.00003426205,0.99773204,0.0010375705,0.0010049666],"study_design_scores_gemma":[0.0000028888276,0.000003942652,0.000025432148,0.000016712853,0.0000018830706,0.000077961355,0.00015447602,0.00047443755,0.00003446033,0.97762156,0.021581732,0.0000045542743],"about_ca_topic_score_codex":0.001926398,"about_ca_topic_score_gemma":0.0024718835,"teacher_disagreement_score":0.017766962,"about_ca_system_score_codex":0.002493502,"about_ca_system_score_gemma":0.0005967191,"threshold_uncertainty_score":0.05943638},"labels":[],"label_agreement":null},{"id":"W2062529082","doi":"10.1006/jcta.2001.3180","title":"A Generalization of Two q-Identities of Andrews","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fibonacci number; Generalization; Unification; George (robot); Mathematics; Object (grammar); Algebra over a field; Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis; Programming language","score_opus":0.02793526091221507,"score_gpt":0.32375617140830687,"score_spread":0.2958209104960918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062529082","genre_codex":"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.08389967,0.003112314,0.38840327,0.011302704,0.009846519,0.0001770044,0.0006048838,0.0005400314,0.50211364],"genre_scores_gemma":[0.7012134,0.0038465646,0.11633089,0.0044436697,0.0042339177,0.0001543815,0.00042270467,0.000499063,0.16885541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999091,0.0002139501,0.000080199316,0.0002022697,0.00025920154,0.00015347345],"domain_scores_gemma":[0.99907684,0.0002386415,0.000072553274,0.00025231708,0.00020793275,0.00015167169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015729781,0.0007888422,0.0008593975,0.0020287703,0.0032258602,0.0027506133,0.0013717278,0.0017764312,0.017836612],"category_scores_gemma":[0.0038790628,0.00047478775,0.0016436349,0.0019374562,0.004295075,0.009603581,0.0043786494,0.003682884,0.0035452936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007710406,0.00001067163,0.00005624136,0.000015306126,0.0000018410448,0.00006187978,0.00014767627,0.00007050688,0.00021883205,0.9929772,0.0018258496,0.004606187],"study_design_scores_gemma":[0.0000071194686,0.000008803308,0.00010278658,0.000010382928,0.0000045628212,0.00014415564,0.000058556812,0.00052038557,0.00019050733,0.98274785,0.016194427,0.000010488141],"about_ca_topic_score_codex":0.002589633,"about_ca_topic_score_gemma":0.001970312,"teacher_disagreement_score":0.017836612,"about_ca_system_score_codex":0.0014953698,"about_ca_system_score_gemma":0.0013309403,"threshold_uncertainty_score":0.059669375},"labels":[],"label_agreement":null},{"id":"W2063346456","doi":"10.1016/j.jcta.2014.06.003","title":"Measurable events indexed by words","year":2014,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Integer (computer science); Dimension (graph theory); Tree (set theory); Mathematics; Omega; Space (punctuation); Constant (computer programming); Discrete mathematics; Physics; Quantum mechanics","score_opus":0.01850507248785363,"score_gpt":0.27761987846084285,"score_spread":0.2591148059729892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063346456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46702963,0.0025916535,0.3070823,0.0076704784,0.0014711568,0.00020150842,0.0027674597,0.0014532176,0.20973267],"genre_scores_gemma":[0.9483067,0.0010275384,0.018858181,0.00060634076,0.00087522494,0.00018355635,0.0010353695,0.00033003863,0.028777074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727935,0.0007091279,0.00023393045,0.0007316209,0.00063558447,0.00041039824],"domain_scores_gemma":[0.9923159,0.0038334222,0.00088905194,0.0008596737,0.0010715906,0.0010303033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017464678,0.0010232009,0.0012499182,0.004298947,0.0029255257,0.008671496,0.0017512109,0.002180713,0.012485747],"category_scores_gemma":[0.010199442,0.0008633647,0.0012593,0.0034373738,0.0043717576,0.014551447,0.0034459974,0.0036228967,0.0013939396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002770423,0.000021163782,0.00021686639,0.000023664774,0.000006977737,0.000082970655,0.0001875448,0.00019059198,0.0003415158,0.9963966,0.00062175945,0.0018827149],"study_design_scores_gemma":[0.0000084448875,0.000005884534,0.00013149745,0.000009980999,0.0000071400946,0.00011992028,0.000087250846,0.0015362155,0.00036013333,0.9958605,0.0018638675,0.000009121848],"about_ca_topic_score_codex":0.00063845475,"about_ca_topic_score_gemma":0.00045572015,"teacher_disagreement_score":0.012485747,"about_ca_system_score_codex":0.0019488584,"about_ca_system_score_gemma":0.0007663735,"threshold_uncertainty_score":0.041768968},"labels":[],"label_agreement":null},{"id":"W2064465307","doi":"10.1016/j.jcta.2008.08.007","title":"Distributive lattices of small width, II: A problem from Stanley's 1986 text Enumerative Combinatorics","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Combinatorics; Cardinality (data modeling); Distributive property; Partially ordered set; Mathematics; Enumerative combinatorics; Order (exchange); Extremal combinatorics; Algebraic combinatorics; Generating function; Distributive lattice; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.009677406249627167,"score_gpt":0.22997294305811897,"score_spread":0.2202955368084918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064465307","genre_codex":"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.16682571,0.0035526636,0.7202256,0.042779826,0.0011162562,0.00035475186,0.0016596534,0.0018256631,0.06165987],"genre_scores_gemma":[0.74219334,0.0021138228,0.21613005,0.0032681536,0.0016913058,0.00046486454,0.001310175,0.0010837634,0.03174452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974177,0.00064883544,0.00024687592,0.0007365933,0.0006691598,0.00028087787],"domain_scores_gemma":[0.9761431,0.017488599,0.0007781261,0.0032661292,0.0012026893,0.001121412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036158983,0.0006549519,0.0018035595,0.0012359587,0.004444559,0.0056522302,0.0028862928,0.0028808124,0.008503697],"category_scores_gemma":[0.026572458,0.0013082774,0.0014386765,0.0029552884,0.0065648905,0.020852312,0.0059538935,0.007143966,0.0016978314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030314672,0.00014159072,0.0014462356,0.00023537893,0.000020176012,0.00020060636,0.0015128598,0.0021491137,0.0023106008,0.88488865,0.015087758,0.091703825],"study_design_scores_gemma":[0.000044402008,0.000022645107,0.00020747636,0.000034187124,0.000016344839,0.0002509904,0.0005491126,0.0048742862,0.0023004985,0.98040533,0.011271854,0.000022749287],"about_ca_topic_score_codex":0.0014562252,"about_ca_topic_score_gemma":0.0012783324,"teacher_disagreement_score":0.008503697,"about_ca_system_score_codex":0.0016031029,"about_ca_system_score_gemma":0.0020256909,"threshold_uncertainty_score":0.028447747},"labels":[],"label_agreement":null},{"id":"W2064723783","doi":"10.1016/j.jcta.2009.04.007","title":"Coloring axis-parallel rectangles","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Point (geometry); Construct (python library); Mathematics; Plane (geometry); Computer science; Geometry","score_opus":0.00995740381703517,"score_gpt":0.23863102350545598,"score_spread":0.22867361968842081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064723783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.26221415,0.0004681633,0.60719705,0.00058229704,0.0006456631,0.00034762517,0.0015135402,0.0025951616,0.12443639],"genre_scores_gemma":[0.51637566,0.0006491391,0.4395104,0.00028639653,0.000107893306,0.000245049,0.0023301723,0.0012090757,0.039286293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942964,0.0001177628,0.000028278466,0.00013983411,0.0001396931,0.00014481634],"domain_scores_gemma":[0.9989141,0.00027525506,0.00008548067,0.00036274706,0.00022882165,0.00013356165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003755082,0.0007820312,0.0006287867,0.0009100677,0.0011213148,0.0016685535,0.0014126127,0.00063429837,0.02072809],"category_scores_gemma":[0.0013890464,0.00072150916,0.00063913054,0.0015978378,0.0006214091,0.0013694462,0.0015114235,0.001221606,0.003471413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012692951,0.00044109687,0.0030733324,0.0005162228,0.00009670748,0.0005323332,0.00058517966,0.08077762,0.09116288,0.46489307,0.05369875,0.30295345],"study_design_scores_gemma":[0.0004013363,0.00043699023,0.0032963364,0.00013423263,0.000137907,0.0010860553,0.0010953624,0.3514215,0.09172221,0.45071527,0.099454656,0.00009823114],"about_ca_topic_score_codex":0.0019214583,"about_ca_topic_score_gemma":0.0032453046,"teacher_disagreement_score":0.02072809,"about_ca_system_score_codex":0.0007798928,"about_ca_system_score_gemma":0.0005214474,"threshold_uncertainty_score":0.069342315},"labels":[],"label_agreement":null},{"id":"W2065215403","doi":"10.1016/j.jcta.2004.01.007","title":"Bose–Mesner algebras attached to invertible Jones pairs","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Council","keywords":"Invertible matrix; Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.023113355523870952,"score_gpt":0.2860101398870554,"score_spread":0.2628967843631845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065215403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71516454,0.0007164413,0.058733758,0.0015854855,0.00067170925,0.00010268847,0.00018747326,0.00042456752,0.22241332],"genre_scores_gemma":[0.9435003,0.00058617204,0.008823699,0.0004417782,0.0006301402,0.000073122996,0.00018261973,0.00011589189,0.045646265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992605,0.00014178938,0.000038176804,0.00011658028,0.0002462893,0.00019664831],"domain_scores_gemma":[0.9992317,0.00019851747,0.00016174458,0.000118935845,0.00008139095,0.00020769802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613335,0.0010803507,0.0013070891,0.0026624722,0.0030975419,0.0043377397,0.0011891072,0.0017965117,0.012041644],"category_scores_gemma":[0.0017554465,0.00078826403,0.0008471778,0.0019917483,0.0036538683,0.0055427505,0.002793213,0.0030605812,0.0017301694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002282895,0.000028642551,0.00011676384,0.000010198897,0.0000039507327,0.000073979485,0.00013146704,0.00031515054,0.00066662993,0.9967494,0.0004091614,0.0014718599],"study_design_scores_gemma":[0.000024846513,0.000017855187,0.00025695033,0.0000067168266,0.000010381578,0.00012480625,0.00010943795,0.0024351003,0.0007924809,0.9939972,0.002205709,0.00001841707],"about_ca_topic_score_codex":0.0007653211,"about_ca_topic_score_gemma":0.00086424703,"teacher_disagreement_score":0.012041644,"about_ca_system_score_codex":0.0011351672,"about_ca_system_score_gemma":0.0006687253,"threshold_uncertainty_score":0.040283382},"labels":[],"label_agreement":null},{"id":"W2066106400","doi":"10.1016/j.jcta.2013.01.010","title":"Advances in the merit factor problem for binary sequences","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Binary number; Skew; Conjecture; Figure of merit; Aperiodic graph; Combinatorics; Complementary sequences; Binary Golay code; Pseudorandom binary sequence; Autocorrelation; Discrete mathematics; Algorithm; Statistics; Computer science; Arithmetic","score_opus":0.010201449082750266,"score_gpt":0.24430902632471282,"score_spread":0.23410757724196257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066106400","genre_codex":"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.19492188,0.03627871,0.55285186,0.033076502,0.0029927942,0.00013241889,0.0006673949,0.00047169795,0.17860682],"genre_scores_gemma":[0.7407066,0.022417793,0.18922658,0.0016941914,0.007993495,0.00017191288,0.000714446,0.000451864,0.03662311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.000539401,0.00007434345,0.0003083496,0.0005058609,0.00021295255],"domain_scores_gemma":[0.9893321,0.008399495,0.00044883747,0.00080152013,0.00066691404,0.0003511437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038428232,0.0012222072,0.002237095,0.002168085,0.0015677402,0.0043287245,0.0022154779,0.003361578,0.0062978077],"category_scores_gemma":[0.021522501,0.0006921646,0.0010597873,0.0033711193,0.0037584421,0.01074852,0.0024535062,0.0058939788,0.0012319665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015588189,0.00005021457,0.00030928114,0.00015243814,0.000013612251,0.000052752297,0.000113089176,0.010601299,0.0006484187,0.9439059,0.0070034657,0.0369936],"study_design_scores_gemma":[0.000030733976,0.00002591931,0.0001103969,0.000039513183,0.000009565739,0.00007101792,0.000036497604,0.038954634,0.00031225875,0.95299697,0.0073970277,0.000015456035],"about_ca_topic_score_codex":0.0015043233,"about_ca_topic_score_gemma":0.001245689,"teacher_disagreement_score":0.0062978077,"about_ca_system_score_codex":0.0033457044,"about_ca_system_score_gemma":0.0016813332,"threshold_uncertainty_score":0.024274826},"labels":[],"label_agreement":null},{"id":"W2066934281","doi":"10.1016/j.jcta.2013.09.005","title":"Non-D-finite excursions in the quarter plane","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Invertible matrix; Combinatorics; Plane (geometry); Finite set; Sequence (biology); Polynomial; Generating function; Point (geometry); Quarter (Canadian coin); Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.01739643027986382,"score_gpt":0.27716853887648824,"score_spread":0.2597721085966244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066934281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8312221,0.0006109383,0.048386637,0.0010741343,0.00029662292,0.000041476975,0.00022057278,0.00028958896,0.11785787],"genre_scores_gemma":[0.96565187,0.0003226021,0.0070192083,0.00022374696,0.00017472541,0.000028442219,0.00022585652,0.00011403424,0.026239444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996897,0.00005729172,0.00002212216,0.000056382083,0.00009092932,0.00008350186],"domain_scores_gemma":[0.9990927,0.00026989396,0.00019186591,0.00010197524,0.00011628203,0.000227288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030873518,0.0007305107,0.0006865348,0.002014553,0.001209141,0.0021002477,0.0010145241,0.00106832,0.0089499075],"category_scores_gemma":[0.0020563898,0.0003086466,0.00058129546,0.0007108675,0.0020548746,0.0021166801,0.0014974888,0.0017417313,0.0011562261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014785214,0.000045182667,0.0006517893,0.000033995322,0.000012573581,0.0004797711,0.00015339276,0.0024874667,0.0027086989,0.984106,0.0012956156,0.007877688],"study_design_scores_gemma":[0.00005348601,0.00006669386,0.0010799357,0.000032279102,0.0000124435155,0.0008964382,0.0003163224,0.023991963,0.0017905656,0.9670752,0.0046568695,0.000027702039],"about_ca_topic_score_codex":0.0008926475,"about_ca_topic_score_gemma":0.0005752718,"teacher_disagreement_score":0.0089499075,"about_ca_system_score_codex":0.0007935101,"about_ca_system_score_gemma":0.00027925486,"threshold_uncertainty_score":0.029940426},"labels":[],"label_agreement":null},{"id":"W2067182672","doi":"10.1016/j.jcta.2008.01.009","title":"A bound on the size of separating hash families","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Hash function; Upper and lower bounds; Perfect hash function; Collision resistance; Mathematics; Double hashing; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Hash table; Computer security","score_opus":0.014942243950462786,"score_gpt":0.22755504918899902,"score_spread":0.21261280523853623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067182672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4635905,0.0070375414,0.3825158,0.032385264,0.0014105511,0.00066758896,0.008011056,0.0057046693,0.09867699],"genre_scores_gemma":[0.8937762,0.0031156468,0.07309836,0.0029904875,0.0021558346,0.0007192748,0.0035454072,0.0016761547,0.018922593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98883563,0.0028417092,0.0005804352,0.0020741217,0.0036559151,0.0020121832],"domain_scores_gemma":[0.8155756,0.14677525,0.0042173523,0.02367195,0.0041000247,0.0056597446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009476398,0.0027516638,0.005011038,0.002992382,0.0043196976,0.01038927,0.008009379,0.007275058,0.021908175],"category_scores_gemma":[0.08348447,0.003606633,0.0036307406,0.0041007763,0.008424032,0.03299,0.013364822,0.010734059,0.0040930156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008554377,0.0011005637,0.009308026,0.0015877639,0.00058790337,0.00072595617,0.0017417426,0.10290237,0.03632971,0.6835085,0.048569698,0.105083354],"study_design_scores_gemma":[0.0005335941,0.00036816977,0.0016718137,0.0002035416,0.000324705,0.0007546019,0.00023813406,0.18103154,0.0125914,0.79405856,0.008037274,0.00018662235],"about_ca_topic_score_codex":0.0009388904,"about_ca_topic_score_gemma":0.0009104282,"teacher_disagreement_score":0.021908175,"about_ca_system_score_codex":0.005698424,"about_ca_system_score_gemma":0.004540442,"threshold_uncertainty_score":0.07329011},"labels":[],"label_agreement":null},{"id":"W2069076235","doi":"10.1016/j.jcta.2013.05.006","title":"Average mixing of continuous quantum walks","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Kempe Foundation","keywords":"Combinatorics; Adjacency matrix; Mathematics; Valency; Mixing (physics); Matrix (chemical analysis); Discrete mathematics; Quantum walk; Graph; Quantum; Quantum algorithm; Physics; Quantum mechanics","score_opus":0.004749944518514823,"score_gpt":0.2049384801558578,"score_spread":0.20018853563734298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069076235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74833167,0.00076350267,0.21871941,0.0014554727,0.00024239259,0.0000718116,0.00030122118,0.0005936244,0.02952079],"genre_scores_gemma":[0.98315984,0.0002078221,0.01019827,0.00015979164,0.0001604478,0.000054950913,0.00017974256,0.0001296917,0.005749445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881893,0.00039896512,0.000050900857,0.00023736664,0.00027881595,0.00021499537],"domain_scores_gemma":[0.9933897,0.0037083705,0.00050265796,0.00084478216,0.00047830123,0.0010761531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020613738,0.0007362591,0.0016982856,0.0025038992,0.0017405148,0.003926714,0.0022899746,0.0026842454,0.0076355515],"category_scores_gemma":[0.011484897,0.001022338,0.0010128374,0.0011549481,0.0032158955,0.0057098446,0.002458979,0.002736713,0.00059069437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015432201,0.00007885012,0.00060015556,0.000049056176,0.00004122695,0.00009367899,0.00014812792,0.01920704,0.002727677,0.97241455,0.0007989642,0.0036863484],"study_design_scores_gemma":[0.00003620316,0.000045681274,0.0005254341,0.000020707332,0.00001861863,0.00007765217,0.0000659695,0.23950955,0.0008900623,0.7582654,0.0005069109,0.000037834216],"about_ca_topic_score_codex":0.00089318864,"about_ca_topic_score_gemma":0.0009519396,"teacher_disagreement_score":0.0076355515,"about_ca_system_score_codex":0.0014382929,"about_ca_system_score_gemma":0.00065930287,"threshold_uncertainty_score":0.02554351},"labels":[],"label_agreement":null},{"id":"W2069955765","doi":"10.1006/jcta.2001.3246","title":"Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Suzhou University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Group (periodic table); Type (biology); Mathematics; Block (permutation group theory); Combinatorics; Block size; Spectrum (functional analysis); Physics; Computer science; Biology","score_opus":0.01417728954953936,"score_gpt":0.1983650972140626,"score_spread":0.18418780766452322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069955765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6738259,0.000566176,0.2791271,0.001034466,0.00012569217,0.00032046778,0.0003447176,0.0010372523,0.04361825],"genre_scores_gemma":[0.9070809,0.000180291,0.08649848,0.0001796604,0.00005261729,0.000232243,0.00011276041,0.000051849383,0.005611176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986156,0.00060495746,0.000078971665,0.00016784377,0.00022898594,0.00030362426],"domain_scores_gemma":[0.99400324,0.0022494665,0.0011244792,0.0017211997,0.00048131045,0.00042025765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020762228,0.0007695738,0.00081763865,0.0012144962,0.0010830433,0.0012771776,0.00095713895,0.0013947543,0.0050376477],"category_scores_gemma":[0.0084911585,0.00058319815,0.00040588784,0.0010914884,0.0010918675,0.0016475705,0.0013535841,0.0009702053,0.0010628134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0059367395,0.0004240086,0.009371364,0.0005081729,0.00015151112,0.0009434575,0.0007551299,0.051915374,0.09610306,0.69759333,0.0055093192,0.13078858],"study_design_scores_gemma":[0.0015473691,0.003937341,0.003831116,0.0002301656,0.00025892977,0.0028600257,0.00038025164,0.18436782,0.123490706,0.6526418,0.026289374,0.00016515086],"about_ca_topic_score_codex":0.00024239733,"about_ca_topic_score_gemma":0.0004997272,"teacher_disagreement_score":0.0050376477,"about_ca_system_score_codex":0.00079716544,"about_ca_system_score_gemma":0.00094402255,"threshold_uncertainty_score":0.016852558},"labels":[],"label_agreement":null},{"id":"W2070651047","doi":"10.1016/j.jcta.2003.09.004","title":"Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection; Ballot; Reflection (computer programming); Mathematics; Integer (computer science); Rotation (mathematics); Mathematical proof; Combinatorics; Boundary (topology); Geometry; Mathematical analysis; Law; Computer science; Political science","score_opus":0.03903225595970209,"score_gpt":0.3060320941221698,"score_spread":0.2669998381624677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070651047","genre_codex":"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.11823594,0.0009956154,0.48059154,0.0133563215,0.002073727,0.0000777898,0.00021280699,0.0009198704,0.38353634],"genre_scores_gemma":[0.8244046,0.0011994396,0.11057385,0.0035117622,0.0016574814,0.00015972264,0.00023990954,0.0013314352,0.05692184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874383,0.0003570201,0.000057108613,0.00034995115,0.00028709046,0.00020496974],"domain_scores_gemma":[0.99802774,0.00046656653,0.0001506889,0.00096621923,0.00019264876,0.00019603818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961162,0.0009482454,0.0013155794,0.00095560175,0.0023140428,0.0052472926,0.0024522124,0.0032300332,0.0089239],"category_scores_gemma":[0.0074809105,0.00079737365,0.0014065566,0.0005675526,0.0080831945,0.014238762,0.0049164393,0.008221466,0.0025557664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001201267,0.000006271692,0.00003286896,0.000012525519,0.0000028517195,0.000031004973,0.00007854796,0.00020043335,0.0005617838,0.9968172,0.0007277521,0.0015167752],"study_design_scores_gemma":[0.00001335487,0.000007826075,0.000030316409,0.000008606056,0.0000027346637,0.00006163203,0.00004262796,0.0014436176,0.00032512587,0.9958996,0.002157774,0.0000067430246],"about_ca_topic_score_codex":0.00048674765,"about_ca_topic_score_gemma":0.0005088511,"teacher_disagreement_score":0.0089239,"about_ca_system_score_codex":0.0007418306,"about_ca_system_score_gemma":0.00075987406,"threshold_uncertainty_score":0.029853404},"labels":[],"label_agreement":null},{"id":"W2071136805","doi":"10.1016/j.jcta.2008.06.006","title":"Computing a pyramid partition generating function with dimer shuffling","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Shuffling; Conjecture; Partition function (quantum field theory); Pyramid (geometry); Conifold; Domino; Mathematics; Partition (number theory); Combinatorics; Generating function; Singularity; Discrete mathematics; Pure mathematics; Geometry; Mathematical physics; Physics","score_opus":0.028966344436302603,"score_gpt":0.2702389285313033,"score_spread":0.24127258409500071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071136805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56075346,0.0001886425,0.397645,0.0005523928,0.00023571264,0.00016430876,0.0007167061,0.0032240413,0.036519703],"genre_scores_gemma":[0.8782394,0.00007871104,0.11593002,0.00015690447,0.00005203772,0.00009395195,0.00081396423,0.0003785197,0.0042565805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976057,0.000042134754,0.000009337486,0.00005011984,0.00007799028,0.000059963288],"domain_scores_gemma":[0.9995689,0.00016032276,0.000026979824,0.00011737946,0.00006107933,0.00006535269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000508821,0.000692987,0.001102052,0.0013779282,0.0009802436,0.0014849791,0.0014971308,0.0011551925,0.008009728],"category_scores_gemma":[0.001459975,0.00041428948,0.0007821513,0.0012490739,0.0008827098,0.0025899247,0.00151,0.00094762945,0.001340104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007501401,0.00050235033,0.0033275445,0.00029696172,0.00009961629,0.00057867495,0.00029633974,0.22202446,0.020810368,0.50019675,0.021364965,0.22975181],"study_design_scores_gemma":[0.00008015384,0.00008819429,0.00040312595,0.000010771101,0.000024472833,0.000095926924,0.00008632826,0.6460697,0.0071597667,0.34404558,0.0019097098,0.00002625672],"about_ca_topic_score_codex":0.00091691717,"about_ca_topic_score_gemma":0.0020732533,"teacher_disagreement_score":0.008009728,"about_ca_system_score_codex":0.00081733754,"about_ca_system_score_gemma":0.00083289575,"threshold_uncertainty_score":0.026795208},"labels":[],"label_agreement":null},{"id":"W2071880022","doi":"10.1016/j.jcta.2012.04.001","title":"Co-quasi-invariant spaces for generalized symmetric groups","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Invariant (physics); Quotient; Pure mathematics; Symmetric group; Diagonal; Permutation (music); Symmetric function; Combinatorics; Mathematical physics","score_opus":0.026905456412873223,"score_gpt":0.3115081288469948,"score_spread":0.2846026724341216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071880022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75674576,0.0017651089,0.12298453,0.0034612885,0.0010084814,0.00009824596,0.00039476922,0.00041815004,0.11312367],"genre_scores_gemma":[0.9677068,0.0006215069,0.009301011,0.00032247443,0.00074024225,0.00006869794,0.00028325294,0.00008271504,0.020873345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990821,0.00021175409,0.00006126107,0.00016796445,0.00026045725,0.00021654861],"domain_scores_gemma":[0.99844486,0.000437162,0.00025087228,0.00018695966,0.00021149353,0.00046860444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016103465,0.0012123592,0.0010074548,0.0035551197,0.0028699124,0.0047366796,0.0011664757,0.0011831186,0.008429247],"category_scores_gemma":[0.0016838064,0.00053577416,0.001151007,0.0019519067,0.0047170594,0.005688614,0.002682233,0.0026167575,0.0007248593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017307455,0.00001548189,0.00012295028,0.000008587779,0.0000048949987,0.000039535254,0.00014597784,0.0001458626,0.00043507447,0.9977456,0.00020135433,0.0011173391],"study_design_scores_gemma":[0.000019936198,0.0000231902,0.0002665519,0.000004773694,0.000009120608,0.000064252796,0.00013432771,0.0014659,0.00030702972,0.9962894,0.001404745,0.000010837883],"about_ca_topic_score_codex":0.0017636509,"about_ca_topic_score_gemma":0.0019196019,"teacher_disagreement_score":0.008429247,"about_ca_system_score_codex":0.0017776154,"about_ca_system_score_gemma":0.0009484889,"threshold_uncertainty_score":0.02819866},"labels":[],"label_agreement":null},{"id":"W2074881723","doi":"10.1016/j.jcta.2010.11.005","title":"Relatively prime polynomials and nonsingular Hankel matrices over finite fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Invertible matrix; Hankel matrix; Coprime integers; Monic polynomial; Finite field; Rank (graph theory); Prime (order theory); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Polynomial; Mathematical analysis","score_opus":0.005469718997047604,"score_gpt":0.22236128612609604,"score_spread":0.21689156712904845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074881723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8308273,0.0020347794,0.092129394,0.0034048208,0.00051278167,0.00007415791,0.0003113328,0.00026072038,0.07044478],"genre_scores_gemma":[0.9781001,0.0008224187,0.005659551,0.0002520385,0.00064546964,0.000026144737,0.00011113776,0.000035233836,0.0143479565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927706,0.00020475125,0.000027399696,0.00011795949,0.00020833075,0.00016449747],"domain_scores_gemma":[0.9974439,0.0013582704,0.0005232605,0.00025516836,0.00017664902,0.00024267685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008864627,0.00080414605,0.000809948,0.0015354698,0.0016333518,0.0028306637,0.0006816552,0.0010840648,0.00746313],"category_scores_gemma":[0.0034763026,0.00059458363,0.00045979983,0.0019075386,0.0032139092,0.0052435156,0.0014880458,0.0028554124,0.0009163805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008678375,0.000044181477,0.00023590201,0.0000252765,0.0000057484344,0.00018692468,0.00026661542,0.0012184662,0.0011195085,0.99184024,0.00068093254,0.0042894324],"study_design_scores_gemma":[0.000026185098,0.000034899,0.00024494977,0.000008353655,0.000006619841,0.00020396798,0.00009463752,0.0044257874,0.000795638,0.99272025,0.0014218478,0.000016802838],"about_ca_topic_score_codex":0.00053655275,"about_ca_topic_score_gemma":0.00062738714,"teacher_disagreement_score":0.00746313,"about_ca_system_score_codex":0.0010825564,"about_ca_system_score_gemma":0.00072516984,"threshold_uncertainty_score":0.024966657},"labels":[],"label_agreement":null},{"id":"W2081918372","doi":"10.1016/j.jcta.2008.01.005","title":"Bounds on some van der Waerden numbers","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics","score_opus":0.022948755705174434,"score_gpt":0.27580125580153364,"score_spread":0.2528525000963592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081918372","genre_codex":"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.24090144,0.016117094,0.17580813,0.016997501,0.0027310073,0.00014923078,0.0010389304,0.0007088482,0.54554796],"genre_scores_gemma":[0.85419357,0.008180432,0.03800321,0.001604982,0.0018119552,0.00048614107,0.00088359497,0.0006097904,0.094226316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971372,0.00066770293,0.00015840311,0.00057814585,0.0008836027,0.0005749493],"domain_scores_gemma":[0.9836548,0.012463094,0.0007450354,0.0010264482,0.0010266459,0.0010839623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038502084,0.002187275,0.0019017045,0.0076699746,0.003955287,0.008040882,0.0049059107,0.0025885284,0.020197375],"category_scores_gemma":[0.024101669,0.001364434,0.0014922894,0.005313846,0.005725226,0.017791586,0.0057137874,0.00931189,0.0032810331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010948282,0.000042899366,0.00026764686,0.00010635825,0.000024236315,0.00007922666,0.00035918958,0.0023096325,0.0008056617,0.98170865,0.0035107785,0.0106762415],"study_design_scores_gemma":[0.000012919079,0.00001633039,0.00028226574,0.000072672505,0.00003692809,0.00009748714,0.00008186029,0.007160411,0.00064784155,0.98470795,0.0068533625,0.00003006358],"about_ca_topic_score_codex":0.0016886991,"about_ca_topic_score_gemma":0.002675953,"teacher_disagreement_score":0.020197375,"about_ca_system_score_codex":0.0038169483,"about_ca_system_score_gemma":0.0011470792,"threshold_uncertainty_score":0.06756693},"labels":[],"label_agreement":null},{"id":"W2084593271","doi":"10.1016/j.jcta.2003.12.004","title":"Polynomial versus exponential growth in repetition-free binary words","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exponential growth; Binary number; Mathematics; Exponential function; Polynomial; Repetition (rhetorical device); Combinatorics; Discrete mathematics; Exponential polynomial; Arithmetic; Mathematical analysis","score_opus":0.007989040553793911,"score_gpt":0.22204206467397514,"score_spread":0.21405302412018123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084593271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.834541,0.0015053896,0.1137201,0.0043477425,0.00022673598,0.00007046659,0.0005966977,0.00082681736,0.04416498],"genre_scores_gemma":[0.97616756,0.0005575229,0.0101158945,0.0002420352,0.00034471604,0.000062288505,0.00023079201,0.00021278877,0.0120664695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980094,0.00050843984,0.00011147706,0.00033296362,0.0005388517,0.0004989889],"domain_scores_gemma":[0.9518539,0.039346844,0.0021321285,0.0028378495,0.0022059376,0.0016234089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023433496,0.0005858171,0.00093188713,0.0015555434,0.0014197971,0.004008056,0.0016196959,0.0013295651,0.009559363],"category_scores_gemma":[0.029917177,0.0007396667,0.0007625329,0.0015490205,0.0036115563,0.009077644,0.002267141,0.0024637063,0.0014071019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072141265,0.00009463417,0.0025511794,0.00015804078,0.000014366198,0.0003587131,0.0012002271,0.014749254,0.005429684,0.9520447,0.002804898,0.019872893],"study_design_scores_gemma":[0.000055437285,0.00005962398,0.00079398474,0.000033396616,0.000026220507,0.00033818933,0.0001928121,0.051287938,0.0033162253,0.9419506,0.001908406,0.00003705705],"about_ca_topic_score_codex":0.0015211231,"about_ca_topic_score_gemma":0.0015386648,"teacher_disagreement_score":0.009559363,"about_ca_system_score_codex":0.0016399606,"about_ca_system_score_gemma":0.0013307432,"threshold_uncertainty_score":0.031979263},"labels":[],"label_agreement":null},{"id":"W2085908617","doi":"10.1016/s0097-3165(03)00118-3","title":"Boolean and ternary complementary pairs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Ternary operation; Combinatorics; Converse; Autocorrelation; Discrete mathematics; Product (mathematics); Zero (linguistics); Complementary sequences; Computer science; Statistics","score_opus":0.005821087705566269,"score_gpt":0.1904102313786939,"score_spread":0.18458914367312762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085908617","genre_codex":"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.25913692,0.0024784491,0.14481618,0.003574628,0.0012714104,0.00011892302,0.0009985222,0.0003595602,0.5872454],"genre_scores_gemma":[0.9166442,0.0011000803,0.02920009,0.001056121,0.0006159867,0.00014424961,0.00054626924,0.00012470412,0.050568253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00021419501,0.000037348236,0.0001338025,0.00020396338,0.00014276085],"domain_scores_gemma":[0.9976788,0.00137164,0.00019270707,0.00014662983,0.00039888575,0.00021140625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663291,0.00048171126,0.00061139767,0.0026505121,0.0021340083,0.0045316787,0.0005570527,0.00111313,0.018831702],"category_scores_gemma":[0.0050743697,0.00040210577,0.00061690866,0.0019575786,0.0019976546,0.00374733,0.0016351965,0.0014572234,0.0016035235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020943478,0.000008393606,0.000077477984,0.000015441414,0.000002622742,0.000045746117,0.000065457774,0.00012863324,0.00033650463,0.9941004,0.0012500606,0.003948236],"study_design_scores_gemma":[0.000010314904,0.000007729235,0.00012690896,0.000023162012,0.000014731477,0.00022179841,0.00009550509,0.002198344,0.0010364583,0.9881777,0.008075638,0.000011573272],"about_ca_topic_score_codex":0.00095924316,"about_ca_topic_score_gemma":0.0011739575,"teacher_disagreement_score":0.018831702,"about_ca_system_score_codex":0.001240237,"about_ca_system_score_gemma":0.0007794912,"threshold_uncertainty_score":0.062998295},"labels":[],"label_agreement":null},{"id":"W2085975956","doi":"10.1016/j.jcta.2015.02.006","title":"Differential calculus on graphon space","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; UPS Foundation; National Science Foundation","keywords":"Homomorphism; Mathematics; Combinatorics; Multigraph; Discrete mathematics; Graph","score_opus":0.0310953572690605,"score_gpt":0.28821467349880814,"score_spread":0.25711931622974765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085975956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4954802,0.00478867,0.1775839,0.010624886,0.002170221,0.00009901889,0.00048603246,0.0005136271,0.30825347],"genre_scores_gemma":[0.91962814,0.0017642633,0.01493736,0.0009684233,0.0012704544,0.00007355087,0.00018472287,0.000195032,0.060977995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00023346617,0.00004057138,0.00015886671,0.0002842008,0.00015118426],"domain_scores_gemma":[0.9987239,0.00041618908,0.00014303574,0.000090008696,0.00023527973,0.0003916207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010940139,0.0010740509,0.0014047815,0.005696382,0.0035890124,0.004954531,0.001621465,0.0017209576,0.008342301],"category_scores_gemma":[0.0023192645,0.0006086851,0.0010106676,0.00318871,0.005580735,0.008510683,0.0035264164,0.0028233551,0.0006465153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032506775,0.0000066247576,0.0000355738,0.0000052989467,0.0000017525775,0.00001915804,0.0000912776,0.000099074095,0.00009637857,0.9988374,0.00021678275,0.000587439],"study_design_scores_gemma":[0.000004373444,0.0000042395263,0.00007197307,0.0000042480738,0.0000034012087,0.00004012286,0.00004760043,0.0009896978,0.000063274245,0.99722916,0.0015364245,0.000005390192],"about_ca_topic_score_codex":0.0025985169,"about_ca_topic_score_gemma":0.0028130931,"teacher_disagreement_score":0.008342301,"about_ca_system_score_codex":0.0038770041,"about_ca_system_score_gemma":0.001068458,"threshold_uncertainty_score":0.028129756},"labels":[],"label_agreement":null},{"id":"W2087428017","doi":"10.1006/jcta.1999.3006","title":"The Distribution of the Maximum Vertex Degree in Random Planar Maps","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Independent and identically distributed random variables; Vertex (graph theory); Combinatorics; Degree (music); Random variable; Limiting; Triangulation; Distribution (mathematics); Discrete mathematics; Asymptotic distribution; Planar; Statistics; Geometry; Mathematical analysis; Computer science; Physics","score_opus":0.01727243179445884,"score_gpt":0.2589933192367653,"score_spread":0.24172088744230644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087428017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92315316,0.0011276279,0.064262055,0.002659961,0.000066216315,0.00010313278,0.0014666242,0.0005162057,0.006645],"genre_scores_gemma":[0.9935254,0.000666866,0.0026560083,0.00010586273,0.00012925526,0.00008060158,0.00059601734,0.00010319919,0.0021368123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998024,0.0008299145,0.000059675367,0.00041757492,0.00030152398,0.00036738097],"domain_scores_gemma":[0.9344511,0.052515235,0.0049679885,0.003467608,0.0020658204,0.0025322128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965248,0.00089419977,0.0021849119,0.0049306266,0.0012678746,0.0043418687,0.0036359762,0.0028479276,0.0052297944],"category_scores_gemma":[0.05492614,0.0018211564,0.0010173499,0.00309929,0.0058762617,0.006243247,0.0024881363,0.002553837,0.0007045396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015856025,0.00023497318,0.02581957,0.00052106124,0.00025991458,0.0009285042,0.0012021022,0.3602591,0.009453899,0.5716159,0.008705799,0.01941363],"study_design_scores_gemma":[0.00024173348,0.00015326162,0.014123943,0.00011704895,0.00013217232,0.00086707965,0.00055402884,0.62598944,0.003830039,0.35203543,0.0017865988,0.00016919902],"about_ca_topic_score_codex":0.002570291,"about_ca_topic_score_gemma":0.0019308147,"teacher_disagreement_score":0.0052297944,"about_ca_system_score_codex":0.0024178526,"about_ca_system_score_gemma":0.00082296564,"threshold_uncertainty_score":0.026259065},"labels":[],"label_agreement":null},{"id":"W2088132468","doi":"10.1016/j.jcta.2008.08.003","title":"The number of lattice paths below a cyclically shifting boundary","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lattice (music); Mathematics; Statistical physics; Geometry; Physics","score_opus":0.02176566622767288,"score_gpt":0.3000446872456298,"score_spread":0.27827902101795693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088132468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95847976,0.00020866511,0.014052923,0.0007868768,0.00017257042,0.00003808898,0.00042975415,0.00023700774,0.02559438],"genre_scores_gemma":[0.97968787,0.00023477763,0.011652063,0.0001632007,0.00010940447,0.00007521246,0.000650127,0.00012608599,0.0073012067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898595,0.00016565037,0.00005607095,0.0002193314,0.000324621,0.0002483339],"domain_scores_gemma":[0.992512,0.0034272303,0.0010538249,0.00065895065,0.00066585845,0.0016820878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010305999,0.0005975569,0.0009288879,0.0028650572,0.002848012,0.004087099,0.0020871616,0.0023761166,0.014472493],"category_scores_gemma":[0.007945102,0.0005689356,0.00068926957,0.0016264592,0.003152888,0.004447765,0.0020548122,0.00223016,0.0010187998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018845712,0.0002904432,0.009665619,0.00028232453,0.00007507957,0.0007968081,0.00071714126,0.009391958,0.031694006,0.9115561,0.005109851,0.028536074],"study_design_scores_gemma":[0.00021665345,0.00028010394,0.005406049,0.00012801013,0.00011773247,0.0017437956,0.00095321436,0.05722059,0.022641683,0.90439594,0.006765816,0.00013035651],"about_ca_topic_score_codex":0.00063562574,"about_ca_topic_score_gemma":0.00065346825,"teacher_disagreement_score":0.014472493,"about_ca_system_score_codex":0.001026065,"about_ca_system_score_gemma":0.0009489725,"threshold_uncertainty_score":0.048415303},"labels":[],"label_agreement":null},{"id":"W2088620080","doi":"10.1016/j.jcta.2011.03.004","title":"Enumerating isodiametric and isoperimetric polygons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Combinatorics; Mathematics; Isoperimetric inequality; Perimeter; Regular polygon; Integer (computer science); Upper and lower bounds; Geometry; Mathematical analysis","score_opus":0.039581387715692355,"score_gpt":0.27047583634923983,"score_spread":0.23089444863354747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088620080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5892926,0.0018639974,0.3171193,0.0013272119,0.00024219631,0.00015120843,0.0012844434,0.0006748756,0.08804421],"genre_scores_gemma":[0.8048975,0.001281536,0.16923404,0.00035857185,0.00023245321,0.00012626106,0.0021218327,0.0003681574,0.021379575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844414,0.00034084456,0.00015508568,0.00031564425,0.0005190884,0.0002251945],"domain_scores_gemma":[0.9938992,0.0038321512,0.00045832834,0.00083019544,0.0005850373,0.00039508697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010765407,0.00078142044,0.0011378278,0.003521109,0.0015417191,0.0045161746,0.0024605081,0.0013761374,0.0065580984],"category_scores_gemma":[0.010068981,0.0008265006,0.0010085324,0.0037588244,0.0022582416,0.010485716,0.003661062,0.0030515708,0.000772005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120744844,0.00014927126,0.004804327,0.0002570535,0.000024338045,0.00024452896,0.0011230651,0.0069181453,0.002455943,0.9123153,0.0043007247,0.0672865],"study_design_scores_gemma":[0.000012641938,0.000027802971,0.00073896063,0.00005207507,0.00003087477,0.000524348,0.00046296985,0.019149344,0.0025339508,0.96800494,0.008444731,0.000017352455],"about_ca_topic_score_codex":0.0006834861,"about_ca_topic_score_gemma":0.0010520988,"teacher_disagreement_score":0.0065580984,"about_ca_system_score_codex":0.001077709,"about_ca_system_score_gemma":0.00055818004,"threshold_uncertainty_score":0.02193898},"labels":[],"label_agreement":null},{"id":"W2091157920","doi":"10.1016/j.jcta.2006.09.002","title":"An update on primitive ternary complementary pairs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Ternary operation; Mathematics; Combinatorics; Computer science; Programming language","score_opus":0.015030218796192785,"score_gpt":0.278152044446627,"score_spread":0.26312182565043424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091157920","genre_codex":"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.017354252,0.31298473,0.1178064,0.048122957,0.16775443,0.00015817893,0.0034192451,0.0017212108,0.33067852],"genre_scores_gemma":[0.15685903,0.3558258,0.19665854,0.023235623,0.08253555,0.0003050696,0.0047251508,0.0019638508,0.17789128],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906963,0.00019643645,0.00013726663,0.00016839556,0.00033539347,0.00009286703],"domain_scores_gemma":[0.9950761,0.001917974,0.00017644156,0.00063554465,0.0019909625,0.00020301194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001560606,0.00069846364,0.0011428669,0.004038089,0.001667045,0.0032046651,0.0020499327,0.0015739204,0.018816145],"category_scores_gemma":[0.008484132,0.0005907909,0.000597172,0.0051822807,0.0017699754,0.011192514,0.0019188301,0.003244557,0.008105077],"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.00011413469,0.000064928056,0.00033669893,0.0011868769,0.000029358456,0.00023573902,0.00020988868,0.00064914254,0.0011681458,0.26879555,0.2347023,0.49250737],"study_design_scores_gemma":[0.0000062472786,0.0000201909,0.000111252004,0.0001929414,0.000023399083,0.00045926374,0.000039151015,0.00045476455,0.0007146966,0.03668792,0.96127206,0.00001800901],"about_ca_topic_score_codex":0.0020309049,"about_ca_topic_score_gemma":0.0036564034,"teacher_disagreement_score":0.018816145,"about_ca_system_score_codex":0.0017995018,"about_ca_system_score_gemma":0.0021062333,"threshold_uncertainty_score":0.06294626},"labels":[],"label_agreement":null},{"id":"W2092375161","doi":"10.1006/jcta.2001.3218","title":"New Maximal Arcs in Desarguesian Planes","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Conic section; Combinatorics; Arc (geometry); Mathematics; Projective plane; Order (exchange); Enumeration; Construct (python library); Discrete mathematics; Geometry; Computer science","score_opus":0.011824715899154022,"score_gpt":0.20682386458745025,"score_spread":0.19499914868829624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092375161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5760765,0.0017700349,0.11666159,0.002853653,0.0006319502,0.00014131698,0.0010663718,0.0007102318,0.30008838],"genre_scores_gemma":[0.8881231,0.0011081122,0.0516452,0.00035703467,0.00030322038,0.00007726204,0.0006883349,0.00031897912,0.057378784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999567,0.00009624224,0.00003042146,0.00010313672,0.00010011036,0.000103160535],"domain_scores_gemma":[0.9988782,0.0005229555,0.00014656437,0.0001252379,0.000110468536,0.00021656057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660973,0.00063919084,0.0006561086,0.0016789648,0.002256551,0.0034726092,0.0010960125,0.001221239,0.011162036],"category_scores_gemma":[0.0026736213,0.00068779313,0.00068095466,0.0016836678,0.0022341763,0.004216213,0.0019664716,0.0031097666,0.0012445683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013013599,0.000025943307,0.00040978187,0.00005362102,0.0000081651215,0.00014393794,0.00027716233,0.0012318308,0.0012494781,0.9835789,0.0019267778,0.010964251],"study_design_scores_gemma":[0.000039435163,0.000023685605,0.00039024805,0.000028776418,0.000020235851,0.0002747781,0.0002763871,0.0043126736,0.0024209828,0.97187984,0.020315573,0.000017495275],"about_ca_topic_score_codex":0.0009386748,"about_ca_topic_score_gemma":0.0014552217,"teacher_disagreement_score":0.011162036,"about_ca_system_score_codex":0.0015883542,"about_ca_system_score_gemma":0.0005293236,"threshold_uncertainty_score":0.03734076},"labels":[],"label_agreement":null},{"id":"W2096474673","doi":"10.1016/j.jcta.2004.12.003","title":"A direct bijection for the Harer–Zagier formula","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Mathematics; Combinatorics; Enumeration; Pairing; Cardinality (data modeling); Disjoint sets; Partition (number theory); Tree (set theory); Discrete mathematics; Computer science","score_opus":0.02742315502893356,"score_gpt":0.312658380593504,"score_spread":0.2852352255645704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096474673","genre_codex":"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.2581511,0.004454564,0.18379134,0.008235923,0.0038821949,0.00016242631,0.0006414089,0.000676188,0.54000485],"genre_scores_gemma":[0.8204325,0.0031359666,0.060640175,0.003581014,0.0022038028,0.00023545907,0.0006695487,0.00061198266,0.10848966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930847,0.00014345424,0.0000454307,0.00018220488,0.00019286691,0.00012761993],"domain_scores_gemma":[0.9993766,0.00024008022,0.000056452434,0.0000874933,0.00013153866,0.00010781563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093720254,0.0007852838,0.001159492,0.002904392,0.0039415746,0.0051441872,0.001396987,0.0024589556,0.016346645],"category_scores_gemma":[0.0022032985,0.00064467744,0.0010187377,0.002233286,0.0027629659,0.008544913,0.003552619,0.0057834866,0.0030652871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015677912,0.000022585,0.00006163467,0.000023428647,0.000004267858,0.000054296324,0.00014716249,0.00006373239,0.0004359646,0.9893762,0.0015821308,0.008213056],"study_design_scores_gemma":[0.000019240051,0.00001318002,0.0001074199,0.000010670451,0.0000069044436,0.00016196456,0.000058809852,0.00041029806,0.00028240014,0.9908188,0.00809668,0.0000135919545],"about_ca_topic_score_codex":0.0008960364,"about_ca_topic_score_gemma":0.00082008133,"teacher_disagreement_score":0.016346645,"about_ca_system_score_codex":0.0013523413,"about_ca_system_score_gemma":0.0006264479,"threshold_uncertainty_score":0.054684937},"labels":[],"label_agreement":null},{"id":"W2099082421","doi":"10.1016/j.jcta.2013.05.002","title":"Rank of divisors on tropical curves","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rank (graph theory); Mathematics; Divisor (algebraic geometry); Conjecture; Graph; Combinatorics; Equivalence (formal languages); Metric (unit); Discrete mathematics","score_opus":0.0072740607135053465,"score_gpt":0.21692893685422238,"score_spread":0.20965487614071704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099082421","genre_codex":"empirical","genre_gemma":"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.9312672,0.00042200566,0.0129647255,0.0009490122,0.00013068577,0.000037278558,0.0005885112,0.00022651996,0.05341405],"genre_scores_gemma":[0.98976517,0.00022100138,0.0015630738,0.000048156853,0.00019583653,0.000015639609,0.00029799002,0.00006643719,0.007826729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988808,0.00016331172,0.00006378615,0.00016251655,0.0003648349,0.00036463406],"domain_scores_gemma":[0.9959121,0.0014271473,0.0006268048,0.00034091398,0.0003995465,0.0012935101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013804599,0.0008122308,0.0012795031,0.0064529614,0.002380007,0.006028149,0.0011380076,0.0008773266,0.01971597],"category_scores_gemma":[0.005035779,0.00068239885,0.0005958414,0.0027388625,0.0038237115,0.007016528,0.0033007385,0.0017480188,0.0015715415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023291064,0.00006145969,0.0034720898,0.00007244822,0.00001664846,0.00020913007,0.00084478984,0.0016521928,0.00204419,0.9793808,0.0017587214,0.010254751],"study_design_scores_gemma":[0.00005785233,0.00008487311,0.0029687656,0.000055429762,0.00003154993,0.00036652788,0.0005421428,0.0061348667,0.00166573,0.98424226,0.0037932815,0.000056793127],"about_ca_topic_score_codex":0.0009880089,"about_ca_topic_score_gemma":0.0015494049,"teacher_disagreement_score":0.01971597,"about_ca_system_score_codex":0.0014821565,"about_ca_system_score_gemma":0.0007978023,"threshold_uncertainty_score":0.06595647},"labels":[],"label_agreement":null},{"id":"W2099229992","doi":"10.1016/j.jcta.2004.06.009","title":"The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematics and Applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Regular polygon; Unit (ring theory); Quadratic equation; Geometry; Mathematics education","score_opus":0.02068061691314682,"score_gpt":0.28115773145001205,"score_spread":0.26047711453686523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099229992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45755318,0.001861033,0.11779759,0.01937933,0.0009662199,0.000094726856,0.0006711998,0.0006610232,0.4010157],"genre_scores_gemma":[0.93447196,0.0006957348,0.03223564,0.0008999914,0.00010049829,0.000037314312,0.00024551447,0.00035896208,0.030954413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940455,0.00017635296,0.000023523347,0.00012239821,0.00013387391,0.00013934073],"domain_scores_gemma":[0.99857235,0.00054186396,0.00008463787,0.000337507,0.0002426705,0.00022089755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047617918,0.00030543163,0.001015716,0.00044372742,0.0037541438,0.0033677537,0.0007823477,0.00178011,0.011113945],"category_scores_gemma":[0.0061178706,0.0004121961,0.00039706015,0.0008559614,0.0022967337,0.0036755076,0.0015749459,0.0019190566,0.0019492481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033101067,0.000046347846,0.00084413507,0.00006658412,0.000012340268,0.00019003214,0.0005413274,0.004063508,0.0013038876,0.9274846,0.02625114,0.03886514],"study_design_scores_gemma":[0.000055891403,0.000046535104,0.00041019742,0.000044272434,0.000018375024,0.00035472523,0.0010314693,0.013101049,0.001137189,0.9560978,0.027679227,0.000023327884],"about_ca_topic_score_codex":0.0046485243,"about_ca_topic_score_gemma":0.0063928897,"teacher_disagreement_score":0.011113945,"about_ca_system_score_codex":0.0010597944,"about_ca_system_score_gemma":0.0015778203,"threshold_uncertainty_score":0.037179828},"labels":[],"label_agreement":null},{"id":"W2099869189","doi":"10.1016/j.jcta.2018.06.013","title":"On the chromatic number of structured Cayley graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Cayley graph; Mathematics; Combinatorics; Chromatic scale; Algebraic number; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.03751198900411745,"score_gpt":0.3325691220864022,"score_spread":0.29505713308228476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099869189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87469167,0.0011353324,0.04010457,0.0025948451,0.00042204198,0.000046462046,0.00066094694,0.00022222612,0.080121815],"genre_scores_gemma":[0.9833228,0.0005544206,0.005554992,0.00022558529,0.00035825468,0.00004816303,0.00044433423,0.00011725542,0.009374219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993444,0.00018976486,0.000020032643,0.00019342442,0.00013756639,0.00011482324],"domain_scores_gemma":[0.99389654,0.003476582,0.0008827871,0.00042041118,0.00047397855,0.0008497319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010929857,0.00090356177,0.00075923774,0.0044289646,0.0017978067,0.0037233266,0.0021232036,0.0015657716,0.012842855],"category_scores_gemma":[0.0063386094,0.00067240855,0.00047592644,0.0023700984,0.0040359166,0.0051276316,0.0015727698,0.0020706356,0.0006759675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017768308,0.000052218456,0.0020393177,0.00008620492,0.000023330476,0.00006974234,0.00035159514,0.010780066,0.0027796468,0.9725188,0.004014719,0.0071066623],"study_design_scores_gemma":[0.000040101055,0.000030911895,0.0017693508,0.000053808115,0.00002653148,0.00009949614,0.00021648634,0.044252075,0.0010251674,0.94982827,0.0026226446,0.000035161913],"about_ca_topic_score_codex":0.0028275466,"about_ca_topic_score_gemma":0.0042045275,"teacher_disagreement_score":0.012842855,"about_ca_system_score_codex":0.0025740538,"about_ca_system_score_gemma":0.0007932395,"threshold_uncertainty_score":0.042963684},"labels":[],"label_agreement":null},{"id":"W2101535655","doi":"10.1016/j.jcta.2004.09.005","title":"Cohen–Macaulay properties of square-free monomial ideals","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Monomial; Mathematics; Quotient; Square-free integer; Monomial ideal; Simplicial complex; Square (algebra); Class (philosophy); Combinatorics; h-vector; Pure mathematics; Graph; Computer science; Mathematical analysis; Geometry; Artificial intelligence; Polynomial ring; Polynomial","score_opus":0.03214177214561393,"score_gpt":0.2838619238585814,"score_spread":0.25172015171296747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101535655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84163433,0.0018829271,0.04463906,0.0028132799,0.00020861778,0.00005107116,0.00035930087,0.00016487011,0.10824652],"genre_scores_gemma":[0.9872197,0.00045856475,0.004308483,0.0001492647,0.00036416954,0.00002563691,0.00016648791,0.00003700287,0.007270749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989483,0.00019683223,0.00007443941,0.00022273236,0.0003339001,0.00022379868],"domain_scores_gemma":[0.99522156,0.0024818657,0.0006209089,0.00031193002,0.00071988447,0.0006438059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021917254,0.00051333837,0.0011905187,0.0021854993,0.0026865185,0.0035838103,0.000907346,0.0006235496,0.006936923],"category_scores_gemma":[0.0043286565,0.00072929583,0.00086133514,0.0019511182,0.005665614,0.00615082,0.0018918152,0.0026028138,0.0006127438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009443201,0.000037321435,0.0007761853,0.000036076537,0.000014449419,0.00011342934,0.00061364955,0.00038399064,0.002062263,0.9926668,0.0005224096,0.0026790386],"study_design_scores_gemma":[0.0000475115,0.000038453247,0.0013748702,0.000011842495,0.000027380735,0.00026855228,0.00024104917,0.0015752596,0.002634825,0.9907879,0.0029634503,0.000028729126],"about_ca_topic_score_codex":0.001237044,"about_ca_topic_score_gemma":0.0013556612,"teacher_disagreement_score":0.006936923,"about_ca_system_score_codex":0.0019474179,"about_ca_system_score_gemma":0.0010247139,"threshold_uncertainty_score":0.023206353},"labels":[],"label_agreement":null},{"id":"W2102207023","doi":"10.1016/j.jcta.2013.11.005","title":"Resolvability of infinite designs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Resolution (logic); Mathematics; Contrast (vision); Combinatorics; Discrete mathematics; Pure mathematics; Physics; Computer science; Optics","score_opus":0.009741561019551986,"score_gpt":0.19871775146611279,"score_spread":0.1889761904465608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102207023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4927932,0.00061951,0.42134458,0.0016249802,0.00019162784,0.000104852836,0.000439352,0.00046723773,0.08241465],"genre_scores_gemma":[0.94829834,0.00035891793,0.037579406,0.00030402836,0.00026446252,0.00014081388,0.0003792999,0.00015494906,0.012519853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950193,0.0018736856,0.00028482513,0.0008935023,0.0012783117,0.00065031013],"domain_scores_gemma":[0.94746643,0.04033247,0.0025014444,0.006087836,0.0023499816,0.0012618555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036083038,0.0008341634,0.0013182497,0.0019458178,0.0027036988,0.0059957216,0.002551456,0.0021811104,0.0077318787],"category_scores_gemma":[0.022112696,0.0013851725,0.0017015791,0.0012638447,0.005879257,0.005037982,0.003197917,0.0048368247,0.0011551953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016420455,0.000060123337,0.00038512616,0.000048658585,0.000022090377,0.0001285814,0.00032722377,0.006787649,0.0021520988,0.98304594,0.000563433,0.006314906],"study_design_scores_gemma":[0.000034597335,0.00003407489,0.00007384411,0.000020256088,0.000012472691,0.00008863609,0.0000405914,0.011677013,0.001182,0.9860049,0.00081329216,0.000018397755],"about_ca_topic_score_codex":0.00069349405,"about_ca_topic_score_gemma":0.0009324885,"teacher_disagreement_score":0.0077318787,"about_ca_system_score_codex":0.0014812173,"about_ca_system_score_gemma":0.0015223961,"threshold_uncertainty_score":0.025865734},"labels":[],"label_agreement":null},{"id":"W2102747227","doi":"10.1016/j.jcta.2004.04.001","title":"Asymptotics of combinatorial structures with large smallest component","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Component (thermodynamics); Mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.012771638754875275,"score_gpt":0.25502157571622674,"score_spread":0.24224993696135147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102747227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7989394,0.0025480618,0.110640064,0.0045975363,0.00037561,0.00007762691,0.00041784203,0.0013774758,0.081026375],"genre_scores_gemma":[0.9811287,0.00086970726,0.009325962,0.00030886996,0.0006138765,0.00012350787,0.00037025954,0.00032256905,0.006936507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987961,0.0003379553,0.00004996821,0.00021976707,0.00041415053,0.00018197969],"domain_scores_gemma":[0.9717452,0.020228561,0.0017830199,0.0018239039,0.0018545248,0.0025648335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021283117,0.0009642733,0.001962035,0.0063270987,0.0025058493,0.005782055,0.0035816825,0.0026799391,0.009850879],"category_scores_gemma":[0.040089652,0.0012273063,0.0008184111,0.0025698484,0.005452643,0.008209083,0.0035288772,0.003357775,0.0007497468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009212241,0.000055228895,0.001240312,0.00010056956,0.000016540534,0.00009895524,0.00023567349,0.0056921793,0.0011101773,0.9840567,0.002315181,0.004986309],"study_design_scores_gemma":[0.000027661821,0.000019718249,0.0009821798,0.000038376224,0.000022527065,0.00024765206,0.00014195731,0.042299397,0.00055384083,0.95460653,0.001038168,0.000022052327],"about_ca_topic_score_codex":0.0014030334,"about_ca_topic_score_gemma":0.001308994,"teacher_disagreement_score":0.009850879,"about_ca_system_score_codex":0.0025719148,"about_ca_system_score_gemma":0.0011478192,"threshold_uncertainty_score":0.032954514},"labels":[],"label_agreement":null},{"id":"W2108737894","doi":"10.1016/j.jcta.2009.10.007","title":"Partitions and indivisibility properties of countable dimensional vector spaces","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Countable set; Counterexample; Partition (number theory); Vector space; Affine transformation; Mathematics; Space (punctuation); Pure mathematics; Discrete mathematics; Computer science; Combinatorics","score_opus":0.024860863344130825,"score_gpt":0.2822014688557475,"score_spread":0.25734060551161664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108737894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91532564,0.0010153832,0.054699447,0.0010189427,0.00006177193,0.0000303982,0.00037822447,0.0000851324,0.02738497],"genre_scores_gemma":[0.9933496,0.00025688508,0.0036841822,0.00005161131,0.00007718924,0.00003794562,0.00033794047,0.000029694862,0.0021749397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760324,0.000618122,0.00022464164,0.00043960096,0.00070493255,0.00040948848],"domain_scores_gemma":[0.9846858,0.010007179,0.0017144314,0.0014269364,0.000973591,0.0011921016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002793529,0.00066068413,0.0011746465,0.0032612665,0.0031389405,0.011437647,0.0018583216,0.0013938713,0.0046161185],"category_scores_gemma":[0.012505948,0.0012420294,0.0011841937,0.0026916196,0.007094598,0.011223825,0.0034960983,0.0036621788,0.00030823756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015503468,0.000033794568,0.0013885051,0.000031566848,0.000020251644,0.00007102826,0.0008161355,0.0008646678,0.0010084297,0.99356574,0.00018485964,0.0018600455],"study_design_scores_gemma":[0.00003083528,0.00002628246,0.0010321815,0.00002709016,0.000020664625,0.00017728747,0.00050736975,0.00464949,0.0008300668,0.9917755,0.0009003928,0.000022816574],"about_ca_topic_score_codex":0.000825942,"about_ca_topic_score_gemma":0.0007320166,"teacher_disagreement_score":0.011437647,"about_ca_system_score_codex":0.0017806075,"about_ca_system_score_gemma":0.00065428246,"threshold_uncertainty_score":0.015442431},"labels":[],"label_agreement":null},{"id":"W2108918469","doi":"10.1016/j.jcta.2003.12.005","title":"A class of prototiles with doubly generated level semigroups","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Class (philosophy); Mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.013825378483179678,"score_gpt":0.2232447927371347,"score_spread":0.20941941425395502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108918469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79376554,0.0007046893,0.118044145,0.0006594754,0.00035921214,0.0001343561,0.0006410376,0.0011048674,0.08458668],"genre_scores_gemma":[0.96423674,0.00018741013,0.014177382,0.0001351824,0.00015733158,0.00007813572,0.0004153278,0.00011112348,0.02050128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.00004587271,0.000022244049,0.00008735899,0.000098541976,0.000114752394],"domain_scores_gemma":[0.9989988,0.00030521466,0.00013955592,0.00014280684,0.00012339847,0.00029027043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030797758,0.00044712276,0.0008183222,0.0014416702,0.0026088879,0.0031649033,0.0007485985,0.0010448566,0.0074110003],"category_scores_gemma":[0.0010229767,0.00052208797,0.00092101365,0.0008518204,0.0018025496,0.0016226843,0.0015392321,0.0009867455,0.00092593924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016053226,0.000039311093,0.0012593342,0.00005566661,0.000019856909,0.0009282769,0.00072533044,0.0007136999,0.006053501,0.9812562,0.0016955206,0.0070927422],"study_design_scores_gemma":[0.00009128899,0.0001348464,0.0022364298,0.00003310199,0.000037941416,0.002336598,0.00057550875,0.0094494205,0.003704321,0.9642335,0.017108902,0.00005810916],"about_ca_topic_score_codex":0.0006276482,"about_ca_topic_score_gemma":0.000590517,"teacher_disagreement_score":0.0074110003,"about_ca_system_score_codex":0.000674266,"about_ca_system_score_gemma":0.0004910729,"threshold_uncertainty_score":0.024792254},"labels":[],"label_agreement":null},{"id":"W2117446874","doi":"10.1016/j.jcta.2005.04.006","title":"Erdős–Szekeres theorem with forbidden order types","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; General position; Mathematics; Regular polygon; Position (finance); Order (exchange); Plane (geometry); Type (biology); Graph; Order type; Discrete mathematics; Geometry","score_opus":0.012300289041590208,"score_gpt":0.26267693494356215,"score_spread":0.25037664590197195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117446874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33308148,0.002735082,0.3324148,0.008059426,0.0011330467,0.00013947813,0.00095108437,0.0007107875,0.3207748],"genre_scores_gemma":[0.885681,0.002687527,0.050807748,0.0013072672,0.0011948531,0.0002787669,0.00048805305,0.00032924453,0.05722559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986462,0.00030131344,0.00009871055,0.00029370908,0.0004574287,0.00020274594],"domain_scores_gemma":[0.9958016,0.0023154733,0.00038241362,0.00060717633,0.000494132,0.0003991229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265183,0.0009251891,0.0020079557,0.0035923596,0.003436704,0.0042548375,0.0025954219,0.0021461402,0.008801353],"category_scores_gemma":[0.0072495495,0.00091475615,0.0016706318,0.002926437,0.005165194,0.014448192,0.0042220685,0.006165423,0.0014335649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017019443,0.0000121150415,0.00007420853,0.000018473107,0.000004252045,0.000031016276,0.00007844937,0.00021685493,0.0001218572,0.9971367,0.0006298269,0.0016592132],"study_design_scores_gemma":[0.000011589513,0.0000034849866,0.000043334465,0.0000055647197,0.0000076265023,0.000074590935,0.000027102786,0.0009821026,0.00013539831,0.9972077,0.0014955995,0.000006040699],"about_ca_topic_score_codex":0.00082854833,"about_ca_topic_score_gemma":0.00063653145,"teacher_disagreement_score":0.008801353,"about_ca_system_score_codex":0.0018609248,"about_ca_system_score_gemma":0.0010915071,"threshold_uncertainty_score":0.029443443},"labels":[],"label_agreement":null},{"id":"W2120707415","doi":"10.1016/j.jcta.2007.05.008","title":"On distinguishing trees by their chromatic symmetric functions","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of Minnesota","keywords":"Symmetric function; Combinatorics; Mathematics; Chromatic scale; Monomial; Elementary symmetric polynomial; Invariant (physics); Power sum symmetric polynomial; Function (biology); Complete homogeneous symmetric polynomial; Ring of symmetric functions; Isomorphism (crystallography); Stanley symmetric function; Symmetric polynomial; Chromatic polynomial; Corollary; Discrete mathematics; Polynomial; Orthogonal polynomials; Mathematical analysis; Matrix polynomial","score_opus":0.01814852272102464,"score_gpt":0.2825410242038569,"score_spread":0.2643925014828323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120707415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72837937,0.0010440783,0.18630083,0.0021224262,0.00041479422,0.00011343456,0.00040419036,0.00040478734,0.08081613],"genre_scores_gemma":[0.94463974,0.0008108477,0.030897526,0.0005493577,0.00039171887,0.00008484345,0.0004549831,0.00024991878,0.021920959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905556,0.00021129781,0.00004037357,0.0002134314,0.00024352512,0.00023584026],"domain_scores_gemma":[0.99459934,0.0034745045,0.00050455437,0.0004763784,0.00033124042,0.0006140268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013477402,0.00087603345,0.0011036394,0.0028537754,0.0022391235,0.004094734,0.0018897048,0.001858618,0.007749799],"category_scores_gemma":[0.0059973556,0.000855279,0.0011315047,0.002470588,0.0040677185,0.007948561,0.0035417143,0.004121331,0.00086301967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059778293,0.000023283099,0.00042265357,0.000017191145,0.000005277788,0.000035876743,0.00023785343,0.0009508182,0.00081951777,0.99080807,0.0009371092,0.0056825727],"study_design_scores_gemma":[0.00001848618,0.000021143776,0.00037960385,0.000012581774,0.000013772119,0.00012243133,0.00010382034,0.0071739987,0.0005854253,0.98980707,0.0017463434,0.000015331356],"about_ca_topic_score_codex":0.001276079,"about_ca_topic_score_gemma":0.0017991465,"teacher_disagreement_score":0.007749799,"about_ca_system_score_codex":0.001924189,"about_ca_system_score_gemma":0.00087680755,"threshold_uncertainty_score":0.025925636},"labels":[],"label_agreement":null},{"id":"W2123992412","doi":"10.1016/j.jcta.2012.11.004","title":"The down operator and expansions of near rectangular k -Schur functions","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University; Université du Québec à Montréal","funders":"","keywords":"Affine transformation; Mathematics; Subalgebra; Conjecture; Operator (biology); Affine coordinate system; Affine representation; Pure mathematics; Algebra over a field; Interpretation (philosophy); Affine group; Affine space; Affine Lie algebra; Computer science; Current algebra","score_opus":0.017409972200986713,"score_gpt":0.2825466754068814,"score_spread":0.26513670320589466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123992412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6798903,0.00080624496,0.16284214,0.0010021832,0.0004444793,0.000061492756,0.00014970891,0.0003534809,0.15444997],"genre_scores_gemma":[0.951702,0.0005168885,0.01795873,0.0003109364,0.00031896707,0.00005347399,0.00014861183,0.00020461877,0.02878577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996325,0.00011250267,0.00001547501,0.000048580667,0.00010906784,0.00008184883],"domain_scores_gemma":[0.9989374,0.0004366084,0.00012761672,0.000093643095,0.00018093178,0.00022375079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282192,0.0009278741,0.00068844337,0.0024312749,0.0010178195,0.001994461,0.0011459538,0.0009409649,0.009310717],"category_scores_gemma":[0.0036931266,0.00041339805,0.0005276813,0.00095578155,0.0024631019,0.0027956339,0.0014205911,0.0019443228,0.0010847723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000556431,0.000021633037,0.0001698441,0.000021494307,0.000003823694,0.00013648711,0.0001687216,0.0014823987,0.0026385204,0.99003476,0.0006235771,0.0046432377],"study_design_scores_gemma":[0.000019405072,0.000037754977,0.0005769497,0.000030853353,0.00001002846,0.00034007666,0.00026414456,0.04128074,0.0017543653,0.9528569,0.00278978,0.000039006045],"about_ca_topic_score_codex":0.000896683,"about_ca_topic_score_gemma":0.00096318295,"teacher_disagreement_score":0.009310717,"about_ca_system_score_codex":0.0007362542,"about_ca_system_score_gemma":0.00049430865,"threshold_uncertainty_score":0.03114748},"labels":[],"label_agreement":null},{"id":"W2132589312","doi":"10.1016/j.jcta.2010.10.003","title":"Divisible design graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adjacency matrix; Combinatorics; Mathematics; Indifference graph; Discrete mathematics; Chordal graph; Adjacency list; Strongly regular graph; Incidence matrix; Generalization; Cograph; Pathwidth; Line graph; Graph","score_opus":0.006352779784245656,"score_gpt":0.19350495685116315,"score_spread":0.1871521770669175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132589312","genre_codex":"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.1979418,0.0007988627,0.5575082,0.002113912,0.0005240494,0.00022706242,0.00059782434,0.0006688311,0.23961943],"genre_scores_gemma":[0.77182716,0.00074436166,0.1254693,0.001138711,0.00032476263,0.00023026814,0.00056902354,0.0002030941,0.0994933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991978,0.00025064283,0.00002892715,0.00024418402,0.0001850959,0.00009337442],"domain_scores_gemma":[0.9976724,0.00084965257,0.00023383189,0.0006745082,0.00035064918,0.00021905346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050655263,0.00064722926,0.00053728226,0.0010688616,0.0012960852,0.001975273,0.0007371767,0.0009573801,0.018258525],"category_scores_gemma":[0.0025147195,0.00052799325,0.00038859344,0.000955118,0.001061666,0.001975536,0.0013577329,0.0017476426,0.0022703477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052552838,0.000036642476,0.00023819746,0.000040592648,0.000011569742,0.000054284785,0.00007653418,0.0024002804,0.0024952588,0.9633554,0.003579695,0.027658977],"study_design_scores_gemma":[0.00002695654,0.000041115658,0.00020279374,0.000029044306,0.00001620886,0.00019751802,0.00004416728,0.0096637895,0.0018696709,0.95977443,0.028122017,0.000012365508],"about_ca_topic_score_codex":0.00030065706,"about_ca_topic_score_gemma":0.00057262706,"teacher_disagreement_score":0.018258525,"about_ca_system_score_codex":0.00089182623,"about_ca_system_score_gemma":0.0004791401,"threshold_uncertainty_score":0.061080813},"labels":[],"label_agreement":null},{"id":"W2139746216","doi":"10.1016/j.jcta.2005.02.005","title":"The Ramsey number for hypergraph cycles I","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Monochromatic color; Ramsey's theorem; Discrete mathematics; Graph; Physics","score_opus":0.016230243126950247,"score_gpt":0.29848306450790657,"score_spread":0.2822528213809563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139746216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6473043,0.0075745396,0.10102211,0.010191005,0.0009631848,0.00012917281,0.0010385283,0.0006770337,0.23110011],"genre_scores_gemma":[0.97132653,0.0021895014,0.011533587,0.0005931526,0.0007694398,0.00019654818,0.00026351665,0.00012531379,0.013002364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912304,0.0002620461,0.000055992718,0.00023071954,0.00019231047,0.00013588172],"domain_scores_gemma":[0.99408925,0.0034788582,0.00068152376,0.00046397783,0.00044208896,0.00084427727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001945779,0.000704269,0.0013747684,0.0045519527,0.0026395707,0.0052974406,0.0019791564,0.0018925078,0.00927216],"category_scores_gemma":[0.011131463,0.00086674833,0.00079415244,0.002944093,0.0043952568,0.012189021,0.0023975975,0.0031661172,0.000776758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049563634,0.000018013834,0.00037441382,0.000058149257,0.0000089904015,0.000027471484,0.00021762667,0.00088885677,0.0004192664,0.99143034,0.0025389846,0.0039684786],"study_design_scores_gemma":[0.000009608918,0.0000100662,0.00023955996,0.000028164663,0.000011814371,0.00007900844,0.000089098154,0.0045980294,0.00027689524,0.9925638,0.002079596,0.000014370719],"about_ca_topic_score_codex":0.0010608288,"about_ca_topic_score_gemma":0.0008036611,"teacher_disagreement_score":0.00927216,"about_ca_system_score_codex":0.002567945,"about_ca_system_score_gemma":0.0010643004,"threshold_uncertainty_score":0.031018436},"labels":[],"label_agreement":null},{"id":"W2140390981","doi":"10.1016/j.jcta.2005.01.010","title":"Colouring lines in projective space","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Linear subspace; Combinatorics; Chromatic scale; Subspace topology; Vector space; Dimension (graph theory); Discrete mathematics; Projective space; Graph; Projective test; Pure mathematics; Mathematical analysis","score_opus":0.036570643388460625,"score_gpt":0.3355192001754775,"score_spread":0.2989485567870169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140390981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70454764,0.001463953,0.11664168,0.0040556868,0.0009910318,0.00009044223,0.00039550717,0.00085773645,0.17095631],"genre_scores_gemma":[0.9481204,0.0006713578,0.015253718,0.00038212087,0.0005042524,0.000053570784,0.00021126964,0.00021926411,0.034584124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999054,0.00032639122,0.00004246991,0.00018009296,0.00019916895,0.00019783662],"domain_scores_gemma":[0.99699545,0.0014048474,0.0004611519,0.00035162808,0.00034442832,0.000442564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009113016,0.00086617336,0.0009258068,0.0035023915,0.0031759222,0.006273546,0.0013262919,0.002240464,0.010843962],"category_scores_gemma":[0.0032882472,0.0010015935,0.00089161936,0.0038436337,0.0058064205,0.007981755,0.0021754298,0.0038314334,0.0012415532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000228624,0.000012420425,0.00015329085,0.0000120676,0.0000040961336,0.00005181,0.00024263286,0.00039862926,0.00040077357,0.9959676,0.00066513685,0.002068659],"study_design_scores_gemma":[0.000018457124,0.000017426755,0.00021523924,0.000008074647,0.000007341736,0.00008385906,0.00010081029,0.0011029821,0.00026977257,0.9953555,0.002808573,0.000011892779],"about_ca_topic_score_codex":0.0020998388,"about_ca_topic_score_gemma":0.002095905,"teacher_disagreement_score":0.010843962,"about_ca_system_score_codex":0.0018972396,"about_ca_system_score_gemma":0.0005492365,"threshold_uncertainty_score":0.03627664},"labels":[],"label_agreement":null},{"id":"W2140893304","doi":"10.1016/j.jcta.2007.08.003","title":"Partially directed paths in a wedge","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; York University","funders":"","keywords":"Mathematics; Combinatorics; Iterated function; Lattice (music); Wedge (geometry); Square lattice; Generating function; Enumeration; Mathematical analysis; Geometry; Statistical physics; Physics","score_opus":0.020448295905492832,"score_gpt":0.30197842620575766,"score_spread":0.2815301303002648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140893304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5859346,0.00071817136,0.24420075,0.0014911002,0.00022522586,0.00016178816,0.0014276857,0.00036780996,0.16547298],"genre_scores_gemma":[0.84371656,0.0008607943,0.082123056,0.00033110988,0.00006005482,0.0001405322,0.0012506287,0.00023764287,0.07127968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958926,0.00007693319,0.000029948116,0.000096602824,0.00012351236,0.000083687264],"domain_scores_gemma":[0.99881196,0.00053032505,0.00013384725,0.00009543753,0.00015643373,0.000272057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004336929,0.0006039603,0.000765332,0.0015390452,0.0018351148,0.0026840307,0.0009627866,0.0009851238,0.012656235],"category_scores_gemma":[0.0019937437,0.0006510879,0.00050882733,0.0019740046,0.0015221932,0.0044635804,0.0019714378,0.0025403474,0.0013365881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000445562,0.000027036458,0.00023205006,0.000033334727,0.0000057805496,0.0002867087,0.00021793017,0.0011064161,0.00089221296,0.99181455,0.0009868625,0.0043524476],"study_design_scores_gemma":[0.00002680198,0.000013835398,0.00015367151,0.000025311263,0.000008983893,0.00024332984,0.00023151367,0.0053675193,0.00068386283,0.9866338,0.00660446,0.0000069174184],"about_ca_topic_score_codex":0.0014158316,"about_ca_topic_score_gemma":0.001785785,"teacher_disagreement_score":0.012656235,"about_ca_system_score_codex":0.00088289694,"about_ca_system_score_gemma":0.0005276215,"threshold_uncertainty_score":0.042339325},"labels":[],"label_agreement":null},{"id":"W2154493507","doi":"10.1016/s0097-3165(03)00006-2","title":"Width and dual width of subsets in polynomial association schemes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Association scheme; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Dual (grammatical number); Graph; Discrete mathematics; Polynomial; Physics; Mathematical analysis","score_opus":0.022878052541247997,"score_gpt":0.2962240398218491,"score_spread":0.2733459872806011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154493507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84680945,0.0005549331,0.12539507,0.0012712446,0.00009061332,0.000044995322,0.0005687977,0.00023962939,0.025025198],"genre_scores_gemma":[0.97875947,0.00025814233,0.014749735,0.00012560473,0.00014563804,0.000060658822,0.00032038827,0.00008774478,0.005492618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983571,0.00036860787,0.00013739681,0.00044633914,0.00029561753,0.00039495534],"domain_scores_gemma":[0.99309075,0.0037452995,0.00077407237,0.0008876773,0.00043521315,0.0010668872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022666017,0.00070328417,0.0013687798,0.0027742274,0.003198256,0.007813918,0.002334214,0.0015273686,0.006953393],"category_scores_gemma":[0.009104142,0.0014249865,0.00132357,0.0034947963,0.005674792,0.017034464,0.0048875827,0.004259879,0.0006203378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020945739,0.00003236582,0.0010253204,0.00003109864,0.000009821484,0.000044477296,0.0007944005,0.0008216472,0.0009186036,0.9920353,0.00031334194,0.003764165],"study_design_scores_gemma":[0.00003432347,0.00002407117,0.0004628078,0.000018461553,0.000036423487,0.000111157904,0.00045670848,0.0041660373,0.0008454322,0.99244714,0.0013775313,0.000019893585],"about_ca_topic_score_codex":0.0009615967,"about_ca_topic_score_gemma":0.00085194345,"teacher_disagreement_score":0.007813918,"about_ca_system_score_codex":0.0018925447,"about_ca_system_score_gemma":0.0007256078,"threshold_uncertainty_score":0.023261428},"labels":[],"label_agreement":null},{"id":"W2155233457","doi":"10.1016/j.jcta.2009.03.015","title":"Some Ramsey-type results for the n-cube","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cube (algebra); Type (biology); Ramsey's theorem; Combinatorics; Mathematics; Geology","score_opus":0.02540676515078403,"score_gpt":0.2997708149569002,"score_spread":0.2743640498061162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155233457","genre_codex":"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.30144623,0.019296544,0.16230643,0.015486848,0.0019348481,0.00014304904,0.001209907,0.0005229179,0.49765334],"genre_scores_gemma":[0.8809012,0.013650399,0.04667038,0.0033527769,0.0026295725,0.00028050083,0.0010269084,0.00025003732,0.05123818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991874,0.00025927325,0.00005987909,0.00015837952,0.00024150452,0.00009342289],"domain_scores_gemma":[0.995544,0.0027411159,0.00029671547,0.0004537065,0.0004914287,0.00047299647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023556522,0.00090146,0.0014707973,0.0034126963,0.003466697,0.0040535564,0.0022630363,0.001617573,0.009519149],"category_scores_gemma":[0.008353408,0.0009057463,0.0018158131,0.004585951,0.0042569693,0.0141009865,0.003995482,0.005188787,0.001061976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038977116,0.00003923639,0.0002478667,0.00011107804,0.000016707445,0.00008708776,0.00023330534,0.0011966971,0.00032193097,0.9886972,0.003879257,0.0051307213],"study_design_scores_gemma":[0.0000076647375,0.000007550484,0.00014228809,0.00002101269,0.000011217812,0.00007436407,0.00007751793,0.0019186264,0.00013375489,0.9947731,0.0028226199,0.00001024441],"about_ca_topic_score_codex":0.0021011003,"about_ca_topic_score_gemma":0.0025402398,"teacher_disagreement_score":0.009519149,"about_ca_system_score_codex":0.0021186965,"about_ca_system_score_gemma":0.0010691981,"threshold_uncertainty_score":0.031844735},"labels":[],"label_agreement":null},{"id":"W2158442467","doi":"10.1016/j.jcta.2007.11.001","title":"Shellable graphs and sequentially Cohen–Macaulay bipartite graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Bipartite graph; Chordal graph; Mathematics; Complete bipartite graph; Simplicial complex; Discrete mathematics; Graph","score_opus":0.02093647635948099,"score_gpt":0.3009365561280307,"score_spread":0.28000007976854974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158442467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.672363,0.00052418956,0.2380943,0.0018233847,0.00023624665,0.00009980404,0.0004290769,0.00038659404,0.08604349],"genre_scores_gemma":[0.95652056,0.00036483505,0.02272632,0.00049017364,0.00024062474,0.00011252542,0.00046380743,0.00010075561,0.018980358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911493,0.00026338635,0.00004974188,0.00021816928,0.00018507736,0.0001685904],"domain_scores_gemma":[0.99516064,0.0024811318,0.000727444,0.00045326067,0.0005423565,0.0006351782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012240013,0.00064618664,0.0009717025,0.0014548051,0.0026081759,0.0024855803,0.0013748537,0.0012557541,0.008200183],"category_scores_gemma":[0.004039988,0.0006719771,0.00092230004,0.0014571311,0.003205997,0.004935931,0.0018765819,0.0025645155,0.0006217388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003551448,0.000021107693,0.00018941498,0.000016250024,0.00000573027,0.000060507013,0.00017091895,0.0005643675,0.00081308413,0.9962915,0.00044540377,0.0013862938],"study_design_scores_gemma":[0.000015348205,0.0000095387095,0.00021833878,0.0000044119483,0.0000072148027,0.000058445334,0.000061540304,0.0028861247,0.0003302957,0.9954953,0.0009030462,0.000010492271],"about_ca_topic_score_codex":0.0018670238,"about_ca_topic_score_gemma":0.0025489756,"teacher_disagreement_score":0.008200183,"about_ca_system_score_codex":0.0011744178,"about_ca_system_score_gemma":0.0009748019,"threshold_uncertainty_score":0.027432323},"labels":[],"label_agreement":null},{"id":"W2164133693","doi":"10.1016/j.jcta.2016.08.003","title":"Sign variation, the Grassmannian, and total positivity","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Grassmannian; Linear subspace; Sign (mathematics); Mathematics; Combinatorics; Subspace topology; Matroid; Sequence (biology); Dimension (graph theory); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.014449102648179375,"score_gpt":0.2663213028469291,"score_spread":0.25187220019874973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164133693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6258894,0.0027860287,0.12249289,0.0049303835,0.001018789,0.000042483232,0.00029303273,0.00024842235,0.24229845],"genre_scores_gemma":[0.9753219,0.00075054326,0.0052084965,0.00040052517,0.00052278,0.000023661067,0.00009140463,0.00008241388,0.017598277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994836,0.00015324293,0.000027467582,0.0001099004,0.00012966472,0.00009611626],"domain_scores_gemma":[0.9987815,0.0003577483,0.00021437698,0.00017124465,0.00019745529,0.00027767403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008980471,0.000534449,0.0007181123,0.001547645,0.0018084799,0.002626374,0.00088376517,0.00083981315,0.0074493457],"category_scores_gemma":[0.0029560288,0.00036577915,0.0006569273,0.0011691042,0.0057810633,0.004617828,0.0021982654,0.0019406454,0.00053236296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016872036,0.0000060096254,0.00012130258,0.0000107026235,0.0000034097484,0.000037620062,0.000070585804,0.00024364635,0.0004228423,0.99611664,0.00059819024,0.0023521031],"study_design_scores_gemma":[0.000004472751,0.000007056449,0.00016265517,0.000003105289,0.0000027052286,0.0000659154,0.000026913445,0.00071050855,0.00008371046,0.9981172,0.0008106149,0.0000051986394],"about_ca_topic_score_codex":0.00070667325,"about_ca_topic_score_gemma":0.00097499223,"teacher_disagreement_score":0.0074493457,"about_ca_system_score_codex":0.0007136719,"about_ca_system_score_gemma":0.0007014096,"threshold_uncertainty_score":0.024920583},"labels":[],"label_agreement":null},{"id":"W2165133602","doi":"10.1016/j.jcta.2013.06.009","title":"Distinct distances on two lines","year":2013,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Omega; Combinatorics; Line (geometry); Mathematics; Plane (geometry); Physics; Geometry","score_opus":0.013910387833546624,"score_gpt":0.2673390019252354,"score_spread":0.25342861409168876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165133602","genre_codex":"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.5555668,0.0005483387,0.2743194,0.0032169805,0.00091008365,0.0001792102,0.001205719,0.0006254362,0.16342796],"genre_scores_gemma":[0.8206826,0.00037176214,0.11211375,0.00050519424,0.0002625813,0.00015931601,0.0010855865,0.00042325622,0.064395905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990902,0.00016439865,0.00004459327,0.00024801423,0.0003331167,0.00011977149],"domain_scores_gemma":[0.997517,0.00094244466,0.00032630985,0.0003562036,0.000482028,0.00037604518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038167028,0.0006605142,0.00065153925,0.0022459966,0.0016081203,0.0027621384,0.0016540122,0.0020272774,0.020831887],"category_scores_gemma":[0.0046636723,0.0005721306,0.00047237196,0.0015805545,0.0019188895,0.0033035462,0.0025158382,0.0035192005,0.0029078603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015543189,0.00006534501,0.00072336785,0.000081930986,0.00001815985,0.00025838782,0.0002794129,0.0030391237,0.004582535,0.959886,0.005603922,0.025306392],"study_design_scores_gemma":[0.00007302218,0.000051297768,0.0006595888,0.00005048422,0.00002175509,0.00038768238,0.00044693114,0.018554736,0.0040436015,0.953435,0.022243297,0.000032643],"about_ca_topic_score_codex":0.0004053635,"about_ca_topic_score_gemma":0.0005106834,"teacher_disagreement_score":0.020831887,"about_ca_system_score_codex":0.00084673514,"about_ca_system_score_gemma":0.00029943415,"threshold_uncertainty_score":0.06968957},"labels":[],"label_agreement":null},{"id":"W2165510821","doi":"10.1016/j.jcta.2015.12.002","title":"Inequivalent factorizations of permutations","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Permutation (music); Mathematics; Enumeration; Disjoint sets; Combinatorics; Transitive relation; Equivalence relation; Monotone polygon; Equivalence (formal languages); Discrete mathematics; Relation (database); Series (stratigraphy); Computer science","score_opus":0.016639644029016812,"score_gpt":0.22281031841786625,"score_spread":0.20617067438884945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165510821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5001224,0.0009434996,0.20348239,0.0024617834,0.0015426589,0.00022875213,0.0009841289,0.00054071244,0.28969377],"genre_scores_gemma":[0.9102655,0.0005055152,0.047459837,0.00073564437,0.0004672572,0.00015599506,0.0009198875,0.00026017497,0.03923029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982247,0.0004062429,0.00013356675,0.00033828677,0.00039671408,0.00050051074],"domain_scores_gemma":[0.9978655,0.00083901006,0.00021940406,0.00042373515,0.00035293994,0.00029945225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012946029,0.0009642555,0.0010187058,0.0020962069,0.002838767,0.0043939506,0.0010342519,0.001854021,0.020840062],"category_scores_gemma":[0.0034887944,0.00083758304,0.0013328837,0.0012103613,0.0034716935,0.004619759,0.0020301503,0.0026710592,0.0026676026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035678026,0.00002950414,0.00009345918,0.000016506849,0.0000034546229,0.00009422723,0.00020128895,0.00029258613,0.0007189962,0.9940884,0.0010365851,0.0033893348],"study_design_scores_gemma":[0.00001580014,0.000010902767,0.00007679806,0.000012301617,0.0000042586335,0.00010406644,0.000112653535,0.0013371465,0.00029787837,0.9955342,0.0024832468,0.000010689563],"about_ca_topic_score_codex":0.0008709597,"about_ca_topic_score_gemma":0.0013012796,"teacher_disagreement_score":0.020840062,"about_ca_system_score_codex":0.0012781299,"about_ca_system_score_gemma":0.00077847944,"threshold_uncertainty_score":0.06971693},"labels":[],"label_agreement":null},{"id":"W2179035910","doi":"10.1016/j.jcta.2013.07.008","title":"Transition matrices for symmetric and quasisymmetric Hall–Littlewood polynomials","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Ring of symmetric functions; Pure mathematics; Combinatorics; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.02037149803948858,"score_gpt":0.2835089170388023,"score_spread":0.26313741899931375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179035910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7488341,0.0007761026,0.16924468,0.0018132206,0.0006083505,0.00010839472,0.0004927007,0.00050848833,0.07761392],"genre_scores_gemma":[0.9772645,0.00028618673,0.008439957,0.00024700665,0.0003021397,0.0000516564,0.00016327218,0.000086826316,0.013158434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995523,0.00009439205,0.000019037927,0.00007709221,0.000116194366,0.00014094412],"domain_scores_gemma":[0.99800104,0.00087141205,0.00030322679,0.00016869228,0.00017920435,0.00047637935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008376202,0.00052567775,0.00051049166,0.0021414359,0.0016380239,0.0024435553,0.0009728965,0.0010788733,0.013272501],"category_scores_gemma":[0.0035480103,0.00036885223,0.00051811675,0.0012117871,0.0023731885,0.0029026526,0.0011428115,0.0019326435,0.001132488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045814522,0.000022594644,0.0001564783,0.0000140639095,0.0000017815794,0.00005253262,0.00014023228,0.0005569603,0.0007752727,0.994048,0.00073653535,0.0034497846],"study_design_scores_gemma":[0.000020127403,0.000021945149,0.00027272673,0.000009985514,0.0000039584856,0.00010151971,0.000092033384,0.0072168116,0.0006435277,0.9903279,0.0012682464,0.000021227737],"about_ca_topic_score_codex":0.00081147766,"about_ca_topic_score_gemma":0.0012535296,"teacher_disagreement_score":0.013272501,"about_ca_system_score_codex":0.0009385478,"about_ca_system_score_gemma":0.00077084795,"threshold_uncertainty_score":0.04440093},"labels":[],"label_agreement":null},{"id":"W2183648216","doi":"10.1016/j.jcta.2017.08.012","title":"A marvellous embedding of the Lagrangian Grassmannian","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection, injection and surjection; Bijection; Embedding; Mathematics; Diagonal; Combinatorics; Grassmannian; Pure mathematics; Geometry","score_opus":0.0255410018380399,"score_gpt":0.31276091165124276,"score_spread":0.28721990981320283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183648216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67908186,0.0009512185,0.121376544,0.003636201,0.000785401,0.0000783044,0.00042292685,0.00038566403,0.19328187],"genre_scores_gemma":[0.94437593,0.00036718763,0.01855653,0.00043891696,0.00046719573,0.000032562264,0.00022392983,0.00019687135,0.035340995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969304,0.0000604136,0.000011598513,0.00007882552,0.00008597656,0.00007027106],"domain_scores_gemma":[0.99967754,0.000042795342,0.000054877248,0.00003909413,0.00005127611,0.00013453861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003508824,0.0006423689,0.0005236422,0.0014007104,0.001624107,0.0024169923,0.0008901894,0.001091369,0.007540947],"category_scores_gemma":[0.0009588526,0.00037657504,0.0005016828,0.00049876096,0.0021685378,0.0031527698,0.0019163797,0.0021709257,0.001213344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026670654,0.000015833426,0.00010606582,0.000016679613,0.0000032174153,0.000085573316,0.00017728192,0.00039235584,0.0013129722,0.99447215,0.00079998496,0.0025911517],"study_design_scores_gemma":[0.000012731063,0.000025528028,0.00020781167,0.00001014796,0.0000043014593,0.00012088969,0.00011771137,0.00471244,0.00031195066,0.99033266,0.004133477,0.000010349718],"about_ca_topic_score_codex":0.0013065634,"about_ca_topic_score_gemma":0.0015085692,"teacher_disagreement_score":0.007540947,"about_ca_system_score_codex":0.0009995698,"about_ca_system_score_gemma":0.00049069646,"threshold_uncertainty_score":0.02522695},"labels":[],"label_agreement":null},{"id":"W2254138235","doi":"10.1006/jcta.1999.3031","title":"Truncated Transversal Designs: A New Lower Bound on the Number of Idempotent MOLS of Side n","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transversal (combinatorics); Mathematics; Disjoint sets; Combinatorics; Corollary; Idempotence; Type (biology); Upper and lower bounds; Point (geometry); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.011410803374765703,"score_gpt":0.2144298490886143,"score_spread":0.20301904571384857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254138235","genre_codex":"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.34098944,0.0021397772,0.5634026,0.0016756825,0.00052747456,0.0002691711,0.0014250168,0.00095955096,0.088611364],"genre_scores_gemma":[0.7404122,0.0021568232,0.21587935,0.0008675003,0.00061313243,0.0005769583,0.0015185481,0.0005574697,0.03741806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724567,0.0006217301,0.00021289669,0.0005361361,0.00090727484,0.00047630077],"domain_scores_gemma":[0.9876364,0.00709515,0.0009237754,0.0025815433,0.00092248654,0.00084075105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026417107,0.0015327119,0.0014603859,0.0015121828,0.0015824399,0.003528639,0.0024863086,0.0021593918,0.015152864],"category_scores_gemma":[0.011851949,0.001084405,0.0013039756,0.0012968632,0.002348166,0.0059465016,0.0034113196,0.0037668291,0.0025712654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024787735,0.00036420877,0.0049209427,0.00079178315,0.00017175857,0.0009880046,0.000577107,0.053119272,0.07368058,0.73181003,0.01391629,0.11718126],"study_design_scores_gemma":[0.00019286002,0.0005984673,0.0013686036,0.00021158073,0.00018640532,0.0015728271,0.0001659994,0.18758987,0.028879032,0.7625309,0.016588453,0.00011486869],"about_ca_topic_score_codex":0.00030636808,"about_ca_topic_score_gemma":0.00080941763,"teacher_disagreement_score":0.015152864,"about_ca_system_score_codex":0.0013621398,"about_ca_system_score_gemma":0.0012847737,"threshold_uncertainty_score":0.050691426},"labels":[],"label_agreement":null},{"id":"W2255049322","doi":"10.1016/j.jcta.2016.08.002","title":"Four-dimensional polytopes of minimum positive semidefinite rank","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação para a Ciência e a Tecnologia; European Regional Development Fund; Fonds De La Recherche Scientifique - FNRS; Ministério da Educação e Ciência; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Polytope model; Rank (graph theory); Birkhoff polytope; Discrete mathematics; Regular polygon","score_opus":0.031160743924278166,"score_gpt":0.30007566497242666,"score_spread":0.2689149210481485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255049322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74042857,0.000663456,0.090505466,0.0021671057,0.00042366004,0.00011769732,0.0016004262,0.00033313545,0.16376045],"genre_scores_gemma":[0.9474095,0.00036293466,0.01868891,0.00031255072,0.00024452343,0.0001225682,0.00083504076,0.00015777156,0.031866193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994566,0.0001123208,0.000026420497,0.000087598404,0.00018557657,0.00013137882],"domain_scores_gemma":[0.9989768,0.00034180982,0.00020477506,0.0000760544,0.00011504973,0.00028551818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040679384,0.0009361388,0.0011058364,0.0019993105,0.0016390294,0.0044201403,0.0014779711,0.001199196,0.015289825],"category_scores_gemma":[0.0015329651,0.0005754464,0.000660909,0.0010137212,0.0025415136,0.0020480442,0.001597844,0.0021579836,0.0015132128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001476003,0.000064782595,0.00030832653,0.00006727895,0.00002099101,0.00019654597,0.00013441878,0.006768225,0.0023044674,0.9811489,0.0038754574,0.004963091],"study_design_scores_gemma":[0.00008614292,0.000046682497,0.00047964026,0.000027108528,0.000013670104,0.00029913106,0.00022874404,0.033203084,0.0014093028,0.9583791,0.005782987,0.00004434786],"about_ca_topic_score_codex":0.00093048014,"about_ca_topic_score_gemma":0.0010157257,"teacher_disagreement_score":0.015289825,"about_ca_system_score_codex":0.0010079296,"about_ca_system_score_gemma":0.00053654786,"threshold_uncertainty_score":0.051149547},"labels":[],"label_agreement":null},{"id":"W2295702520","doi":"10.1016/j.jcta.2016.12.006","title":"Constructions and nonexistence results for suitable sets of permutations","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Set (abstract data type); Discrete mathematics; Computer science; Physics","score_opus":0.04575628242448536,"score_gpt":0.3403808837993896,"score_spread":0.2946246013749042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295702520","genre_codex":"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.30873975,0.0030223904,0.4995187,0.0069208313,0.00086426904,0.00018802636,0.0006890086,0.00070987747,0.17934705],"genre_scores_gemma":[0.8601199,0.0018308074,0.10345181,0.0011371189,0.0007168379,0.0005934359,0.0008809011,0.0005120852,0.030757057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536777,0.0015994968,0.00046558227,0.0011020048,0.0010092037,0.00045597614],"domain_scores_gemma":[0.98589015,0.009754974,0.00068467227,0.0019276785,0.0009284346,0.0008140639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005000825,0.0013701441,0.0020307049,0.0041244854,0.006968595,0.0090034455,0.0035987797,0.004659352,0.008605766],"category_scores_gemma":[0.017848054,0.002328991,0.0035332278,0.0038400914,0.00781264,0.02005027,0.009484341,0.010558327,0.0012577196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012459596,0.000013748259,0.00011355378,0.000024099028,0.000004865113,0.000055799366,0.00021636982,0.00016645782,0.00021599996,0.997827,0.00025419236,0.0010954516],"study_design_scores_gemma":[0.00000804873,0.00000625674,0.00005357125,0.000014718963,0.00001377341,0.00014971591,0.00012076762,0.0012330115,0.000379539,0.996117,0.0018937403,0.00000984101],"about_ca_topic_score_codex":0.00035058128,"about_ca_topic_score_gemma":0.00040183982,"teacher_disagreement_score":0.0090034455,"about_ca_system_score_codex":0.0022353895,"about_ca_system_score_gemma":0.001021057,"threshold_uncertainty_score":0.028789222},"labels":[],"label_agreement":null},{"id":"W2337358905","doi":"10.1016/j.jcta.2016.11.001","title":"An upper bound for the size of a k-uniform intersecting family with covering number k","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Geometry; Mathematical analysis","score_opus":0.019286416900040262,"score_gpt":0.29779499393241077,"score_spread":0.27850857703237053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337358905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.796561,0.0029025674,0.13173707,0.003478669,0.0002588765,0.00013746023,0.0040791696,0.0013649459,0.05948022],"genre_scores_gemma":[0.94573766,0.0015956528,0.042980168,0.00038455654,0.000397332,0.00022523159,0.0023265816,0.00035615833,0.0059967176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664116,0.0005319536,0.00023655068,0.00098193,0.0008614132,0.0007470545],"domain_scores_gemma":[0.95957065,0.030092351,0.0021350682,0.0036331497,0.0015482325,0.0030204507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002535659,0.0013971525,0.002690459,0.003358276,0.0033949567,0.006205584,0.004958785,0.0030891383,0.011403734],"category_scores_gemma":[0.027268395,0.0017012965,0.0022815848,0.0032779423,0.0038554897,0.011266276,0.004861704,0.0033917234,0.001253412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024741383,0.00040652297,0.031387947,0.0015942601,0.00053156656,0.001768961,0.0022511026,0.077203155,0.05554586,0.7665028,0.017225415,0.043108307],"study_design_scores_gemma":[0.00014048978,0.00029006184,0.0091334935,0.00026530089,0.0004403391,0.00489967,0.00067434646,0.25590488,0.021835282,0.6915293,0.014681676,0.00020516296],"about_ca_topic_score_codex":0.0010780704,"about_ca_topic_score_gemma":0.0006331713,"teacher_disagreement_score":0.011403734,"about_ca_system_score_codex":0.0026381789,"about_ca_system_score_gemma":0.00093883317,"threshold_uncertainty_score":0.038149297},"labels":[],"label_agreement":null},{"id":"W2343027471","doi":"10.1016/j.jcta.2017.02.006","title":"Cutting algebraic curves into pseudo-segments and applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Constant (computer programming); Upper and lower bounds; Degree (music); Plane (geometry); Algebraic number; Plane curve; Combinatorics; Algebraic curve; Family of curves; Space (punctuation); Current (fluid); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.008612297358442805,"score_gpt":0.26262579572424116,"score_spread":0.25401349836579834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343027471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.1700513,0.0019493776,0.76156694,0.00065091974,0.0003402897,0.00014325029,0.00015195129,0.0005216683,0.064624354],"genre_scores_gemma":[0.60642594,0.00230098,0.36040407,0.00017533629,0.0002161942,0.0001045871,0.00037357552,0.00045574072,0.029543644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.00008225119,0.000027914188,0.00009938271,0.0001601743,0.000047555965],"domain_scores_gemma":[0.9991906,0.00032637545,0.00007265799,0.00016973427,0.00014669691,0.00009390697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062635,0.00071525323,0.0006136313,0.0021038735,0.00087735336,0.001952008,0.0013391504,0.0010366593,0.009849164],"category_scores_gemma":[0.002633632,0.0006112497,0.00072944805,0.002245686,0.0015093919,0.0020596578,0.0024360511,0.0020234452,0.0012412232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008920481,0.000098196535,0.0008538516,0.00018148405,0.000019268138,0.00014252306,0.00039248174,0.033507507,0.00983607,0.77248734,0.0030249332,0.17936705],"study_design_scores_gemma":[0.000028486993,0.0001841281,0.00066489074,0.000105273146,0.000032268974,0.00051161775,0.0004349294,0.20068336,0.00841254,0.749411,0.03949522,0.000036361136],"about_ca_topic_score_codex":0.00039675916,"about_ca_topic_score_gemma":0.0005492226,"teacher_disagreement_score":0.009849164,"about_ca_system_score_codex":0.00060057844,"about_ca_system_score_gemma":0.0003205607,"threshold_uncertainty_score":0.032948732},"labels":[],"label_agreement":null},{"id":"W2443570680","doi":"10.1016/j.jcta.2018.01.006","title":"Dual Immaculate Quasisymmetric Functions Expand Positively into Young Quasisymmetric Schur Functions","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Dual (grammatical number); Noncommutative geometry; Combinatorics; Schur's lemma; Young tableau; Decomposition; Symmetric function; Schur algebra; Schur's theorem; Dual function; Function (biology); Pure mathematics; Computer science; Chemistry","score_opus":0.02731809846106409,"score_gpt":0.30899481540139667,"score_spread":0.2816767169403326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2443570680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51907873,0.00028016337,0.32430765,0.0006261418,0.0005154312,0.00014583781,0.00023342716,0.00039495804,0.15441762],"genre_scores_gemma":[0.9135334,0.00039962993,0.044110265,0.0003333788,0.0002448965,0.00010031774,0.00017385848,0.00035458893,0.0407497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996736,0.000046260036,0.000012554274,0.000044104483,0.00013382084,0.00008969025],"domain_scores_gemma":[0.99953747,0.00011494404,0.000058369253,0.000046668287,0.0001369575,0.00010569588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045711,0.00072557665,0.00033030982,0.0014549562,0.00063766114,0.0018029853,0.0006542971,0.0004963708,0.010176669],"category_scores_gemma":[0.0016508986,0.00036094876,0.00056209316,0.00052386656,0.0016699536,0.0029758147,0.0012575417,0.0015711803,0.0018892472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003080468,0.000019963734,0.00024145885,0.000023605864,0.000002879614,0.00016760782,0.00014322031,0.00047636,0.006299083,0.9853279,0.00072880817,0.0065382957],"study_design_scores_gemma":[0.000030217801,0.00007250111,0.00077231333,0.000041374315,0.000018386689,0.0009376152,0.00031535243,0.020285543,0.023503663,0.93794805,0.016036568,0.00003843593],"about_ca_topic_score_codex":0.00033151082,"about_ca_topic_score_gemma":0.0005692911,"teacher_disagreement_score":0.010176669,"about_ca_system_score_codex":0.00072350836,"about_ca_system_score_gemma":0.00038631802,"threshold_uncertainty_score":0.034044325},"labels":[],"label_agreement":null},{"id":"W2521932407","doi":"10.1016/j.jcta.2017.06.008","title":"Weighted lattice walks and universality classes","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Universality (dynamical systems); Random walk; Generating function; Combinatorics; Lattice (music); Algebraic number; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.02951541638307812,"score_gpt":0.3153242338792457,"score_spread":0.28580881749616754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521932407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8171185,0.0010003664,0.09238395,0.0020228175,0.00021857172,0.000042042877,0.00032676818,0.00024037478,0.08664658],"genre_scores_gemma":[0.97928786,0.00042549372,0.0065685287,0.00019683583,0.00020589045,0.000050033672,0.00021119454,0.00009912962,0.012955045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992386,0.00016528083,0.00003310977,0.00020473302,0.00018065024,0.00017758681],"domain_scores_gemma":[0.99704844,0.0012933945,0.00042848501,0.00026293984,0.00025630885,0.0007105635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083320256,0.00061270787,0.0008704454,0.0034660315,0.0027461434,0.0041840374,0.0012819726,0.0012211076,0.010602094],"category_scores_gemma":[0.004064432,0.0006771874,0.00071047805,0.0027832217,0.003748653,0.006513893,0.00276173,0.0026516593,0.0006293629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018235829,0.000016464583,0.0004023427,0.000012977887,0.0000060866755,0.000029798102,0.00015220608,0.0003856957,0.00030602896,0.99556243,0.00043724,0.0026705575],"study_design_scores_gemma":[0.0000074182017,0.0000037375698,0.00023918279,0.000007653922,0.0000068317454,0.00004872528,0.0000706665,0.0020472843,0.00011977259,0.9963581,0.0010846604,0.000006067039],"about_ca_topic_score_codex":0.0011042241,"about_ca_topic_score_gemma":0.0015895729,"teacher_disagreement_score":0.010602094,"about_ca_system_score_codex":0.0011902613,"about_ca_system_score_gemma":0.00041236664,"threshold_uncertainty_score":0.035467505},"labels":[],"label_agreement":null},{"id":"W2522011589","doi":"10.1016/j.jcta.2018.03.012","title":"Subalgebras of Solomon's descent algebra based on alternating runs","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Descent (aeronautics); Mathematics; Noncommutative geometry; Permutation (music); Eulerian path; Symmetric group; Commutative property; Algebra over a field; Pure mathematics; Lagrangian; Physics","score_opus":0.023966803463956726,"score_gpt":0.3041818992252612,"score_spread":0.28021509576130443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522011589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6700833,0.00063645357,0.16575551,0.0010788882,0.00057389966,0.00011191429,0.0005456533,0.00069122505,0.16052316],"genre_scores_gemma":[0.94716215,0.0002289171,0.019577056,0.00030721488,0.00028932176,0.000078782316,0.00033486428,0.00017550813,0.031846255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929667,0.00016726514,0.000039669663,0.000106885855,0.00023565635,0.00015382993],"domain_scores_gemma":[0.99940574,0.00011694312,0.00007913658,0.00007002839,0.00012597156,0.00020221111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063132314,0.0006904563,0.0009232497,0.0017969684,0.0021254749,0.0023964264,0.0012291097,0.0008413558,0.006805491],"category_scores_gemma":[0.0011643647,0.00035776052,0.0009960054,0.0010247793,0.0018575179,0.003103284,0.0018717411,0.001896328,0.0015296742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036867943,0.000021297194,0.00012710001,0.000012595159,0.0000070686406,0.00007393985,0.000119957185,0.0003496042,0.001218711,0.9954917,0.00043464534,0.0021066074],"study_design_scores_gemma":[0.000015191375,0.000025576606,0.00017582577,0.000006372109,0.000009837282,0.0001360376,0.00007178707,0.0033202427,0.000910883,0.99291575,0.002394585,0.000017911425],"about_ca_topic_score_codex":0.0010836647,"about_ca_topic_score_gemma":0.001253384,"teacher_disagreement_score":0.006805491,"about_ca_system_score_codex":0.00089364016,"about_ca_system_score_gemma":0.0007531188,"threshold_uncertainty_score":0.02276659},"labels":[],"label_agreement":null},{"id":"W2529358956","doi":"10.1016/j.jcta.2017.11.020","title":"A graphical calculus for the Jack inner product on symmetric functions","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Inner product space; Product (mathematics); Space (punctuation); Mathematics; Planar; Superalgebra; String (physics); Pure mathematics; Symmetric function; Realization (probability); Action (physics); Combinatorics; Calculus (dental); Algebra over a field; Geometry; Mathematical physics; Physics; Computer science; Quantum mechanics","score_opus":0.03376618277547973,"score_gpt":0.3056247157401893,"score_spread":0.2718585329647096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529358956","genre_codex":"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.082040995,0.0015585386,0.7515876,0.0028005592,0.0011352556,0.000114971,0.0004421938,0.000559663,0.15976031],"genre_scores_gemma":[0.8098881,0.0014089899,0.13000107,0.0015382867,0.0015573594,0.0002764527,0.00042120085,0.0006973243,0.054211166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998723,0.00040581304,0.0000817452,0.00024161408,0.00035132284,0.00019649793],"domain_scores_gemma":[0.9988593,0.00043930483,0.00011726862,0.00016850451,0.0002071416,0.00020842325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060147,0.0011918003,0.0014820152,0.003417833,0.0032636358,0.0055127866,0.0021412615,0.0020016553,0.009871793],"category_scores_gemma":[0.0027256564,0.0010579939,0.001809291,0.0026412634,0.005495093,0.007859294,0.0034703575,0.004453366,0.0016543263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002883999,0.000006794934,0.0000230532,0.000006130889,0.0000017605406,0.000026443331,0.00009178902,0.00015006034,0.000120196506,0.9983171,0.0003258119,0.0009279252],"study_design_scores_gemma":[0.00000435217,0.00000546936,0.00003936036,0.0000067093215,0.000005130208,0.000047475387,0.000032871598,0.0020431078,0.000105543426,0.9948514,0.0028497707,0.000008885482],"about_ca_topic_score_codex":0.0020294597,"about_ca_topic_score_gemma":0.00201154,"teacher_disagreement_score":0.009871793,"about_ca_system_score_codex":0.0020019847,"about_ca_system_score_gemma":0.00091243547,"threshold_uncertainty_score":0.03302437},"labels":[],"label_agreement":null},{"id":"W2594692962","doi":"10.1016/j.jcta.2013.05.008","title":"There is no upper bound for the diameter of the commuting graph of a finite group","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Construct (python library); Finite group; Group (periodic table); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.03221502957088206,"score_gpt":0.2928860373630313,"score_spread":0.26067100779214925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594692962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5771437,0.010928627,0.23310274,0.021889115,0.0016552143,0.00012230325,0.0024937363,0.0028346248,0.14982991],"genre_scores_gemma":[0.93788433,0.0031500536,0.039733723,0.0025874346,0.0022987379,0.00028872176,0.001581686,0.0010517949,0.011423528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620205,0.0006581579,0.0001976517,0.0016119875,0.0005754705,0.00075469585],"domain_scores_gemma":[0.9336399,0.050560355,0.0020069277,0.0057101706,0.0013468396,0.006735833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032923315,0.0019317524,0.0050848066,0.0030753377,0.0043529444,0.006388215,0.0070466553,0.0039651184,0.013715669],"category_scores_gemma":[0.018567529,0.0024634944,0.002422311,0.0019067825,0.006602398,0.018340787,0.005735103,0.008263993,0.0017251734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014958587,0.00025810857,0.0064768493,0.0010610768,0.0002918576,0.00058011606,0.0018851554,0.010876269,0.021563554,0.9158092,0.018956795,0.020745233],"study_design_scores_gemma":[0.00013988967,0.00028043473,0.0038877758,0.00017945358,0.00033377137,0.00095787237,0.00050972647,0.037880894,0.007795164,0.92991406,0.017975783,0.00014503587],"about_ca_topic_score_codex":0.0007707917,"about_ca_topic_score_gemma":0.00118187,"teacher_disagreement_score":0.013715669,"about_ca_system_score_codex":0.0022108436,"about_ca_system_score_gemma":0.00080776407,"threshold_uncertainty_score":0.045883417},"labels":[],"label_agreement":null},{"id":"W2732577140","doi":"10.1016/j.jcta.2019.105185","title":"Exponential bounds for the Erdős-Ginzburg-Ziv constant","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Subsequence; Mathematics; Conjecture; Abelian group; Constant (computer programming); Partition (number theory); Exponential function; Rank (graph theory); Upper and lower bounds; Discrete mathematics; Bounded function; Mathematical analysis","score_opus":0.044113817173430846,"score_gpt":0.310377205515471,"score_spread":0.26626338834204016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732577140","genre_codex":"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.24776708,0.035635553,0.25120452,0.033301827,0.002652489,0.0001631882,0.0017197747,0.0013369257,0.4262187],"genre_scores_gemma":[0.9180169,0.01184417,0.02193261,0.0018919547,0.0028379445,0.00037870972,0.00071869977,0.00061499095,0.041764162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981937,0.00044378097,0.00006565957,0.00036539047,0.0005349172,0.00039653908],"domain_scores_gemma":[0.9871241,0.009182099,0.0005634719,0.00093332934,0.0011243697,0.0010727014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051748673,0.0022255173,0.0022551753,0.006682857,0.0027170442,0.0059998464,0.003922324,0.0025951737,0.016477916],"category_scores_gemma":[0.02672007,0.0009084338,0.00116289,0.004533232,0.006639512,0.0162869,0.0059756376,0.009635626,0.003142564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008313116,0.0000416591,0.00038321657,0.00011460771,0.000016561176,0.00005114422,0.00019847076,0.0024463453,0.0004909117,0.98550934,0.0037391428,0.0069254907],"study_design_scores_gemma":[0.000016527929,0.000010171148,0.00030471018,0.00005994797,0.000022701988,0.00006184079,0.000049226153,0.013105336,0.00040466155,0.98243034,0.003513257,0.000021275882],"about_ca_topic_score_codex":0.0019152318,"about_ca_topic_score_gemma":0.001487494,"teacher_disagreement_score":0.016477916,"about_ca_system_score_codex":0.006159057,"about_ca_system_score_gemma":0.0018098793,"threshold_uncertainty_score":0.055124104},"labels":[],"label_agreement":null},{"id":"W2754741933","doi":"10.1016/j.jcta.2018.07.005","title":"Promotion on generalized oscillating tableaux and web rotation","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Promotion (chess); Young tableau; Rotation (mathematics); Computer science; Pure mathematics; Mathematics; Combinatorics; Geometry; Political science","score_opus":0.03392842528636295,"score_gpt":0.30086210994625934,"score_spread":0.26693368465989636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754741933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64711684,0.0010012455,0.09412277,0.0025606034,0.001198278,0.00012094621,0.0003814362,0.00072879967,0.25276905],"genre_scores_gemma":[0.93559456,0.00046389477,0.01041993,0.00043578615,0.0005028759,0.00007407444,0.000214937,0.00033631086,0.051957596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945396,0.00011970876,0.00002201293,0.0001066235,0.00013743395,0.00016020758],"domain_scores_gemma":[0.9992693,0.00021906788,0.00012199163,0.00013583657,0.000075954296,0.00017781343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041623335,0.0007328081,0.0009525248,0.0014082132,0.0017791121,0.003469668,0.0009892224,0.001732938,0.01939643],"category_scores_gemma":[0.0018841962,0.0004934735,0.00082620804,0.0010575438,0.0021975457,0.0039468203,0.0019600377,0.0017639768,0.0022041248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031019004,0.000018849229,0.00010680649,0.000012808769,0.0000018500621,0.000119978846,0.00008444272,0.0008670517,0.000717437,0.994785,0.001008075,0.0022466886],"study_design_scores_gemma":[0.000023588462,0.000013430974,0.0001271022,0.000010290228,0.000004495716,0.0001692965,0.000075384814,0.008005168,0.00044385347,0.9884948,0.0026200982,0.000012502757],"about_ca_topic_score_codex":0.0006945801,"about_ca_topic_score_gemma":0.0008769939,"teacher_disagreement_score":0.01939643,"about_ca_system_score_codex":0.00081298844,"about_ca_system_score_gemma":0.0005353887,"threshold_uncertainty_score":0.06488752},"labels":[],"label_agreement":null},{"id":"W2764047484","doi":"10.1016/j.jcta.2019.105181","title":"State transfer in strongly regular graphs with an edge perturbation","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Perturbation (astronomy); Mathematics; Quantum walk; Algebraic number; Graph; Quantum; Strongly regular graph; Combinatorics; Discrete mathematics; Line graph; Physics; Quantum computer; Quantum mechanics; Graph power; Mathematical analysis","score_opus":0.006800926363474224,"score_gpt":0.21704227831666595,"score_spread":0.2102413519531917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764047484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72496873,0.00022622505,0.21503006,0.002495695,0.00045374493,0.00015841113,0.0002168379,0.0010186814,0.055431716],"genre_scores_gemma":[0.97725815,0.000093947296,0.011163777,0.00026227036,0.000111003654,0.00006777788,0.000073490286,0.00012967979,0.01083985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993697,0.00022314594,0.000022666094,0.000094229385,0.00014987713,0.00014039803],"domain_scores_gemma":[0.99834335,0.00081951614,0.00013594607,0.00032983476,0.00010725551,0.00026412055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008735907,0.00058684393,0.0011284583,0.0011913911,0.0016642801,0.0021629063,0.0015241331,0.0023443399,0.008780014],"category_scores_gemma":[0.003488619,0.00047509646,0.001010945,0.0007855581,0.0025987062,0.0034692874,0.002188792,0.0021306276,0.0007510912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022051261,0.00016679346,0.0003140112,0.000056429777,0.000022098702,0.00024660563,0.00016477151,0.021654166,0.0055424604,0.9650303,0.0012871585,0.0052945595],"study_design_scores_gemma":[0.00003878333,0.000050986437,0.00019376028,0.000007888431,0.000011049106,0.000098603574,0.00007070083,0.16966638,0.0017029404,0.8277978,0.0003420147,0.000019061654],"about_ca_topic_score_codex":0.0005010403,"about_ca_topic_score_gemma":0.00037095216,"teacher_disagreement_score":0.008780014,"about_ca_system_score_codex":0.0008072112,"about_ca_system_score_gemma":0.0006667515,"threshold_uncertainty_score":0.029372036},"labels":[],"label_agreement":null},{"id":"W2775067917","doi":"10.1016/j.jcta.2018.09.003","title":"Permuted composition tableaux, 0-Hecke algebra and labeled binary trees","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Combinatorics; Mathematics; Composition (language); Young tableau; Descent (aeronautics); Equivalence (formal languages); Binary number; Equivalence relation; Generalization; Discrete mathematics; Arithmetic; Physics; Linguistics","score_opus":0.023677703957730757,"score_gpt":0.2981074055268169,"score_spread":0.27442970156908614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775067917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59827065,0.0022020228,0.20499225,0.0030837017,0.0012878482,0.00011192013,0.0011160363,0.0006551354,0.1882805],"genre_scores_gemma":[0.9088679,0.000942337,0.034434084,0.00054118864,0.00066382886,0.00006431047,0.00069486786,0.00021943594,0.05357206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929404,0.00017012362,0.000039375944,0.0001511938,0.00019530026,0.00014993295],"domain_scores_gemma":[0.99929845,0.00026523363,0.00011431133,0.00009758219,0.0001028063,0.0001215831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009052434,0.0005608711,0.000747198,0.0013226023,0.002528498,0.003769197,0.0009923531,0.0012202134,0.0096536],"category_scores_gemma":[0.001776351,0.00055807206,0.0007614031,0.0018633326,0.0027090544,0.0047185617,0.0013882887,0.001967212,0.0017054968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030654446,0.000018860546,0.000119155164,0.000016145796,0.0000027283315,0.00005391667,0.00010062677,0.0004041495,0.00056511245,0.99467635,0.0006712956,0.003341015],"study_design_scores_gemma":[0.0000074756394,0.000005741619,0.000066011715,0.0000045933302,0.0000030967776,0.000044642766,0.000027978376,0.0011556059,0.00032500163,0.9965963,0.0017557229,0.000007923622],"about_ca_topic_score_codex":0.0012113238,"about_ca_topic_score_gemma":0.0015229122,"teacher_disagreement_score":0.0096536,"about_ca_system_score_codex":0.0011097509,"about_ca_system_score_gemma":0.00085598096,"threshold_uncertainty_score":0.03229451},"labels":[],"label_agreement":null},{"id":"W2781906402","doi":"10.1016/j.jcta.2018.08.003","title":"A bound on the inducibility of cycles","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme","keywords":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Physics","score_opus":0.036263694401268004,"score_gpt":0.30648365309322384,"score_spread":0.2702199586919558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781906402","genre_codex":"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.3665656,0.009889099,0.21273659,0.023037577,0.001507888,0.0001927216,0.0024861984,0.0023566787,0.3812277],"genre_scores_gemma":[0.93004996,0.0036532138,0.033880416,0.002907315,0.0022552714,0.00030999913,0.0013873642,0.0010121193,0.024544286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952094,0.0010438684,0.0002895358,0.0014122798,0.0011438092,0.00090120715],"domain_scores_gemma":[0.93941915,0.04805484,0.0014217761,0.004864888,0.0020190263,0.0042203283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005060212,0.0017884065,0.003004626,0.0043807994,0.0041377153,0.008328485,0.005024105,0.003565786,0.01780474],"category_scores_gemma":[0.030431585,0.0019851509,0.003341587,0.0033928698,0.007821382,0.024756601,0.009180395,0.012161913,0.0019146986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002443099,0.00011326069,0.0012072893,0.00017695683,0.000034251654,0.00018344006,0.0004881736,0.0012988889,0.0016511787,0.9818279,0.003166939,0.009607375],"study_design_scores_gemma":[0.000030413607,0.00003753277,0.00036364756,0.000059387246,0.0000490074,0.00017686104,0.00006958265,0.003860529,0.00091465726,0.9904661,0.003948351,0.000023997683],"about_ca_topic_score_codex":0.000693782,"about_ca_topic_score_gemma":0.0007684742,"teacher_disagreement_score":0.01780474,"about_ca_system_score_codex":0.0027084965,"about_ca_system_score_gemma":0.0014109692,"threshold_uncertainty_score":0.059562802},"labels":[],"label_agreement":null},{"id":"W2808988185","doi":"10.1016/j.jcta.2019.105204","title":"Chordality, d-collapsibility, and componentwise linear ideals","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Research in Fundamental Sciences; National Science Foundation","keywords":"Betti number; Dual polyhedron; Mathematics; Ideal (ethics); Chordal graph; Combinatorics; Vertex (graph theory); Simplicial complex; Polynomial ring; Monomial ideal; Discrete mathematics; Polynomial; Graph; Mathematical analysis","score_opus":0.06670502554353652,"score_gpt":0.35442728357235437,"score_spread":0.28772225802881785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808988185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68874687,0.0035457027,0.09493997,0.003019794,0.000521018,0.00006441978,0.00066649204,0.00020269606,0.20829307],"genre_scores_gemma":[0.97734386,0.00095971656,0.0072113895,0.0001646113,0.00034240086,0.000029627166,0.0002734326,0.00003770598,0.0136372205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920803,0.00014688831,0.000052456773,0.00019893085,0.00022331848,0.00017042123],"domain_scores_gemma":[0.99721634,0.0012951547,0.00037923115,0.00026607956,0.00036063447,0.00048246488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552754,0.0006009507,0.0007582588,0.0022090739,0.002055345,0.0040403507,0.0008865091,0.00057142106,0.006711428],"category_scores_gemma":[0.003124927,0.00042778635,0.0007998221,0.0018954299,0.0046077543,0.004782134,0.0038246796,0.0022237953,0.0006665273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068626505,0.000021184816,0.0004913914,0.000031661093,0.000009138079,0.00008846643,0.00016505133,0.0003328337,0.00083382876,0.99395144,0.00055463053,0.0034516694],"study_design_scores_gemma":[0.000014736631,0.000014453239,0.00037508734,0.000008953337,0.00000973573,0.0001464067,0.00014013324,0.0009877327,0.0007760921,0.9954645,0.002052322,0.00000985911],"about_ca_topic_score_codex":0.0013053468,"about_ca_topic_score_gemma":0.000993655,"teacher_disagreement_score":0.006711428,"about_ca_system_score_codex":0.0015631171,"about_ca_system_score_gemma":0.0007203975,"threshold_uncertainty_score":0.022451937},"labels":[],"label_agreement":null},{"id":"W2883399088","doi":"10.1016/j.jcta.2019.105173","title":"Minimal binary 2-neighbour-transitive codes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council","keywords":"Transitive relation; Mathematics; Combinatorics; Alphabet; Permutation (music); Mathematical proof; Discrete mathematics; Transitive closure; Binary number; Permutation group; Class (philosophy); Cyclic permutation; Symmetric group; Computer science; Arithmetic","score_opus":0.01077805819466981,"score_gpt":0.2373821752603489,"score_spread":0.2266041170656791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883399088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6823642,0.00096835394,0.08802727,0.00230739,0.0005560301,0.00021179586,0.0023789709,0.00065949967,0.22252643],"genre_scores_gemma":[0.95248413,0.00033325967,0.016830549,0.0004552874,0.00020263344,0.00012975132,0.0011111059,0.00016820592,0.028284986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988188,0.00022348261,0.00008265191,0.00019734632,0.0004145887,0.00026306583],"domain_scores_gemma":[0.9978321,0.0009351758,0.00027607888,0.000398117,0.00029492888,0.0002635878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044593602,0.0006277209,0.0008645761,0.001685501,0.001580584,0.003038751,0.0011259334,0.0018241822,0.009197148],"category_scores_gemma":[0.003438617,0.00047285418,0.0005555125,0.0012051775,0.0015041893,0.0020720274,0.0022206793,0.0016053697,0.0021226378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035685362,0.000069870635,0.0006479389,0.00013198676,0.000018670742,0.00026151427,0.0003471847,0.0028837642,0.006909806,0.9682529,0.004480916,0.015638562],"study_design_scores_gemma":[0.000078815036,0.0000496875,0.00053670944,0.000046794976,0.000024596347,0.00040088038,0.00011567309,0.0100094685,0.0046557477,0.9775065,0.006540007,0.000035109744],"about_ca_topic_score_codex":0.0006647447,"about_ca_topic_score_gemma":0.00093965017,"teacher_disagreement_score":0.009197148,"about_ca_system_score_codex":0.0010101161,"about_ca_system_score_gemma":0.0009927365,"threshold_uncertainty_score":0.0307675},"labels":[],"label_agreement":null},{"id":"W2922084446","doi":"10.1016/j.jcta.2019.02.019","title":"Products of symmetric group characters","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Symmetric group; Kronecker delta; Basis (linear algebra); Ring (chemistry); Combinatorics; Symmetric function; Group (periodic table); Pure mathematics; Representation theory of the symmetric group; Kronecker product; Algebra over a field; Geometry","score_opus":0.01631038196023676,"score_gpt":0.26545687144788604,"score_spread":0.24914648948764928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922084446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.614778,0.00068287057,0.078720205,0.0014934316,0.0011614208,0.00010379369,0.00046192404,0.0005847359,0.30201364],"genre_scores_gemma":[0.9103733,0.00032570714,0.010127545,0.0003167027,0.0005760714,0.000066898356,0.00034076994,0.0003066172,0.07756642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999052,0.00022138885,0.000054587854,0.00019000411,0.00025359637,0.0002285265],"domain_scores_gemma":[0.99875164,0.0003770816,0.00017862307,0.00017345778,0.0002169186,0.000302345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083630905,0.00091200694,0.00096875645,0.0024176086,0.002305815,0.004496608,0.0010025835,0.001140633,0.018615993],"category_scores_gemma":[0.00184484,0.00072534784,0.0009458146,0.0015633188,0.0028423907,0.0047620195,0.0027457257,0.0018050667,0.0029539664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051884068,0.000028609742,0.00021290367,0.000018596575,0.000008699721,0.00014709763,0.00026138843,0.00015042316,0.0009637918,0.99307775,0.0012402395,0.0038385303],"study_design_scores_gemma":[0.000021442438,0.000030527448,0.00032231162,0.000010870541,0.000016303153,0.00042409348,0.00013404527,0.0013940085,0.0014634093,0.98987097,0.006294625,0.000017393188],"about_ca_topic_score_codex":0.00034939198,"about_ca_topic_score_gemma":0.0004134375,"teacher_disagreement_score":0.018615993,"about_ca_system_score_codex":0.0009572707,"about_ca_system_score_gemma":0.0005723398,"threshold_uncertainty_score":0.06227672},"labels":[],"label_agreement":null},{"id":"W2963003471","doi":"10.1016/j.jcta.2017.08.004","title":"Turán numbers of extensions","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Extension (predicate logic); Stability (learning theory); Discrete mathematics; Computer science","score_opus":0.028833399518335037,"score_gpt":0.31922771188474053,"score_spread":0.2903943123664055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963003471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65259457,0.0012339957,0.04256928,0.003292617,0.00045726256,0.00007039868,0.00058630976,0.000424926,0.29877064],"genre_scores_gemma":[0.9648918,0.00046959586,0.0054245326,0.00034750561,0.00033924237,0.00008592651,0.00030841242,0.00010615366,0.028026843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912137,0.00023170655,0.00004903018,0.00020105076,0.00020696725,0.0001897987],"domain_scores_gemma":[0.9975356,0.0010219024,0.0003122036,0.0002218325,0.00031814488,0.00059039146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502562,0.0009108711,0.001022987,0.004922807,0.0030233013,0.004490094,0.0014384594,0.0012728489,0.0120952455],"category_scores_gemma":[0.003999446,0.0006415876,0.0008269957,0.0020719692,0.0042712004,0.006701654,0.0032733541,0.0037160164,0.0013282095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025690746,0.000014412508,0.00022963321,0.000018193767,0.0000046325417,0.000033419255,0.00015726835,0.00035059353,0.0001778388,0.9957985,0.00074120634,0.002448461],"study_design_scores_gemma":[0.000008698479,0.0000101433025,0.00054027495,0.000017408018,0.000011007952,0.000117707525,0.000085072315,0.0016474809,0.00021092902,0.99414873,0.003190583,0.000011902036],"about_ca_topic_score_codex":0.0007902119,"about_ca_topic_score_gemma":0.0011024767,"teacher_disagreement_score":0.0120952455,"about_ca_system_score_codex":0.0017249032,"about_ca_system_score_gemma":0.0006084942,"threshold_uncertainty_score":0.040462613},"labels":[],"label_agreement":null},{"id":"W2963202195","doi":"10.1016/j.jcta.2017.05.002","title":"Power series with coefficients from a finite set","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Series (stratigraphy); Power series; Mathematics; Rationality; Finite set; Set (abstract data type); Power (physics); Formal power series; Multivariate statistics; Power set; Applied mathematics; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis; Statistics; Physics; Philosophy; Geology; Thermodynamics","score_opus":0.0236838797959467,"score_gpt":0.2980891950488319,"score_spread":0.2744053152528852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963202195","genre_codex":"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.3430714,0.0029935783,0.2558549,0.00516378,0.0030061263,0.00014188557,0.00078329834,0.0008100657,0.3881749],"genre_scores_gemma":[0.88507116,0.0018034994,0.032482084,0.00060932315,0.001974484,0.00013493135,0.0004587191,0.0005556618,0.07691011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874425,0.00025511632,0.000057821835,0.000196262,0.00051929447,0.00022709781],"domain_scores_gemma":[0.9973591,0.001358804,0.00018083965,0.00029647618,0.00043124976,0.00037351466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013584296,0.0020129096,0.0019156045,0.0047703166,0.0028596108,0.0049961247,0.0019413114,0.0015786107,0.013892616],"category_scores_gemma":[0.0066087907,0.0007725503,0.0013751967,0.0036397423,0.004756484,0.008220233,0.0032089774,0.005986595,0.00286836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003965306,0.000030955223,0.00013893108,0.0000445839,0.000015628064,0.0002692615,0.0002167098,0.00056929485,0.0013793627,0.9896298,0.0017379908,0.0059280177],"study_design_scores_gemma":[0.000022372658,0.000017884273,0.00018792377,0.000025447176,0.000020439524,0.000451059,0.000056398265,0.0035228536,0.0011007106,0.98896,0.005614331,0.000020604706],"about_ca_topic_score_codex":0.0005233792,"about_ca_topic_score_gemma":0.0006456231,"teacher_disagreement_score":0.013892616,"about_ca_system_score_codex":0.0021798073,"about_ca_system_score_gemma":0.00073995965,"threshold_uncertainty_score":0.04647547},"labels":[],"label_agreement":null},{"id":"W2963234396","doi":"10.1016/j.jcta.2009.03.008","title":"Extremal problems on triangle areas in two and three dimensions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Tel Aviv University; National Science Foundation","keywords":"Combinatorics; Mathematics; General position; Regular polygon; Span (engineering); Upper and lower bounds; Position (finance); Plane (geometry); Point (geometry); Discrete geometry; Unit (ring theory); Geometry; Mathematical analysis","score_opus":0.013936423538197943,"score_gpt":0.2565667971483106,"score_spread":0.24263037361011267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963234396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6862424,0.0028882858,0.17468041,0.004779225,0.0005316288,0.00015340438,0.0005547833,0.00029380433,0.129876],"genre_scores_gemma":[0.9511781,0.00088374584,0.032843385,0.00025906245,0.00037799808,0.00008549436,0.00034210185,0.00017943395,0.013850609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991842,0.0002911897,0.000035596266,0.00011841468,0.00020585956,0.00016479038],"domain_scores_gemma":[0.99588734,0.0030080632,0.00036114507,0.00021359848,0.0001883636,0.00034149445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010737736,0.0007625522,0.0013413911,0.0021248336,0.0018234105,0.0031022409,0.0022707798,0.002727407,0.010647281],"category_scores_gemma":[0.008784123,0.0007038527,0.00072996755,0.0016059957,0.002774507,0.0033561222,0.0027906706,0.0024772685,0.00038225183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015848775,0.00005220488,0.00046902825,0.0001233399,0.000017118322,0.00017987896,0.00020318366,0.029277332,0.0006919087,0.95248634,0.003549082,0.01279213],"study_design_scores_gemma":[0.00004876858,0.000028320615,0.0004969757,0.000038174338,0.000014125987,0.00022708724,0.00025736698,0.11492798,0.0005910136,0.88119465,0.0021548292,0.000020639813],"about_ca_topic_score_codex":0.0012621742,"about_ca_topic_score_gemma":0.0012672052,"teacher_disagreement_score":0.010647281,"about_ca_system_score_codex":0.0011182693,"about_ca_system_score_gemma":0.00039502143,"threshold_uncertainty_score":0.035618663},"labels":[],"label_agreement":null},{"id":"W2963414974","doi":"10.1016/j.jcta.2011.07.007","title":"Enumeration of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"script\">H</mml:mi></mml:math>-strata in quantum matrices with respect to dimension","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Seventh Framework Programme","keywords":"Permutation (music); Dimension (graph theory); Enumeration; Function (biology); Mathematics; Combinatorics; Stratum; Generating function; Physics; Geology","score_opus":0.02448853618539452,"score_gpt":0.25997010481856514,"score_spread":0.23548156863317063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963414974","genre_codex":"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.3637517,0.00046761983,0.14610223,0.0022400373,0.00032881592,0.0003277058,0.015038203,0.0020519504,0.46969172],"genre_scores_gemma":[0.7977195,0.00057758053,0.077181466,0.00044976012,0.00019188081,0.00039708574,0.011800923,0.0011227037,0.11055912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.000103816536,0.00005919012,0.000088278095,0.00013157174,0.00015231733],"domain_scores_gemma":[0.9985421,0.00048731783,0.00011161786,0.00025352638,0.0003624092,0.0002430133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043148015,0.00043381692,0.00049644086,0.0023729817,0.0017834913,0.0033183738,0.00081006263,0.0007500148,0.040018994],"category_scores_gemma":[0.0021072077,0.0003821221,0.00050686876,0.0019738993,0.001166044,0.0031153148,0.0015818932,0.0011523041,0.008633148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008454576,0.00005653336,0.0011774448,0.000085876025,0.000007629355,0.00010752812,0.00058182096,0.00059968274,0.0032498965,0.9496568,0.020442765,0.0239495],"study_design_scores_gemma":[0.000027594097,0.000026665832,0.0017036423,0.00005642476,0.000008605763,0.00020316198,0.00042744586,0.0047609853,0.0047883624,0.94787407,0.040087666,0.000035451598],"about_ca_topic_score_codex":0.0014292044,"about_ca_topic_score_gemma":0.0023774754,"teacher_disagreement_score":0.040018994,"about_ca_system_score_codex":0.001028788,"about_ca_system_score_gemma":0.00089661166,"threshold_uncertainty_score":0.13387692},"labels":[],"label_agreement":null},{"id":"W2963671227","doi":"10.1016/j.jcta.2019.05.003","title":"Discrete-time quantum walks and graph structures","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Rotation system; Mathematics; Limiting; Quantum; Random walk; Statistical physics; TRACE (psycholinguistics); Entropy (arrow of time); Graph; Discrete mathematics; Quantum algorithm; Combinatorics; Quantum mechanics; Physics; Statistics","score_opus":0.002975383547587072,"score_gpt":0.20376703839428,"score_spread":0.20079165484669292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963671227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6198028,0.0035960327,0.26012036,0.012634097,0.00086701097,0.000098895056,0.00059723225,0.00035701637,0.101926625],"genre_scores_gemma":[0.9731022,0.001057702,0.013333081,0.00048364108,0.00038231368,0.00005801577,0.00017224703,0.000055933382,0.011354966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995022,0.00018049173,0.000019552124,0.000080888894,0.00012243024,0.0000943488],"domain_scores_gemma":[0.99700457,0.0018955676,0.00027362283,0.0002870246,0.0002196802,0.0003196008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007727432,0.0003936767,0.00078258145,0.0015446071,0.0016474286,0.0033159854,0.0012275337,0.0020177048,0.007268308],"category_scores_gemma":[0.0047101136,0.0005088797,0.00066160917,0.001557485,0.003476256,0.0051309774,0.0011872952,0.0025341157,0.00045905114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008647564,0.000015551877,0.00007922215,0.000008889555,0.000002576544,0.000013168191,0.000049608683,0.0017011574,0.00014558168,0.996429,0.0003840515,0.0011624547],"study_design_scores_gemma":[0.000005264446,0.0000026730306,0.00005722827,0.0000027796764,0.0000011477927,0.000008902152,0.000016089782,0.008115028,0.00004001255,0.99139386,0.0003535557,0.000003363149],"about_ca_topic_score_codex":0.0017165821,"about_ca_topic_score_gemma":0.0020893498,"teacher_disagreement_score":0.007268308,"about_ca_system_score_codex":0.001663336,"about_ca_system_score_gemma":0.00078744977,"threshold_uncertainty_score":0.02431494},"labels":[],"label_agreement":null},{"id":"W2964325648","doi":"10.1016/j.jcta.2019.01.006","title":"On the Turán number of ordered forests","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Geography","score_opus":0.012665367482101385,"score_gpt":0.27549971829699826,"score_spread":0.26283435081489687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964325648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7955277,0.003219855,0.05901614,0.005623426,0.00062034937,0.00004118143,0.0004865307,0.00029434913,0.13517056],"genre_scores_gemma":[0.984012,0.0008409691,0.0056878864,0.00040780223,0.0005095606,0.00006036895,0.0002118409,0.000088555695,0.008180915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988366,0.000464359,0.000057196878,0.00017979722,0.00025012752,0.00021195397],"domain_scores_gemma":[0.987927,0.00850974,0.0009914875,0.00050726434,0.00069382106,0.0013706434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022322596,0.00066725054,0.0013237157,0.004914758,0.0023951011,0.0041606673,0.0022487724,0.0015256352,0.0076998137],"category_scores_gemma":[0.011650925,0.00078548404,0.00066388526,0.0023688416,0.005004067,0.009585131,0.002514667,0.00273702,0.00064035726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007483859,0.000027865091,0.00082693924,0.000045171528,0.000009960689,0.000051636478,0.0001945257,0.002671161,0.0003637339,0.99066025,0.001278084,0.0037958086],"study_design_scores_gemma":[0.000011259563,0.0000135698965,0.0007446136,0.00002647069,0.000010601447,0.00009390628,0.00007492283,0.011213545,0.00018631804,0.98635364,0.0012541476,0.00001704088],"about_ca_topic_score_codex":0.0015949726,"about_ca_topic_score_gemma":0.0018343794,"teacher_disagreement_score":0.0076998137,"about_ca_system_score_codex":0.0020338043,"about_ca_system_score_gemma":0.0007623967,"threshold_uncertainty_score":0.025758445},"labels":[],"label_agreement":null},{"id":"W2967936998","doi":"10.1016/j.jcta.2017.11.018","title":"Extremal bounds for bootstrap percolation in the hypercube","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford","keywords":"Hypercube; Combinatorics; Vertex (graph theory); Mathematics; Cardinality (data modeling); Conjecture; Upper and lower bounds; Mathematical proof; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.08848085778958001,"score_gpt":0.3732643041425507,"score_spread":0.2847834463529707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967936998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.32664797,0.012486468,0.54613566,0.011872114,0.000752298,0.00015895398,0.0010827875,0.0011183667,0.09974525],"genre_scores_gemma":[0.9499368,0.0034613968,0.036312405,0.0010955895,0.0016025672,0.0002825313,0.00075392314,0.0005151019,0.006039636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962387,0.0018311009,0.00012602104,0.00038848026,0.0008381392,0.00057755515],"domain_scores_gemma":[0.9488464,0.0397453,0.0028426268,0.0024206692,0.0023765448,0.0037683835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070612975,0.0019364256,0.0032568783,0.0075029247,0.0029980054,0.006069914,0.0045843753,0.003406858,0.007948542],"category_scores_gemma":[0.048188575,0.0013170814,0.0015854842,0.0033251904,0.0070669465,0.008891234,0.0063631665,0.007968596,0.0007949849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001512092,0.00007654604,0.0008748375,0.00019299121,0.000056714478,0.00013914761,0.0002372117,0.021560814,0.0009896291,0.96722966,0.0038843194,0.004606809],"study_design_scores_gemma":[0.000018135364,0.000020491858,0.00047319126,0.00007750351,0.000025552876,0.00010274697,0.000075452765,0.13720898,0.0003011354,0.8607705,0.0008958342,0.000030399648],"about_ca_topic_score_codex":0.0011126652,"about_ca_topic_score_gemma":0.0015337704,"teacher_disagreement_score":0.007948542,"about_ca_system_score_codex":0.002991617,"about_ca_system_score_gemma":0.0010308705,"threshold_uncertainty_score":0.037344158},"labels":[],"label_agreement":null},{"id":"W2979819925","doi":"10.1016/j.jcta.2019.105155","title":"The Paley graph conjecture and Diophantine m-tuples","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Bilkent Üniversitesi; Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Square number; Conjecture; Tuple; Mathematics; Diophantine equation; Combinatorics; Graph; Integer (computer science); Discrete mathematics; Diophantine set; Upper and lower bounds; Computer science","score_opus":0.007954308504379701,"score_gpt":0.24074425419648987,"score_spread":0.23278994569211017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979819925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58714575,0.004114152,0.05048278,0.020376146,0.0008988294,0.000047587335,0.0010906227,0.00027517835,0.33556888],"genre_scores_gemma":[0.9757923,0.0011374885,0.0068378565,0.0009497457,0.00046111425,0.000034097084,0.00039249676,0.000052268006,0.014342661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991035,0.0002313112,0.0000401162,0.00021478669,0.00023679747,0.0001734896],"domain_scores_gemma":[0.9973527,0.0015931273,0.0002442345,0.00041784463,0.00015642538,0.00023561192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013295196,0.0005356258,0.0013544533,0.0017650789,0.003108945,0.005284346,0.0012658631,0.0025704242,0.011412878],"category_scores_gemma":[0.006118654,0.0006161069,0.0006131583,0.0024908008,0.005361544,0.009441836,0.0037462355,0.0047242753,0.0013709416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044211985,0.0000136374265,0.00027241604,0.00003208739,0.0000041903104,0.00006601806,0.00017580403,0.0005671674,0.00014821911,0.9941895,0.0016933646,0.0027933763],"study_design_scores_gemma":[0.000008104674,0.000002177463,0.00008482378,0.0000075191324,0.0000018661792,0.000039693903,0.0000611845,0.00054173,0.000055948287,0.9979552,0.0012386282,0.000003098319],"about_ca_topic_score_codex":0.0009239669,"about_ca_topic_score_gemma":0.0009004728,"teacher_disagreement_score":0.011412878,"about_ca_system_score_codex":0.0015151672,"about_ca_system_score_gemma":0.0006671708,"threshold_uncertainty_score":0.038179934},"labels":[],"label_agreement":null},{"id":"W2979879756","doi":"10.1016/j.jcta.2021.105422","title":"Three-phase Golay sequence and array triads","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary Golay code; Sequence (biology); Phase (matter); Mathematics; Ternary Golay code; Combinatorics; Statistics; Physics; Biology; Genetics","score_opus":0.02032535427454144,"score_gpt":0.2766334399962903,"score_spread":0.25630808572174885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979879756","genre_codex":"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.11681997,0.0010515578,0.8074248,0.0012313252,0.00043587523,0.00007753073,0.00017169247,0.0003152039,0.07247205],"genre_scores_gemma":[0.79601574,0.001672894,0.15594603,0.0005339924,0.00055771344,0.00013263138,0.00021162724,0.0002096462,0.044719666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00021236432,0.000018384131,0.000057771187,0.00013636678,0.000058126203],"domain_scores_gemma":[0.9991792,0.0004739191,0.00007838196,0.00012510741,0.00010361735,0.000039825107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208684,0.0007330708,0.0005465637,0.0012077154,0.0005665448,0.0015991414,0.0005316548,0.00080904126,0.005659844],"category_scores_gemma":[0.0024037596,0.00028213413,0.00050922664,0.0009990704,0.001358044,0.0012989412,0.0009196606,0.0015271925,0.0014359676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092104056,0.00004230861,0.00014544965,0.000044848948,0.000009245753,0.0001409799,0.00011414657,0.0124738775,0.00538721,0.9600875,0.0015892534,0.019873021],"study_design_scores_gemma":[0.000027518961,0.000050896924,0.00020757678,0.000026263835,0.000009789922,0.0004403825,0.00008112537,0.13056555,0.0059352308,0.8553061,0.0073170997,0.000032483415],"about_ca_topic_score_codex":0.0003038412,"about_ca_topic_score_gemma":0.00026874535,"teacher_disagreement_score":0.005659844,"about_ca_system_score_codex":0.0004673735,"about_ca_system_score_gemma":0.00037467075,"threshold_uncertainty_score":0.018934071},"labels":[],"label_agreement":null},{"id":"W2980330807","doi":"10.1016/j.jcta.2020.105337","title":"An analogue of Ruzsa's conjecture for polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Conjecture; Polynomial; Field (mathematics); Combinatorics; Ring (chemistry); Physics; Mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis; Chemistry","score_opus":0.01710372350876875,"score_gpt":0.2712803088292093,"score_spread":0.2541765853204405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980330807","genre_codex":"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.3707481,0.003449327,0.08394377,0.047809366,0.003635039,0.00012964227,0.0014768834,0.00077719445,0.48803067],"genre_scores_gemma":[0.9602217,0.0012803259,0.009280508,0.0023174135,0.0023505257,0.00006504723,0.0006358257,0.00013591441,0.023712814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771476,0.00060949154,0.00012912,0.00055512326,0.0005139031,0.000477599],"domain_scores_gemma":[0.99390936,0.003594822,0.00046875014,0.0010799638,0.00062638003,0.00032074112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022664012,0.0008586191,0.0024371035,0.002457016,0.0028674612,0.005216173,0.0021527389,0.0042421287,0.017713884],"category_scores_gemma":[0.0109925615,0.0007242413,0.0018435558,0.0029918586,0.0062430482,0.012574719,0.0037456874,0.005863498,0.0018050625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012438519,0.00003931022,0.00032323762,0.000095951735,0.000012847422,0.00012475131,0.00018702832,0.0010515307,0.00038253565,0.98869276,0.0047875866,0.00417812],"study_design_scores_gemma":[0.000037235266,0.0000127557905,0.00020058807,0.00001999413,0.000010264552,0.00009398344,0.00006372886,0.0027792824,0.00018140246,0.9933981,0.0031897982,0.000012836124],"about_ca_topic_score_codex":0.0017743398,"about_ca_topic_score_gemma":0.0012841497,"teacher_disagreement_score":0.017713884,"about_ca_system_score_codex":0.002265516,"about_ca_system_score_gemma":0.00089508836,"threshold_uncertainty_score":0.05925882},"labels":[],"label_agreement":null},{"id":"W3000423532","doi":"10.1016/j.jcta.2019.105189","title":"3D positive lattice walks and spherical triangles","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Horizon 2020; European Research Council","keywords":"Mathematics; Eigenvalues and eigenvectors; Exponent; Lattice (music); Combinatorics; Dirichlet distribution; Mathematical analysis; Pure mathematics; Boundary value problem","score_opus":0.010130364783296758,"score_gpt":0.22477403037329377,"score_spread":0.214643665589997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000423532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6390624,0.001204984,0.19929837,0.0016306278,0.0009498686,0.000119496435,0.00079331273,0.00053367345,0.15640733],"genre_scores_gemma":[0.9319116,0.0005690885,0.03092246,0.00035984605,0.00019275854,0.000093591036,0.00041047845,0.00020235126,0.03533778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966884,0.000090099966,0.00001711607,0.0000613333,0.00009702454,0.0000655273],"domain_scores_gemma":[0.9990036,0.00038271453,0.00014767311,0.00009392074,0.00014189523,0.00023026817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021188415,0.00051477994,0.00067572435,0.0014253217,0.0013242863,0.0028895524,0.0010749036,0.001873043,0.0113399895],"category_scores_gemma":[0.002035864,0.00054175156,0.000614111,0.0012662611,0.001559091,0.0016901884,0.0016853678,0.0013186272,0.0016355133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005979273,0.00003203131,0.0003218909,0.000037912414,0.00000693214,0.00017672294,0.00015972047,0.008620757,0.0020873682,0.9797301,0.0017816924,0.0069851507],"study_design_scores_gemma":[0.00002854776,0.000019310559,0.00024954655,0.00001739981,0.0000052639048,0.00021219639,0.00016358313,0.04966868,0.00062049227,0.94396085,0.0050361617,0.000017879185],"about_ca_topic_score_codex":0.0022229818,"about_ca_topic_score_gemma":0.0031862343,"teacher_disagreement_score":0.0113399895,"about_ca_system_score_codex":0.00072643807,"about_ca_system_score_gemma":0.000354471,"threshold_uncertainty_score":0.03793603},"labels":[],"label_agreement":null},{"id":"W3011285915","doi":"10.1016/j.jcta.2019.105190","title":"The partition rank of a tensor and k-right corners in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math>","year":2020,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Partition (number theory); Combinatorics; Rank (graph theory); Discrete mathematics","score_opus":0.01948802082768114,"score_gpt":0.2484689187412446,"score_spread":0.22898089791356346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011285915","genre_codex":"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.2967947,0.00274119,0.21215756,0.0053885835,0.0035692633,0.00016047146,0.00638678,0.002339267,0.47046214],"genre_scores_gemma":[0.8305182,0.0012723319,0.028947419,0.0006829952,0.0011688543,0.00010887404,0.003436437,0.0017833475,0.13208154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895155,0.00016919612,0.000058441947,0.00021455852,0.0002948523,0.00031136879],"domain_scores_gemma":[0.9975369,0.0006853707,0.0003420689,0.00034957757,0.00057840155,0.0005075798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056355,0.0010247729,0.00091770076,0.003355824,0.0021423264,0.0066384743,0.0010526628,0.0009922141,0.053929444],"category_scores_gemma":[0.0035681296,0.00055652525,0.00090383214,0.0019165714,0.0029481694,0.0058234483,0.0016816373,0.0025420033,0.012899715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018081474,0.000045529687,0.00058306236,0.000093576,0.000015430996,0.000179945,0.000500043,0.0011322222,0.0023716672,0.9517226,0.025450015,0.01772515],"study_design_scores_gemma":[0.000026864169,0.00006517136,0.0014906125,0.00009262699,0.000033233046,0.00042122035,0.00053060194,0.008938789,0.004829797,0.9423151,0.041161414,0.00009448381],"about_ca_topic_score_codex":0.0036725318,"about_ca_topic_score_gemma":0.004499108,"teacher_disagreement_score":0.053929444,"about_ca_system_score_codex":0.001694534,"about_ca_system_score_gemma":0.001040721,"threshold_uncertainty_score":0.180412},"labels":[],"label_agreement":null},{"id":"W3015825817","doi":"10.1016/j.jcta.2020.105253","title":"Lower bounds for graph bootstrap percolation via properties of polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Hypercube; Simple (philosophy); Mathematics; Combinatorics; Torus; Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.036241503016032364,"score_gpt":0.2793446789304078,"score_spread":0.24310317591437547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015825817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.21947338,0.015309491,0.5604405,0.021768246,0.0013869611,0.00046047906,0.0030098052,0.0024680824,0.1756831],"genre_scores_gemma":[0.89849,0.0073846434,0.066996664,0.003268947,0.003932332,0.00065578107,0.002000354,0.0014927934,0.01577842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942259,0.0018100534,0.00015485889,0.0009692551,0.001380395,0.0014594999],"domain_scores_gemma":[0.90355563,0.08081543,0.0034456325,0.004092809,0.0032001869,0.004890259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072909025,0.0034912974,0.0042980104,0.009035526,0.00457178,0.00855846,0.007343577,0.0047309888,0.016171774],"category_scores_gemma":[0.061937712,0.0020706996,0.0030390413,0.006784034,0.009044569,0.015868317,0.008852278,0.013026239,0.0027387908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050402473,0.00039136116,0.0022972254,0.00082448224,0.00014431051,0.00023761489,0.0008025723,0.031450734,0.0039745863,0.9159754,0.021697313,0.021700427],"study_design_scores_gemma":[0.00006499283,0.00007099464,0.0008456103,0.00015954857,0.00010858509,0.00019325381,0.00016261099,0.13343798,0.001078568,0.86020446,0.0036076584,0.000065739325],"about_ca_topic_score_codex":0.002218011,"about_ca_topic_score_gemma":0.0034007244,"teacher_disagreement_score":0.016171774,"about_ca_system_score_codex":0.0053505544,"about_ca_system_score_gemma":0.0022101325,"threshold_uncertainty_score":0.054099977},"labels":[],"label_agreement":null},{"id":"W3081477286","doi":"10.1016/j.jcta.2020.105322","title":"All 2-transitive groups have the EKR-module property","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Transitive relation; Coset; Mathematics; Combinatorics; Property (philosophy); Group (periodic table); Graph; Characterization (materials science); Set (abstract data type); Generating set of a group; Discrete mathematics; Geometry; Computer science","score_opus":0.06295965401241103,"score_gpt":0.3081445957368152,"score_spread":0.24518494172440414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081477286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6742789,0.0009167319,0.12606952,0.0012287449,0.0005923092,0.00013079702,0.0012257118,0.0013087431,0.19424854],"genre_scores_gemma":[0.96865785,0.00032081924,0.009814551,0.00034771685,0.00029889386,0.000071169765,0.00080474245,0.00013804712,0.019546395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991273,0.00012731759,0.00008008926,0.0002639159,0.00017163952,0.00022973909],"domain_scores_gemma":[0.99842453,0.0004371419,0.00040757022,0.00034237295,0.00018513229,0.00020332534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007765893,0.0011871199,0.0010911173,0.0015295917,0.0012861639,0.002682951,0.0009091747,0.0009955681,0.010416481],"category_scores_gemma":[0.00120846,0.0004783688,0.0010879397,0.0009804047,0.0023621877,0.0047534625,0.0020649827,0.0014379874,0.002686338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022915253,0.00010271418,0.0012327693,0.0001109339,0.000064522676,0.0005061307,0.000417756,0.0005244576,0.008188545,0.967474,0.0024858112,0.018663216],"study_design_scores_gemma":[0.00010794807,0.00015198719,0.0023069947,0.000024283418,0.00005449526,0.0012898167,0.0002126667,0.0017463515,0.007572072,0.9760858,0.010395011,0.000052613803],"about_ca_topic_score_codex":0.00015953011,"about_ca_topic_score_gemma":0.00020142029,"teacher_disagreement_score":0.010416481,"about_ca_system_score_codex":0.00035134313,"about_ca_system_score_gemma":0.00031790315,"threshold_uncertainty_score":0.034846604},"labels":[],"label_agreement":null},{"id":"W3093034456","doi":"10.1016/j.jcta.2022.105611","title":"On the Oberwolfach problem for single-flip 2-factors via graceful labelings","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Automorphism; Vertex (graph theory); Discrete mathematics; Path (computing); Multiplicity (mathematics); Graph; Computer science","score_opus":0.010781057771309437,"score_gpt":0.18796648477639918,"score_spread":0.17718542700508974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093034456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43809423,0.0013879703,0.4005058,0.0071403272,0.0005174256,0.00043982416,0.0012044465,0.001600549,0.14910945],"genre_scores_gemma":[0.84883386,0.001548951,0.09292555,0.0014727185,0.0005685221,0.00035898836,0.0013546342,0.0009502657,0.051986635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979697,0.0006007722,0.000086055785,0.00047981404,0.00034123118,0.00052253966],"domain_scores_gemma":[0.9935481,0.004385974,0.0004755296,0.00082919956,0.00028477478,0.00047643067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019039996,0.0016366839,0.0020630949,0.0015260807,0.00280468,0.004608428,0.0023022243,0.0038733594,0.022911847],"category_scores_gemma":[0.008850767,0.0010882143,0.0014590473,0.0019061336,0.0042728474,0.009064258,0.003916038,0.0047235964,0.003129589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030791573,0.00015889751,0.000472906,0.00018295847,0.000028790286,0.00019001625,0.0005685142,0.018062813,0.0016166414,0.93803126,0.012621674,0.027757695],"study_design_scores_gemma":[0.00004169371,0.00002477242,0.00008785367,0.000030417696,0.000013385887,0.000052650677,0.00013191882,0.024370324,0.00063471275,0.97207797,0.0025107767,0.000023590826],"about_ca_topic_score_codex":0.0033670303,"about_ca_topic_score_gemma":0.0037161487,"teacher_disagreement_score":0.022911847,"about_ca_system_score_codex":0.0020776717,"about_ca_system_score_gemma":0.0015299094,"threshold_uncertainty_score":0.07664776},"labels":[],"label_agreement":null},{"id":"W3154325236","doi":"10.1016/j.jcta.2021.105464","title":"On the d-cluster generalization of Erdős-Ko-Rado","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Combinatorics; Conjecture; Mathematics; Intersection (aeronautics); Cluster (spacecraft); Star (game theory); Discrete mathematics; Computer science; Geography; Mathematical analysis","score_opus":0.01749861317644078,"score_gpt":0.26722332841555996,"score_spread":0.24972471523911918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154325236","genre_codex":"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.3105728,0.0071019717,0.24328256,0.014702837,0.0025140129,0.00029275258,0.0012749817,0.00072497607,0.419533],"genre_scores_gemma":[0.90158206,0.0036406086,0.042145588,0.0031337682,0.0014619904,0.00025273242,0.00062246417,0.0003035856,0.046857156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987948,0.00040717272,0.00005718892,0.00028741718,0.00025382137,0.00019964436],"domain_scores_gemma":[0.9968458,0.0012315735,0.00035216793,0.00040298622,0.0005988493,0.00056860957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020527812,0.0007724142,0.0021154154,0.003994118,0.0045808605,0.003126722,0.0024715508,0.0021907757,0.009729854],"category_scores_gemma":[0.007832398,0.00057093654,0.001761204,0.00303382,0.0039507644,0.0065172333,0.005538578,0.0037863061,0.0013339282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016001084,0.000010079541,0.00010471559,0.000022164411,0.0000046910986,0.000029822004,0.000086501044,0.0006314954,0.00012005301,0.9959288,0.0015615462,0.0014841006],"study_design_scores_gemma":[0.000015610298,0.000011628347,0.00018478638,0.000028960829,0.000013218554,0.00011521883,0.00012235959,0.0068936134,0.00011629417,0.98713416,0.0053444197,0.00001964891],"about_ca_topic_score_codex":0.004445656,"about_ca_topic_score_gemma":0.0030924177,"teacher_disagreement_score":0.009729854,"about_ca_system_score_codex":0.0031205304,"about_ca_system_score_gemma":0.001423189,"threshold_uncertainty_score":0.03254962},"labels":[],"label_agreement":null},{"id":"W3183769837","doi":"10.1016/j.jcta.2021.105571","title":"MacMahon Partition Analysis: A discrete approach to broken stick problems","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Partition (number theory); Fibonacci number; Mathematics; Combinatorics; Diophantine equation; Product (mathematics); Integer (computer science); Discrete mathematics; Computer science; Geometry","score_opus":0.033578059032865294,"score_gpt":0.3069739997334365,"score_spread":0.27339594070057116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183769837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.16039906,0.0025185638,0.7112536,0.005126828,0.0011176444,0.00016889376,0.00039628503,0.00024168333,0.11877747],"genre_scores_gemma":[0.85668886,0.0012949364,0.08979682,0.00092877896,0.0015068953,0.00032494336,0.00035370223,0.00038051765,0.04872454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989293,0.00045441216,0.00003687479,0.00015343293,0.00027005753,0.0001558175],"domain_scores_gemma":[0.99734336,0.001385294,0.00025915162,0.00038665553,0.00021346894,0.0004120555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015676111,0.00083015027,0.0015767509,0.00280308,0.0023086437,0.004204883,0.0037124273,0.002321808,0.015619304],"category_scores_gemma":[0.008312975,0.0006660802,0.0015372987,0.002078992,0.004301683,0.0060031805,0.0032875454,0.0050842008,0.0008182957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014777007,0.000017697437,0.00009111081,0.00002307459,0.000009502851,0.00001831097,0.00005752,0.004179337,0.00012972362,0.99168855,0.0013545909,0.0024157981],"study_design_scores_gemma":[0.000009781229,0.0000069921293,0.000093088645,0.000011998599,0.0000045949973,0.000016253995,0.00004872189,0.048823386,0.00006931483,0.9497511,0.0011579895,0.000006727145],"about_ca_topic_score_codex":0.0017912604,"about_ca_topic_score_gemma":0.0018418473,"teacher_disagreement_score":0.015619304,"about_ca_system_score_codex":0.002152449,"about_ca_system_score_gemma":0.001290946,"threshold_uncertainty_score":0.052251816},"labels":[],"label_agreement":null},{"id":"W4320477443","doi":"10.1016/j.jcta.2022.105723","title":"Compositions and parities of complete mappings and of orthomorphisms","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sylow theorems; Mathematics; Combinatorics; Permutation (music); Parity (physics); Group (periodic table); Finite field; Finite group; Discrete mathematics; Physics","score_opus":0.008526302920910316,"score_gpt":0.18838510898220048,"score_spread":0.17985880606129018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320477443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.487609,0.0008139924,0.33007175,0.0021717136,0.0009296657,0.00016482497,0.0005750743,0.00041843456,0.17724554],"genre_scores_gemma":[0.88213277,0.0010421104,0.062957354,0.0005761852,0.0010162696,0.00026426816,0.0004946685,0.00042606794,0.051090296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980659,0.00046307745,0.00013895688,0.00044825234,0.0005326934,0.00035114159],"domain_scores_gemma":[0.99499005,0.002545434,0.00053191854,0.0007390439,0.0005003908,0.0006931111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021794382,0.00074730866,0.0011518416,0.003281626,0.0032155013,0.0055767116,0.001209429,0.0016652555,0.011093022],"category_scores_gemma":[0.00880563,0.0010286616,0.0016468884,0.0022419451,0.0053726244,0.009878017,0.003917835,0.004297396,0.0012438116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030701456,0.000016844537,0.000134325,0.000010476032,0.000003809039,0.000059559876,0.00017677632,0.00020790599,0.0004697327,0.99500257,0.00032775462,0.003559591],"study_design_scores_gemma":[0.000009317992,0.000012076078,0.00014255414,0.000008684893,0.0000061804876,0.00013480791,0.00009754231,0.0020986511,0.00060575246,0.9950186,0.0018571502,0.000008501875],"about_ca_topic_score_codex":0.00045833754,"about_ca_topic_score_gemma":0.0004406489,"teacher_disagreement_score":0.011093022,"about_ca_system_score_codex":0.0011996112,"about_ca_system_score_gemma":0.00095026125,"threshold_uncertainty_score":0.03710985},"labels":[],"label_agreement":null},{"id":"W4365140412","doi":"10.1016/j.jcta.2023.105756","title":"Balancing permuted copies of multigraphs and integer matrices","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Permutation (music); Permutation matrix; Graph; Discrete mathematics; Integer (computer science); Integer matrix; Matrix (chemical analysis); Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.0045704480086358095,"score_gpt":0.19753891989771308,"score_spread":0.19296847188907726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365140412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54719865,0.0004878986,0.38700223,0.0008337935,0.00044217595,0.00010247075,0.00021371919,0.0004758255,0.06324327],"genre_scores_gemma":[0.9035711,0.00023094339,0.07113946,0.0002969351,0.00014734454,0.0000802918,0.00016609262,0.00016057464,0.024207266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940085,0.00018989507,0.00003186998,0.00011838548,0.0001669323,0.000092051974],"domain_scores_gemma":[0.998212,0.00064582354,0.0002542783,0.00049592793,0.00023993631,0.000152109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059471995,0.00039264752,0.00038881,0.0010188804,0.0007282746,0.0016148138,0.0010458147,0.000737456,0.0069116433],"category_scores_gemma":[0.0031160614,0.00039778472,0.00030853567,0.0008167112,0.0009359702,0.0019657332,0.001045602,0.00085281243,0.00072058634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027550053,0.00012891041,0.00063863164,0.00007661559,0.000030944193,0.00031141093,0.0002406045,0.037513997,0.033330206,0.89079314,0.0030471059,0.03361284],"study_design_scores_gemma":[0.00004883095,0.00008709782,0.00052286114,0.00002716061,0.000026518204,0.00033698944,0.00018861078,0.22588491,0.010120424,0.75567997,0.0070427465,0.000033924774],"about_ca_topic_score_codex":0.0005546565,"about_ca_topic_score_gemma":0.0011190248,"teacher_disagreement_score":0.0069116433,"about_ca_system_score_codex":0.00060543686,"about_ca_system_score_gemma":0.00036828758,"threshold_uncertainty_score":0.023121715},"labels":[],"label_agreement":null},{"id":"W4366980112","doi":"10.1016/j.jcta.2023.105763","title":"Nonexistence results of generalized bent functions from <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math> to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.svg\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math>","year":2023,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Education - Singapore; Pacific Institute for the Mathematical Sciences","keywords":"Bent molecular geometry; Function (biology); Scalable Vector Graphics; Mathematics; Combinatorics; Computer science; Algorithm; World Wide Web; Engineering","score_opus":0.021819176248565966,"score_gpt":0.24281523015548215,"score_spread":0.22099605390691618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366980112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38550502,0.0075580166,0.33099988,0.011392066,0.0009548353,0.00013999717,0.0010865814,0.0005561888,0.26180738],"genre_scores_gemma":[0.88804716,0.0052288505,0.04252316,0.0015265507,0.00118615,0.0002468769,0.0011158104,0.00035526653,0.059770197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837035,0.00048116807,0.00010057745,0.00038780924,0.000401377,0.00025882223],"domain_scores_gemma":[0.98870134,0.007715486,0.0008155012,0.0010777188,0.0010239325,0.00066590053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014096,0.0016088624,0.0013328678,0.002119139,0.0023053084,0.0035003086,0.0018725956,0.0013821147,0.01178762],"category_scores_gemma":[0.012179816,0.000961011,0.0023564703,0.0018013691,0.0028283359,0.0077027003,0.0033218046,0.006372145,0.0027832706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024545073,0.000074408126,0.0009106234,0.00037979803,0.00010490816,0.00037741498,0.00042807852,0.0074431906,0.0035926695,0.9517173,0.0086882645,0.026037738],"study_design_scores_gemma":[0.000047483358,0.00012366679,0.00066647347,0.00009380192,0.0001065992,0.0005876363,0.0001904164,0.028359612,0.0023286138,0.9559521,0.011498784,0.000044682267],"about_ca_topic_score_codex":0.0010997856,"about_ca_topic_score_gemma":0.0010642684,"teacher_disagreement_score":0.01178762,"about_ca_system_score_codex":0.002507887,"about_ca_system_score_gemma":0.0012223596,"threshold_uncertainty_score":0.03943354},"labels":[],"label_agreement":null},{"id":"W4377818744","doi":"10.1016/j.jcta.2023.105769","title":"Integer colorings with forbidden rainbow sums","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Combinatorics; Mathematics; Hypergraph; Integer (computer science); Context (archaeology); Mathematical proof; Discrete mathematics; Set (abstract data type); Computer science; Physics","score_opus":0.022721699812951343,"score_gpt":0.2807870395833798,"score_spread":0.25806533977042845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377818744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73591155,0.00057609327,0.09286172,0.0015226911,0.0005866702,0.000075579825,0.00034103912,0.0006671363,0.16745754],"genre_scores_gemma":[0.9497271,0.00026693527,0.020613875,0.00035482628,0.00021180413,0.00007286644,0.00024101106,0.00027441868,0.028237198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909186,0.00022152314,0.000067744426,0.00018277673,0.00021466745,0.00022148278],"domain_scores_gemma":[0.9966664,0.0017712994,0.00037403955,0.0004275566,0.00026219644,0.0004984766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095425296,0.00064966816,0.0008424067,0.0019203594,0.0026247194,0.004360001,0.0016170078,0.0014562586,0.009516044],"category_scores_gemma":[0.004556706,0.0010034078,0.0008239901,0.0015968104,0.0026421414,0.00522571,0.002795287,0.0027921654,0.0009607784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006493803,0.00005804167,0.00044549548,0.00003565118,0.0000095604,0.00016822743,0.0002388405,0.0012510779,0.0015451676,0.9915421,0.0014678895,0.0031729585],"study_design_scores_gemma":[0.000024000992,0.000011810012,0.00022703288,0.00001474296,0.000013640992,0.00020462592,0.00011678752,0.0060115578,0.000823002,0.99089843,0.0016389576,0.000015494492],"about_ca_topic_score_codex":0.00070066104,"about_ca_topic_score_gemma":0.0013725052,"teacher_disagreement_score":0.009516044,"about_ca_system_score_codex":0.0012034429,"about_ca_system_score_gemma":0.00061605906,"threshold_uncertainty_score":0.031834304},"labels":[],"label_agreement":null},{"id":"W4384574781","doi":"10.1016/j.jcta.2023.105789","title":"Linked partition ideals and a family of quadruple summations","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts; Simons Foundation","keywords":"Extension (predicate logic); Ramanujan's sum; Mathematics; Partition (number theory); Identity (music); Type (biology); Combinatorics; Genealogy; Computer science; History","score_opus":0.04454970790137546,"score_gpt":0.33037692108034683,"score_spread":0.28582721317897136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54690045,0.0015257624,0.20818901,0.0027205038,0.0010895738,0.00012460322,0.00046769343,0.0006674827,0.23831484],"genre_scores_gemma":[0.92491925,0.00074862066,0.029516125,0.00050491473,0.00069718383,0.00014350832,0.0003177136,0.00023990209,0.042912815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989429,0.00022981962,0.000054928827,0.00018960054,0.00034835847,0.00023450688],"domain_scores_gemma":[0.9977767,0.00083348784,0.00029576593,0.00020424719,0.0003047564,0.0005850444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015605058,0.0006989601,0.0012815642,0.004065065,0.005577066,0.0046483763,0.0016641881,0.0012758019,0.0080164485],"category_scores_gemma":[0.0041773813,0.00081965124,0.0010779034,0.0024638916,0.0044237804,0.0060818414,0.003408539,0.0032547102,0.0011869678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011836268,0.000012278639,0.000072728995,0.000007889122,0.0000038260646,0.00005677227,0.00009846034,0.00010126507,0.00025393,0.99785954,0.0004451617,0.0010763308],"study_design_scores_gemma":[0.000010592724,0.000007740289,0.00012952911,0.000009308121,0.000006225146,0.00015720658,0.000059698545,0.0014167259,0.0002958844,0.9962364,0.0016600485,0.000010646746],"about_ca_topic_score_codex":0.000647501,"about_ca_topic_score_gemma":0.00092194515,"teacher_disagreement_score":0.0080164485,"about_ca_system_score_codex":0.0014314728,"about_ca_system_score_gemma":0.0008504462,"threshold_uncertainty_score":0.02681768},"labels":[],"label_agreement":null},{"id":"W4386351978","doi":"10.1016/j.jcta.2023.105803","title":"Constructing uniform 2-factorizations via row-sum matrices: Solutions to the Hamilton-Waterloo problem","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Agencia Nacional de Promoción Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Agencia Nacional de Promoción de la Investigación, el Desarrollo Tecnológico y la Innovación; Universidad Nacional de San Luis; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Dihedral group; Mathematics; Combinatorics; Cayley graph; Factorization; Abelian group; Group (periodic table); Matrix (chemical analysis); Construct (python library); Spectrum (functional analysis); Discrete mathematics; Computer science; Algorithm; Graph","score_opus":0.00954778292910096,"score_gpt":0.2026864869044561,"score_spread":0.19313870397535512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386351978","genre_codex":"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.15477498,0.00055104255,0.79159564,0.0010386122,0.00021144211,0.00023276916,0.00057247747,0.00077457936,0.050248396],"genre_scores_gemma":[0.5436257,0.00070699485,0.42653498,0.00058614166,0.00017320382,0.0002561914,0.0009566707,0.00039863234,0.026761446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944633,0.00015355893,0.000024000023,0.00010947235,0.0001298496,0.0001367889],"domain_scores_gemma":[0.9986266,0.0007672717,0.000115190844,0.00021471303,0.00014645912,0.00012979098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617525,0.0010172189,0.00077635737,0.0008536466,0.0011466383,0.001423109,0.0011342824,0.0011939991,0.010974411],"category_scores_gemma":[0.0048760213,0.00070231827,0.000832288,0.0011444613,0.0010463065,0.002323608,0.0017075683,0.0014608268,0.001929348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003382292,0.00032426804,0.00074237975,0.00033357364,0.000055000826,0.00023385104,0.00076285924,0.08560267,0.0077688782,0.7290583,0.027269624,0.1475103],"study_design_scores_gemma":[0.00006996816,0.00006712294,0.00014581629,0.000040764804,0.000015082044,0.000077959005,0.00015654281,0.21698488,0.0017575657,0.7758247,0.0048339074,0.000025668978],"about_ca_topic_score_codex":0.0028160869,"about_ca_topic_score_gemma":0.005374551,"teacher_disagreement_score":0.010974411,"about_ca_system_score_codex":0.0006199704,"about_ca_system_score_gemma":0.0011043467,"threshold_uncertainty_score":0.036713064},"labels":[],"label_agreement":null},{"id":"W4386500718","doi":"10.1016/j.jcta.2023.105813","title":"Improved Elekes-Szabó type estimates using proximity","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási és Technológiai Hivatal; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Cartesian product; Exponent; Intersection (aeronautics); Type (biology); Polynomial; Cardinality (data modeling); Product (mathematics); Algebraic number; Plane (geometry); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.05845199783888051,"score_gpt":0.3352890917572425,"score_spread":0.276837093918362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386500718","genre_codex":"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.026823979,0.0034541409,0.9258032,0.0021949618,0.001160065,0.00012974095,0.00061625417,0.00026016767,0.039557472],"genre_scores_gemma":[0.54022855,0.008487614,0.3654643,0.0019179549,0.0042906106,0.0007780228,0.0012117393,0.00083214924,0.07678911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944301,0.002508604,0.0002985315,0.00088323076,0.0014738021,0.00040582006],"domain_scores_gemma":[0.98314935,0.010923374,0.0007853699,0.0017383097,0.0024559211,0.0009476424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009575869,0.003189786,0.00392347,0.009588889,0.0022099623,0.004882606,0.005566849,0.0035216107,0.015259824],"category_scores_gemma":[0.032883182,0.0015865911,0.004137002,0.005430115,0.0046965578,0.015542509,0.013319537,0.011914371,0.002808912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001337212,0.00008840699,0.0007600824,0.00029894008,0.00011136834,0.00012443721,0.00026292834,0.0079903,0.0019722146,0.9707619,0.0031474691,0.0143482415],"study_design_scores_gemma":[0.000041439744,0.00012761405,0.0012640505,0.00010516234,0.00016860275,0.00021122693,0.00015626149,0.14586343,0.0020932518,0.83978784,0.010067962,0.00011313367],"about_ca_topic_score_codex":0.0015980537,"about_ca_topic_score_gemma":0.0016108074,"teacher_disagreement_score":0.015259824,"about_ca_system_score_codex":0.0024759336,"about_ca_system_score_gemma":0.0013076825,"threshold_uncertainty_score":0.051049232},"labels":[],"label_agreement":null},{"id":"W4387793828","doi":"10.1016/j.jcta.2023.105828","title":"Non-expansive matrix number systems with bases similar to certain Jordan blocks","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Expansive; Dimension (graph theory); Numerical digit; Eigenvalues and eigenvectors; Matrix (chemical analysis); Block (permutation group theory); Set (abstract data type); Base (topology); Context (archaeology); Jordan matrix; Logarithm; Combinatorics; Arithmetic; Representation (politics); Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.006912436830327222,"score_gpt":0.24505233938173857,"score_spread":0.23813990255141135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387793828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6540375,0.0005583509,0.25818112,0.0006692477,0.000442378,0.00013389319,0.00034032512,0.0003498535,0.08528731],"genre_scores_gemma":[0.931936,0.00020448938,0.03900457,0.00020943375,0.00021532693,0.00015462012,0.00032573793,0.0001075729,0.027842205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994593,0.00014402687,0.000038959213,0.00009412287,0.00015800225,0.00010558053],"domain_scores_gemma":[0.9984085,0.0005938996,0.00023595153,0.00019380488,0.00029165458,0.00027628103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182252,0.00043848882,0.0005608179,0.0010134957,0.0012152288,0.0022276551,0.00079723995,0.00066945865,0.008452893],"category_scores_gemma":[0.0022588659,0.0003921141,0.0004372346,0.0008002353,0.0015101208,0.0024013093,0.0011687151,0.001331504,0.0013139579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054296062,0.00003524245,0.00016192597,0.000029646708,0.000006900133,0.00011988256,0.00020529673,0.0012063088,0.0047419895,0.98995095,0.00054523186,0.002942203],"study_design_scores_gemma":[0.000039782073,0.000074864256,0.00040163565,0.000016201575,0.000010863995,0.00036375652,0.00021690495,0.017638925,0.004706419,0.97198355,0.00451799,0.000029086317],"about_ca_topic_score_codex":0.0002468699,"about_ca_topic_score_gemma":0.00046025455,"teacher_disagreement_score":0.008452893,"about_ca_system_score_codex":0.00038519892,"about_ca_system_score_gemma":0.00041990698,"threshold_uncertainty_score":0.028277755},"labels":[],"label_agreement":null},{"id":"W4387924186","doi":"10.1016/j.jcta.2023.105829","title":"A bivariate Q-polynomial structure for the non-binary Johnson scheme","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Mathematics; Univariate; Association scheme; Bivariate analysis; Polynomial; Binary number; Scheme (mathematics); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Multivariate statistics; Mathematical analysis; Statistics; Arithmetic","score_opus":0.020019275015350186,"score_gpt":0.3032173558796922,"score_spread":0.283198080864342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387924186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62791044,0.000874056,0.1306456,0.0039623547,0.00068880926,0.00013170009,0.0008567408,0.0003949232,0.23453538],"genre_scores_gemma":[0.95625997,0.00040013343,0.010042771,0.00038883477,0.00035166857,0.000043845983,0.0002813143,0.000080317455,0.03215121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991116,0.00019427775,0.000041867075,0.00016968104,0.00022524064,0.0002573249],"domain_scores_gemma":[0.99874413,0.00035934933,0.00019274732,0.00017580617,0.00020241633,0.00032554896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753537,0.0004720807,0.00091215345,0.0018841488,0.003167573,0.004618569,0.001068608,0.0010722665,0.012250179],"category_scores_gemma":[0.0022077877,0.00042355093,0.00066456414,0.0018241457,0.0042105326,0.0046578683,0.0026258845,0.002696166,0.0020546948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015341679,0.000010378285,0.00008313509,0.000007564712,0.0000011676916,0.000022706423,0.00008170069,0.00017113844,0.00020173866,0.9979107,0.0003448183,0.0011495539],"study_design_scores_gemma":[0.000021209637,0.000018097155,0.00032089572,0.000009067214,0.0000064237097,0.00006696743,0.00009377892,0.0017997494,0.00028005335,0.9934888,0.0038761564,0.00001889566],"about_ca_topic_score_codex":0.0023104367,"about_ca_topic_score_gemma":0.0018090077,"teacher_disagreement_score":0.012250179,"about_ca_system_score_codex":0.0023472635,"about_ca_system_score_gemma":0.0014828595,"threshold_uncertainty_score":0.040980935},"labels":[],"label_agreement":null},{"id":"W4389087156","doi":"10.1016/j.jcta.2023.105834","title":"The second-order football-pool problem and the optimal rate of generalized-covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Order (exchange); Mathematics; Code (set theory); Property (philosophy); Function (biology); Football; Combinatorics; Discrete mathematics; Computer science; Law","score_opus":0.00764930142739302,"score_gpt":0.2229173974703567,"score_spread":0.21526809604296368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389087156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5298795,0.003580635,0.39177632,0.008378779,0.0004317614,0.0002473736,0.0013337623,0.00053138414,0.06384054],"genre_scores_gemma":[0.95160735,0.001676,0.03514817,0.00056768925,0.00041202566,0.0002286107,0.00046953073,0.00022931272,0.009661338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667287,0.0015685807,0.00009943239,0.00035958234,0.00044642133,0.0008531821],"domain_scores_gemma":[0.9812983,0.014283238,0.0009420916,0.0014297247,0.0008433088,0.0012033824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040883296,0.0016265041,0.0030987612,0.0019684078,0.0017984316,0.006058395,0.00395484,0.003467234,0.0074531194],"category_scores_gemma":[0.028624488,0.001237856,0.0012405709,0.0027261297,0.0039284523,0.007009937,0.0043791756,0.0031311782,0.000846379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063989044,0.0001223277,0.0008206623,0.0002404205,0.00008209154,0.00022728324,0.00031657366,0.16526595,0.0023157788,0.8016697,0.0081623355,0.020136988],"study_design_scores_gemma":[0.0000955579,0.00007059995,0.00029784074,0.000060969654,0.000024026585,0.00018674691,0.00013491974,0.2961994,0.0010390787,0.7003192,0.0015196751,0.00005189386],"about_ca_topic_score_codex":0.0028728668,"about_ca_topic_score_gemma":0.0020205285,"teacher_disagreement_score":0.0074531194,"about_ca_system_score_codex":0.003983806,"about_ca_system_score_gemma":0.0036614554,"threshold_uncertainty_score":0.028904676},"labels":[],"label_agreement":null},{"id":"W4392071666","doi":"10.1016/j.jcta.2024.105874","title":"Two conjectures of Andrews, Merca and Yee on truncated theta series","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Mathematics; Series (stratigraphy); Euler's formula; Combinatorics; Truncation (statistics); Partition (number theory); Integer (computer science); Number theory; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.019932076860667645,"score_gpt":0.3163920103492939,"score_spread":0.2964599334886262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392071666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4125436,0.0057805763,0.12250881,0.12626715,0.008186473,0.0001659039,0.0013721158,0.0008046722,0.3223706],"genre_scores_gemma":[0.9439039,0.001577645,0.011571636,0.0047575487,0.003892896,0.00012934441,0.0007581833,0.00022639532,0.0331824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969867,0.0007487353,0.0002154327,0.0005959862,0.00087114633,0.0005820058],"domain_scores_gemma":[0.97717106,0.012406853,0.0014489844,0.0052876035,0.0022312324,0.0014542367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046418966,0.0010654061,0.0024894136,0.0021522555,0.004124211,0.0056608743,0.0034862326,0.005800128,0.017266119],"category_scores_gemma":[0.03965821,0.0009204938,0.001953016,0.0027709103,0.013783635,0.024650399,0.006844478,0.008329718,0.00217576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008408422,0.000027102973,0.0003052672,0.000041457406,0.0000054108846,0.000064436164,0.0003970295,0.0003799527,0.00008589232,0.99101526,0.004706114,0.002888078],"study_design_scores_gemma":[0.000023888066,0.0000072845796,0.00013676086,0.000020925369,0.0000049514665,0.000048178426,0.000099424215,0.00085071,0.00009596814,0.9955461,0.003155108,0.00001073108],"about_ca_topic_score_codex":0.0014317388,"about_ca_topic_score_gemma":0.0010124139,"teacher_disagreement_score":0.017266119,"about_ca_system_score_codex":0.0024949352,"about_ca_system_score_gemma":0.0014297733,"threshold_uncertainty_score":0.057760954},"labels":[],"label_agreement":null},{"id":"W4392947762","doi":"10.1016/j.jcta.2024.105887","title":"Extremal Peisert-type graphs without the strict-EKR property","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Type (biology); Property (philosophy); Combinatorics; Mathematics; Philosophy; Geology; Epistemology; Paleontology","score_opus":0.01369679362650714,"score_gpt":0.23965393686259145,"score_spread":0.22595714323608432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392947762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7317283,0.0005303081,0.08127953,0.0020535805,0.0002791769,0.000071196526,0.000970162,0.0006775073,0.1824102],"genre_scores_gemma":[0.97540104,0.0002757195,0.010760915,0.0003670919,0.00011704364,0.000041775045,0.00038234366,0.00011032825,0.01254373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997197,0.00006771578,0.000015317646,0.00005888616,0.00007147522,0.00006678724],"domain_scores_gemma":[0.9985567,0.00062925066,0.0002248124,0.00026544448,0.0001407621,0.00018292741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004049761,0.00039086462,0.00056638964,0.001503225,0.001239806,0.0018482141,0.00085576775,0.0014138893,0.0075382926],"category_scores_gemma":[0.0022913325,0.00045191287,0.00048076606,0.000783441,0.0014284566,0.002900328,0.0013023441,0.001722358,0.0009087551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059722035,0.000018548564,0.00035998385,0.00004308974,0.000008842407,0.00021800685,0.000078441015,0.0010132886,0.0014436506,0.99109787,0.0018389832,0.003819645],"study_design_scores_gemma":[0.000025455956,0.000014625712,0.00048747213,0.000013056589,0.000010413681,0.00038135317,0.00006371705,0.0061007803,0.0010221011,0.9902716,0.0015963473,0.000013052392],"about_ca_topic_score_codex":0.00024598787,"about_ca_topic_score_gemma":0.0003641399,"teacher_disagreement_score":0.0075382926,"about_ca_system_score_codex":0.0004415658,"about_ca_system_score_gemma":0.00038614916,"threshold_uncertainty_score":0.02521807},"labels":[],"label_agreement":null},{"id":"W4398195493","doi":"10.1016/j.jcta.2024.105910","title":"Power-free complementary binary morphisms","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphism; Binary number; Power (physics); Mathematics; Computer science; Arithmetic; Pure mathematics; Physics; Thermodynamics","score_opus":0.008167672429959087,"score_gpt":0.2369642211132666,"score_spread":0.2287965486833075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398195493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4572746,0.00095119723,0.28643486,0.0019004568,0.0010513572,0.00011230498,0.00046666377,0.0008365544,0.25097206],"genre_scores_gemma":[0.9046546,0.0005260759,0.03356949,0.00040762615,0.00044427652,0.000108129214,0.0002861026,0.0002656218,0.059738006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878186,0.0002246734,0.00007748474,0.0002843867,0.0004029261,0.00022867638],"domain_scores_gemma":[0.99476826,0.0030357323,0.00022245028,0.000605383,0.0007287727,0.0006392948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012659078,0.0005943066,0.00091522513,0.00250845,0.0026428653,0.003932935,0.0008848592,0.001203498,0.011614484],"category_scores_gemma":[0.0045965053,0.0007614278,0.0009852664,0.0013119021,0.0037492835,0.0062202755,0.0035447886,0.002423978,0.0018128201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028108136,0.000025565183,0.00014330221,0.0000183413,0.0000041026296,0.0001210535,0.00028674997,0.0001704096,0.0014180677,0.99255556,0.00073713827,0.00449156],"study_design_scores_gemma":[0.000023289736,0.000015745494,0.00019499923,0.000014483175,0.000015111078,0.00033903224,0.000119772216,0.0021991835,0.0024556932,0.9874527,0.0071505285,0.00001952835],"about_ca_topic_score_codex":0.0004123814,"about_ca_topic_score_gemma":0.00050204736,"teacher_disagreement_score":0.011614484,"about_ca_system_score_codex":0.0010375007,"about_ca_system_score_gemma":0.0006942294,"threshold_uncertainty_score":0.0388543},"labels":[],"label_agreement":null},{"id":"W4402795462","doi":"10.1016/j.jcta.2024.105953","title":"On the proportion of metric matroids whose Jacobians have nontrivial p-torsion","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Matroid; Torsion (gastropod); Metric (unit); Combinatorics; Pure mathematics; Discrete mathematics; Surgery","score_opus":0.011077114220522991,"score_gpt":0.2752186489763287,"score_spread":0.2641415347558057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402795462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783844,0.00039599815,0.011214539,0.00047145726,0.00003382134,0.000017615155,0.00046995483,0.00017197907,0.008840246],"genre_scores_gemma":[0.9957897,0.00038999936,0.0016881129,0.000050110324,0.00010648149,0.000035463563,0.00057033694,0.00006833037,0.0013015547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811965,0.00040460017,0.00011211279,0.00053488417,0.0005068767,0.00032189285],"domain_scores_gemma":[0.97803724,0.01371682,0.004091498,0.0014932903,0.0011590694,0.0015020865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018687922,0.0007252134,0.0012269743,0.005524065,0.0018871776,0.004244283,0.0018955328,0.00163189,0.0066778897],"category_scores_gemma":[0.023297317,0.0006452562,0.00050695526,0.0027129916,0.003794072,0.0049095177,0.0024753688,0.0013622398,0.0006943138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014368461,0.0002888365,0.13603401,0.00068445335,0.00033939866,0.0021424661,0.002094653,0.060924184,0.036718313,0.6692198,0.010107788,0.08000916],"study_design_scores_gemma":[0.00019295826,0.0005313544,0.07517953,0.00020580791,0.00025117554,0.008665188,0.0022615793,0.18420044,0.026560208,0.6915769,0.010083675,0.00029115038],"about_ca_topic_score_codex":0.0006911363,"about_ca_topic_score_gemma":0.0005225938,"teacher_disagreement_score":0.0066778897,"about_ca_system_score_codex":0.0010989483,"about_ca_system_score_gemma":0.00034920115,"threshold_uncertainty_score":0.022339761},"labels":[],"label_agreement":null},{"id":"W4403418439","doi":"10.1016/j.jcta.2024.105964","title":"Indecomposable combinatorial games","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Memorial University of Newfoundland; University of New Brunswick","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Indecomposable module; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.01376293463604206,"score_gpt":0.27344592975974574,"score_spread":0.2596829951237037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403418439","genre_codex":"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.10768053,0.0033793678,0.6851753,0.0029227603,0.0005840661,0.00041229124,0.0015102526,0.0004906297,0.19784485],"genre_scores_gemma":[0.7451127,0.0041492134,0.1846313,0.0013081523,0.0011316447,0.0007933917,0.0024450144,0.00019518012,0.06023337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764293,0.0006041861,0.00016696572,0.00061537884,0.000705042,0.00026551264],"domain_scores_gemma":[0.99849486,0.0007677853,0.00016416927,0.00019980037,0.00018149504,0.00019186726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011661663,0.0013691449,0.0010114902,0.001243801,0.0013253809,0.0034610825,0.0019327299,0.0010883585,0.007100979],"category_scores_gemma":[0.003980092,0.00047601876,0.0010091239,0.0017940685,0.0035945366,0.0061832247,0.0024282767,0.0037864374,0.0015086095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021069607,0.000034156063,0.00010198751,0.000046802066,0.000010392948,0.000114238675,0.0001307631,0.00275549,0.00064589345,0.9852181,0.001518449,0.00940263],"study_design_scores_gemma":[0.00001222334,0.000013362277,0.000058354177,0.0000123466125,0.000004737698,0.00009396119,0.000033791686,0.0066484474,0.00027765485,0.9841689,0.008667642,0.000008531443],"about_ca_topic_score_codex":0.00088917254,"about_ca_topic_score_gemma":0.00079461234,"teacher_disagreement_score":0.007100979,"about_ca_system_score_codex":0.0016666434,"about_ca_system_score_gemma":0.00096037664,"threshold_uncertainty_score":0.023755133},"labels":[],"label_agreement":null},{"id":"W4406510177","doi":"10.1016/j.jcta.2025.106009","title":"There are no good infinite families of toric codes","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.00604794033340711,"score_gpt":0.22289110269807988,"score_spread":0.21684316236467277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406510177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94059604,0.0011811974,0.040851925,0.0011733108,0.00008637124,0.000029351826,0.00036999243,0.0002111172,0.015500759],"genre_scores_gemma":[0.98931956,0.00033970238,0.007131848,0.00018114506,0.000060344522,0.00007141855,0.00034779368,0.000049922804,0.002498248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868816,0.0003145802,0.00007602401,0.00025488506,0.00036455592,0.00030175515],"domain_scores_gemma":[0.9907831,0.004833871,0.0009594928,0.001260526,0.0010809567,0.001082023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011700435,0.00041558628,0.001028014,0.001572189,0.0027579425,0.0025728007,0.0008638827,0.0009498734,0.0022293737],"category_scores_gemma":[0.009409687,0.00088892266,0.0007450382,0.0009339565,0.0045121266,0.0034736753,0.002040941,0.0015873769,0.00029569116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049462885,0.000054091837,0.0077518015,0.00021803418,0.0000910024,0.0006905763,0.0012144074,0.018878436,0.0070319837,0.9467774,0.0040001157,0.012797496],"study_design_scores_gemma":[0.00014504482,0.00020822692,0.0060864985,0.00015109355,0.000120894896,0.0022678887,0.0012156825,0.07531583,0.010270424,0.88870025,0.015342274,0.00017596447],"about_ca_topic_score_codex":0.00074080133,"about_ca_topic_score_gemma":0.00070056925,"teacher_disagreement_score":0.0027579425,"about_ca_system_score_codex":0.0015507037,"about_ca_system_score_gemma":0.0006509136,"threshold_uncertainty_score":0.011251211},"labels":[],"label_agreement":null},{"id":"W4409135004","doi":"10.1016/j.jcta.2025.106048","title":"A central limit theorem for a card shuffling problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Shuffling; Mathematics; Limit (mathematics); Central limit theorem; Combinatorics; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.022667238971362594,"score_gpt":0.3050294632365724,"score_spread":0.2823622242652098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409135004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.17805001,0.0018833507,0.6664971,0.009936413,0.0010606505,0.00031317893,0.000645753,0.0006803198,0.14093317],"genre_scores_gemma":[0.821906,0.001789302,0.10761533,0.0032507158,0.001771828,0.0013207906,0.00096930703,0.00073394686,0.060642794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535537,0.0014957228,0.00026860856,0.0009222375,0.0011158624,0.00084221194],"domain_scores_gemma":[0.9717443,0.020266233,0.0011876023,0.0018166096,0.0023562813,0.0026289301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0087557165,0.0017779346,0.0043356726,0.0043962062,0.0052309777,0.010286054,0.007254349,0.0051003145,0.017595831],"category_scores_gemma":[0.029259702,0.0014369984,0.003707054,0.0049830754,0.008822774,0.020460956,0.010100079,0.010157982,0.0021191987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070928276,0.00012274338,0.00024108174,0.00007140485,0.000033208686,0.00007662611,0.00015400183,0.0024304132,0.00057342317,0.9893694,0.0025541645,0.0043025347],"study_design_scores_gemma":[0.00003902686,0.00002695866,0.00008200569,0.000015328242,0.000019284096,0.000095658084,0.000044278848,0.025142998,0.00030353147,0.9731121,0.001094703,0.0000240557],"about_ca_topic_score_codex":0.0017077106,"about_ca_topic_score_gemma":0.0011791656,"teacher_disagreement_score":0.017595831,"about_ca_system_score_codex":0.0035864485,"about_ca_system_score_gemma":0.0042342166,"threshold_uncertainty_score":0.05886388},"labels":[],"label_agreement":null},{"id":"W4411244456","doi":"10.1016/j.jcta.2025.106080","title":"Avoiding short progressions in Euclidean Ramsey theory","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Euclidean geometry; Ramsey theory; Combinatorics; Mathematics education; Discrete mathematics; Geometry","score_opus":0.01897258231165641,"score_gpt":0.3221627856217802,"score_spread":0.3031902033101238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411244456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49698606,0.002351952,0.3878249,0.0013353579,0.0004046832,0.00010826802,0.000247991,0.0005277088,0.110213056],"genre_scores_gemma":[0.91618276,0.000875421,0.06782882,0.00038335347,0.00016808033,0.00012009502,0.00013509346,0.00008321223,0.014223212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.0003182742,0.000055875083,0.00020684561,0.00026010224,0.00014945207],"domain_scores_gemma":[0.99860543,0.0005410232,0.00021993936,0.00022097293,0.00018151083,0.00023101339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012782376,0.0005563887,0.00042083891,0.0015466132,0.0015061486,0.0013722739,0.001051109,0.0007815813,0.0046266625],"category_scores_gemma":[0.0029846588,0.00039585037,0.00074126926,0.00104585,0.0030247604,0.005086806,0.0022482087,0.0018383126,0.0006721888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012009425,0.000008775906,0.00010593364,0.000025334302,0.0000032991763,0.000045307923,0.00015644978,0.0016502059,0.0006508035,0.9938506,0.00040123242,0.0030900093],"study_design_scores_gemma":[0.000009421889,0.000025877169,0.00013658912,0.000016069676,0.0000040878354,0.00011174636,0.00009175444,0.006052669,0.0005292808,0.9893612,0.0036463437,0.000015064151],"about_ca_topic_score_codex":0.0011182374,"about_ca_topic_score_gemma":0.0011766073,"teacher_disagreement_score":0.0046266625,"about_ca_system_score_codex":0.0011510783,"about_ca_system_score_gemma":0.0005595733,"threshold_uncertainty_score":0.015477717},"labels":[],"label_agreement":null},{"id":"W4412992705","doi":"10.1016/j.jcta.2025.106096","title":"The existence of m-Haar graphical representations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Mathematics; Haar; Combinatorics; Algebra over a field; Pure mathematics; Artificial intelligence","score_opus":0.016198755691314237,"score_gpt":0.323305856646236,"score_spread":0.3071071009549218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412992705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69901043,0.0006096431,0.16579753,0.0025378421,0.0002751156,0.00006317212,0.00038405863,0.0005372483,0.13078494],"genre_scores_gemma":[0.98118275,0.0001879982,0.00898417,0.00020237856,0.00015285196,0.000029798504,0.00014544591,0.000056387467,0.009058227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917287,0.00018644231,0.000045053035,0.00022993324,0.0001623377,0.00020338713],"domain_scores_gemma":[0.9949864,0.0024902201,0.00060146285,0.00065097306,0.00058537116,0.0006856238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078279886,0.0006063068,0.00086281786,0.0029798935,0.0021744384,0.004524367,0.0013544867,0.002169609,0.01147672],"category_scores_gemma":[0.005574863,0.0010272465,0.00079840195,0.0014739381,0.0035167735,0.006061689,0.0035208028,0.002642256,0.001445797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019905974,0.000015582355,0.00028387783,0.000016590431,0.000005331524,0.000087815795,0.00025393988,0.00024133055,0.0008777682,0.9945456,0.00050872547,0.003143566],"study_design_scores_gemma":[0.000014353283,0.000019530204,0.00047844258,0.000011314993,0.000010112906,0.00023474931,0.0001762373,0.0033674987,0.000671811,0.9934616,0.0015382139,0.000016135122],"about_ca_topic_score_codex":0.00034556535,"about_ca_topic_score_gemma":0.00035479607,"teacher_disagreement_score":0.01147672,"about_ca_system_score_codex":0.0005920581,"about_ca_system_score_gemma":0.00029757153,"threshold_uncertainty_score":0.038393497},"labels":[],"label_agreement":null}]}