{"meta":{"query_hash":"bbdce79d7f7b","filters":{"venue":"SIAM Journal on Discrete Mathematics"},"cohort_total":76,"direct_labels_cover":0,"predictions_cover":76,"exported":76,"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/bbdce79d7f7b","api":"https://metacan.xera.ac/api/v1/cohort?venue=SIAM+Journal+on+Discrete+Mathematics"},"results":[{"id":"W1813313303","doi":"10.1137/100793529","title":"A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest path problem; Combinatorics; Mathematics; Lexicographical order; Discrete mathematics; Time complexity; Induced path; Hamiltonian path; Graph; Shortest path problem","score_opus":0.037621190887750726,"score_gpt":0.32785387620906364,"score_spread":0.2902326853213129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813313303","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.033478193,0.000573075,0.9370495,0.0014173988,0.0001318478,0.0005030171,0.00089225534,0.0066586747,0.019295922],"genre_scores_gemma":[0.20952803,0.00045467354,0.7742388,0.0003823388,0.00013358163,0.0005079497,0.0032984838,0.0009484551,0.010507702],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986203,0.00017319711,0.00006962575,0.00058480963,0.00025573134,0.00029639876],"domain_scores_gemma":[0.99834406,0.00092542445,0.00012667614,0.00035833754,0.00016141435,0.00008411998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056222716,0.0014701203,0.0013459239,0.0011972944,0.0012203186,0.0017285831,0.0024084614,0.0018134734,0.015746042],"category_scores_gemma":[0.0037152644,0.0006251137,0.0015378827,0.002639159,0.00096957694,0.00408162,0.0025967825,0.0026636766,0.003707059],"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.0006067408,0.0006807811,0.0015006401,0.00097603264,0.00014583614,0.00032400122,0.0007199144,0.13048248,0.01783871,0.15384072,0.061215676,0.63166845],"study_design_scores_gemma":[0.00036654464,0.0002448063,0.00068859,0.00006800418,0.00008922287,0.0004794775,0.00029889398,0.6788419,0.008714265,0.27911663,0.031030413,0.00006133772],"about_ca_topic_score_codex":0.007254195,"about_ca_topic_score_gemma":0.008621378,"teacher_disagreement_score":0.015746042,"about_ca_system_score_codex":0.002436363,"about_ca_system_score_gemma":0.0027133604,"threshold_uncertainty_score":0.052675724},"labels":[],"label_agreement":null},{"id":"W1965667139","doi":"10.1137/110847585","title":"A Local Strengthening of Reed's $\\omega$, $\\Delta$, $\\chi$ Conjecture for Quasi-line Graphs","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Omega; Conjecture; Combinatorics; Mathematics; Line (geometry); Mathematical proof; Graph; Line graph; Discrete mathematics; Physics; Geometry","score_opus":0.03564674079192311,"score_gpt":0.3243638320159371,"score_spread":0.288717091224014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965667139","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.41727892,0.0011662906,0.49595043,0.014945792,0.00051508716,0.000321848,0.0013912747,0.0047982363,0.063632004],"genre_scores_gemma":[0.8808884,0.0007819036,0.09985067,0.00238802,0.0005042299,0.0003209965,0.0013360991,0.00049583433,0.013433838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788624,0.00056790415,0.00008904649,0.00079425174,0.0003351643,0.0003272526],"domain_scores_gemma":[0.9884305,0.0061392,0.00075336715,0.0032196618,0.0008654593,0.00059172267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024579524,0.0011438347,0.0013681048,0.0008076206,0.0019273664,0.002428071,0.0028637524,0.001590907,0.01649605],"category_scores_gemma":[0.010262716,0.0010230527,0.0017074683,0.0010635812,0.003258049,0.0106664905,0.0040012035,0.0062605953,0.0026651009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019026289,0.00056141557,0.009931533,0.0017977344,0.00021135664,0.0010220095,0.00232353,0.06713321,0.062043373,0.67399853,0.050308555,0.12876622],"study_design_scores_gemma":[0.00030904374,0.0005321828,0.004865034,0.00022553354,0.00020814767,0.0012773058,0.0012788001,0.2622177,0.038010374,0.6542385,0.03666041,0.00017682336],"about_ca_topic_score_codex":0.0025327695,"about_ca_topic_score_gemma":0.0033174877,"teacher_disagreement_score":0.01649605,"about_ca_system_score_codex":0.0017086407,"about_ca_system_score_gemma":0.0014388409,"threshold_uncertainty_score":0.05518484},"labels":[],"label_agreement":null},{"id":"W1969856863","doi":"10.1137/120898528","title":"On the Maximum Density of Graphs with Unique-Path Labelings","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Edge-graceful labeling; Vertex (graph theory); Lemma (botany); Path graph; Path (computing); Graph labeling; Graph; Discrete mathematics; Induced path; Upper and lower bounds; Simple graph; Longest path problem; Graph power; Shortest path problem; Line graph; Computer science","score_opus":0.011614582477812458,"score_gpt":0.21200822000759925,"score_spread":0.20039363752978678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969856863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58980584,0.0032586148,0.36884242,0.0042071296,0.00010622225,0.00013772922,0.0012083927,0.0009881622,0.031445455],"genre_scores_gemma":[0.9429568,0.0015361976,0.050942853,0.00038569077,0.00020507241,0.00028135808,0.00071244146,0.00026079605,0.0027188505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980702,0.00083539926,0.000065500855,0.00041809236,0.00033426553,0.00027661523],"domain_scores_gemma":[0.96658593,0.02783015,0.001518141,0.0017293349,0.0010202294,0.0013162771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026473438,0.00085192063,0.0015772637,0.0022506402,0.0016868961,0.002728572,0.0027390316,0.0018011567,0.0051646503],"category_scores_gemma":[0.030449951,0.0014949676,0.00078070216,0.0019609754,0.003592568,0.0068763425,0.0032834902,0.0019158408,0.0006854322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004984345,0.0001514148,0.0077813775,0.00053530344,0.00008195877,0.0003119103,0.0009237816,0.07077427,0.008349987,0.8720159,0.008093293,0.030482236],"study_design_scores_gemma":[0.000078554825,0.000095774194,0.0030739715,0.00009965685,0.000052157604,0.0005951827,0.0002823892,0.2787012,0.0033418264,0.709933,0.0037003714,0.00004586085],"about_ca_topic_score_codex":0.0015695393,"about_ca_topic_score_gemma":0.0017033159,"teacher_disagreement_score":0.0051646503,"about_ca_system_score_codex":0.002310507,"about_ca_system_score_gemma":0.00067226024,"threshold_uncertainty_score":0.01727748},"labels":[],"label_agreement":null},{"id":"W1974452921","doi":"10.1137/120891265","title":"Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Isoperimetric inequality; Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.026484326963304695,"score_gpt":0.3057508159746372,"score_spread":0.2792664890113325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974452921","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.15926851,0.0087019885,0.7560831,0.007396044,0.00045481158,0.00030072877,0.002384106,0.0017728894,0.06363782],"genre_scores_gemma":[0.7897412,0.0070984946,0.17811838,0.0022203855,0.0016018106,0.001388495,0.0029032344,0.0014626244,0.01546547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911376,0.0028913713,0.0003563081,0.002218214,0.0023509518,0.0010454993],"domain_scores_gemma":[0.91593456,0.0656515,0.004246933,0.007575786,0.0035295011,0.0030616447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00745567,0.003345337,0.0026097542,0.005807304,0.0023966578,0.004631918,0.0065850853,0.0032282192,0.008183946],"category_scores_gemma":[0.082646646,0.0018668445,0.0027871935,0.0035712523,0.0060834847,0.01355808,0.0067651677,0.010346866,0.0017529556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007939625,0.00032119115,0.00481527,0.00093815883,0.00027414924,0.00039942554,0.00059749867,0.19520952,0.013507081,0.7161911,0.012437976,0.054514747],"study_design_scores_gemma":[0.00005366463,0.0001426952,0.00230656,0.0001780814,0.00009104673,0.0005861253,0.00011348176,0.5191662,0.006188976,0.46426353,0.0067910757,0.000118564116],"about_ca_topic_score_codex":0.0013490263,"about_ca_topic_score_gemma":0.001290123,"teacher_disagreement_score":0.008183946,"about_ca_system_score_codex":0.0059616817,"about_ca_system_score_gemma":0.0014875521,"threshold_uncertainty_score":0.04325527},"labels":[],"label_agreement":null},{"id":"W1975406723","doi":"10.1137/070687988","title":"Edge-Face Total Chromatic Number of Halin Graphs","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Discrete mathematics; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence","score_opus":0.01865966902696562,"score_gpt":0.3178651783919686,"score_spread":0.29920550936500295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975406723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.922976,0.0002073304,0.051850352,0.0003820925,0.000032076867,0.000031157284,0.0004507348,0.00029251043,0.023777626],"genre_scores_gemma":[0.9842254,0.00010682074,0.011632786,0.000043339394,0.0000140601815,0.000031633957,0.00025225955,0.00005177814,0.0036419304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974364,0.000046401845,0.0000084621215,0.000058771886,0.000066116074,0.00007662251],"domain_scores_gemma":[0.99900156,0.0005323616,0.00009264469,0.00011344571,0.00012450131,0.00013555161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034138584,0.00036840065,0.00029402133,0.00087496365,0.00123674,0.001386819,0.0008177901,0.00030436972,0.004249832],"category_scores_gemma":[0.0013744117,0.00020902474,0.0001995542,0.0005672086,0.0007912393,0.0009918083,0.00070534606,0.00059400755,0.00027868143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020714328,0.0002513499,0.026243385,0.00036825347,0.00011206168,0.00046160712,0.0010791089,0.25939012,0.05859276,0.51062256,0.016618289,0.124189034],"study_design_scores_gemma":[0.00010084467,0.00018649257,0.0107779335,0.000039363724,0.00008193447,0.00050741725,0.00050243345,0.5802069,0.05203721,0.34505743,0.010431891,0.00007004125],"about_ca_topic_score_codex":0.0034667347,"about_ca_topic_score_gemma":0.005797954,"teacher_disagreement_score":0.004249832,"about_ca_system_score_codex":0.00169658,"about_ca_system_score_gemma":0.00062371074,"threshold_uncertainty_score":0.014217138},"labels":[],"label_agreement":null},{"id":"W1999315130","doi":"10.1137/080716931","title":"Paths with No Small Angles","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Travelling salesman problem; Path (computing); Constant (computer programming); Plane (geometry); Set (abstract data type); Discrete mathematics; Geometry; Algorithm; Graph; Computer science","score_opus":0.015618670685422333,"score_gpt":0.2381191567294982,"score_spread":0.22250048604407588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999315130","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.3354442,0.002797442,0.51328063,0.002402694,0.0009763939,0.0002696581,0.001849237,0.00094471633,0.14203511],"genre_scores_gemma":[0.72710043,0.0027795637,0.22613189,0.00067869475,0.00027541336,0.0004987016,0.0029459991,0.0004887807,0.039100453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988405,0.00022289639,0.00008098226,0.0003217317,0.00028435566,0.00024953333],"domain_scores_gemma":[0.99708134,0.0013864617,0.00038862924,0.00058758794,0.00025163835,0.00030431524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039887053,0.0008340537,0.00075450016,0.00082143676,0.0016362057,0.0022090436,0.0010309299,0.0014233406,0.01701162],"category_scores_gemma":[0.008010171,0.0008459968,0.00086365844,0.001179288,0.0015775829,0.0035318043,0.0037855778,0.0028205132,0.003384991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001029318,0.00013789983,0.0025805435,0.00052528066,0.00006927442,0.0006192389,0.0005984828,0.056270428,0.011742911,0.79048276,0.013850531,0.12209339],"study_design_scores_gemma":[0.00025969034,0.00027531997,0.001102989,0.00023198774,0.00007107973,0.00091298536,0.00061552355,0.085452646,0.008420899,0.8257356,0.076852724,0.00006850708],"about_ca_topic_score_codex":0.0009589362,"about_ca_topic_score_gemma":0.0011524584,"teacher_disagreement_score":0.01701162,"about_ca_system_score_codex":0.0006355289,"about_ca_system_score_gemma":0.00061393366,"threshold_uncertainty_score":0.0569095},"labels":[],"label_agreement":null},{"id":"W2001034532","doi":"10.1137/s0895480101384402","title":"Lower Bounds from Tile Covers for the Channel Assignment Problem","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Cover (algebra); Mathematics; Reduction (mathematics); Clique; Channel (broadcasting); Constraint (computer-aided design); Tile; Upper and lower bounds; Combinatorics; Enumeration; Mathematical optimization; Assignment problem; Discrete mathematics; Computer science; Computer network","score_opus":0.01180277747908987,"score_gpt":0.21966324579152882,"score_spread":0.20786046831243896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001034532","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.021146223,0.0024504545,0.9201123,0.0012803918,0.00031613928,0.00021880867,0.0010677871,0.00074098015,0.052666876],"genre_scores_gemma":[0.42732483,0.007088333,0.5237482,0.001349655,0.001691753,0.0023051896,0.0075546717,0.0024612185,0.026476104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957985,0.0010282401,0.00015069252,0.00045480643,0.0017795528,0.00078820833],"domain_scores_gemma":[0.9842451,0.012044154,0.0006418493,0.0012987803,0.0012532935,0.00051683525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036046184,0.0035996656,0.0020713334,0.004223967,0.0018820498,0.005418716,0.0027949747,0.00222357,0.015957452],"category_scores_gemma":[0.019098682,0.001415814,0.0036101595,0.0036937864,0.0021806913,0.0067599565,0.0042104847,0.007901085,0.0035610923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040862724,0.00027175894,0.0012737717,0.00080410164,0.00019209493,0.00028005653,0.00041799754,0.36758295,0.007051476,0.49485186,0.036452383,0.09041291],"study_design_scores_gemma":[0.0000614245,0.00014440577,0.00051895896,0.00017647447,0.00009701992,0.00020837567,0.00008944059,0.5132744,0.0048063193,0.4614753,0.019103548,0.000044303673],"about_ca_topic_score_codex":0.0015226665,"about_ca_topic_score_gemma":0.00203151,"teacher_disagreement_score":0.015957452,"about_ca_system_score_codex":0.0036370615,"about_ca_system_score_gemma":0.0015022885,"threshold_uncertainty_score":0.053382993},"labels":[],"label_agreement":null},{"id":"W2009791993","doi":"10.1137/13094075x","title":"An Erdös--Ko--Rado Theorem for the Derangement Graph of ${PGL}_3(q)$ Acting on the Projective Plane","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Projective plane; Derangement; Coset; Conjecture; Projective space; Projective line; Discrete mathematics; Projective linear group; Collineation; Projective test; Pure mathematics","score_opus":0.016863005714924547,"score_gpt":0.24357951935729413,"score_spread":0.22671651364236958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009791993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5180965,0.0013033783,0.33374792,0.0048327646,0.00040478332,0.00018494211,0.0011852613,0.0004385199,0.13980593],"genre_scores_gemma":[0.9474848,0.0010731714,0.034647163,0.0008523618,0.00027333564,0.00025459955,0.0007995359,0.0001081855,0.014506852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882084,0.00025211464,0.000074447664,0.0003801102,0.00028307518,0.00018951086],"domain_scores_gemma":[0.99717283,0.0013999344,0.0004697462,0.00040456268,0.00028577854,0.00026704255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011594688,0.0006401217,0.00094655016,0.0015424665,0.0024402693,0.0022753077,0.00087714725,0.0009250001,0.008276837],"category_scores_gemma":[0.0030776572,0.00041854507,0.001143199,0.0012591394,0.0031272692,0.0049639074,0.0030583707,0.0025238236,0.0011874117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054911747,0.0000114660525,0.00078032946,0.00004412161,0.00001468543,0.0000964041,0.00023988035,0.001598174,0.0014897776,0.98979455,0.0014398259,0.0044359146],"study_design_scores_gemma":[0.0000316778,0.000052252173,0.0007416754,0.000022865088,0.000033964905,0.00031082923,0.00026438315,0.009396901,0.0028443134,0.97346616,0.01280576,0.000029347066],"about_ca_topic_score_codex":0.00084954756,"about_ca_topic_score_gemma":0.0005645859,"teacher_disagreement_score":0.008276837,"about_ca_system_score_codex":0.0011808297,"about_ca_system_score_gemma":0.00046297107,"threshold_uncertainty_score":0.027688801},"labels":[],"label_agreement":null},{"id":"W2039117743","doi":"10.1137/s0895480103437651","title":"Alternative Digit Sets for Nonadjacent Representations","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Set (abstract data type); Representation (politics); Combinatorics; Discrete mathematics; Numerical digit; Arithmetic; Computer science","score_opus":0.027856050169179917,"score_gpt":0.3162148602328879,"score_spread":0.288358810063708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039117743","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.4199552,0.0008590602,0.54367834,0.00050264207,0.00027614867,0.00014408368,0.00047099622,0.001377575,0.032736037],"genre_scores_gemma":[0.7162679,0.0002302226,0.27379873,0.00017133607,0.00008575497,0.00008630112,0.0005502539,0.00012104523,0.008688415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980373,0.00032361297,0.00025851562,0.00046252063,0.00070239865,0.00021567142],"domain_scores_gemma":[0.9961696,0.0016571985,0.000362699,0.0012268347,0.00039806706,0.00018559778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012076545,0.00051862124,0.0006782092,0.0017836738,0.0013339175,0.0033633725,0.0013542384,0.0009843047,0.008141418],"category_scores_gemma":[0.008083756,0.00036493695,0.00076174235,0.0015448241,0.0015916441,0.0035876313,0.002339291,0.001148512,0.0017376563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000877191,0.00017475772,0.0032824827,0.0002136811,0.000028418737,0.0009785409,0.0006361863,0.016385382,0.020800302,0.74380636,0.002448559,0.21036816],"study_design_scores_gemma":[0.00010632083,0.00032855765,0.0009638684,0.00014466778,0.000050371244,0.0019256937,0.00041018586,0.11636548,0.0546611,0.7914164,0.033502813,0.00012451794],"about_ca_topic_score_codex":0.00024384119,"about_ca_topic_score_gemma":0.0004194565,"teacher_disagreement_score":0.008141418,"about_ca_system_score_codex":0.000837267,"about_ca_system_score_gemma":0.000723868,"threshold_uncertainty_score":0.027235806},"labels":[],"label_agreement":null},{"id":"W2040969474","doi":"10.1137/s0895480103421397","title":"On the Behavior of a Family of Meta-Fibonacci Sequences","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Recursion (computer science); Sequence (biology); Palindrome; Term (time); Discrete mathematics; Algorithm; Physics","score_opus":0.04635252515277444,"score_gpt":0.3245307035768404,"score_spread":0.27817817842406595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040969474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7644927,0.0022788092,0.19909945,0.00053676363,0.00007501106,0.000068663685,0.0003392944,0.00041918113,0.032690104],"genre_scores_gemma":[0.9550194,0.00069849077,0.039097257,0.00009810919,0.00007230331,0.00014954116,0.0002893448,0.000085691994,0.004489873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952793,0.0001309906,0.000026742055,0.00009763913,0.00014420046,0.0000725935],"domain_scores_gemma":[0.9977367,0.0012681421,0.00029646317,0.00016316699,0.00032471452,0.00021078395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092604326,0.00048869185,0.0003807204,0.0022966922,0.0014548068,0.0013672716,0.0008411454,0.0008947137,0.0024762976],"category_scores_gemma":[0.005217915,0.0003905968,0.0005663707,0.0009477627,0.0016976357,0.001719009,0.00053769775,0.0006614629,0.00043914389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010079742,0.000024429364,0.004251009,0.000078098696,0.000020765998,0.0005999793,0.00075667456,0.018727385,0.010574446,0.9511273,0.0010393992,0.012699759],"study_design_scores_gemma":[0.000028619455,0.00011658473,0.0032072132,0.00008794085,0.000024388826,0.00183645,0.00031261446,0.31577572,0.0057034846,0.6653755,0.007450302,0.00008114141],"about_ca_topic_score_codex":0.0011361495,"about_ca_topic_score_gemma":0.0007666467,"teacher_disagreement_score":0.0024762976,"about_ca_system_score_codex":0.0011450463,"about_ca_system_score_gemma":0.0005596538,"threshold_uncertainty_score":0.008307934},"labels":[],"label_agreement":null},{"id":"W2046684958","doi":"10.1137/100803870","title":"Gallai's Theorem for List Coloring of Digraphs","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complete coloring; Fractional coloring; Greedy coloring; Vertex (graph theory); List coloring; Discrete mathematics; Generalization; Brooks' theorem; Graph; Graph coloring; Graph power; Line graph","score_opus":0.058209093472088747,"score_gpt":0.311648151051908,"score_spread":0.25343905757981927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046684958","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.0378347,0.004147639,0.7891356,0.007491629,0.0014282463,0.000280343,0.002275729,0.0021268248,0.1552794],"genre_scores_gemma":[0.5564198,0.008243797,0.32199678,0.008526322,0.00205316,0.0012491947,0.0036565026,0.0015173331,0.09633708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985783,0.0002327339,0.000091877155,0.00045939762,0.00036929199,0.00026839494],"domain_scores_gemma":[0.99596244,0.0023166104,0.00020359525,0.00067785004,0.00047279833,0.00036671685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016487536,0.001355627,0.0014210275,0.0030145035,0.0036386135,0.0045005735,0.0022181133,0.002185196,0.012546663],"category_scores_gemma":[0.008651676,0.0010411007,0.002863664,0.004094388,0.0033903264,0.007580003,0.0036711465,0.0053644488,0.0034074038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053807475,0.00002484534,0.00027661092,0.00017602995,0.000029702589,0.00013820795,0.00033761765,0.0046686484,0.0011849063,0.9540148,0.017641341,0.021453584],"study_design_scores_gemma":[0.00003581617,0.000019858064,0.00020175602,0.000046190275,0.00003440458,0.00023233028,0.00006050332,0.013799722,0.0011334893,0.95064443,0.033763144,0.00002848179],"about_ca_topic_score_codex":0.005006943,"about_ca_topic_score_gemma":0.0045164917,"teacher_disagreement_score":0.012546663,"about_ca_system_score_codex":0.0037581658,"about_ca_system_score_gemma":0.0016144435,"threshold_uncertainty_score":0.041972756},"labels":[],"label_agreement":null},{"id":"W2049572715","doi":"10.1137/13090465x","title":"On List Coloring and List Homomorphism of Permutation and Interval Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"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 Alberta","funders":"","keywords":"Combinatorics; Mathematics; Permutation graph; Discrete mathematics; Indifference graph; Chordal graph; Bipartite graph; Graph coloring; Interval graph; Pathwidth; 1-planar graph; Homomorphism; Cograph; Maximal independent set; Interval (graph theory); Edge coloring; Time complexity; Graph; Line graph; Graph power","score_opus":0.018303993312181067,"score_gpt":0.2873615626007403,"score_spread":0.26905756928855923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049572715","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.10596487,0.00096504873,0.8718886,0.00193888,0.00017293233,0.00032203438,0.0008298844,0.0018354653,0.016082376],"genre_scores_gemma":[0.5628833,0.0019046388,0.41891623,0.0007357,0.000534762,0.000442997,0.0030923553,0.0006631563,0.010826886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848735,0.00045922174,0.000066109096,0.00041094492,0.0002634429,0.00031296405],"domain_scores_gemma":[0.99222094,0.005816622,0.00043618196,0.0008586582,0.0002997633,0.00036782806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013327269,0.0011435732,0.0009773741,0.0007427764,0.0014025117,0.0026051893,0.002128575,0.0012591839,0.008791491],"category_scores_gemma":[0.007133938,0.000601113,0.0014103089,0.0021817207,0.0019967451,0.0075533544,0.0025412864,0.00322136,0.0014572879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012759422,0.0013209088,0.0032178662,0.0010049714,0.00012923357,0.0006630488,0.00077743107,0.27727002,0.01517304,0.38497803,0.028538972,0.28565067],"study_design_scores_gemma":[0.0001889331,0.00021148771,0.0007658989,0.000050500905,0.00006457187,0.0005037683,0.0002991395,0.36655256,0.010135275,0.6118752,0.009281942,0.00007078683],"about_ca_topic_score_codex":0.0027907037,"about_ca_topic_score_gemma":0.0027029957,"teacher_disagreement_score":0.008791491,"about_ca_system_score_codex":0.001829246,"about_ca_system_score_gemma":0.0020140077,"threshold_uncertainty_score":0.029410422},"labels":[],"label_agreement":null},{"id":"W2053642853","doi":"10.1137/130929229","title":"Homological Face-Width Condition Forcing $K_6$-Minors in Graphs on Surfaces","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Mathematics; Combinatorics; Projective plane; Face (sociological concept); Graph; Minor (academic); Discrete mathematics; Surface (topology); Plane (geometry); Geometry","score_opus":0.0269461334175931,"score_gpt":0.3094823273796334,"score_spread":0.28253619396204027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053642853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9498968,0.00016011028,0.03011572,0.0004890449,0.00008997713,0.00002588634,0.00014415456,0.00030870896,0.018769529],"genre_scores_gemma":[0.9871867,0.00009956276,0.008234305,0.000112818314,0.00009012297,0.000030798958,0.00026298425,0.000108294116,0.00387428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994709,0.00007894891,0.00003313914,0.00013316817,0.00013239535,0.00015154597],"domain_scores_gemma":[0.9981108,0.00083901745,0.0002080015,0.0002754936,0.00022689816,0.00033977954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048265624,0.00046783278,0.00064631016,0.00090916466,0.0011810866,0.0016622427,0.0009049269,0.00090626045,0.005915963],"category_scores_gemma":[0.0026209261,0.00045103068,0.0009591897,0.0004239947,0.0018676593,0.0024287826,0.0025122722,0.001768787,0.0006354589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000567223,0.000122941,0.004676041,0.0002104084,0.00004968336,0.0010329947,0.00156516,0.009498205,0.045060337,0.91304696,0.0034503585,0.020719642],"study_design_scores_gemma":[0.00007113416,0.00016546383,0.003416041,0.00002721877,0.000037874666,0.000759955,0.0008753596,0.020749275,0.018364167,0.9481677,0.007304901,0.00006105015],"about_ca_topic_score_codex":0.00077587366,"about_ca_topic_score_gemma":0.0008871153,"teacher_disagreement_score":0.005915963,"about_ca_system_score_codex":0.0007353868,"about_ca_system_score_gemma":0.00032621055,"threshold_uncertainty_score":0.019790888},"labels":[],"label_agreement":null},{"id":"W2058787718","doi":"10.1137/130950422","title":"Empty Pentagons in Point Sets with Collinearities","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Deutsche Forschungsgemeinschaft; Fonds De La Recherche Scientifique - FNRS; Australian Government; Hungarian Scientific Research Fund; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Pentagon; Regular polygon; Plane (geometry); General position; Convex polytope; Point (geometry); Finite set; Convex set; Constant (computer programming)","score_opus":0.035811816901916524,"score_gpt":0.28386318805756705,"score_spread":0.2480513711556505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058787718","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45002645,0.0019156924,0.46027446,0.0013033237,0.0002941423,0.00018862619,0.0013556454,0.0009782223,0.083663285],"genre_scores_gemma":[0.81671256,0.001333371,0.16306281,0.0005181085,0.00014606952,0.00022366941,0.002104245,0.0004877387,0.015411442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741685,0.0004781399,0.00016309522,0.0004929372,0.00086703856,0.00058190647],"domain_scores_gemma":[0.99186665,0.005054712,0.00078289496,0.0013194991,0.0005408406,0.00043549988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010877205,0.00092500495,0.0011510283,0.0011127499,0.0016921125,0.0037036652,0.0019445322,0.0008608276,0.009677086],"category_scores_gemma":[0.010021307,0.0012660536,0.0011159297,0.001924952,0.0029642845,0.0041079684,0.004544131,0.0032731364,0.0023101773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011765265,0.00022008273,0.004800498,0.00074757414,0.00012264575,0.0013074225,0.0007939745,0.109422706,0.011144209,0.77837014,0.0112713,0.08062298],"study_design_scores_gemma":[0.00011399484,0.0001743638,0.0010847253,0.0001790646,0.00007378185,0.0011070577,0.00063943246,0.14153546,0.014546539,0.82049036,0.019995505,0.000059698592],"about_ca_topic_score_codex":0.0013521764,"about_ca_topic_score_gemma":0.0017249042,"teacher_disagreement_score":0.009677086,"about_ca_system_score_codex":0.0009792779,"about_ca_system_score_gemma":0.00060651894,"threshold_uncertainty_score":0.03237307},"labels":[],"label_agreement":null},{"id":"W2059398229","doi":"10.1137/110846828","title":"Planar Graphs Have Exponentially Many 3-Arboricities","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Exponential growth; Colored; Projective test; Graph; Discrete mathematics; Class (philosophy); Planar straight-line graph; Outerplanar graph; 1-planar graph; Pathwidth; Line graph; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.03082149681854752,"score_gpt":0.29916580342904087,"score_spread":0.26834430661049335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059398229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71113217,0.0051248036,0.1904526,0.0074746045,0.0002513545,0.00011848692,0.004249568,0.0031216596,0.0780748],"genre_scores_gemma":[0.93757266,0.002997765,0.035421733,0.0011546243,0.00022206387,0.00024080678,0.002725901,0.0006211694,0.019043297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998546,0.00024392703,0.00008269288,0.00029412948,0.0004609268,0.00037232187],"domain_scores_gemma":[0.9884957,0.007548463,0.0010078799,0.0015821706,0.00084880815,0.00051700184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069979485,0.00089595356,0.0010061791,0.0010187663,0.0014797117,0.0030850645,0.0014795187,0.001371814,0.012785467],"category_scores_gemma":[0.007906805,0.0008732042,0.0012915473,0.001714538,0.0017313005,0.0062603313,0.0030841422,0.0027568855,0.0019548743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012960499,0.00030305615,0.013644527,0.0012891012,0.00022058508,0.0014104862,0.0009454847,0.053984832,0.029939458,0.74228525,0.03369189,0.12098925],"study_design_scores_gemma":[0.0001336505,0.00009869743,0.004752224,0.00013898234,0.00014397388,0.0023430404,0.00036744462,0.060277194,0.009952903,0.8912372,0.030478634,0.00007615598],"about_ca_topic_score_codex":0.0006458505,"about_ca_topic_score_gemma":0.0014489919,"teacher_disagreement_score":0.012785467,"about_ca_system_score_codex":0.0012844279,"about_ca_system_score_gemma":0.00042025218,"threshold_uncertainty_score":0.042771637},"labels":[],"label_agreement":null},{"id":"W2061027724","doi":"10.1137/s0895480103428053","title":"Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Aperiodic graph; Alphabet; Finite field; Ring (chemistry); Physics","score_opus":0.016314807711336768,"score_gpt":0.25113689835429853,"score_spread":0.23482209064296178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061027724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6847871,0.0006735949,0.26419714,0.0006911633,0.00014471165,0.00011847085,0.00060791284,0.0005935727,0.0481863],"genre_scores_gemma":[0.9459757,0.00037310904,0.044302355,0.00018882297,0.00018983863,0.00017403932,0.0005667096,0.00022835819,0.0080011645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975623,0.00045977984,0.00026239085,0.00057643134,0.0005355985,0.0006036143],"domain_scores_gemma":[0.99174315,0.004478459,0.0011346694,0.0012672893,0.00080909854,0.0005671775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002657129,0.00050748925,0.0009864818,0.0025149216,0.0017576071,0.005743713,0.0017202899,0.0012961081,0.0044334643],"category_scores_gemma":[0.013458864,0.00048030983,0.0010056314,0.0028677052,0.0032561724,0.0077489745,0.0021100934,0.00173365,0.00047720363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016485417,0.000028410956,0.0015559363,0.00006434914,0.00000913988,0.00008647941,0.0003711905,0.0036716228,0.0023980606,0.97839487,0.00083431846,0.012420727],"study_design_scores_gemma":[0.00002608842,0.00007251167,0.0013202649,0.000072689116,0.000041893913,0.00032369973,0.00020015462,0.04581371,0.0120417215,0.93592024,0.004113584,0.000053516538],"about_ca_topic_score_codex":0.00092607207,"about_ca_topic_score_gemma":0.00061263546,"teacher_disagreement_score":0.005743713,"about_ca_system_score_codex":0.0029588563,"about_ca_system_score_gemma":0.0010461675,"threshold_uncertainty_score":0.021468043},"labels":[],"label_agreement":null},{"id":"W2064062633","doi":"10.1137/100801044","title":"Isostatic Block and Hole Frameworks","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Rigidity (electromagnetism); Vertex (graph theory); Mathematics; Regular polygon; Combinatorics; Digraph; Graph; Geometry; Physics","score_opus":0.005130116889062898,"score_gpt":0.20397528712994245,"score_spread":0.19884517024087955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064062633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44430593,0.0019409694,0.3601265,0.0020159811,0.00025154673,0.00009049734,0.0006125292,0.0006479129,0.1900081],"genre_scores_gemma":[0.9513026,0.0004828192,0.026091024,0.0002574083,0.00010196927,0.00006845501,0.00030920032,0.00016922868,0.021217396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996045,0.00006919357,0.000011676838,0.00007987223,0.00012484084,0.00010983596],"domain_scores_gemma":[0.99957377,0.00008167794,0.000062639585,0.000106825486,0.000052935382,0.0001220983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004663279,0.00043709623,0.00049316336,0.00073451194,0.0012330272,0.00095799833,0.00093478087,0.0011011773,0.008997003],"category_scores_gemma":[0.0012589318,0.00020840306,0.0005826909,0.0003504401,0.0021270136,0.002466001,0.0020254615,0.0008942624,0.00077252754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001074021,0.0000050720582,0.00005851384,0.00000882456,0.0000015606979,0.000026000147,0.000043310094,0.003417497,0.0004646404,0.9940299,0.0004892557,0.0014448096],"study_design_scores_gemma":[0.000009635323,0.000019575618,0.00015006449,0.00000848728,0.0000030688716,0.0000553428,0.00005328029,0.029055508,0.00033530776,0.9658643,0.0044352636,0.000010156277],"about_ca_topic_score_codex":0.0026791096,"about_ca_topic_score_gemma":0.0028469327,"teacher_disagreement_score":0.008997003,"about_ca_system_score_codex":0.0007234915,"about_ca_system_score_gemma":0.0005986026,"threshold_uncertainty_score":0.030097961},"labels":[],"label_agreement":null},{"id":"W2073360418","doi":"10.1137/050624376","title":"The Linking Probability of Deep Spider-Web Networks","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Random variable; Path (computing); Crossbar switch; Infinity; Idle; Statistics; Computer science; Mathematical analysis; Graph; Telecommunications","score_opus":0.01440824035959683,"score_gpt":0.2358730037668926,"score_spread":0.22146476340729576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073360418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833867,0.0013358815,0.14531748,0.0010730952,0.0000684715,0.00006476893,0.00033120444,0.00041143355,0.017530572],"genre_scores_gemma":[0.9893895,0.0007602985,0.004327647,0.0001113347,0.00006733601,0.000080530575,0.00019288347,0.00007385962,0.0049966467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941707,0.00017199248,0.000022424165,0.000116364055,0.00011822775,0.00015402962],"domain_scores_gemma":[0.99179614,0.0049897344,0.0013651515,0.00030296756,0.00043311503,0.0011129022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017884977,0.0007232788,0.0008555468,0.0023187392,0.0009839325,0.0024196277,0.0014585563,0.0017264878,0.004545654],"category_scores_gemma":[0.013122069,0.0008637741,0.000529485,0.0010413299,0.0022210577,0.0040991525,0.002008466,0.0013194185,0.000499497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002122087,0.00011105054,0.006550286,0.00020462296,0.00007985659,0.00048019306,0.0004599246,0.5870595,0.0041312375,0.3833883,0.0029987306,0.014324038],"study_design_scores_gemma":[0.000020511907,0.000043303655,0.001085424,0.000034881712,0.000021570633,0.0001226556,0.00007262662,0.84527075,0.0006540933,0.15182376,0.00082232384,0.000028138804],"about_ca_topic_score_codex":0.0016023353,"about_ca_topic_score_gemma":0.0012268856,"teacher_disagreement_score":0.004545654,"about_ca_system_score_codex":0.0015246004,"about_ca_system_score_gemma":0.0004658123,"threshold_uncertainty_score":0.015206754},"labels":[],"label_agreement":null},{"id":"W2093347633","doi":"10.1137/s0895480100376022","title":"The Wakeup Problem in Synchronous Broadcast Systems","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Synchronization (alternating current); Computer science; Asynchronous communication; Clock synchronization; Parallel computing; Channel (broadcasting); Distributed computing; Computer network","score_opus":0.01245770845899721,"score_gpt":0.2471855765119259,"score_spread":0.2347278680529287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093347633","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.16086619,0.0014164613,0.82637316,0.0011690689,0.00019189503,0.0002021717,0.00017139544,0.0009473175,0.008662314],"genre_scores_gemma":[0.9319667,0.0007673177,0.058962148,0.00026662447,0.0002220481,0.00026350789,0.00026305445,0.0001772452,0.0071112365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718213,0.0011147036,0.00015008841,0.00044465763,0.00054777524,0.00056065095],"domain_scores_gemma":[0.9889121,0.008038743,0.0010213505,0.00092949974,0.0005208425,0.00057742797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029998503,0.00079797296,0.0013478389,0.0006660437,0.0017081463,0.0017803082,0.0017134692,0.0014647425,0.0034711442],"category_scores_gemma":[0.012633475,0.00074157194,0.00054614607,0.00088817603,0.002014326,0.0055411602,0.002628473,0.002021701,0.00055955246],"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.0017285312,0.00029465076,0.0029275967,0.0007605679,0.00011701746,0.0007097302,0.0016802556,0.45093438,0.012799152,0.4142537,0.009495741,0.10429865],"study_design_scores_gemma":[0.00024513312,0.00021257863,0.00047571032,0.000036803136,0.00005366466,0.00018002471,0.0003895779,0.73903996,0.003457887,0.2505208,0.005352364,0.00003551949],"about_ca_topic_score_codex":0.0016030105,"about_ca_topic_score_gemma":0.0012999765,"teacher_disagreement_score":0.0034711442,"about_ca_system_score_codex":0.0010271324,"about_ca_system_score_gemma":0.0013006688,"threshold_uncertainty_score":0.015864968},"labels":[],"label_agreement":null},{"id":"W2131975287","doi":"10.1137/100795425","title":"Nested Recurrence Relations with Conolly-like Solutions","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Fibonacci number; Sequence (biology); BETA (programming language); Integer (computer science); Discrete mathematics","score_opus":0.026111741299510324,"score_gpt":0.25227672015041924,"score_spread":0.22616497885090892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131975287","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.39488888,0.0012982299,0.4679482,0.0015799585,0.00048821428,0.0003393314,0.00066903286,0.0012564344,0.13153173],"genre_scores_gemma":[0.81554216,0.00046252625,0.1417001,0.0006941547,0.00017102476,0.00039742648,0.00073948357,0.00030596874,0.039987147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988444,0.00024034124,0.0001287598,0.00028110205,0.00025202995,0.00025337545],"domain_scores_gemma":[0.9980428,0.000875975,0.00032413183,0.00019182026,0.0004095859,0.00015560025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006250464,0.0005365591,0.0004925782,0.0009774622,0.0016699662,0.0018850189,0.00080839475,0.0010717624,0.010208977],"category_scores_gemma":[0.006964986,0.00040604535,0.0007804567,0.0010913471,0.0016842328,0.002316534,0.0013562532,0.0017296497,0.0015679148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004605476,0.000037082486,0.0007956802,0.00009769935,0.000009647233,0.0005749694,0.0010010401,0.0038227246,0.00569328,0.9669531,0.0028769614,0.018091679],"study_design_scores_gemma":[0.000048562633,0.00007415383,0.0005493937,0.000089861875,0.000035827277,0.00092952594,0.0006219091,0.036296517,0.00946623,0.92621887,0.025592694,0.000076329175],"about_ca_topic_score_codex":0.0026479496,"about_ca_topic_score_gemma":0.0054687276,"teacher_disagreement_score":0.010208977,"about_ca_system_score_codex":0.0015273802,"about_ca_system_score_gemma":0.00092856225,"threshold_uncertainty_score":0.03415239},"labels":[],"label_agreement":null},{"id":"W2238259313","doi":"10.1137/15m1007185","title":"Lehman's Theorem and the Directed Steiner Tree Problem","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Tree (set theory); Mathematical economics","score_opus":0.015248312301763711,"score_gpt":0.2699891274693736,"score_spread":0.2547408151676099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238259313","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.05384207,0.005759436,0.8437911,0.005152305,0.00021402267,0.000059512433,0.0004321839,0.00032324073,0.090426035],"genre_scores_gemma":[0.71084905,0.007939742,0.25203094,0.0013432474,0.0006385078,0.00016997645,0.0009078012,0.00018268745,0.02593803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00014165329,0.000033468885,0.00013275201,0.00024865833,0.00010970812],"domain_scores_gemma":[0.9987796,0.0008561793,0.00010019104,0.0000631232,0.00011666918,0.00008433279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012931807,0.0005088872,0.0005374198,0.0009832071,0.0008286965,0.0014796512,0.0011935516,0.00091526186,0.0037758278],"category_scores_gemma":[0.0032355755,0.00035420954,0.0008349817,0.0014440563,0.002343042,0.0038998316,0.0014511248,0.0019775538,0.00050902186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015192532,0.000011416833,0.0001594395,0.000045600056,0.000007109455,0.000051204534,0.00007512272,0.010637181,0.00024450038,0.97403413,0.002288636,0.012430497],"study_design_scores_gemma":[0.000010874912,0.000015496556,0.00012743297,0.000024857978,0.00000919811,0.00008160727,0.00003611637,0.028007464,0.00032141092,0.9614589,0.009898704,0.000007970213],"about_ca_topic_score_codex":0.002128428,"about_ca_topic_score_gemma":0.0020720442,"teacher_disagreement_score":0.0037758278,"about_ca_system_score_codex":0.0019330776,"about_ca_system_score_gemma":0.0010335536,"threshold_uncertainty_score":0.014025569},"labels":[],"label_agreement":null},{"id":"W2304936616","doi":"10.1137/16m1107899","title":"The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Seventh Framework Programme","keywords":"Matroid; Minor (academic); Combinatorics; Graphic matroid; Matroid partitioning; Mathematics; Conjecture; Prime (order theory); Constant (computer programming); Discrete mathematics; Oriented matroid; Computer science; Law; Political science","score_opus":0.03167635855695254,"score_gpt":0.28859968637436695,"score_spread":0.2569233278174144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304936616","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.4785857,0.00057314086,0.498091,0.0024589705,0.00010793088,0.00024011347,0.0006184694,0.00087211584,0.018452503],"genre_scores_gemma":[0.8557271,0.00045133333,0.13043739,0.00036131844,0.00022224779,0.0002404023,0.0009644847,0.0002527415,0.011342893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800116,0.0006094479,0.000087094195,0.00057738554,0.00037731102,0.00034761243],"domain_scores_gemma":[0.98964185,0.0064120004,0.0008203984,0.0016063086,0.00048654113,0.0010329824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018163379,0.0005922257,0.0013129395,0.000777553,0.0014380867,0.0037040224,0.0019223528,0.001159313,0.005758133],"category_scores_gemma":[0.011417828,0.00065799686,0.0011884425,0.001269084,0.0016574836,0.0051528746,0.0017585652,0.0025656961,0.00083708117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014024411,0.00091793033,0.0074760243,0.00046542846,0.00017489376,0.00028230526,0.001087853,0.11153461,0.018250536,0.71827626,0.019917814,0.12021391],"study_design_scores_gemma":[0.00019215536,0.00022705224,0.0012399835,0.000028954817,0.000059886825,0.0005431429,0.0002882094,0.594531,0.0092705535,0.37963787,0.013941182,0.00003996992],"about_ca_topic_score_codex":0.0017406159,"about_ca_topic_score_gemma":0.0015269768,"teacher_disagreement_score":0.005758133,"about_ca_system_score_codex":0.0015809805,"about_ca_system_score_gemma":0.0012949766,"threshold_uncertainty_score":0.01926291},"labels":[],"label_agreement":null},{"id":"W2403821287","doi":"10.1137/15m1024615","title":"The Number of Labeled Connected Graphs Modulo Prime Powers","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Prime power; Primitive root modulo n; Prime (order theory); Prime number; Discrete mathematics; Arithmetic","score_opus":0.033006863012301595,"score_gpt":0.3450692735730768,"score_spread":0.3120624105607752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403821287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9548792,0.0001815401,0.02358797,0.00054409576,0.00007376172,0.000023729182,0.00028639258,0.00015367342,0.020269651],"genre_scores_gemma":[0.9890576,0.000214948,0.00540802,0.00006928889,0.00006159145,0.00006777496,0.00027207963,0.000042824166,0.0048059733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964166,0.000073117546,0.000019028104,0.00010078786,0.00008959891,0.00007580715],"domain_scores_gemma":[0.9983456,0.0007881134,0.0002568977,0.0001595875,0.00018152158,0.0002682971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038337984,0.00028034244,0.00033825132,0.0013685783,0.0010715357,0.0017993965,0.0007376113,0.0006323797,0.003479725],"category_scores_gemma":[0.0028920812,0.00025493567,0.00026589798,0.0006519858,0.0018331227,0.0019495209,0.0007923329,0.0005602201,0.00029394397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023320229,0.000031062482,0.0033717738,0.00008903172,0.000021546703,0.00024797232,0.00033262014,0.0102427695,0.01257689,0.95218617,0.0022473861,0.01841942],"study_design_scores_gemma":[0.00004833089,0.000084832085,0.0032950384,0.000064847176,0.000034323806,0.0005895515,0.00027433853,0.06489647,0.012683126,0.9103049,0.007682737,0.00004141884],"about_ca_topic_score_codex":0.0004879311,"about_ca_topic_score_gemma":0.0006022792,"teacher_disagreement_score":0.003479725,"about_ca_system_score_codex":0.0009345827,"about_ca_system_score_gemma":0.00042432625,"threshold_uncertainty_score":0.011640847},"labels":[],"label_agreement":null},{"id":"W2568997022","doi":"10.1137/120885498","title":"Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Glauber; Omega; Combinatorics; Mathematics; Lambda; Vertex (graph theory); Inverse; Boundary (topology); Tree (set theory); Spectral gap; Markov chain; Discrete mathematics; Physics; Mathematical analysis; Geometry; Graph; Scattering; Quantum mechanics; Statistics","score_opus":0.04782450638894484,"score_gpt":0.37313923629183865,"score_spread":0.3253147299028938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568997022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8159477,0.0010265209,0.1627493,0.0018747278,0.00012667313,0.000088001274,0.00017964933,0.0005715487,0.017435888],"genre_scores_gemma":[0.9838463,0.0002653311,0.012977082,0.00023225436,0.000044160108,0.000117557516,0.00013699506,0.00017356951,0.0022067393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996933,0.00008341515,0.00000911184,0.000052723444,0.000052448126,0.000109126086],"domain_scores_gemma":[0.99675506,0.0018605005,0.0005277834,0.00012995399,0.00016613316,0.00056055887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086762913,0.0005693085,0.0007232781,0.0011187275,0.0012072357,0.0014672315,0.0009778716,0.0013508166,0.0043374714],"category_scores_gemma":[0.007301482,0.00037478365,0.0008550036,0.00034708166,0.002438284,0.0022924556,0.0013442783,0.002075738,0.0003848752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019570248,0.00018263722,0.0014545488,0.00014675902,0.00003728961,0.0002723086,0.0006590691,0.13743572,0.016745664,0.83663696,0.002236627,0.0039967704],"study_design_scores_gemma":[0.00006859224,0.00006265374,0.00066180964,0.00003299165,0.000013816065,0.000058633865,0.00015431018,0.7981549,0.0021872486,0.19779631,0.0007740656,0.000034674937],"about_ca_topic_score_codex":0.0028219111,"about_ca_topic_score_gemma":0.0018423954,"teacher_disagreement_score":0.0043374714,"about_ca_system_score_codex":0.0019685212,"about_ca_system_score_gemma":0.0009959068,"threshold_uncertainty_score":0.014510274},"labels":[],"label_agreement":null},{"id":"W2569664619","doi":"10.1137/15m100866x","title":"Lower Bounds on the Probability of a Finite Union of Events","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Event (particle physics); Discrete mathematics; Pairwise comparison; Finite set; Class (philosophy); Statistics; Mathematical analysis","score_opus":0.07988994126648957,"score_gpt":0.34764671378984713,"score_spread":0.26775677252335756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569664619","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.010422296,0.0030912517,0.97345835,0.0009164991,0.00016857314,0.00004700329,0.00023166608,0.00023869945,0.011425765],"genre_scores_gemma":[0.5874188,0.010061099,0.37683257,0.0015098854,0.0024690444,0.0010757272,0.0020472857,0.0008816117,0.017703913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864427,0.0042358767,0.0007492292,0.0025286437,0.0045407983,0.0015028655],"domain_scores_gemma":[0.8889581,0.096244045,0.0040913285,0.00491719,0.0042126914,0.0015765347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016525937,0.0031488666,0.0041356,0.003738067,0.0018167485,0.007638916,0.0054611573,0.0029363488,0.011991764],"category_scores_gemma":[0.083472215,0.0016157874,0.0026271048,0.004161157,0.004824103,0.014330401,0.0044394266,0.008575019,0.0019389328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033038328,0.00011899278,0.0016735212,0.0004839274,0.0002459517,0.00022124435,0.00023497069,0.44128457,0.0016222614,0.5046609,0.004026866,0.045096386],"study_design_scores_gemma":[0.000019299227,0.00006736773,0.00047232208,0.00016491872,0.00006489593,0.00018936372,0.000055040808,0.6923604,0.0013993781,0.30130255,0.0038542638,0.000050258626],"about_ca_topic_score_codex":0.0017846795,"about_ca_topic_score_gemma":0.0015180229,"teacher_disagreement_score":0.016525937,"about_ca_system_score_codex":0.0042477683,"about_ca_system_score_gemma":0.0023237197,"threshold_uncertainty_score":0.08739859},"labels":[],"label_agreement":null},{"id":"W2592462466","doi":"10.1137/17m1144805","title":"Lollipop and Lariat Symmetric Functions","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Symmetric function; Chromatic scale; Mathematics; Graph; Combinatorics; Ring of symmetric functions; Stanley symmetric function; Discrete mathematics; Pure mathematics; Orthogonal polynomials","score_opus":0.04853382306923126,"score_gpt":0.3299887152324487,"score_spread":0.28145489216321745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592462466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5331172,0.00040710866,0.26466903,0.0018914337,0.0002254409,0.00011156452,0.00071905804,0.0005261664,0.19833304],"genre_scores_gemma":[0.95067424,0.00019718365,0.026586687,0.00028526955,0.000095520256,0.000095804986,0.00029346225,0.00019909859,0.021572763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965,0.00006163329,0.0000117291565,0.00006502166,0.000092463604,0.00011924043],"domain_scores_gemma":[0.99932337,0.0002341197,0.000075260345,0.00008731319,0.00016793741,0.00011198369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057445373,0.0005972767,0.0003788984,0.0016263941,0.001192196,0.0021986899,0.0011402837,0.00067278225,0.012803429],"category_scores_gemma":[0.0020574175,0.00021612615,0.0005609385,0.0007989187,0.0024465874,0.004035407,0.001333191,0.0016574141,0.0021157658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026599717,0.000018830786,0.00042606532,0.00002778141,0.0000025240138,0.00007088564,0.00014510805,0.0012599844,0.001120292,0.98979175,0.0014604056,0.0056497],"study_design_scores_gemma":[0.0000126456,0.000020185036,0.00043192512,0.000025810261,0.000009064955,0.000107053434,0.00022561598,0.020670809,0.004724935,0.96783566,0.0059093214,0.000026921456],"about_ca_topic_score_codex":0.0017328234,"about_ca_topic_score_gemma":0.002480538,"teacher_disagreement_score":0.012803429,"about_ca_system_score_codex":0.0016185228,"about_ca_system_score_gemma":0.000708212,"threshold_uncertainty_score":0.04283178},"labels":[],"label_agreement":null},{"id":"W2600683609","doi":"10.1137/16m1057486","title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Minimum degree spanning tree; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Induced subgraph isomorphism problem; Upper and lower bounds; Spanning tree; Subgraph isomorphism problem; Connected dominating set; Discrete mathematics; Graph; Computer science; Line graph; Vertex (graph theory); Voltage graph; Artificial intelligence","score_opus":0.08980382657351924,"score_gpt":0.325023209135156,"score_spread":0.23521938256163674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600683609","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.23518977,0.0124926735,0.5110703,0.025079226,0.001222789,0.0004163855,0.0052335807,0.002490874,0.20680445],"genre_scores_gemma":[0.6235845,0.0062284265,0.33068997,0.008367185,0.0015691306,0.00097393396,0.005494136,0.0018622057,0.021230513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656516,0.0008368953,0.000106497966,0.0007573868,0.0010375322,0.00069660513],"domain_scores_gemma":[0.9876467,0.008928653,0.0007465581,0.001137957,0.00061492086,0.00092511636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053741634,0.0031459762,0.0024822294,0.0027508617,0.0021766184,0.005745469,0.0051395283,0.004099493,0.017837316],"category_scores_gemma":[0.022791483,0.0016147001,0.0022918405,0.0034009863,0.003828095,0.01108035,0.00591897,0.011512951,0.0049104593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023846251,0.0007408661,0.0026905064,0.0014918043,0.00022369435,0.00038917674,0.0008159676,0.17837992,0.014632711,0.63784766,0.06700499,0.09339814],"study_design_scores_gemma":[0.00015065554,0.00021050948,0.0011087925,0.00035564174,0.00011798077,0.00030619136,0.00021597253,0.32720944,0.0056121303,0.64424115,0.02040585,0.00006569375],"about_ca_topic_score_codex":0.0024467178,"about_ca_topic_score_gemma":0.0031760673,"teacher_disagreement_score":0.017837316,"about_ca_system_score_codex":0.0046551055,"about_ca_system_score_gemma":0.0025518383,"threshold_uncertainty_score":0.05967176},"labels":[],"label_agreement":null},{"id":"W2611857909","doi":"10.1137/16m1086819","title":"A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Knapsack problem; Mathematics; Approximation algorithm; Combinatorics; Polynomial-time approximation scheme; Scheduling (production processes); Algorithm; Time complexity; Cover (algebra); Discrete mathematics; Job shop scheduling; Schedule; Mathematical optimization; Computer science","score_opus":0.028425159824077555,"score_gpt":0.263090745202883,"score_spread":0.23466558537880544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611857909","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.012725045,0.0006878936,0.9773935,0.0006398694,0.00016210672,0.00012855952,0.00020368489,0.00075080234,0.0073085595],"genre_scores_gemma":[0.19306952,0.00048171944,0.79951775,0.00040210973,0.00014890943,0.00035348136,0.00059587753,0.00030677754,0.0051238956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989581,0.00036235675,0.000038970513,0.00019182762,0.00025450572,0.00019430644],"domain_scores_gemma":[0.99903274,0.00055825495,0.000076971584,0.000112998976,0.00012790086,0.00009114495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021682594,0.0017482142,0.0018697886,0.0008904935,0.00079631817,0.0018306256,0.0024217465,0.0015708834,0.0057437536],"category_scores_gemma":[0.0034449154,0.0008183113,0.001001742,0.0017843567,0.0007936935,0.001679275,0.0017094909,0.002919823,0.0016681404],"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.00042317534,0.00032031754,0.00056010217,0.00029264626,0.0000813638,0.000101261016,0.00010449471,0.840496,0.0014642489,0.044230938,0.009650574,0.1022749],"study_design_scores_gemma":[0.000042706626,0.000029719586,0.00003972587,0.000009977683,0.000007393022,0.000026455187,0.000014336709,0.98442876,0.00030290944,0.013883052,0.0012104972,0.000004483017],"about_ca_topic_score_codex":0.0028967396,"about_ca_topic_score_gemma":0.0030123692,"teacher_disagreement_score":0.0057437536,"about_ca_system_score_codex":0.0017428062,"about_ca_system_score_gemma":0.002158641,"threshold_uncertainty_score":0.01921475},"labels":[],"label_agreement":null},{"id":"W2761101429","doi":"10.1137/17m1160094","title":"Doubly Exponentially Many Ingleton Matroids","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Combinatorics; Mathematics; Set (abstract data type); Graphic matroid; Exponential growth; Exponential function; Matroid partitioning; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03661481439885163,"score_gpt":0.3226857304034973,"score_spread":0.2860709160046457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761101429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90090245,0.00059013604,0.06150759,0.002773899,0.00010481591,0.000035485064,0.0013154153,0.0003608501,0.032409396],"genre_scores_gemma":[0.96186495,0.0003796987,0.023208464,0.00044963384,0.00018693667,0.0001016674,0.0016766383,0.000114352115,0.012017607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852765,0.00025412667,0.000084275984,0.00039134626,0.00040596278,0.0003367142],"domain_scores_gemma":[0.9937989,0.0028148715,0.000888021,0.0012883845,0.0005597656,0.0006499705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007396759,0.00063551276,0.0008384299,0.00087675033,0.0015563596,0.0031390258,0.0016758938,0.0012433738,0.0063444595],"category_scores_gemma":[0.0066154306,0.00054432324,0.0007705402,0.0013409333,0.0014063623,0.0059295655,0.0022591883,0.0022044647,0.0006256871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070892595,0.00022199491,0.009932816,0.0002416853,0.00008677741,0.00052841956,0.00068416103,0.013370794,0.011349583,0.9077906,0.010090346,0.044993863],"study_design_scores_gemma":[0.0000576734,0.000071061775,0.00379892,0.0000424237,0.000071586954,0.0011096185,0.0003073815,0.06585151,0.005958513,0.90867925,0.014013368,0.000038652903],"about_ca_topic_score_codex":0.0006325805,"about_ca_topic_score_gemma":0.0009372302,"teacher_disagreement_score":0.0063444595,"about_ca_system_score_codex":0.0015927235,"about_ca_system_score_gemma":0.00047705285,"threshold_uncertainty_score":0.02122438},"labels":[],"label_agreement":null},{"id":"W2797568317","doi":"10.1137/18m1182255","title":"On a Generalization of Spikes","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; National Science Foundation","keywords":"Matroid; Partition (number theory); Generalization; Matroid partitioning; Graphic matroid; Integer (computer science); Property (philosophy)","score_opus":0.018602800630308204,"score_gpt":0.30100844786668834,"score_spread":0.2824056472363801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797568317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43705976,0.0013405419,0.4198401,0.0052554104,0.0006125087,0.00018320266,0.0011150512,0.00093242014,0.13366102],"genre_scores_gemma":[0.90181255,0.00088080904,0.06852122,0.0016098338,0.00064193585,0.00017475005,0.000795057,0.00035811783,0.025205709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998953,0.0001610583,0.00005417276,0.00033809707,0.00028040595,0.00021325507],"domain_scores_gemma":[0.9973809,0.0008047821,0.0003441615,0.00069572806,0.00034860242,0.00042569096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709951,0.00053933647,0.00080090744,0.0008646247,0.0018718517,0.0025605042,0.001585541,0.0013572864,0.008792073],"category_scores_gemma":[0.004345137,0.0003537666,0.0016877578,0.0016493944,0.0023512433,0.005823023,0.0035518073,0.0024704717,0.0008978675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007169755,0.000030498988,0.0007308255,0.00005698336,0.000018142386,0.00021903781,0.00021329822,0.010019316,0.0030240684,0.97117597,0.0034098746,0.01103026],"study_design_scores_gemma":[0.000024247329,0.0000643886,0.0005489696,0.000021532236,0.000017099905,0.00041790618,0.0002260204,0.045711394,0.0018002288,0.93351066,0.017637976,0.000019534607],"about_ca_topic_score_codex":0.002350975,"about_ca_topic_score_gemma":0.002149382,"teacher_disagreement_score":0.008792073,"about_ca_system_score_codex":0.0016239253,"about_ca_system_score_gemma":0.0006898637,"threshold_uncertainty_score":0.029412389},"labels":[],"label_agreement":null},{"id":"W2886010892","doi":"10.1137/20m1356968","title":"When Do Gomory--Hu Subtrees Exist?","year":2022,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Mathematics","score_opus":0.04253123021233643,"score_gpt":0.29356755749711866,"score_spread":0.2510363272847822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886010892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.776328,0.0020515004,0.14314297,0.0051364233,0.00029234003,0.00022511228,0.0024174287,0.0010212762,0.06938487],"genre_scores_gemma":[0.9488608,0.0004090949,0.04036804,0.00077430275,0.000084179104,0.00008510294,0.0017955188,0.00027073402,0.007352267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993636,0.00006777306,0.000027796506,0.00019515002,0.00008216142,0.00026357934],"domain_scores_gemma":[0.99791056,0.00078577147,0.00033741683,0.00035938976,0.00021313292,0.0003936516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060931104,0.0003525077,0.0008957044,0.0005963169,0.001594032,0.00197986,0.00090405595,0.001568734,0.010782294],"category_scores_gemma":[0.006962602,0.00049528026,0.0005838906,0.00088922516,0.0012522867,0.005595781,0.0015128339,0.0013488701,0.0017930126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065639697,0.0001759734,0.017048962,0.000343703,0.00006612162,0.0018727904,0.002023977,0.0068934457,0.009596687,0.81543493,0.020290717,0.1255963],"study_design_scores_gemma":[0.00010894964,0.0001758069,0.0090661375,0.00021514238,0.00009211258,0.0028048088,0.0041637807,0.029341362,0.007795706,0.86899376,0.07717389,0.000068540314],"about_ca_topic_score_codex":0.0011357653,"about_ca_topic_score_gemma":0.0024088249,"teacher_disagreement_score":0.010782294,"about_ca_system_score_codex":0.0008619419,"about_ca_system_score_gemma":0.0005386457,"threshold_uncertainty_score":0.036070406},"labels":[],"label_agreement":null},{"id":"W2896348413","doi":"10.1137/18m1220856","title":"Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior","year":2019,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lattice (music); Diagonal; Gravitational singularity; Combinatorics; Generating function; Enumeration; Boundary (topology); Function (biology); Rational function; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Physics","score_opus":0.04752788008209991,"score_gpt":0.3384440532801255,"score_spread":0.2909161731980256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896348413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8021941,0.0016012408,0.14653015,0.0018992774,0.00010802061,0.000041024527,0.0002933166,0.00035097988,0.046981853],"genre_scores_gemma":[0.97887224,0.0005833104,0.015260107,0.00014440366,0.00011440212,0.00005479973,0.00025182744,0.00006125543,0.0046577617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939156,0.00020553873,0.000024627827,0.00008475579,0.00016056832,0.0001328443],"domain_scores_gemma":[0.9970272,0.0013832671,0.00047663038,0.00031010492,0.00033985474,0.00046296138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088668603,0.00059546944,0.00065291487,0.003266007,0.0013173141,0.0030021013,0.0013833387,0.0013124257,0.0038562352],"category_scores_gemma":[0.0066909175,0.00031723618,0.0006598812,0.001961205,0.0028637524,0.0043261955,0.0014816272,0.0016149728,0.0004215592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023651388,0.00004417894,0.001172475,0.00003705796,0.0000057831076,0.00011399479,0.0001786623,0.0079443455,0.0008434413,0.9854822,0.00048541834,0.0036688047],"study_design_scores_gemma":[0.000009858463,0.000017133083,0.0005190816,0.000024516206,0.0000048822576,0.00017317668,0.00013142137,0.09911289,0.00045738032,0.89826965,0.0012611952,0.000018793695],"about_ca_topic_score_codex":0.0016184049,"about_ca_topic_score_gemma":0.0016237065,"teacher_disagreement_score":0.0038562352,"about_ca_system_score_codex":0.0016566726,"about_ca_system_score_gemma":0.0004545405,"threshold_uncertainty_score":0.012900412},"labels":[],"label_agreement":null},{"id":"W2903461617","doi":"10.1137/18m1229420","title":"Counterexamples to a Conjecture of Harris on Hall Ratio","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; National Security Agency; Centre de Recherches Mathématiques; Simons Foundation; National Science Foundation","keywords":"Counterexample; Conjecture; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.038242836403475665,"score_gpt":0.31036114916230245,"score_spread":0.2721183127588268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903461617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62183684,0.0029278481,0.1464112,0.057871062,0.0013035097,0.00009284951,0.0009610776,0.0022314985,0.16636416],"genre_scores_gemma":[0.97332126,0.00070464326,0.015051525,0.002981015,0.00071599986,0.00007946105,0.00022077127,0.00025186775,0.0066734203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977933,0.0005650727,0.00007333517,0.0006216677,0.00048731916,0.00045924948],"domain_scores_gemma":[0.97720325,0.017266393,0.0009815616,0.002907554,0.00087122084,0.00076998264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028229174,0.0005156664,0.0010288307,0.0014977013,0.0022860505,0.0022163116,0.0018170903,0.0024135604,0.010171376],"category_scores_gemma":[0.020757845,0.00055074575,0.0009551625,0.0017657132,0.0071566096,0.008096468,0.004130489,0.0040661194,0.00081300706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020247443,0.000028394059,0.00097249285,0.00007809599,0.000010326752,0.00018994899,0.0003724645,0.0031819087,0.0013963643,0.9750641,0.011613798,0.00688972],"study_design_scores_gemma":[0.00006825114,0.000031936146,0.000723248,0.000025363466,0.000012975757,0.00031041683,0.00021660113,0.013022923,0.0017498215,0.9740242,0.009787561,0.000026872987],"about_ca_topic_score_codex":0.0016318782,"about_ca_topic_score_gemma":0.0010571283,"teacher_disagreement_score":0.010171376,"about_ca_system_score_codex":0.0020211653,"about_ca_system_score_gemma":0.0005501877,"threshold_uncertainty_score":0.034026682},"labels":[],"label_agreement":null},{"id":"W2903896173","doi":"10.1137/18m1214196","title":"Corrigendum: Orthogonal Tree Decompositions of Graphs","year":2018,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","score_opus":0.03365558894771017,"score_gpt":0.31765133029219844,"score_spread":0.2839957413444883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903896173","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042523685,0.004531445,0.005383927,0.052527487,0.91416854,0.000062821666,0.0016046404,0.0010371325,0.020258732],"genre_scores_gemma":[0.03156897,0.024308173,0.018116983,0.09218615,0.44808772,0.0004505258,0.008224246,0.0047143446,0.37234288],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99361116,0.0010640931,0.0006644373,0.0011032001,0.00308011,0.00047695008],"domain_scores_gemma":[0.9751389,0.0047507607,0.0006525226,0.0023301386,0.016090766,0.0010369685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031882157,0.0021310435,0.002120636,0.0050469395,0.003015454,0.0039745606,0.0035164356,0.0030821064,0.08969412],"category_scores_gemma":[0.046201363,0.0010107793,0.00219319,0.0039050828,0.0021413236,0.0049850834,0.002493897,0.0059016678,0.043846525],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002148445,0.00001047425,0.000050903014,0.00011262276,0.000011630439,0.00008112099,0.000016338663,0.000102940045,0.000053469517,0.003210191,0.9862954,0.010033422],"study_design_scores_gemma":[0.00003300052,0.000042494426,0.0009578126,0.0003148867,0.000047979953,0.00041742416,0.000051218434,0.0008414017,0.000485347,0.013641105,0.9830973,0.00007007243],"about_ca_topic_score_codex":0.011528139,"about_ca_topic_score_gemma":0.013031973,"teacher_disagreement_score":0.08969412,"about_ca_system_score_codex":0.005423889,"about_ca_system_score_gemma":0.0029251599,"threshold_uncertainty_score":0.3000567},"labels":[],"label_agreement":null},{"id":"W2963663369","doi":"10.1137/16m108080x","title":"Planar Digraphs of Digirth Four are 2-Colorable","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Mathematics; Conjecture; Monochromatic color; Planar; Planar graph; Colored; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.04470984151357586,"score_gpt":0.31633142321947133,"score_spread":0.27162158170589545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963663369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7567475,0.0012653357,0.12310495,0.0042152647,0.00038536236,0.00037322476,0.004236457,0.0015225444,0.10814932],"genre_scores_gemma":[0.944126,0.00091670756,0.032827843,0.0012421086,0.000101105674,0.00019541782,0.0033210625,0.000120498764,0.017149251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992884,0.000104521554,0.00004659654,0.0002428547,0.00010656974,0.00021112866],"domain_scores_gemma":[0.995693,0.002578196,0.00045144613,0.0004944944,0.00043157497,0.0003512977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040503033,0.0007787384,0.0008192588,0.00077127304,0.0018145355,0.0023963465,0.0011045934,0.00095546007,0.009400611],"category_scores_gemma":[0.0036466937,0.0009454033,0.0011889905,0.0010333281,0.0020089764,0.0029637008,0.0017781791,0.0022602375,0.0012421221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016452314,0.0003421279,0.00951616,0.0015142915,0.0002601789,0.001337748,0.0019244191,0.0393121,0.0316871,0.80537444,0.02375762,0.0833285],"study_design_scores_gemma":[0.00028929036,0.0001981383,0.0042994525,0.00013984287,0.00024934037,0.0011096108,0.0010245545,0.026327156,0.018537898,0.8946941,0.052992262,0.0001383136],"about_ca_topic_score_codex":0.0039143628,"about_ca_topic_score_gemma":0.00618617,"teacher_disagreement_score":0.009400611,"about_ca_system_score_codex":0.0017928503,"about_ca_system_score_gemma":0.0009558771,"threshold_uncertainty_score":0.031448185},"labels":[],"label_agreement":null},{"id":"W2964048937","doi":"10.1137/18m1174544","title":"An Optimization Parameter for Seriation of Noisy Data","year":2019,"lang":"kn","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Delaware Research Foundation","keywords":"Mathematics; Similarity (geometry); Matrix (chemical analysis); Identity matrix; Combinatorics; Diagonal; Square matrix; Matrix similarity; Matrix norm; Row; Row and column spaces; Seriation (archaeology); Symmetric matrix; Artificial intelligence; Computer science; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.05583733570121908,"score_gpt":0.34953243548031243,"score_spread":0.29369509977909336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964048937","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.019119656,0.00041313327,0.9769721,0.00077998365,0.00011602536,0.000099210534,0.00023092385,0.00095809065,0.0013107992],"genre_scores_gemma":[0.44511637,0.00053003203,0.5474606,0.0007369476,0.00032769877,0.00040574252,0.0010520689,0.0008115822,0.0035588995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940304,0.002519109,0.0005375665,0.0013623001,0.001242798,0.00030770266],"domain_scores_gemma":[0.96434724,0.02326679,0.0030799436,0.0057150717,0.0025774147,0.0010134719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009781443,0.001627938,0.0019581395,0.0014639273,0.0007381071,0.0027237232,0.0026828924,0.0028426407,0.0032158361],"category_scores_gemma":[0.08251316,0.00082599313,0.0009240527,0.0015570542,0.003149054,0.0061009293,0.0032470715,0.0033994236,0.0015160599],"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.00076690596,0.0001721682,0.0041526807,0.0004405552,0.0001791489,0.00022561567,0.0003379067,0.7445567,0.012329045,0.0618024,0.009427376,0.16560952],"study_design_scores_gemma":[0.00003180094,0.00014740071,0.0005650916,0.000053424374,0.000018422657,0.00016691687,0.00008275192,0.95808446,0.0047783284,0.0341057,0.0019267638,0.00003900865],"about_ca_topic_score_codex":0.0012713476,"about_ca_topic_score_gemma":0.0011936016,"teacher_disagreement_score":0.009781443,"about_ca_system_score_codex":0.0022131305,"about_ca_system_score_gemma":0.0019071157,"threshold_uncertainty_score":0.0517298},"labels":[],"label_agreement":null},{"id":"W2971004196","doi":"10.1137/19m1284610","title":"On the Minimum Degree Required for a Triangle Decomposition","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Graph; Decomposition; Order (exchange); Discrete mathematics; Physics; Chemistry","score_opus":0.12089391020838085,"score_gpt":0.3605353410943551,"score_spread":0.23964143088597423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971004196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65728754,0.002089081,0.24686624,0.0065239854,0.00059593114,0.00009376623,0.0014147528,0.00054030184,0.08458837],"genre_scores_gemma":[0.9365656,0.0011004619,0.053889528,0.0010201479,0.00023335767,0.00012279025,0.00082883274,0.000395312,0.005844113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866223,0.00029645165,0.000051092447,0.000334994,0.00027248485,0.00038269488],"domain_scores_gemma":[0.98766196,0.007963576,0.0009018085,0.0014221943,0.00079920643,0.0012512791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015465638,0.0006926681,0.000990834,0.0008984031,0.0013365842,0.0017500002,0.0013590474,0.001346272,0.009392457],"category_scores_gemma":[0.016239556,0.0006788384,0.0010764289,0.0007388516,0.0022266433,0.0038844694,0.0022766546,0.0027663696,0.0014528123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012848579,0.00020607663,0.009119035,0.00074861804,0.000096485455,0.00074348395,0.0011506758,0.06261375,0.060481496,0.796721,0.023291592,0.04354298],"study_design_scores_gemma":[0.00015794947,0.0002703149,0.0044501973,0.00017669571,0.00007977573,0.0013072268,0.000664304,0.17401133,0.0169669,0.7858239,0.016018031,0.000073269875],"about_ca_topic_score_codex":0.001921162,"about_ca_topic_score_gemma":0.0024761928,"teacher_disagreement_score":0.009392457,"about_ca_system_score_codex":0.0012566318,"about_ca_system_score_gemma":0.00073272263,"threshold_uncertainty_score":0.031420946},"labels":[],"label_agreement":null},{"id":"W3001604198","doi":"10.1137/20m1320730","title":"Counting Linear Extensions of Posets with Determinants of Hook Lengths","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Max Planck Research School for Advanced Methods in Process and Systems Engineering; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Mathematics; Combinatorics; Skew; Hook; Ribbon; Star product; Descent (aeronautics); Class (philosophy); Discrete mathematics; Geometry; Computer science; Physics","score_opus":0.04490005041821215,"score_gpt":0.3455230302338493,"score_spread":0.3006229798156371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001604198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8180329,0.0005131279,0.15738076,0.0003648544,0.00007556322,0.00006411848,0.00044844145,0.00022358389,0.0228965],"genre_scores_gemma":[0.9731365,0.00030392577,0.021420846,0.000073798554,0.00012966967,0.000096301505,0.00042941922,0.00005362532,0.00435592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999025,0.0001716645,0.000073447554,0.00026971404,0.00027324544,0.00018694632],"domain_scores_gemma":[0.9958038,0.0020574983,0.00074128376,0.00033999802,0.0004515007,0.0006059878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008627052,0.00061381754,0.000653923,0.0024527959,0.0010033596,0.0023658369,0.0008424818,0.0006606697,0.0045552985],"category_scores_gemma":[0.0059263874,0.00038629462,0.00064529275,0.0019262037,0.002178925,0.00571923,0.001991592,0.0009611735,0.00045773812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014677297,0.00007723366,0.010927123,0.000096926684,0.00002258205,0.00038832356,0.00066259067,0.0075883423,0.0076225065,0.93956584,0.0015152734,0.03138643],"study_design_scores_gemma":[0.000025713347,0.00011093033,0.005156199,0.00004855592,0.000032779033,0.0011757585,0.0003907508,0.04026353,0.005880814,0.9403455,0.0065054563,0.0000639218],"about_ca_topic_score_codex":0.00032651826,"about_ca_topic_score_gemma":0.00045564544,"teacher_disagreement_score":0.0045552985,"about_ca_system_score_codex":0.00073806586,"about_ca_system_score_gemma":0.00039233398,"threshold_uncertainty_score":0.015238941},"labels":[],"label_agreement":null},{"id":"W3014010934","doi":"10.1137/18m1224672","title":"Multitasking Capacity: Hardness Results and Improved Constructions","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"United States - Israel Binational Science Foundation; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Matching (statistics); Cardinality (data modeling); Upper and lower bounds; Discrete mathematics; Hardness of approximation; Complete bipartite graph; Approximation algorithm; Graph; Computer science","score_opus":0.04865152016433313,"score_gpt":0.2558573971456671,"score_spread":0.20720587698133394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014010934","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.17731611,0.002256964,0.748521,0.009263922,0.0003642682,0.00044045653,0.0031412828,0.0019009177,0.05679506],"genre_scores_gemma":[0.8714195,0.0014150246,0.11149334,0.0012217618,0.00072222156,0.000807667,0.0017038903,0.0007522732,0.01046435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994055,0.0015990533,0.00025468826,0.0014236177,0.001550793,0.0011168664],"domain_scores_gemma":[0.9691738,0.022272794,0.0015276736,0.004344974,0.0009342874,0.001746471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036574355,0.0020429583,0.0025036645,0.0020563623,0.0020018655,0.0053765294,0.0059338165,0.0031404556,0.011073173],"category_scores_gemma":[0.028038355,0.0013248597,0.0032280628,0.003687774,0.0036283627,0.012379411,0.007072865,0.0065639256,0.0017920989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010951672,0.0005563253,0.0028026106,0.0010664617,0.00023843044,0.00053403876,0.00095464947,0.3207535,0.006771373,0.5893121,0.020597948,0.055317413],"study_design_scores_gemma":[0.00010380222,0.00008800107,0.00051091705,0.000071915405,0.00007322821,0.0002603959,0.00015149641,0.46792573,0.0025132021,0.52275044,0.005495703,0.00005516344],"about_ca_topic_score_codex":0.002568723,"about_ca_topic_score_gemma":0.0015859832,"teacher_disagreement_score":0.011073173,"about_ca_system_score_codex":0.0035948902,"about_ca_system_score_gemma":0.0022260319,"threshold_uncertainty_score":0.037043452},"labels":[],"label_agreement":null},{"id":"W3014978470","doi":"10.1137/20m1370744","title":"Dense Induced Subgraphs of Dense Bipartite Graphs","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Conjecture; Combinatorics; Mathematics; Degree (music); Graph; Induced subgraph; Girth (graph theory); Discrete mathematics; Vertex (graph theory); Physics","score_opus":0.051065535098823674,"score_gpt":0.3211682898076904,"score_spread":0.27010275470886674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014978470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8101275,0.0003420035,0.16364633,0.0006481476,0.000039315248,0.000065333385,0.0007644157,0.00045583252,0.023911178],"genre_scores_gemma":[0.9766133,0.00026407838,0.018970234,0.00014594298,0.000042698524,0.00007020581,0.00077750825,0.00006108213,0.0030549285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995647,0.0001079941,0.000017842485,0.00009642503,0.00011044488,0.000102576094],"domain_scores_gemma":[0.9968592,0.0016470251,0.00043206706,0.0004239332,0.00030402438,0.0003337275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003778185,0.000339759,0.00032519578,0.0007399773,0.0005678323,0.0007357898,0.0007363264,0.00039785696,0.0028362763],"category_scores_gemma":[0.003248544,0.00046790217,0.0004005798,0.0007865004,0.0008793175,0.0014781175,0.0014003736,0.0009273775,0.00035807342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002450974,0.00018647114,0.008590824,0.0003320214,0.000072152034,0.0009414003,0.0009144095,0.03369879,0.03246741,0.87876177,0.008236674,0.03555289],"study_design_scores_gemma":[0.000064834174,0.00008412246,0.004613093,0.00004371643,0.000049913117,0.0007678039,0.00028316662,0.18284789,0.011391407,0.79158515,0.008250059,0.0000189261],"about_ca_topic_score_codex":0.0011160887,"about_ca_topic_score_gemma":0.0019116992,"teacher_disagreement_score":0.0028362763,"about_ca_system_score_codex":0.0006767897,"about_ca_system_score_gemma":0.00032096496,"threshold_uncertainty_score":0.009488344},"labels":[],"label_agreement":null},{"id":"W3021331763","doi":"10.1137/20m1343099","title":"The Structure of $I_4$-Free and Triangle-Free Binary Matroids","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Ontario Research Foundation","keywords":"Matroid; Mathematics; Combinatorics; Graphic matroid; Rank (graph theory); Simple (philosophy); Binary number; Discrete mathematics","score_opus":0.015763332282154097,"score_gpt":0.27661869244182685,"score_spread":0.26085536015967276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021331763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9151294,0.00042521744,0.049682718,0.0005426025,0.00004444439,0.000047538302,0.000956616,0.00018074462,0.03299076],"genre_scores_gemma":[0.9737342,0.0002079194,0.01541306,0.00011983737,0.00007028219,0.000060129998,0.0012528386,0.00005410928,0.009087688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995596,0.000044784734,0.000029115477,0.0001053001,0.00014233345,0.00011887031],"domain_scores_gemma":[0.9988072,0.0002330318,0.00032389845,0.00013822711,0.00019559907,0.00030200992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024675482,0.00033970978,0.00038090226,0.0017659612,0.0010262913,0.002128344,0.0008793017,0.0005403808,0.005976244],"category_scores_gemma":[0.0011477759,0.0005433907,0.0004106009,0.001131718,0.0011993565,0.0021459737,0.0011555667,0.00086865865,0.00067470473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027558694,0.00009743974,0.0051280535,0.0001993175,0.000030275054,0.00044645873,0.0011568172,0.007106959,0.02153214,0.93108195,0.0040314705,0.028913565],"study_design_scores_gemma":[0.0000930054,0.00013131971,0.011081809,0.00007436899,0.000057124154,0.0017039538,0.0008478428,0.04084396,0.015889142,0.9107181,0.018487679,0.000071633134],"about_ca_topic_score_codex":0.0012730635,"about_ca_topic_score_gemma":0.0010891587,"teacher_disagreement_score":0.005976244,"about_ca_system_score_codex":0.00091346493,"about_ca_system_score_gemma":0.00027984363,"threshold_uncertainty_score":0.01999247},"labels":[],"label_agreement":null},{"id":"W3026391377","doi":"10.1137/20m1367672","title":"The Uniformity Conjecture in Additive Combinatorics","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund; Natural Sciences and Engineering Research Council of Canada; Ministry of Education and Science of the Russian Federation","keywords":"Conjecture; Cardinality (data modeling); Combinatorics; Mathematics; Product (mathematics); Discrete mathematics; Computer science","score_opus":0.024872177754264934,"score_gpt":0.3041367521464307,"score_spread":0.2792645743921658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026391377","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.3621414,0.005751598,0.4771728,0.011198456,0.0008215901,0.00008802911,0.0007420997,0.0013216231,0.14076237],"genre_scores_gemma":[0.9515263,0.0018661886,0.030566035,0.0010463998,0.0010653376,0.000114888535,0.00045404426,0.00017593434,0.013185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968637,0.0008367948,0.0001914249,0.0008110115,0.00088447484,0.00041253876],"domain_scores_gemma":[0.9920108,0.005343858,0.00036660244,0.001411685,0.0005552507,0.00031189361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026374161,0.00062032446,0.0009925308,0.0012562554,0.0020746635,0.003024105,0.0016905683,0.00140713,0.0059226216],"category_scores_gemma":[0.013012551,0.00056384515,0.0009316964,0.002018235,0.0042033494,0.011878666,0.004515707,0.0026263052,0.0010214346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010145889,0.000023306522,0.0011796503,0.00010078759,0.000011498262,0.00014055884,0.00025058593,0.002376788,0.00082650786,0.9780164,0.002197132,0.0147753805],"study_design_scores_gemma":[0.000019741028,0.000034172408,0.0007254171,0.0000524245,0.000023263965,0.00036181568,0.00014145777,0.009071075,0.002580725,0.97317886,0.013789933,0.000020981453],"about_ca_topic_score_codex":0.00087361736,"about_ca_topic_score_gemma":0.0005521023,"teacher_disagreement_score":0.0059226216,"about_ca_system_score_codex":0.0011087032,"about_ca_system_score_gemma":0.00046196242,"threshold_uncertainty_score":0.01981312},"labels":[],"label_agreement":null},{"id":"W3091567360","doi":"10.1137/20m1380314","title":"A Complete Multipartite Basis for the Chromatic Symmetric Function","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Symmetric function; Combinatorics; Mathematics; Multipartite; Chromatic scale; Basis (linear algebra); Monomial; Stanley symmetric function; Lambda; Disjoint sets; Discrete mathematics; Ring of symmetric functions; Graph; Physics","score_opus":0.08086964179098748,"score_gpt":0.3354876833294389,"score_spread":0.2546180415384514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091567360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5239374,0.00065921753,0.3551331,0.0008055247,0.00026434328,0.00008784614,0.0007228187,0.00025647148,0.11813331],"genre_scores_gemma":[0.9284879,0.0004947316,0.041860513,0.00022718326,0.0001872396,0.00011979128,0.00060595205,0.00020488762,0.027811639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968135,0.000067615496,0.000008288497,0.00005034494,0.000103138984,0.00008928779],"domain_scores_gemma":[0.9996463,0.00007559193,0.000028933953,0.00007275348,0.00011465186,0.000061756095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042721358,0.00047564664,0.0004160917,0.0015819216,0.0009856551,0.0016651114,0.0007279807,0.0005394619,0.005565215],"category_scores_gemma":[0.0009730365,0.00023538008,0.0005476145,0.0010170601,0.0016332982,0.0015469607,0.00088698184,0.0014703268,0.0015281505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013222022,0.0000109917155,0.00009271444,0.000010717511,0.0000017799703,0.000020264035,0.000053204065,0.0016343743,0.0018939484,0.9908607,0.0008341344,0.0045739124],"study_design_scores_gemma":[0.000013312027,0.000031315336,0.0004982032,0.00002643956,0.00000769391,0.000111460344,0.00011752714,0.05961026,0.0039005459,0.92652285,0.009126682,0.000033629214],"about_ca_topic_score_codex":0.0016490254,"about_ca_topic_score_gemma":0.0016075025,"teacher_disagreement_score":0.005565215,"about_ca_system_score_codex":0.00091958564,"about_ca_system_score_gemma":0.00080449786,"threshold_uncertainty_score":0.01861751},"labels":[],"label_agreement":null},{"id":"W3176383582","doi":"10.1137/21m1450082","title":"A Spectral Moore Bound for Bipartite Semiregular Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.050809379309891226,"score_gpt":0.33745628495734264,"score_spread":0.28664690564745143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176383582","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.20315963,0.002015442,0.7025218,0.0024578914,0.0002702872,0.0000785072,0.0012817734,0.0016630003,0.086551666],"genre_scores_gemma":[0.88715506,0.0012345555,0.096244074,0.0011531316,0.00038697076,0.00022249598,0.0007950543,0.00044451887,0.012364189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985353,0.0002996804,0.00006868062,0.00036907397,0.00046676907,0.00026052207],"domain_scores_gemma":[0.9921697,0.004548437,0.00063744275,0.0010512616,0.0008246251,0.00076862844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013295277,0.0008487287,0.00094115094,0.0019992134,0.001141744,0.0019893404,0.0019616382,0.0011604853,0.013658057],"category_scores_gemma":[0.008520398,0.00055481616,0.000745804,0.0017096993,0.0020394789,0.0048334496,0.0025274807,0.001988889,0.002688259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003002295,0.00010694125,0.0012277114,0.00021989697,0.00004083352,0.0001458227,0.00026957298,0.037291925,0.011232267,0.9118386,0.008170798,0.029155303],"study_design_scores_gemma":[0.0000212851,0.000069410286,0.00087550783,0.000063802916,0.000023109384,0.00019375066,0.00013093305,0.1862023,0.005813592,0.7988391,0.0077161393,0.00005093706],"about_ca_topic_score_codex":0.00106099,"about_ca_topic_score_gemma":0.0017010237,"teacher_disagreement_score":0.013658057,"about_ca_system_score_codex":0.0016284339,"about_ca_system_score_gemma":0.00058680674,"threshold_uncertainty_score":0.045690715},"labels":[],"label_agreement":null},{"id":"W3193900015","doi":"10.1137/22m1511801","title":"The Typical Approximate Structure of Sets with Bounded Sumset","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Social Fund; Agencia Estatal de Investigación; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministerio de Economía y Competitividad; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Abelian group; Hypergraph; Combinatorics; Bounded function; Discrete mathematics; Structured program theorem","score_opus":0.02510234087633091,"score_gpt":0.3033898950029553,"score_spread":0.2782875541266244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193900015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8666999,0.00032157652,0.12494091,0.0006108762,0.000025903155,0.000032286163,0.0005048113,0.00027933018,0.0065844236],"genre_scores_gemma":[0.98221093,0.00013347724,0.015117982,0.0000805435,0.00003455303,0.00007840073,0.00037976092,0.000049011225,0.0019153085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985745,0.000329879,0.00008791535,0.00034981788,0.0004780516,0.00017974542],"domain_scores_gemma":[0.9915953,0.0044273497,0.0012120074,0.0014764703,0.000720261,0.0005686104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385121,0.000307854,0.0009771693,0.0015637521,0.0013332436,0.0033205824,0.0015827593,0.00089716155,0.003636142],"category_scores_gemma":[0.015280259,0.00059082895,0.0005524028,0.0016186198,0.002557537,0.0052622026,0.0025613059,0.0010839248,0.0003445297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005855551,0.000067159606,0.008563541,0.00016140325,0.000052387426,0.00039711615,0.00081746257,0.032738734,0.009053135,0.9305358,0.0015439354,0.015483783],"study_design_scores_gemma":[0.00006128679,0.00014556451,0.0035402754,0.00006441245,0.000058512676,0.0010235977,0.0005207,0.23385207,0.009548999,0.7471065,0.0040109213,0.000067240755],"about_ca_topic_score_codex":0.0006459801,"about_ca_topic_score_gemma":0.00056920655,"teacher_disagreement_score":0.003636142,"about_ca_system_score_codex":0.0015435508,"about_ca_system_score_gemma":0.00064734765,"threshold_uncertainty_score":0.012164116},"labels":[],"label_agreement":null},{"id":"W3195869111","doi":"10.1137/19m1296069","title":"Hamiltonicity of Random Graphs in the Stochastic Block Model","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Partition (number theory); Graph; Stochastic block model; Statistics","score_opus":0.041733432782126996,"score_gpt":0.31380075152884246,"score_spread":0.27206731874671547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195869111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5329057,0.00096976326,0.4461624,0.0026264878,0.000096393625,0.00017898154,0.0007929695,0.00040927946,0.01585815],"genre_scores_gemma":[0.97589684,0.00066435686,0.014072962,0.00028511055,0.000084319676,0.00018520394,0.0003421416,0.00010610678,0.008363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991767,0.0003511782,0.000023640447,0.00014994881,0.00011151212,0.00018715185],"domain_scores_gemma":[0.9943638,0.0035751543,0.00088634685,0.0003304846,0.00030827237,0.0005359293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014759656,0.0007256403,0.0012305721,0.0010788018,0.0006999059,0.0012349872,0.0018902231,0.001296823,0.0045701293],"category_scores_gemma":[0.0066610677,0.00065424317,0.00077549106,0.0007484982,0.0018258552,0.0025902893,0.001225316,0.0014777825,0.0005116725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019627035,0.00007570715,0.0014972222,0.00010528916,0.00007271172,0.00040231427,0.00027636476,0.17023596,0.0040626517,0.81608754,0.0038166696,0.003171314],"study_design_scores_gemma":[0.000061344756,0.00004588166,0.00045800363,0.000014836375,0.000022092014,0.00005480951,0.000053224616,0.7327221,0.00044867842,0.26521176,0.0008811521,0.000026046646],"about_ca_topic_score_codex":0.007846433,"about_ca_topic_score_gemma":0.0077558197,"teacher_disagreement_score":0.007846433,"about_ca_system_score_codex":0.001701065,"about_ca_system_score_gemma":0.0010654735,"threshold_uncertainty_score":0.015601575},"labels":[],"label_agreement":null},{"id":"W3198462604","doi":"10.1137/21m1443352","title":"Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Induced subgraph; Discrete mathematics; Complete coloring; Integer (computer science); Graph; Time complexity; Fractional coloring; List coloring; Graph power; Computer science; Line graph","score_opus":0.0753537972018547,"score_gpt":0.32949796142603377,"score_spread":0.25414416422417907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198462604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53068167,0.004342934,0.30534664,0.043803472,0.0009258288,0.00072780205,0.015459364,0.004618332,0.09409397],"genre_scores_gemma":[0.8688168,0.0019452758,0.097296104,0.004924869,0.0012296604,0.0008783579,0.009674263,0.0006937576,0.014540847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546295,0.0011183555,0.00018365149,0.0011419749,0.0008642757,0.0012287571],"domain_scores_gemma":[0.98030543,0.015397942,0.0009733158,0.0017489035,0.00061764935,0.0009567927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026463468,0.0015729571,0.0021844048,0.0010459098,0.0023173387,0.0074378783,0.003502162,0.0030372792,0.013928664],"category_scores_gemma":[0.010324654,0.00091288367,0.002926682,0.0015617211,0.0022526262,0.0099476455,0.003341803,0.0063684206,0.0019316081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032025087,0.0015360625,0.005498138,0.0021832779,0.0004928336,0.0006569734,0.0012705413,0.1718951,0.014918004,0.6102425,0.11034348,0.0777607],"study_design_scores_gemma":[0.00044891273,0.00015630298,0.0015269031,0.00011532459,0.00015744432,0.00030123632,0.0002635418,0.38100678,0.002768895,0.60511667,0.008060369,0.00007765842],"about_ca_topic_score_codex":0.0036265962,"about_ca_topic_score_gemma":0.0038818002,"teacher_disagreement_score":0.013928664,"about_ca_system_score_codex":0.0064331717,"about_ca_system_score_gemma":0.004758527,"threshold_uncertainty_score":0.04667616},"labels":[],"label_agreement":null},{"id":"W3212859878","doi":"10.1137/23m1558513","title":"Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University; University of Winnipeg","funders":"","keywords":"Abelian group; Word (group theory); Binary number; Construct (python library); Mathematics; Binary operation; Omega; Exponent; Discrete mathematics; Combinatorics; Pure mathematics; Arithmetic; Computer science; Physics; Linguistics; Quantum mechanics; Geometry","score_opus":0.01647246899495382,"score_gpt":0.2752870181134576,"score_spread":0.2588145491185038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212859878","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.37290055,0.0004142501,0.5501102,0.0006734475,0.0005448506,0.00013577029,0.00019843335,0.0008340162,0.07418852],"genre_scores_gemma":[0.7231748,0.0004367499,0.24540858,0.00027321494,0.00013076756,0.00019851954,0.00024878947,0.00048509554,0.029643476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973136,0.000035593926,0.000030857107,0.000065524335,0.00007573685,0.00006093495],"domain_scores_gemma":[0.9994386,0.00019895284,0.00005408024,0.00011269043,0.0001331212,0.00006257739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028485886,0.00047798577,0.00043098436,0.0008143077,0.0010378314,0.0009833159,0.0005265559,0.00051001017,0.005010106],"category_scores_gemma":[0.0013821286,0.00034794124,0.00066130655,0.00043077365,0.0014171057,0.0020520566,0.0014950217,0.0011589868,0.0015955726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022077214,0.000086249645,0.0011562107,0.00033180136,0.000017260032,0.0008430424,0.0014466404,0.0041154823,0.07854602,0.8190975,0.0023141454,0.09182487],"study_design_scores_gemma":[0.000052269916,0.0002133419,0.0011702293,0.00011822536,0.00006370199,0.00080319605,0.0004316605,0.026717087,0.09695272,0.8113363,0.062042683,0.00009852978],"about_ca_topic_score_codex":0.00048732985,"about_ca_topic_score_gemma":0.0006487157,"teacher_disagreement_score":0.005010106,"about_ca_system_score_codex":0.0004808357,"about_ca_system_score_gemma":0.0003180899,"threshold_uncertainty_score":0.016760468},"labels":[],"label_agreement":null},{"id":"W4283011735","doi":"10.1137/21m1417077","title":"Robust Connectivity of Graphs on Surfaces","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Uniwersytet Warszawski","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Lambda; Discrete mathematics; Degeneracy (biology); Dominating set; Tree (set theory); Arboricity; Spanning tree; Invariant (physics); Graph; Planar graph","score_opus":0.046048372849475355,"score_gpt":0.2979433993994719,"score_spread":0.2518950265499965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283011735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5762157,0.0020002155,0.33952034,0.0013161391,0.00018620629,0.00017931106,0.001738326,0.0014740044,0.07736979],"genre_scores_gemma":[0.95723116,0.0007382904,0.032027308,0.00022577427,0.00012721976,0.0001686864,0.0014497789,0.00028874326,0.0077430718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937147,0.00009553407,0.000029285982,0.0001839328,0.00022001722,0.000099687444],"domain_scores_gemma":[0.9987406,0.00042334746,0.00032398282,0.00018977957,0.00018639844,0.00013588491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030834778,0.0005369339,0.0005930258,0.0026183012,0.0007567176,0.0016584363,0.0010047398,0.0009498743,0.0063170455],"category_scores_gemma":[0.0029849953,0.00033232663,0.0006103049,0.0013067605,0.002061929,0.0025286903,0.0016656321,0.00095410156,0.0007417568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015846746,0.00004025702,0.0018367181,0.00021515963,0.00004309969,0.0004362756,0.00062363094,0.07748054,0.012009091,0.8572503,0.005269303,0.044637125],"study_design_scores_gemma":[0.000033937198,0.00006824492,0.0035841512,0.00006390336,0.000030225303,0.0005335638,0.0003796944,0.14029266,0.0031630523,0.8312456,0.020558396,0.00004650567],"about_ca_topic_score_codex":0.0016877683,"about_ca_topic_score_gemma":0.0010050954,"teacher_disagreement_score":0.0063170455,"about_ca_system_score_codex":0.0009155217,"about_ca_system_score_gemma":0.00026724956,"threshold_uncertainty_score":0.021132648},"labels":[],"label_agreement":null},{"id":"W4293236967","doi":"10.1137/21m1403163","title":"On the Cardinality of Sets in $R^d$ Obeying a Slightly Obtuse Angle Bound","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"ShanghaiTech University; University of Toronto; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Conjecture; Vertex (graph theory); Polytope; Regular polygon; Function (biology); Upper and lower bounds; Graph; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.0437667565335654,"score_gpt":0.30989252401753464,"score_spread":0.26612576748396927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293236967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8570437,0.00089646794,0.11870891,0.0016565312,0.00008524526,0.00003962957,0.0014150304,0.00025886076,0.019895675],"genre_scores_gemma":[0.97492224,0.0005935448,0.02074227,0.00015945252,0.00013665493,0.00011021994,0.0011245549,0.00014478386,0.002066237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969632,0.0008464598,0.00019900363,0.0006173655,0.00086104753,0.00051295897],"domain_scores_gemma":[0.96983284,0.02396579,0.0021311,0.002082712,0.00086625014,0.001121244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031280986,0.0007571768,0.0014061863,0.0024910837,0.0017432584,0.0041038757,0.0025210585,0.0010527817,0.0031984276],"category_scores_gemma":[0.02036949,0.0007291402,0.001076456,0.002031482,0.0027789513,0.0069697374,0.003314752,0.001902541,0.00038169217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012448606,0.00012759534,0.030378105,0.00041632503,0.00015946088,0.00060564047,0.0014320376,0.11344086,0.013834911,0.81240565,0.0048566777,0.021097824],"study_design_scores_gemma":[0.000091814174,0.00012914011,0.009430998,0.00012357776,0.00009046265,0.0014149228,0.00076108536,0.40195602,0.011509104,0.5686115,0.0057650725,0.00011635047],"about_ca_topic_score_codex":0.0011196192,"about_ca_topic_score_gemma":0.00087441015,"teacher_disagreement_score":0.0041038757,"about_ca_system_score_codex":0.0015792451,"about_ca_system_score_gemma":0.00052657194,"threshold_uncertainty_score":0.01654315},"labels":[],"label_agreement":null},{"id":"W4381382709","doi":"10.1137/22m150767x","title":"The Spectrum of Triangle-Free Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Beckman Institute for Advanced Science and Technology, University of Illinois, Urbana-Champaign; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Bipartite graph; Conjecture; Triangle-free graph; Upper and lower bounds; Graph; Line graph; Graph power","score_opus":0.042926857678239116,"score_gpt":0.316427439417595,"score_spread":0.2735005817393559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381382709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878163,0.0011619014,0.11189828,0.0014971675,0.00021330963,0.000049867092,0.0008688177,0.00032152692,0.09617292],"genre_scores_gemma":[0.9834915,0.00041686895,0.006860522,0.00014616014,0.00010652488,0.000038375703,0.00042276888,0.000059614056,0.008457692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997435,0.00003440776,0.000008268012,0.000058829635,0.000090066475,0.000064927546],"domain_scores_gemma":[0.99933213,0.00025412245,0.00009823911,0.000064581676,0.00010873653,0.00014211892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002102759,0.00034125388,0.0001893612,0.0014223218,0.0006182003,0.0009802941,0.0005900869,0.00044471258,0.012280092],"category_scores_gemma":[0.0015229327,0.00016415447,0.0002415186,0.00080308237,0.001072669,0.0014492336,0.0009359738,0.0004925644,0.00088417367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000924452,0.000025863816,0.00094917195,0.00008301447,0.000007818814,0.00017047992,0.00035249957,0.0030932124,0.006439978,0.96349204,0.0039969003,0.021296624],"study_design_scores_gemma":[0.000020589037,0.000029888355,0.0014113326,0.000026027206,0.0000047207245,0.00027133155,0.00018709105,0.030825334,0.0022380746,0.95875907,0.0062150247,0.000011399727],"about_ca_topic_score_codex":0.0011610908,"about_ca_topic_score_gemma":0.000714965,"teacher_disagreement_score":0.012280092,"about_ca_system_score_codex":0.0006316286,"about_ca_system_score_gemma":0.00020201287,"threshold_uncertainty_score":0.04108095},"labels":[],"label_agreement":null},{"id":"W4386848811","doi":"10.1137/22m1534195","title":"Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Grid; k-nearest neighbors algorithm; Graph; Percolation (cognitive psychology); Discrete mathematics; Set (abstract data type); Computer science","score_opus":0.10758468761018754,"score_gpt":0.38614142682461566,"score_spread":0.27855673921442814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386848811","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.34359354,0.014037453,0.41619697,0.010267202,0.0009154721,0.00015639373,0.0018031083,0.0011120383,0.21191786],"genre_scores_gemma":[0.95651406,0.0018546369,0.036059346,0.0008198477,0.00064599514,0.00020764602,0.00051006826,0.00025381026,0.0031346646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979328,0.0006367687,0.00008288828,0.00027411198,0.00053662015,0.0005367845],"domain_scores_gemma":[0.9763949,0.016708447,0.0018827672,0.0019953854,0.001175211,0.0018432565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037324985,0.0014391937,0.0021146175,0.004364837,0.0027208922,0.0043822764,0.003671689,0.0023383275,0.0062853345],"category_scores_gemma":[0.02382186,0.00083192013,0.0014103914,0.002170872,0.00471247,0.006119906,0.0054455465,0.0044276994,0.00071859144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017154707,0.000055331704,0.0011145341,0.00018265881,0.000049951424,0.00014733999,0.00025320923,0.017833265,0.0009671916,0.969231,0.0052869655,0.004706995],"study_design_scores_gemma":[0.000021861595,0.000021296375,0.00090588315,0.00014870748,0.000029278914,0.0001458504,0.00011335943,0.10951489,0.0005701959,0.88600296,0.0024810098,0.000044638033],"about_ca_topic_score_codex":0.00088764296,"about_ca_topic_score_gemma":0.001273631,"teacher_disagreement_score":0.0062853345,"about_ca_system_score_codex":0.002356771,"about_ca_system_score_gemma":0.00067686033,"threshold_uncertainty_score":0.021026552},"labels":[],"label_agreement":null},{"id":"W4391321941","doi":"10.1137/23m1552231","title":"The Power of Filling in Balanced Allocations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"European Research Council; Engineering and Physical Sciences Research Council","keywords":"Mathematics; Power (physics); Combinatorics; Discrete mathematics; Mathematical economics; Mathematical optimization","score_opus":0.02026844332587755,"score_gpt":0.2940535587910843,"score_spread":0.27378511546520673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391321941","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.074469924,0.0020969128,0.8835961,0.0029176804,0.00022636715,0.0001241238,0.00026356144,0.00094432867,0.035361018],"genre_scores_gemma":[0.8111812,0.0016794066,0.16347587,0.0011517942,0.00048491746,0.00037190906,0.0002976609,0.00076230336,0.02059497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954537,0.0016058406,0.00017497766,0.00087991345,0.0011165745,0.00076895294],"domain_scores_gemma":[0.9843217,0.009535269,0.0013331377,0.0034257914,0.0007738564,0.00061026035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042997287,0.0012426422,0.001480685,0.0009890905,0.0019097705,0.004389883,0.0024836631,0.0021112845,0.01235154],"category_scores_gemma":[0.026809448,0.00092168956,0.0012125872,0.001676501,0.00435369,0.011478532,0.005469822,0.0029837862,0.00204064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060889585,0.00011406606,0.0011963139,0.00021985862,0.00004649822,0.00013880825,0.00035257603,0.06894203,0.0037734658,0.83990026,0.0047285897,0.079978704],"study_design_scores_gemma":[0.000060791182,0.00011446933,0.00034003,0.00005067619,0.000030844865,0.00019032237,0.0000848075,0.2280856,0.0042204894,0.75622904,0.010565723,0.000027165912],"about_ca_topic_score_codex":0.0013170507,"about_ca_topic_score_gemma":0.0007888524,"teacher_disagreement_score":0.01235154,"about_ca_system_score_codex":0.0022866891,"about_ca_system_score_gemma":0.0017423144,"threshold_uncertainty_score":0.041320026},"labels":[],"label_agreement":null},{"id":"W4393008377","doi":"10.1137/22m1515768","title":"List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Edge coloring; List coloring; Complete coloring; Discrete mathematics; Brooks' theorem; Graph coloring; Greedy coloring; Chordal graph; Graph; 1-planar graph; Line graph","score_opus":0.03265438846763929,"score_gpt":0.3106433100962616,"score_spread":0.2779889216286223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393008377","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.27824748,0.0004267011,0.67506397,0.0025033525,0.0003252002,0.00067527476,0.0069869147,0.004160967,0.03161021],"genre_scores_gemma":[0.66213536,0.00029244408,0.3112246,0.00092745916,0.00009888563,0.00030599482,0.009233099,0.0004709586,0.015311241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987914,0.0002660526,0.00008072406,0.00031052865,0.00028710606,0.0002642401],"domain_scores_gemma":[0.9958034,0.002234021,0.00041470144,0.00070411054,0.0005205161,0.00032332065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063024164,0.0008007723,0.0006258004,0.00065748225,0.0010906003,0.0019611667,0.00135656,0.00094837096,0.008468098],"category_scores_gemma":[0.00288021,0.00044460833,0.0012797439,0.001461817,0.0010488065,0.0030144951,0.001174189,0.0014781147,0.0011474534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018033264,0.001249166,0.0065680062,0.0016384827,0.00022202915,0.0018848085,0.000926164,0.33618146,0.03339955,0.40030995,0.048121728,0.16769531],"study_design_scores_gemma":[0.0002338448,0.00027739594,0.001528541,0.00009034813,0.00009790096,0.00067410397,0.00040633266,0.43188044,0.025563845,0.5179769,0.02118885,0.00008150924],"about_ca_topic_score_codex":0.0067651006,"about_ca_topic_score_gemma":0.0090815695,"teacher_disagreement_score":0.008468098,"about_ca_system_score_codex":0.0022601418,"about_ca_system_score_gemma":0.0024512177,"threshold_uncertainty_score":0.028328598},"labels":[],"label_agreement":null},{"id":"W4393982883","doi":"10.1137/23m1566790","title":"On the Gap Between Hereditary Discrepancy and the Determinant Lower Bound","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.04852986850425974,"score_gpt":0.3221263570040353,"score_spread":0.2735964884997756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393982883","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34791392,0.018186642,0.438527,0.02413659,0.0014091156,0.00009871571,0.0015218362,0.0011748282,0.16703138],"genre_scores_gemma":[0.9486344,0.0032150284,0.033961557,0.0031238752,0.0012462334,0.00018629449,0.0008502108,0.0005662882,0.008216203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99314415,0.0016201417,0.00021936702,0.0017624947,0.0022332862,0.0010206229],"domain_scores_gemma":[0.94363326,0.04516618,0.0021049678,0.0049759867,0.0021947944,0.0019247975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056593693,0.0010329614,0.0021736657,0.0025160906,0.0025783288,0.0037456462,0.0029702063,0.0021219915,0.007408608],"category_scores_gemma":[0.0476948,0.00086102576,0.0018259499,0.0029771593,0.0070925495,0.013135178,0.007969226,0.00830822,0.0015382562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029744647,0.0000916007,0.0040047243,0.00023424141,0.00007056206,0.00016445773,0.00043279238,0.014323255,0.002123321,0.95083773,0.007924099,0.019495757],"study_design_scores_gemma":[0.000040956973,0.00008939386,0.0020250706,0.00007138276,0.00004768268,0.00034767075,0.00009886151,0.055914477,0.0015082993,0.9322881,0.007510158,0.000058005226],"about_ca_topic_score_codex":0.0017570851,"about_ca_topic_score_gemma":0.0010342987,"teacher_disagreement_score":0.007408608,"about_ca_system_score_codex":0.0038506305,"about_ca_system_score_gemma":0.0011985422,"threshold_uncertainty_score":0.029929996},"labels":[],"label_agreement":null},{"id":"W4394576567","doi":"10.1137/23m1566881","title":"The Rainbow Saturation Number Is Linear","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Rainbow; Combinatorics; Saturation (graph theory); Discrete mathematics; Physics","score_opus":0.03317991022247071,"score_gpt":0.35077285444035566,"score_spread":0.317592944217885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394576567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51613533,0.0017793687,0.274589,0.010119661,0.0004056177,0.00021105654,0.0040738764,0.0041902172,0.1884959],"genre_scores_gemma":[0.93032694,0.00104133,0.045741018,0.00087989384,0.00026290579,0.00026039206,0.0012945943,0.0004040579,0.019788796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998293,0.00019090791,0.00007726695,0.00072907045,0.00033881815,0.00037094115],"domain_scores_gemma":[0.991867,0.0051459265,0.00043221322,0.0013293718,0.0006314563,0.00059413334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009936284,0.00077347335,0.0007925455,0.00081680494,0.0012867404,0.0019168155,0.001533704,0.0008977776,0.013553636],"category_scores_gemma":[0.005886985,0.00065351836,0.0008475803,0.0010642837,0.0028097255,0.008176278,0.0023318378,0.0023932264,0.0022212076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017021009,0.0003459789,0.01184745,0.0011858958,0.00019327525,0.00045910137,0.0010778491,0.06150276,0.09328894,0.67922723,0.031809494,0.11735992],"study_design_scores_gemma":[0.00013992109,0.00024243824,0.004538438,0.0001302304,0.00014167957,0.00075515866,0.0003616252,0.11689584,0.0510656,0.786814,0.038806688,0.00010828951],"about_ca_topic_score_codex":0.0015998672,"about_ca_topic_score_gemma":0.0026396199,"teacher_disagreement_score":0.013553636,"about_ca_system_score_codex":0.0024452668,"about_ca_system_score_gemma":0.0019947316,"threshold_uncertainty_score":0.04534149},"labels":[],"label_agreement":null},{"id":"W4396677071","doi":"10.1137/23m1600384","title":"A Precise Condition for Independent Transversals in Bipartite Covers","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"KU Leuven; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Bipartite graph; Mathematics; Combinatorics; Discrete mathematics; Graph","score_opus":0.011869001262928582,"score_gpt":0.2562360631189546,"score_spread":0.244367061856026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396677071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43990424,0.0012494941,0.39603856,0.004754999,0.00086022995,0.00061260874,0.009048886,0.002926922,0.14460407],"genre_scores_gemma":[0.8958489,0.0012031996,0.06645264,0.0016195956,0.00090094353,0.00059092365,0.012044097,0.0009569033,0.020382812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955149,0.0005612894,0.00052351743,0.001345956,0.0009118145,0.0011425323],"domain_scores_gemma":[0.97892,0.010680408,0.0017528082,0.0030611644,0.0031850692,0.0024005892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034273232,0.0010908007,0.0016415439,0.0021079679,0.0031728954,0.004874076,0.002144551,0.0036396992,0.023415484],"category_scores_gemma":[0.021758582,0.0020369668,0.0028029562,0.0024597733,0.0037050429,0.011287627,0.0052634254,0.006015647,0.0047194175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001006164,0.00018713271,0.0060026012,0.0004992272,0.00011388817,0.0014441609,0.0014880609,0.00732547,0.019754708,0.93448985,0.010154968,0.017533751],"study_design_scores_gemma":[0.00032821103,0.00043952063,0.0037025525,0.00021299576,0.00019616175,0.0032252653,0.0015685214,0.026625799,0.018589865,0.9107802,0.034181267,0.00014962758],"about_ca_topic_score_codex":0.0015312786,"about_ca_topic_score_gemma":0.0016240854,"teacher_disagreement_score":0.023415484,"about_ca_system_score_codex":0.0015139319,"about_ca_system_score_gemma":0.0016718212,"threshold_uncertainty_score":0.07833254},"labels":[],"label_agreement":null},{"id":"W4399121994","doi":"10.1137/22m1511229","title":"Tuza’s Conjecture for Binary Geometries","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Binary number; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.05627390504219235,"score_gpt":0.36443816381555494,"score_spread":0.30816425877336256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399121994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48276192,0.0057116062,0.170482,0.017966567,0.001666724,0.00016908,0.0024387282,0.0010430893,0.31776032],"genre_scores_gemma":[0.95508945,0.0011316835,0.025301754,0.0016414071,0.0006751464,0.00017546922,0.0013052513,0.00008770328,0.014592067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985518,0.00018813483,0.00010259575,0.00043163105,0.00035536167,0.00037053804],"domain_scores_gemma":[0.9957696,0.0022328685,0.00040512264,0.00073000713,0.00052974664,0.000332587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010810152,0.00064166094,0.0010661661,0.0018621508,0.0025094573,0.003798243,0.0012373108,0.0023435995,0.010498058],"category_scores_gemma":[0.009617134,0.00065971614,0.00095785956,0.0020551798,0.0038366327,0.00848712,0.0028381085,0.0024574718,0.0013650735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011332605,0.00002770981,0.00089750305,0.000111929316,0.000012253123,0.00008639804,0.0003027919,0.0036435416,0.0009137787,0.96763724,0.010411907,0.015841704],"study_design_scores_gemma":[0.000033381304,0.000033764063,0.0008339296,0.00003893428,0.000013610831,0.00023124437,0.0001494298,0.006585413,0.0010877254,0.9693253,0.021642232,0.000025079074],"about_ca_topic_score_codex":0.0018055256,"about_ca_topic_score_gemma":0.0013697214,"teacher_disagreement_score":0.010498058,"about_ca_system_score_codex":0.0016251914,"about_ca_system_score_gemma":0.00071974355,"threshold_uncertainty_score":0.035119474},"labels":[],"label_agreement":null},{"id":"W4400004372","doi":"10.1137/23m1603856","title":"Erratum: Multitasking Capacity: Hardness Results and Improved Constructions","year":2024,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Human multitasking; Mathematics; Combinatorics; Discrete mathematics; Cognitive psychology; Psychology","score_opus":0.03213379434423039,"score_gpt":0.2703348595808777,"score_spread":0.23820106523664733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400004372","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006168458,0.004712556,0.07238902,0.23900788,0.46246526,0.0002808675,0.0076047303,0.0019164872,0.20545481],"genre_scores_gemma":[0.13047734,0.011462578,0.11446844,0.06291841,0.11604763,0.00093567715,0.012197609,0.0062115593,0.54528075],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99581087,0.00069948664,0.00038817775,0.00069270446,0.0020272937,0.00038148012],"domain_scores_gemma":[0.9774901,0.011947009,0.0006894825,0.0027056935,0.006290752,0.0008769277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029480052,0.0023594238,0.001903087,0.0031218494,0.0052379244,0.004618071,0.00440761,0.004379261,0.08384679],"category_scores_gemma":[0.035616957,0.0013711883,0.0021164455,0.0042906315,0.004117587,0.013424364,0.0030195625,0.013052577,0.028239826],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016050007,0.00004251839,0.00010426652,0.00024793367,0.000016353077,0.00018836113,0.000072244045,0.0011114711,0.00031996172,0.0614152,0.9176716,0.018649628],"study_design_scores_gemma":[0.00012498324,0.00007770799,0.00083583815,0.00039010012,0.00013451319,0.0010226609,0.00028453965,0.008634021,0.0023758754,0.3561954,0.6297525,0.00017188296],"about_ca_topic_score_codex":0.003840509,"about_ca_topic_score_gemma":0.0050591603,"teacher_disagreement_score":0.08384679,"about_ca_system_score_codex":0.0044480083,"about_ca_system_score_gemma":0.0033699293,"threshold_uncertainty_score":0.28049546},"labels":[],"label_agreement":null},{"id":"W4400467622","doi":"10.1137/23m1591773","title":"Product Structure Extension of the Alon–Seymour–Thomas Theorem","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Fonds De La Recherche Scientifique - FNRS; Australian Government; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Product (mathematics); Discrete mathematics; Structured program theorem; Geometry; Computer science","score_opus":0.019635966402535964,"score_gpt":0.30057751453888726,"score_spread":0.2809415481363513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400467622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51188004,0.0011691782,0.33118996,0.0015713685,0.00027057808,0.00011630534,0.0010427309,0.0008437764,0.15191612],"genre_scores_gemma":[0.9373149,0.0006438259,0.041324846,0.00043005435,0.00023479745,0.000100865196,0.00083084416,0.00023160518,0.018888315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963593,0.00003270159,0.0000148421705,0.00013025379,0.000099545934,0.00008668643],"domain_scores_gemma":[0.9986058,0.00050174416,0.00012458737,0.00035123102,0.00023815532,0.00017838438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036791206,0.00038872685,0.00051984494,0.0007058339,0.0010471162,0.0010293772,0.00093638897,0.0006069885,0.010372816],"category_scores_gemma":[0.0017322808,0.0004497971,0.0009802468,0.00056483917,0.0014316256,0.00420225,0.0019596189,0.0017113604,0.0010694518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015874079,0.000049876082,0.0013741788,0.00013855114,0.000025816755,0.0003013535,0.0004569274,0.0040262025,0.0077801286,0.95978004,0.0048228255,0.021085287],"study_design_scores_gemma":[0.000069495094,0.00017039808,0.0022301183,0.000023544208,0.00004499831,0.0009957553,0.00018231252,0.022303497,0.007126438,0.9369819,0.029838081,0.000033291813],"about_ca_topic_score_codex":0.0013655176,"about_ca_topic_score_gemma":0.0012483585,"teacher_disagreement_score":0.010372816,"about_ca_system_score_codex":0.00054118433,"about_ca_system_score_gemma":0.00036136314,"threshold_uncertainty_score":0.034700513},"labels":[],"label_agreement":null},{"id":"W4400538358","doi":"10.1137/23m1553273","title":"Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","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 Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Combinatorics; Girth (graph theory); Discrete mathematics","score_opus":0.015509146590443845,"score_gpt":0.2532355052430149,"score_spread":0.23772635865257108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400538358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8352185,0.00140508,0.0692746,0.027436117,0.0006361946,0.00035293517,0.004517153,0.0018253035,0.059334073],"genre_scores_gemma":[0.9713747,0.0005787611,0.014906409,0.0015138409,0.0006919881,0.00022409097,0.0028808697,0.0005033049,0.0073259524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965222,0.0010597107,0.00016096729,0.001007434,0.0006015261,0.0006481676],"domain_scores_gemma":[0.92253774,0.06510727,0.003857371,0.0039360286,0.0017034995,0.0028581102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035683517,0.00239054,0.0038808528,0.0025880062,0.005423763,0.009414061,0.005235749,0.0061940257,0.016626809],"category_scores_gemma":[0.03222279,0.0029187223,0.0026714138,0.0033912158,0.010016922,0.015144989,0.005800288,0.01033773,0.0018237499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030656545,0.0009551935,0.0073718354,0.0011591594,0.00035153417,0.0009603515,0.0010901991,0.088501185,0.007614697,0.82845974,0.040212616,0.020257814],"study_design_scores_gemma":[0.0003113926,0.00007891256,0.0009725197,0.00005531395,0.000043559336,0.00030007624,0.00034930216,0.043697372,0.0014211673,0.95099175,0.0017247624,0.000053792395],"about_ca_topic_score_codex":0.0028270453,"about_ca_topic_score_gemma":0.0030816318,"teacher_disagreement_score":0.016626809,"about_ca_system_score_codex":0.0034923707,"about_ca_system_score_gemma":0.0030383754,"threshold_uncertainty_score":0.05562222},"labels":[],"label_agreement":null},{"id":"W4400893749","doi":"10.1137/23m1587713","title":"Optimal Adjacency Labels for Subgraphs of Cartesian Products","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Adjacency list; Combinatorics; Mathematics; Cartesian product; Cartesian coordinate system; Discrete mathematics; Geometry","score_opus":0.02111613834027702,"score_gpt":0.28205777932941584,"score_spread":0.2609416409891388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400893749","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.34793413,0.0015012921,0.5745656,0.00416957,0.0007792668,0.00033697893,0.0046569486,0.0043516606,0.061704624],"genre_scores_gemma":[0.55757266,0.0010570828,0.40214917,0.00057544163,0.000271962,0.00024874136,0.0060797217,0.00217348,0.029871698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996111,0.000103669154,0.000016562248,0.00012621307,0.00007767046,0.00006479097],"domain_scores_gemma":[0.9983394,0.0008510959,0.00010135677,0.0003515679,0.00020288769,0.00015355978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979281,0.0008588446,0.0010492472,0.0008062722,0.0010524858,0.0016228581,0.0012285654,0.0008560629,0.020442901],"category_scores_gemma":[0.0033260423,0.0006375001,0.00054232863,0.0011843713,0.0007726714,0.0023780898,0.0012507603,0.0015537419,0.0024244413],"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.0007217872,0.0005693342,0.0018889837,0.00070075906,0.00007220244,0.00014067451,0.00050900585,0.14928795,0.018626811,0.2601636,0.102297485,0.46502137],"study_design_scores_gemma":[0.00012797418,0.00011668642,0.001227452,0.00009464146,0.00006357491,0.00008978821,0.00033338374,0.32671943,0.007524055,0.64496624,0.018708257,0.000028468407],"about_ca_topic_score_codex":0.0027357945,"about_ca_topic_score_gemma":0.0068825125,"teacher_disagreement_score":0.020442901,"about_ca_system_score_codex":0.0013106264,"about_ca_system_score_gemma":0.00116421,"threshold_uncertainty_score":0.06838834},"labels":[],"label_agreement":null},{"id":"W4401894564","doi":"10.1137/24m1639488","title":"On Multicolor Turán Numbers","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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 Victoria","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; American Mathematical Society; National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.027673408085942416,"score_gpt":0.3301607663311669,"score_spread":0.3024873582452245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401894564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4323204,0.003890818,0.14700674,0.004845197,0.0014680076,0.00007143674,0.00047352535,0.0006178324,0.40930596],"genre_scores_gemma":[0.91472846,0.0016651857,0.023786398,0.0009836,0.0005888225,0.00011270251,0.00023642695,0.00035184703,0.057546567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945503,0.00018805842,0.000020266967,0.000106452506,0.0001274212,0.00010288853],"domain_scores_gemma":[0.99773395,0.0011381743,0.00026963948,0.0002612633,0.0002837588,0.00031316874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006654502,0.0007519288,0.0009360536,0.0032706202,0.002015699,0.0026496865,0.0014874026,0.0012973505,0.012509764],"category_scores_gemma":[0.0048092804,0.0005054137,0.0006240368,0.0022307732,0.0028447055,0.0053623905,0.0025166245,0.0027892815,0.0015853649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015542599,0.0000061685487,0.00009949392,0.000022694672,0.0000021234134,0.000020514646,0.00010522723,0.0010423381,0.00019599992,0.99348974,0.0014265017,0.0035737818],"study_design_scores_gemma":[0.0000040514515,0.0000076689275,0.00018335,0.000025810288,0.000004414988,0.000064737724,0.000057468875,0.0053787106,0.00018480055,0.99009305,0.003987309,0.000008768737],"about_ca_topic_score_codex":0.001260897,"about_ca_topic_score_gemma":0.001816267,"teacher_disagreement_score":0.012509764,"about_ca_system_score_codex":0.0016534975,"about_ca_system_score_gemma":0.00044491698,"threshold_uncertainty_score":0.041849315},"labels":[],"label_agreement":null},{"id":"W4401922144","doi":"10.1137/23m1625342","title":"Off-Diagonal Commonality of Graphs via Entropy","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; University of Victoria","keywords":"Mathematics; Combinatorics; Diagonal; Discrete mathematics; Entropy (arrow of time); Chordal graph; Graph; Geometry","score_opus":0.028401674492777522,"score_gpt":0.31515103928519994,"score_spread":0.2867493647924224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401922144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84014714,0.0002774544,0.14231597,0.00043042196,0.000026907515,0.00007315986,0.00045363806,0.00019357936,0.016081724],"genre_scores_gemma":[0.98726904,0.00013826856,0.009701587,0.00004868713,0.00003480485,0.000051216,0.00022013142,0.00004000054,0.0024961398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918324,0.00019818211,0.00003054913,0.00023227291,0.00020487518,0.00015093014],"domain_scores_gemma":[0.9965629,0.0015934149,0.0006436048,0.0005003704,0.00027003157,0.00042959946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007672321,0.00036776724,0.00046391357,0.0017735022,0.00083961827,0.0013924562,0.000749088,0.00056288234,0.0039053482],"category_scores_gemma":[0.004724742,0.00028026817,0.0005225824,0.0011313742,0.002286589,0.002501473,0.001974151,0.00078807847,0.00022209108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013580578,0.000060175582,0.004173525,0.00007801958,0.000031233958,0.00022325471,0.00047212976,0.031563144,0.009495299,0.93564785,0.0011754374,0.016943999],"study_design_scores_gemma":[0.000027587432,0.00009351543,0.0051448178,0.000031236457,0.00002518751,0.0003039804,0.00020087778,0.20531364,0.0048141493,0.7814238,0.0025899145,0.000031244414],"about_ca_topic_score_codex":0.0016928054,"about_ca_topic_score_gemma":0.0022529156,"teacher_disagreement_score":0.0039053482,"about_ca_system_score_codex":0.0015768223,"about_ca_system_score_gemma":0.0005269352,"threshold_uncertainty_score":0.013064742},"labels":[],"label_agreement":null},{"id":"W4401922998","doi":"10.1137/23m1561105","title":"Cliques, Chromatic Number, and Independent Sets in the Semi-random Process","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","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":"Toronto Metropolitan University","funders":"Austrian Science Fund","keywords":"Mathematics; Chromatic scale; Combinatorics; Discrete mathematics; Random graph; Graph","score_opus":0.030107667482830943,"score_gpt":0.35971172207171287,"score_spread":0.3296040545888819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401922998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62271225,0.0021941732,0.3408294,0.006180624,0.00025336788,0.00016871629,0.0010640296,0.00024150455,0.026355954],"genre_scores_gemma":[0.9688298,0.001032834,0.019654348,0.00033052973,0.00049962505,0.00017603772,0.00044329144,0.000096286094,0.008937228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983607,0.00068191864,0.000045692323,0.00038074414,0.00029566314,0.00023534337],"domain_scores_gemma":[0.97381717,0.019410504,0.002369362,0.001273751,0.0010388946,0.0020903992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040161884,0.00090215006,0.0019069576,0.003479725,0.0026650997,0.004708122,0.0029107195,0.0022373102,0.00691962],"category_scores_gemma":[0.0170139,0.0010078705,0.0013987541,0.002541557,0.008034301,0.007034411,0.0024773814,0.0031243793,0.00037352135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007759694,0.000035705947,0.0008670358,0.00004285764,0.00002436049,0.000034963043,0.00015809874,0.01964562,0.00040253214,0.9758361,0.0010759151,0.0017991831],"study_design_scores_gemma":[0.000045692523,0.00001725761,0.000951954,0.000020364436,0.000016613378,0.000049208276,0.000060507646,0.14551046,0.00012842349,0.85240257,0.000766512,0.000030433803],"about_ca_topic_score_codex":0.0074615753,"about_ca_topic_score_gemma":0.00673201,"teacher_disagreement_score":0.0074615753,"about_ca_system_score_codex":0.0038020082,"about_ca_system_score_gemma":0.0017664614,"threshold_uncertainty_score":0.027585566},"labels":[],"label_agreement":null},{"id":"W4402011228","doi":"10.1137/21m1425736","title":"Rainbow Thresholds","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Science Foundation","keywords":"Rainbow; Mathematics; Combinatorics; Discrete mathematics; Physics; Optics","score_opus":0.03558605946525564,"score_gpt":0.3326163717282182,"score_spread":0.2970303122629625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402011228","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.15232727,0.0014456857,0.14754663,0.005139395,0.001435173,0.00016632659,0.0011961726,0.0022891029,0.6884543],"genre_scores_gemma":[0.80739623,0.0008889133,0.02196,0.0020570103,0.000578939,0.0001873632,0.0009816381,0.0010500726,0.16489983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905235,0.00010660566,0.000044691966,0.0002806476,0.00027519814,0.00024055112],"domain_scores_gemma":[0.9979061,0.00061690336,0.0001627418,0.00055025757,0.0003489823,0.00041502318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058214355,0.0005456671,0.0011046001,0.0021423693,0.0019162704,0.0038986614,0.0015048569,0.0020952108,0.054587696],"category_scores_gemma":[0.005312608,0.0005226476,0.00077935343,0.0010627528,0.002071223,0.0072228927,0.00372013,0.0037997712,0.0071887528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002363121,0.000017395523,0.00012906751,0.00002799756,0.000004804792,0.000031896947,0.000056589215,0.00026365905,0.0008716907,0.9885783,0.004938798,0.0050560874],"study_design_scores_gemma":[0.00000903158,0.0000074208197,0.0001710117,0.0000118438675,0.0000053841018,0.000094137795,0.00005182521,0.0021132973,0.00069350953,0.9919219,0.004912837,0.000007743175],"about_ca_topic_score_codex":0.00064279675,"about_ca_topic_score_gemma":0.0007056722,"teacher_disagreement_score":0.054587696,"about_ca_system_score_codex":0.0013915933,"about_ca_system_score_gemma":0.0009043929,"threshold_uncertainty_score":0.18261403},"labels":[],"label_agreement":null},{"id":"W4402612843","doi":"10.1137/23m1615784","title":"An Algorithm to Recover Shredded Random Matrices","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","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; McGill University","funders":"","keywords":"Mathematics; Combinatorics; Algorithm; Discrete mathematics","score_opus":0.008461102162985828,"score_gpt":0.2859603382922902,"score_spread":0.2774992361293043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402612843","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.008953491,0.00010556372,0.988326,0.00012942834,0.00009044977,0.00007471859,0.000109012246,0.0013435233,0.0008678207],"genre_scores_gemma":[0.04401501,0.00010095664,0.9506585,0.00008182403,0.00005607274,0.00011585603,0.00041552857,0.00014255481,0.004413587],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943894,0.00007550205,0.000040037394,0.00014680435,0.00022517565,0.000073557145],"domain_scores_gemma":[0.9988105,0.00037753602,0.00008572185,0.00039185045,0.00027773032,0.000056604353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067323993,0.0009626371,0.0009150953,0.0015202963,0.0007423331,0.0009215122,0.0014121722,0.0017208329,0.0056921057],"category_scores_gemma":[0.0029678068,0.00051136245,0.0009813402,0.001195553,0.0007359077,0.0013334512,0.002481272,0.0012101555,0.0030879052],"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.00049748283,0.00015994742,0.0007876643,0.00020484527,0.00014724875,0.0002963936,0.00016232188,0.08551243,0.0455244,0.032356948,0.009703717,0.82464653],"study_design_scores_gemma":[0.00013031624,0.00013329291,0.0004403613,0.000020982132,0.00006171275,0.00044336246,0.00006810904,0.93073446,0.02792585,0.031310663,0.00868751,0.000043344542],"about_ca_topic_score_codex":0.0016624682,"about_ca_topic_score_gemma":0.0029510974,"teacher_disagreement_score":0.0056921057,"about_ca_system_score_codex":0.00042646186,"about_ca_system_score_gemma":0.0012214646,"threshold_uncertainty_score":0.019041955},"labels":[],"label_agreement":null},{"id":"W4403257040","doi":"10.1137/24m1640859","title":"Kissing Polytopes","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Deutsche Forschungsgemeinschaft; Technion-Israel Institute of Technology; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.043360398561652386,"score_gpt":0.35790437965226535,"score_spread":0.314543981090613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403257040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.517168,0.00080175156,0.1360247,0.0020724176,0.00065359345,0.00013072543,0.0012278421,0.00056093576,0.34136006],"genre_scores_gemma":[0.84355754,0.0009805376,0.03199949,0.00050891435,0.00032998523,0.00016469808,0.0016626692,0.00064688677,0.120149314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995945,0.00004505069,0.00002153753,0.00010975057,0.00013050155,0.00009871171],"domain_scores_gemma":[0.9988482,0.00043865672,0.0001545838,0.00011385769,0.00014315467,0.000301586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027016216,0.000813931,0.0012054049,0.0018827529,0.0023632455,0.0038181432,0.0009753318,0.0015245953,0.03274298],"category_scores_gemma":[0.0019779117,0.0006761582,0.0008871572,0.0012738724,0.0018730297,0.0032779349,0.0030175622,0.0040482045,0.004108103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000459023,0.000038337446,0.00029165053,0.00006038545,0.000016007798,0.00016587028,0.00016837892,0.0029798893,0.0015160572,0.9816326,0.004426968,0.008658003],"study_design_scores_gemma":[0.000027269332,0.00004122698,0.00052059384,0.000035223446,0.000018559962,0.00046181606,0.00030561665,0.0148346815,0.0015371416,0.9668577,0.015335075,0.000025068917],"about_ca_topic_score_codex":0.0006378706,"about_ca_topic_score_gemma":0.000721505,"teacher_disagreement_score":0.03274298,"about_ca_system_score_codex":0.0007905275,"about_ca_system_score_gemma":0.00041944333,"threshold_uncertainty_score":0.10953617},"labels":[],"label_agreement":null},{"id":"W4404192098","doi":"10.1137/24m1633376","title":"Shape Enumerators of Self-Dual NRT Codes over Finite Fields","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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":"Concordia University of Edmonton; University of Saskatchewan","funders":"Algoma University","keywords":"Mathematics; Finite field; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.013323530558958904,"score_gpt":0.25979826793906785,"score_spread":0.24647473738010894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404192098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9092648,0.00028213882,0.05833538,0.00085231045,0.00012272982,0.000051419967,0.00061652815,0.00040927192,0.030065415],"genre_scores_gemma":[0.97865933,0.00017381783,0.009685484,0.0001599911,0.00013319426,0.00007821474,0.00048650466,0.00012182536,0.010501659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901533,0.00019926934,0.00007252486,0.00012795767,0.00037157102,0.00021332758],"domain_scores_gemma":[0.99575007,0.0022728452,0.0006367037,0.0005539707,0.00047318102,0.0003132431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780332,0.0005615703,0.00065493,0.0017707708,0.0011738468,0.0023063298,0.0011862207,0.0011541685,0.0052891104],"category_scores_gemma":[0.004878891,0.00045710194,0.00073616265,0.0008958414,0.001542758,0.0020151378,0.001947627,0.0016461962,0.001072004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040046693,0.00009463335,0.001964299,0.00008943213,0.000022041944,0.0004024962,0.000571832,0.014941541,0.007999386,0.95367223,0.0023132719,0.017528398],"study_design_scores_gemma":[0.00006749978,0.000059622915,0.0009027483,0.00005393349,0.000018970119,0.00045260054,0.00012800038,0.07572325,0.0051679164,0.91540515,0.001977043,0.00004327883],"about_ca_topic_score_codex":0.0004997527,"about_ca_topic_score_gemma":0.0006496908,"teacher_disagreement_score":0.0052891104,"about_ca_system_score_codex":0.0012935288,"about_ca_system_score_gemma":0.0009275232,"threshold_uncertainty_score":0.017693818},"labels":[],"label_agreement":null},{"id":"W4405209865","doi":"10.1137/23m1609373","title":"Trimming Forests Is Hard (Unless They Are Made of Stars)","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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":"European Research Council; Israel Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Trimming; Stars; Mathematics; Combinatorics; Computer science; Astrophysics; Physics; Programming language","score_opus":0.041729635786186124,"score_gpt":0.31779594435036507,"score_spread":0.27606630856417896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405209865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6731144,0.0023123503,0.25703365,0.0078007677,0.0010444032,0.00021007148,0.0036173281,0.0029927217,0.05187425],"genre_scores_gemma":[0.846962,0.001217121,0.11662238,0.0017377262,0.00071733515,0.0001652261,0.0042270767,0.001011406,0.027339716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864453,0.00018668218,0.00010138137,0.00055016635,0.00025593053,0.00026125574],"domain_scores_gemma":[0.98370427,0.008523013,0.0015651506,0.0035512422,0.0009610674,0.0016952333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011103785,0.00096675893,0.0019607618,0.0010921005,0.002482697,0.0037227485,0.0027212908,0.003070323,0.016174074],"category_scores_gemma":[0.012821358,0.0012939705,0.0016931639,0.0018314535,0.0016529418,0.010769154,0.0028705674,0.0042801914,0.004180634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024997634,0.0014218915,0.013133237,0.0030679835,0.0006587576,0.0029605865,0.0013927363,0.09210985,0.045726243,0.38355598,0.11900044,0.33447245],"study_design_scores_gemma":[0.000058458067,0.00010883548,0.0018735708,0.00011147468,0.00006645611,0.0009577522,0.00041933233,0.051846713,0.007729952,0.92892396,0.007863265,0.00004012855],"about_ca_topic_score_codex":0.0008456273,"about_ca_topic_score_gemma":0.0012267716,"teacher_disagreement_score":0.016174074,"about_ca_system_score_codex":0.00051332614,"about_ca_system_score_gemma":0.0007200214,"threshold_uncertainty_score":0.054107666},"labels":[],"label_agreement":null},{"id":"W4405364433","doi":"10.1137/23m1548591","title":"On the Parameterized Complexity of Deletion to \\(\\boldsymbol{\\mathcal{H}}\\)-Free Strong Components","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Horizon 2020 Framework Programme","keywords":"Parameterized complexity; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.08969256280258837,"score_gpt":0.33928839582178805,"score_spread":0.2495958330191997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405364433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6743307,0.00089533225,0.25164744,0.008356266,0.00030486297,0.00038945966,0.0043150038,0.003042706,0.056718197],"genre_scores_gemma":[0.9256724,0.0005656969,0.043798693,0.0010641811,0.00030047607,0.00039036793,0.0043891044,0.0021827165,0.021636363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951207,0.0011709222,0.0002592311,0.0011375644,0.0012134106,0.001098095],"domain_scores_gemma":[0.9602979,0.030391566,0.0020770708,0.0042322488,0.0014398814,0.0015614188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029157735,0.0018577,0.0023928748,0.0019140526,0.003497928,0.009653704,0.0063735493,0.0033191151,0.030269781],"category_scores_gemma":[0.030006979,0.0015205678,0.0028356088,0.0034885542,0.004916185,0.021266717,0.0072057825,0.006737359,0.0030452483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016338958,0.0004752342,0.006220725,0.00064509606,0.00018116174,0.00033622797,0.0016483354,0.113937736,0.0060651703,0.8031886,0.02171786,0.043949872],"study_design_scores_gemma":[0.0001789662,0.000064108994,0.0011182146,0.000058665508,0.00013561976,0.00018730437,0.0003162073,0.13507749,0.0033614347,0.85589415,0.0035539719,0.00005390411],"about_ca_topic_score_codex":0.0051976284,"about_ca_topic_score_gemma":0.005810036,"teacher_disagreement_score":0.030269781,"about_ca_system_score_codex":0.005557175,"about_ca_system_score_gemma":0.003985129,"threshold_uncertainty_score":0.10126245},"labels":[],"label_agreement":null},{"id":"W4405475243","doi":"10.1137/24m169669x","title":"Corrigendum: Orthogonal Tree-Decompositions of Graphs","year":2024,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","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":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Australian Research Council; University of Ottawa","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","score_opus":0.031064065311332986,"score_gpt":0.3166621801442057,"score_spread":0.28559811483287273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405475243","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041509978,0.0033636633,0.0036701246,0.041825727,0.9243978,0.00004109194,0.0012117899,0.00063413946,0.02444054],"genre_scores_gemma":[0.026022024,0.018064156,0.014461906,0.05292236,0.453188,0.00029851487,0.005295934,0.003013163,0.4267339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964533,0.0008007203,0.00033044146,0.00063479645,0.0015528632,0.00022780734],"domain_scores_gemma":[0.98527217,0.0032558164,0.0003266373,0.001577205,0.008906239,0.0006618996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022587948,0.002405027,0.0022139782,0.005616914,0.003228638,0.004686315,0.003157494,0.003633883,0.09324079],"category_scores_gemma":[0.0282876,0.0010335451,0.002027588,0.005585487,0.0021748089,0.0041825417,0.0017282147,0.004862733,0.03836336],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016639347,0.000008546093,0.000031353735,0.00009183317,0.000008558735,0.000046355002,0.000012340668,0.00012237413,0.00004071673,0.0038031375,0.988214,0.007604102],"study_design_scores_gemma":[0.00004183862,0.000043493335,0.0012334763,0.00027802316,0.00008244781,0.00040030546,0.00008511538,0.0019216532,0.00047857928,0.032349642,0.96301323,0.000072239025],"about_ca_topic_score_codex":0.017806098,"about_ca_topic_score_gemma":0.024588563,"teacher_disagreement_score":0.09324079,"about_ca_system_score_codex":0.0049021575,"about_ca_system_score_gemma":0.002563553,"threshold_uncertainty_score":0.31192154},"labels":[],"label_agreement":null},{"id":"W4407258471","doi":"10.1137/23m1615218","title":"Group Connectivity in 3-Edge-Connected Signed Graphs","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Signed graph; Mathematics; Enhanced Data Rates for GSM Evolution; Group (periodic table); Discrete mathematics; Connectivity; Graph; Computer science; Telecommunications","score_opus":0.017141712302540874,"score_gpt":0.3026721765592732,"score_spread":0.28553046425673234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407258471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8709638,0.00022833428,0.104153454,0.00080483593,0.00009987857,0.00010922091,0.00045003282,0.00031689412,0.022873506],"genre_scores_gemma":[0.9776404,0.00026274723,0.016088186,0.00019385818,0.00006194934,0.00011705375,0.00051369437,0.0000736901,0.005048299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994752,0.00013747724,0.000034050725,0.00012454264,0.00013774731,0.00009101963],"domain_scores_gemma":[0.9964126,0.0015782841,0.00091241737,0.00026022448,0.00039642843,0.0004402281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367691,0.0004780575,0.0006188759,0.0017003306,0.0013203111,0.0023742702,0.0011113527,0.0015159601,0.008966867],"category_scores_gemma":[0.003987018,0.00040186048,0.00044219953,0.0015617835,0.0016225027,0.003067831,0.0013930472,0.0011613783,0.0007707069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007078898,0.0002660808,0.0053183693,0.00041084885,0.00006086211,0.00145956,0.0023044203,0.022805285,0.019867912,0.88178515,0.005576096,0.059437603],"study_design_scores_gemma":[0.00011269385,0.000114842136,0.002200992,0.000058534315,0.000040530416,0.00047971198,0.0008443093,0.051726554,0.0042978497,0.93541867,0.004671046,0.000034386925],"about_ca_topic_score_codex":0.00087874255,"about_ca_topic_score_gemma":0.00095018535,"teacher_disagreement_score":0.008966867,"about_ca_system_score_codex":0.0004916234,"about_ca_system_score_gemma":0.00042940388,"threshold_uncertainty_score":0.02999717},"labels":[],"label_agreement":null},{"id":"W4408874684","doi":"10.1137/24m1647692","title":"Dyadic Packing of Dijoins","year":2025,"lang":"es","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","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":"Mathematics; Combinatorics; Packing problems; Discrete mathematics","score_opus":0.011752683129922774,"score_gpt":0.2671095122186709,"score_spread":0.2553568290887481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408874684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49090073,0.0018748605,0.3542295,0.001092688,0.00091010577,0.00017842975,0.002095743,0.00084344676,0.1478745],"genre_scores_gemma":[0.82031626,0.001239428,0.109888166,0.00034862285,0.00019959314,0.00016245435,0.002966181,0.0006544962,0.06422484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989531,0.0001830325,0.00007809073,0.0002369823,0.0002538708,0.00029482803],"domain_scores_gemma":[0.9980003,0.00059110497,0.00020341347,0.00041664098,0.00036686426,0.00042162903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046587604,0.0008098597,0.0017543914,0.0018749009,0.002099875,0.0039122324,0.0014363163,0.0014899592,0.02014484],"category_scores_gemma":[0.0036174583,0.0008133182,0.0006654118,0.0038998502,0.0010830046,0.0028921375,0.0030694196,0.0019441618,0.0029086347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001119585,0.00042101758,0.0037755163,0.00048223915,0.00009193892,0.0013528608,0.0006441983,0.08491494,0.010584951,0.7739525,0.028746968,0.09391334],"study_design_scores_gemma":[0.00009097001,0.00022609218,0.0026153107,0.00014617611,0.00006496066,0.0011427997,0.0014116026,0.43250772,0.0071421643,0.50259894,0.051971365,0.00008183511],"about_ca_topic_score_codex":0.0033128443,"about_ca_topic_score_gemma":0.0038812398,"teacher_disagreement_score":0.02014484,"about_ca_system_score_codex":0.0011250853,"about_ca_system_score_gemma":0.000636587,"threshold_uncertainty_score":0.06739122},"labels":[],"label_agreement":null},{"id":"W4411003246","doi":"10.1137/24m1701022","title":"A Bounded Diameter Strengthening of Kőnig’s Theorem","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Polynomial and algebraic computation","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":"University of Waterloo","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Agencia Nacional de Investigación y Desarrollo; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Mathematics; Bounded function; Discrete mathematics; Combinatorics; Bounded inverse theorem; Bounded operator; Mathematical analysis","score_opus":0.011800303759493544,"score_gpt":0.2605877890637624,"score_spread":0.24878748530426886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411003246","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.13333948,0.00873798,0.3621951,0.0428521,0.004385271,0.00021746078,0.0026753093,0.0033233727,0.44227394],"genre_scores_gemma":[0.8399985,0.00584721,0.07992892,0.013057514,0.0039366963,0.00045651582,0.0016292002,0.002075071,0.053070277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961359,0.0006870014,0.00015437695,0.0013672456,0.00093693705,0.0007185157],"domain_scores_gemma":[0.9842845,0.009251034,0.0007575111,0.0028025575,0.001645885,0.0012585724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328033,0.0022666513,0.0031504342,0.002793735,0.0039085806,0.004678011,0.005550443,0.0037832698,0.01952796],"category_scores_gemma":[0.016501743,0.0013807281,0.0033510828,0.002333387,0.0054027042,0.019115657,0.012538418,0.010310698,0.004134304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028726365,0.00008683802,0.0007663958,0.00041587828,0.00007010895,0.00034984527,0.0003985333,0.0031266192,0.0065094833,0.95449543,0.018822756,0.01467076],"study_design_scores_gemma":[0.000092323615,0.000067030494,0.0009537696,0.000078315185,0.000082258615,0.00036028767,0.0001544102,0.015038502,0.0026068653,0.95857394,0.021934645,0.000057522295],"about_ca_topic_score_codex":0.0022660443,"about_ca_topic_score_gemma":0.0013713242,"teacher_disagreement_score":0.01952796,"about_ca_system_score_codex":0.0029207713,"about_ca_system_score_gemma":0.0011201751,"threshold_uncertainty_score":0.065327585},"labels":[],"label_agreement":null},{"id":"W4413064234","doi":"10.1137/24m1714964","title":"Canonical Ramsey Numbers of Sparse Graphs","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"ETH Zürich Foundation; Walter Haefner Stiftung; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Ramsey theory; Discrete mathematics; Graph","score_opus":0.0246427114099926,"score_gpt":0.32349596086883387,"score_spread":0.2988532494588413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413064234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7222463,0.0009518501,0.12714386,0.0036577124,0.00041593047,0.00008596636,0.0008141756,0.00049031,0.144194],"genre_scores_gemma":[0.97096115,0.0006106689,0.0138379885,0.00032277545,0.0002987475,0.0001142702,0.00036163945,0.00013055519,0.013362122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.0002547993,0.000038410355,0.00019404932,0.0002005969,0.00017629597],"domain_scores_gemma":[0.995948,0.0019662671,0.00050186407,0.00031716062,0.00052584836,0.0007408632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011892584,0.0006101595,0.00071393343,0.002777773,0.0018311823,0.003930282,0.0012100996,0.00094673375,0.0112796575],"category_scores_gemma":[0.0069902153,0.00066354685,0.0005534495,0.0016998652,0.0029773656,0.0066806166,0.0024369701,0.0020978604,0.0010168629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003604114,0.000016748561,0.00028103168,0.00002220621,0.0000035640905,0.000024608436,0.00015679032,0.00085300434,0.00031831308,0.99409795,0.0013480661,0.0028417578],"study_design_scores_gemma":[0.000009676092,0.0000071110626,0.00019228263,0.000008468355,0.0000041499356,0.000057145946,0.0000972778,0.0047514113,0.00025528565,0.9934301,0.0011789382,0.00000803539],"about_ca_topic_score_codex":0.00082142657,"about_ca_topic_score_gemma":0.001450233,"teacher_disagreement_score":0.0112796575,"about_ca_system_score_codex":0.0011566861,"about_ca_system_score_gemma":0.00080938835,"threshold_uncertainty_score":0.03773427},"labels":[],"label_agreement":null}]}