{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011124085,0.00022735355,0.9846927,0.001086612,0.0004154468,0.0011753519,0.000034420635,0.00008777588,0.0011562501],"genre_scores_gemma":[0.62320095,0.00006504779,0.37517682,0.0004182479,0.00059927866,0.0001859872,0.000003974443,0.000067940615,0.00028174065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972122,0.00021669467,0.00057192607,0.00028941908,0.00082124973,0.00088856765],"domain_scores_gemma":[0.9961472,0.0019758155,0.00036919347,0.0009700896,0.00016509597,0.000372602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029878768,0.0003014987,0.000364853,0.00016032696,0.00070873054,0.00035522066,0.0015959673,0.000077022894,0.000027698388],"category_scores_gemma":[0.0002324825,0.00017568009,0.00033421212,0.00040629352,0.00019672087,0.00054050225,0.00021563472,0.00069178664,0.00005652506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016186139,0.0016092521,0.0005225351,0.00017521181,0.00025802213,0.000019028425,0.0048490167,0.0007743911,0.00022365576,0.8359599,0.00649581,0.14895134],"study_design_scores_gemma":[0.0018756454,0.0017503275,0.0012523885,0.00021730078,0.00005735814,0.00035129528,0.00075533474,0.16568424,0.0015785178,0.81264776,0.013102099,0.00072772393],"about_ca_topic_score_codex":0.0000011628752,"about_ca_topic_score_gemma":0.0000011060058,"teacher_disagreement_score":0.6120769,"about_ca_system_score_codex":0.00011432554,"about_ca_system_score_gemma":0.00007487612,"threshold_uncertainty_score":0.71640265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026522402,0.0005583236,0.96956635,0.0007285089,0.0006444801,0.0011747364,0.00013292898,0.0001162938,0.0005559599],"genre_scores_gemma":[0.52677965,0.00024881112,0.472083,0.00009162361,0.00020389611,0.000111842506,0.00002636201,0.00012257493,0.00033224642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482816,0.00029687595,0.0017509647,0.0007559119,0.0014495042,0.0009185993],"domain_scores_gemma":[0.9936701,0.0012821442,0.0019988483,0.001844635,0.00074231974,0.00046197083],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002098591,0.00076213886,0.0013731795,0.0008560256,0.0003062898,0.0005252218,0.0036150897,0.00048581662,0.00004702473],"category_scores_gemma":[0.00069316564,0.00057722,0.00094779476,0.0005158935,0.00041641959,0.00038209988,0.0014314362,0.002608674,0.000019447447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012713316,0.00054595264,0.000015399703,0.0017882085,0.00056722376,0.000061617066,0.0032571978,0.018788716,0.00026921585,0.95862603,0.0007564579,0.015196838],"study_design_scores_gemma":[0.00085058267,0.0010205257,0.000007333133,0.0015678188,0.00005881505,0.00016995636,0.00043940998,0.21945572,0.0015803782,0.7740371,0.00028613594,0.0005262226],"about_ca_topic_score_codex":0.000005947821,"about_ca_topic_score_gemma":0.0000048183188,"teacher_disagreement_score":0.50025725,"about_ca_system_score_codex":0.00014990111,"about_ca_system_score_gemma":0.00036987755,"threshold_uncertainty_score":0.9996923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9280582,0.00005604411,0.06374734,0.0041840784,0.00013919368,0.00033932488,0.0000018215804,0.00008580936,0.0033882135],"genre_scores_gemma":[0.92576635,0.000035188197,0.073079675,0.00091224536,0.000006152798,0.00000786932,3.9423918e-7,0.000020352629,0.00017176103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823433,0.00010560614,0.00045752875,0.00020517033,0.0006956763,0.0003016824],"domain_scores_gemma":[0.99795276,0.00037183327,0.00047523054,0.0007184821,0.00032416967,0.00015755022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084237236,0.00021707898,0.00028391992,0.00015396473,0.0002605485,0.00023716156,0.0008245114,0.00006083285,0.00004740983],"category_scores_gemma":[0.00012861557,0.00010661581,0.00012984067,0.00041538067,0.00013077717,0.00021080615,0.00010261635,0.00044674744,0.00008228142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010074937,0.00016830975,0.00008259999,0.00003892644,0.000057804973,0.00001570071,0.0010749439,0.00017442662,0.0010740618,0.99400973,0.0027606383,0.0005327913],"study_design_scores_gemma":[0.00034190857,0.0006397748,0.0001367165,0.00051527016,0.000019193936,0.0001518308,0.00020053411,0.010649684,0.004168018,0.98294735,0.00004553275,0.00018421355],"about_ca_topic_score_codex":0.000011447287,"about_ca_topic_score_gemma":0.000001321061,"teacher_disagreement_score":0.011062398,"about_ca_system_score_codex":0.000017890787,"about_ca_system_score_gemma":0.000054294323,"threshold_uncertainty_score":0.43476665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29563418,0.00050514116,0.67200875,0.002362505,0.0008662478,0.0022924172,0.00006646607,0.00013149377,0.026132803],"genre_scores_gemma":[0.9600061,0.00008026252,0.038366165,0.00014252753,0.00015486743,0.00007686936,0.0000024388246,0.000071341485,0.00109941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998205,0.00012355109,0.0007688411,0.00016346316,0.0004360495,0.0003030614],"domain_scores_gemma":[0.9945156,0.0037764832,0.0006842064,0.0007148694,0.00019172161,0.00011712218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025215659,0.00023899676,0.00048764294,0.0001926973,0.00046587017,0.00010112406,0.00059360306,0.00009506623,0.00010825937],"category_scores_gemma":[0.0014311394,0.0001404511,0.00056659424,0.00048431297,0.00022470542,0.00008897207,0.0000394675,0.00029852823,0.000015710222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010874022,0.00024381233,0.000009960366,0.0001534005,0.00017041372,5.862956e-7,0.000560912,0.00003639281,0.000491201,0.99384266,0.0037098823,0.0006720526],"study_design_scores_gemma":[0.0015119633,0.00025845863,0.0000137706975,0.00015977243,0.00025900203,0.000051244064,0.00054026465,0.0018759386,0.0022228,0.9843636,0.008559395,0.00018375905],"about_ca_topic_score_codex":7.421162e-7,"about_ca_topic_score_gemma":0.0000011227395,"teacher_disagreement_score":0.6643719,"about_ca_system_score_codex":0.000021791602,"about_ca_system_score_gemma":0.000029091038,"threshold_uncertainty_score":0.57274294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30323017,0.00019284592,0.6772235,0.0013787358,0.0002976498,0.00035089193,0.000006692075,0.000121609155,0.017197886],"genre_scores_gemma":[0.84194976,0.000048210364,0.1572005,0.00011435307,0.000053682223,0.0000030863914,7.5017425e-7,0.00002121142,0.0006084342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974391,0.00014724968,0.00072199036,0.00024484063,0.00096127344,0.00048557538],"domain_scores_gemma":[0.99801373,0.00030132424,0.00046767664,0.00079657655,0.00016118177,0.00025952203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000958407,0.00024974384,0.00044021293,0.00022987359,0.00017585051,0.00018615964,0.0012650489,0.00007786487,0.00010704635],"category_scores_gemma":[0.00025177875,0.00018911359,0.00027440564,0.0006710815,0.0001256355,0.00053379074,0.00012842046,0.00051695807,0.00014669112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026390282,0.00044048394,0.000055339726,0.0001169275,0.000072101175,0.00011148882,0.0025569985,0.0005822236,0.0027561754,0.98415494,0.0005461089,0.00858084],"study_design_scores_gemma":[0.0005799631,0.0004876833,0.00040499453,0.00039367637,0.000015050266,0.0011472786,0.00027076225,0.01803291,0.005185787,0.9731222,0.00007103425,0.0002886855],"about_ca_topic_score_codex":3.036821e-7,"about_ca_topic_score_gemma":1.5246991e-7,"teacher_disagreement_score":0.5387196,"about_ca_system_score_codex":0.000053209696,"about_ca_system_score_gemma":0.00007151784,"threshold_uncertainty_score":0.77118284},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03660376,0.0000805484,0.94818306,0.0015755241,0.00021757068,0.000110229055,0.0000014003771,0.00007230979,0.013155604],"genre_scores_gemma":[0.48287192,0.00003429873,0.5146014,0.001061831,0.00034685124,0.0000024610158,0.0000035015826,0.000011606531,0.0010661122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989257,0.000037919304,0.00026869006,0.00016283155,0.00039943162,0.00020543954],"domain_scores_gemma":[0.9991477,0.00008749208,0.0001936648,0.0002598722,0.00017565569,0.00013562775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030965614,0.00014775092,0.00015943918,0.00013261713,0.0001832415,0.0003414087,0.00042166427,0.000035975274,0.000021715736],"category_scores_gemma":[0.00006192135,0.00009953613,0.000071710805,0.00028453587,0.00001600113,0.00027668563,0.000028668674,0.00019666222,0.00010360181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067725225,0.0008140695,0.000050689865,0.000071330884,0.00009871404,0.0003479006,0.0029111635,0.018222343,0.00224691,0.8460146,0.004586905,0.12456763],"study_design_scores_gemma":[0.0028767427,0.007399766,0.003803334,0.0010001722,0.00007634787,0.003512421,0.00028598512,0.44321048,0.0069168806,0.50591975,0.02345284,0.0015452632],"about_ca_topic_score_codex":1.6079974e-7,"about_ca_topic_score_gemma":5.805516e-7,"teacher_disagreement_score":0.44626817,"about_ca_system_score_codex":0.000033025728,"about_ca_system_score_gemma":0.000070108785,"threshold_uncertainty_score":0.40589657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3273225,0.0037251061,0.5896918,0.0037949076,0.0066570262,0.003434835,0.0005006079,0.00071045844,0.06416271],"genre_scores_gemma":[0.9959467,0.00008305152,0.002330504,0.00011775717,0.00061636156,0.000056989313,0.0000045603965,0.0000594254,0.0007846686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.000025303505,0.00039607505,0.000101125406,0.00029090198,0.00029560144],"domain_scores_gemma":[0.99918485,0.00029357386,0.00012332585,0.00026178596,0.000030484944,0.00010596463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048787583,0.00020317997,0.00022793606,0.00004835302,0.00022586453,0.00018056607,0.00028415755,0.00007312617,0.00016381768],"category_scores_gemma":[0.00002190579,0.00012659456,0.00020630701,0.00007073133,0.000035283778,0.00012943924,0.000016329765,0.0002620917,0.000089227164],"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.00033344602,0.00077696634,0.000024720051,0.0007762656,0.0028887747,0.000048004793,0.02108455,0.6997849,0.012591443,0.12541501,0.12466043,0.011615519],"study_design_scores_gemma":[0.0035239984,0.0008052998,0.00006552682,0.0015559507,0.0004693636,0.00021128583,0.0067712194,0.4596868,0.0119218975,0.25292587,0.2607005,0.0013622917],"about_ca_topic_score_codex":6.621501e-7,"about_ca_topic_score_gemma":0.0000027330943,"teacher_disagreement_score":0.66862416,"about_ca_system_score_codex":0.00009559267,"about_ca_system_score_gemma":0.000013152473,"threshold_uncertainty_score":0.5162377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70208555,0.00047456226,0.26741263,0.0011119458,0.001429754,0.0027357512,0.00014255113,0.00022761039,0.024379633],"genre_scores_gemma":[0.9989595,0.000040399693,0.0005525667,0.000086202424,0.00019515028,0.000059466165,0.0000034206635,0.000055962177,0.00004732074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985688,0.00018173706,0.00046775411,0.00012519088,0.00036091285,0.00029566055],"domain_scores_gemma":[0.9977149,0.0014289321,0.00027803096,0.00044532318,0.00005912121,0.000073697964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008954,0.00024622522,0.0002990053,0.00008450177,0.00034984088,0.00011557024,0.00048130166,0.000068368776,0.00003265098],"category_scores_gemma":[0.00014172215,0.00012071791,0.00020530843,0.00013723271,0.00007933282,0.00008998341,0.000013998737,0.00038066713,0.0000071359286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035119144,0.0004090144,0.0000652991,0.0009882988,0.0013336029,0.0000047655726,0.024803367,0.020999767,0.013135996,0.9194536,0.006871589,0.011583481],"study_design_scores_gemma":[0.0032517472,0.0040521775,0.00022946489,0.0029538656,0.000652383,0.00024893045,0.05627082,0.23492314,0.08636868,0.5948156,0.014740826,0.0014923619],"about_ca_topic_score_codex":0.0000011480543,"about_ca_topic_score_gemma":0.0000023831467,"teacher_disagreement_score":0.324638,"about_ca_system_score_codex":0.000033213848,"about_ca_system_score_gemma":0.000008922759,"threshold_uncertainty_score":0.49227333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012020696,0.000111176865,0.97492313,0.005517454,0.0003597387,0.00033765179,0.000015712323,0.00006640935,0.006648037],"genre_scores_gemma":[0.47010735,0.00014642799,0.5281843,0.0005803985,0.00038573318,0.00003581896,0.000003987055,0.000028176755,0.00052783155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986283,0.00003708856,0.00040182096,0.00021578636,0.00041649173,0.00030051678],"domain_scores_gemma":[0.9986921,0.0003394795,0.00026086185,0.0004014871,0.0001297595,0.00017633747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002838716,0.00016022143,0.00019262145,0.00018446326,0.0002985039,0.0003841442,0.00069174485,0.000041341937,0.000026418224],"category_scores_gemma":[0.0001145455,0.00011804675,0.00024197147,0.00023290755,0.000049179784,0.00044362352,0.00008917747,0.00021364458,0.000047301557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027414548,0.00074194814,0.00008986601,0.00009102232,0.00027844045,0.000054946042,0.0076112007,0.008287209,0.00025502295,0.90204763,0.007704546,0.07281078],"study_design_scores_gemma":[0.0020758596,0.0006144243,0.0004920856,0.00037056368,0.00006930759,0.00060636137,0.00057100743,0.27225226,0.008877366,0.6888581,0.024565062,0.00064757303],"about_ca_topic_score_codex":0.0000011284617,"about_ca_topic_score_gemma":0.0000037276504,"teacher_disagreement_score":0.45808664,"about_ca_system_score_codex":0.000050169034,"about_ca_system_score_gemma":0.000046238787,"threshold_uncertainty_score":0.48138067},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70451486,0.00021098749,0.19969444,0.0021072186,0.0000851994,0.001129385,0.00023450017,0.00002735917,0.09199608],"genre_scores_gemma":[0.97491556,0.000009501436,0.024475085,0.000057592213,0.00008919516,0.0000840527,0.0000016295512,0.000017558106,0.00034982592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998833,0.000034239,0.00056126557,0.000093547365,0.00031906422,0.00015885425],"domain_scores_gemma":[0.9983894,0.0005839291,0.0005467624,0.00032793186,0.00008712965,0.00006481415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033034958,0.00015903106,0.00039843863,0.000037598063,0.00011631947,0.000024271872,0.0003091981,0.000023087543,0.00085089606],"category_scores_gemma":[0.00003679469,0.000081247184,0.00034601812,0.00012673005,0.00013691824,0.00006913879,0.000033140255,0.00021839286,0.000026580383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060047855,0.00029913895,0.0000065253757,0.000017193963,0.00020735832,2.782172e-7,0.00024285476,0.00036469122,0.0012473938,0.9957408,0.00013800061,0.0017298177],"study_design_scores_gemma":[0.00018752743,0.00014596213,0.000016721595,0.000100365774,0.0004953162,0.0000044609315,0.0016611639,0.00044964725,0.014623025,0.9809904,0.0011988229,0.00012655785],"about_ca_topic_score_codex":0.000001271534,"about_ca_topic_score_gemma":1.4599435e-7,"teacher_disagreement_score":0.27040073,"about_ca_system_score_codex":0.00001146798,"about_ca_system_score_gemma":0.000025426974,"threshold_uncertainty_score":0.9316715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031929165,0.00009425406,0.9482208,0.00012021787,0.00023441594,0.0003547909,0.000008319016,0.00005662066,0.018981414],"genre_scores_gemma":[0.74085915,0.00005211689,0.25869334,0.000040162347,0.00005020345,0.000018124203,4.3559965e-7,0.000027977414,0.00025847886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830014,0.00007719337,0.0005241359,0.00020438214,0.0004856908,0.00040843678],"domain_scores_gemma":[0.9980901,0.00048874796,0.00041487158,0.00059362996,0.000231192,0.00018146582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012766744,0.0001804245,0.00031768603,0.00026221643,0.00019206807,0.00009853444,0.0013780063,0.00005588729,0.00004403662],"category_scores_gemma":[0.00032580347,0.00013209731,0.00025762885,0.00035693735,0.00016484591,0.00037391324,0.00016854791,0.0002842776,0.000010134479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057654062,0.00013384575,0.000082165134,0.0000945796,0.000051963176,0.000014306891,0.0025753218,0.00002099097,0.0008364839,0.994263,0.00007891993,0.0017907693],"study_design_scores_gemma":[0.00048002522,0.00071112224,0.00010356447,0.00021285945,0.000013505969,0.00009308402,0.00039554486,0.005017353,0.01777364,0.9746616,0.00035057758,0.00018711359],"about_ca_topic_score_codex":6.562782e-7,"about_ca_topic_score_gemma":0.0000011208024,"teacher_disagreement_score":0.70893,"about_ca_system_score_codex":0.000033000128,"about_ca_system_score_gemma":0.00005239067,"threshold_uncertainty_score":0.53867716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7363089,0.00007712669,0.260672,0.00045272388,0.00011824725,0.00013248426,0.0000032555402,0.000026737625,0.0022085442],"genre_scores_gemma":[0.97651404,0.00006828862,0.02322227,0.00006492776,0.000025544075,0.0000032436958,4.843771e-7,0.000014309187,0.000086902415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987071,0.00012827375,0.00034755148,0.00019101804,0.00041459728,0.00021141993],"domain_scores_gemma":[0.9985978,0.000598682,0.0002663785,0.00028318758,0.000097604825,0.00015631909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647379,0.00014600743,0.00025531297,0.00024848137,0.00018342766,0.0002076899,0.00037115475,0.00004253591,0.000008979866],"category_scores_gemma":[0.00038002594,0.00011257099,0.00006410423,0.00019990058,0.00019751742,0.00030075497,0.00014994633,0.000324882,0.0000033227657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034028344,0.00006917773,0.00014950009,0.00012071793,0.000024973748,0.000014366432,0.0020184396,0.00007995841,0.0013647198,0.9897522,0.00004488621,0.006327032],"study_design_scores_gemma":[0.0006788462,0.0012351298,0.0006487974,0.0005184265,0.000013293022,0.00029470742,0.0003010822,0.059524007,0.0022821946,0.93418854,0.00011900602,0.00019597725],"about_ca_topic_score_codex":0.0000010783002,"about_ca_topic_score_gemma":0.0000018593988,"teacher_disagreement_score":0.24020515,"about_ca_system_score_codex":0.000023867327,"about_ca_system_score_gemma":0.000014794501,"threshold_uncertainty_score":0.4590512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60089934,0.000054013803,0.3916607,0.00074004394,0.00023470884,0.00027464653,0.000003954384,0.00009188792,0.006040683],"genre_scores_gemma":[0.97205615,0.00004716553,0.02741978,0.00021168549,0.000038755923,0.000010364729,0.0000018911041,0.000022074773,0.00019211092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724555,0.00045295022,0.0005643307,0.00034839107,0.0008049104,0.0005838494],"domain_scores_gemma":[0.9976609,0.0011646132,0.0003167126,0.00055664027,0.00007661004,0.00022452649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021195265,0.0002649469,0.0003846565,0.00046674145,0.0002612203,0.00029302906,0.0011045168,0.00010928829,0.00004084373],"category_scores_gemma":[0.0006758099,0.00019031142,0.00016586528,0.00055206224,0.00014942151,0.00047008277,0.00016225548,0.0008156512,0.000110304136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046176225,0.00020924745,0.00037967632,0.000044387663,0.000024614574,0.000096308475,0.0012048933,0.005767493,0.00054939894,0.98639905,0.00013973074,0.0051390207],"study_design_scores_gemma":[0.0006807174,0.0009312341,0.0012811226,0.00029090306,0.0000054699103,0.00015819639,0.00033347413,0.044119865,0.0019522004,0.9497832,0.0001678359,0.00029579495],"about_ca_topic_score_codex":9.319432e-7,"about_ca_topic_score_gemma":0.0000034405002,"teacher_disagreement_score":0.3711568,"about_ca_system_score_codex":0.00009348913,"about_ca_system_score_gemma":0.000031920434,"threshold_uncertainty_score":0.77606744},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21320868,0.000108843655,0.7762238,0.0028650893,0.0003573731,0.00020214531,0.0000046297055,0.00005301952,0.006976469],"genre_scores_gemma":[0.79271024,0.000013855622,0.20653933,0.0002606041,0.00009772755,0.0000063609705,0.0000043209584,0.000011424511,0.00035611904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876493,0.00006367753,0.00031499812,0.00014233855,0.0005224045,0.00019167503],"domain_scores_gemma":[0.9992175,0.0001032602,0.00015535299,0.0002038137,0.00014802565,0.0001720375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064424565,0.00012680615,0.00017198712,0.00019993326,0.0000907117,0.0002937094,0.000329453,0.00003275965,0.000015921654],"category_scores_gemma":[0.000089810645,0.000091532995,0.00004300668,0.0003685321,0.000026952705,0.00042408114,0.000065809014,0.00021994516,0.00003741203],"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.00021336919,0.0015547795,0.0015917481,0.00019127724,0.00016789511,0.0009786561,0.031037545,0.22491677,0.0002805522,0.7114198,0.012482059,0.0151655255],"study_design_scores_gemma":[0.003900116,0.001666298,0.0024136214,0.000620725,0.000028237355,0.002776856,0.0034336327,0.69923526,0.0019669363,0.27963474,0.0035000455,0.0008235176],"about_ca_topic_score_codex":0.0000024244418,"about_ca_topic_score_gemma":0.000013367147,"teacher_disagreement_score":0.57950157,"about_ca_system_score_codex":0.00009452562,"about_ca_system_score_gemma":0.0002018869,"threshold_uncertainty_score":0.37326074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037515704,0.00061877316,0.9425919,0.0006861399,0.0008268535,0.000253358,0.000007861542,0.00015478561,0.01734464],"genre_scores_gemma":[0.8371521,0.0001992495,0.16042048,0.00029436627,0.00035239814,0.000017250637,0.0000019791771,0.00005919122,0.001502963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712944,0.00017656028,0.0005411655,0.0002192674,0.0010566328,0.00087692885],"domain_scores_gemma":[0.9980198,0.000340091,0.00032868626,0.00073106424,0.00011641503,0.0004639024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013438502,0.00028417332,0.00033490622,0.0004203798,0.0003805479,0.0003721354,0.0014315431,0.000082696395,0.000078531084],"category_scores_gemma":[0.00015574266,0.00021518813,0.00023581178,0.00033896204,0.00013647856,0.0011474912,0.00019275944,0.0006427185,0.00019724206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001743013,0.00016883931,0.00021651125,0.00004395419,0.00006403457,0.00005898933,0.0028392668,0.00003720285,0.0006318915,0.99379534,0.0007379951,0.0013885443],"study_design_scores_gemma":[0.00057977164,0.0003384002,0.0005093721,0.00020704893,0.000023712222,0.0007390095,0.001343398,0.004073199,0.002634085,0.98626256,0.002778577,0.00051085197],"about_ca_topic_score_codex":7.752477e-7,"about_ca_topic_score_gemma":5.615473e-7,"teacher_disagreement_score":0.7996364,"about_ca_system_score_codex":0.00007778981,"about_ca_system_score_gemma":0.000047934926,"threshold_uncertainty_score":0.87751174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2257147,0.000119765784,0.7699682,0.00094512553,0.00021119967,0.00022506036,0.0000032088394,0.00012130189,0.0026914412],"genre_scores_gemma":[0.94641227,0.0000419384,0.053058818,0.0002961748,0.00011840247,0.000009785254,0.000003198952,0.000023259365,0.000036161677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979375,0.00006186565,0.00045244378,0.00027304183,0.0009093012,0.00036581967],"domain_scores_gemma":[0.9986773,0.0001229388,0.0004309662,0.0004351989,0.00017923568,0.00015434928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012470204,0.00022979706,0.00023220733,0.00050826016,0.0008111668,0.00041147738,0.00064315525,0.000052045754,0.00004690635],"category_scores_gemma":[0.00008084383,0.00017941483,0.0001640713,0.0011935759,0.000052603482,0.0006959268,0.00013581496,0.0004317443,0.00002569647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005480823,0.00055312546,0.00047017675,0.00017184815,0.00040940143,0.00007393663,0.003498856,0.010883077,0.0007570999,0.9697573,0.00021765374,0.013152724],"study_design_scores_gemma":[0.0038624369,0.004353733,0.0019462857,0.0014467187,0.00040490468,0.0008399149,0.0018911461,0.015088338,0.0020491155,0.9633928,0.0037112145,0.0010134195],"about_ca_topic_score_codex":0.000003613948,"about_ca_topic_score_gemma":0.0000016220971,"teacher_disagreement_score":0.7206976,"about_ca_system_score_codex":0.0001597461,"about_ca_system_score_gemma":0.00011546962,"threshold_uncertainty_score":0.7316324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579621,0.00039668437,0.036145322,0.0005271296,0.00019705876,0.00015339852,0.0000028798804,0.0000902892,0.0045251353],"genre_scores_gemma":[0.9722379,0.00027895978,0.027074106,0.00010742872,0.000086410764,0.000003803121,0.0000014628656,0.000026719821,0.00018322187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993422,0.000010570636,0.00026086826,0.00006548715,0.00016358068,0.0001572617],"domain_scores_gemma":[0.99961257,0.000059160546,0.000065778164,0.00011274432,0.000040868967,0.00010887539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006539368,0.00012975969,0.0001789924,0.00007229904,0.000079579295,0.00020532604,0.00008121335,0.00008696729,0.0003258128],"category_scores_gemma":[0.000040781106,0.00008918219,0.00005817976,0.00010276383,0.000021328373,0.00014318705,0.000013448905,0.00036408324,0.00006910898],"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.000007435933,0.000073687355,0.00054900686,0.0006029102,0.00063199346,0.00004156873,0.005008929,0.9404528,0.0018110477,0.010442266,0.015091062,0.025287284],"study_design_scores_gemma":[0.0001992834,0.000053887783,0.0010354067,0.00019947035,0.000054100205,0.00010267841,0.00049802277,0.9720654,0.000256277,0.025122056,0.0001957217,0.0002176802],"about_ca_topic_score_codex":8.37563e-7,"about_ca_topic_score_gemma":4.1834213e-7,"teacher_disagreement_score":0.03161261,"about_ca_system_score_codex":0.000021106804,"about_ca_system_score_gemma":0.0000030908266,"threshold_uncertainty_score":0.3636744},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016161993,0.0003630472,0.971591,0.00062248856,0.0011200238,0.00020365449,4.987309e-7,0.000047617024,0.00988968],"genre_scores_gemma":[0.9829049,0.000033313903,0.016212022,0.00006029572,0.0005416786,0.00000593214,4.2298896e-7,0.000013658118,0.00022778433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803555,0.0001622224,0.0008676402,0.00016624806,0.00044210732,0.00032621305],"domain_scores_gemma":[0.99804366,0.000498949,0.00064937863,0.0005469146,0.00019315702,0.00006795595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018940698,0.00016053078,0.00027192183,0.000054375636,0.00041765213,0.0004249057,0.0008292775,0.00007954849,0.00000888725],"category_scores_gemma":[0.00008005593,0.00009213852,0.00022128884,0.00024628273,0.000072989234,0.00019070755,0.000106725485,0.00039440248,0.000008874417],"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.000012823152,0.00021006673,0.00031141355,0.00009143799,0.000062132356,0.00001714022,0.0006281951,0.081311375,0.00007465741,0.9075996,0.001733454,0.007947676],"study_design_scores_gemma":[0.0001890558,0.0001686769,0.00010795051,0.00024771466,0.000008753935,0.00018526269,0.00009104414,0.8413509,0.000091762624,0.15573591,0.0016916585,0.00013127885],"about_ca_topic_score_codex":0.0000033902331,"about_ca_topic_score_gemma":0.000032734406,"teacher_disagreement_score":0.9667429,"about_ca_system_score_codex":0.00006229582,"about_ca_system_score_gemma":0.000037562993,"threshold_uncertainty_score":0.40973756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021934073,0.0036094624,0.93573564,0.002854515,0.0018323859,0.00088692683,0.000012327482,0.00016016372,0.032974474],"genre_scores_gemma":[0.9848633,0.00061435887,0.010677551,0.0001086958,0.00033306307,0.000050461986,0.0000017340174,0.000037124737,0.00331375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976295,0.00013356167,0.0008295285,0.00023474642,0.0006268904,0.00054572977],"domain_scores_gemma":[0.99842614,0.00021433589,0.00043403465,0.0006482297,0.00010951522,0.00016772586],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013018042,0.0002277237,0.00033499982,0.000095200005,0.00039513936,0.0011781533,0.0013079148,0.00007739885,0.0000052123737],"category_scores_gemma":[0.000066199565,0.00013479551,0.00011978306,0.0004636626,0.00006795276,0.00036218064,0.00010536242,0.0004685799,0.00012875238],"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.00002648356,0.00039180665,0.0005786498,0.00021673358,0.00009178919,0.000844835,0.0031281686,0.0073011206,0.00012415886,0.94714695,0.0056657274,0.03448357],"study_design_scores_gemma":[0.0029802516,0.00091715116,0.0015031734,0.0044523166,0.000031502364,0.011040901,0.0034735426,0.5597692,0.0000640375,0.06630234,0.34804255,0.0014230474],"about_ca_topic_score_codex":0.000009446953,"about_ca_topic_score_gemma":0.0000054623633,"teacher_disagreement_score":0.9629292,"about_ca_system_score_codex":0.00015781654,"about_ca_system_score_gemma":0.00008498667,"threshold_uncertainty_score":0.99985874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030149953,0.0004289828,0.95493746,0.0018031927,0.0007246377,0.00019171272,0.0000072558537,0.00019652756,0.011560262],"genre_scores_gemma":[0.8627269,0.000039718543,0.13599502,0.00028899367,0.00016821238,0.000010772834,0.0000027478134,0.000023170858,0.0007444345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984948,0.0000900577,0.00036913963,0.00015390184,0.00039698114,0.000495132],"domain_scores_gemma":[0.99850553,0.0002790305,0.00031856535,0.0005348143,0.00009057969,0.00027144872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007716177,0.00018772791,0.0002101849,0.00013664302,0.00046682506,0.00026339298,0.0006431373,0.000060452436,0.000077017605],"category_scores_gemma":[0.000092215196,0.00012806505,0.00009106779,0.00038511964,0.00008082365,0.0010118681,0.00011490978,0.0003879073,0.00028674395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007413541,0.00031113316,0.00045439778,0.000026129515,0.00006459183,0.000018811887,0.003951367,0.00024328312,0.0001133361,0.98698664,0.0044467016,0.0033761917],"study_design_scores_gemma":[0.0050922437,0.0024767732,0.01564725,0.004388787,0.00045778957,0.013652336,0.006512925,0.29624048,0.0015397385,0.5804958,0.06938514,0.0041107256],"about_ca_topic_score_codex":8.8180917e-7,"about_ca_topic_score_gemma":0.0000010804563,"teacher_disagreement_score":0.832577,"about_ca_system_score_codex":0.0000691883,"about_ca_system_score_gemma":0.00008196236,"threshold_uncertainty_score":0.5222341},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019738045,0.00047687764,0.9272359,0.017323444,0.0002129739,0.00071249687,0.0000060669236,0.00026679502,0.034027394],"genre_scores_gemma":[0.8509816,0.0005967609,0.1404695,0.0003881459,0.00021808573,0.000046665944,3.656172e-7,0.000069542,0.007229353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978983,0.00035359713,0.00041353045,0.00025162785,0.00065407594,0.00042891476],"domain_scores_gemma":[0.9973164,0.0014009977,0.00026978945,0.0006917842,0.00013519594,0.0001857898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019651977,0.00021614175,0.00030159732,0.00014564379,0.00032817118,0.00031911474,0.0011952624,0.00005077083,0.000033390817],"category_scores_gemma":[0.00041361776,0.00008457346,0.00013236851,0.00031011287,0.0004746686,0.0004670719,0.00032027368,0.0003383568,0.000051800547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067738314,0.000039429797,0.00001929799,0.00001928741,0.000046444715,0.000024228832,0.0009515594,0.0000050682033,0.0006090292,0.9662477,0.00029632665,0.03167389],"study_design_scores_gemma":[0.0019478647,0.00017841572,0.00008229809,0.0002727593,0.000012267707,0.00030723723,0.00011155504,0.00416357,0.00092529546,0.9904644,0.0013483594,0.00018596063],"about_ca_topic_score_codex":3.8174036e-7,"about_ca_topic_score_gemma":0.0000017947134,"teacher_disagreement_score":0.8312435,"about_ca_system_score_codex":0.00004227117,"about_ca_system_score_gemma":0.000041690673,"threshold_uncertainty_score":0.34488058},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070512824,0.0010389794,0.97014934,0.02241802,0.0005612524,0.0019544568,0.00004551824,0.0001611107,0.0029662203],"genre_scores_gemma":[0.023351613,0.0036408368,0.96917367,0.0010429358,0.00060608797,0.0002608818,0.000038624145,0.00013062079,0.0017547124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968358,0.0002494722,0.0010140479,0.00052437803,0.00080801616,0.0005682782],"domain_scores_gemma":[0.99664927,0.0010548526,0.00084675726,0.00075919233,0.00028703455,0.00040290592],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015765744,0.00048184575,0.00068756123,0.00014489533,0.000739737,0.0025572632,0.0018429334,0.00021599328,0.00001524471],"category_scores_gemma":[0.00033780746,0.00030306535,0.00039832195,0.0001756187,0.00014542289,0.00026529955,0.0010455713,0.0012676914,0.000020377896],"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.00090624706,0.00057019957,0.000078492725,0.008483971,0.0020232012,0.00020350194,0.015892368,0.021815415,0.00088079803,0.85638934,0.06285024,0.029906228],"study_design_scores_gemma":[0.0021285766,0.0004436691,0.000018987212,0.00065598125,0.00008235404,0.00018918855,0.00029861202,0.5187194,0.00011365953,0.46787244,0.008975671,0.0005014715],"about_ca_topic_score_codex":0.0000012447944,"about_ca_topic_score_gemma":0.000002471443,"teacher_disagreement_score":0.49690396,"about_ca_system_score_codex":0.00007785059,"about_ca_system_score_gemma":0.00032898693,"threshold_uncertainty_score":0.9999421},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92703074,0.000107916305,0.026034912,0.00360429,0.00046388237,0.0008245188,0.000053666903,0.0001463757,0.041733705],"genre_scores_gemma":[0.9800692,0.00021951942,0.008523326,0.000046629833,0.000102514634,0.0000146518205,8.7790204e-7,0.00011714699,0.010906135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627656,0.00037986654,0.0011333822,0.00023655145,0.0012917226,0.00068189716],"domain_scores_gemma":[0.9925283,0.0048596733,0.000885758,0.00095449603,0.0004844433,0.000287288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028252858,0.000337795,0.00062281673,0.00013018023,0.00036571303,0.000114422044,0.0009552744,0.00013566995,0.00092255813],"category_scores_gemma":[0.003869576,0.00015762197,0.00040277527,0.00038445537,0.00050448533,0.00016411973,0.00014999055,0.0004893172,0.0003173596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018352638,0.00029477148,0.0004162266,0.00011678728,0.00054742035,0.00003605783,0.000754989,7.937401e-7,0.004180935,0.9882729,0.0038230424,0.001372539],"study_design_scores_gemma":[0.0013901138,0.00016359982,0.000055951343,0.00064712064,0.00010775248,0.00030910183,0.0009506777,0.00024287762,0.006637566,0.9884638,0.0007590193,0.00027237233],"about_ca_topic_score_codex":0.0000014645071,"about_ca_topic_score_gemma":0.000003156549,"teacher_disagreement_score":0.053038467,"about_ca_system_score_codex":0.00013699444,"about_ca_system_score_gemma":0.0001368187,"threshold_uncertainty_score":0.99999076},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08331561,0.000028233051,0.90899503,0.0014152145,0.00049346854,0.0013228595,0.0002242072,0.00007502576,0.0041303546],"genre_scores_gemma":[0.3418782,0.000059267746,0.652512,0.00082263217,0.0011129527,0.0003242265,0.00012841192,0.00034170502,0.0028206022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997449,0.00019334485,0.0009104993,0.00033115962,0.0005949667,0.0005210192],"domain_scores_gemma":[0.9964278,0.0018909413,0.00060814095,0.00055674644,0.0002480844,0.00026833892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030189946,0.00042700663,0.00072780304,0.0002159182,0.00033892618,0.00016578901,0.00032880163,0.00023423597,0.000022774551],"category_scores_gemma":[0.0013234124,0.0003256005,0.00064411125,0.0001009753,0.0000547091,0.00012499104,0.000022552795,0.00037777168,6.079913e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014190093,0.003101454,0.000002332223,0.0023257502,0.00044909085,0.000018925199,0.0038955852,0.00052681856,0.0011006607,0.9333127,0.01053545,0.04331222],"study_design_scores_gemma":[0.009624915,0.0046741706,0.0000015434168,0.0009069272,0.00041495633,0.00015247006,0.0013307445,0.38231352,0.0022704788,0.58855504,0.009100411,0.0006548325],"about_ca_topic_score_codex":4.6557366e-7,"about_ca_topic_score_gemma":0.000019301304,"teacher_disagreement_score":0.3817867,"about_ca_system_score_codex":0.00020831358,"about_ca_system_score_gemma":0.000044372875,"threshold_uncertainty_score":0.9999196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9189737,0.000026429638,0.065320075,0.0033726548,0.00042810934,0.00032120134,0.000037747854,0.000009715045,0.011510401],"genre_scores_gemma":[0.9958283,0.00015894836,0.002543058,0.000050802966,0.000043540243,0.0000025472564,4.031092e-7,0.000011126319,0.0013613127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677485,0.00033367448,0.0010772408,0.00015462039,0.0014978497,0.00016175516],"domain_scores_gemma":[0.9950798,0.0025354014,0.0012283815,0.0006598331,0.00041671938,0.00007986704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051051755,0.00013240283,0.00031607162,0.00016729796,0.0001091617,0.000051112762,0.0006002738,0.00006370448,0.00040824345],"category_scores_gemma":[0.0047520883,0.00005056275,0.00022355071,0.00039967516,0.00014730402,0.00017253193,0.000054865723,0.00013961286,0.00006561067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002037087,0.0061418344,0.03776876,0.00022785271,0.000610591,0.000041829524,0.019113066,0.026187409,0.0058423793,0.71783483,0.027754508,0.15643983],"study_design_scores_gemma":[0.0006864398,0.0010097582,0.0040201857,0.0007196613,0.000033242846,0.00002124009,0.0005165722,0.0030116555,0.0033492395,0.9830708,0.0033870363,0.00017416065],"about_ca_topic_score_codex":8.1068623e-7,"about_ca_topic_score_gemma":0.000001909221,"teacher_disagreement_score":0.26523596,"about_ca_system_score_codex":0.00003277687,"about_ca_system_score_gemma":0.000076657925,"threshold_uncertainty_score":0.5689037},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25816944,0.002773553,0.5953008,0.0034232556,0.02538621,0.0061223907,0.00076862326,0.0017414498,0.10631429],"genre_scores_gemma":[0.28474644,0.0017002901,0.6929512,0.00031629295,0.007203949,0.00026555022,0.00007678549,0.0012844324,0.01145503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946155,0.00025078285,0.001981218,0.000764687,0.0015214293,0.0008663757],"domain_scores_gemma":[0.9924839,0.0021623631,0.0023760642,0.0017590856,0.0006234977,0.00059508544],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015492259,0.0011266732,0.0017479857,0.000875871,0.0006154422,0.00072407874,0.0010562798,0.0008374814,0.000374381],"category_scores_gemma":[0.00519509,0.0009193097,0.00058447605,0.0005692503,0.0003098951,0.00023870316,0.0013399057,0.0029685525,0.0002578901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095646006,0.0013454478,0.000037559832,0.0045960797,0.0011394117,0.0002117564,0.002847487,0.00008295385,0.000051572788,0.9654926,0.022552453,0.001547026],"study_design_scores_gemma":[0.0009445499,0.00047296533,0.000010439498,0.002359655,0.00067392015,0.00075558183,0.00064870884,0.0026195785,0.00014387617,0.98803043,0.0023972231,0.0009430531],"about_ca_topic_score_codex":0.0000020135967,"about_ca_topic_score_gemma":0.000003461375,"teacher_disagreement_score":0.09765044,"about_ca_system_score_codex":0.00042894576,"about_ca_system_score_gemma":0.00025897825,"threshold_uncertainty_score":0.99933165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012287136,0.00029257068,0.9735327,0.008279321,0.0017195228,0.0006421836,0.000021617234,0.000090271686,0.0031347165],"genre_scores_gemma":[0.8497682,0.00017139167,0.14789565,0.0006615801,0.0007156909,0.00007068266,0.000002770004,0.000051309944,0.00066270184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998222,0.000050276536,0.00047413763,0.00027109997,0.0004881467,0.0004943753],"domain_scores_gemma":[0.9967091,0.0009750159,0.0006808779,0.0012513564,0.00019937815,0.00018424637],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010806576,0.00025610504,0.0003392781,0.00012424712,0.0025110655,0.0025676799,0.003053438,0.000074588774,0.000024368817],"category_scores_gemma":[0.00069757295,0.0001637998,0.00036302913,0.00014338717,0.00028668076,0.0005043403,0.00035668781,0.0004576413,0.000021644793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005678762,0.00026081846,0.0001301093,0.0001800014,0.00035932823,0.000114405935,0.0073615736,0.00011338652,0.0002132493,0.9524121,0.007646826,0.031151382],"study_design_scores_gemma":[0.0020537546,0.0005605842,0.0016539473,0.0006387714,0.00010748932,0.00069155736,0.0010806114,0.35593444,0.0009232662,0.6128197,0.022849692,0.0006862307],"about_ca_topic_score_codex":0.0000037085338,"about_ca_topic_score_gemma":0.000006360838,"teacher_disagreement_score":0.8374811,"about_ca_system_score_codex":0.00003955065,"about_ca_system_score_gemma":0.00008701995,"threshold_uncertainty_score":0.9987875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056998767,0.00024342803,0.98959666,0.00029951704,0.00080139306,0.00046175226,0.00004100137,0.00022048986,0.002635851],"genre_scores_gemma":[0.046297677,0.00007310583,0.9525666,0.000037399994,0.0005311093,0.000040086343,0.000031414922,0.00011692316,0.00030563876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983501,0.000020143318,0.0006287201,0.00019424937,0.00040178213,0.00040500856],"domain_scores_gemma":[0.9986291,0.00011706798,0.00042751577,0.00045802267,0.0001758389,0.0001924746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063488964,0.00031163357,0.00037583432,0.00014987403,0.00065950427,0.0007941813,0.00037672947,0.00014313347,0.00003621381],"category_scores_gemma":[0.00033424277,0.00026434503,0.00019142931,0.000072679395,0.000059759568,0.0003996173,0.00004177162,0.00040839252,0.000029951485],"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.000043536915,0.00073204044,0.000045912297,0.0016059071,0.00067561003,0.000042758755,0.0049177525,0.77699715,0.0029843654,0.0061668498,0.0005189555,0.20526919],"study_design_scores_gemma":[0.0010846419,0.00016486138,0.000009744907,0.00043850718,0.000063107946,0.00012227359,0.00022432406,0.99095124,0.0024926416,0.0036937264,0.00041461978,0.0003402994],"about_ca_topic_score_codex":6.1522354e-7,"about_ca_topic_score_gemma":0.0000010320736,"teacher_disagreement_score":0.21395414,"about_ca_system_score_codex":0.00011303481,"about_ca_system_score_gemma":0.000029913712,"threshold_uncertainty_score":0.99998087},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024762651,0.0002875648,0.9571919,0.001312479,0.0021789751,0.0006068679,0.000020073821,0.00028352084,0.01335598],"genre_scores_gemma":[0.21224147,0.0005894593,0.78045654,0.0004748012,0.0020991422,0.00008465542,0.00001795555,0.00027116603,0.003764812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99444765,0.00035150925,0.001282785,0.0008557671,0.0020408174,0.0010214727],"domain_scores_gemma":[0.9948779,0.00032191796,0.0012561759,0.0025023285,0.00049349334,0.00054819824],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024157043,0.0007308947,0.0008787612,0.00078039686,0.0004768561,0.0018230038,0.0054245484,0.0004097877,0.00019227908],"category_scores_gemma":[0.0003298284,0.00059178344,0.0006456873,0.00043039728,0.00030383695,0.00055083714,0.0037197135,0.00281733,0.0006002887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021362212,0.00085400767,0.00004444333,0.0014750774,0.000762373,0.0011630288,0.006273744,0.0031719268,0.0023391005,0.96486527,0.009298195,0.009539223],"study_design_scores_gemma":[0.00066281966,0.0005621825,0.0000376017,0.0015618526,0.00004540065,0.00061042944,0.00010291429,0.025970826,0.0025700382,0.96459883,0.0024308134,0.00084627495],"about_ca_topic_score_codex":0.0000014284158,"about_ca_topic_score_gemma":0.0000011748316,"teacher_disagreement_score":0.18747883,"about_ca_system_score_codex":0.00030345912,"about_ca_system_score_gemma":0.00037375963,"threshold_uncertainty_score":0.9999566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21925433,0.000048594156,0.768728,0.0003464801,0.00025654622,0.00021768804,0.0000025549482,0.000037908845,0.01110788],"genre_scores_gemma":[0.91288304,0.00004701086,0.08567728,0.00016350874,0.000047403028,0.000003114667,9.471157e-7,0.000023964027,0.0011537011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851596,0.000086863234,0.00035389312,0.00015880997,0.0006563484,0.00022810642],"domain_scores_gemma":[0.9987102,0.00023669034,0.00029222155,0.00054345554,0.000120052704,0.000097340686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005807711,0.0001262087,0.00021804047,0.00023496106,0.00006760468,0.0000968851,0.00076087913,0.00004105536,0.000089735426],"category_scores_gemma":[0.00015402865,0.00009030736,0.00011157788,0.00033532066,0.000038775972,0.0002693762,0.00009473449,0.00023960184,0.0001671296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016280934,0.000090001035,0.00006520582,0.000055937322,0.000014323105,0.000008547629,0.0005089859,0.0036385763,0.0030869597,0.99122506,0.00015202543,0.0011380751],"study_design_scores_gemma":[0.00057107414,0.00092564104,0.00011097426,0.00035466146,0.000005416764,0.00008070588,0.000103340455,0.06601712,0.013809224,0.9175033,0.00032173327,0.00019682852],"about_ca_topic_score_codex":1.9646876e-7,"about_ca_topic_score_gemma":1.5490309e-7,"teacher_disagreement_score":0.6936287,"about_ca_system_score_codex":0.00003773346,"about_ca_system_score_gemma":0.000038877286,"threshold_uncertainty_score":0.36826274},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01329498,0.003268701,0.8444574,0.00809954,0.01098092,0.0012441707,0.00024610336,0.00082204194,0.11758613],"genre_scores_gemma":[0.064637534,0.001199714,0.92555815,0.0011126554,0.0016937961,0.00013749066,0.000049916416,0.00021009032,0.0054006376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99542314,0.0003006449,0.0011059527,0.0007539184,0.0017390923,0.00067727896],"domain_scores_gemma":[0.9958203,0.00039919376,0.0011376705,0.002118766,0.00016090843,0.00036316508],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001595028,0.00065299415,0.0008581247,0.00051466405,0.00075712363,0.001859976,0.0052043446,0.00022982172,0.00096719747],"category_scores_gemma":[0.00018034721,0.00056349346,0.0008029965,0.0003336819,0.00015226238,0.00031708693,0.0045652976,0.0033666615,0.00010296193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002417841,0.0007563367,0.00006735913,0.00071160163,0.00046595637,0.0008911255,0.0115849525,0.0027983037,0.000017335746,0.9450064,0.020055002,0.0176215],"study_design_scores_gemma":[0.0003297257,0.00026070434,0.00007607451,0.0006617821,0.00005322397,0.0004723848,0.00040737944,0.0201058,0.00004863728,0.95483994,0.021993076,0.0007512707],"about_ca_topic_score_codex":0.0000068867366,"about_ca_topic_score_gemma":0.0000037745453,"teacher_disagreement_score":0.112185486,"about_ca_system_score_codex":0.0002822396,"about_ca_system_score_gemma":0.00030351395,"threshold_uncertainty_score":0.99994606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9469579,0.00083921425,0.010155709,0.00096016197,0.024305446,0.0039989497,0.00020061005,0.0006614303,0.0119206],"genre_scores_gemma":[0.86295825,0.00011284598,0.13200812,0.00017623525,0.0021081541,0.00011408318,0.00003785935,0.00067642366,0.0018080167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343175,0.00033232177,0.002318395,0.00094538677,0.0019893732,0.0009827776],"domain_scores_gemma":[0.9904207,0.003746429,0.0029926368,0.0016835721,0.0005850268,0.0005716319],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0018973243,0.0013322779,0.002366188,0.0004688063,0.00050398725,0.00069414516,0.0010910825,0.00095471187,0.00033760836],"category_scores_gemma":[0.002484741,0.0011278985,0.0006730639,0.00027011023,0.0001955404,0.0002950004,0.0015569397,0.0038769234,0.00013657114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014783042,0.0017111334,0.00010189425,0.0047535608,0.0008402503,0.00040021507,0.0019980995,0.0005322486,0.00017835811,0.9871245,0.0018007633,0.00041117123],"study_design_scores_gemma":[0.0024431907,0.00045482907,0.000048707298,0.0030361873,0.0015012032,0.0005247554,0.0004413275,0.0040941495,0.00019147049,0.98538995,0.0005672318,0.0013070249],"about_ca_topic_score_codex":0.0000028774573,"about_ca_topic_score_gemma":0.0000012377793,"teacher_disagreement_score":0.12185241,"about_ca_system_score_codex":0.00055321667,"about_ca_system_score_gemma":0.0002790237,"threshold_uncertainty_score":0.99994284},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9578785,0.0001273842,0.012881218,0.0015566477,0.0012196823,0.0009493126,0.0003594702,0.00009882305,0.024929019],"genre_scores_gemma":[0.9833841,0.00001441752,0.014576255,0.00085180684,0.0001665366,0.000027450022,0.000004571932,0.000075598706,0.0008993196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997356,0.00022289822,0.00081319833,0.00023040164,0.0010322044,0.00034531334],"domain_scores_gemma":[0.9975823,0.0008812798,0.00062988617,0.0006144053,0.00010331699,0.0001888042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010795118,0.0003134885,0.0005890366,0.0002991422,0.0006596966,0.00007581028,0.0006668518,0.0000706772,0.0014321991],"category_scores_gemma":[0.0005993051,0.00022668143,0.00030804132,0.00025124883,0.00007840686,0.00006112303,0.00024593883,0.00076457666,0.000011552819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019035587,0.00027159153,0.00003474249,0.00019063306,0.00019293325,0.00005309053,0.010193167,0.0009333635,0.00046755164,0.97468954,0.012325889,0.00045711],"study_design_scores_gemma":[0.0008289428,0.001569499,0.00006748175,0.0002745275,0.000099524696,0.00041376258,0.0032840553,0.0004579041,0.0020706698,0.98130345,0.0092484355,0.00038171877],"about_ca_topic_score_codex":0.0000017093502,"about_ca_topic_score_gemma":0.0000026002624,"teacher_disagreement_score":0.025505602,"about_ca_system_score_codex":0.0001263814,"about_ca_system_score_gemma":0.000062370375,"threshold_uncertainty_score":0.9994806},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004485221,0.0012289424,0.7787273,0.0007547859,0.029033167,0.0007457811,0.00024346811,0.00020294664,0.18861511],"genre_scores_gemma":[0.0056110304,0.0030995952,0.7416707,0.00055037776,0.0037900368,0.0000854193,0.00024152487,0.00050375075,0.24444754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952557,0.0002844084,0.0012851289,0.0005296249,0.0018742618,0.0007708724],"domain_scores_gemma":[0.9954578,0.00033695175,0.0014957876,0.0015688254,0.000688554,0.00045205778],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012117595,0.0005851696,0.0009667077,0.0010642232,0.0004663561,0.00034118176,0.0035141087,0.0004059235,0.00026667773],"category_scores_gemma":[0.00027544855,0.00046066547,0.0007617092,0.0009796907,0.00048998324,0.00044207674,0.000536781,0.002308937,0.00017467795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032004875,0.00035349268,0.000008162227,0.0003158271,0.00029998203,0.00017229792,0.00070324115,0.000018034181,0.000141959,0.50507474,0.49076316,0.002117087],"study_design_scores_gemma":[0.00054194574,0.0012664174,0.00005889067,0.002024385,0.00009139085,0.0010305159,0.00012893397,0.0061423425,0.00041290635,0.9436191,0.043940794,0.0007423952],"about_ca_topic_score_codex":6.34869e-7,"about_ca_topic_score_gemma":0.00000858768,"teacher_disagreement_score":0.44682235,"about_ca_system_score_codex":0.00012717587,"about_ca_system_score_gemma":0.00054966274,"threshold_uncertainty_score":0.9999928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16750135,0.00025891513,0.7882039,0.0029633448,0.0007040572,0.00054669275,0.00003715618,0.00013102031,0.03965359],"genre_scores_gemma":[0.92893404,0.000119960154,0.069825664,0.000060733415,0.00007129371,0.000006596702,4.5254134e-7,0.00002859201,0.00095267297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997882,0.00008211973,0.0004972437,0.00024342665,0.0008343865,0.00046084338],"domain_scores_gemma":[0.99658763,0.00028120397,0.0011307534,0.0015586773,0.00019566699,0.00024608526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000954762,0.00021355633,0.00042024846,0.00024397846,0.0007159033,0.0006161128,0.0029859599,0.00007050423,0.000022998021],"category_scores_gemma":[0.0006267631,0.00015690533,0.00022734568,0.00017406972,0.00023189533,0.0009195517,0.00028455825,0.0004956326,0.000047572077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006901875,0.00029833434,0.00276619,0.00022956386,0.00015890907,0.00040723593,0.0011281031,0.0002993888,0.0009887258,0.98787093,0.0010675833,0.0047160117],"study_design_scores_gemma":[0.0007416376,0.000447555,0.0030665658,0.00058586587,0.000014511802,0.00028627375,0.00027809135,0.006274972,0.002944613,0.9842118,0.00084204413,0.0003060853],"about_ca_topic_score_codex":0.0000013003179,"about_ca_topic_score_gemma":0.000003754732,"teacher_disagreement_score":0.7614327,"about_ca_system_score_codex":0.000036624806,"about_ca_system_score_gemma":0.00006625632,"threshold_uncertainty_score":0.6398413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36251143,0.00009427056,0.630455,0.0005683122,0.0006361078,0.002422773,0.0012097957,0.000058627116,0.0020436542],"genre_scores_gemma":[0.6016599,0.00013481415,0.39681962,0.000094328105,0.00026219455,0.000031893116,0.0003707205,0.00013224209,0.0004943028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968986,0.00020632973,0.0014794267,0.00044397954,0.000565566,0.00040609296],"domain_scores_gemma":[0.99377936,0.0014171366,0.0019408003,0.0022624787,0.0003876172,0.00021263046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022136522,0.00040177008,0.00075663225,0.00023517878,0.00024201185,0.00025121076,0.0013019656,0.00022804408,0.000752034],"category_scores_gemma":[0.0007611204,0.00034167513,0.00027195865,0.00030749157,0.00009077892,0.00075821683,0.00012284229,0.00040082895,0.00008455885],"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.0003144938,0.002273649,0.00017155595,0.0026109742,0.0005329992,0.0000019964282,0.0036642684,0.033685185,0.004059231,0.95078766,0.0010735407,0.0008244584],"study_design_scores_gemma":[0.0012722722,0.0009126308,0.00002385922,0.0007573431,0.00051622523,0.00005581332,0.0016429177,0.50927603,0.001556254,0.48311642,0.00046512278,0.00040513198],"about_ca_topic_score_codex":9.771787e-7,"about_ca_topic_score_gemma":0.0000021589037,"teacher_disagreement_score":0.47559083,"about_ca_system_score_codex":0.000058338544,"about_ca_system_score_gemma":0.00011622031,"threshold_uncertainty_score":0.9999035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44134575,0.00091326045,0.41165158,0.04204269,0.01141502,0.013151636,0.0017745025,0.00081898214,0.07688657],"genre_scores_gemma":[0.85697466,0.00019513976,0.13517937,0.0027730113,0.0028142526,0.0003850012,0.00007497871,0.0004782829,0.0011253003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623805,0.00037205603,0.0014167037,0.0005090155,0.000921485,0.0005427046],"domain_scores_gemma":[0.9912437,0.005338589,0.0017306067,0.0011978764,0.00022112069,0.0002680857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019407625,0.00074027444,0.0011871574,0.00022047888,0.0008762958,0.00042894934,0.0013662613,0.00048392717,0.00019472242],"category_scores_gemma":[0.003717521,0.00043129415,0.0013273595,0.00014802744,0.00016469996,0.00007155024,0.00051236834,0.0018610483,0.00002650375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004766767,0.0002062761,6.762289e-7,0.0009685128,0.0005735515,0.000038555812,0.0037099337,0.00006557988,0.00013910087,0.96105367,0.03210003,0.0006674171],"study_design_scores_gemma":[0.0010556203,0.0006580642,0.0000049772766,0.0017512714,0.000435343,0.0001071362,0.0005866853,0.004078549,0.00063928653,0.989382,0.0007893096,0.0005117386],"about_ca_topic_score_codex":3.8320584e-7,"about_ca_topic_score_gemma":0.0000012523939,"teacher_disagreement_score":0.4156289,"about_ca_system_score_codex":0.00017927939,"about_ca_system_score_gemma":0.0001387028,"threshold_uncertainty_score":0.9998139},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95433986,0.00035893076,0.04069418,0.000081686776,0.0011099315,0.0010842643,0.0001168299,0.00009586111,0.0021184534],"genre_scores_gemma":[0.6015213,0.0002724227,0.39742222,0.000021142592,0.00023411128,0.000023412853,0.00001035072,0.00027009676,0.00022492149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993577,0.00022281235,0.003065612,0.0005418265,0.001944006,0.0006487662],"domain_scores_gemma":[0.9878958,0.002179628,0.006112012,0.0018833425,0.0016469262,0.0002822913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014760507,0.0009191727,0.0028433322,0.0004032459,0.00018863096,0.00011611661,0.001111895,0.0005501595,0.00009474839],"category_scores_gemma":[0.0040366184,0.0007004707,0.00070180034,0.0003602358,0.00029944614,0.0002093134,0.00088387093,0.0020364982,0.0000068136587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018058337,0.024370575,0.0026027053,0.16663872,0.009795543,0.0059407176,0.07838371,0.013937364,0.016160022,0.6705721,0.0025484373,0.0072442726],"study_design_scores_gemma":[0.0022449829,0.001202665,0.00006606288,0.040942848,0.0015254704,0.0013497634,0.005881941,0.0115390485,0.029768437,0.9039184,0.00005851728,0.001501883],"about_ca_topic_score_codex":0.0000035184692,"about_ca_topic_score_gemma":0.0000094000125,"teacher_disagreement_score":0.35672805,"about_ca_system_score_codex":0.0001788234,"about_ca_system_score_gemma":0.0006762364,"threshold_uncertainty_score":0.9995446},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02849229,0.00008459063,0.95721835,0.009097549,0.0008454704,0.0002164223,0.00004632601,0.00018094556,0.0038180568],"genre_scores_gemma":[0.462085,0.000056336223,0.536808,0.0007121191,0.00025635186,0.000003611521,0.0000014009951,0.00001771054,0.000059467286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987148,0.000054516644,0.0004386513,0.00025396253,0.00029161054,0.0002464408],"domain_scores_gemma":[0.99891573,0.0001656068,0.00026370946,0.00028460304,0.00008647793,0.00028389957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032895914,0.0001717609,0.0002472527,0.00008757406,0.00039771877,0.000494639,0.00051976315,0.000051283463,0.000010179363],"category_scores_gemma":[0.00033813764,0.00013991482,0.00010296404,0.00027419796,0.0001381228,0.0003724005,0.0001949401,0.0004637947,0.000013797665],"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.00008091947,0.00028402708,0.0000903383,0.00037795413,0.0003195949,0.0002038203,0.033342253,0.00025936705,0.0037260975,0.89912206,0.002856341,0.059337243],"study_design_scores_gemma":[0.0022464418,0.0005453036,0.00021589492,0.00036801817,0.00004499173,0.0014455453,0.0015947659,0.8379981,0.0015272128,0.14696728,0.006432264,0.0006141934],"about_ca_topic_score_codex":0.000001753726,"about_ca_topic_score_gemma":0.0000014272147,"teacher_disagreement_score":0.83773875,"about_ca_system_score_codex":0.000021625223,"about_ca_system_score_gemma":0.00003775081,"threshold_uncertainty_score":0.57055604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901243,0.0010515819,0.0022450385,0.00014073233,0.0020156743,0.0006081439,0.00007848241,0.00010252944,0.003633522],"genre_scores_gemma":[0.9577276,0.00094488857,0.040429734,0.00013627065,0.00027454348,0.000026569642,0.000015282643,0.0002128578,0.00023222857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939557,0.00055088225,0.002494513,0.00064726645,0.0015874339,0.0007642432],"domain_scores_gemma":[0.99260545,0.0012729187,0.0029331911,0.002035876,0.00071092055,0.0004416494],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021017578,0.0009973766,0.002079713,0.0008837839,0.0004389199,0.00035250164,0.0013066159,0.0008792942,0.0003732794],"category_scores_gemma":[0.0018189388,0.00076643005,0.0018184204,0.0005145103,0.00031942676,0.00014804704,0.0011159328,0.003039044,0.0000073619613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027824767,0.00140917,0.00060931954,0.007583725,0.0036137109,0.0010818931,0.026249839,0.00022855203,0.004659811,0.95034575,0.0025752492,0.0013647411],"study_design_scores_gemma":[0.0007487282,0.00026830458,0.0001806276,0.004349548,0.000707977,0.0006255979,0.0019441504,0.00029286614,0.00842876,0.98153484,0.000068351255,0.00085023843],"about_ca_topic_score_codex":0.0000054784014,"about_ca_topic_score_gemma":0.0000140849925,"teacher_disagreement_score":0.038184695,"about_ca_system_score_codex":0.00010887804,"about_ca_system_score_gemma":0.0002987299,"threshold_uncertainty_score":0.99947864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72896624,0.0067475107,0.22969234,0.02308634,0.0020959396,0.0018108248,0.00041053057,0.00025764952,0.006932656],"genre_scores_gemma":[0.89109796,0.00030572465,0.1069313,0.00020316083,0.00014512325,0.000013654291,0.000002007072,0.00006358219,0.0012374896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974605,0.0003318237,0.00053188973,0.0002084134,0.0010895596,0.00037784938],"domain_scores_gemma":[0.9969967,0.0008356621,0.00044602153,0.001482832,0.0000895941,0.00014919773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013814392,0.00018090455,0.00030795016,0.00021009982,0.00095669815,0.00021647061,0.0034996315,0.000034380973,0.000060601917],"category_scores_gemma":[0.0006136114,0.0001138724,0.00015144917,0.0005171168,0.00020966634,0.0002540911,0.0020682735,0.00080303504,0.0000019440422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001374499,0.00009852641,0.00004633637,0.00009065253,0.00010025188,0.0000994704,0.0020725352,0.0008161251,0.004778906,0.98278284,0.0035396526,0.0054372484],"study_design_scores_gemma":[0.0010412572,0.0007651074,0.00008591737,0.00004465418,0.000012422408,0.0007050876,0.001077601,0.00838092,0.0010016744,0.98500144,0.0017253408,0.00015860144],"about_ca_topic_score_codex":5.3447087e-7,"about_ca_topic_score_gemma":0.0000013679094,"teacher_disagreement_score":0.16213176,"about_ca_system_score_codex":0.000065311295,"about_ca_system_score_gemma":0.00008450467,"threshold_uncertainty_score":0.7358245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9056391,0.003964307,0.0074495687,0.003932509,0.011932826,0.0029294535,0.0004454612,0.00027658086,0.0634302],"genre_scores_gemma":[0.9865682,0.0025961283,0.008378685,0.00028323795,0.0005729666,0.00005937865,0.000038062684,0.0001982964,0.0013050099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957054,0.0005105856,0.0014676396,0.00045400023,0.0011456657,0.00071671134],"domain_scores_gemma":[0.9933881,0.0032091253,0.0014675065,0.0013650819,0.00033440348,0.00023578625],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022552738,0.0007550336,0.0011465946,0.00023981166,0.0009475006,0.0007175939,0.0014158459,0.0007073628,0.00014038225],"category_scores_gemma":[0.002515056,0.0004512813,0.00070976536,0.00032109563,0.0003234492,0.00011192842,0.0012204009,0.0050443932,0.000005796696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048936665,0.00025782094,0.000053769338,0.00054464967,0.0003909917,0.00039564734,0.00946944,0.00011299632,0.000002573389,0.98539144,0.002421032,0.00091071514],"study_design_scores_gemma":[0.00064152887,0.000116702926,0.00015203816,0.0016429009,0.000139811,0.00035917258,0.00406219,0.000603451,0.00019571268,0.9896015,0.0019355955,0.00054940535],"about_ca_topic_score_codex":0.0000031092356,"about_ca_topic_score_gemma":0.000030757263,"teacher_disagreement_score":0.08092914,"about_ca_system_score_codex":0.0003822853,"about_ca_system_score_gemma":0.00034347922,"threshold_uncertainty_score":0.9997939},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023705805,0.0016516913,0.95774156,0.0014148385,0.0077468758,0.0047208862,0.00028832158,0.00039646585,0.0023335854],"genre_scores_gemma":[0.3661241,0.0009861772,0.62391204,0.00069567334,0.003578032,0.001685875,0.00011868326,0.0010512767,0.0018481715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934425,0.00034318978,0.0026165461,0.00076614425,0.0018125884,0.0010190394],"domain_scores_gemma":[0.98099315,0.011980569,0.0033036878,0.0023997894,0.0009528906,0.00036993087],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026317227,0.0012066764,0.002055135,0.00052112935,0.0009550622,0.0011594584,0.0016630967,0.0006130996,0.00024609597],"category_scores_gemma":[0.01133459,0.0008281645,0.0015934295,0.0007205198,0.00019680476,0.00025256118,0.0009034917,0.002566906,0.000061566316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003477445,0.0029370629,0.000013160203,0.01972113,0.00525087,0.00014706144,0.008376016,0.005555609,0.0008369956,0.9398558,0.012585074,0.0043734885],"study_design_scores_gemma":[0.0014345306,0.00046492144,0.000019119747,0.004851127,0.00206045,0.00025657527,0.0025389183,0.066341974,0.00026422506,0.9185569,0.0021922842,0.0010189714],"about_ca_topic_score_codex":0.0000025318302,"about_ca_topic_score_gemma":0.00000720629,"teacher_disagreement_score":0.34241828,"about_ca_system_score_codex":0.0006626323,"about_ca_system_score_gemma":0.00038774937,"threshold_uncertainty_score":0.99987745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97368205,0.00006957462,0.0157669,0.0024302609,0.00035665612,0.0011577184,0.00013634433,0.0004834805,0.005917047],"genre_scores_gemma":[0.9183437,0.00019960069,0.07092199,0.00032407726,0.0006572177,0.00042423792,0.000057395166,0.0002958312,0.0087759355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997974,0.00006336564,0.0006864328,0.0002514651,0.00043985446,0.0005849056],"domain_scores_gemma":[0.997845,0.0008475085,0.00039577397,0.0005573788,0.00011375141,0.00024059892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867207,0.00030247113,0.00043220358,0.00032290703,0.00059335463,0.0002090015,0.00043799082,0.0001184122,0.00012559112],"category_scores_gemma":[0.00044854006,0.00023774232,0.0004972521,0.0006757667,0.0001316141,0.00014433455,0.000049973216,0.0003556872,0.00019076887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002902937,0.00016230314,0.000019956044,0.00022172583,0.00012580764,0.000016217833,0.0010683627,0.000039487946,0.0014201263,0.9789055,0.017790996,0.000200503],"study_design_scores_gemma":[0.00058183615,0.00017197781,0.000057027934,0.00023538679,0.00012347582,0.000123466,0.0008425697,0.0022695498,0.0022955027,0.9879256,0.005085203,0.0002884015],"about_ca_topic_score_codex":2.532001e-7,"about_ca_topic_score_gemma":0.0000022876377,"teacher_disagreement_score":0.0553383,"about_ca_system_score_codex":0.000043663338,"about_ca_system_score_gemma":0.000045578236,"threshold_uncertainty_score":0.96948504},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939832,0.00006934268,0.0014905077,0.0005429619,0.0004257103,0.0003888471,0.00008485245,0.000120395845,0.002894167],"genre_scores_gemma":[0.9835023,0.000099679106,0.015636101,0.000058799626,0.00013525196,0.0000049458226,0.000006709317,0.0000842466,0.00047195735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761736,0.00014376294,0.000707114,0.00018804347,0.0008515885,0.00049215055],"domain_scores_gemma":[0.9971347,0.0012629055,0.0006171843,0.0006788783,0.0001545893,0.00015174327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008192676,0.00031238407,0.00048623068,0.00014895941,0.0008029052,0.00015843262,0.000641184,0.00013673013,0.00008280171],"category_scores_gemma":[0.00055835716,0.0001481033,0.00020622964,0.00043127037,0.0003745846,0.00009146873,0.00014598732,0.0006555428,0.000009471017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027189392,0.000054328284,0.00011870921,0.00031324918,0.00029442203,0.000046835525,0.0028903135,0.000049433904,0.00026090592,0.9912812,0.0038020501,0.0006166306],"study_design_scores_gemma":[0.00058911054,0.00026702558,0.00027747123,0.00026092835,0.00009501411,0.00034801703,0.0014826064,0.0009454128,0.0010249967,0.9936986,0.0007866011,0.00022422502],"about_ca_topic_score_codex":3.139413e-7,"about_ca_topic_score_gemma":0.0000055428827,"teacher_disagreement_score":0.014145594,"about_ca_system_score_codex":0.000036917612,"about_ca_system_score_gemma":0.000060473674,"threshold_uncertainty_score":0.6175379},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8907372,0.00019937813,0.09827881,0.0011142672,0.00008088067,0.00053334376,0.000039573297,0.000031765736,0.00898478],"genre_scores_gemma":[0.9835943,0.00004875724,0.015935918,0.00014501656,0.000026591531,0.000027736614,0.0000021766905,0.000027490014,0.00019202447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805105,0.00021685773,0.00079664384,0.00015944657,0.0005087389,0.00026724418],"domain_scores_gemma":[0.9972576,0.00148034,0.0004335081,0.0006069022,0.00014506,0.00007661395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015407465,0.00020452292,0.00045146368,0.0001321366,0.0001824318,0.00006202933,0.00046709646,0.00008226053,0.000044272714],"category_scores_gemma":[0.00076601625,0.00013107082,0.00031544967,0.0004560615,0.00012000086,0.0000728637,0.00005176696,0.00055743434,0.000008463554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003673955,0.0005995579,0.0000067866276,0.00013106657,0.000056876837,0.000018404646,0.0034082553,0.0054632896,0.0006558161,0.9891994,0.00037571054,0.00004810222],"study_design_scores_gemma":[0.0010746673,0.000047168003,0.000018204693,0.00032459025,0.00010160696,0.000256662,0.00185973,0.02471007,0.0008513137,0.97059697,0.000017792281,0.00014121807],"about_ca_topic_score_codex":4.864563e-7,"about_ca_topic_score_gemma":0.000007303519,"teacher_disagreement_score":0.09285709,"about_ca_system_score_codex":0.000023544228,"about_ca_system_score_gemma":0.00009081382,"threshold_uncertainty_score":0.5344913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27768594,0.000051791154,0.7166793,0.0012466637,0.00028449277,0.0010780648,0.000029580173,0.00015124063,0.0027929852],"genre_scores_gemma":[0.8253295,0.0000067994806,0.1737555,0.00021190352,0.00008522441,0.00024988857,0.0000034376528,0.00005109076,0.0003066671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997339,0.00017232659,0.00044976381,0.00034573805,0.0010684993,0.0006246634],"domain_scores_gemma":[0.99798703,0.0005142083,0.0003943899,0.0006819983,0.00016532927,0.00025706275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015431803,0.00024743952,0.00036367562,0.0003727174,0.001170323,0.00034220703,0.0017855212,0.00003473675,0.00006947576],"category_scores_gemma":[0.00013861415,0.00018947665,0.00020435256,0.0007883692,0.00011041303,0.00046259773,0.00048530818,0.00084529613,0.000006629163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002539041,0.00032123982,0.00017491203,0.00011648838,0.00014341762,0.00013573133,0.0029062475,0.0006545068,0.0013112624,0.9916883,0.0003129489,0.0019810083],"study_design_scores_gemma":[0.0020703361,0.0029499356,0.00020022887,0.0001306269,0.000027321004,0.0008910429,0.0013256483,0.03567136,0.0018040203,0.9511293,0.0032623578,0.0005377845],"about_ca_topic_score_codex":0.000001934614,"about_ca_topic_score_gemma":0.000005019834,"teacher_disagreement_score":0.54764354,"about_ca_system_score_codex":0.00018044055,"about_ca_system_score_gemma":0.0001344455,"threshold_uncertainty_score":0.9001296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57071245,0.0007264859,0.4223377,0.00045144418,0.0020404512,0.0001386023,0.000008327814,0.00032558478,0.0032589212],"genre_scores_gemma":[0.8583197,0.0001396081,0.14120728,0.0000701378,0.00015823702,0.0000023456764,0.0000017497501,0.000031527845,0.00006938851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823546,0.00012921749,0.00059305225,0.00025787766,0.00047361702,0.00031076645],"domain_scores_gemma":[0.99870354,0.00034719147,0.00029558822,0.0004319805,0.000055259978,0.00016642862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013512026,0.00021276163,0.00028403857,0.00047618445,0.0002527105,0.0005950357,0.00067631254,0.000076857476,0.000053286414],"category_scores_gemma":[0.000110871544,0.00016611183,0.00016923713,0.0005501566,0.00009728493,0.0010222669,0.00012863548,0.0005344556,0.000036905578],"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.0000148502295,0.00011884101,0.000036589787,0.0004042265,0.00012940503,0.00038899967,0.0068693478,0.0005124208,0.01072534,0.8801085,0.00023118057,0.10046032],"study_design_scores_gemma":[0.00043724605,0.00063001673,0.0001571678,0.0043448186,0.00007027555,0.003063439,0.0040893042,0.520687,0.008394386,0.45585927,0.001652608,0.00061446504],"about_ca_topic_score_codex":0.0000011097777,"about_ca_topic_score_gemma":3.003753e-7,"teacher_disagreement_score":0.52017456,"about_ca_system_score_codex":0.00007526402,"about_ca_system_score_gemma":0.00007817413,"threshold_uncertainty_score":0.6773844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7201879,0.00016850373,0.26682758,0.0012642655,0.0005572519,0.00039029936,0.000035091896,0.00010385464,0.010465251],"genre_scores_gemma":[0.97162825,0.000029767927,0.027933337,0.000096371325,0.00001854414,0.000011428649,7.186027e-7,0.0000220062,0.00025959456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738985,0.0003797109,0.00042819514,0.00024939308,0.0011953977,0.0003574766],"domain_scores_gemma":[0.9978196,0.0008321161,0.00042976727,0.000665316,0.000105079176,0.0001481271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895395,0.00017821917,0.000326839,0.0003455049,0.0004927521,0.00010289867,0.0014311016,0.000028580525,0.00014274352],"category_scores_gemma":[0.0002582323,0.00014244003,0.00020018462,0.00071511895,0.00011225577,0.00026381927,0.0004247978,0.0007829976,0.000015982212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061237035,0.00042986672,0.00013668768,0.000050554325,0.0000612038,0.000074854965,0.001232779,0.04998526,0.0008971833,0.9451008,0.0003669444,0.0016026341],"study_design_scores_gemma":[0.0007212777,0.0019538414,0.0003611186,0.000110258654,0.000011003096,0.00030921565,0.0010371138,0.051134165,0.004281342,0.9391784,0.0005820203,0.00032026428],"about_ca_topic_score_codex":9.726081e-7,"about_ca_topic_score_gemma":8.009599e-7,"teacher_disagreement_score":0.25144035,"about_ca_system_score_codex":0.000089047026,"about_ca_system_score_gemma":0.00007441094,"threshold_uncertainty_score":0.5808536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98471683,0.00011797225,0.0004180989,0.00059725397,0.00040722807,0.00036485348,0.000053081414,0.000025147288,0.013299513],"genre_scores_gemma":[0.99666935,0.000020254693,0.0026699423,0.00028211845,0.00006063795,0.000025022431,0.0000015353935,0.000048715927,0.00022243237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698186,0.000551955,0.0008653026,0.00020374703,0.0010190215,0.0003781179],"domain_scores_gemma":[0.9964892,0.0019555867,0.00068388815,0.0007113718,0.000067204855,0.00009274774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029396163,0.0002715738,0.00054566236,0.00022842103,0.00079590274,0.00007613258,0.00071987737,0.00006455966,0.0005038796],"category_scores_gemma":[0.00092983234,0.00016637247,0.00035101362,0.00037361812,0.00013720569,0.00007882494,0.00029400244,0.0010845787,0.0000037427071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107737505,0.00030644413,0.00019096484,0.00016058754,0.0001242135,0.00008084081,0.009732057,0.0002692001,0.00013140141,0.98648524,0.002186481,0.00022484102],"study_design_scores_gemma":[0.0005319971,0.00033929775,0.00021893611,0.00021162069,0.00005645473,0.00020897241,0.0040547224,0.0005659375,0.0003928941,0.9925521,0.00065637584,0.00021067006],"about_ca_topic_score_codex":0.000003959381,"about_ca_topic_score_gemma":0.000004082592,"teacher_disagreement_score":0.01307708,"about_ca_system_score_codex":0.0001826624,"about_ca_system_score_gemma":0.00006554809,"threshold_uncertainty_score":0.67844725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9037695,0.0003232435,0.0074130897,0.016998632,0.0010394516,0.0015428062,0.00015989077,0.00056427496,0.06818911],"genre_scores_gemma":[0.981566,0.00073196844,0.010899088,0.000101042264,0.00027938889,0.00007439949,0.000006439844,0.00014060031,0.0062010433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801606,0.00012616086,0.0008041284,0.00013711264,0.0005404355,0.00037610903],"domain_scores_gemma":[0.99583095,0.0023758125,0.0006272225,0.0009646813,0.00007517477,0.00012616403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021720142,0.0002022769,0.0003728914,0.00021165302,0.000557397,0.0000978803,0.000926724,0.000072896066,0.0000808455],"category_scores_gemma":[0.0013613753,0.00012002405,0.0004027225,0.00078813836,0.00019580398,0.00007237653,0.00011289463,0.0003922706,0.00011502736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024908115,0.00009820105,0.000012354052,0.00007120618,0.00009578114,0.000008381471,0.00064231304,0.000009131792,0.00023075448,0.98489666,0.0135378335,0.00037245476],"study_design_scores_gemma":[0.00052127347,0.00012488666,0.00006614394,0.0001505839,0.00006885027,0.00006666066,0.0013511608,0.000282988,0.0016294449,0.99282444,0.0027765369,0.00013705726],"about_ca_topic_score_codex":4.2037274e-7,"about_ca_topic_score_gemma":0.000004274202,"teacher_disagreement_score":0.077796526,"about_ca_system_score_codex":0.000021362455,"about_ca_system_score_gemma":0.00003842206,"threshold_uncertainty_score":0.48944387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17746313,0.00009205972,0.8194324,0.0007946861,0.00031510773,0.0007450738,0.0000797461,0.00011250042,0.00096528867],"genre_scores_gemma":[0.8642593,0.00008056965,0.134873,0.000085153624,0.00020934148,0.00008059576,0.0000109227885,0.0000922098,0.00030889118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818003,0.000029816765,0.00067787996,0.00023733852,0.00041925654,0.00045567154],"domain_scores_gemma":[0.9970547,0.0021680626,0.00024686893,0.00021964117,0.0001184192,0.00019232441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009074711,0.00024832698,0.00043269127,0.00024847078,0.0002718112,0.00015621482,0.00016779268,0.00010041932,0.000049813727],"category_scores_gemma":[0.0022693048,0.00019356597,0.000109264925,0.0003217332,0.00005404299,0.00013399875,0.000063351355,0.00033521123,0.000021707388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006837379,0.0001338156,0.0000500676,0.00041141425,0.00003888295,0.0000471037,0.0010074335,0.00005947519,0.00038131297,0.9945613,0.00074700185,0.0024937838],"study_design_scores_gemma":[0.0010176097,0.00029075032,0.00017628986,0.00038846143,0.000062881445,0.0000973032,0.00056417275,0.17466483,0.000041119198,0.8223889,0.00010581937,0.00020190587],"about_ca_topic_score_codex":0.0000012837173,"about_ca_topic_score_gemma":0.000038214475,"teacher_disagreement_score":0.6867962,"about_ca_system_score_codex":0.00006490968,"about_ca_system_score_gemma":0.00006646839,"threshold_uncertainty_score":0.7893391},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002704694,0.0004992065,0.97947717,0.005983226,0.00037141296,0.00015156725,0.0000019379254,0.000047111113,0.01076368],"genre_scores_gemma":[0.91295904,0.0005251413,0.08545081,0.000110418034,0.000030203797,0.0000075663365,6.351866e-7,0.0000141522505,0.0009020313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904394,0.000050305272,0.0003495367,0.00008938892,0.00030628606,0.00016055109],"domain_scores_gemma":[0.99921227,0.0003462887,0.00008051722,0.00023897321,0.000068625835,0.000053340904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078423053,0.00006884784,0.00009890833,0.00011530223,0.000110083674,0.00034426688,0.0004901591,0.000024509212,0.000026031052],"category_scores_gemma":[0.00013518312,0.00004039666,0.000061969964,0.00038749338,0.00003522695,0.00020354515,0.000055352877,0.00024920068,0.000027231146],"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.0000025066774,0.00006296133,0.000018153889,0.00006554488,0.000029833398,0.000019922563,0.006019959,0.015366261,0.00026997883,0.97357166,0.0010951492,0.0034780682],"study_design_scores_gemma":[0.00014989632,0.000093119495,0.00008351406,0.00052402524,0.0000029466062,0.000046253273,0.00042662464,0.90953696,0.0002356381,0.085427135,0.003379447,0.00009441531],"about_ca_topic_score_codex":4.0102321e-7,"about_ca_topic_score_gemma":0.0000015949543,"teacher_disagreement_score":0.91025436,"about_ca_system_score_codex":0.000030514067,"about_ca_system_score_gemma":0.00008251406,"threshold_uncertainty_score":0.33197734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3706681,0.0007539901,0.6120807,0.0021064763,0.0007803642,0.00068346306,0.000008065564,0.0006567642,0.012262086],"genre_scores_gemma":[0.92573863,0.00010330485,0.07331335,0.00009720797,0.000099631994,0.00003262323,0.0000010537069,0.000070843846,0.0005433503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973029,0.0001128595,0.00048387895,0.00042456528,0.0010193856,0.0006564088],"domain_scores_gemma":[0.99815977,0.00046162645,0.00016980225,0.0007278315,0.00016102298,0.0003199311],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010577457,0.0003223485,0.00034809904,0.000739829,0.00033395234,0.0012039623,0.0013689225,0.00008764321,0.000046437304],"category_scores_gemma":[0.00013714093,0.00021410447,0.00022128911,0.0016779877,0.000108831046,0.0009463624,0.00021634191,0.0010207227,0.00007890073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046323887,0.000100338664,0.000055565408,0.00021398519,0.00019767178,0.00079339865,0.0024746454,0.00009362846,0.0023213932,0.98646224,0.00025052458,0.006990297],"study_design_scores_gemma":[0.0006864589,0.0012948683,0.00011209559,0.0014041015,0.00003985769,0.0016223785,0.0005921998,0.024166942,0.0035375878,0.964396,0.0015467544,0.00060074724],"about_ca_topic_score_codex":0.0000018226708,"about_ca_topic_score_gemma":0.000006818377,"teacher_disagreement_score":0.5550705,"about_ca_system_score_codex":0.0000898286,"about_ca_system_score_gemma":0.00017024534,"threshold_uncertainty_score":0.99983287},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6630401,0.0012430802,0.12664244,0.06875724,0.0022502553,0.0038220515,0.00015022875,0.0005794199,0.13351518],"genre_scores_gemma":[0.9706658,0.00024027725,0.018876683,0.0012579224,0.001386351,0.00015368231,0.000010344764,0.00020392412,0.0072050076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971824,0.00028780857,0.0009852151,0.00027706995,0.0008910652,0.000376384],"domain_scores_gemma":[0.9923712,0.006460602,0.0003167975,0.0006013487,0.00008646251,0.00016359519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026461014,0.00040263962,0.0005453781,0.00012235442,0.0005647231,0.00094025576,0.00045540498,0.0001266598,0.0006835571],"category_scores_gemma":[0.0020508152,0.00016135865,0.0003590029,0.00023327804,0.0004062493,0.00023507631,0.000093901835,0.0010185062,0.00021942645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042768377,0.0000937563,0.0000011326409,0.0003276178,0.00013243157,0.00003870713,0.0023791534,5.408621e-7,0.000009235364,0.98461026,0.011109766,0.0012546044],"study_design_scores_gemma":[0.00046490142,0.00023822888,0.000009367735,0.001507012,0.00018920709,0.00030402193,0.0010050858,0.014783063,0.00017348024,0.97913337,0.001959369,0.00023287392],"about_ca_topic_score_codex":0.0000013274866,"about_ca_topic_score_gemma":0.0000027535,"teacher_disagreement_score":0.3076257,"about_ca_system_score_codex":0.00007681582,"about_ca_system_score_gemma":0.000057430865,"threshold_uncertainty_score":0.9066908},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48859572,0.002573573,0.15467528,0.0807748,0.005394357,0.0035040844,0.00025196112,0.0018648425,0.2623654],"genre_scores_gemma":[0.9295179,0.0006630808,0.04366853,0.0007230398,0.0013261378,0.000086272536,0.000008921921,0.00018095093,0.02382513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841243,0.00009144927,0.0005683888,0.000177269,0.0004562059,0.00029425637],"domain_scores_gemma":[0.99765915,0.0014644604,0.00019551604,0.00046502057,0.000093621245,0.00012221174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012140777,0.00022141523,0.00020744152,0.000064325824,0.00071597274,0.000517189,0.0003590015,0.000094497474,0.0003844431],"category_scores_gemma":[0.000340202,0.00012516517,0.00028463494,0.00030876973,0.000111434165,0.00016504708,0.000041152514,0.00063555484,0.00077498355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009467459,0.0000555572,0.0000029603325,0.00009974767,0.00009737281,0.000012045298,0.0018747564,0.000003778305,0.00016510602,0.96640694,0.02974525,0.0015270038],"study_design_scores_gemma":[0.00011573443,0.000038146663,0.000005329624,0.00029202778,0.000077326375,0.00028821896,0.00067024445,0.0036273734,0.0008625033,0.92541784,0.068444245,0.00016100108],"about_ca_topic_score_codex":2.3896055e-7,"about_ca_topic_score_gemma":0.0000010019351,"teacher_disagreement_score":0.44092223,"about_ca_system_score_codex":0.00005013634,"about_ca_system_score_gemma":0.000054190452,"threshold_uncertainty_score":0.9961104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86877054,0.0014805091,0.11509724,0.000194457,0.0023185282,0.00095988554,0.0001715193,0.00033214522,0.01067516],"genre_scores_gemma":[0.9991768,0.00009684365,0.00038784675,0.000010870446,0.00009902433,0.000041693314,0.0000065452246,0.00004397576,0.00013637464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990165,0.000031676216,0.00041014087,0.00010227921,0.00021083967,0.00022855],"domain_scores_gemma":[0.9995548,0.00018622988,0.000039743332,0.000114634364,0.000017206467,0.00008737646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058494066,0.0001553259,0.000220609,0.00022383565,0.000044622768,0.00016148071,0.00011514583,0.00008152941,0.000108912696],"category_scores_gemma":[0.000025689083,0.00012786014,0.00017139055,0.00016388588,0.000019045627,0.00019887352,0.0000041568965,0.00027081373,0.000055716046],"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.0004197342,0.0004960143,0.000120788885,0.0115292715,0.0015788416,0.00084423396,0.05078508,0.2058864,0.08201046,0.6226429,0.016616838,0.007069455],"study_design_scores_gemma":[0.0038083696,0.00084871554,0.00009942878,0.009322133,0.0003115198,0.00085586065,0.0067309407,0.55640787,0.04904674,0.3382984,0.03290964,0.0013603941],"about_ca_topic_score_codex":2.849763e-7,"about_ca_topic_score_gemma":0.000003833114,"teacher_disagreement_score":0.35052145,"about_ca_system_score_codex":0.00009082892,"about_ca_system_score_gemma":0.000017074468,"threshold_uncertainty_score":0.5213985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09436879,0.002919324,0.8404586,0.014862284,0.002102075,0.003680493,0.00062295643,0.0011698039,0.0398157],"genre_scores_gemma":[0.49809572,0.00049400894,0.47556934,0.0004748253,0.0020008804,0.00048412636,0.00004977519,0.00051892793,0.022312397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978039,0.000028915107,0.00086272124,0.00030061966,0.0005431689,0.0004606312],"domain_scores_gemma":[0.99658346,0.0022345027,0.00029449104,0.0005331777,0.0001380337,0.0002163469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010948136,0.00037531453,0.00053922384,0.00038873937,0.00036492318,0.00058102666,0.00044400917,0.00016003482,0.00041995104],"category_scores_gemma":[0.00081550766,0.00026162073,0.00046181786,0.00046630265,0.0000924927,0.00016229419,0.00006746093,0.00052764895,0.00015039556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000131037905,0.00024388035,0.0000014397858,0.0019775208,0.00022593525,0.000035166264,0.0014428546,0.000025561014,0.0005710115,0.8302001,0.16416708,0.0010963554],"study_design_scores_gemma":[0.0003611223,0.00031989533,0.000002164375,0.0010238994,0.00020682516,0.00038505087,0.00063747517,0.009165646,0.0010628504,0.88367075,0.102787025,0.00037731748],"about_ca_topic_score_codex":3.491027e-7,"about_ca_topic_score_gemma":0.0000010275318,"teacher_disagreement_score":0.40372694,"about_ca_system_score_codex":0.00009792029,"about_ca_system_score_gemma":0.0001234159,"threshold_uncertainty_score":0.9999836},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037683797,0.0062509743,0.4594504,0.009556892,0.26864076,0.0015086842,0.0013748043,0.0012971183,0.25154352],"genre_scores_gemma":[0.0036436196,0.0038218813,0.76754403,0.000790853,0.008434308,0.00006746279,0.00014424726,0.00038230166,0.21517126],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664634,0.00011984968,0.001100045,0.0007330705,0.0008029485,0.00059775246],"domain_scores_gemma":[0.9973867,0.00025457912,0.0007650693,0.0010054791,0.00023119753,0.00035698139],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00093290076,0.00063904823,0.0008093332,0.00063155615,0.00070529437,0.0023365733,0.0013529713,0.00045479235,0.000016749138],"category_scores_gemma":[0.00038221898,0.0005158857,0.00039685678,0.0005742196,0.00035834426,0.00046602916,0.0006200887,0.0038046706,0.000051994994],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013895879,0.00013263666,5.942693e-7,0.0010620988,0.0004733709,0.00032081056,0.0044959215,0.0000110947385,0.00003843162,0.17289655,0.8117039,0.0088507],"study_design_scores_gemma":[0.000932285,0.00039417428,0.000013299176,0.0058432054,0.00024902067,0.0049852254,0.0007239537,0.19559078,0.00003529287,0.5075292,0.28242356,0.00128005],"about_ca_topic_score_codex":0.000007468956,"about_ca_topic_score_gemma":0.000018715355,"teacher_disagreement_score":0.52928036,"about_ca_system_score_codex":0.00013769262,"about_ca_system_score_gemma":0.00031962173,"threshold_uncertainty_score":0.9997293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26863387,0.0050048796,0.69477385,0.0133249285,0.004258403,0.0014940223,0.00005658517,0.00041699814,0.012036433],"genre_scores_gemma":[0.9573935,0.00006375824,0.041219212,0.00008665307,0.000180333,0.0000028466807,5.202952e-7,0.0000382641,0.0010148577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975666,0.00023335972,0.00048592192,0.00033189257,0.0010145267,0.00036773208],"domain_scores_gemma":[0.99795794,0.00035197078,0.00022969293,0.0011609525,0.00017557677,0.00012388347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011553393,0.00022573331,0.00027818495,0.00020611951,0.00024628083,0.00033187127,0.001692295,0.00005797491,0.00004347042],"category_scores_gemma":[0.00043163556,0.00011555887,0.0002555507,0.00082545227,0.00020744998,0.00040608592,0.00039677566,0.00085131265,0.00002184044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013847379,0.000050137205,0.000018321616,0.00021104231,0.000059517395,0.00007306161,0.0018668218,0.00045183135,0.013612084,0.9750266,0.00092741917,0.0076893135],"study_design_scores_gemma":[0.00014573822,0.00014685861,0.0001705905,0.0007857247,0.000019802123,0.0007671099,0.00015977165,0.016323222,0.025330976,0.9542945,0.0016730834,0.00018263224],"about_ca_topic_score_codex":2.784601e-7,"about_ca_topic_score_gemma":6.956845e-7,"teacher_disagreement_score":0.6887597,"about_ca_system_score_codex":0.00005726919,"about_ca_system_score_gemma":0.00013437113,"threshold_uncertainty_score":0.4712354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35545444,0.0026336645,0.6309325,0.0053434144,0.001117269,0.00085487694,0.00004648675,0.0005761971,0.0030411244],"genre_scores_gemma":[0.7671129,0.00020228942,0.23106796,0.0004520403,0.00003887289,0.000024710811,0.0000023614168,0.00006166711,0.0010371566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845874,0.000038463288,0.0003938637,0.000306798,0.00042524887,0.00037690956],"domain_scores_gemma":[0.99886715,0.00026856276,0.00018695678,0.0003696862,0.000103108774,0.00020453152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067342375,0.00023948078,0.00031315486,0.0001637398,0.00028339718,0.0007826106,0.00033439734,0.00006510649,0.000026290878],"category_scores_gemma":[0.000053288233,0.00014904789,0.0001382307,0.00032092287,0.00005883016,0.00031481823,0.0000727791,0.00028713816,0.00006195365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017457629,0.00017387938,0.00020656796,0.0012201793,0.00022021006,0.0001728076,0.003264654,0.00006963664,0.00018428105,0.9851677,0.007844676,0.0014579553],"study_design_scores_gemma":[0.001275,0.00062596163,0.00014140194,0.003719055,0.00011400997,0.0020581267,0.00057963113,0.14098606,0.00040913207,0.845033,0.0045101056,0.00054850575],"about_ca_topic_score_codex":4.0682963e-7,"about_ca_topic_score_gemma":0.000001361681,"teacher_disagreement_score":0.4116585,"about_ca_system_score_codex":0.000019637228,"about_ca_system_score_gemma":0.000052152587,"threshold_uncertainty_score":0.7546732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031072604,0.0009453941,0.9639755,0.0020102572,0.00085424946,0.00027791935,0.000013490123,0.0000657571,0.0007848606],"genre_scores_gemma":[0.5705583,0.000057905043,0.42832196,0.000058058627,0.00030316133,0.000013196208,0.0000057770885,0.000018204842,0.00066345086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877566,0.000032437154,0.00040991363,0.00020901396,0.00037821097,0.00019473782],"domain_scores_gemma":[0.99908656,0.00021699574,0.00014651325,0.00023934504,0.00022650683,0.000084075706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061191875,0.00013408701,0.00019547508,0.00025728962,0.000110709865,0.00025237,0.00037099727,0.000039955503,0.000011840068],"category_scores_gemma":[0.00013975383,0.000103753206,0.00014032664,0.0005618482,0.000025803689,0.00034833324,0.000042654177,0.00015075742,0.000013350212],"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.000013216248,0.00019867618,0.000005878432,0.000822464,0.00013312069,0.000029845669,0.0031320637,0.0104628205,0.008186547,0.95438963,0.0047893017,0.017836431],"study_design_scores_gemma":[0.00081491016,0.0016715174,0.00012962506,0.0011855348,0.00010719019,0.0006650542,0.0002522385,0.6840688,0.065873325,0.2272231,0.017393203,0.0006155219],"about_ca_topic_score_codex":2.2742182e-7,"about_ca_topic_score_gemma":2.4531622e-7,"teacher_disagreement_score":0.72716653,"about_ca_system_score_codex":0.000028047141,"about_ca_system_score_gemma":0.00016469034,"threshold_uncertainty_score":0.4230933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79060566,0.0006760062,0.015220004,0.0020279784,0.0061650397,0.0009530877,0.00008325229,0.00076597976,0.18350297],"genre_scores_gemma":[0.96969146,0.00009500243,0.024774903,0.000498563,0.0006174265,0.000015073179,0.000002507099,0.00015835928,0.0041467333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758404,0.00011761557,0.00072070945,0.00030377545,0.0007873965,0.0004864796],"domain_scores_gemma":[0.9968992,0.00201589,0.00022023817,0.0005417944,0.00007027614,0.0002526064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009403338,0.0004112741,0.00047477992,0.00029189646,0.00043110203,0.00038068788,0.00047860612,0.00018400325,0.00083228905],"category_scores_gemma":[0.0009434855,0.0002619022,0.00046291907,0.00024872064,0.00013587406,0.00016009444,0.000094525596,0.0010836511,0.00025416928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046273508,0.00013567931,0.0000037401896,0.00038660117,0.00022092123,0.00026980686,0.0035140992,0.00004632115,0.00008678984,0.978679,0.01520215,0.001408646],"study_design_scores_gemma":[0.00038325362,0.00032978607,0.000012094763,0.0011206573,0.00012319765,0.0005091087,0.0005922651,0.0029885941,0.000474908,0.98766476,0.005444743,0.00035660883],"about_ca_topic_score_codex":5.031113e-7,"about_ca_topic_score_gemma":0.0000010588395,"teacher_disagreement_score":0.17935623,"about_ca_system_score_codex":0.00013340212,"about_ca_system_score_gemma":0.000052200787,"threshold_uncertainty_score":0.9999833},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93686014,0.0029496222,0.0314204,0.0009759875,0.0025823077,0.00059416925,0.00018784749,0.00028691042,0.024142608],"genre_scores_gemma":[0.9793322,0.00023607636,0.01957308,0.00010800825,0.00026161212,0.0000061447804,0.000004687939,0.00007901074,0.00039916742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971949,0.00018121465,0.0010777694,0.00023749891,0.00091325986,0.000395356],"domain_scores_gemma":[0.99732596,0.0013717514,0.00041321482,0.0005452807,0.00013708031,0.00020671969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014086196,0.00035307562,0.0006350965,0.0002972062,0.0002654653,0.00013497868,0.0005459236,0.00015268938,0.0006564335],"category_scores_gemma":[0.00035849962,0.00023633752,0.00064182177,0.00031911026,0.00027379952,0.00016360047,0.0001384277,0.0008089089,0.000023094484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045215296,0.00017379134,0.00008170506,0.000772106,0.0003629138,0.00008870496,0.002016037,0.000009556107,0.00047725064,0.99038565,0.0031416784,0.0024454165],"study_design_scores_gemma":[0.00030662527,0.00021807394,0.00011859455,0.00070994,0.00017376959,0.00051573256,0.0002640992,0.0018417132,0.0013927626,0.99175155,0.0024421257,0.00026500743],"about_ca_topic_score_codex":0.0000010410803,"about_ca_topic_score_gemma":0.0000013106264,"teacher_disagreement_score":0.042472064,"about_ca_system_score_codex":0.0000623226,"about_ca_system_score_gemma":0.00006446513,"threshold_uncertainty_score":0.9637565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27619192,0.0018986206,0.6997932,0.0034277218,0.0008806611,0.0017852266,0.000098749966,0.0002762235,0.015647665],"genre_scores_gemma":[0.98822755,0.00023162038,0.010881955,0.00023769996,0.00014760665,0.000056504035,0.0000028897002,0.000069200316,0.00014498059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997433,0.00013034826,0.00085088814,0.00027561237,0.00088209455,0.00042806996],"domain_scores_gemma":[0.9965127,0.0027488247,0.00021196186,0.0002889667,0.0000782678,0.0001592643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018032356,0.00033405892,0.00050913414,0.00012771993,0.0001724877,0.0005440446,0.00041432565,0.00013747973,0.00015523033],"category_scores_gemma":[0.0016887439,0.00019273706,0.00011497506,0.00033867883,0.000072656025,0.000180475,0.000058279627,0.00093977066,0.00006267941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006652647,0.00035937387,0.000016410835,0.004663078,0.00013512597,0.0007728267,0.013930203,0.000022528078,0.000032791122,0.9750668,0.0018990566,0.0030352792],"study_design_scores_gemma":[0.0006605465,0.00019443911,0.000016967026,0.002265123,0.00012583402,0.0022774232,0.0024219947,0.048287734,0.000049931652,0.9432852,0.00016175071,0.0002530147],"about_ca_topic_score_codex":0.0000013802032,"about_ca_topic_score_gemma":0.000006717089,"teacher_disagreement_score":0.7120356,"about_ca_system_score_codex":0.00007704473,"about_ca_system_score_gemma":0.00011773912,"threshold_uncertainty_score":0.7859589},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58546853,0.0041902037,0.048181325,0.0042074365,0.008927741,0.0011224722,0.000101150545,0.0014041058,0.34639707],"genre_scores_gemma":[0.9611326,0.00022356326,0.031562746,0.00033173437,0.0010161503,0.00001090891,0.0000023879347,0.00015406843,0.005565833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977855,0.00008984846,0.00068978226,0.0002606608,0.00071533315,0.0004588534],"domain_scores_gemma":[0.9980612,0.00093116175,0.00017956238,0.0005335987,0.000072497205,0.00022201196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012220948,0.0003541871,0.0004317641,0.00028828176,0.0004431096,0.00043763395,0.0005049966,0.00016157984,0.0008229849],"category_scores_gemma":[0.00045911988,0.00022514319,0.00044260052,0.0002837374,0.00013941019,0.00021116783,0.00012502566,0.0009002122,0.00011517515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015767833,0.000062360516,0.000014036181,0.00039512783,0.00019075513,0.00024968458,0.0032078552,0.000010315893,0.00010146966,0.97675073,0.017172584,0.0018292883],"study_design_scores_gemma":[0.00022823346,0.0001592041,0.0000132767445,0.0007698242,0.000104428735,0.0012038423,0.00048553257,0.001295412,0.00033062868,0.98000884,0.015096222,0.00030457336],"about_ca_topic_score_codex":2.308989e-7,"about_ca_topic_score_gemma":5.444078e-7,"teacher_disagreement_score":0.37566411,"about_ca_system_score_codex":0.0000818647,"about_ca_system_score_gemma":0.00006064316,"threshold_uncertainty_score":0.9181073},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6312539,0.004003489,0.35260373,0.001970091,0.0010292405,0.00044306205,0.00012475607,0.00009737734,0.00847437],"genre_scores_gemma":[0.9246146,0.0015047947,0.065961204,0.0012151649,0.0018265017,0.000023765495,0.00010194823,0.000108898384,0.0046431446],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987945,0.000051045496,0.00034496424,0.00026408702,0.0002916106,0.00025382338],"domain_scores_gemma":[0.99926895,0.00003148921,0.00008253549,0.00030857386,0.00006749861,0.00024093632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004166304,0.00019501669,0.00022728217,0.00014617605,0.00010857219,0.00033410706,0.00028272343,0.00010236657,0.00017000435],"category_scores_gemma":[0.000078220146,0.00013686021,0.00024721748,0.00022179284,0.000029771118,0.000021237809,0.000042076816,0.00018980926,0.00020275496],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063611247,0.00080505165,0.00009811337,0.00047989024,0.0018204231,0.00090119184,0.0025580013,0.003923026,0.6479198,0.0030107226,0.032747317,0.30510035],"study_design_scores_gemma":[0.005022855,0.010943347,0.00019897969,0.0025412233,0.0015165531,0.0033874395,0.005470872,0.14018314,0.38843647,0.07098687,0.36715746,0.004154824],"about_ca_topic_score_codex":0.0000034097923,"about_ca_topic_score_gemma":0.000003440263,"teacher_disagreement_score":0.33441013,"about_ca_system_score_codex":0.000025075315,"about_ca_system_score_gemma":0.000059261736,"threshold_uncertainty_score":0.55809975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13656521,0.0036089313,0.66883904,0.005527624,0.012163156,0.0017972293,0.00006287088,0.00305373,0.16838224],"genre_scores_gemma":[0.6305369,0.0002483712,0.35787082,0.0002559308,0.0021562367,0.00003834832,0.0000041134845,0.0005211128,0.0083681485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967472,0.00010188238,0.0011195749,0.00035387566,0.0010290794,0.00064836454],"domain_scores_gemma":[0.9967311,0.0017696974,0.00036347166,0.0006746003,0.00013360546,0.00032754833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011406222,0.00050845806,0.0006748931,0.00036714872,0.00034202042,0.0008065697,0.00059809367,0.00017595844,0.00037299146],"category_scores_gemma":[0.0015337402,0.00037487815,0.00041641347,0.0004889557,0.00011419499,0.00047890513,0.0001287617,0.0010522954,0.00045147003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013540948,0.0002081135,0.0000021392852,0.0008705169,0.00015917498,0.0003271158,0.0019730993,0.000021971255,0.0006269824,0.9867729,0.0057970374,0.003227388],"study_design_scores_gemma":[0.00032881091,0.000220622,0.0000017839703,0.0023649833,0.00013895522,0.0010133822,0.00066156714,0.003853443,0.0018322592,0.97892255,0.010203051,0.00045857346],"about_ca_topic_score_codex":3.739438e-7,"about_ca_topic_score_gemma":5.228552e-7,"teacher_disagreement_score":0.4939717,"about_ca_system_score_codex":0.0002595478,"about_ca_system_score_gemma":0.00014272844,"threshold_uncertainty_score":0.9998703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33303368,0.0010338924,0.64833975,0.001375264,0.0018822226,0.0002156546,0.00002522446,0.0004950577,0.0135992905],"genre_scores_gemma":[0.97101974,0.00014050203,0.028324667,0.0002162754,0.00015582322,0.0000028980537,6.921678e-7,0.000018795841,0.00012057578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986092,0.00007983964,0.0004349022,0.00019241187,0.00044503127,0.00023862132],"domain_scores_gemma":[0.998735,0.00057305896,0.0001504506,0.00036682741,0.000055907814,0.000118731376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073477306,0.00018148114,0.00025227197,0.00024812328,0.00012411783,0.00039074608,0.0005698411,0.000081036786,0.00018474548],"category_scores_gemma":[0.00007179791,0.00013424686,0.00027154587,0.0004667571,0.00004799988,0.00033001954,0.00012641474,0.00041401322,0.000042604013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001120719,0.00015348775,0.000058934376,0.0002867002,0.0002212589,0.00014662683,0.00607497,0.00016376417,0.00028346374,0.98397565,0.0022430841,0.006380864],"study_design_scores_gemma":[0.00047786892,0.0010002821,0.0001598297,0.0015820235,0.00012651154,0.00043507398,0.00035136467,0.3188389,0.004105939,0.66115767,0.011153866,0.0006106872],"about_ca_topic_score_codex":4.2540225e-7,"about_ca_topic_score_gemma":4.9667347e-7,"teacher_disagreement_score":0.6379861,"about_ca_system_score_codex":0.000020465233,"about_ca_system_score_gemma":0.00006887344,"threshold_uncertainty_score":0.5474428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97452945,0.0011650069,0.012894818,0.00079717,0.0012867547,0.0004129094,0.00014854605,0.00015095594,0.008614399],"genre_scores_gemma":[0.97817695,0.00019114379,0.019282298,0.000118534415,0.00032286873,0.0000070217357,0.000001970403,0.00011858929,0.0017806124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973293,0.00011154464,0.0009991406,0.00027653956,0.00084447773,0.0004389936],"domain_scores_gemma":[0.9975305,0.0009574508,0.0005804867,0.0006180613,0.00013163355,0.0001818659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001154726,0.00038289247,0.00070059247,0.00035649186,0.00027890666,0.00021702882,0.00058609963,0.00018175521,0.00034542292],"category_scores_gemma":[0.00045015418,0.00025328711,0.0005523695,0.00023224465,0.00012944968,0.00021447682,0.00014377112,0.00077482313,0.000025589528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007399247,0.00016061394,0.0002217295,0.002703957,0.0005812842,0.0002080092,0.019023947,0.000030506577,0.00092088414,0.9656306,0.008251612,0.0021928588],"study_design_scores_gemma":[0.00038096317,0.0001727561,0.00026358117,0.0026782453,0.00021650142,0.0003230509,0.0021427018,0.0015523547,0.0031352772,0.98747635,0.0013278396,0.0003303716],"about_ca_topic_score_codex":0.0000011735362,"about_ca_topic_score_gemma":0.000004193823,"teacher_disagreement_score":0.021845752,"about_ca_system_score_codex":0.000078069774,"about_ca_system_score_gemma":0.00006929642,"threshold_uncertainty_score":0.99999195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.240896,0.000065830325,0.75072885,0.0053935805,0.00034035716,0.00046610783,0.000029954239,0.00010303794,0.0019762956],"genre_scores_gemma":[0.9191262,0.000020347567,0.080351196,0.00023486644,0.000061348714,0.000019342637,0.0000020104214,0.00003539588,0.00014929412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704546,0.00032524948,0.000648338,0.00031921803,0.0012063057,0.00045542742],"domain_scores_gemma":[0.99687237,0.001347527,0.00021188121,0.0012050925,0.00013169133,0.00023143608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017050275,0.0002600159,0.00038545433,0.00033539714,0.00025350644,0.0004773935,0.0022637951,0.000059066268,0.00007273949],"category_scores_gemma":[0.0005952407,0.00015773508,0.00025350487,0.0006730769,0.00023024685,0.00029257848,0.0004898697,0.00070519623,0.00016230253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052501517,0.00012195471,0.0000026934715,0.000094304414,0.0000711499,0.000040082654,0.00085447496,0.0005225866,0.0042693275,0.9918197,0.0006953809,0.0014558692],"study_design_scores_gemma":[0.00031293076,0.00057319825,0.00010872115,0.00082951225,0.000013753171,0.000100651865,0.00015634355,0.09422135,0.0034128414,0.8997489,0.00032075308,0.00020099108],"about_ca_topic_score_codex":0.0000014545246,"about_ca_topic_score_gemma":0.0000010275616,"teacher_disagreement_score":0.67823017,"about_ca_system_score_codex":0.000104814215,"about_ca_system_score_gemma":0.000053163196,"threshold_uncertainty_score":0.64322495},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022908651,0.00679496,0.62484235,0.002325188,0.063325845,0.001077453,0.00053139287,0.00048517904,0.30038854],"genre_scores_gemma":[0.0062943297,0.0060190377,0.39811465,0.000530517,0.0034513643,0.00012701053,0.00029181238,0.0007527467,0.58441854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952421,0.00023231494,0.0013076027,0.0005808328,0.0019119385,0.0007251988],"domain_scores_gemma":[0.9965683,0.00033233815,0.0009439422,0.0013456539,0.0003919906,0.00041773866],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011239756,0.0006139143,0.00097431673,0.0013489675,0.0003138744,0.0005341951,0.0029497605,0.00039280485,0.00017870525],"category_scores_gemma":[0.00017279918,0.00047136453,0.00095081097,0.0012550924,0.00029856863,0.00039320483,0.0005894651,0.0036967453,0.0002860017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013250514,0.00019634413,0.0000015682228,0.0005876945,0.00029223596,0.00036921282,0.0005607166,0.000035473124,0.00010458964,0.6268518,0.3690061,0.0019810405],"study_design_scores_gemma":[0.0002626392,0.00061058206,0.000011977226,0.002881766,0.000115250434,0.0010853851,0.00013062079,0.009484598,0.00018377362,0.93293977,0.05170768,0.00058597105],"about_ca_topic_score_codex":6.6579884e-7,"about_ca_topic_score_gemma":0.000005897439,"teacher_disagreement_score":0.3172984,"about_ca_system_score_codex":0.00014565556,"about_ca_system_score_gemma":0.00060830975,"threshold_uncertainty_score":0.9997738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18597181,0.00020032392,0.80090064,0.0013202801,0.00043407246,0.0004338008,0.0000036569156,0.00014993218,0.010585499],"genre_scores_gemma":[0.9591712,0.000049315488,0.040051162,0.0002846924,0.000027217151,0.000024083574,0.000001102447,0.000022533479,0.00036873616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739766,0.0003894284,0.0006343088,0.0003963066,0.0005733582,0.0006089315],"domain_scores_gemma":[0.9973082,0.0013273667,0.00024654,0.00079071877,0.00014450212,0.00018269946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018078265,0.00027736666,0.00045557792,0.0009288681,0.00026858604,0.00033877103,0.001494392,0.000109195615,0.00003578182],"category_scores_gemma":[0.00094761833,0.00022508243,0.00020061183,0.0018755302,0.00013561812,0.0005970251,0.0003123287,0.00086236896,0.000040746305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045367004,0.00027938912,0.00029432823,0.00007093996,0.000046768113,0.00011802472,0.00060313416,0.00011671971,0.002070558,0.991887,0.00017923802,0.004288566],"study_design_scores_gemma":[0.0011105171,0.00025115313,0.0010527704,0.00038928556,0.000007873004,0.000070439,0.0002466563,0.015484002,0.0018709148,0.9790548,0.00020288817,0.0002586976],"about_ca_topic_score_codex":0.0000020988716,"about_ca_topic_score_gemma":0.00001605923,"teacher_disagreement_score":0.7731993,"about_ca_system_score_codex":0.00015665499,"about_ca_system_score_gemma":0.00010976674,"threshold_uncertainty_score":0.91785955},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041015774,0.004284775,0.4615051,0.0023583237,0.0038404309,0.00074832473,0.000103228456,0.0002919922,0.48585206],"genre_scores_gemma":[0.9768397,0.0020252208,0.018744951,0.00012268976,0.00014318844,0.0000031571128,0.0000057404245,0.00007995442,0.002035399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980993,0.00006265402,0.00096894323,0.00014463831,0.00037880402,0.0003456419],"domain_scores_gemma":[0.99872154,0.00024350673,0.0004000423,0.0003712706,0.00013440604,0.00012922545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005081755,0.00031121573,0.000549528,0.00043450238,0.00015072832,0.00025921318,0.00032553522,0.00017302633,0.00030951377],"category_scores_gemma":[0.00022222719,0.00027070474,0.0002686026,0.00049563346,0.000072702496,0.00013260485,0.000057976416,0.0006236155,0.00006182138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043500302,0.0004701584,0.0015716765,0.007811352,0.001223193,0.000052836982,0.004249502,0.2916909,0.0018008588,0.6774255,0.0063511846,0.007309344],"study_design_scores_gemma":[0.0054391176,0.0010432185,0.002416407,0.05580914,0.0014603338,0.00032616442,0.0027578082,0.73166466,0.01641401,0.11309917,0.067195676,0.002374291],"about_ca_topic_score_codex":0.0000011264204,"about_ca_topic_score_gemma":5.684457e-7,"teacher_disagreement_score":0.9358239,"about_ca_system_score_codex":0.00010572765,"about_ca_system_score_gemma":0.000089273366,"threshold_uncertainty_score":0.9999745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11035492,0.00007511379,0.8752127,0.000995569,0.00044715736,0.0000973735,0.0000019384076,0.000049785805,0.012765393],"genre_scores_gemma":[0.90046,0.000013786855,0.09877639,0.00020513189,0.000054114862,0.000002395038,5.233696e-7,0.000008031343,0.00047961783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875873,0.00007060799,0.0005057002,0.0001508095,0.00030481795,0.000209341],"domain_scores_gemma":[0.9988459,0.00036232514,0.00031621143,0.00032701116,0.00007556126,0.00007302338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905702,0.0001426602,0.00025927115,0.0002158401,0.00013220121,0.0002150231,0.0006699902,0.000043580312,0.000019108322],"category_scores_gemma":[0.00016658154,0.00010358959,0.00016177677,0.00031740582,0.00005468509,0.00022290541,0.00014839451,0.0002250238,0.000012583677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001055916,0.00011629247,0.00002663558,0.00006876957,0.000078787445,0.000010801417,0.0023800025,0.00022153411,0.0006138033,0.9590803,0.00045275287,0.036939785],"study_design_scores_gemma":[0.0005833173,0.00018559885,0.00025762714,0.0005761203,0.000025797393,0.000046313548,0.00024543313,0.08938535,0.005688573,0.902206,0.0006154249,0.00018444247],"about_ca_topic_score_codex":0.0000010876169,"about_ca_topic_score_gemma":7.415234e-7,"teacher_disagreement_score":0.7901051,"about_ca_system_score_codex":0.00004216839,"about_ca_system_score_gemma":0.00010144246,"threshold_uncertainty_score":0.42242607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8409954,0.0003021936,0.010555183,0.0008008401,0.0014575056,0.0004913134,0.000036312584,0.000100767735,0.14526048],"genre_scores_gemma":[0.9643976,0.00012737357,0.033168808,0.00031427707,0.00007116416,0.0000064879055,0.0000015781153,0.00004859559,0.0018641343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761033,0.00014839458,0.0010584965,0.0002083995,0.0005788446,0.0003955069],"domain_scores_gemma":[0.99742883,0.0009944486,0.000592315,0.0006586948,0.00016174333,0.00016394982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010265252,0.0003132246,0.00069024676,0.00031639042,0.00030543286,0.000065019114,0.00061902363,0.00018720208,0.00025635454],"category_scores_gemma":[0.00095986744,0.00022001806,0.00048358573,0.00039765096,0.00028049195,0.00009321022,0.00015508522,0.0006813243,0.000007208999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066732486,0.00018966636,0.0002468087,0.00031566515,0.00027788826,0.000027431834,0.0013296647,0.000015317486,0.00014380734,0.9904235,0.0062522492,0.0007112766],"study_design_scores_gemma":[0.0007389584,0.00013267026,0.00016109299,0.0006946315,0.00016704293,0.000112923044,0.00073871535,0.00017747364,0.0013273802,0.9938652,0.0016639931,0.00021995304],"about_ca_topic_score_codex":0.0000027453777,"about_ca_topic_score_gemma":0.0000056778213,"teacher_disagreement_score":0.14339635,"about_ca_system_score_codex":0.00006518601,"about_ca_system_score_gemma":0.00012935569,"threshold_uncertainty_score":0.8972076},"labels":[],"label_agreement":null}]}