{"meta":{"query_hash":"383180bb94b5","filters":{"venue":"Journal of Graph Theory"},"cohort_total":240,"direct_labels_cover":0,"predictions_cover":240,"exported":240,"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/383180bb94b5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Graph+Theory"},"results":[{"id":"W100995880","doi":"10.1002/jgt.20611","title":"Random graphons and a weak Positivstellensatz for graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics; Multiplicative function; Random graph; Countable set; Graph; Ergodic theory; Pure mathematics","score_opus":0.041843984161114615,"score_gpt":0.2771186155277397,"score_spread":0.23527463136662508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100995880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9596924,0.003075106,0.023363497,0.000085540014,0.0012587154,0.0005629001,0.00003135135,0.00004876277,0.011881723],"genre_scores_gemma":[0.9787424,0.00041290993,0.020358862,0.00014543103,0.000117342504,0.000008974234,4.7202542e-7,0.000045111126,0.00016847669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831206,0.00030082552,0.0006773012,0.00017387241,0.00023452505,0.00030139342],"domain_scores_gemma":[0.99702865,0.0016734482,0.0005814839,0.00028268702,0.00025574514,0.00017801343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024688262,0.00024369266,0.00056114607,0.00056570733,0.00031752992,0.000025282663,0.00032493775,0.00014222715,0.00008812998],"category_scores_gemma":[0.00045499342,0.00016862349,0.0006349905,0.00021440702,0.0004142728,0.0001834717,0.00006113121,0.00029489116,4.1932475e-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.0025357017,0.000112618916,0.0006117783,0.0000777373,0.00047325387,0.000017838283,0.0042446284,1.436963e-7,0.0004946253,0.9874488,0.0011952405,0.002787606],"study_design_scores_gemma":[0.003017101,0.00050413696,0.0011037599,0.00009599863,0.000366156,0.00046857804,0.0011977095,0.0000022081758,0.0017155566,0.9908939,0.0004268624,0.00020804629],"about_ca_topic_score_codex":0.0000015582451,"about_ca_topic_score_gemma":0.000002099474,"teacher_disagreement_score":0.019050015,"about_ca_system_score_codex":0.00000871138,"about_ca_system_score_gemma":0.000027147698,"threshold_uncertainty_score":0.6876266},"labels":[],"label_agreement":null},{"id":"W1481913488","doi":"10.1002/jgt.20649","title":"An asymptotically tight bound on the adaptable chromatic number","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Integer (computer science); Graph; Upper and lower bounds; Edge coloring; Critical graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Graph power; Line graph","score_opus":0.022410699323175753,"score_gpt":0.2992226052457742,"score_spread":0.27681190592259847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481913488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5349398,0.0007373346,0.4442875,0.001594172,0.0010510301,0.00024641913,0.0000014662343,0.0000696168,0.01707265],"genre_scores_gemma":[0.99116033,0.000034454686,0.007543828,0.00071585784,0.0002690019,0.0000044199483,1.6631029e-7,0.000020265403,0.0002516503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968669,0.0011324651,0.0004277272,0.0001608175,0.000823543,0.00058854296],"domain_scores_gemma":[0.9967953,0.0014610131,0.00030044783,0.0008613655,0.00021950837,0.00036237325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006066856,0.00017932872,0.0002567773,0.00022363006,0.0003173294,0.00019724881,0.001962577,0.00006962735,0.0003368927],"category_scores_gemma":[0.00033222188,0.00010304022,0.00021300366,0.00064147153,0.0003106596,0.0016289295,0.0001218229,0.0006238411,0.0001781554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008051698,0.00027063405,0.0007710693,0.000006303095,0.00006795372,0.000017054866,0.0006481867,0.00005628748,0.0016632042,0.99295545,0.0005742453,0.0028891154],"study_design_scores_gemma":[0.00031305343,0.00040358666,0.0044544437,0.000065589105,0.000018583432,0.00034513054,0.00018266229,0.00041477676,0.0027239057,0.989207,0.0016950368,0.0001762116],"about_ca_topic_score_codex":6.309047e-7,"about_ca_topic_score_gemma":4.5699753e-7,"teacher_disagreement_score":0.45622054,"about_ca_system_score_codex":0.000051616593,"about_ca_system_score_gemma":0.00009453635,"threshold_uncertainty_score":0.4201858},"labels":[],"label_agreement":null},{"id":"W1491785597","doi":"10.1002/jgt.21850","title":"A Brooks‐Type Theorem for the Bichromatic Number","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Brooks' theorem; Perfect graph; Perfect graph theorem; Clique number; Extremal graph theory; Discrete mathematics; Graph; List coloring; Graph coloring; Chromatic scale; Graph power; Line graph; Voltage graph","score_opus":0.01930900589953868,"score_gpt":0.3015448466994069,"score_spread":0.28223584079986824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491785597","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.017890941,0.0006017946,0.97651,0.00093851076,0.0008158758,0.00023642955,0.0000010964469,0.000038062808,0.002967324],"genre_scores_gemma":[0.96853185,0.00008073181,0.029920109,0.0006584199,0.00028289374,0.000010790971,2.1206618e-7,0.000025408443,0.0004895925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978827,0.00062962685,0.00044763365,0.00017856686,0.0004914415,0.0003699867],"domain_scores_gemma":[0.99354225,0.004752371,0.0003886992,0.0007250108,0.0004564085,0.00013526733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065939636,0.00015832152,0.00028013118,0.0002052691,0.00028829474,0.00012887632,0.002160001,0.000058119174,0.000054206692],"category_scores_gemma":[0.0011927183,0.00008935916,0.00032802293,0.0006527014,0.00032925454,0.00043902968,0.00015521373,0.0003455375,0.000048129576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001622891,0.00004190198,0.00010918142,0.000017663202,0.00010051056,0.000004455321,0.00041976757,0.00009307415,0.0007232796,0.9675447,0.001093112,0.029690078],"study_design_scores_gemma":[0.0005782272,0.00031696964,0.000454096,0.000047712263,0.00002791972,0.00023191547,0.000111001056,0.002123853,0.0008330698,0.9879138,0.0072423667,0.00011905785],"about_ca_topic_score_codex":6.465224e-7,"about_ca_topic_score_gemma":8.689389e-7,"teacher_disagreement_score":0.9506409,"about_ca_system_score_codex":0.000024906933,"about_ca_system_score_gemma":0.0000853006,"threshold_uncertainty_score":0.40138552},"labels":[],"label_agreement":null},{"id":"W1493471320","doi":"10.1002/jgt.20641","title":"On the hamiltonicity of line graphs of locally finite, 6‐edge‐connected graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Line graph; 1-planar graph; Indifference graph; Discrete mathematics; Chordal graph; Pathwidth; Block graph; Symmetric graph; Graph; Voltage graph","score_opus":0.03758313666899045,"score_gpt":0.27017101973377083,"score_spread":0.2325878830647804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493471320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68057764,0.0011994077,0.31260562,0.00020591164,0.0005254777,0.00034032305,0.000015480886,0.00004567407,0.004484501],"genre_scores_gemma":[0.99360377,0.00025293158,0.005821127,0.00022454259,0.000019766097,0.000004488142,3.99016e-7,0.00002318462,0.000049817652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599445,0.0011964267,0.0011433607,0.00029262295,0.00092687376,0.000446267],"domain_scores_gemma":[0.99252385,0.0036413667,0.0013341426,0.0011739256,0.0011320373,0.00019470681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00509205,0.00027947195,0.0006214451,0.001270718,0.00015308973,0.000024328052,0.0030744807,0.00013033852,0.00012814227],"category_scores_gemma":[0.0015410355,0.00017620734,0.0006976108,0.002313256,0.0011196423,0.00046374023,0.00027699088,0.0008447142,0.000005646608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091192196,0.0004690521,0.00049321,0.00003196053,0.00024985132,0.000039800783,0.0012110692,0.00019113263,0.0047204434,0.98681474,0.00012149309,0.0047453116],"study_design_scores_gemma":[0.00073881313,0.0017309464,0.0028457819,0.00018644801,0.00003382782,0.00004766255,0.00020155296,0.0002871353,0.048797358,0.9449374,0.000025981986,0.00016706903],"about_ca_topic_score_codex":0.0000077403265,"about_ca_topic_score_gemma":0.00000520863,"teacher_disagreement_score":0.31302613,"about_ca_system_score_codex":0.000019412571,"about_ca_system_score_gemma":0.00017294408,"threshold_uncertainty_score":0.71855265},"labels":[],"label_agreement":null},{"id":"W1506582321","doi":"10.1002/jgt.21667","title":"Forbidden Induced Subgraphs for Toughness","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Line graph; Discrete mathematics; Distance-hereditary graph; Voltage graph; Cubic graph; Symmetric graph","score_opus":0.0403595477434291,"score_gpt":0.3240029276503742,"score_spread":0.2836433799069451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506582321","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.31425586,0.0016662,0.6809027,0.00030197095,0.0014781334,0.00027594142,0.0000032079188,0.00004626785,0.0010696684],"genre_scores_gemma":[0.9749621,0.000047973423,0.024247099,0.00021019959,0.00036066055,0.000015210406,4.03917e-7,0.000023167882,0.00013314257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997884,0.00033546597,0.00048154197,0.00016740849,0.0004903092,0.0006412819],"domain_scores_gemma":[0.9973117,0.0010029229,0.0004123476,0.0005133123,0.00043088416,0.00032882436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004822924,0.00017482456,0.00032227067,0.000714671,0.0001826226,0.00007929081,0.0015732613,0.00009526209,0.00001595633],"category_scores_gemma":[0.00040859624,0.00013673618,0.00042316958,0.00082088384,0.000118428,0.0018048852,0.00015964257,0.00036182097,0.000008877517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022928539,0.00014426831,0.0012235316,0.00002122277,0.000098937126,0.0000076977985,0.0008410991,0.0000065875993,0.006744902,0.96810776,0.00046662535,0.022108095],"study_design_scores_gemma":[0.00086114905,0.00039406508,0.002252903,0.000036529207,0.00002233559,0.00018747491,0.00021468167,0.000027221455,0.02177295,0.97122097,0.0028028341,0.00020690315],"about_ca_topic_score_codex":5.827218e-7,"about_ca_topic_score_gemma":5.3224574e-7,"teacher_disagreement_score":0.6607063,"about_ca_system_score_codex":0.000037162183,"about_ca_system_score_gemma":0.00008381745,"threshold_uncertainty_score":0.55759394},"labels":[],"label_agreement":null},{"id":"W1540614089","doi":"10.1002/jgt.1025","title":"Fractional chromatic numbers of cones over graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":132,"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":"Chromatic scale; Mathematics; Combinatorics; Graph; Graph theory; Discrete mathematics","score_opus":0.010827262015729826,"score_gpt":0.25018495875165897,"score_spread":0.23935769673592913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540614089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6793921,0.0010873147,0.31557614,0.0005708907,0.00045878757,0.00003374548,0.0000053266504,0.000017731973,0.002857941],"genre_scores_gemma":[0.99584013,0.00029588648,0.0034744863,0.00022259376,0.000045415884,3.915769e-7,6.22867e-7,0.0000024182868,0.000118043885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879014,0.00013165739,0.00043469016,0.00010261883,0.00040846548,0.0001324305],"domain_scores_gemma":[0.9985694,0.0004594823,0.00051607046,0.00022029155,0.00014465436,0.00009008446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090407114,0.00008283841,0.0002703129,0.0006247319,0.000055571418,0.000031781285,0.000651851,0.000045289366,0.00054286525],"category_scores_gemma":[0.00018709706,0.000055133543,0.00032116004,0.0015443403,0.00013728917,0.00050753145,0.000065493026,0.00014806924,0.000009892611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097428514,0.00041434984,0.02521883,0.0000144281275,0.00052988244,0.00014095305,0.00018289904,0.00017587873,0.0007236792,0.9473434,0.0027339514,0.022424338],"study_design_scores_gemma":[0.00041641697,0.0001943259,0.06837199,0.000024073799,0.00006453588,0.00030823916,0.00009412634,0.00016896,0.00018470136,0.92702174,0.0030492702,0.00010159106],"about_ca_topic_score_codex":0.000012916462,"about_ca_topic_score_gemma":0.0000015990529,"teacher_disagreement_score":0.316448,"about_ca_system_score_codex":0.00001046384,"about_ca_system_score_gemma":0.00002859215,"threshold_uncertainty_score":0.5943994},"labels":[],"label_agreement":null},{"id":"W1542539758","doi":"10.1002/jgt.21795","title":"Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Vertex (graph theory); Bounded function; Independent set; Indifference graph; Discrete mathematics; Maximal independent set; Graph; 1-planar graph","score_opus":0.012063852795284016,"score_gpt":0.2689821085366713,"score_spread":0.2569182557413873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542539758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51339895,0.00008344269,0.48479915,0.00007970933,0.00032672146,0.00006608166,0.0000027700862,0.000014158499,0.0012290158],"genre_scores_gemma":[0.9863051,0.000058939335,0.013472002,0.00005278956,0.000029798677,0.0000015982923,5.591823e-7,0.000015477997,0.00006370223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781865,0.00048492945,0.0007198835,0.00016384567,0.000547501,0.00026517324],"domain_scores_gemma":[0.9974583,0.0005523286,0.0007962442,0.0005166472,0.00054563774,0.00013084336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021242178,0.00014294313,0.00041297817,0.0005692186,0.000089544796,0.000039457256,0.0012036228,0.00006352947,0.000054885524],"category_scores_gemma":[0.00034431962,0.00012132401,0.00028168753,0.00095330307,0.00033248018,0.000741847,0.00017530072,0.00028650602,0.0000049514656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001349677,0.00014270986,0.0037982124,0.00004657942,0.00010490022,0.0000052063947,0.00059768447,0.00006471668,0.05874786,0.9233626,0.000022375,0.012972149],"study_design_scores_gemma":[0.0007383261,0.0003311936,0.009183556,0.00013047417,0.000019128975,0.000106375235,0.000082503444,0.00043299733,0.019819794,0.96869296,0.00032414228,0.00013857441],"about_ca_topic_score_codex":0.0000013364839,"about_ca_topic_score_gemma":0.0000010641844,"teacher_disagreement_score":0.47290617,"about_ca_system_score_codex":0.000014132364,"about_ca_system_score_gemma":0.00007697495,"threshold_uncertainty_score":0.49474496},"labels":[],"label_agreement":null},{"id":"W1558652429","doi":"10.1002/jgt.21846","title":"Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homomorphism; Combinatorics; Corollary; Mixing (physics); Homotopy; Vertex (graph theory); Extension (predicate logic); Discrete mathematics; Graph; Pure mathematics","score_opus":0.02247292266172958,"score_gpt":0.28107603986392454,"score_spread":0.258603117202195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558652429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9254766,0.001079874,0.068265274,0.00012709391,0.0007221664,0.00009923589,0.0000010661075,0.000038707356,0.0041899458],"genre_scores_gemma":[0.9854769,0.00018594501,0.013549259,0.00012874948,0.00023673121,0.0000033108415,2.3451237e-7,0.000029801882,0.0003890673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857116,0.0003844154,0.00047828213,0.00014872459,0.00015992073,0.00025748293],"domain_scores_gemma":[0.9972571,0.0017855819,0.000541949,0.00018974188,0.000101965605,0.00012362353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038213741,0.00015920187,0.0004042166,0.00027242897,0.00020703868,0.000021012947,0.00021184416,0.00011986286,0.00012394057],"category_scores_gemma":[0.0015889849,0.00013336787,0.00015492289,0.00011945318,0.0002470989,0.00027264253,0.000054805016,0.00042888804,0.0000052411365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016011014,0.00005870758,0.00087275443,0.00007084996,0.00012098676,0.00004109428,0.00058113446,0.0000071337968,0.0016755091,0.9867036,0.00015453696,0.009553615],"study_design_scores_gemma":[0.00056877034,0.00021777145,0.0009717426,0.00011348011,0.00010185925,0.00058443926,0.0004112853,0.000010924542,0.0016030823,0.99294645,0.0023209923,0.00014919734],"about_ca_topic_score_codex":2.8020918e-7,"about_ca_topic_score_gemma":4.7125667e-7,"teacher_disagreement_score":0.060000263,"about_ca_system_score_codex":0.0000325292,"about_ca_system_score_gemma":0.000018595894,"threshold_uncertainty_score":0.54385835},"labels":[],"label_agreement":null},{"id":"W1559782353","doi":"10.1002/jgt.21797","title":"Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Conjecture; Claw; Homogeneous; Complement (music); Graph; Discrete mathematics; Pathwidth; Indifference graph; Strong perfect graph theorem; Chordal graph; 1-planar graph; Line graph","score_opus":0.009072508602622455,"score_gpt":0.2538911671698522,"score_spread":0.24481865856722976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559782353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8730875,0.004148228,0.11861265,0.0014192703,0.00053572026,0.0002518728,0.000008906553,0.00008461036,0.0018512106],"genre_scores_gemma":[0.9919607,0.00041551702,0.0070100403,0.0004448975,0.00006627234,0.0000032746277,3.9017286e-7,0.000023348657,0.00007558235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974413,0.0007148364,0.00042643707,0.00037087206,0.00060444535,0.00044210092],"domain_scores_gemma":[0.9974045,0.0010187714,0.00034482646,0.00070517266,0.00017436601,0.00035236994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028146347,0.0002722422,0.00042509672,0.00090162613,0.00023709542,0.00017063777,0.001135763,0.00012321497,0.000013727911],"category_scores_gemma":[0.0003588658,0.00020214474,0.00021761014,0.0005774955,0.0006696688,0.0006250421,0.00029811473,0.00077578664,0.0000025304778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016001186,0.000058587593,0.0009907768,0.000020728688,0.00008964136,0.000037850084,0.00025392856,0.000016096386,0.000851938,0.9598176,0.00038769984,0.037315127],"study_design_scores_gemma":[0.0013569114,0.0012642692,0.0066014333,0.000071106166,0.00002276902,0.00043236327,0.00007633846,0.00010875425,0.0005190946,0.98793155,0.0013940685,0.00022133505],"about_ca_topic_score_codex":0.0000012192442,"about_ca_topic_score_gemma":0.0000031141547,"teacher_disagreement_score":0.11887314,"about_ca_system_score_codex":0.000014991102,"about_ca_system_score_gemma":0.000038898103,"threshold_uncertainty_score":0.82432234},"labels":[],"label_agreement":null},{"id":"W1566173313","doi":"10.1002/jgt.20249","title":"The crossing number of <i>K</i><sub>11</sub> is 100","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossing number (knot theory); Combinatorics; Mathematics; Simple (philosophy); Graph; Exploit; Graph theory; Discrete mathematics; Computer science","score_opus":0.010164067260674911,"score_gpt":0.2722684164393138,"score_spread":0.2621043491786389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566173313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5233305,0.0004437082,0.47483724,0.00023090605,0.0005423738,0.000023870767,4.3509803e-7,0.0000058904798,0.0005850947],"genre_scores_gemma":[0.99276114,0.000042327072,0.006421863,0.00048325336,0.00021455949,2.4099353e-7,1.5586575e-7,0.000004729395,0.00007172136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987574,0.00010776393,0.00047531092,0.00009189983,0.00040234352,0.00016524347],"domain_scores_gemma":[0.99828094,0.0006274137,0.00046746773,0.00018802409,0.00036528715,0.00007086163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034468314,0.00007892036,0.00012589742,0.0001501544,0.0003117144,0.00016104654,0.0004698681,0.00003920931,0.000007791412],"category_scores_gemma":[0.00009328272,0.00005363489,0.00017753411,0.0005708489,0.00014096321,0.00036325745,0.000058488647,0.00014350528,0.000006027399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017357308,0.0001518712,0.0026667002,0.000016210004,0.000105251325,0.00003715693,0.00260317,0.0008781923,0.057585314,0.58808386,0.003801198,0.34389746],"study_design_scores_gemma":[0.0006315168,0.0001314935,0.014061485,0.00007752315,0.000026449197,0.00053668633,0.00017662102,0.0007609952,0.34552506,0.62670684,0.011188303,0.0001770023],"about_ca_topic_score_codex":8.576251e-7,"about_ca_topic_score_gemma":0.0000021802455,"teacher_disagreement_score":0.46943066,"about_ca_system_score_codex":0.000019071736,"about_ca_system_score_gemma":0.00011790686,"threshold_uncertainty_score":0.23974866},"labels":[],"label_agreement":null},{"id":"W1571206417","doi":"10.1002/jgt.22152","title":"Graph properties, graph limits, and entropy","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Limiting; Graph","score_opus":0.04169039496165616,"score_gpt":0.2858973154108309,"score_spread":0.24420692044917475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571206417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877133,0.00506346,0.0012437706,0.00041606717,0.0014592028,0.00023375853,0.000010884818,0.00004055185,0.0038190167],"genre_scores_gemma":[0.99433804,0.0017069448,0.0029114452,0.00021156463,0.00039229853,0.0000039008173,3.5167457e-7,0.000052029205,0.00038341782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772114,0.00034768353,0.0007702535,0.00024549357,0.00050529634,0.00041015435],"domain_scores_gemma":[0.9968042,0.0004039142,0.0013388741,0.00091063126,0.00028366386,0.00025873195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024241223,0.00033729113,0.00064785493,0.00047399814,0.00126321,0.0002444402,0.0010252108,0.00018886803,0.00007912153],"category_scores_gemma":[0.0012450878,0.00021905996,0.0005016693,0.00011466194,0.0010099876,0.0005352365,0.00019782831,0.0006279181,0.0000016938762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006186738,0.000120040044,0.003687233,0.00012486067,0.00047718504,0.000090391986,0.0014982761,9.902212e-7,0.0026761345,0.9820575,0.001908863,0.006739866],"study_design_scores_gemma":[0.0011462139,0.00028590875,0.0058598123,0.0002392183,0.0002462488,0.00044661437,0.00043548996,0.000002292478,0.0026301222,0.98685014,0.0015717364,0.00028622727],"about_ca_topic_score_codex":0.000004298077,"about_ca_topic_score_gemma":0.000004530818,"teacher_disagreement_score":0.00662476,"about_ca_system_score_codex":0.000019019892,"about_ca_system_score_gemma":0.0000515321,"threshold_uncertainty_score":0.97157174},"labels":[],"label_agreement":null},{"id":"W1577910185","doi":"10.1002/jgt.22182","title":"Dominating induced matchings in graphs containing no long claw","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Time complexity; Matching (statistics); Induced subgraph; Discrete mathematics; Graph","score_opus":0.03397447845630661,"score_gpt":0.3340140648915205,"score_spread":0.3000395864352139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577910185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81265825,0.0022715004,0.17526978,0.00045842223,0.0033650124,0.0005594398,0.000005683898,0.00008618337,0.005325706],"genre_scores_gemma":[0.98068506,0.00033543902,0.01842317,0.00015395912,0.0002218421,0.000017249715,0.0000013563886,0.000055855817,0.000106102234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943893,0.0014475014,0.0014519995,0.0007017691,0.001180875,0.0008285777],"domain_scores_gemma":[0.99253315,0.0014892003,0.0030300613,0.0017336011,0.0008975827,0.0003164029],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01291542,0.0005402136,0.0011902597,0.002418949,0.00040278662,0.00074740965,0.0064262655,0.0004764964,0.000020255025],"category_scores_gemma":[0.0019064987,0.0004851349,0.00077745115,0.0004946943,0.00037953374,0.0014808465,0.0027303144,0.0048502656,0.000014483168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009894456,0.0002519212,0.0070186253,0.00031745346,0.0004079572,0.0023845562,0.006401478,0.00061071507,0.0041112374,0.887975,0.00006884028,0.08946279],"study_design_scores_gemma":[0.0012234716,0.00031681618,0.00515281,0.0021335364,0.00002421096,0.00024501132,0.00027117238,0.00044739267,0.0008034189,0.9888545,0.000037040925,0.00049057277],"about_ca_topic_score_codex":0.000028578603,"about_ca_topic_score_gemma":0.000019932966,"teacher_disagreement_score":0.16802676,"about_ca_system_score_codex":0.00019475383,"about_ca_system_score_gemma":0.00052500016,"threshold_uncertainty_score":0.99976003},"labels":[],"label_agreement":null},{"id":"W1585857718","doi":"10.1002/jgt.21628","title":"Average Degree in Graph Powers","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Vertex (graph theory); Graph; Simple graph; Discrete mathematics; Connectivity; Physics","score_opus":0.020263659298784507,"score_gpt":0.24347709745190657,"score_spread":0.22321343815312206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585857718","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.16245742,0.0042834985,0.8217781,0.00045691608,0.0037381083,0.00019675399,0.000005591207,0.000053669926,0.0070299036],"genre_scores_gemma":[0.9979055,0.00003994307,0.0015974803,0.00021436205,0.00015762256,0.0000023991313,4.168012e-7,0.000010105527,0.00007220431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997862,0.00047250983,0.0006164473,0.00013443369,0.00045355118,0.00046109757],"domain_scores_gemma":[0.99847984,0.00026479384,0.00048990536,0.00040309018,0.000118627504,0.00024374714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003518245,0.00016065175,0.00032669643,0.00063280656,0.00005502596,0.00008438808,0.0011360998,0.00008105574,0.000025792126],"category_scores_gemma":[0.00015697104,0.0001291724,0.00028732105,0.00065911614,0.00005815335,0.0011996327,0.00008575183,0.0003433197,0.000033694083],"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.00026367427,0.00087274937,0.06758016,0.00004297731,0.00037923848,0.0004316791,0.0047246367,0.00048167683,0.0049595507,0.85536087,0.0038470204,0.06105579],"study_design_scores_gemma":[0.011908473,0.00084524264,0.5300707,0.0007256138,0.000122536,0.0023645102,0.0015747119,0.0012907533,0.00304266,0.42645466,0.019922048,0.0016780774],"about_ca_topic_score_codex":0.0000067367123,"about_ca_topic_score_gemma":0.0000029954938,"teacher_disagreement_score":0.835448,"about_ca_system_score_codex":0.000069326736,"about_ca_system_score_gemma":0.000053342654,"threshold_uncertainty_score":0.5267498},"labels":[],"label_agreement":null},{"id":"W1595412293","doi":"10.1002/jgt.20626","title":"Large cliques or stable sets in graphs with no four‐edge path and no five‐edge path in the complement","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Induced path; Block graph; Conjecture; Induced subgraph; Path graph; Split graph; Independent set; Discrete mathematics; Complement (music); Graph factorization; Graph; Path (computing); Longest path problem; Chordal graph; Pathwidth; Line graph; Graph power; Computer science; Vertex (graph theory)","score_opus":0.04279535364240605,"score_gpt":0.2992597116122812,"score_spread":0.25646435796987516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595412293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91672546,0.0017990791,0.07142038,0.0002617502,0.0003911133,0.0010500861,0.000039958304,0.000054617427,0.00825755],"genre_scores_gemma":[0.9821242,0.0006906844,0.016494546,0.00051025016,0.000034775156,0.000023348202,0.0000010505642,0.000023037333,0.00009807881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996277,0.0014147286,0.00063973485,0.00034290037,0.0006418201,0.0006838638],"domain_scores_gemma":[0.99772215,0.0007469628,0.00040096077,0.0005984426,0.0003613351,0.00017017133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007147487,0.00026572935,0.00044175386,0.0007519357,0.00017923117,0.000111062705,0.0015469133,0.00006985478,0.000069266025],"category_scores_gemma":[0.00017762976,0.0001471981,0.00012011555,0.0010792734,0.0002910418,0.0009420526,0.00029290954,0.0007721106,0.0000087041235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036477114,0.001177004,0.046799943,0.000116902105,0.000117696334,0.0017271637,0.023338392,0.000012135637,0.0003364992,0.916242,0.0015670161,0.0049175327],"study_design_scores_gemma":[0.0039469944,0.0035488277,0.048957676,0.00046735,0.000021328495,0.00046262867,0.0033750618,0.0004535153,0.00023638688,0.9353852,0.002690707,0.00045429883],"about_ca_topic_score_codex":0.000020296318,"about_ca_topic_score_gemma":0.00015065014,"teacher_disagreement_score":0.06539876,"about_ca_system_score_codex":0.000047970654,"about_ca_system_score_gemma":0.00014590382,"threshold_uncertainty_score":0.60025644},"labels":[],"label_agreement":null},{"id":"W1600957744","doi":"10.1002/jgt.21678","title":"On the Roots of Expected Independence Polynomials","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Independence (probability theory); Cardinality (data modeling); Tutte polynomial; Integral graph; Polynomial; Graph; Voltage graph; Line graph; Computer science; Statistics","score_opus":0.038404038742904635,"score_gpt":0.31383366322717404,"score_spread":0.2754296244842694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600957744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850196,0.0004182386,0.010381831,0.000110474044,0.0010449718,0.00016647213,0.0000023047712,0.000016040052,0.002840043],"genre_scores_gemma":[0.9963078,0.000017359038,0.0032883564,0.000053294385,0.00022046227,0.0000028517848,5.0920242e-8,0.000025231599,0.00008460257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980977,0.0003688638,0.0006830424,0.00005849167,0.0005666261,0.00022527728],"domain_scores_gemma":[0.9935175,0.0045519164,0.0012191348,0.00038177104,0.00023658297,0.000093068484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030230128,0.00014334689,0.00038983498,0.00017150467,0.0000644854,0.000010484969,0.00046066125,0.00009071001,0.0001445461],"category_scores_gemma":[0.0043401923,0.000083677136,0.00022119272,0.00023013451,0.00011835666,0.00020223953,0.000052065792,0.00038365013,0.0000076291412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015032769,0.00030247922,0.00013240047,0.000029825242,0.00009316917,0.0000028740953,0.0010711736,0.0000032124328,0.0045303293,0.99258256,0.00085186545,0.00024977332],"study_design_scores_gemma":[0.00035705822,0.00015672551,0.00028464067,0.00015982366,0.00006331456,0.000052895444,0.0007794209,8.3244754e-7,0.019248422,0.97876287,0.00004853293,0.0000854901],"about_ca_topic_score_codex":3.3497977e-7,"about_ca_topic_score_gemma":2.0143754e-7,"teacher_disagreement_score":0.014718093,"about_ca_system_score_codex":0.000037707952,"about_ca_system_score_gemma":0.00004201089,"threshold_uncertainty_score":0.51959294},"labels":[],"label_agreement":null},{"id":"W1601784190","doi":"10.1002/jgt.21806","title":"Bipartite 2‐Factorizations of Complete Multipartite Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Multipartite; Mathematics; Combinatorics; Bipartite graph; Factorization; Complete bipartite graph; Discrete mathematics; Disjoint sets; Graph; Edge-transitive graph; Line graph; Graph power; Algorithm","score_opus":0.009481002985737785,"score_gpt":0.19545050325212707,"score_spread":0.18596950026638928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601784190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9284651,0.001001666,0.06507312,0.00001884162,0.0015864084,0.00010104934,0.000023111495,0.000074645766,0.0036560458],"genre_scores_gemma":[0.99939626,0.000078205616,0.0003348793,0.00002187164,0.000105736806,0.0000021631156,0.0000019220163,0.00002765394,0.000031307496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858457,0.00025259875,0.0006704606,0.00007451974,0.00022129763,0.00019653204],"domain_scores_gemma":[0.99889666,0.00029698625,0.0002839424,0.00024041557,0.00015910079,0.00012290114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012069107,0.00015055187,0.00037252973,0.00044825953,0.00006137133,0.000017592676,0.0002628616,0.00007182032,0.00006552952],"category_scores_gemma":[0.000096063064,0.00012625457,0.00030881588,0.00043098105,0.00013034158,0.00019162192,0.000012620825,0.00020424984,0.000011038988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001280482,0.000106490384,0.00911431,0.00021864018,0.00051336584,0.000006632394,0.001396554,0.01807451,0.13935746,0.82737863,0.000876948,0.002828403],"study_design_scores_gemma":[0.002439035,0.00060963247,0.021388095,0.00061985216,0.00032358826,0.00017239086,0.0007063432,0.0041998527,0.039191794,0.8969505,0.032671187,0.0007277205],"about_ca_topic_score_codex":0.0000011851857,"about_ca_topic_score_gemma":0.0000022014215,"teacher_disagreement_score":0.100165665,"about_ca_system_score_codex":0.000009679389,"about_ca_system_score_gemma":0.000008817609,"threshold_uncertainty_score":0.5148512},"labels":[],"label_agreement":null},{"id":"W1673729927","doi":"10.1002/jgt.22057","title":"Hermitian Adjacency Matrix of Digraphs and Mixed Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Digraph; Hermitian matrix; Combinatorics; Mathematics; Adjacency matrix; Eigenvalues and eigenvectors; Spectral radius; Matrix (chemical analysis); Interlacing; Arc (geometry); Spectrum (functional analysis); Discrete mathematics; Pure mathematics; Computer science; Graph; Physics","score_opus":0.019834450876697832,"score_gpt":0.29113338314279896,"score_spread":0.27129893226610113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673729927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99402326,0.0011645936,0.0027014005,0.00034307747,0.000150255,0.00013706398,0.000024995312,0.000022190621,0.0014331392],"genre_scores_gemma":[0.9967138,0.00057390187,0.002347733,0.000026677359,0.000039325798,0.0000048462807,2.4991328e-7,0.000023461911,0.00026998867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843854,0.00028078226,0.0007024696,0.00013338572,0.00024325226,0.00020159695],"domain_scores_gemma":[0.99730194,0.0012586891,0.00075988093,0.00032481388,0.00020643622,0.00014821709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016713706,0.00016750325,0.00040186816,0.00046537662,0.00009333948,0.0000125043125,0.00030387618,0.0000928345,0.00011668802],"category_scores_gemma":[0.00030635475,0.00010182563,0.00036251624,0.00036773045,0.0004303483,0.00020050531,0.000037341993,0.0001542573,0.000002870929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014627399,0.00016236574,0.0019086555,0.000056540222,0.00014746214,0.000007047422,0.00025252247,8.329993e-8,0.022582794,0.96432877,0.0006491457,0.009758319],"study_design_scores_gemma":[0.0007972067,0.00016833519,0.0034206752,0.00022849589,0.00014274371,0.00013888477,0.0003795004,1.3602819e-7,0.01221446,0.98188937,0.0004902221,0.0001299969],"about_ca_topic_score_codex":6.727452e-7,"about_ca_topic_score_gemma":0.000002360425,"teacher_disagreement_score":0.017560553,"about_ca_system_score_codex":0.0000074241984,"about_ca_system_score_gemma":0.000029634035,"threshold_uncertainty_score":0.41523287},"labels":[],"label_agreement":null},{"id":"W1696541610","doi":"10.1002/jgt.22018","title":"Strongly Even‐Cycle Decomposable Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Mathematics; Combinatorics; Subdivision; Eulerian path; Characterization (materials science); Chordal graph; Property (philosophy); Graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Pure mathematics; Computer science; Lagrangian","score_opus":0.012991495177843027,"score_gpt":0.27929766973279474,"score_spread":0.2663061745549517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696541610","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.19341944,0.0011014865,0.8010618,0.0010617662,0.00072578044,0.00012225313,0.000004468786,0.00007217791,0.0024308078],"genre_scores_gemma":[0.97706515,0.00022260437,0.021947462,0.000112394126,0.00009601172,0.000003595798,1.1332835e-7,0.000022832504,0.00052986277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973625,0.000569971,0.0005642758,0.00027244375,0.0006851588,0.0005456293],"domain_scores_gemma":[0.9971692,0.0009739379,0.00044262945,0.000717435,0.00038576475,0.0003110143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003023405,0.00019565714,0.00033424757,0.00076964434,0.0001705252,0.00008492714,0.0021669918,0.00007426588,0.00011960058],"category_scores_gemma":[0.00027574136,0.00011946456,0.0003878001,0.0007990827,0.00030634552,0.0015557983,0.00024903353,0.00031570272,0.0000601309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018544651,0.00010853185,0.001189497,0.000006607576,0.00009501195,0.00008465947,0.00013395444,0.000055535813,0.011746739,0.9281763,0.00061070244,0.057607017],"study_design_scores_gemma":[0.0010005733,0.00039283204,0.0015255742,0.000090869966,0.000010466897,0.00024543327,0.000052442123,0.00004028283,0.006340865,0.98811847,0.0020018485,0.00018034305],"about_ca_topic_score_codex":7.1367504e-7,"about_ca_topic_score_gemma":0.0000012887695,"teacher_disagreement_score":0.7836457,"about_ca_system_score_codex":0.000057709673,"about_ca_system_score_gemma":0.0001278054,"threshold_uncertainty_score":0.48716232},"labels":[],"label_agreement":null},{"id":"W1732508261","doi":"10.1002/jgt.20596","title":"Overlap number of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bound graph; Matching (statistics); Discrete mathematics; Graph power; Line graph","score_opus":0.029826219507205095,"score_gpt":0.29551436913689244,"score_spread":0.26568814962968734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732508261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5094623,0.0009414358,0.4540629,0.0000712199,0.0009027264,0.0001439392,0.0000036303852,0.00004910518,0.03436273],"genre_scores_gemma":[0.9586665,0.00013059791,0.040931217,0.00008137816,0.000031031046,0.0000013775789,8.162931e-8,0.000013973922,0.0001438179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979786,0.00040449353,0.0005731735,0.00016717082,0.0005724314,0.00030410322],"domain_scores_gemma":[0.997877,0.00033798904,0.000582992,0.0005807041,0.00044499277,0.00017632236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024786512,0.00014242853,0.00032891834,0.0005323297,0.000066961635,0.000020670255,0.0017068969,0.00006742629,0.00019498415],"category_scores_gemma":[0.00016786825,0.0001105643,0.00039546285,0.00092806655,0.0003517507,0.0008350183,0.00018692977,0.00037149127,0.000021396854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020543311,0.00015419851,0.008306269,0.000013920903,0.00009755231,0.00006657286,0.0010249539,0.0000028785148,0.0017016747,0.9798745,0.000129394,0.008422641],"study_design_scores_gemma":[0.00042946797,0.00023706477,0.006196962,0.000046192814,0.000013478409,0.0003087259,0.00017785038,0.000011512206,0.010514943,0.98176605,0.00018252902,0.00011523342],"about_ca_topic_score_codex":0.0000024973217,"about_ca_topic_score_gemma":4.6223747e-7,"teacher_disagreement_score":0.4492042,"about_ca_system_score_codex":0.000015230716,"about_ca_system_score_gemma":0.00008024553,"threshold_uncertainty_score":0.45086813},"labels":[],"label_agreement":null},{"id":"W1764061692","doi":"10.1002/jgt.21882","title":"<i>K</i><sub>4</sub>‐free and ‐free Planar Matching Covered Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Matching (statistics); Subdivision; Graph; Induced subgraph; Factor-critical graph; Conformal map; Line graph; Discrete mathematics; Graph power; Vertex (graph theory); Geometry","score_opus":0.02082237696549377,"score_gpt":0.25973746476043824,"score_spread":0.23891508779494447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764061692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6411283,0.0038350753,0.35096037,0.0010024587,0.0008497829,0.0001993029,0.000018996894,0.00009667224,0.0019090103],"genre_scores_gemma":[0.97789377,0.0005149169,0.02078406,0.0005788169,0.00014452438,0.000004235984,8.7356835e-7,0.000040477265,0.000038353064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996887,0.0006882528,0.00058725715,0.00032500993,0.0010027254,0.0005097456],"domain_scores_gemma":[0.99663305,0.00076108635,0.0004921685,0.0011273655,0.00039847294,0.00058787665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048227035,0.0002592072,0.0004374181,0.0008567865,0.00019416759,0.00021092483,0.0027514112,0.000108324784,0.0000030200065],"category_scores_gemma":[0.0007621288,0.00021416743,0.00023344558,0.00084277906,0.00036760725,0.0014683277,0.00060354813,0.00071571674,0.000009149805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005169425,0.00009921415,0.0005147879,0.00002542642,0.0001510573,0.00033332728,0.0014308125,0.00010352446,0.020667974,0.9578892,0.0046233363,0.013644402],"study_design_scores_gemma":[0.001926058,0.00043129319,0.0006373616,0.0000781788,0.000021118334,0.00087078323,0.0003811969,0.000049743885,0.008566918,0.9863925,0.00040534252,0.00023949721],"about_ca_topic_score_codex":0.000002682977,"about_ca_topic_score_gemma":0.000005944265,"teacher_disagreement_score":0.3367654,"about_ca_system_score_codex":0.000054015032,"about_ca_system_score_gemma":0.00017960144,"threshold_uncertainty_score":0.8733494},"labels":[],"label_agreement":null},{"id":"W1830735411","doi":"10.1002/jgt.21684","title":"A Note on Hitting Maximum and Maximal Cliques With a Stable Set","year":2012,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Omega; Counterexample; Conjecture; Mathematics; Graph; Clique; Clique graph; Split graph; Independent set; Discrete mathematics; Set (abstract data type); Chordal graph; Line graph; Physics; Computer science; 1-planar graph; Graph power","score_opus":0.0324010661079993,"score_gpt":0.30390056357440576,"score_spread":0.27149949746640645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830735411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841406,0.0020491667,0.0073369835,0.0001628659,0.0010032047,0.00033436844,0.00005906882,0.00005495894,0.0048588193],"genre_scores_gemma":[0.9739089,0.00038178053,0.024552226,0.00025743438,0.0006658998,0.0000069116004,0.0000024569447,0.000098307086,0.00012606748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714977,0.00062182185,0.0008558493,0.00030256071,0.0005935841,0.0004764141],"domain_scores_gemma":[0.99589866,0.0013115252,0.0016784389,0.0005894891,0.0002784861,0.00024338414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004087642,0.000511101,0.00097247795,0.0005432773,0.00025353997,0.00011496493,0.00051423453,0.00041657966,0.000087280394],"category_scores_gemma":[0.00040268246,0.00032607254,0.00038690754,0.000122892,0.0003491734,0.00017994666,0.0004743972,0.0020238077,9.723315e-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.0036235016,0.00023796422,0.002889476,0.0011074613,0.0011408764,0.00020419383,0.009694486,0.000036171048,0.00013585824,0.97145236,0.0008952637,0.008582422],"study_design_scores_gemma":[0.0006770553,0.0003987802,0.0011225123,0.0012071829,0.00046956658,0.0005302241,0.0005127236,0.0000064586993,0.0004807287,0.9936757,0.0005182091,0.00040084604],"about_ca_topic_score_codex":0.0000045087836,"about_ca_topic_score_gemma":0.0000034118038,"teacher_disagreement_score":0.022223387,"about_ca_system_score_codex":0.0000633899,"about_ca_system_score_gemma":0.00011394509,"threshold_uncertainty_score":0.9999191},"labels":[],"label_agreement":null},{"id":"W1866996682","doi":"10.1002/jgt.21735","title":"Gallai's Conjecture For Graphs of Girth at Least Four","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Girth (graph theory); Simple graph; Graph; Discrete mathematics","score_opus":0.028004410505626045,"score_gpt":0.27200749115219947,"score_spread":0.24400308064657342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866996682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901707,0.0008871184,0.004689545,0.00024704356,0.0008791043,0.00046785214,0.00003207725,0.000022575581,0.0026039549],"genre_scores_gemma":[0.99095213,0.00009667506,0.007889308,0.00017967145,0.0001964182,0.000010216872,0.0000010453763,0.00004869647,0.0006258347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979945,0.00024421178,0.00088027946,0.00015980341,0.00039589076,0.00032533467],"domain_scores_gemma":[0.9962827,0.0014863699,0.0011428461,0.0003960803,0.00053232716,0.00015967552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461016,0.0002604471,0.0006632955,0.00041724142,0.00021671302,0.00002537355,0.00052726973,0.00018680507,0.0006041999],"category_scores_gemma":[0.0005713165,0.00017269504,0.00086532807,0.00021721736,0.00034671286,0.00018739095,0.00009446447,0.00031492062,0.0000026721973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048298683,0.000091541086,0.0014406315,0.0002251924,0.00049243483,0.000008675265,0.0010886596,0.00000932636,0.0033565063,0.9789581,0.011307085,0.0025388987],"study_design_scores_gemma":[0.0012573843,0.00043691398,0.0017863184,0.000111942216,0.00018336116,0.00028545794,0.00038984328,0.0000065612053,0.0033821894,0.99091935,0.0010475017,0.00019320361],"about_ca_topic_score_codex":0.0000020676955,"about_ca_topic_score_gemma":0.0000039244105,"teacher_disagreement_score":0.011961261,"about_ca_system_score_codex":0.000028625016,"about_ca_system_score_gemma":0.000041447296,"threshold_uncertainty_score":0.70422995},"labels":[],"label_agreement":null},{"id":"W1871140597","doi":"10.1002/jgt.21995","title":"Rainbow Arborescence in Random Digraphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Ryerson University; National Science Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Vertex (graph theory); Random graph; Discrete mathematics; Tree (set theory); Graph; Asymptotically optimal algorithm; Algorithm","score_opus":0.04533237273199347,"score_gpt":0.30877191099375534,"score_spread":0.26343953826176186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871140597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9831974,0.0022677414,0.003091636,0.00016934023,0.0012814696,0.00019080762,0.000003823628,0.00002884071,0.0097689405],"genre_scores_gemma":[0.99576324,0.00013004096,0.003583826,0.00018224466,0.0001938129,0.000002351271,2.4477646e-7,0.00002557945,0.00011868361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976968,0.0006083769,0.000768267,0.00013664398,0.0004989084,0.00029099602],"domain_scores_gemma":[0.9975547,0.0011343091,0.00053243025,0.00032409446,0.00023614556,0.0002183088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054140957,0.00019616233,0.0005219923,0.0006478806,0.00007570999,0.000030594398,0.00053413224,0.00011910976,0.000043858974],"category_scores_gemma":[0.0020365189,0.00013426255,0.0003424702,0.00047239757,0.00027314355,0.00023198518,0.00007172444,0.00051916507,0.0000017204497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018722097,0.00014580657,0.0059078718,0.000032066706,0.00011185722,0.00017264177,0.0044658347,0.000021329703,0.00016754521,0.9822738,0.0027049358,0.002124075],"study_design_scores_gemma":[0.0035636732,0.00016426659,0.001490265,0.00012804786,0.000050338902,0.00018458793,0.0010059022,0.0000065438508,0.00037169573,0.99204373,0.0008278259,0.00016313995],"about_ca_topic_score_codex":0.0000023967682,"about_ca_topic_score_gemma":0.0000047971657,"teacher_disagreement_score":0.012565817,"about_ca_system_score_codex":0.000037558184,"about_ca_system_score_gemma":0.00010678892,"threshold_uncertainty_score":0.54750675},"labels":[],"label_agreement":null},{"id":"W1883961587","doi":"10.1002/jgt.21889","title":"On the Roots of σ‐Polynomials","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Chromatic scale; Chromatic polynomial; Vertex (graph theory); Conjecture; Graph; Discrete mathematics; Order (exchange)","score_opus":0.07292441389734901,"score_gpt":0.3283436143423455,"score_spread":0.2554192004449965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883961587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97154206,0.00032145,0.014841951,0.00046327463,0.001461533,0.00021298014,0.0000031951533,0.00001881765,0.011134745],"genre_scores_gemma":[0.9950196,0.000011434677,0.004521641,0.000078830264,0.0001668013,0.0000018098395,4.6613636e-8,0.000024885772,0.00017493339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983789,0.00031377308,0.0006405557,0.0000576398,0.00047623616,0.00013291744],"domain_scores_gemma":[0.99458206,0.0035728777,0.0010541377,0.0003567612,0.0003400648,0.0000941305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035524822,0.000119481076,0.00038254829,0.00013911887,0.000035875513,0.000011556783,0.00043281654,0.000058766815,0.000040201983],"category_scores_gemma":[0.0061157593,0.00006693428,0.0002070672,0.00017888311,0.00012093699,0.00009173939,0.00004301783,0.00025161274,0.000008045556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020240077,0.00017044076,0.000010987029,0.000023041886,0.00007935055,0.0000070973833,0.00059839163,0.000020093401,0.00075383065,0.991623,0.0062308735,0.00028048758],"study_design_scores_gemma":[0.00058795884,0.0003558772,0.000012951767,0.00013779494,0.000059667338,0.000038450587,0.00070174085,0.0000037517113,0.0072765755,0.9904971,0.00026020678,0.00006793438],"about_ca_topic_score_codex":2.5165338e-7,"about_ca_topic_score_gemma":2.442282e-7,"teacher_disagreement_score":0.023477564,"about_ca_system_score_codex":0.00003826722,"about_ca_system_score_gemma":0.0000789701,"threshold_uncertainty_score":0.73215765},"labels":[],"label_agreement":null},{"id":"W1896292437","doi":"10.1002/jgt.21838","title":"On Sheehan's Conjecture for Graphs with Symmetry","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Finite Group Theory Research","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Combinatorics; Automorphism; Graph; Graph automorphism; Hamiltonian path; Petersen graph; Automorphism group; Hamiltonian (control theory); Discrete mathematics; Voltage graph; Line graph","score_opus":0.027180325192564785,"score_gpt":0.30960077015946663,"score_spread":0.28242044496690183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896292437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90742123,0.00015510354,0.08254115,0.0005197551,0.00036423956,0.00046696496,0.000016440224,0.000046681063,0.0084684165],"genre_scores_gemma":[0.9913209,0.000012322728,0.007734954,0.00032332985,0.00018652197,0.000009793674,0.0000010424609,0.00006528737,0.00034581524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980307,0.00050528586,0.00042238715,0.00016142534,0.0005366117,0.00034355136],"domain_scores_gemma":[0.99225664,0.006441411,0.00043790223,0.0003840367,0.00031682997,0.00016318305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048910403,0.00020880919,0.0004570654,0.0006456467,0.00012930606,0.000047596597,0.00045977018,0.00012467224,0.00010463238],"category_scores_gemma":[0.0019632985,0.00012988238,0.00033119795,0.00034890973,0.00022474707,0.00011383174,0.000026852493,0.0005482167,0.0000072369835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023712283,0.00017541142,0.00012235247,0.00012358265,0.00022299145,0.000016483902,0.00023441266,0.0000088464085,0.00042351612,0.9909468,0.002820148,0.0025342153],"study_design_scores_gemma":[0.0018890675,0.002994001,0.00013770428,0.00020340378,0.00010203829,0.00016071596,0.00021606243,0.000015634827,0.0014894446,0.99182564,0.0008016239,0.00016463552],"about_ca_topic_score_codex":3.0272625e-7,"about_ca_topic_score_gemma":0.0000017226513,"teacher_disagreement_score":0.083899684,"about_ca_system_score_codex":0.00003073748,"about_ca_system_score_gemma":0.000052098574,"threshold_uncertainty_score":0.52964497},"labels":[],"label_agreement":null},{"id":"W1901357871","doi":"10.1002/jgt.21655","title":"Transversals in Trees","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Data Management and Algorithms","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":"Concordia University; McGill University; Social Sciences and Humanities Research Council; Natural Sciences and Engineering Research Council of Canada","funders":"McGill University","keywords":"Library science; Computer science; Operations research; Engineering","score_opus":0.013102022792360887,"score_gpt":0.238538950887151,"score_spread":0.2254369280947901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901357871","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.14875126,0.0030995267,0.8344125,0.0012176408,0.0019556338,0.000090660666,0.0000027852084,0.000033170752,0.010436839],"genre_scores_gemma":[0.99081343,0.000108578795,0.0086280685,0.00018010345,0.00012516785,4.1046673e-7,1.9008668e-7,0.0000032046303,0.00014081833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993163,0.00009900365,0.00020338749,0.000049089293,0.00016787492,0.00016439089],"domain_scores_gemma":[0.9995889,0.00007307087,0.000107729014,0.00014958759,0.000018457238,0.000062265986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017107852,0.00005410926,0.00010912232,0.00029903164,0.000019576044,0.000044034132,0.0006183824,0.000017230475,0.000023312608],"category_scores_gemma":[0.000018377074,0.00004039522,0.00008272708,0.00028013997,0.00002441419,0.001584678,0.000043263586,0.00010242492,0.000009654877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028571094,0.0002246785,0.007052337,0.00000777503,0.000051459825,0.000047628248,0.0017691237,0.000017790882,0.0003806179,0.8243448,0.0023605821,0.16371463],"study_design_scores_gemma":[0.0030074087,0.0004305331,0.18393706,0.00017117929,0.000067350236,0.00017943038,0.0011039597,0.0006030543,0.0027250862,0.7483021,0.058925755,0.0005470821],"about_ca_topic_score_codex":0.0000010178395,"about_ca_topic_score_gemma":0.0000012267511,"teacher_disagreement_score":0.8420622,"about_ca_system_score_codex":0.000008610884,"about_ca_system_score_gemma":0.000008278615,"threshold_uncertainty_score":0.16472693},"labels":[],"label_agreement":null},{"id":"W1904355337","doi":"10.1002/jgt.20635","title":"A Characterization of b‐Perfect Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; Fractional coloring; Discrete mathematics; Chromatic polynomial; List coloring; Edge coloring; Graph factorization; Graph power; Wheel graph; Graph; Vertex (graph theory); Line graph","score_opus":0.018008865210613765,"score_gpt":0.20675210563390428,"score_spread":0.18874324042329052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1904355337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9232814,0.00025641685,0.074894816,0.00004543119,0.00055658136,0.00004472645,9.125801e-7,0.000023107705,0.00089664233],"genre_scores_gemma":[0.9922417,0.000093003015,0.007502632,0.00012365812,0.000006177678,6.5160344e-7,2.7770437e-7,0.000005945103,0.000025967453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989167,0.00017433592,0.0004498486,0.00010107953,0.00023176549,0.00012627395],"domain_scores_gemma":[0.9987447,0.000055587316,0.0005769089,0.00026219932,0.0002811415,0.000079449106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013816592,0.00008755729,0.0002035382,0.00048499246,0.00004621518,0.000016829988,0.000514481,0.000046634297,0.000027487516],"category_scores_gemma":[0.000044958513,0.00006483428,0.00020243817,0.00051459967,0.00008862394,0.00039318405,0.000048273563,0.00012944004,0.0000035986116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060047405,0.00013692431,0.0014660642,0.000012834443,0.000058182384,0.00001311679,0.0015572231,0.0000016536915,0.2062361,0.7846569,0.000033774955,0.0057672085],"study_design_scores_gemma":[0.00037651864,0.0004123832,0.009780096,0.00008175543,0.000025195443,0.00010091184,0.00002973857,0.000048972415,0.08445002,0.9045473,0.000053074913,0.00009407274],"about_ca_topic_score_codex":0.0000025589138,"about_ca_topic_score_gemma":2.0719527e-7,"teacher_disagreement_score":0.121786065,"about_ca_system_score_codex":0.000003863965,"about_ca_system_score_gemma":0.000039605256,"threshold_uncertainty_score":0.26438653},"labels":[],"label_agreement":null},{"id":"W1913504200","doi":"10.1002/jgt.21791","title":"Chasing a Fast Robber on Planar Graphs and Random Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israeli Centers for Research Excellence; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Mathematics; Combinatorics; Treewidth; Planar graph; Vertex (graph theory); Discrete mathematics; Graph; Constant (computer programming); Pathwidth; Line graph; Computer science","score_opus":0.01250663770375848,"score_gpt":0.2608837992795954,"score_spread":0.2483771615758369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913504200","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.319178,0.001412588,0.6729334,0.00089376705,0.00078093493,0.00025355304,0.0000034260347,0.00009981919,0.0044445437],"genre_scores_gemma":[0.9899546,0.0002755476,0.008969414,0.00059046515,0.000074011914,0.0000039489455,3.9832855e-7,0.000026994981,0.00010462722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704427,0.00093294354,0.00053020695,0.00033762003,0.0006771782,0.00047781048],"domain_scores_gemma":[0.99703,0.0014442791,0.00043530163,0.0005590862,0.00020940861,0.00032189663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045403866,0.00025754614,0.0004779752,0.0012935296,0.0002966063,0.00017399632,0.0010802645,0.00009318999,0.000013972554],"category_scores_gemma":[0.00035554767,0.00019375491,0.0003220569,0.00083575066,0.00038946205,0.0007011428,0.00011202585,0.0006527264,0.0000086528125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071563094,0.00008234575,0.0004639476,0.000015583686,0.00009452089,0.00005147685,0.0005498093,0.000084212916,0.0019413668,0.939418,0.00017538102,0.056407712],"study_design_scores_gemma":[0.0025287636,0.00072360755,0.0012907829,0.00013555735,0.00001996109,0.0003822936,0.00011569719,0.00035364938,0.0010987784,0.99221206,0.00091551786,0.00022331235],"about_ca_topic_score_codex":0.00000127971,"about_ca_topic_score_gemma":0.0000016345845,"teacher_disagreement_score":0.6707766,"about_ca_system_score_codex":0.000020255377,"about_ca_system_score_gemma":0.000039030467,"threshold_uncertainty_score":0.79010963},"labels":[],"label_agreement":null},{"id":"W1930792227","doi":"10.1002/jgt.21711","title":"Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Arboricity; Multigraph; Mathematics; Combinatorics; Degree (music); Conjecture; Dense graph; Planar graph; Bounded function; Graph; Discrete mathematics; Tree decomposition; Pathwidth; 1-planar graph; Chordal graph; Line graph","score_opus":0.01759353469542376,"score_gpt":0.2805384940187399,"score_spread":0.2629449593233162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930792227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7111957,0.0008693216,0.28717858,0.0001939286,0.00008747351,0.0001962823,7.942747e-7,0.000020021005,0.0002578807],"genre_scores_gemma":[0.9415484,0.00015202326,0.05815819,0.0000764834,0.000020660773,0.000009624964,4.122523e-7,0.000016893699,0.000017276234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978836,0.00039535327,0.0005341579,0.00024771172,0.00059674925,0.0003424166],"domain_scores_gemma":[0.9975763,0.0004732669,0.00057859404,0.00048598507,0.0006185013,0.00026737936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014608144,0.00020713125,0.0003905081,0.0011080161,0.00016873474,0.00012832475,0.0009195047,0.00007489444,0.000020248908],"category_scores_gemma":[0.00007785499,0.0001468662,0.00019126265,0.0010297038,0.0006911968,0.0015068584,0.00015949759,0.00036427495,0.0000035721164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057444675,0.00021309871,0.014418648,0.00007074006,0.0002516951,0.00007566465,0.0012259042,0.00006909024,0.0103544975,0.9355187,0.00013573836,0.037091803],"study_design_scores_gemma":[0.0009839339,0.0010477421,0.03125157,0.0001411356,0.000025237572,0.00045039598,0.00016806145,0.00014623649,0.004793189,0.9608077,0.000019013343,0.00016581565],"about_ca_topic_score_codex":0.00001719152,"about_ca_topic_score_gemma":0.00003282943,"teacher_disagreement_score":0.2303527,"about_ca_system_score_codex":0.000023237744,"about_ca_system_score_gemma":0.000082692335,"threshold_uncertainty_score":0.59890294},"labels":[],"label_agreement":null},{"id":"W1945239439","doi":"10.1002/jgt.21903","title":"Interval Minors of Complete Bipartite Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"American Roentgen Ray Society","keywords":"Combinatorics; Bipartite graph; Mathematics; Interval (graph theory); Minor (academic); Robertson–Seymour theorem; Discrete mathematics; Complete bipartite graph; Indifference graph; Cograph; Upper and lower bounds; Strong perfect graph theorem; 1-planar graph; Chordal graph; Graph; Law","score_opus":0.0846462219045069,"score_gpt":0.31779192468737305,"score_spread":0.23314570278286617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945239439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900452,0.0010112396,0.002434435,0.00007047244,0.0012178456,0.00009497133,0.000015884187,0.000018453615,0.0050914977],"genre_scores_gemma":[0.9939668,0.000043344484,0.005575701,0.00011224649,0.00013503894,9.743005e-7,5.742714e-7,0.00002758672,0.000137731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774736,0.00045314466,0.00093956053,0.00011613868,0.00050733634,0.00023646488],"domain_scores_gemma":[0.99730015,0.0006461697,0.0009981709,0.0003631187,0.00047245083,0.0002199298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003039794,0.00019405101,0.00059437315,0.0005313427,0.00007398167,0.00001705512,0.0005604493,0.00009929279,0.00009551712],"category_scores_gemma":[0.00075111503,0.00013462052,0.0005563828,0.00032915245,0.0004397208,0.0001796041,0.000111990434,0.0003374642,0.0000023323714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006351209,0.00012624556,0.0022088634,0.000070325244,0.00034494314,0.000032344,0.0034061642,0.000007897497,0.00090432446,0.9857896,0.0047995476,0.0016746148],"study_design_scores_gemma":[0.0009273896,0.00044985194,0.00078746554,0.00012674314,0.00015456934,0.0002127159,0.0011693189,0.0000064726964,0.0017680544,0.9926857,0.0015663502,0.00014536368],"about_ca_topic_score_codex":0.0000023598955,"about_ca_topic_score_gemma":0.0000023832295,"teacher_disagreement_score":0.0068960954,"about_ca_system_score_codex":0.00002048525,"about_ca_system_score_gemma":0.00005386608,"threshold_uncertainty_score":0.5489666},"labels":[],"label_agreement":null},{"id":"W1953211229","doi":"10.1002/jgt.21834","title":"Relations between the Local Chromatic Number and Its Directed Version","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","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":"Hungarian Scientific Research Fund; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Infimum and supremum; Critical graph; Chromatic scale; Windmill graph; Fractional coloring; Graph; Brooks' theorem; Discrete mathematics; Logarithm; Vertex (graph theory); Friendship graph; Undirected graph; Directed graph; Graph coloring; Graph power; Line graph","score_opus":0.008713303986550756,"score_gpt":0.22830622964959996,"score_spread":0.2195929256630492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953211229","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.39756668,0.0004755407,0.59836143,0.0019570715,0.00012088579,0.00003043148,0.0000027004612,0.00002617942,0.0014591032],"genre_scores_gemma":[0.9983846,0.00003219566,0.0012889182,0.00011303449,0.000058784088,2.685507e-7,6.3146433e-7,0.000001689512,0.000119899276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906325,0.00032675124,0.00022217662,0.00008252402,0.00020934062,0.00009594732],"domain_scores_gemma":[0.99844885,0.0010468446,0.00019236989,0.0001580689,0.00007937657,0.00007451814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013827177,0.000058187794,0.0001510248,0.00015321924,0.00015877163,0.0000496918,0.0004614327,0.000037490747,0.000085995474],"category_scores_gemma":[0.000373807,0.000029940931,0.00009462838,0.00082772825,0.00008452405,0.0002757004,0.000107718915,0.0001615792,0.000046425306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034662608,0.00013221464,0.05756086,0.0000176966,0.00050372124,0.000021076137,0.00065655424,0.00017049954,0.0001584101,0.755557,0.007663865,0.17752342],"study_design_scores_gemma":[0.0004446412,0.00018687027,0.34646887,0.00003732417,0.00018286068,0.00008352564,0.00007336457,0.0049181827,0.00017764737,0.6411237,0.0061684726,0.0001345541],"about_ca_topic_score_codex":0.000002061541,"about_ca_topic_score_gemma":4.021626e-7,"teacher_disagreement_score":0.6008179,"about_ca_system_score_codex":0.000008794245,"about_ca_system_score_gemma":0.000009509026,"threshold_uncertainty_score":0.1221159},"labels":[],"label_agreement":null},{"id":"W1965786138","doi":"10.1002/(sici)1097-0118(200004)33:4<246::aid-jgt6>3.0.co;2-6","title":"A characterization of Zm-well-covered graphs of girth 6 or more","year":2000,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Odd graph; Discrete mathematics; Girth (graph theory); Modulo; Chordal graph; Characterization (materials science); Indifference graph; Triangle-free graph; Metric dimension; Graph; 1-planar graph","score_opus":0.009007229496477588,"score_gpt":0.22273383895900156,"score_spread":0.21372660946252398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965786138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912965,0.0002501452,0.007497385,0.00016965061,0.00024011858,0.00007478289,0.000006093397,0.000017926126,0.0004473569],"genre_scores_gemma":[0.9956824,0.00042186244,0.003392746,0.00020892269,0.000009542851,8.257034e-7,0.0000014516439,0.000009434591,0.00027281928],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983557,0.00017359137,0.0007520911,0.00014130729,0.000414082,0.00016325069],"domain_scores_gemma":[0.9983612,0.0001130496,0.00076376164,0.00035488186,0.00031456354,0.000092570524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029409,0.00012695948,0.0003521106,0.00047201655,0.000051816485,0.000024011199,0.0005922343,0.000069642534,0.00021447946],"category_scores_gemma":[0.00003719413,0.00008777947,0.0002577913,0.0007364986,0.0001468065,0.0004103447,0.000035773155,0.00015214387,0.000004841051],"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.0015048868,0.00082920905,0.0020376265,0.0001557514,0.00035135588,0.00006559109,0.0037925856,0.00044625238,0.5271286,0.40720874,0.00041299622,0.05606641],"study_design_scores_gemma":[0.0027577723,0.0015528959,0.015647372,0.00060407387,0.000114989816,0.0003444025,0.0001509684,0.0009043312,0.1426384,0.8339959,0.0009134224,0.00037550647],"about_ca_topic_score_codex":0.0000044141843,"about_ca_topic_score_gemma":5.012061e-7,"teacher_disagreement_score":0.42678714,"about_ca_system_score_codex":0.0000059734525,"about_ca_system_score_gemma":0.000084413914,"threshold_uncertainty_score":0.3579543},"labels":[],"label_agreement":null},{"id":"W1980734399","doi":"10.1002/jgt.20104","title":"Edge disjoint cycles through specified vertices","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Lemma (botany); Disjoint sets; Bipartite graph; Graph; Pairwise comparison; Discrete mathematics; Bound graph; Graph power; Line graph","score_opus":0.012285815764060338,"score_gpt":0.21785074350112285,"score_spread":0.2055649277370625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980734399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94468886,0.009323547,0.008571628,0.00014731583,0.0016485248,0.00008786992,0.000004804279,0.00011314584,0.03541431],"genre_scores_gemma":[0.99796987,0.0004735657,0.0005581149,0.000081345934,0.00075391354,0.0000018961427,4.7670844e-7,0.000031505155,0.00012929009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877596,0.00013877546,0.00054090173,0.00008557026,0.00021953473,0.00023926435],"domain_scores_gemma":[0.99932677,0.00015679478,0.00015192902,0.00020870703,0.000057031095,0.000098776705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451529,0.00017149,0.00030580556,0.00017187619,0.0000721164,0.00004406854,0.00029677578,0.000078371166,0.0002332731],"category_scores_gemma":[0.000030425615,0.00013392682,0.00029906924,0.00019585493,0.00009411735,0.000490938,0.000015809703,0.0002921512,0.000060599457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007034688,0.00027929613,0.0009868434,0.00022565298,0.0010126902,0.00012303251,0.008074114,0.013584997,0.032942086,0.89188623,0.012610021,0.03757159],"study_design_scores_gemma":[0.001961822,0.00029563843,0.007553256,0.0004870568,0.00023704128,0.0006582197,0.00398483,0.00035415048,0.05742137,0.79860884,0.12765199,0.000785798],"about_ca_topic_score_codex":6.329251e-7,"about_ca_topic_score_gemma":0.0000028587112,"teacher_disagreement_score":0.11504197,"about_ca_system_score_codex":0.00003362637,"about_ca_system_score_gemma":0.000010445997,"threshold_uncertainty_score":0.54613775},"labels":[],"label_agreement":null},{"id":"W1981927600","doi":"10.1002/jgt.20472","title":"Connectivity of random regular graphs generated by the pegging algorithm","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Random graph; Combinatorics; Discrete mathematics; Random regular graph; Constant (computer programming); Graph; Chordal graph; Algorithm; Computer science; 1-planar graph","score_opus":0.013910552827449296,"score_gpt":0.27529555484896145,"score_spread":0.26138500202151216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981927600","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.17530568,0.00043227093,0.82328326,0.00013366024,0.00051976903,0.0001112113,0.000030998777,0.000011260789,0.00017187797],"genre_scores_gemma":[0.96524376,0.000048744438,0.03442407,0.000082021565,0.000114558556,0.0000035570895,8.741871e-7,0.000024567082,0.00005786509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986121,0.0002035847,0.00053969194,0.00010039079,0.0003614504,0.00018278827],"domain_scores_gemma":[0.9957145,0.0029141917,0.0006311845,0.00023022904,0.0004176713,0.00009226298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029317949,0.00013816232,0.00041416514,0.000106735766,0.0001246973,0.000025053814,0.00032008524,0.000090642505,0.0000871246],"category_scores_gemma":[0.002832229,0.000081162,0.00021604363,0.00025453226,0.00018829228,0.00007730627,0.000031440646,0.0005295912,7.500808e-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.0002611705,0.0001495457,0.00000695765,0.00004308465,0.00018031655,0.000013329391,0.0002581614,0.0000020421642,0.03453728,0.93923956,0.0017551474,0.023553379],"study_design_scores_gemma":[0.0012927686,0.00014931947,0.000013485302,0.000045539855,0.0001691176,0.00018438991,0.00024203729,0.0012836303,0.015732154,0.98064893,0.00014238853,0.00009626283],"about_ca_topic_score_codex":0.0000024631408,"about_ca_topic_score_gemma":0.0000024100343,"teacher_disagreement_score":0.7899381,"about_ca_system_score_codex":0.0000067886813,"about_ca_system_score_gemma":0.000057355854,"threshold_uncertainty_score":0.33906472},"labels":[],"label_agreement":null},{"id":"W1983977135","doi":"10.1002/jgt.10002","title":"Coloring all directed paths in a symmetric tree, with an application to optical networks*","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Directed graph; Tree (set theory); Wavelength-division multiplexing; Arc (geometry); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Wavelength; Telecommunications","score_opus":0.016131353985332345,"score_gpt":0.2866688221256312,"score_spread":0.2705374681402989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983977135","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.32317507,0.00021193642,0.67537934,0.00017551947,0.000077152086,0.00018803179,1.7529128e-7,0.000046064735,0.00074669096],"genre_scores_gemma":[0.9537818,0.00010505931,0.04576864,0.0001921252,0.000084419946,0.000020649168,4.698561e-7,0.000017627232,0.000029207094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997974,0.00038908026,0.00041442644,0.0002861258,0.0004920896,0.00044431552],"domain_scores_gemma":[0.99819225,0.0005549387,0.00019799768,0.00045915137,0.00024547076,0.00035017205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025342254,0.00015218875,0.00028262235,0.001373262,0.000070143695,0.00008882068,0.0011063835,0.00006505123,0.000003526405],"category_scores_gemma":[0.00017025994,0.00011717275,0.00007851535,0.0040824497,0.00008517968,0.0007452751,0.00011474044,0.0004572374,0.0000042689876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018998409,0.00048673584,0.008446317,0.000006781684,0.00006504594,0.00045337595,0.00050183694,0.016405901,0.0013078196,0.681132,0.000025742507,0.2892686],"study_design_scores_gemma":[0.0038143254,0.0061160545,0.10809924,0.00025311045,0.000050732746,0.0015541714,0.00044859282,0.086412825,0.0013893466,0.7886749,0.002288236,0.0008984629],"about_ca_topic_score_codex":0.0000036661093,"about_ca_topic_score_gemma":0.000036512305,"teacher_disagreement_score":0.6306067,"about_ca_system_score_codex":0.00008889464,"about_ca_system_score_gemma":0.00005488461,"threshold_uncertainty_score":0.4778166},"labels":[],"label_agreement":null},{"id":"W1988220302","doi":"10.1002/jgt.20088","title":"Normal cirulant graphs with noncyclic regular subroups","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Finite Group 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":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Cayley graph; Dihedral group; Discrete mathematics; Cyclic group; Circulant matrix; Abelian group; Chordal graph; Vertex-transitive graph; Cayley's theorem; Prime (order theory); Converse; Graph; Group (periodic table); Line graph; Voltage graph","score_opus":0.027313316837775953,"score_gpt":0.2934840929764498,"score_spread":0.26617077613867385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988220302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98526967,0.00071399275,0.0050560376,0.0004883709,0.00013508581,0.00019889433,0.0000066971306,0.000046258254,0.00808501],"genre_scores_gemma":[0.98590875,0.00012563373,0.012321801,0.00017477694,0.0003526376,0.0000052874293,0.000001219699,0.00007470656,0.0010351903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701774,0.00059010414,0.00074769167,0.00018687687,0.00093388563,0.0005236803],"domain_scores_gemma":[0.99715364,0.0011034529,0.0005856378,0.0005365004,0.00035332455,0.0002674735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046250047,0.000258733,0.0005160671,0.0007674402,0.00015743643,0.00006230777,0.00068408065,0.00012592338,0.00042346615],"category_scores_gemma":[0.00038040694,0.0001767837,0.00036120514,0.0005905302,0.00036467562,0.00044696158,0.00007126141,0.0007741042,0.00004150879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024421697,0.00055684097,0.0021326474,0.000108014356,0.00050865195,0.0003876077,0.0014233452,0.000035049663,0.00376709,0.97808135,0.0035680602,0.006989189],"study_design_scores_gemma":[0.0019046206,0.00085811655,0.0012665811,0.00020875398,0.00015165367,0.0017275297,0.00059731037,0.000021730246,0.0042694425,0.98534733,0.0033479196,0.00029900935],"about_ca_topic_score_codex":0.0000011295309,"about_ca_topic_score_gemma":0.000011542739,"teacher_disagreement_score":0.0072659985,"about_ca_system_score_codex":0.00006561504,"about_ca_system_score_gemma":0.000101783146,"threshold_uncertainty_score":0.720903},"labels":[],"label_agreement":null},{"id":"W1990941137","doi":"10.1002/jgt.20565","title":"Vizing's conjecture: a survey and recent results","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Furman University","keywords":"Conjecture; Counterexample; Cartesian product; Mathematics; Combinatorics; Domination analysis; Product (mathematics); Graph; Upper and lower bounds; Discrete mathematics; Graph theory","score_opus":0.06090426272339177,"score_gpt":0.294004860554233,"score_spread":0.23310059783084125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990941137","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.33078244,0.0075517083,0.6483178,0.0008577589,0.0016796313,0.00037410457,0.000027717126,0.000112555856,0.010296282],"genre_scores_gemma":[0.9788031,0.001134912,0.019686148,0.0002116032,0.000051346546,0.0000013282192,5.3647375e-7,0.000014772868,0.00009623586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749696,0.0010993849,0.00048395022,0.00023132384,0.0003837231,0.0003046533],"domain_scores_gemma":[0.9976615,0.0008541974,0.00040581322,0.00045606896,0.00039371118,0.00022871776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007399147,0.00014337052,0.00026265584,0.00044839576,0.00011528056,0.00006363274,0.0009976504,0.00006742127,0.000023775408],"category_scores_gemma":[0.00097360957,0.00010643273,0.00009856641,0.00069422607,0.00027124555,0.00053503644,0.00020882499,0.00043959264,0.0000055492246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003087395,0.0002312887,0.004338917,0.00001696067,0.00021265695,0.00034878412,0.004669136,0.000008753976,0.0012572244,0.8628891,0.0011218069,0.121817976],"study_design_scores_gemma":[0.001152199,0.0006607418,0.038176768,0.000035978304,0.000008084482,0.00043906766,0.00008568075,0.000025032758,0.0029299385,0.95477825,0.0015368038,0.00017144969],"about_ca_topic_score_codex":0.000006220008,"about_ca_topic_score_gemma":0.000009592071,"teacher_disagreement_score":0.6480207,"about_ca_system_score_codex":0.000020830286,"about_ca_system_score_gemma":0.000086913795,"threshold_uncertainty_score":0.43402007},"labels":[],"label_agreement":null},{"id":"W1991233937","doi":"10.1002/jgt.20109","title":"Two maps with large representativity on one surface","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Torus; Mathematics; Counterexample; Surface (topology); Constant (computer programming); Face (sociological concept); Discrete mathematics; Geometry; Computer science","score_opus":0.03166642595860378,"score_gpt":0.3169013481642758,"score_spread":0.28523492220567204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991233937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778648,0.00026867096,0.010179629,0.001222153,0.00011939183,0.000078979705,0.0000067082397,0.000019445679,0.010240193],"genre_scores_gemma":[0.9850707,0.00003588763,0.013026529,0.0002710299,0.00019988234,4.8602584e-7,3.9214578e-7,0.0000175454,0.0013775133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986671,0.00030015977,0.00034249848,0.00011409476,0.00033853954,0.00023759808],"domain_scores_gemma":[0.9979313,0.0011640484,0.00044745786,0.00024268452,0.00011423348,0.000100261015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020014553,0.000120241,0.0003348718,0.0002535217,0.0000742659,0.000014103502,0.00019739776,0.00005033176,0.00040960248],"category_scores_gemma":[0.00041354517,0.00008143697,0.00013631601,0.00036100007,0.00010403976,0.00012326485,0.000029548464,0.0003691614,0.000027226652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060513313,0.0009006109,0.00352059,0.00001959902,0.00025591542,0.00007172511,0.0005827738,0.000074581316,0.00026112125,0.98664105,0.004613424,0.0024535013],"study_design_scores_gemma":[0.0022495454,0.00058570615,0.0023376052,0.00006402682,0.00009740466,0.00023315616,0.0007224219,0.000003948486,0.002567229,0.9891315,0.0018680663,0.00013935132],"about_ca_topic_score_codex":0.0000020618036,"about_ca_topic_score_gemma":0.000010755372,"teacher_disagreement_score":0.00886268,"about_ca_system_score_codex":0.000026311915,"about_ca_system_score_gemma":0.000035774814,"threshold_uncertainty_score":0.448486},"labels":[],"label_agreement":null},{"id":"W1991373546","doi":"10.1002/jgt.20570","title":"Self‐dual and self‐petrie‐dual regular maps","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Dual (grammatical number); Degree (music); Graph; Automorphism; Dual graph; Generator (circuit theory); Discrete mathematics; Planar graph; Physics","score_opus":0.05448300763766081,"score_gpt":0.2912934432244557,"score_spread":0.2368104355867949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991373546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806873,0.0012667596,0.0010062599,0.0001008836,0.00036557016,0.00023868651,0.000013526483,0.00010453659,0.01621643],"genre_scores_gemma":[0.9521867,0.00050850044,0.045745417,0.00012347415,0.00044144937,0.000005039907,0.0000011802624,0.00010347263,0.0008847577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723256,0.0008316393,0.0006753367,0.0001920824,0.00065027643,0.00041809413],"domain_scores_gemma":[0.9972927,0.0012157519,0.0004634805,0.0004142989,0.00033126923,0.00028250882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006469862,0.00023060171,0.00046392475,0.00061197043,0.00014505856,0.00005275172,0.00035651532,0.000168695,0.00031930124],"category_scores_gemma":[0.00077649415,0.00018026229,0.00023667754,0.00038853785,0.0002672087,0.00032557256,0.00015409804,0.0006755935,0.00002948469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007465167,0.00075121963,0.00075770816,0.0001895751,0.0005704458,0.000543014,0.007960007,9.577879e-8,0.0006685571,0.98342735,0.003307492,0.0010780101],"study_design_scores_gemma":[0.0011452495,0.00073302543,0.0007612184,0.00007776784,0.00017694298,0.0014513034,0.0013384158,0.000005204645,0.0024993927,0.9891356,0.002467662,0.00020817043],"about_ca_topic_score_codex":0.000001208935,"about_ca_topic_score_gemma":0.0000011791687,"teacher_disagreement_score":0.044739157,"about_ca_system_score_codex":0.000046769066,"about_ca_system_score_gemma":0.000103244405,"threshold_uncertainty_score":0.7350883},"labels":[],"label_agreement":null},{"id":"W1991583924","doi":"10.1002/jgt.20580","title":"High-girth cubic graphs are homomorphic to the Clebsch graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Cubic graph; Foster graph; Edge coloring; Discrete mathematics; Triangle-free graph; Symmetric graph; Graph homomorphism; Petersen graph; Windmill graph; Graph power; Odd graph; Graph; Voltage graph; Line graph; 1-planar graph","score_opus":0.0306625239425227,"score_gpt":0.260962884872394,"score_spread":0.2303003609298713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991583924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5760018,0.0026203336,0.41531566,0.0022179123,0.002042869,0.00061097805,0.000016784941,0.00021815769,0.0009555166],"genre_scores_gemma":[0.9823535,0.0002905402,0.01598637,0.0010557724,0.00015049275,0.000019069694,3.7069495e-7,0.00003559209,0.00010828753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957691,0.001183092,0.0007872264,0.0004347194,0.0010682177,0.0007576344],"domain_scores_gemma":[0.9961217,0.00070228503,0.0007342426,0.0012551408,0.0006854404,0.00050119875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005118832,0.00034765003,0.0005258904,0.0011480926,0.00046714515,0.00015859575,0.0045658574,0.000116794225,0.0001084902],"category_scores_gemma":[0.0003095037,0.00020247957,0.0006022828,0.0030436402,0.0003915852,0.00095032714,0.0004950324,0.001040437,0.000103324244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047787654,0.00026303038,0.0019340732,0.000014855109,0.00023149118,0.0003209565,0.0017426559,0.000105902625,0.0015737896,0.9721525,0.0017492407,0.019433666],"study_design_scores_gemma":[0.0005639988,0.00070584676,0.017917858,0.0000866377,0.00003229409,0.0004196005,0.0004407634,0.00001562852,0.0035524922,0.97437733,0.0015769588,0.0003105655],"about_ca_topic_score_codex":0.000010009249,"about_ca_topic_score_gemma":0.000028216062,"teacher_disagreement_score":0.40635172,"about_ca_system_score_codex":0.000038756018,"about_ca_system_score_gemma":0.00009501843,"threshold_uncertainty_score":0.84845746},"labels":[],"label_agreement":null},{"id":"W2009792106","doi":"10.1002/jgt.20123","title":"Spanning subgraphs of graphs partitioned into two isomorphic pieces","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Countable set; Induced subgraph; Cograph; Discrete mathematics; Induced subgraph isomorphism problem; Graph; Pathwidth; Line graph; Voltage graph; Vertex (graph theory)","score_opus":0.01714410709455434,"score_gpt":0.2990813890537635,"score_spread":0.2819372819592092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009792106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50619584,0.0057136766,0.48476616,0.00141982,0.0005623641,0.00019495131,0.00000602951,0.00007771662,0.0010634384],"genre_scores_gemma":[0.9656857,0.00036862714,0.03356275,0.0001967123,0.00012122783,0.0000048911484,9.62161e-7,0.000016315424,0.000042791813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677217,0.0006522678,0.00094243744,0.0002897602,0.0008810366,0.00046229913],"domain_scores_gemma":[0.9969305,0.0006109145,0.00089086295,0.00066129694,0.0006417546,0.00026470766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004017192,0.00023275947,0.00049459346,0.0015371949,0.00022043005,0.00008003292,0.0017881147,0.000076603865,0.000079118094],"category_scores_gemma":[0.00026097606,0.00019472052,0.0005036585,0.0017538033,0.0005055701,0.001540719,0.00020152537,0.0005504173,0.000022297305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030699035,0.00027328444,0.0032436186,0.00003612478,0.00020073979,0.000059553204,0.001965996,0.002193831,0.0138510335,0.9416921,0.0004759669,0.03570072],"study_design_scores_gemma":[0.0011381091,0.0004463335,0.0012090281,0.00012776235,0.00003013605,0.00018819315,0.0002457303,0.00037499293,0.020851932,0.97391003,0.001250826,0.00022689733],"about_ca_topic_score_codex":0.0000045953007,"about_ca_topic_score_gemma":0.000013050369,"teacher_disagreement_score":0.45948988,"about_ca_system_score_codex":0.000039481376,"about_ca_system_score_gemma":0.000116655414,"threshold_uncertainty_score":0.7940472},"labels":[],"label_agreement":null},{"id":"W2015593095","doi":"10.1002/jgt.10079","title":"3‐colorability of 4‐regular hamiltonian graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Pancyclic graph; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.02249071109048013,"score_gpt":0.2640508079551846,"score_spread":0.24156009686470448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015593095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6710443,0.0051140273,0.31728166,0.0008844101,0.0007743471,0.00029062972,0.0000064702795,0.00007284905,0.0045313127],"genre_scores_gemma":[0.9808008,0.00024317714,0.018643267,0.00009558024,0.000037392787,0.0000024422216,1.045807e-7,0.00001433588,0.00016292173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701834,0.0007876408,0.0007673167,0.00025367158,0.00077862997,0.00039438478],"domain_scores_gemma":[0.9970377,0.0006497898,0.0006257135,0.00090126187,0.0005520739,0.00023344689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037994739,0.00018311893,0.00045507937,0.00083346496,0.00012360749,0.000045582892,0.0020140351,0.00009277522,0.00015100946],"category_scores_gemma":[0.00040611747,0.00014671359,0.0005054748,0.0014038042,0.00063477305,0.0008502421,0.00020308781,0.00048699242,0.000012750212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012178076,0.0003629242,0.0020431278,0.000036819692,0.00012641255,0.0000755242,0.0008670288,0.00011243882,0.006985707,0.9503661,0.00041108252,0.038491055],"study_design_scores_gemma":[0.0005964647,0.0005392671,0.0049198624,0.00004926071,0.000016352491,0.0001582555,0.00010671619,0.00029156657,0.006964281,0.98543745,0.0007678575,0.00015266673],"about_ca_topic_score_codex":0.0000010792116,"about_ca_topic_score_gemma":0.0000011489745,"teacher_disagreement_score":0.3097565,"about_ca_system_score_codex":0.000037565966,"about_ca_system_score_gemma":0.00003942161,"threshold_uncertainty_score":0.59828067},"labels":[],"label_agreement":null},{"id":"W2018547288","doi":"10.1002/jgt.10073","title":"Bi‐arc graphs and the complexity of list homomorphisms","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":114,"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; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Graph; Line graph; Graph power","score_opus":0.0487071365618233,"score_gpt":0.2748106614581519,"score_spread":0.22610352489632862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018547288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5284723,0.02699076,0.41943505,0.009487778,0.0012350712,0.00078869605,0.000024291205,0.00011622648,0.013449796],"genre_scores_gemma":[0.99171996,0.0009531116,0.0069265324,0.00021341468,0.000032343425,0.0000023186865,1.15763164e-7,0.0000111964755,0.00014101877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973715,0.00095967366,0.0005730355,0.00018401908,0.00061805855,0.00029369362],"domain_scores_gemma":[0.99723125,0.0010973837,0.0005705381,0.00060273474,0.0003344554,0.00016363566],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039832536,0.00015945033,0.00043209747,0.0005226178,0.00022763034,0.000079050296,0.0015813208,0.000054261604,0.000089265974],"category_scores_gemma":[0.00030153847,0.00009637835,0.00032085323,0.0009474717,0.0040978948,0.0005068326,0.0002719474,0.000514711,0.000003815684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020757655,0.00009064998,0.00026730285,0.000015236595,0.00008187283,0.000030041529,0.0008199528,0.0000106946645,0.00056668604,0.9893486,0.00027582305,0.008285597],"study_design_scores_gemma":[0.001574702,0.00022871906,0.001049115,0.000043238393,0.000020410407,0.00036846107,0.00014078392,0.00069853547,0.0009346327,0.99455667,0.0002792408,0.00010550325],"about_ca_topic_score_codex":0.0000039995552,"about_ca_topic_score_gemma":0.000002157489,"teacher_disagreement_score":0.46324763,"about_ca_system_score_codex":0.000012827567,"about_ca_system_score_gemma":0.000021357759,"threshold_uncertainty_score":0.9986124},"labels":[],"label_agreement":null},{"id":"W2022630997","doi":"10.1002/jgt.20560","title":"Disjoint Hamilton cycles in the random geometric graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Disjoint sets; Hamiltonian path; Pairwise comparison; Discrete mathematics; Line graph; Random graph; Graph","score_opus":0.025574762827060893,"score_gpt":0.22949837930324368,"score_spread":0.2039236164761828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022630997","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.2929801,0.0025330805,0.6924496,0.0004943372,0.0016036547,0.00028403403,0.000004420145,0.000040846535,0.009609882],"genre_scores_gemma":[0.99211526,0.00063403015,0.0066447966,0.00043721657,0.00011773317,0.0000033243157,8.261456e-7,0.0000045250135,0.000042269367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985845,0.00032260787,0.00038582628,0.00012883428,0.0003735237,0.00020471822],"domain_scores_gemma":[0.998974,0.0002908887,0.00028621385,0.00034876796,0.000050092378,0.000050000563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039282595,0.00010959319,0.00019438846,0.0008570942,0.000073175645,0.00012565944,0.001873777,0.00002752379,0.000021937023],"category_scores_gemma":[0.00006644569,0.000056135224,0.00020393936,0.0015328287,0.0000671127,0.00087452424,0.00011746144,0.00024165517,0.000008225667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040349094,0.0009352038,0.0058944887,0.000031374435,0.00024840294,0.0007451278,0.009217599,0.000021588863,0.0001579566,0.54601866,0.005077603,0.43124852],"study_design_scores_gemma":[0.0027397627,0.00041589647,0.14500104,0.000085016705,0.000060145027,0.00015903053,0.00091806584,0.00019720406,0.00047247924,0.8448657,0.0048002913,0.0002853583],"about_ca_topic_score_codex":0.000008716017,"about_ca_topic_score_gemma":0.000004871712,"teacher_disagreement_score":0.6991352,"about_ca_system_score_codex":0.000009035116,"about_ca_system_score_gemma":0.000011330677,"threshold_uncertainty_score":0.34819752},"labels":[],"label_agreement":null},{"id":"W2027624102","doi":"10.1002/jgt.20103","title":"Linear Ramsey numbers of sparse graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Ramsey's theorem; Chordal graph; Clique-sum; Indifference graph; Pathwidth; Discrete mathematics; Conjecture; 1-planar graph; Dense graph; Graph; Line graph","score_opus":0.026343419314670446,"score_gpt":0.3002599617595846,"score_spread":0.27391654244491415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027624102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868506,0.0010084502,0.0023421308,0.00015060337,0.0006936185,0.00011814481,0.000010318949,0.000025859352,0.008800281],"genre_scores_gemma":[0.9778709,0.00024752918,0.0210218,0.00020798108,0.00033912322,9.4635607e-7,4.412656e-7,0.00003724605,0.00027402779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978033,0.00032202993,0.0009900191,0.00013079135,0.00048475314,0.00026911634],"domain_scores_gemma":[0.9972837,0.00082039967,0.0010397537,0.00040791612,0.00029539427,0.00015284531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481246,0.0002172135,0.0005687143,0.00047023653,0.00012588387,0.000012355918,0.0005348492,0.00015212233,0.0003609718],"category_scores_gemma":[0.00052847306,0.00015549488,0.0006813279,0.00034213826,0.00037744944,0.00022122516,0.00007204,0.00047338603,0.0000037920556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044469652,0.00018983017,0.0010437036,0.00006474966,0.00035671817,0.000022026163,0.0019185453,0.000047026144,0.0008718072,0.9862405,0.0028062293,0.0059941844],"study_design_scores_gemma":[0.0008742636,0.00018497727,0.00047344592,0.00011210284,0.00017729189,0.00021759882,0.000496691,0.000010739421,0.0045261616,0.98988473,0.0028721176,0.00016987418],"about_ca_topic_score_codex":0.0000014315482,"about_ca_topic_score_gemma":0.0000029471707,"teacher_disagreement_score":0.01867967,"about_ca_system_score_codex":0.000021664991,"about_ca_system_score_gemma":0.00004731956,"threshold_uncertainty_score":0.6340897},"labels":[],"label_agreement":null},{"id":"W2036786740","doi":"10.1002/jgt.20445","title":"On the minimum degree of minimal Ramsey graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Degree (music); Discrete mathematics; Cograph; Graph; Pathwidth; Chordal graph; 1-planar graph; Line graph","score_opus":0.040269359185450715,"score_gpt":0.2881943755700647,"score_spread":0.247925016384614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036786740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839441,0.0005732601,0.00053987425,0.00053338817,0.00051758514,0.00014871295,0.000007481992,0.000015436035,0.013720124],"genre_scores_gemma":[0.99732804,0.00008215741,0.0015688525,0.00073674717,0.00013070965,9.600363e-7,2.207872e-7,0.000020664917,0.00013167124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976686,0.00050369126,0.0008490773,0.00013417895,0.0005719902,0.000272463],"domain_scores_gemma":[0.9952603,0.002897571,0.0009821497,0.00051552604,0.00024016293,0.000104265644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002971503,0.00023658662,0.00050616346,0.00040675575,0.00020403195,0.000022415907,0.00078389386,0.00013616128,0.0002045043],"category_scores_gemma":[0.0012013407,0.00012628017,0.0007087154,0.0003555746,0.00037301306,0.000103821876,0.000042120915,0.00054139964,0.0000016319416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086148846,0.00018842297,0.000104469116,0.0000191229,0.00018777675,0.000025385149,0.0012164918,0.0000026109778,0.0013813736,0.98565215,0.0053313314,0.0050294017],"study_design_scores_gemma":[0.0006143682,0.0009851656,0.002660909,0.00014104942,0.00013453307,0.00012287051,0.0005901766,0.0000025512659,0.0031691133,0.9912556,0.0001823205,0.00014138312],"about_ca_topic_score_codex":3.2847583e-7,"about_ca_topic_score_gemma":4.5845476e-7,"teacher_disagreement_score":0.013588453,"about_ca_system_score_codex":0.0000142580275,"about_ca_system_score_gemma":0.000040256273,"threshold_uncertainty_score":0.5149556},"labels":[],"label_agreement":null},{"id":"W2044097137","doi":"10.1002/jgt.10133","title":"Graphs embedded in the plane with a bounded number of accumulation points","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Bounded function; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Plane (geometry); Chordal graph; Characterization (materials science); Graph; Geometry; Mathematical analysis; Computer science","score_opus":0.027516363535805933,"score_gpt":0.3258557425078503,"score_spread":0.2983393789720444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044097137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8603009,0.00020427401,0.13546436,0.00017404804,0.00012530008,0.00019879823,0.000001332308,0.000011697543,0.0035192957],"genre_scores_gemma":[0.98239255,0.000031339885,0.017403265,0.00012274513,0.000011611555,0.0000033469148,3.2592874e-7,0.000009873662,0.000024962208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970481,0.0013056535,0.00048827575,0.00016072487,0.0007178434,0.00027942946],"domain_scores_gemma":[0.99778736,0.00092977396,0.00047178546,0.0004959291,0.0002426627,0.00007251869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048010796,0.00013932878,0.00027208938,0.00049421366,0.00008423326,0.00006277388,0.0010520602,0.00005503023,0.00003755783],"category_scores_gemma":[0.00027596473,0.00008237722,0.00014194287,0.0014456487,0.00024736385,0.0006672698,0.000035651196,0.00042752502,0.0000040501704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036210212,0.00015734548,0.009173349,0.000011907678,0.000051248113,0.00007877488,0.0019629942,0.00017424562,0.0004560408,0.986593,0.000037599206,0.0009414086],"study_design_scores_gemma":[0.0011512906,0.00025164775,0.007287302,0.000067487446,0.000010933107,0.0006916164,0.0006322775,0.000060355724,0.0015242582,0.9881105,0.00010736615,0.000104988896],"about_ca_topic_score_codex":0.0000018702303,"about_ca_topic_score_gemma":0.0000065306717,"teacher_disagreement_score":0.12209162,"about_ca_system_score_codex":0.000021793388,"about_ca_system_score_gemma":0.00011180212,"threshold_uncertainty_score":0.33592457},"labels":[],"label_agreement":null},{"id":"W2056603572","doi":"10.1002/jgt.20125","title":"Erratum to: Factorizations and characterizations of induced‐hereditary and compositive properties","year":2005,"lang":"en","type":"erratum","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.024301531156611444,"score_gpt":0.27298535546477193,"score_spread":0.2486838243081605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056603572","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.16635849,0.06799742,0.6771941,0.0087327305,0.054708075,0.00372513,0.0007460886,0.00030102165,0.020236932],"genre_scores_gemma":[0.96029025,0.0060150856,0.01443431,0.000743217,0.0022022089,0.000034397162,0.000051241608,0.00016205681,0.016067225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976169,0.00046393988,0.00071016734,0.0003268512,0.00057701126,0.00030516766],"domain_scores_gemma":[0.9975105,0.00026780515,0.00073060056,0.00042349775,0.000824022,0.00024355495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085884024,0.00030972777,0.00064951304,0.001279946,0.0002090532,0.00011953838,0.0009266307,0.00025725673,0.000009858555],"category_scores_gemma":[0.0002917334,0.00025015805,0.00014141723,0.00080101757,0.00035919927,0.0009616417,0.00042429558,0.0011444505,0.0000013119978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010162626,0.0012184383,0.0006471338,0.0011216442,0.0023935114,0.00032432054,0.027745733,0.00011708352,0.14113633,0.6253802,0.09369617,0.10520317],"study_design_scores_gemma":[0.003439455,0.0069189216,0.06452147,0.008627059,0.00065987965,0.0028115462,0.0029503328,0.00081978564,0.01576633,0.8346963,0.055278525,0.003510394],"about_ca_topic_score_codex":0.000002355075,"about_ca_topic_score_gemma":0.0000032670703,"teacher_disagreement_score":0.7939318,"about_ca_system_score_codex":0.000041691077,"about_ca_system_score_gemma":0.00033067193,"threshold_uncertainty_score":0.99999505},"labels":[],"label_agreement":null},{"id":"W2062017656","doi":"10.1002/jgt.20102","title":"On graphs whose Laplacian matrices have distinct integer eigenvalues","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Laplacian matrix; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Conjecture; Laplace operator; Resistance distance; Algebraic connectivity; Graph; Discrete mathematics; Integer (computer science); Spectral graph theory; Matrix (chemical analysis); Line graph; Graph power; Mathematical analysis; Computer science; Physics","score_opus":0.02432364321713661,"score_gpt":0.3075562901536715,"score_spread":0.2832326469365349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062017656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97991484,0.0007503701,0.0043473523,0.0006134512,0.00020670908,0.00019407141,0.000021078278,0.000061422936,0.013890686],"genre_scores_gemma":[0.99577814,0.00011620472,0.0029029017,0.00028902618,0.00022521213,0.000009243113,0.0000015145858,0.000036469202,0.0006412934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981605,0.00033030973,0.00069956935,0.00017080484,0.0003700273,0.00026882722],"domain_scores_gemma":[0.9971018,0.0014668697,0.0006963515,0.00038757487,0.00017860252,0.00016881601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021658158,0.00023580859,0.0003813461,0.00055654586,0.0002322592,0.00005913577,0.0004905044,0.00010657084,0.00036558823],"category_scores_gemma":[0.00042947524,0.00017197877,0.0004991213,0.0003379367,0.00021924378,0.00024180986,0.00003512451,0.00048028104,0.000057873076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027061452,0.0004203965,0.00041949545,0.000024609744,0.00014382809,0.000013024693,0.0007929889,0.000013303042,0.0002653919,0.9875217,0.0048433035,0.005271314],"study_design_scores_gemma":[0.00046110872,0.00019942062,0.0006649034,0.00013435092,0.0001505717,0.00008784581,0.00064245664,0.000009851013,0.001685876,0.99179107,0.003980233,0.00019230136],"about_ca_topic_score_codex":8.500498e-7,"about_ca_topic_score_gemma":0.000009376056,"teacher_disagreement_score":0.015863277,"about_ca_system_score_codex":0.000033514327,"about_ca_system_score_gemma":0.0000313042,"threshold_uncertainty_score":0.7013091},"labels":[],"label_agreement":null},{"id":"W2069566112","doi":"10.1002/jgt.20494","title":"On directed local chromatic number, shift graphs, and Borsuk-like graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Graph; Critical graph; Discrete mathematics; Foster graph; Friendship graph; Line graph; Graph power","score_opus":0.0055389785225067175,"score_gpt":0.22734510394033508,"score_spread":0.22180612541782838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069566112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92069054,0.0004771605,0.07614139,0.00059522793,0.0009551304,0.000063507956,0.000008011905,0.000098139004,0.0009709177],"genre_scores_gemma":[0.9944324,0.00016072296,0.0047901575,0.000517618,0.000032369393,0.000001411147,0.0000013512698,0.0000069840644,0.000056987614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982561,0.00023059365,0.0004853327,0.00026427748,0.00047911823,0.00028458086],"domain_scores_gemma":[0.99795246,0.0008025958,0.0003825041,0.00046559525,0.00011246893,0.00028437347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014535473,0.00019285192,0.00040581083,0.00082982186,0.00016765881,0.00014734072,0.0010276523,0.0001196147,0.00019330779],"category_scores_gemma":[0.0003095025,0.00012523137,0.00031112815,0.0020435913,0.0003873562,0.00044651906,0.00015077007,0.0006155328,0.000024426507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060251365,0.00024483388,0.003263212,0.000010683238,0.0001916982,0.00011735083,0.00018450098,0.0000062866925,0.0002038686,0.9566737,0.0018890612,0.03715457],"study_design_scores_gemma":[0.00047188217,0.00028904717,0.04516854,0.000024167513,0.00006819963,0.00021539221,0.00003611957,0.00021036871,0.00013183955,0.95237815,0.00082538486,0.00018090368],"about_ca_topic_score_codex":0.000014418035,"about_ca_topic_score_gemma":0.00001521588,"teacher_disagreement_score":0.073741876,"about_ca_system_score_codex":0.000007935638,"about_ca_system_score_gemma":0.00003071575,"threshold_uncertainty_score":0.5106787},"labels":[],"label_agreement":null},{"id":"W2071725273","doi":"10.1002/jgt.20554","title":"The plane-width of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wheel graph; Chromatic scale; Vertex (graph theory); Graph; Windmill graph; Graph power; Geometric graph theory; Bound graph; Independent set","score_opus":0.028823839862715587,"score_gpt":0.2675951910981415,"score_spread":0.23877135123542592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071725273","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.29129592,0.00945501,0.66521823,0.0005344933,0.0024549314,0.00042179695,0.000008236681,0.00009481568,0.030516576],"genre_scores_gemma":[0.98604995,0.00051596237,0.013159141,0.00007536536,0.000036140784,0.000002071721,8.992209e-8,0.00001248301,0.00014882325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978986,0.0005273864,0.00055681885,0.00013795139,0.0005551173,0.00032417034],"domain_scores_gemma":[0.9973035,0.0009492149,0.0006013611,0.0006516602,0.00035201877,0.00014224963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040371465,0.00012821076,0.0002443592,0.00042663218,0.0001920999,0.000036385783,0.0024664532,0.000051375187,0.000028811382],"category_scores_gemma":[0.00024600778,0.000075268516,0.0003007907,0.00073262135,0.0005494091,0.0004808819,0.00018441415,0.00039793574,0.000006858868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027635138,0.00006989672,0.0010007333,0.000006922202,0.000095651354,0.000042589676,0.00094003434,0.0000042358643,0.0010407589,0.9718421,0.00022298457,0.02445775],"study_design_scores_gemma":[0.00031197205,0.0004022689,0.0035346942,0.00003048894,0.000010877174,0.0001629046,0.00020519548,0.00001374524,0.0089282645,0.9855893,0.0007246311,0.00008563911],"about_ca_topic_score_codex":0.0000019295524,"about_ca_topic_score_gemma":0.000001891184,"teacher_disagreement_score":0.694754,"about_ca_system_score_codex":0.000011717592,"about_ca_system_score_gemma":0.00008294121,"threshold_uncertainty_score":0.45833248},"labels":[],"label_agreement":null},{"id":"W2074364524","doi":"10.1002/jgt.20571","title":"On characterizing Vizing's edge colouring bound","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Domination analysis; Logarithm; Bounded function; Upper and lower bounds; Multiplicity (mathematics); Graph; Edge coloring; Discrete mathematics; Vertex (graph theory); Line graph; Graph power; Geometry","score_opus":0.038400955960673284,"score_gpt":0.27935740087532934,"score_spread":0.24095644491465606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074364524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7852529,0.00043347655,0.20317015,0.00014179491,0.0011568329,0.00013063685,0.0000013168109,0.00006986349,0.009643018],"genre_scores_gemma":[0.9904892,0.0000694464,0.00869442,0.00043506126,0.00012460958,0.0000030082422,1.222309e-7,0.000021960295,0.00016219872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979645,0.00041344672,0.00046363994,0.00023097209,0.0004936691,0.0004337466],"domain_scores_gemma":[0.9980632,0.00049359846,0.0004694742,0.0005212881,0.00022756743,0.00022488929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029325238,0.0001783079,0.0002926723,0.0007569166,0.00022712321,0.00010929887,0.0016193755,0.000069084075,0.00007428871],"category_scores_gemma":[0.0002516601,0.0001449583,0.00025555398,0.00055556244,0.00019808649,0.0010071996,0.00021001064,0.0006155914,0.00004098545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038093605,0.00016018876,0.00037534887,0.000012237436,0.00007855089,0.0002648162,0.0016810679,0.000006280493,0.011805712,0.9716611,0.000108800385,0.013464954],"study_design_scores_gemma":[0.0004932855,0.00069923344,0.0055397796,0.00012337681,0.000010148058,0.00023211872,0.000112504094,0.000039462993,0.019888667,0.9721775,0.0004966621,0.00018723692],"about_ca_topic_score_codex":7.655764e-7,"about_ca_topic_score_gemma":3.973961e-7,"teacher_disagreement_score":0.20523627,"about_ca_system_score_codex":0.000054690903,"about_ca_system_score_gemma":0.00008135458,"threshold_uncertainty_score":0.5911228},"labels":[],"label_agreement":null},{"id":"W2079177402","doi":"10.1002/1097-0118(200006)34:2<113::aid-jgt1>3.0.co;2-0","title":"Partitioning infinite trees","year":2000,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Degree (music); Graph; Discrete mathematics; Upper and lower bounds; Tree (set theory); Colored","score_opus":0.022902301243572076,"score_gpt":0.2836758935797546,"score_spread":0.2607735923361825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079177402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965255,0.00061895064,0.0009253093,0.00008902725,0.00034454433,0.000053063326,0.000003846753,0.000029316734,0.032680918],"genre_scores_gemma":[0.99505764,0.00022947983,0.0031533074,0.0002597056,0.00030871664,0.0000012263994,3.6878154e-7,0.000021696342,0.00096786354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863344,0.00026484337,0.0005411032,0.00008680742,0.00027528085,0.00019854115],"domain_scores_gemma":[0.9985628,0.0007037568,0.00030770947,0.0002254492,0.00010171756,0.0000985686],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014548907,0.0001360183,0.00028663973,0.00021833238,0.0002279188,0.000034309378,0.00027456597,0.00007851925,0.0027694616],"category_scores_gemma":[0.0002510437,0.00009585149,0.00032001064,0.00020085582,0.00017323976,0.00020571481,0.000021106647,0.00030867112,0.000009739278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002798048,0.00006762529,0.00083800644,0.00001656546,0.000159793,0.000042516294,0.0016707904,0.000039867176,0.00014550622,0.96899706,0.0020117168,0.025730735],"study_design_scores_gemma":[0.00044716976,0.00013261833,0.0020407655,0.000084309904,0.000081587146,0.00021907625,0.00023076701,0.000003848355,0.00039824384,0.9901043,0.0061391857,0.00011810413],"about_ca_topic_score_codex":5.599269e-7,"about_ca_topic_score_gemma":0.0000015328151,"teacher_disagreement_score":0.031713054,"about_ca_system_score_codex":0.000012524,"about_ca_system_score_gemma":0.000021520169,"threshold_uncertainty_score":0.9981421},"labels":[],"label_agreement":null},{"id":"W2086294103","doi":"10.1002/jgt.1021","title":"Counting 5‐connected planar triangulations","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Enhanced Data Rates for GSM Evolution; Graph; Planar straight-line graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","score_opus":0.023694302774234295,"score_gpt":0.29307900615916244,"score_spread":0.26938470338492815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086294103","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.14377606,0.00085537165,0.85013485,0.00079175545,0.00044740955,0.000102105136,0.0000016266931,0.000066819826,0.003823975],"genre_scores_gemma":[0.9754857,0.00012829166,0.023555234,0.0002483807,0.00020624204,0.0000021925448,6.4942367e-7,0.000016112286,0.00035720455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811745,0.0004139905,0.00048396116,0.00016371546,0.0004942097,0.000326703],"domain_scores_gemma":[0.9976278,0.0010172325,0.00040283301,0.00040421908,0.00039068348,0.00015722717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027444153,0.0001240486,0.00024045931,0.00074408663,0.00021684419,0.00010702007,0.0011195091,0.000058195186,0.00007285439],"category_scores_gemma":[0.0006083881,0.000101726095,0.00021220895,0.001279153,0.00012198029,0.00092961936,0.000066181885,0.00037623025,0.000019570747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001806306,0.00007451209,0.0015939347,0.0000045136067,0.000082667284,0.00021826172,0.00041252808,0.00022481797,0.003222502,0.97545433,0.00038247317,0.018148834],"study_design_scores_gemma":[0.0008380564,0.00016829568,0.004151224,0.000041503423,0.000013872921,0.00071619096,0.00018052063,0.0005211108,0.00053295726,0.9887157,0.0039768773,0.00014367026],"about_ca_topic_score_codex":0.000001151331,"about_ca_topic_score_gemma":0.0000021126205,"teacher_disagreement_score":0.8317096,"about_ca_system_score_codex":0.000036241556,"about_ca_system_score_gemma":0.00009149989,"threshold_uncertainty_score":0.414827},"labels":[],"label_agreement":null},{"id":"W2092649812","doi":"10.1002/jgt.20507","title":"The genus of Petersen powers","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Petersen graph; Mathematics; Conjecture; Counterexample; Genus; Cubic graph; Graph; Projective plane; Discrete mathematics; Line graph; Voltage graph; Botany; Biology; Geometry","score_opus":0.010033350701152684,"score_gpt":0.2752240021314691,"score_spread":0.2651906514303164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092649812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7510282,0.0017541396,0.23498707,0.0015133556,0.0032360177,0.000198667,0.0000031103752,0.00003752692,0.0072419546],"genre_scores_gemma":[0.99014163,0.000126378,0.009370553,0.00007208419,0.00008534394,0.0000011015841,4.7510433e-8,0.0000101240785,0.00019272126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983511,0.00030777586,0.00041473747,0.000117601994,0.0005300999,0.0002786675],"domain_scores_gemma":[0.99725574,0.0011447213,0.00045873135,0.00063979795,0.00036465115,0.00013638307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004067099,0.00010174189,0.00018568047,0.00029217597,0.00017814328,0.00006583161,0.0020985736,0.000050609608,0.000020087717],"category_scores_gemma":[0.0004803504,0.000061035855,0.0002692192,0.00048437263,0.0005449077,0.00041165442,0.00017553773,0.0006640444,0.000006768513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013509594,0.000039319013,0.000271723,0.0000046074447,0.00006726543,0.00003700395,0.00046731313,0.00001552718,0.026776483,0.91411895,0.00021807944,0.05784864],"study_design_scores_gemma":[0.0003826276,0.000266505,0.0018028273,0.000016854261,0.000009805491,0.00032497806,0.0002669084,0.000064001484,0.009761687,0.9777431,0.009259971,0.000100747464],"about_ca_topic_score_codex":7.43065e-7,"about_ca_topic_score_gemma":0.0000029665873,"teacher_disagreement_score":0.23911348,"about_ca_system_score_codex":0.000009496679,"about_ca_system_score_gemma":0.000101921076,"threshold_uncertainty_score":0.3899707},"labels":[],"label_agreement":null},{"id":"W2096004680","doi":"10.1002/jgt.21786","title":"Arc‐Disjoint In‐ and Out‐Branchings With the Same Root in Locally Semicomplete Digraphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Arc (geometry); Root (linguistics); Discrete mathematics; Geometry; Linguistics","score_opus":0.010463549243009442,"score_gpt":0.24629843738448523,"score_spread":0.2358348881414758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096004680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69634914,0.0006791085,0.30022866,0.0018528998,0.00009742819,0.00015455562,7.4888635e-7,0.000016409105,0.0006210124],"genre_scores_gemma":[0.9961338,0.00006825787,0.0031883758,0.00051049085,0.000042642027,0.000005081378,1.2520032e-7,0.000016521542,0.000034724693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973838,0.0008831498,0.0004836202,0.00028084236,0.00052463694,0.0004439689],"domain_scores_gemma":[0.9977749,0.0011239084,0.00032542367,0.00049719395,0.000126113,0.00015243626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005227925,0.00020331985,0.00038576633,0.0008328731,0.00011236316,0.00012977516,0.0012969059,0.00005572835,0.0000046260416],"category_scores_gemma":[0.00019130226,0.00011836172,0.00011866635,0.00086196535,0.0004978687,0.0006562336,0.00021548377,0.0009120437,0.0000024601782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010197462,0.00018542119,0.039651755,0.00004982116,0.000084386804,0.00017070852,0.010667735,0.0012302479,0.0043131146,0.8911892,0.00009738942,0.051340487],"study_design_scores_gemma":[0.0015126214,0.00054338283,0.046621934,0.0002260136,0.0000058725677,0.00025079632,0.00045057747,0.0008719748,0.0003530618,0.94840485,0.0005527503,0.00020614453],"about_ca_topic_score_codex":0.000008515544,"about_ca_topic_score_gemma":0.00026361464,"teacher_disagreement_score":0.2997846,"about_ca_system_score_codex":0.000033011947,"about_ca_system_score_gemma":0.00005838618,"threshold_uncertainty_score":0.4826651},"labels":[],"label_agreement":null},{"id":"W2099141182","doi":"10.1002/jgt.20062","title":"Factorizations and characterizations of induced‐hereditary and compositive properties","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Factorization; Graph; Discrete mathematics; Algorithm","score_opus":0.023847712417627,"score_gpt":0.26269614179325573,"score_spread":0.23884842937562872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099141182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8482458,0.0016122229,0.1491565,0.0005734742,0.00010976921,0.00010309178,0.0000069606563,0.000013639854,0.00017851064],"genre_scores_gemma":[0.99448556,0.00022920524,0.0051299864,0.00006580021,0.000053460495,0.0000015613552,5.035328e-7,0.000006940883,0.000026976737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990339,0.00020663605,0.00030469158,0.0001113096,0.00021522958,0.0001282245],"domain_scores_gemma":[0.99902153,0.00020622696,0.00023929149,0.00015470565,0.00029421118,0.00008405365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005292256,0.00009003234,0.00018697478,0.00036929583,0.000115536786,0.00003810344,0.0003003839,0.000039122646,0.00000572495],"category_scores_gemma":[0.00009854796,0.00006895655,0.000046750072,0.00032889133,0.000239318,0.0010141633,0.000120978046,0.00019510585,5.0822706e-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.0001282918,0.00019037597,0.0021606958,0.000039138522,0.00014875749,0.000015150377,0.005439288,0.000052606734,0.29197702,0.63893926,0.000018160597,0.060891245],"study_design_scores_gemma":[0.002241352,0.0016437048,0.16224822,0.0005479006,0.000091217014,0.0011405431,0.0016596726,0.0017937397,0.1646059,0.6627333,0.0006654038,0.0006290477],"about_ca_topic_score_codex":7.367366e-7,"about_ca_topic_score_gemma":6.810562e-7,"teacher_disagreement_score":0.16008753,"about_ca_system_score_codex":0.000011678308,"about_ca_system_score_gemma":0.00005152284,"threshold_uncertainty_score":0.28119665},"labels":[],"label_agreement":null},{"id":"W2100004673","doi":"10.1002/jgt.20618","title":"Bounded transversals in multipartite graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Mathematics; Combinatorics; Bounded function; Multipartite; Discrete mathematics; Extremal graph theory; Transversal (combinatorics); Degree (music); Graph; 1-planar graph; Strong perfect graph theorem; Chordal graph; Line graph; Voltage graph","score_opus":0.06671613521167737,"score_gpt":0.2927243006039696,"score_spread":0.22600816539229224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100004673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873919,0.0004905267,0.001726574,0.000025162644,0.00069163466,0.00013324468,0.000004196276,0.000023922486,0.009512841],"genre_scores_gemma":[0.991529,0.00013873023,0.008032677,0.00012731536,0.00005806924,0.000002491609,1.9152354e-7,0.000030081615,0.000081452854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798375,0.0004310042,0.0008254798,0.00013950045,0.00031072722,0.00030954837],"domain_scores_gemma":[0.9984266,0.00053825,0.0004735605,0.00030547712,0.00012586583,0.00013021273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002649757,0.00020171993,0.0004653863,0.0006857503,0.00011184375,0.000017105056,0.00046379928,0.0001372628,0.00036930337],"category_scores_gemma":[0.00032720822,0.0001469694,0.00045722615,0.0003748354,0.00028603364,0.0002671423,0.000034338933,0.00045918458,0.0000023690352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064443704,0.00020568183,0.0035847793,0.00003870777,0.00016271687,0.00012041713,0.013552893,0.0000010393718,0.0005494733,0.9795044,0.0002188285,0.0014166211],"study_design_scores_gemma":[0.0012066544,0.00018265245,0.006094872,0.000097597615,0.00008507201,0.0001239906,0.0010728199,0.0000022956492,0.0026262987,0.9881301,0.00020468204,0.00017296708],"about_ca_topic_score_codex":0.0000052893133,"about_ca_topic_score_gemma":0.000016566266,"teacher_disagreement_score":0.012480073,"about_ca_system_score_codex":0.000022891238,"about_ca_system_score_gemma":0.000033907407,"threshold_uncertainty_score":0.5993238},"labels":[],"label_agreement":null},{"id":"W2101880654","doi":"10.1002/jgt.21637","title":"Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Graph; Forcing (mathematics); Path (computing); Minor (academic); Tree (set theory); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.01925852887274516,"score_gpt":0.28743283386172175,"score_spread":0.2681743049889766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101880654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7789274,0.001745874,0.21794036,0.00024608115,0.00036320265,0.00019959267,0.0000040073605,0.000028868088,0.0005446142],"genre_scores_gemma":[0.96485746,0.00015012977,0.03474698,0.00015068379,0.000018244951,0.000004159952,3.4205215e-7,0.00001380083,0.00005821317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717534,0.0006491643,0.00073916215,0.00024085942,0.00060915755,0.00058631744],"domain_scores_gemma":[0.99730474,0.00080719416,0.0005518761,0.0005340837,0.00027363186,0.00052847865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004935176,0.00021742587,0.00047468953,0.0007954995,0.00012624024,0.000052377603,0.001042318,0.000108919434,0.000014958304],"category_scores_gemma":[0.00039459538,0.00015874993,0.00032260758,0.0012774799,0.00030194825,0.0010718526,0.00027524016,0.0005002187,0.0000049698724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013318651,0.0005090404,0.02783326,0.00008306419,0.00045664248,0.000051132574,0.0051698084,0.00018323046,0.02101053,0.71774906,0.00041939763,0.22520298],"study_design_scores_gemma":[0.0006409065,0.00057723455,0.015535463,0.00009184111,0.000031618274,0.0002618918,0.00014550587,0.00003811,0.0072005745,0.9750273,0.00025204054,0.00019747745],"about_ca_topic_score_codex":0.0000033409485,"about_ca_topic_score_gemma":0.000001722247,"teacher_disagreement_score":0.2572783,"about_ca_system_score_codex":0.00003520467,"about_ca_system_score_gemma":0.000040992978,"threshold_uncertainty_score":0.6473634},"labels":[],"label_agreement":null},{"id":"W2102470573","doi":"10.1002/jgt.20072","title":"Unavoidable cycle lengths in graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Degree (music); Discrete mathematics; Constant (computer programming); Computer science","score_opus":0.015900240928032175,"score_gpt":0.2874960107239288,"score_spread":0.2715957697958966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102470573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825434,0.0014627733,0.0006459681,0.00023937387,0.0004994781,0.00012110559,0.0000035143719,0.000026400276,0.014457965],"genre_scores_gemma":[0.99236387,0.00024041458,0.0065300097,0.00029633605,0.00023650443,0.0000023624766,2.2653659e-7,0.000033083157,0.00029720023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979626,0.00036600395,0.00081646716,0.00014405693,0.00037196046,0.00033891195],"domain_scores_gemma":[0.998019,0.00091235107,0.00048555038,0.00033004023,0.00012798497,0.00012510017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029940454,0.00020025724,0.00044632592,0.00070128596,0.00014928309,0.000028982617,0.0004889944,0.00013718268,0.00030642425],"category_scores_gemma":[0.0004916011,0.00014803174,0.00037557594,0.0004397981,0.00018077092,0.0003368378,0.000069580106,0.0005955024,0.000005531335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002398838,0.00018886247,0.0013496042,0.000030666713,0.00009538408,0.000042596115,0.0017107353,0.00010266954,0.00031621833,0.9848743,0.001363147,0.009685896],"study_design_scores_gemma":[0.0009856981,0.000117061936,0.0014673251,0.00009726229,0.000049628496,0.00016687602,0.00053363165,0.00001850077,0.0010606133,0.99247277,0.0028543656,0.00017625437],"about_ca_topic_score_codex":0.0000020232044,"about_ca_topic_score_gemma":0.000015873129,"teacher_disagreement_score":0.014160765,"about_ca_system_score_codex":0.00005129078,"about_ca_system_score_gemma":0.000044109063,"threshold_uncertainty_score":0.60365593},"labels":[],"label_agreement":null},{"id":"W2103183688","doi":"10.1002/jgt.21819","title":"A Proof of a Conjecture of Ohba","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.010952511875215414,"score_gpt":0.2700981083827483,"score_spread":0.2591455965075329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103183688","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.14997609,0.00085735833,0.84678495,0.0002449264,0.00021634997,0.000119002274,0.0000023753812,0.000011399528,0.0017875567],"genre_scores_gemma":[0.9841846,0.0000214101,0.015606341,0.00006337136,0.000048571786,0.000001236025,9.5695874e-8,0.0000097224765,0.000064658096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979236,0.00058580376,0.0005796268,0.00013810273,0.00055331714,0.00021954236],"domain_scores_gemma":[0.99736667,0.00074131304,0.00079377886,0.0005115435,0.0004734618,0.00011325669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034685882,0.000117998,0.00041451305,0.00057508796,0.00003957204,0.000015109436,0.0013518607,0.00006570338,0.00002287662],"category_scores_gemma":[0.00049901765,0.00008516224,0.00029169055,0.0007024012,0.00035042255,0.00033847996,0.00014694258,0.00033134135,0.0000010494856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022693697,0.0001338721,0.00042675107,0.000070970564,0.00009175289,0.000011065776,0.0007262278,0.0002692076,0.015211368,0.9459678,0.00011310573,0.03675092],"study_design_scores_gemma":[0.00063627696,0.00088160764,0.0005541168,0.000111882306,0.000013534214,0.00012531543,0.000060964263,0.00023729612,0.07322563,0.9235719,0.000497433,0.00008407213],"about_ca_topic_score_codex":7.367477e-7,"about_ca_topic_score_gemma":6.5890237e-7,"teacher_disagreement_score":0.8342085,"about_ca_system_score_codex":0.0000117564805,"about_ca_system_score_gemma":0.00009754498,"threshold_uncertainty_score":0.34728155},"labels":[],"label_agreement":null},{"id":"W2111678564","doi":"10.1002/jgt.20613","title":"Kempe Equivalence of Edge‐Colorings in Subcubic and Subquartic Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Equivalence (formal languages); Edge coloring; Graph; Enhanced Data Rates for GSM Evolution; Cubic graph; Discrete mathematics; Line graph; Voltage graph; Graph power; Computer science","score_opus":0.03657459361179385,"score_gpt":0.2746048405043239,"score_spread":0.23803024689253002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111678564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9683851,0.002007007,0.027970122,0.000059182617,0.0002056966,0.00011544497,7.922949e-7,0.000015903235,0.0012407446],"genre_scores_gemma":[0.9922523,0.00042080483,0.007223186,0.000041180563,0.000012854751,0.000003331362,4.0312543e-8,0.000011261769,0.000035039215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978802,0.00043076684,0.0006403564,0.00023060116,0.00043186714,0.00038616415],"domain_scores_gemma":[0.99818486,0.0005236182,0.0004423574,0.00042921148,0.00023992993,0.00018003478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034405557,0.00015613582,0.00036934428,0.0011654086,0.00005856767,0.000026107733,0.0012065781,0.000067112946,0.000027807766],"category_scores_gemma":[0.0002544832,0.0001294434,0.00016546043,0.0012160161,0.0005306245,0.0009397883,0.00022332095,0.00042403056,0.0000028936033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040320563,0.00017271824,0.027120912,0.00005193075,0.000042780583,0.00013346615,0.0029080093,0.000007733747,0.009477856,0.95042616,0.000010691813,0.009244537],"study_design_scores_gemma":[0.00061389455,0.0007233779,0.05100743,0.00012347045,0.000010977343,0.00014510886,0.0002835866,0.000041506286,0.013613228,0.93328995,0.000015717136,0.00013177514],"about_ca_topic_score_codex":0.0000063394978,"about_ca_topic_score_gemma":0.000004186994,"teacher_disagreement_score":0.023886519,"about_ca_system_score_codex":0.00002228095,"about_ca_system_score_gemma":0.00007912252,"threshold_uncertainty_score":0.52785486},"labels":[],"label_agreement":null},{"id":"W2113930605","doi":"10.1002/jgt.20568","title":"Domination number of cubic graphs with large girth","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Univerza v Ljubljani","keywords":"Combinatorics; Mathematics; Cubic graph; Girth (graph theory); Domination analysis; Vertex (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Line graph; Voltage graph","score_opus":0.017572267326257954,"score_gpt":0.2775833201858796,"score_spread":0.26001105285962167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113930605","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.41181058,0.00029515277,0.5800746,0.000042593445,0.00020876141,0.00011893677,0.0000030732574,0.000024956922,0.0074213734],"genre_scores_gemma":[0.9616948,0.00007804147,0.038014412,0.0000516332,0.000022151964,0.0000026224104,2.4426694e-7,0.000015004964,0.000121125384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800175,0.0004206612,0.00046462993,0.00017899921,0.0006138389,0.00032014085],"domain_scores_gemma":[0.99788225,0.00026469032,0.0006306301,0.00047749688,0.0005996089,0.00014532088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027850477,0.00014902255,0.00030642105,0.0006039058,0.00009232646,0.000024125937,0.0011579407,0.000059693306,0.00013819616],"category_scores_gemma":[0.000097365,0.000104048755,0.00021728479,0.0010703311,0.0002730481,0.000997764,0.000116038056,0.0003437822,0.000010759259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049433607,0.00024416292,0.007866494,0.00001926887,0.000106043306,0.00006518286,0.0015792344,0.0000047926633,0.0009229919,0.98288333,0.000051833,0.0057623],"study_design_scores_gemma":[0.0011333058,0.00048314178,0.008693331,0.00007842305,0.000022402197,0.00034707744,0.0002721996,0.000036940568,0.011502657,0.9771549,0.00013599097,0.00013962299],"about_ca_topic_score_codex":0.0000017152777,"about_ca_topic_score_gemma":0.0000025538707,"teacher_disagreement_score":0.5498842,"about_ca_system_score_codex":0.000018354283,"about_ca_system_score_gemma":0.000085103005,"threshold_uncertainty_score":0.42429852},"labels":[],"label_agreement":null},{"id":"W2114935764","doi":"10.1002/jgt.10126","title":"Packing paths in digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Combinatorics; Digraph; Bipartite graph; Mathematics; Packing problems; Disjoint sets; Vertex (graph theory); Matching (statistics); Undirected graph; Graph","score_opus":0.01678610636798969,"score_gpt":0.2814075109099237,"score_spread":0.26462140454193406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114935764","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.31352666,0.003904283,0.6703027,0.00022713532,0.0008413129,0.00017268398,9.940792e-7,0.00004586773,0.010978381],"genre_scores_gemma":[0.98555404,0.00020374631,0.013977014,0.00015125997,0.0000276437,0.0000023499513,6.190448e-8,0.000013108426,0.00007078002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997462,0.0009085628,0.0005135834,0.00019987299,0.0004990622,0.0004169422],"domain_scores_gemma":[0.9982604,0.0006415282,0.0003020615,0.00045198275,0.00018243743,0.00016163883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004835769,0.00014572885,0.00027954765,0.0011160388,0.000086924716,0.00008285233,0.0010848163,0.00006344289,0.000030029589],"category_scores_gemma":[0.00060363853,0.000117766045,0.00023910259,0.0015204892,0.00015028259,0.00087503495,0.00007741189,0.000562487,0.000008246852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044683744,0.00009318255,0.005846027,0.000006930796,0.000024403804,0.00023639252,0.00059660495,0.00010136319,0.0014874113,0.9765272,0.000048321315,0.014987439],"study_design_scores_gemma":[0.0005997939,0.0001597982,0.002726099,0.000065314816,0.0000036302824,0.0002541435,0.00024326409,0.0000315813,0.0029119793,0.9916563,0.0012101141,0.00013795408],"about_ca_topic_score_codex":6.596813e-7,"about_ca_topic_score_gemma":0.0000024497192,"teacher_disagreement_score":0.67202735,"about_ca_system_score_codex":0.00004048011,"about_ca_system_score_gemma":0.00010420319,"threshold_uncertainty_score":0.480236},"labels":[],"label_agreement":null},{"id":"W2121942061","doi":"10.1002/jgt.21823","title":"Embedding a Graph‐Like Continuum in Some Surface","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Embedding; Graph; Pairwise comparison; Surface (topology); Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.013010212310684959,"score_gpt":0.28833193695926046,"score_spread":0.2753217246485755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121942061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5491364,0.0013352048,0.44718713,0.0004108745,0.0008590745,0.00013073208,0.000001016606,0.00005044786,0.00088911236],"genre_scores_gemma":[0.9802872,0.00013966695,0.018808391,0.0003858042,0.00011837742,0.0000020431303,1.9875507e-7,0.000023152314,0.000235185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666446,0.0011202887,0.0006864411,0.00030170302,0.0006472713,0.00057981926],"domain_scores_gemma":[0.9972246,0.0012037088,0.00047218858,0.0006110619,0.00025082953,0.00023761073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007157549,0.00021466461,0.0004728525,0.0009929348,0.00012328435,0.00013094595,0.0018499091,0.00009589701,0.000019354695],"category_scores_gemma":[0.00041916105,0.00017909889,0.00031780897,0.0011664693,0.0002510112,0.001458821,0.00024435675,0.0007538368,0.000016959339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023965848,0.00015897596,0.002898137,0.00002529072,0.000069523994,0.0001398768,0.0009851132,0.0018419432,0.010651215,0.9713806,0.00051544886,0.011094205],"study_design_scores_gemma":[0.0010853562,0.00029395093,0.0018676618,0.000116588424,0.0000074245404,0.00014596584,0.00014431892,0.0015505375,0.0022016827,0.99119055,0.0011770349,0.00021895443],"about_ca_topic_score_codex":0.0000022715767,"about_ca_topic_score_gemma":0.0000059364793,"teacher_disagreement_score":0.4311508,"about_ca_system_score_codex":0.000047942856,"about_ca_system_score_gemma":0.00007264696,"threshold_uncertainty_score":0.73034406},"labels":[],"label_agreement":null},{"id":"W2127629780","doi":"10.1002/jgt.21755","title":"On the Polarity and Monopolarity of Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Pathwidth; Indifference graph; Cograph; Strong perfect graph theorem; Maximal independent set; 1-planar graph; Modular decomposition; Discrete mathematics; Split graph; Metric dimension; Bipartite graph; Time complexity; Line graph; Graph","score_opus":0.015333792843876674,"score_gpt":0.25951331588194154,"score_spread":0.24417952303806487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127629780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92869776,0.00095631316,0.067342766,0.0015669286,0.00017122662,0.00018652662,0.0000021818312,0.000014456046,0.0010618202],"genre_scores_gemma":[0.9959878,0.00010429451,0.0035523775,0.00029325884,0.000017208245,0.0000025435381,5.1750813e-8,0.0000072620214,0.000035222834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980726,0.000688856,0.0003785066,0.000149376,0.00047162204,0.00023901113],"domain_scores_gemma":[0.9970017,0.0016161405,0.00036648128,0.0005287187,0.00034660712,0.000140334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031323452,0.00012577012,0.000243692,0.00039519134,0.00016185631,0.00008488329,0.0012157642,0.00005922075,0.000050668554],"category_scores_gemma":[0.00049035705,0.000073361574,0.00018589835,0.0005704529,0.0005050318,0.00066793844,0.00019885713,0.0005868696,0.000006056721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050992836,0.000077021694,0.00164244,0.000008189026,0.000052380947,0.0000050608196,0.00027596502,0.000004607614,0.0041626683,0.98574716,0.00017664186,0.0077968715],"study_design_scores_gemma":[0.00023454528,0.0003207083,0.019839989,0.000031129886,0.000006765626,0.00005457601,0.00012377252,0.000088101,0.0036007168,0.9755849,0.00004036538,0.000074430194],"about_ca_topic_score_codex":0.000013544591,"about_ca_topic_score_gemma":0.0000011215096,"teacher_disagreement_score":0.06729,"about_ca_system_score_codex":0.00001220742,"about_ca_system_score_gemma":0.000043480013,"threshold_uncertainty_score":0.29915982},"labels":[],"label_agreement":null},{"id":"W2128803128","doi":"10.1002/jgt.20602","title":"Automorphism group and diameter of a graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph automorphism; Automorphism; Automorphism group; Graph; Edge-transitive graph; Vertex-transitive graph; Symmetric graph; Upper and lower bounds; Discrete mathematics; Order (exchange); Voltage graph; Line graph","score_opus":0.028883853005037145,"score_gpt":0.2597567527243919,"score_spread":0.23087289971935476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128803128","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.3872146,0.0024555647,0.6081509,0.00007266611,0.00034495618,0.00014422709,0.000004432007,0.000036368237,0.0015763117],"genre_scores_gemma":[0.9405576,0.0002863707,0.058964625,0.00011378879,0.000031869295,0.0000026884868,1.5477325e-7,0.000010143179,0.000032743024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981274,0.00043866644,0.00050992693,0.00019996369,0.0004319041,0.0002921253],"domain_scores_gemma":[0.9982049,0.00049827737,0.00048530824,0.00039816622,0.00021139756,0.00020196379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025774506,0.00015498648,0.00035063457,0.0006667105,0.00007611454,0.000029461744,0.0010616195,0.00007008327,0.000047295427],"category_scores_gemma":[0.0001213485,0.000106658306,0.00025165753,0.00067995803,0.00045095952,0.0007419963,0.0002256799,0.00036169114,0.0000021632975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032070602,0.0002216141,0.0027256291,0.000030634103,0.00016914471,0.00013311718,0.002107422,0.0000016849297,0.014259853,0.9331186,0.00008594506,0.046825677],"study_design_scores_gemma":[0.0005560377,0.0007187392,0.013254377,0.00006575694,0.000021520218,0.0003017857,0.000102150894,0.000035450114,0.005774499,0.9788803,0.00015195845,0.00013742059],"about_ca_topic_score_codex":0.0000031347365,"about_ca_topic_score_gemma":0.0000017212711,"teacher_disagreement_score":0.553343,"about_ca_system_score_codex":0.000011493071,"about_ca_system_score_gemma":0.000031622163,"threshold_uncertainty_score":0.43493995},"labels":[],"label_agreement":null},{"id":"W2130393429","doi":"10.1002/jgt.20623","title":"Graphs obtained from Moufang loops and regular maps","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Mathematics; Cayley graph; Transitive relation; Vertex (graph theory); Combinatorics; Vertex-transitive graph; Graph; Discrete mathematics; Voltage graph; Line graph","score_opus":0.044752276316664,"score_gpt":0.2663560473290544,"score_spread":0.22160377101239037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130393429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97064817,0.00075187325,0.02011877,0.00015538497,0.00012794882,0.00016038172,0.000020910637,0.00002861125,0.007987947],"genre_scores_gemma":[0.8675626,0.00018949424,0.13155635,0.00011746546,0.000119204495,0.000005948787,0.0000017310958,0.000037217455,0.00040996927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906236,0.00008690209,0.00044595276,0.00009521201,0.00018164306,0.00012791283],"domain_scores_gemma":[0.9986611,0.0003749027,0.00045602059,0.00027885393,0.00011872614,0.00011038469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009389022,0.00011840048,0.00027254908,0.00016185343,0.00008042542,0.000021751568,0.0002183104,0.00006422258,0.00019417937],"category_scores_gemma":[0.00015901896,0.00008811749,0.00015350735,0.00013658527,0.0001066011,0.00009093171,0.000036864945,0.00016392245,0.000004630807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046663936,0.00017161589,0.00029956334,0.00003728466,0.00015483897,0.000014080966,0.001968406,7.7245325e-8,0.0018172854,0.9889557,0.0056264466,0.000908054],"study_design_scores_gemma":[0.00034760896,0.000053413198,0.0006088264,0.00007501674,0.00012946113,0.000054964665,0.00077229476,0.000006636712,0.0019457777,0.9952725,0.000634361,0.00009912659],"about_ca_topic_score_codex":0.0000042058955,"about_ca_topic_score_gemma":0.000002042769,"teacher_disagreement_score":0.11143758,"about_ca_system_score_codex":0.00000701232,"about_ca_system_score_gemma":0.00001674937,"threshold_uncertainty_score":0.35933268},"labels":[],"label_agreement":null},{"id":"W2140423070","doi":"10.1002/jgt.20575","title":"The chromatic Ramsey number of odd wheels","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Monochromatic color; Friendship graph; Graph; Windmill graph; Critical graph; Ramsey's theorem; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.0401793681449592,"score_gpt":0.29804219593713077,"score_spread":0.25786282779217157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140423070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616263,0.00089305645,0.0019934822,0.000044238546,0.0010298274,0.00014022127,0.0000040053055,0.000017927478,0.03425093],"genre_scores_gemma":[0.9935913,0.0002191511,0.005592877,0.00007050008,0.00013518395,0.0000018461022,9.618275e-8,0.000029335135,0.00035968257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978887,0.00048233962,0.00089289516,0.00008959391,0.0004040692,0.00024241663],"domain_scores_gemma":[0.9964891,0.0015780211,0.0011043119,0.0004752506,0.00025880805,0.00009448593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034715622,0.00017401719,0.0004220196,0.00012710728,0.00025396977,0.000019002737,0.0007148056,0.00010329627,0.00049391197],"category_scores_gemma":[0.0007451104,0.00009229571,0.00047698012,0.00020550872,0.0005169226,0.00014841794,0.000088736815,0.0003565001,0.0000049891764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027229765,0.00009468562,0.0011288237,0.00006612505,0.0003626582,0.000016010288,0.0043690326,2.4436923e-7,0.0002389381,0.9891183,0.0013824961,0.00295042],"study_design_scores_gemma":[0.00042840024,0.00012324553,0.0022462162,0.00012136008,0.00015796382,0.00030313537,0.0009871831,0.0000016131479,0.0025230513,0.9925692,0.00042825166,0.00011039302],"about_ca_topic_score_codex":0.0000017313776,"about_ca_topic_score_gemma":0.0000013638482,"teacher_disagreement_score":0.033891246,"about_ca_system_score_codex":0.000014674671,"about_ca_system_score_gemma":0.000043162152,"threshold_uncertainty_score":0.54079896},"labels":[],"label_agreement":null},{"id":"W2151490491","doi":"10.1002/jgt.21912","title":"Crossing Numbers of Periodic Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Crossing number (knot theory); Graph; Limit (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.022121964918611042,"score_gpt":0.2670039297928634,"score_spread":0.24488196487425237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151490491","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.49763495,0.0008766628,0.49966195,0.00014354206,0.00069827086,0.000023002836,4.870722e-7,0.000008650371,0.0009524852],"genre_scores_gemma":[0.973288,0.000010871533,0.026453292,0.00010846081,0.00007060539,2.5828336e-7,3.034337e-7,0.000003035391,0.00006518037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.00013756994,0.00032628627,0.000075760996,0.00034576707,0.000092355076],"domain_scores_gemma":[0.99890476,0.00010404078,0.0003498372,0.00013028545,0.0004037958,0.000107270615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015288057,0.00006279983,0.00014171274,0.00032290537,0.000080350714,0.00010590862,0.00035167998,0.000028847835,0.000007222424],"category_scores_gemma":[0.00012115757,0.000051766146,0.00013696394,0.00053842756,0.00011142238,0.00047542382,0.000040685503,0.0001016694,0.0000025479367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015921067,0.00018233364,0.0022515445,0.000021599793,0.00011067764,0.000042767064,0.0069803973,0.011488149,0.005187961,0.90427816,0.0026550663,0.066642135],"study_design_scores_gemma":[0.0008433466,0.00034425984,0.004388667,0.000052337757,0.000020154179,0.0003475485,0.00034276958,0.0014407053,0.0056137987,0.9839298,0.0025478126,0.00012877316],"about_ca_topic_score_codex":0.0000017962482,"about_ca_topic_score_gemma":4.9202924e-7,"teacher_disagreement_score":0.47565305,"about_ca_system_score_codex":0.000016354486,"about_ca_system_score_gemma":0.00024792165,"threshold_uncertainty_score":0.21109623},"labels":[],"label_agreement":null},{"id":"W2151914851","doi":"10.1002/jgt.20496","title":"Geodesics and almost geodesic cycles in random regular graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geodesic; Mathematics; Combinatorics; Random graph; Discrete mathematics; Graph; Geometry","score_opus":0.014040755417775877,"score_gpt":0.27120220803344014,"score_spread":0.25716145261566425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151914851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954383,0.0008465564,0.0020209816,0.00029756187,0.00040073725,0.00009637567,0.0000018182529,0.000011992346,0.00088572147],"genre_scores_gemma":[0.995299,0.00025458698,0.0041091642,0.00010465469,0.00008836772,0.0000016986122,3.0154035e-7,0.000019269537,0.00012298381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986276,0.00022059093,0.00055893266,0.0001245873,0.000218321,0.00024997935],"domain_scores_gemma":[0.9976835,0.0014863567,0.0004036815,0.00021061159,0.000095591546,0.00012023691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030781678,0.00015038498,0.00045244698,0.00080467836,0.00006948798,0.000024301276,0.00023589787,0.00015422769,0.000108128035],"category_scores_gemma":[0.001160169,0.000113077556,0.00017256668,0.00046264278,0.00033610137,0.00013787513,0.000039896906,0.00063213764,0.0000021187736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032539977,0.0002019525,0.010226636,0.000041609095,0.000103104176,0.000112930975,0.00057082943,0.0000022851111,0.0025126028,0.97641104,0.0006020167,0.008889567],"study_design_scores_gemma":[0.002261091,0.00009612795,0.011035792,0.000035739024,0.00006514517,0.0004655788,0.00043917363,0.0000050358826,0.0006404766,0.98449117,0.00034262676,0.00012201937],"about_ca_topic_score_codex":0.000005165157,"about_ca_topic_score_gemma":0.000019269486,"teacher_disagreement_score":0.008767548,"about_ca_system_score_codex":0.000007636108,"about_ca_system_score_gemma":0.000050686318,"threshold_uncertainty_score":0.46111688},"labels":[],"label_agreement":null},{"id":"W2154102540","doi":"10.1002/jgt.21644","title":"Star Chromatic Index","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Combinatorics; Mathematical proof; Chromatic scale; Upper and lower bounds; Star (game theory); Edge coloring; Graph; Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.018121822264892704,"score_gpt":0.28821578885559107,"score_spread":0.27009396659069834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154102540","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.29601184,0.0030493557,0.69782865,0.00022929543,0.0007933139,0.000096222,8.1555316e-7,0.000043232812,0.0019472656],"genre_scores_gemma":[0.9821605,0.0000668524,0.017238053,0.00019060791,0.00019765686,0.0000018217266,9.222437e-8,0.000013195407,0.00013123393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791026,0.0004919344,0.00041296275,0.00010658074,0.00060544274,0.0004728127],"domain_scores_gemma":[0.9981806,0.000503568,0.0003463479,0.00047286716,0.0001882395,0.00030834205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040241545,0.00013097853,0.0002459344,0.00057810656,0.00011192367,0.000060502985,0.0013192173,0.00005504514,0.00007613389],"category_scores_gemma":[0.0002445222,0.00009850667,0.00021076565,0.000709442,0.0001656865,0.0016836673,0.00018030292,0.0004169354,0.00004306855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008619467,0.00018719457,0.004579586,0.000022449785,0.00010160607,0.000037333466,0.0012697042,0.00003363028,0.0025281135,0.9717501,0.00044833837,0.018955762],"study_design_scores_gemma":[0.00047680308,0.00020267196,0.012191824,0.000049943872,0.00001158908,0.0003945649,0.00019943363,0.00015674159,0.0020115913,0.98250747,0.0016387978,0.00015854272],"about_ca_topic_score_codex":4.237373e-7,"about_ca_topic_score_gemma":1.9391182e-7,"teacher_disagreement_score":0.68614864,"about_ca_system_score_codex":0.00004414939,"about_ca_system_score_gemma":0.00006896524,"threshold_uncertainty_score":0.40169856},"labels":[],"label_agreement":null},{"id":"W2161956647","doi":"10.1002/jgt.20117","title":"Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Bounded function; Graph; Undirected graph; Discrete mathematics; Function (biology)","score_opus":0.015383154562191668,"score_gpt":0.2502909535043486,"score_spread":0.23490779894215694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161956647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971233,0.00064564735,0.00018440651,0.0006087111,0.00013964063,0.00028202636,0.000014879906,0.000015863725,0.0009855153],"genre_scores_gemma":[0.9987825,0.00010994871,0.0009171207,0.000031434607,0.00003728812,0.0000039956076,6.078269e-7,0.000014492547,0.00010260762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830383,0.00046860028,0.0007040468,0.00009667626,0.0003024705,0.00012436433],"domain_scores_gemma":[0.9968274,0.0010396264,0.0012861466,0.00043532197,0.0003676186,0.00004389139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015397307,0.00012860534,0.00034551238,0.00021683132,0.00015123449,0.0000060984544,0.00033518375,0.000064411994,0.000047764774],"category_scores_gemma":[0.0006464043,0.00007082647,0.0002606902,0.0009557799,0.00060991145,0.00011450957,0.000044773707,0.00022598416,5.312407e-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.00031615922,0.00051280303,0.0012815243,0.00023367452,0.0005299219,3.1287797e-7,0.0025569643,0.000019044506,0.06746142,0.92393124,0.0016153719,0.0015415533],"study_design_scores_gemma":[0.00059819274,0.00013737488,0.017589094,0.0002918839,0.0005977481,0.00004282602,0.0014515785,0.000015005276,0.033112083,0.94578475,0.00029295497,0.0000865379],"about_ca_topic_score_codex":0.000005030285,"about_ca_topic_score_gemma":0.000009055237,"teacher_disagreement_score":0.03434934,"about_ca_system_score_codex":0.000012091082,"about_ca_system_score_gemma":0.00005863986,"threshold_uncertainty_score":0.28882197},"labels":[],"label_agreement":null},{"id":"W2166241301","doi":"10.1002/jgt.21910","title":"The Same Upper Bound for Both: The 2‐page and the Rectilinear Crossing Numbers of the <i>n</i>‐Cube","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Cube (algebra); Combinatorics; Mathematics; Upper and lower bounds; Crossing number (knot theory); Discrete mathematics; Mathematical analysis; Cartography","score_opus":0.017772153538751296,"score_gpt":0.2642326023264179,"score_spread":0.24646044878766657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166241301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6674773,0.0077427803,0.29851842,0.020934455,0.0036177984,0.0005587766,0.0000051552784,0.000014941154,0.0011303853],"genre_scores_gemma":[0.9954226,0.0000865227,0.0025109574,0.0011424331,0.00032294064,0.0000048163715,1.6757505e-7,0.0000069693583,0.0005026128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856204,0.00050998805,0.00034166814,0.00009320061,0.00035859982,0.00013450584],"domain_scores_gemma":[0.99681884,0.002094291,0.00042893476,0.00029989216,0.00031136387,0.000046672732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061581796,0.00008541081,0.00013458895,0.000045817942,0.00089245307,0.00043815392,0.00077369495,0.00003087458,0.0000011501713],"category_scores_gemma":[0.0006149529,0.000031481235,0.00020493285,0.00035159214,0.000685152,0.00025131044,0.00011549384,0.00020116272,3.9898194e-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.00084105664,0.00005911652,0.00042244457,0.000013632942,0.00019990192,0.000001559093,0.011822265,0.0027559544,0.0010842198,0.9292227,0.009746195,0.04383097],"study_design_scores_gemma":[0.0016767592,0.00013541707,0.0019778549,0.000041760042,0.000059069356,0.00022634541,0.0012809266,0.009430339,0.0021011021,0.9530383,0.029936705,0.0000954713],"about_ca_topic_score_codex":0.000006598677,"about_ca_topic_score_gemma":0.000010215041,"teacher_disagreement_score":0.32794526,"about_ca_system_score_codex":0.00001707999,"about_ca_system_score_gemma":0.00021499798,"threshold_uncertainty_score":0.68641174},"labels":[],"label_agreement":null},{"id":"W2187209261","doi":"10.1002/jgt.22206","title":"Complete graph immersions and minimum degree","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"European Research Council","keywords":"Combinatorics; Mathematics; Graph; Disjoint sets; Immersion (mathematics); Simple graph; Degree (music); Discrete mathematics; Physics; Geometry","score_opus":0.08929580787713443,"score_gpt":0.3280443678562582,"score_spread":0.23874855997912375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187209261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95083714,0.012731448,0.008859094,0.0007392202,0.0072395946,0.0006326253,0.00032224713,0.00006491893,0.018573718],"genre_scores_gemma":[0.98685515,0.002408028,0.009331856,0.00019851256,0.0006910845,0.0000058069504,0.000006050849,0.00009234435,0.00041117673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969137,0.00059677026,0.0011032122,0.00037562344,0.0005938288,0.00041690876],"domain_scores_gemma":[0.9938319,0.0015164082,0.0026581928,0.0012756798,0.00040421693,0.0003136176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032396212,0.00054600334,0.0012457741,0.00083309255,0.00081921363,0.00017794452,0.001503772,0.00053610175,0.00012293266],"category_scores_gemma":[0.0008246969,0.00040013887,0.0010912094,0.00008814956,0.0010360808,0.0001635592,0.0012558962,0.0019600473,0.0000017299501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005855669,0.00014470275,0.0009403745,0.00059608766,0.0017054984,0.00023046989,0.0026610573,0.000004906194,0.0004953422,0.9746209,0.008666843,0.00934825],"study_design_scores_gemma":[0.00078122603,0.00015228953,0.0020322462,0.0007524364,0.0006971448,0.00045604268,0.00048906315,0.000007447099,0.000070251066,0.99261147,0.0015219552,0.00042840623],"about_ca_topic_score_codex":0.00000485868,"about_ca_topic_score_gemma":0.000004729853,"teacher_disagreement_score":0.036018007,"about_ca_system_score_codex":0.00003235744,"about_ca_system_score_gemma":0.00012140144,"threshold_uncertainty_score":0.999845},"labels":[],"label_agreement":null},{"id":"W2202143156","doi":"10.1002/jgt.22146","title":"On the structure of (pan, even hole)‐free graphs","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","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":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; European Science Foundation","keywords":"Combinatorics; Clique number; Mathematics; Vertex (graph theory); Brooks' theorem; Graph; Split graph; Perfect graph; Clique graph; Discrete mathematics; Chordal graph; 1-planar graph; Pathwidth; Line graph; Graph power","score_opus":0.016997553811456862,"score_gpt":0.24560040152122248,"score_spread":0.2286028477097656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202143156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96058434,0.0068410644,0.017339112,0.0055577704,0.006458797,0.0004968902,0.000111138506,0.00007859005,0.0025323234],"genre_scores_gemma":[0.9953618,0.00028441203,0.0038057857,0.00039839654,0.000042138025,0.000001182955,0.0000012642301,0.00002111715,0.000083923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695754,0.0005831991,0.0008654243,0.00036024154,0.0009452893,0.00028828072],"domain_scores_gemma":[0.9927015,0.0006800231,0.002863683,0.002987198,0.000633755,0.00013388167],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0027808987,0.00035514505,0.0006695004,0.00068435306,0.0002847351,0.00023241824,0.0064053647,0.00031755326,0.000024900693],"category_scores_gemma":[0.00071294256,0.00020407717,0.0008336591,0.00023293395,0.00042853894,0.00018508841,0.0012902977,0.0017256049,0.0000027090662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080009675,0.000079917314,0.00008883985,0.000055066877,0.00030379512,0.000029208104,0.00047574914,0.0008785318,0.002564376,0.9849774,0.007185213,0.003281845],"study_design_scores_gemma":[0.00042606634,0.00023381533,0.00065001426,0.0007159648,0.000079005215,0.00005722634,0.000039887065,0.000090207104,0.003939904,0.99343216,0.00012519244,0.00021052781],"about_ca_topic_score_codex":0.000015230146,"about_ca_topic_score_gemma":0.0000048389647,"teacher_disagreement_score":0.034777466,"about_ca_system_score_codex":0.000018431918,"about_ca_system_score_gemma":0.00025095287,"threshold_uncertainty_score":0.99897045},"labels":[],"label_agreement":null},{"id":"W2240982577","doi":"10.1002/jgt.22063","title":"On Lower Bounds for the Matching Number of Subcubic Graphs","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Matching (statistics); Graph; Upper and lower bounds; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.03198053856046755,"score_gpt":0.3363031753190469,"score_spread":0.30432263675857935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240982577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89502335,0.00070618873,0.094129816,0.0010996475,0.0022718478,0.0009809344,0.0002089869,0.000041408457,0.005537852],"genre_scores_gemma":[0.9962581,0.00021039869,0.0024717955,0.00015490997,0.0002535973,0.00006742618,0.0000019614256,0.0000706978,0.000511104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977202,0.00032518446,0.0010436946,0.00022244379,0.00041869417,0.0002698134],"domain_scores_gemma":[0.9891795,0.00741062,0.0020173222,0.0008916869,0.00041189248,0.00008900338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043776734,0.00033013377,0.00067772344,0.00030019533,0.00024147805,0.000052400774,0.0010621989,0.00027007997,0.00021663643],"category_scores_gemma":[0.00047126433,0.00018128387,0.0014956011,0.00017696603,0.0003791891,0.00007695483,0.00015427372,0.0008276923,0.000007491096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005933905,0.00028022716,0.000045975332,0.0002111344,0.00067312125,0.000002863738,0.0005776905,0.000016402177,0.00043727577,0.99306554,0.003209459,0.00088690926],"study_design_scores_gemma":[0.0005528851,0.0000996977,0.00011510529,0.0008150109,0.0004875776,0.00005262934,0.00026150575,0.0000019103927,0.0006125081,0.99604124,0.0007556816,0.00020422951],"about_ca_topic_score_codex":0.0000011135322,"about_ca_topic_score_gemma":0.0000011066638,"teacher_disagreement_score":0.101234786,"about_ca_system_score_codex":0.000030450246,"about_ca_system_score_gemma":0.000106091924,"threshold_uncertainty_score":0.73925424},"labels":[],"label_agreement":null},{"id":"W2248416884","doi":"10.1002/jgt.22133","title":"On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Corollary; Combinatorics; Klein bottle; Graph; Odd graph; Girth (graph theory); Torus; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.025654141477502362,"score_gpt":0.31703868666031704,"score_spread":0.29138454518281465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248416884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9278846,0.00037078638,0.0654106,0.0021409013,0.0007559369,0.00016213498,0.00000952527,0.000012136842,0.0032534192],"genre_scores_gemma":[0.9973065,0.00006287679,0.002357189,0.00012531118,0.00004648834,0.000001421362,7.364333e-8,0.000010616692,0.00008949649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973747,0.0007011274,0.00058184605,0.00020657614,0.0008180385,0.00031766878],"domain_scores_gemma":[0.99330693,0.0033828164,0.0008871331,0.0014818012,0.0007866158,0.00015470297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00435123,0.00016410847,0.00044099664,0.00042233217,0.0003796616,0.00007324666,0.0033856272,0.00007979013,0.00003294341],"category_scores_gemma":[0.0035427392,0.000102277,0.0004772105,0.00028903477,0.0020287335,0.0005481229,0.0004062202,0.0005883419,0.0000048788156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003592607,0.00020896528,0.00067525735,0.000028710498,0.00008128035,0.000048185357,0.00059405534,0.000014226462,0.0040879203,0.990495,0.00032359938,0.0030835217],"study_design_scores_gemma":[0.00040601188,0.0006552364,0.008228742,0.00013375531,0.0000207088,0.000061804254,0.0002091455,0.00008914155,0.022486042,0.96758366,0.000026846092,0.00009890671],"about_ca_topic_score_codex":0.0000029812393,"about_ca_topic_score_gemma":0.000001798624,"teacher_disagreement_score":0.06942197,"about_ca_system_score_codex":0.000015141027,"about_ca_system_score_gemma":0.000107336185,"threshold_uncertainty_score":0.74749535},"labels":[],"label_agreement":null},{"id":"W2249548238","doi":"10.1002/jgt.22258","title":"On the structure of (banner, odd hole)‐free graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Perfect graph; Chordal graph; Induced subgraph; Split graph; Perfect graph theorem; Vertex (graph theory); Discrete mathematics; Wheel graph; Graph; Graph power; 1-planar graph; Line graph; Pathwidth","score_opus":0.02039802155274871,"score_gpt":0.286452243771761,"score_spread":0.26605422221901226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249548238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7467739,0.0046950225,0.23539193,0.0023706444,0.0051927348,0.000984367,0.00022747635,0.00011073864,0.0042531723],"genre_scores_gemma":[0.99135286,0.00036969868,0.007363501,0.00044654368,0.00029614978,0.0000034304005,0.0000019207705,0.000049696788,0.00011619171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944593,0.0016843263,0.0010873175,0.00054355065,0.0016707067,0.0005548556],"domain_scores_gemma":[0.9910031,0.0021657886,0.0020765993,0.0033398585,0.0011814318,0.00023321676],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004377982,0.00050423143,0.00084382034,0.0014368935,0.00023777646,0.00017638884,0.00995927,0.00038648566,0.00015159149],"category_scores_gemma":[0.0013669694,0.00030359035,0.0010437204,0.0010521301,0.0013211765,0.000337972,0.0025094682,0.0028969762,0.000007238132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003874053,0.00010761059,0.000053024123,0.00007327412,0.00038625533,0.00004960358,0.000554456,0.0006339315,0.0024890383,0.98775554,0.0047234395,0.00278645],"study_design_scores_gemma":[0.00048069004,0.000613389,0.00041307218,0.00046934793,0.00004772494,0.00008487233,0.00010359799,0.00012301146,0.012030692,0.9851104,0.0002388179,0.0002843783],"about_ca_topic_score_codex":0.0000030577928,"about_ca_topic_score_gemma":0.0000036651402,"teacher_disagreement_score":0.24457894,"about_ca_system_score_codex":0.000059890197,"about_ca_system_score_gemma":0.00033937546,"threshold_uncertainty_score":0.99994165},"labels":[],"label_agreement":null},{"id":"W2276038413","doi":"10.1002/jgt.22153","title":"Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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","keywords":"Combinatorics; Mathematics; Graph; Planar graph; List coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.040183817741576616,"score_gpt":0.31325601871403363,"score_spread":0.273072200972457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276038413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7697242,0.009668988,0.18602444,0.0021302074,0.0076766266,0.0013979595,0.00013507396,0.00019363852,0.02304886],"genre_scores_gemma":[0.9814399,0.0017584172,0.01570907,0.00008865397,0.00019167403,0.000017990778,0.00000230558,0.0000701698,0.0007218323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937185,0.0013417263,0.0015873724,0.0007292604,0.0019410918,0.00068204274],"domain_scores_gemma":[0.98910487,0.0014280856,0.0043273675,0.0037786758,0.000994512,0.0003664866],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0088143945,0.0005953008,0.0015266617,0.0022530307,0.00033506606,0.00039654996,0.011649251,0.00044116864,0.000056052784],"category_scores_gemma":[0.0016377275,0.00049681234,0.001658166,0.00047036321,0.000908571,0.0008746787,0.003127226,0.0023760905,0.0000088721445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016444575,0.00038712384,0.0002847999,0.00023542701,0.00068758364,0.00038462633,0.00060051586,0.00092081464,0.004184939,0.9811894,0.0006919652,0.008788308],"study_design_scores_gemma":[0.0015431693,0.0008545879,0.0016585562,0.0009211375,0.00008453581,0.000087405526,0.000084519525,0.000073582174,0.010222693,0.9833481,0.0006877355,0.00043402982],"about_ca_topic_score_codex":0.00001421226,"about_ca_topic_score_gemma":0.0000058477576,"teacher_disagreement_score":0.21171568,"about_ca_system_score_codex":0.00009706532,"about_ca_system_score_gemma":0.000495119,"threshold_uncertainty_score":0.9999255},"labels":[],"label_agreement":null},{"id":"W2285763632","doi":"10.1002/jgt.22177","title":"Quasi‐graphic matroids*","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Graphic matroid; Combinatorics; Generalization; Mathematics; Frame (networking); Discrete mathematics; Computer science","score_opus":0.0230699067112449,"score_gpt":0.31376997600799306,"score_spread":0.29070006929674813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285763632","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.13732632,0.0019994967,0.84679294,0.0019705177,0.0016138225,0.00015955683,0.0000027723636,0.00007301842,0.0100615425],"genre_scores_gemma":[0.9829531,0.00026762686,0.01603716,0.00015275241,0.00017935234,0.0000023855068,9.964784e-8,0.000018168203,0.00038939205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782926,0.0003861367,0.0004673762,0.00023112433,0.00066575775,0.00042036807],"domain_scores_gemma":[0.99655277,0.00036748644,0.00088049466,0.0015730737,0.00036961053,0.00025659637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038859248,0.00017501318,0.0003364405,0.00068059855,0.0006794327,0.00043726136,0.0046802433,0.00007707245,0.000036000714],"category_scores_gemma":[0.00059755857,0.00013630885,0.00042248773,0.0002878136,0.0005287078,0.0018625291,0.0004186715,0.00058051234,0.000034028868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012306334,0.00014038055,0.0015378603,0.00001078865,0.000083706065,0.00018983285,0.00022219328,0.000010920535,0.0020342802,0.9669249,0.00035342935,0.028368663],"study_design_scores_gemma":[0.00061510404,0.00047411292,0.0056580184,0.000057020516,0.000012446281,0.00034342453,0.00008890693,0.00007981905,0.0019328187,0.9890027,0.0015710723,0.00016455518],"about_ca_topic_score_codex":0.000001509004,"about_ca_topic_score_gemma":0.0000017849901,"teacher_disagreement_score":0.8456268,"about_ca_system_score_codex":0.00002485137,"about_ca_system_score_gemma":0.00009929083,"threshold_uncertainty_score":0.8697134},"labels":[],"label_agreement":null},{"id":"W2310825823","doi":"10.1002/jgt.22569","title":"Topologically 4‐chromatic graphs and signatures of odd cycles","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Signature (topology); Abelian group; Mathematics; Graph; Combinatorics; Discrete mathematics; Geometry","score_opus":0.01986311258326498,"score_gpt":0.25781602621498373,"score_spread":0.23795291363171875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310825823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5514604,0.031126946,0.40920213,0.0053638793,0.0010462635,0.00024372396,0.000071912225,0.0001011001,0.0013836868],"genre_scores_gemma":[0.9751435,0.0014507673,0.022941254,0.00038421302,0.00005335135,0.0000013391635,0.0000024748447,0.0000054699676,0.000017657143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769306,0.0004339182,0.00084257696,0.00033588093,0.0005009722,0.00019356403],"domain_scores_gemma":[0.99707514,0.0007813314,0.0012816531,0.00045894776,0.00020453893,0.000198406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013531656,0.00024190373,0.0008931535,0.00083936134,0.00006336862,0.00011299625,0.0020050604,0.00026494588,0.000067826964],"category_scores_gemma":[0.00073759904,0.00015125138,0.0005962745,0.00092815905,0.00038409056,0.00018156777,0.0013496638,0.000854103,0.000001672446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090528236,0.00022580882,0.0009901742,0.00024199189,0.0008219202,0.00024769508,0.0004600076,0.00028333304,0.000989894,0.9594457,0.0009725045,0.035230424],"study_design_scores_gemma":[0.0001822117,0.00035233755,0.014656864,0.00008667668,0.00017553406,0.000046324854,0.00008411031,0.00017506367,0.00026096345,0.98371685,0.00009379253,0.00016926276],"about_ca_topic_score_codex":0.000007946277,"about_ca_topic_score_gemma":0.0000010253883,"teacher_disagreement_score":0.4236831,"about_ca_system_score_codex":0.000010069732,"about_ca_system_score_gemma":0.0000644409,"threshold_uncertainty_score":0.6167852},"labels":[],"label_agreement":null},{"id":"W2409344144","doi":"10.1002/jgt.22362","title":"Optimal‐size clique transversals in chordal graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Clique-sum; Split graph; Vertex (graph theory); Clique graph; Interval graph; Clique; Discrete mathematics; Graph; Block graph; Pathwidth; 1-planar graph; Line graph; Graph power","score_opus":0.020456285358371813,"score_gpt":0.3103444728800291,"score_spread":0.2898881875216573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409344144","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.37465486,0.0033097698,0.6155984,0.0008794052,0.0026924678,0.00063588965,0.000022989865,0.00010381238,0.0021024442],"genre_scores_gemma":[0.87301445,0.0020936206,0.123802684,0.0003679357,0.00040962212,0.00003217577,0.0000019379647,0.000087123095,0.00019043166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936317,0.002055369,0.0015232372,0.0007592214,0.0011781526,0.000852282],"domain_scores_gemma":[0.9944262,0.0017367707,0.0012004798,0.001493009,0.0007404588,0.0004030897],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009799943,0.00056775863,0.001131068,0.002225156,0.0001299681,0.0002581141,0.005441834,0.00054610695,0.00011873558],"category_scores_gemma":[0.00075052254,0.00049649255,0.0011040063,0.0013870653,0.0007658848,0.0008538714,0.0011059339,0.0033299932,0.000017906832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024491157,0.0008524712,0.0019574182,0.0003598118,0.0008431285,0.0016984013,0.005949555,0.007591267,0.0028258779,0.9565698,0.001409549,0.017493634],"study_design_scores_gemma":[0.0011247017,0.00054382795,0.0018164383,0.000553987,0.000034008193,0.00024212956,0.0001318747,0.00030683886,0.002202352,0.99206436,0.00048211418,0.0004973842],"about_ca_topic_score_codex":0.0000069260514,"about_ca_topic_score_gemma":0.000009306451,"teacher_disagreement_score":0.4983596,"about_ca_system_score_codex":0.00016241317,"about_ca_system_score_gemma":0.00060804235,"threshold_uncertainty_score":0.9999392},"labels":[],"label_agreement":null},{"id":"W2423480771","doi":"10.1002/jgt.22053","title":"Minimum Power Dominating Sets of Random Cubic Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Cubic graph; Combinatorics; Heuristics; Random graph; Independent set; Dominating set; Discrete mathematics; Graph; Line graph; Mathematical optimization; Voltage graph; Vertex (graph theory)","score_opus":0.012297420658721215,"score_gpt":0.28186232163078867,"score_spread":0.2695649009720675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2423480771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5022993,0.0013762155,0.49305218,0.0005388224,0.0006580493,0.00016587558,0.0000051190177,0.000031604533,0.0018728423],"genre_scores_gemma":[0.98777074,0.00015907286,0.011763793,0.00007425336,0.00003098945,0.0000028099491,7.075271e-8,0.000018552526,0.00017974712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969112,0.0008229943,0.0008235409,0.00024175755,0.00077209546,0.0004283992],"domain_scores_gemma":[0.9951504,0.0025628104,0.0008770788,0.0006163234,0.0005852861,0.00020811066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005257805,0.0001948234,0.00049949513,0.0010219994,0.00010930329,0.000039055263,0.0017206533,0.000082403945,0.00008341706],"category_scores_gemma":[0.0009035298,0.000116338655,0.00051793864,0.00087579945,0.00047026316,0.000985483,0.00022922731,0.00029050815,0.000010614259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012878333,0.00018076456,0.0010596742,0.000027454937,0.00021296149,0.00012406155,0.0010273916,0.000012005365,0.12946458,0.78917205,0.00038028212,0.077050954],"study_design_scores_gemma":[0.0037160509,0.00047869937,0.000908332,0.00024967128,0.000016984402,0.0002145595,0.00014519293,0.000021989674,0.03232275,0.9615219,0.00023286437,0.0001710019],"about_ca_topic_score_codex":4.2657672e-7,"about_ca_topic_score_gemma":3.653564e-7,"teacher_disagreement_score":0.48547143,"about_ca_system_score_codex":0.000031011514,"about_ca_system_score_gemma":0.00010480929,"threshold_uncertainty_score":0.47441527},"labels":[],"label_agreement":null},{"id":"W2466652589","doi":"10.1002/jgt.22511","title":"A variant of the Erdős‐Sós conjecture","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Research Council; Agence Nationale de la Recherche","keywords":"Conjecture; Degree (music); Graph; Tree (set theory); Collatz conjecture; Lonely runner conjecture","score_opus":0.010660904886134916,"score_gpt":0.2508092513133372,"score_spread":0.24014834642720229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466652589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873172,0.0006465527,0.00088425906,0.00018802936,0.001854331,0.00019699911,0.000009964951,0.000009998558,0.008892635],"genre_scores_gemma":[0.99784064,0.000035235615,0.0011819334,0.0002340292,0.00014418025,6.0768866e-7,1.0510413e-7,0.00002344148,0.0005398143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982424,0.00042850827,0.0006126216,0.000103548555,0.00042424852,0.00018869733],"domain_scores_gemma":[0.9973278,0.0009565399,0.0009325326,0.000540582,0.00018079745,0.000061755665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019164394,0.00016280275,0.0004433923,0.00016828146,0.000104331215,0.000014435062,0.0007006448,0.00012919813,0.00043773316],"category_scores_gemma":[0.0004281109,0.00008189696,0.00059162814,0.00026130912,0.00022254832,0.00009212339,0.00012246342,0.0004872372,0.0000022707677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021081943,0.000059230533,0.0014692835,0.00008272803,0.0002627867,0.000012824539,0.0016625316,0.000015191962,0.0017506934,0.99278265,0.0010876477,0.0006036146],"study_design_scores_gemma":[0.0006859191,0.00016246088,0.0024127702,0.00015629042,0.00013678978,0.00041669898,0.00042377203,0.0000036787949,0.002558311,0.9917917,0.001146975,0.00010458797],"about_ca_topic_score_codex":9.231763e-7,"about_ca_topic_score_gemma":8.622593e-7,"teacher_disagreement_score":0.010523423,"about_ca_system_score_codex":0.000016774951,"about_ca_system_score_gemma":0.00006977837,"threshold_uncertainty_score":0.47928712},"labels":[],"label_agreement":null},{"id":"W2507346374","doi":"10.1002/jgt.22416","title":"Bounded diameter arboricity","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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","keywords":"Arboricity; Mathematics; Combinatorics; Bounded function; Dense graph; Planar graph; Degeneracy (biology); 1-planar graph; Graph; Discrete mathematics; Biology; Chordal graph; Mathematical analysis","score_opus":0.027473957245941583,"score_gpt":0.3093677013235276,"score_spread":0.281893744077586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507346374","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.06859636,0.0015571077,0.92259467,0.0003675116,0.003581422,0.00023496513,0.000008833311,0.000080953905,0.0029782047],"genre_scores_gemma":[0.79420114,0.0008244918,0.20189036,0.00072049897,0.0016472649,0.000019350093,0.0000021839803,0.00009165024,0.00060306635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99549043,0.001274208,0.00094668556,0.0005467007,0.00114999,0.000591957],"domain_scores_gemma":[0.9946943,0.0008844928,0.0013632277,0.0016676937,0.0010434869,0.00034680055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006155578,0.00040923976,0.0007706175,0.0013284131,0.00018630637,0.0003875341,0.004914147,0.00033813535,0.00008536838],"category_scores_gemma":[0.00067258097,0.0003270161,0.00088185363,0.00071993546,0.00067610055,0.0006513901,0.00221951,0.0021860772,0.000041526015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046454353,0.0003775989,0.0005357553,0.00015558065,0.0007855365,0.00040258685,0.0016187734,0.0001674878,0.0009570315,0.96582425,0.0032204762,0.025490366],"study_design_scores_gemma":[0.00037648034,0.0003351024,0.00073496153,0.00020528442,0.000039389375,0.00014429222,0.000030858784,0.00018588148,0.002164511,0.9940306,0.001419383,0.0003332338],"about_ca_topic_score_codex":0.000002124601,"about_ca_topic_score_gemma":0.0000013175269,"teacher_disagreement_score":0.7256048,"about_ca_system_score_codex":0.00014353929,"about_ca_system_score_gemma":0.0004512113,"threshold_uncertainty_score":0.99991816},"labels":[],"label_agreement":null},{"id":"W2513477623","doi":"10.1002/jgt.22233","title":"Orientations of graphs with uncountable chromatic number","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","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":"Austrian Science Fund; Pacific Institute for the Mathematical Sciences","keywords":"Uncountable set; Combinatorics; Mathematics; Countable set; Discrete mathematics; Conjecture; Digraph; Graph; Chromatic scale","score_opus":0.0312692883517813,"score_gpt":0.3294263890046287,"score_spread":0.2981571006528474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513477623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9706929,0.0008066751,0.0060118916,0.00005425162,0.0022838411,0.00039747043,0.00008603638,0.00002970521,0.01963728],"genre_scores_gemma":[0.98018754,0.0003239609,0.018672958,0.000039730414,0.00022730006,0.000010181531,0.0000047549784,0.00007508097,0.00045849432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970476,0.00038109595,0.0012032663,0.00024676084,0.0008241304,0.00029712103],"domain_scores_gemma":[0.99261516,0.00094165065,0.004230245,0.0012421857,0.0008252616,0.00014548408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024453306,0.00042275494,0.0011850711,0.0004875341,0.0003796822,0.00009164385,0.0012290315,0.00032338288,0.00034658978],"category_scores_gemma":[0.0005671202,0.00027841685,0.00073808036,0.00018057825,0.00077681715,0.00023768863,0.00034622065,0.0011169234,0.0000019289955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004362531,0.00021653096,0.0037895974,0.0010540508,0.0016661636,0.00006279186,0.0034155995,0.000073226955,0.00007153926,0.98649615,0.0022544803,0.0004636141],"study_design_scores_gemma":[0.00082453445,0.0001747021,0.001301554,0.0015046337,0.00096550735,0.0003261246,0.00070903695,0.0000037871932,0.00052841794,0.99315864,0.00019770327,0.00030535835],"about_ca_topic_score_codex":0.000012599223,"about_ca_topic_score_gemma":0.0000120191135,"teacher_disagreement_score":0.019178785,"about_ca_system_score_codex":0.00004998686,"about_ca_system_score_gemma":0.00030925625,"threshold_uncertainty_score":0.9999668},"labels":[],"label_agreement":null},{"id":"W2526410593","doi":"10.1002/jgt.20448","title":"Coloring plane graphs with independent crossings","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Plane (geometry); Graph; Discrete mathematics; Geometry","score_opus":0.013184250265308796,"score_gpt":0.271164064961363,"score_spread":0.25797981469605424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526410593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6022644,0.00095458044,0.3922083,0.00058568356,0.00031509085,0.00015042882,0.0000013557409,0.00007833996,0.0034418406],"genre_scores_gemma":[0.98212487,0.000065340806,0.017208148,0.00034513892,0.000060833318,0.0000013834692,2.0914193e-7,0.000011777657,0.00018231239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977866,0.00024754737,0.00042996262,0.00024319856,0.0008421805,0.00045051132],"domain_scores_gemma":[0.99823934,0.00029766595,0.00043689183,0.00045619486,0.00031726446,0.00025264575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002317952,0.0001909171,0.0003166142,0.00076088536,0.00025302,0.00025048392,0.0014649453,0.00006963539,0.000016385373],"category_scores_gemma":[0.000084347834,0.00013498348,0.00017575103,0.0009819337,0.00025241356,0.0011522803,0.00008370263,0.0006481104,0.0000062539825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009063311,0.00017826747,0.001449347,0.000008887542,0.00009290435,0.0006947861,0.0010059016,0.00028614645,0.0066252444,0.9537409,0.00016296278,0.03484834],"study_design_scores_gemma":[0.0011636997,0.0016261925,0.010483277,0.000105988205,0.000014987511,0.00129774,0.00015253681,0.00003771741,0.0058325725,0.97837245,0.0006943244,0.00021851613],"about_ca_topic_score_codex":8.802532e-7,"about_ca_topic_score_gemma":0.0000013216827,"teacher_disagreement_score":0.37986046,"about_ca_system_score_codex":0.000046546378,"about_ca_system_score_gemma":0.00013042866,"threshold_uncertainty_score":0.5504466},"labels":[],"label_agreement":null},{"id":"W2527693017","doi":"10.1002/jgt.20057","title":"Disjoint clique cutsets in graphs without long holes","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Dayton","keywords":"Combinatorics; Mathematics; Complete bipartite graph; Cograph; Split graph; Discrete mathematics; Clique graph; Disjoint sets; Block graph; Vertex (graph theory); Separable space; Clique problem; Clique-sum; Bipartite graph; Chordal graph; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.015483659464262872,"score_gpt":0.3015029554822439,"score_spread":0.286019296017981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527693017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.536603,0.0021704189,0.45801523,0.0013342524,0.00031160272,0.0001861494,0.000001796814,0.000052728883,0.0013248711],"genre_scores_gemma":[0.979821,0.0003794563,0.019209323,0.000337681,0.00010611476,0.00000520706,2.893995e-7,0.000021652604,0.00011924168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701095,0.00075241004,0.00075536984,0.00029557603,0.00064385467,0.0005418374],"domain_scores_gemma":[0.99801797,0.0004493612,0.00043633132,0.00060339435,0.00023176112,0.00026117344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043319496,0.00022254568,0.00041865715,0.0013925778,0.00010732986,0.00011258617,0.0016896465,0.00009667062,0.000027130842],"category_scores_gemma":[0.00025074006,0.00017669146,0.00032690604,0.0011460305,0.0003952069,0.0014772628,0.00023278207,0.0008447733,0.000020585456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002703665,0.00027978088,0.023273177,0.000017873583,0.000061776256,0.000260795,0.0011085115,0.00079921016,0.0017072059,0.90121186,0.00012593564,0.070883505],"study_design_scores_gemma":[0.001005749,0.00025774274,0.02231032,0.00016290804,0.0000085081365,0.00044130546,0.0001275731,0.000323832,0.003961987,0.9706259,0.00052859145,0.00024557838],"about_ca_topic_score_codex":0.0000016798735,"about_ca_topic_score_gemma":0.000027723858,"teacher_disagreement_score":0.44321808,"about_ca_system_score_codex":0.00008182391,"about_ca_system_score_gemma":0.00011987781,"threshold_uncertainty_score":0.7205269},"labels":[],"label_agreement":null},{"id":"W2527966071","doi":"10.1002/jgt.10044","title":"On splittable colorings of graphs and hypergraphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","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 Science Foundation; Hungarian Scientific Research Fund; Fields Institute for Research in Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Greedy coloring; Graph coloring; Generalization; Ramsey theory; Discrete mathematics; List coloring; Graph; Edge coloring; Line graph; Graph power","score_opus":0.02728294482362184,"score_gpt":0.25678364156245603,"score_spread":0.2295006967388342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527966071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97830105,0.0018801524,0.00011303151,0.000066418805,0.0003027454,0.000098871606,0.0000064159312,0.000017833938,0.019213462],"genre_scores_gemma":[0.99695057,0.0007093092,0.0017799131,0.00014139168,0.000031140127,0.0000014850374,1.0743347e-7,0.000026943128,0.00035913882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838704,0.00020096981,0.00065349194,0.00014315725,0.00038148076,0.00023384238],"domain_scores_gemma":[0.99742854,0.0013211424,0.00065435155,0.0003015604,0.0001644902,0.00012992883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013831502,0.00020006328,0.00051410816,0.00059170515,0.000161666,0.000018451738,0.00030220274,0.00011670553,0.00027392217],"category_scores_gemma":[0.00046011794,0.00014132436,0.00034194262,0.00034329802,0.00039015253,0.00015057062,0.000057449553,0.00036083866,0.0000010734319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002536283,0.0001528731,0.0008990516,0.00008014842,0.00020361286,0.00002097867,0.0008331962,0.0000030276803,0.0007569254,0.99362516,0.0015064913,0.0016648974],"study_design_scores_gemma":[0.0007995719,0.0006038188,0.0008486735,0.00014019577,0.00012477228,0.00017485423,0.0002905706,0.000004759125,0.0017701447,0.9945706,0.00052637764,0.00014567799],"about_ca_topic_score_codex":0.0000010080149,"about_ca_topic_score_gemma":4.6059438e-7,"teacher_disagreement_score":0.018854324,"about_ca_system_score_codex":0.000010900821,"about_ca_system_score_gemma":0.000007986271,"threshold_uncertainty_score":0.576304},"labels":[],"label_agreement":null},{"id":"W2528053456","doi":"10.1002/jgt.10006","title":"Even‐hole‐free graphs part I: Decomposition theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Joins; Mathematics; Combinatorics; Star (game theory); Decomposition theorem; Robertson–Seymour theorem; Discrete mathematics; Graph; Decomposition; 1-planar graph; Chordal graph; Computer science; Chemistry","score_opus":0.018466310932835055,"score_gpt":0.29944446350443865,"score_spread":0.2809781525716036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528053456","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.17901663,0.0023512323,0.8037664,0.0016750006,0.0011616307,0.00024383616,0.000007074742,0.0001398031,0.011638359],"genre_scores_gemma":[0.9811466,0.0009006363,0.016831212,0.00050358917,0.00026119244,0.0000076909855,0.0000014657043,0.00003428507,0.00031338443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965494,0.00094107114,0.0007204508,0.00032117256,0.0008942619,0.0005736211],"domain_scores_gemma":[0.9967396,0.000768889,0.00055876793,0.0011219821,0.0004790126,0.0003317426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041916384,0.00025516484,0.00039183756,0.0010110716,0.00028439233,0.00016039726,0.0029711325,0.00010916659,0.00011189696],"category_scores_gemma":[0.0003072766,0.00020469743,0.00050614605,0.0014679213,0.00035544336,0.001419766,0.00032823574,0.0006579448,0.000034559947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003724126,0.00017741242,0.00069353456,0.000007881063,0.00010534765,0.00031743819,0.00024851217,0.00017260699,0.002876887,0.9671648,0.0012969413,0.026566194],"study_design_scores_gemma":[0.0009727423,0.0004459059,0.0010953078,0.000091690505,0.000022258608,0.001022217,0.00016146693,0.00013301046,0.0023698185,0.9891744,0.004278603,0.00023252986],"about_ca_topic_score_codex":8.9211073e-7,"about_ca_topic_score_gemma":0.0000022141612,"teacher_disagreement_score":0.8021299,"about_ca_system_score_codex":0.00005839813,"about_ca_system_score_gemma":0.00009630707,"threshold_uncertainty_score":0.8347319},"labels":[],"label_agreement":null},{"id":"W2528371477","doi":"10.1002/jgt.10036","title":"Extremal problems for chromatic neighborhood sets","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Multiplicity (mathematics); Graph; Critical graph; Upper and lower bounds; Discrete mathematics; Friendship graph; Sequence (biology); Graph theory; Line graph; Graph power; Geometry","score_opus":0.059156885046753524,"score_gpt":0.2906379110013115,"score_spread":0.23148102595455794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528371477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8596638,0.008911577,0.0991288,0.0007893121,0.0034067968,0.0014800851,0.00005171626,0.00015873525,0.026409192],"genre_scores_gemma":[0.98849225,0.00012541091,0.0103417095,0.00018586894,0.00032585912,0.0000107361875,5.2226824e-7,0.00005174719,0.00046591763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812716,0.00022073628,0.00080861244,0.000148684,0.0003589452,0.00033584272],"domain_scores_gemma":[0.99721104,0.0013240854,0.0007627964,0.00034158444,0.00021774412,0.00014272545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017310092,0.00023229091,0.00050290715,0.00032185297,0.0002560416,0.000042933247,0.00045945274,0.00013273049,0.0005405376],"category_scores_gemma":[0.0007025525,0.00015984595,0.0005696494,0.00020879772,0.0001611699,0.0002248095,0.000049331295,0.00030056862,0.000003863565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108753244,0.00021315466,0.00018348776,0.0002742967,0.00032300118,0.000019186275,0.002731589,0.000009077924,0.0004608483,0.98067206,0.006499668,0.00850489],"study_design_scores_gemma":[0.0011952085,0.00040789388,0.00016437717,0.00018179772,0.00019958307,0.00036966376,0.00026522455,0.0002796933,0.00026262508,0.9955063,0.0009679605,0.00019969126],"about_ca_topic_score_codex":1.473488e-7,"about_ca_topic_score_gemma":4.2493068e-7,"teacher_disagreement_score":0.12882844,"about_ca_system_score_codex":0.000027989512,"about_ca_system_score_gemma":0.000016337655,"threshold_uncertainty_score":0.6518328},"labels":[],"label_agreement":null},{"id":"W2528549426","doi":"10.1002/jgt.10032","title":"A Ramsey‐type problem and the Turán numbers*","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal College of Physicians and Surgeons of Canada; University of Toronto; Mount Royal University; University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Ramsey's theorem; Omega; Graph; Constant (computer programming); Type (biology); Asymptotically optimal algorithm; Discrete mathematics; Physics; Algorithm","score_opus":0.023970450040739267,"score_gpt":0.25824839360078417,"score_spread":0.2342779435600449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528549426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9028156,0.013906374,0.0013743007,0.0020913132,0.0015303069,0.00053942495,0.000004790099,0.00006104912,0.077676855],"genre_scores_gemma":[0.99366856,0.0009097892,0.0036396957,0.00046374323,0.00025676537,0.000002034625,8.834222e-8,0.000026603811,0.0010327195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983592,0.00050111,0.0005121379,0.00011023194,0.00030778054,0.00020955407],"domain_scores_gemma":[0.9974791,0.0014997594,0.00046929668,0.0002876892,0.00017076038,0.000093394825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027013295,0.00016859084,0.00038266307,0.00014396847,0.0002844605,0.00005374645,0.00036038592,0.000094283016,0.00035300953],"category_scores_gemma":[0.0005898055,0.00008509702,0.00026295273,0.00023220389,0.0006190526,0.00014075768,0.00008207694,0.00047522763,0.0000034744396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043923056,0.00004719657,0.000161027,0.000036904825,0.00021875423,0.000021611822,0.004683301,0.0000014089998,0.000041064297,0.9846625,0.005683714,0.0040032878],"study_design_scores_gemma":[0.0016558319,0.00011904103,0.00008981614,0.00006451033,0.00015757233,0.00068462867,0.00056530687,0.00001601908,0.000054663084,0.99327826,0.0032001676,0.00011414898],"about_ca_topic_score_codex":0.0000011158961,"about_ca_topic_score_gemma":0.0000010894227,"teacher_disagreement_score":0.090852976,"about_ca_system_score_codex":0.000011445899,"about_ca_system_score_gemma":0.000009869171,"threshold_uncertainty_score":0.38652068},"labels":[],"label_agreement":null},{"id":"W2550851713","doi":"10.1002/jgt.22414","title":"Generating near‐bipartite bricks","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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","keywords":"Bipartite graph; Combinatorics; Brick; Vertex (graph theory); Mathematics; Complete bipartite graph; Matching (statistics); Graph; Discrete mathematics; Composite material; Materials science","score_opus":0.02844527706474328,"score_gpt":0.31266091903551524,"score_spread":0.284215641970772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550851713","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.12721822,0.0036597764,0.8640412,0.000337574,0.0028934781,0.00021550883,0.0000065900063,0.00008424327,0.0015434168],"genre_scores_gemma":[0.55361474,0.0007117568,0.4411762,0.0009682718,0.0025362917,0.000021372562,0.0000036077586,0.00011610828,0.00085163646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558884,0.001182114,0.0010402522,0.0005321719,0.001042648,0.00061396457],"domain_scores_gemma":[0.99518454,0.0005829617,0.001421381,0.0014020636,0.0010640483,0.00034501642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0063487184,0.00038564,0.0006766978,0.0007480879,0.00035056158,0.0006884507,0.003948884,0.00029258634,0.00008139278],"category_scores_gemma":[0.00061635993,0.00032386027,0.0007099792,0.0006612644,0.0005985339,0.0006476096,0.0022198125,0.0020112297,0.00004635699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007713554,0.0006098633,0.0018110387,0.00041933008,0.0017190399,0.0013619054,0.007374672,0.030635038,0.009712154,0.74980104,0.013507412,0.18227713],"study_design_scores_gemma":[0.0003865044,0.00030960146,0.00022781118,0.00034377194,0.00003560033,0.00030041332,0.00004547485,0.0073719546,0.0019122069,0.9863565,0.0023235735,0.0003865814],"about_ca_topic_score_codex":0.000002360513,"about_ca_topic_score_gemma":0.0000014503856,"teacher_disagreement_score":0.42639652,"about_ca_system_score_codex":0.000091908114,"about_ca_system_score_gemma":0.00057170057,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W2557594551","doi":"10.1002/jgt.22102","title":"Characterizing Graphs with Crossing Number at Least 2","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Crossing number (knot theory); Mathematics; Vertex (graph theory); Disjoint sets; Graph; Discrete mathematics","score_opus":0.01596033645025523,"score_gpt":0.27684189557277383,"score_spread":0.2608815591225186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557594551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615863,0.00020464315,0.33549088,0.00065595185,0.00030973332,0.00007960074,0.0000027546387,0.000051421117,0.0016187191],"genre_scores_gemma":[0.98786575,0.000055951838,0.011002782,0.00028852184,0.00009487114,0.0000028261995,1.1185823e-7,0.000027804797,0.00066137366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977232,0.00037491616,0.0004464041,0.0002779839,0.000666779,0.0005107182],"domain_scores_gemma":[0.9977278,0.00055596646,0.00054256874,0.0005576468,0.0003545981,0.0002614295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020384225,0.0002068143,0.00031670483,0.00040974558,0.00042755916,0.00022521855,0.0012263275,0.00006255686,0.00011966357],"category_scores_gemma":[0.00011828439,0.0001126338,0.00023730838,0.00069875136,0.0007097629,0.0017407364,0.0002562914,0.0002886617,0.00006112993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012292772,0.00012354826,0.024814581,0.000021833912,0.00019873881,0.0004581326,0.0011659131,0.000005765563,0.14342275,0.74744314,0.00017426405,0.08094206],"study_design_scores_gemma":[0.002055324,0.0004532451,0.014946431,0.0005296161,0.000022782515,0.00321168,0.00010693994,0.000010175096,0.03203693,0.9409084,0.005291547,0.00042695517],"about_ca_topic_score_codex":4.889959e-7,"about_ca_topic_score_gemma":0.0000014940323,"teacher_disagreement_score":0.32627946,"about_ca_system_score_codex":0.00008552665,"about_ca_system_score_gemma":0.00011774853,"threshold_uncertainty_score":0.4593073},"labels":[],"label_agreement":null},{"id":"W2561327776","doi":"10.1002/jgt.22447","title":"List coloring with requests","year":2019,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"List coloring; Graph coloring; Combinatorics; Fractional coloring; Computer science; Graph; Context (archaeology); Complete coloring; Edge coloring; Information retrieval; Mathematics; Theoretical computer science; Graph power; Geography; Line graph","score_opus":0.012991545565198168,"score_gpt":0.23166689249630712,"score_spread":0.21867534693110896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561327776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.673893,0.009938674,0.29558733,0.0016724522,0.009082891,0.0004927461,0.000006533625,0.00023954596,0.009086868],"genre_scores_gemma":[0.96690416,0.00028501626,0.03202192,0.00035649101,0.00005899801,0.0000032051569,8.621487e-7,0.000025550476,0.00034379706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978713,0.00028889033,0.0006209773,0.000344016,0.0005993911,0.00027546086],"domain_scores_gemma":[0.9969371,0.00024016033,0.0012084555,0.00088269735,0.00056332257,0.00016829376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002630833,0.00026848234,0.00053428824,0.0006147247,0.000088570116,0.00026103505,0.0016061807,0.00019748343,0.0000103300235],"category_scores_gemma":[0.00007431926,0.000185997,0.00030480517,0.00033056963,0.00012272573,0.0003062075,0.00058017846,0.0012001521,0.000012360194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025096716,0.00018584359,0.0023546985,0.00022578599,0.00047072727,0.00037050847,0.0010943421,0.008419404,0.0010243998,0.9788413,0.0023062797,0.004455722],"study_design_scores_gemma":[0.0006336073,0.000511499,0.0006538826,0.0013589858,0.00007637872,0.00040557657,0.000040842326,0.000383883,0.00081375905,0.99395496,0.00081936363,0.00034723635],"about_ca_topic_score_codex":0.000008881538,"about_ca_topic_score_gemma":0.0000020691493,"teacher_disagreement_score":0.29301122,"about_ca_system_score_codex":0.000041536958,"about_ca_system_score_gemma":0.0003555541,"threshold_uncertainty_score":0.7584738},"labels":[],"label_agreement":null},{"id":"W2574604220","doi":"10.1002/jgt.22169","title":"Grünbaum colorings of even triangulations on surfaces","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Exploratory Research for Advanced Technology; Japan Science and Technology Agency; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Klein bottle; Mathematics; Combinatorics; Triangulation; Torus; Surface (topology); Point set triangulation; Projective plane; Boundary (topology); Plane (geometry); Geometry; Delaunay triangulation; Mathematical analysis","score_opus":0.03733898809966781,"score_gpt":0.33191517968683176,"score_spread":0.29457619158716397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574604220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9073575,0.00046503684,0.07742057,0.0014789677,0.00083751854,0.0002020394,0.0000071011905,0.000027735181,0.012203548],"genre_scores_gemma":[0.99388754,0.000060628732,0.0054724705,0.000036794754,0.000046991736,0.0000015956765,1.11491524e-7,0.000009359016,0.00048448192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983752,0.00028880726,0.00043042895,0.00014995063,0.00053149404,0.00022415986],"domain_scores_gemma":[0.997057,0.00064814277,0.0009777631,0.0008591322,0.0003352881,0.00012265643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029059695,0.00011272343,0.0002963333,0.00044349683,0.00035343133,0.000110825196,0.0022014033,0.00005414125,0.000023937451],"category_scores_gemma":[0.0008214203,0.00008786899,0.0002491282,0.00022689816,0.0003458191,0.0009083285,0.0001941156,0.00030431277,0.000007461894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003115255,0.00010352834,0.0018329369,0.000010270815,0.00008026105,0.000029956356,0.0002974279,0.0003686979,0.004282323,0.98467374,0.00013896999,0.007870366],"study_design_scores_gemma":[0.0008331085,0.00055442686,0.03885788,0.00009053264,0.000012850781,0.000033172833,0.00007764114,0.00011836599,0.009361752,0.94908476,0.00086798624,0.00010754587],"about_ca_topic_score_codex":0.0000025813856,"about_ca_topic_score_gemma":0.0000018772005,"teacher_disagreement_score":0.08653008,"about_ca_system_score_codex":0.000024594385,"about_ca_system_score_gemma":0.00008894722,"threshold_uncertainty_score":0.40907913},"labels":[],"label_agreement":null},{"id":"W2591779083","doi":"10.1002/jgt.21733","title":"The Inducibility of Graphs on Four Vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multipartite; Discrete mathematics; Graph","score_opus":0.03695414308635255,"score_gpt":0.28918859946700176,"score_spread":0.25223445638064923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591779083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99326646,0.0005201106,0.00015442647,0.00025475325,0.0007486463,0.00017430847,0.000002508303,0.000011248869,0.0048675206],"genre_scores_gemma":[0.9988002,0.00014823022,0.0006881992,0.00013937154,0.000091426984,0.0000035876546,7.415048e-8,0.00001831969,0.00011055427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977788,0.0005871104,0.00079334626,0.00012751296,0.00047952717,0.00023370156],"domain_scores_gemma":[0.99448425,0.0035551938,0.00086427917,0.00061416853,0.00038196455,0.000100150064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037255962,0.0001682222,0.00036101826,0.00020960848,0.0002984197,0.000039320283,0.000668961,0.0001019371,0.00014064409],"category_scores_gemma":[0.0017485387,0.00008461224,0.000460554,0.00024290233,0.00049098796,0.00018545697,0.00007202878,0.0004559679,0.0000032041894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002784306,0.00010152261,0.0013050613,0.000038056307,0.00023947562,0.0000038346566,0.0008485988,0.0000027333338,0.0008179429,0.9852557,0.0016917035,0.009416942],"study_design_scores_gemma":[0.00036392696,0.00033149126,0.011703598,0.00007362196,0.00007393814,0.00003470844,0.00073842896,0.0000029763585,0.002876566,0.9834331,0.00027292976,0.00009468408],"about_ca_topic_score_codex":0.0000037305526,"about_ca_topic_score_gemma":0.000002351593,"teacher_disagreement_score":0.010398537,"about_ca_system_score_codex":0.000015870239,"about_ca_system_score_gemma":0.00003427065,"threshold_uncertainty_score":0.3450387},"labels":[],"label_agreement":null},{"id":"W2597508670","doi":"10.1002/jgt.21884","title":"SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Planar straight-line graph; Book embedding; Vertex (graph theory); Outerplanar graph; Embedding; Polyhedral graph; Discrete mathematics; Neighbourhood (mathematics); Graph; 1-planar graph; Pathwidth; Chordal graph; Line graph; Computer science","score_opus":0.03866764437602641,"score_gpt":0.30251051878559765,"score_spread":0.2638428744095712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597508670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7321912,0.0011195863,0.26348874,0.00035366658,0.001093876,0.00028593722,0.000007465773,0.00009166738,0.0013678356],"genre_scores_gemma":[0.98901075,0.00007661675,0.010360969,0.00035904426,0.00007868245,0.0000073408587,0.0000023665477,0.00003271257,0.00007152344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552065,0.0011028417,0.00097347895,0.00042210572,0.0011190047,0.00086190697],"domain_scores_gemma":[0.9971161,0.00045042802,0.0006559228,0.0007840739,0.000421508,0.00057199044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007818529,0.00034235598,0.00066759455,0.0027085887,0.0001319106,0.00013777081,0.0021949077,0.00018005124,0.0000176493],"category_scores_gemma":[0.00033113974,0.00028593588,0.00029651335,0.0022812223,0.00017326648,0.0013568386,0.00034965292,0.001205269,0.000027250882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011913707,0.0007058314,0.07072448,0.000062080035,0.00031079102,0.0016743684,0.007460403,0.0001508893,0.012395598,0.8843672,0.0006684192,0.020288534],"study_design_scores_gemma":[0.002867149,0.0005748772,0.0065383473,0.00015938979,0.000012501054,0.00086681056,0.0008373865,0.0002986446,0.0014556032,0.98530173,0.0007060726,0.00038146373],"about_ca_topic_score_codex":0.0000099692215,"about_ca_topic_score_gemma":0.000024291543,"teacher_disagreement_score":0.25681952,"about_ca_system_score_codex":0.00009117633,"about_ca_system_score_gemma":0.00020866402,"threshold_uncertainty_score":0.9999593},"labels":[],"label_agreement":null},{"id":"W2598883699","doi":"10.1002/jgt.22111","title":"Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Split graph; Clique-sum; Interval graph; Indifference graph; Discrete mathematics; Bounded function; Independence number; Induced subgraph; Pathwidth; Vertex (graph theory); Graph; 1-planar graph; Line graph","score_opus":0.025118459155473852,"score_gpt":0.3149270744807101,"score_spread":0.2898086153252363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598883699","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.43026042,0.003427238,0.5446255,0.004755511,0.002988619,0.0004401307,0.000012134168,0.00006722962,0.013423209],"genre_scores_gemma":[0.98752016,0.00036942167,0.011640068,0.00017327456,0.00013511207,0.000003347716,1.0926267e-7,0.000019503881,0.00013899842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970994,0.00068864395,0.00066936854,0.00022961156,0.0008732007,0.00043977215],"domain_scores_gemma":[0.994491,0.000998126,0.0014899134,0.002377115,0.00046767824,0.00017618817],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0079775695,0.00019409707,0.00040336477,0.00049589074,0.0009079562,0.000335592,0.00800689,0.0000795913,0.000019451309],"category_scores_gemma":[0.0015376224,0.00012162509,0.00052354485,0.00040586072,0.0011792454,0.0014138583,0.00086397555,0.000757319,0.0000039859506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019086406,0.000069244124,0.0024235512,0.000016475748,0.000121062956,0.00005485776,0.0006002462,0.000020367801,0.0044185724,0.9727404,0.00049682386,0.018847505],"study_design_scores_gemma":[0.00070209114,0.00029052974,0.0070009953,0.00009272435,0.000021345046,0.00018974148,0.0001241337,0.000045314948,0.0077983327,0.9825237,0.0010768619,0.00013424687],"about_ca_topic_score_codex":0.000004959654,"about_ca_topic_score_gemma":0.000005751346,"teacher_disagreement_score":0.55725974,"about_ca_system_score_codex":0.000028446595,"about_ca_system_score_gemma":0.00015188236,"threshold_uncertainty_score":0.9973603},"labels":[],"label_agreement":null},{"id":"W2599540576","doi":"10.1002/jgt.20344","title":"Average distance and maximum induced forest","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Graph; Conjecture; Bipartite graph; Bound graph; Path graph; Order (exchange); Discrete mathematics; Graph power; Line graph","score_opus":0.02272741783119209,"score_gpt":0.2674605634724172,"score_spread":0.2447331456412251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599540576","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.43044308,0.00093577895,0.56728655,0.00018772724,0.0002020321,0.00006205796,9.1083655e-7,0.000021297044,0.00086055085],"genre_scores_gemma":[0.9914749,0.00039838985,0.007748186,0.00014754414,0.00006726362,0.0000017413668,1.2001229e-7,0.00001211602,0.0001497237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984312,0.0002710689,0.0003494114,0.00019346022,0.00045176843,0.00030305964],"domain_scores_gemma":[0.99853843,0.00039214434,0.00026891098,0.00039291996,0.00019702855,0.00021057928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013132254,0.0001388788,0.00024836388,0.0003863272,0.00023310004,0.00005237486,0.0009084939,0.000056049754,0.0000105336085],"category_scores_gemma":[0.00018268469,0.000109366745,0.00013457355,0.00053665746,0.00028927348,0.0008805166,0.00017409303,0.0004407441,0.00000540858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024360404,0.00009713078,0.0075988057,0.000017627966,0.00006371917,0.0007824332,0.0011849053,0.00014752519,0.0027981845,0.9676069,0.00019166793,0.019267503],"study_design_scores_gemma":[0.0006221809,0.00029037643,0.011808251,0.000037403603,0.000003773907,0.0013687852,0.000048937854,0.00018733292,0.0011940192,0.98350865,0.00078511686,0.00014516996],"about_ca_topic_score_codex":7.737887e-7,"about_ca_topic_score_gemma":0.0000018503489,"teacher_disagreement_score":0.5610318,"about_ca_system_score_codex":0.000025469813,"about_ca_system_score_gemma":0.00007313589,"threshold_uncertainty_score":0.44598466},"labels":[],"label_agreement":null},{"id":"W2604224124","doi":"10.1002/jgt.10070","title":"Fold‐2‐covering triangular embeddings","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Université du Maine","keywords":"Combinatorics; Mathematics; Conjecture; Euler characteristic; Vertex (graph theory); Surface (topology); Triangulation; Graph; Discrete mathematics; Geometry","score_opus":0.014731016123299518,"score_gpt":0.27928599252315794,"score_spread":0.2645549763998584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604224124","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.075068675,0.0027278375,0.9146374,0.00013805395,0.0007576884,0.00010684249,7.5289154e-7,0.000045993107,0.00651675],"genre_scores_gemma":[0.9480193,0.00021028868,0.050884906,0.00024371833,0.00009476413,0.0000029014811,9.054349e-8,0.000025560614,0.00051843503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997689,0.000606038,0.00048699183,0.00021030688,0.00059496454,0.00041271557],"domain_scores_gemma":[0.99809796,0.0005390973,0.0003767231,0.0005087395,0.00025437714,0.00022313566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004692681,0.00016092537,0.00031255174,0.000689205,0.000149983,0.00012503866,0.001260867,0.00006673312,0.000073250405],"category_scores_gemma":[0.0008253303,0.00013252861,0.00035315688,0.0009781994,0.0001297193,0.0010720668,0.000104656596,0.00044610817,0.000019460987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000745418,0.000055760553,0.00014792227,0.000008977216,0.000072536146,0.00014730648,0.00038342355,0.00014943884,0.005715999,0.9808998,0.00014689787,0.012197362],"study_design_scores_gemma":[0.00083961955,0.00023260895,0.00014844125,0.000043841414,0.000011908359,0.000473652,0.00016544477,0.000059162485,0.012860424,0.9763217,0.008678413,0.00016479465],"about_ca_topic_score_codex":2.9358094e-7,"about_ca_topic_score_gemma":1.6998973e-7,"teacher_disagreement_score":0.8729507,"about_ca_system_score_codex":0.000050227984,"about_ca_system_score_gemma":0.00010805399,"threshold_uncertainty_score":0.54043597},"labels":[],"label_agreement":null},{"id":"W2611912062","doi":"10.1002/jgt.22579","title":"Generating simple near‐bipartite bricks","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Apoio ao Desenvolvimento do Ensino, Ciência e Tecnologia do Estado de Mato Grosso do Sul; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Bipartite graph; Combinatorics; Brick; Mathematics; Matching (statistics); Vertex (graph theory); Complete bipartite graph; Simple (philosophy); Class (philosophy); Discrete mathematics; Graph; Computer science","score_opus":0.048188870101523194,"score_gpt":0.3168964226717651,"score_spread":0.2687075525702419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611912062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492852,0.0038440172,0.03799512,0.000480846,0.0038705359,0.00040743043,0.00007012597,0.00011570735,0.0039310018],"genre_scores_gemma":[0.95779735,0.00025968466,0.038761217,0.0009302613,0.0019831446,0.000006378095,0.0000069125213,0.00012132593,0.00013374943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963583,0.00077426195,0.001447909,0.0003505591,0.0006730852,0.00039590785],"domain_scores_gemma":[0.9955205,0.001046555,0.0020778442,0.0006833304,0.00038060496,0.00029119608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026968727,0.0004808393,0.0010996698,0.00027733843,0.00040851923,0.00022700494,0.0010593634,0.00042926418,0.00029838525],"category_scores_gemma":[0.0016256148,0.0003709991,0.0011837536,0.0002285723,0.00030064685,0.00012829383,0.0009261116,0.0022382601,0.000004522022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005372421,0.00015206895,0.00065799215,0.0008052621,0.0017705285,0.00039444125,0.008666281,0.0016559983,0.0014949644,0.94994515,0.0242456,0.009674456],"study_design_scores_gemma":[0.00043839015,0.00013937784,0.00013422221,0.00025835756,0.00038568163,0.00015898849,0.00028907004,0.00038333455,0.0005046381,0.994162,0.0027617323,0.00038420424],"about_ca_topic_score_codex":0.000002996695,"about_ca_topic_score_gemma":0.0000018761114,"teacher_disagreement_score":0.044216834,"about_ca_system_score_codex":0.000053032076,"about_ca_system_score_gemma":0.0002271813,"threshold_uncertainty_score":0.9998742},"labels":[],"label_agreement":null},{"id":"W2616177501","doi":"10.1002/1097-0118(200008)34:4<277::aid-jgt4>3.0.co;2-#","title":"A characterization of (γ, <i>i</i> )‐trees","year":2000,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Characterization (materials science); Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.016701907636086952,"score_gpt":0.2648895667963944,"score_spread":0.24818765916030747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616177501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99340045,0.00005694202,0.0023793806,0.00010600211,0.000050472485,0.000073256575,0.000010633138,0.000012104251,0.0039107576],"genre_scores_gemma":[0.99807394,0.00012397129,0.0010826321,0.00007904026,0.00006893618,0.0000025511956,0.0000014589608,0.00001261805,0.0005548516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990686,0.00014904878,0.00047419616,0.000057783058,0.0001583036,0.00009202882],"domain_scores_gemma":[0.9989604,0.00025987418,0.00043018124,0.00018426056,0.000116094314,0.000049209746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215868,0.00008072395,0.00021967948,0.00014854241,0.00005173844,0.000008622516,0.00020164033,0.00004646728,0.0006909342],"category_scores_gemma":[0.000061631414,0.00006300919,0.00019855562,0.00025513474,0.000103215294,0.00014006319,0.000007054264,0.000119808974,0.000007860607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001624194,0.00021518428,0.00015974205,0.000021198259,0.0000663385,0.000002351264,0.00047328373,0.0000018535231,0.12959187,0.86076266,0.00015881208,0.008384289],"study_design_scores_gemma":[0.00026875694,0.000081373306,0.0017492789,0.000064386484,0.00007023607,0.000046647965,0.000085567364,0.0000015931371,0.024503723,0.97085,0.002215719,0.00006270245],"about_ca_topic_score_codex":1.9646659e-7,"about_ca_topic_score_gemma":5.470721e-7,"teacher_disagreement_score":0.11008736,"about_ca_system_score_codex":0.000004971573,"about_ca_system_score_gemma":0.000018507819,"threshold_uncertainty_score":0.75652444},"labels":[],"label_agreement":null},{"id":"W2623089137","doi":"10.1002/jgt.22162","title":"Configurations containing a given linear hypergraph","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Combinatorics; Vertex (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.013624443440958138,"score_gpt":0.2366006672075691,"score_spread":0.22297622376661094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623089137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9373715,0.0021734876,0.013272989,0.00018779426,0.0026766316,0.0001458378,0.000015693613,0.000106692554,0.04404938],"genre_scores_gemma":[0.9992072,0.00011473998,0.00020450614,0.000034717912,0.00029775416,0.0000031841446,7.3896774e-7,0.000025912777,0.00011127514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902254,0.00011301543,0.00042943913,0.000073765055,0.0001688226,0.00019244255],"domain_scores_gemma":[0.99891096,0.00014347352,0.0003162574,0.00037245278,0.00013578696,0.00012107642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011489379,0.00014339582,0.00029932134,0.00024577905,0.00036294828,0.00010209555,0.00047939687,0.00008444599,0.00008030021],"category_scores_gemma":[0.0001436096,0.00012053873,0.0002881624,0.00007304937,0.00016098798,0.0003882491,0.000016369926,0.00031232726,0.000017075898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005901621,0.00012187927,0.006790347,0.00016069002,0.0016438826,0.00036101782,0.0038609742,0.004669034,0.0669826,0.8967898,0.0033053926,0.014724261],"study_design_scores_gemma":[0.0052042413,0.0011254168,0.03315395,0.0011449866,0.000528912,0.0016451465,0.0064868536,0.00186747,0.019279934,0.87180114,0.056437925,0.0013240476],"about_ca_topic_score_codex":0.00000198337,"about_ca_topic_score_gemma":0.000002961583,"teacher_disagreement_score":0.061835676,"about_ca_system_score_codex":0.000013672962,"about_ca_system_score_gemma":0.00002046656,"threshold_uncertainty_score":0.49154267},"labels":[],"label_agreement":null},{"id":"W2727778573","doi":"10.1002/jgt.22434","title":"Maximizing the mean subtree order","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Goddard Space Flight Center; Compute Canada","keywords":"Combinatorics; Lemma (botany); Order (exchange); Mathematics; Tree (set theory); Simple (philosophy); Path (computing); Vertex (graph theory); Discrete mathematics; Graph; Computer science; Botany; Biology","score_opus":0.05332421525870787,"score_gpt":0.31890734668321197,"score_spread":0.26558313142450407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727778573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90180796,0.002444337,0.06539009,0.0028122417,0.002784519,0.0009325834,0.0000566677,0.00013201132,0.023639595],"genre_scores_gemma":[0.978808,0.0003657441,0.018007694,0.00044561585,0.0014053356,0.000034746277,0.0000040652635,0.00010778313,0.000821005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973956,0.0007200616,0.0009192064,0.00022979846,0.00045157294,0.00028379232],"domain_scores_gemma":[0.9949593,0.0015337137,0.0016372745,0.0010673201,0.000685991,0.000116404786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005732095,0.00032690752,0.00055705,0.00032947367,0.0003296652,0.00010871963,0.0014541791,0.0002704708,0.00034303934],"category_scores_gemma":[0.0006598197,0.00019827462,0.0007184371,0.00034719208,0.0005275525,0.000084908235,0.00039966818,0.0014461873,0.000024867823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012764912,0.00015030972,0.0000629288,0.00009391492,0.00048472977,0.000010771418,0.0018072486,0.00001681551,0.00016067382,0.987272,0.00845209,0.0013608336],"study_design_scores_gemma":[0.00025636985,0.000059421163,0.00015593896,0.00029302688,0.00044824768,0.00013445018,0.00081570033,0.00000848857,0.00048069152,0.993801,0.0033297604,0.00021691009],"about_ca_topic_score_codex":0.000001926814,"about_ca_topic_score_gemma":0.000008595173,"teacher_disagreement_score":0.07700005,"about_ca_system_score_codex":0.000033946315,"about_ca_system_score_gemma":0.00014605097,"threshold_uncertainty_score":0.80854046},"labels":[],"label_agreement":null},{"id":"W2752748329","doi":"10.1002/jgt.22185","title":"The mean order of sub‐<i>k</i>‐trees of <i>k</i>‐trees","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Tree (set theory); Order (exchange); Weight-balanced tree; Vertex (graph theory); Clique; Discrete mathematics; Graph; Binary tree; Binary search tree","score_opus":0.028572947037304997,"score_gpt":0.30471738066468446,"score_spread":0.27614443362737945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752748329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907077,0.0008461019,0.0018128724,0.0005404772,0.00024802735,0.00016318746,0.000018537203,0.000011031448,0.0056520635],"genre_scores_gemma":[0.99775213,0.0004071509,0.0014734771,0.000025975873,0.000085011205,0.0000042388456,3.0663003e-7,0.000022513905,0.000229208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821424,0.0002620824,0.0008569162,0.000102387545,0.00036923317,0.00019516204],"domain_scores_gemma":[0.9942951,0.0016916932,0.0023733163,0.0009882525,0.00057210727,0.00007951345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034426434,0.0001576966,0.00043501912,0.00014931215,0.00051761494,0.000045904133,0.0012257005,0.00007846479,0.000032853375],"category_scores_gemma":[0.0011285358,0.00009572618,0.0004268703,0.00016486498,0.0009790725,0.00020204812,0.00009597938,0.00026648017,0.0000023726452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021978677,0.00020866875,0.0016845597,0.000036853173,0.00025508943,0.000002830687,0.00062028825,0.0000049047962,0.018429304,0.97472024,0.0012073839,0.0026101177],"study_design_scores_gemma":[0.00046571455,0.00012675025,0.003951019,0.00012840329,0.00017091885,0.000029417997,0.0009077592,0.0000023146945,0.03987086,0.9531014,0.0011505202,0.00009492579],"about_ca_topic_score_codex":0.000003516673,"about_ca_topic_score_gemma":0.00007092809,"teacher_disagreement_score":0.021618815,"about_ca_system_score_codex":0.000007110988,"about_ca_system_score_gemma":0.00006231628,"threshold_uncertainty_score":0.3981128},"labels":[],"label_agreement":null},{"id":"W2754199588","doi":"10.1002/jgt.20000","title":"Some remarks on domination","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012409671328413885,"score_gpt":0.2852600797355756,"score_spread":0.27285040840716174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754199588","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.10903512,0.0011661914,0.88332105,0.002333592,0.0010295899,0.00015033854,0.0000011088913,0.000053676773,0.0029093155],"genre_scores_gemma":[0.9783883,0.0001973874,0.02047061,0.00053693785,0.0002449173,0.0000021658352,2.0761026e-7,0.000013597187,0.00014585238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983561,0.00028214976,0.00034736938,0.00016473135,0.0005983531,0.0002512634],"domain_scores_gemma":[0.9985335,0.00038062746,0.0003081026,0.00040715406,0.00023103972,0.00013961342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027028853,0.00011753625,0.0001918866,0.0007268639,0.00012260345,0.00007130029,0.0010720367,0.000058397407,0.00001067414],"category_scores_gemma":[0.0003142526,0.00009047083,0.00020638964,0.00054560025,0.0001362386,0.0010698435,0.00008599539,0.00043339145,0.00002814685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017391624,0.00010300352,0.000013073801,0.000004762479,0.000027140533,0.000093264396,0.00026386735,0.00081479776,0.002753859,0.97647333,0.000077759985,0.019201243],"study_design_scores_gemma":[0.0009222422,0.0005081182,0.00060139,0.0000734159,0.000004881595,0.00014771117,0.000048716283,0.000022725559,0.010768665,0.98651224,0.00029198168,0.00009788625],"about_ca_topic_score_codex":3.7060116e-7,"about_ca_topic_score_gemma":3.0203424e-7,"teacher_disagreement_score":0.86935323,"about_ca_system_score_codex":0.000091572125,"about_ca_system_score_gemma":0.000097394695,"threshold_uncertainty_score":0.36892933},"labels":[],"label_agreement":null},{"id":"W2761096769","doi":"10.1002/jgt.22032","title":"Planar Digraphs of Digirth Five Are 2‐Colorable","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"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.013728620320958772,"score_gpt":0.2608323699805069,"score_spread":0.24710374965954812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761096769","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.30367705,0.0020563127,0.6895017,0.0011675317,0.0006231508,0.00020802715,0.000026510414,0.000058394267,0.0026813033],"genre_scores_gemma":[0.99234563,0.00035471987,0.006483771,0.000098753924,0.0000625103,0.0000029444204,1.307437e-7,0.000016284379,0.00063525065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977076,0.00043143975,0.00058638526,0.00022607025,0.00065472827,0.00039378493],"domain_scores_gemma":[0.9965758,0.0012297841,0.0008719583,0.00061347254,0.000495114,0.00021388936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084937,0.00017295343,0.0004278424,0.0008207746,0.0001010671,0.000038924183,0.0017873396,0.0000766545,0.00003915539],"category_scores_gemma":[0.0004209962,0.000102822225,0.00035907474,0.00086062175,0.00042008542,0.0010976318,0.00014278451,0.00026315512,0.000013162251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005055674,0.00017400994,0.005826578,0.000027990578,0.00018416937,0.00014881074,0.00044619845,0.000032484302,0.012774968,0.9560548,0.0010472334,0.02277716],"study_design_scores_gemma":[0.0008942675,0.00052887533,0.0046023466,0.00024081142,0.000013256691,0.00012311417,0.0002051512,0.000009394283,0.011681445,0.9806496,0.00089861493,0.00015313034],"about_ca_topic_score_codex":0.0000011859532,"about_ca_topic_score_gemma":0.0000022587983,"teacher_disagreement_score":0.6886686,"about_ca_system_score_codex":0.000033854798,"about_ca_system_score_gemma":0.000103134065,"threshold_uncertainty_score":0.41929686},"labels":[],"label_agreement":null},{"id":"W2765788600","doi":"10.1002/jgt.22143","title":"Retraction: ‘Quasi‐Graphic Matroids’ by J. Geelen, B. Gerards and G. Whittle","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics","score_opus":0.01420890413153508,"score_gpt":0.29248860798138504,"score_spread":0.27827970384984996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765788600","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.38809177,0.012763461,0.5781102,0.0060243076,0.003247665,0.0003398765,0.000016684542,0.00012418703,0.011281812],"genre_scores_gemma":[0.9901287,0.0016756519,0.0069823894,0.00018323907,0.00022590578,0.000003385297,3.676108e-7,0.000023053744,0.0007772896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978669,0.00035595565,0.0004402634,0.00029048324,0.00066197856,0.00038436244],"domain_scores_gemma":[0.9972449,0.00033842082,0.00075739657,0.0010472294,0.0003279226,0.0002841405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034140195,0.00019460988,0.00034019013,0.00048107308,0.00076511933,0.00052191387,0.001964708,0.00014125042,0.000038358226],"category_scores_gemma":[0.00038509787,0.00016002863,0.00022807595,0.00025965885,0.0005601687,0.0021690233,0.00028687957,0.00085186225,0.000009466938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048738264,0.00030451076,0.0069711227,0.000053793527,0.00023876021,0.0002638961,0.0006266825,0.0000072283456,0.015499009,0.8554951,0.014288604,0.105763905],"study_design_scores_gemma":[0.00093080726,0.0005774521,0.011870137,0.00007719773,0.000023364157,0.0007687032,0.00012986896,0.000102770486,0.0027498351,0.97149956,0.01100752,0.00026276306],"about_ca_topic_score_codex":0.0000022495497,"about_ca_topic_score_gemma":0.0000014775486,"teacher_disagreement_score":0.60203695,"about_ca_system_score_codex":0.000027343132,"about_ca_system_score_gemma":0.00007120711,"threshold_uncertainty_score":0.6525778},"labels":[],"label_agreement":null},{"id":"W2795774886","doi":"10.1002/jgt.22457","title":"Rainbow triangles and the Caccetta‐Häggkvist conjecture","year":2019,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Combinatorics; Rainbow; Conjecture; Mathematics; Digraph; Generalization; Vertex (graph theory); Graph; Disjoint sets; Undirected graph; Discrete mathematics; Physics","score_opus":0.023339471299310167,"score_gpt":0.2911550788216821,"score_spread":0.26781560752237193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795774886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9222729,0.039778583,0.0081552835,0.0035204063,0.011273383,0.0020754957,0.00015052549,0.00009454333,0.012678851],"genre_scores_gemma":[0.9945099,0.0014408022,0.0015123873,0.00068838045,0.0010501302,0.000008422323,0.0000025372544,0.00007961384,0.0007078619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603224,0.0016294763,0.0011278907,0.0003054578,0.00058108394,0.0003238585],"domain_scores_gemma":[0.9915916,0.0049910503,0.0020891568,0.000919872,0.00027637836,0.0001319919],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0068434747,0.0005096359,0.0014211993,0.00042599728,0.00031804066,0.00018856279,0.0011599569,0.0005374565,0.00014180428],"category_scores_gemma":[0.0017022813,0.00026053758,0.0011291846,0.0001445116,0.0011658535,0.00008978158,0.0007644308,0.0023808237,0.000001523317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001735204,0.000041061223,0.00014331918,0.00039077955,0.0011718217,0.00004586124,0.004111501,0.000034020086,0.000012128069,0.98426294,0.0057768296,0.002274522],"study_design_scores_gemma":[0.0034828666,0.00009881195,0.0002997309,0.0004064061,0.00074705615,0.00048008212,0.0006973701,0.0000130546605,0.000063208296,0.9910072,0.0023933302,0.0003108507],"about_ca_topic_score_codex":0.0000037735801,"about_ca_topic_score_gemma":0.0000024295848,"teacher_disagreement_score":0.07223694,"about_ca_system_score_codex":0.00003868894,"about_ca_system_score_gemma":0.00015828326,"threshold_uncertainty_score":0.9999847},"labels":[],"label_agreement":null},{"id":"W2799803339","doi":"10.1002/jgt.21630","title":"Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research Canada; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","funders":"","keywords":"Planarity testing; Combinatorics; Mathematics; Planar graph; Planar; Outerplanar graph; Book embedding; Graph; Planar straight-line graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; 1-planar graph; Pathwidth; Line graph; Computer science","score_opus":0.037738736367019306,"score_gpt":0.27063856057275837,"score_spread":0.23289982420573907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799803339","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.43891063,0.0005499132,0.5595706,0.00014618324,0.00066548854,0.000039228362,0.000003473457,0.0000042366682,0.000110239926],"genre_scores_gemma":[0.8887986,0.000008835479,0.11098787,0.000036295252,0.0001426296,9.380003e-7,5.466287e-7,0.0000019683348,0.000022306585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946475,0.000057880716,0.00021878337,0.000052017174,0.00011223829,0.00009435836],"domain_scores_gemma":[0.99878824,0.0006116323,0.00022938053,0.000066533175,0.00023126604,0.0000729233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542916,0.00004617882,0.00010239513,0.00018753456,0.00011452876,0.000017877775,0.00012974012,0.000023441215,0.00000271456],"category_scores_gemma":[0.0003142182,0.000039097442,0.000064106505,0.00025940928,0.000039634117,0.00042493644,0.000030764477,0.00006156968,2.1714025e-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.00009783405,0.00024328493,0.01680957,0.000075485514,0.00012389051,0.0000019648633,0.0016067821,0.000776921,0.019489078,0.8717525,0.0011091807,0.087913536],"study_design_scores_gemma":[0.0018984119,0.00089884375,0.3313382,0.00018028732,0.00019388675,0.0014083027,0.0009629801,0.007850714,0.020121373,0.6310739,0.0036816497,0.00039150435],"about_ca_topic_score_codex":7.679949e-7,"about_ca_topic_score_gemma":2.8958894e-7,"teacher_disagreement_score":0.44988796,"about_ca_system_score_codex":0.000006704391,"about_ca_system_score_gemma":0.00004923046,"threshold_uncertainty_score":0.15943475},"labels":[],"label_agreement":null},{"id":"W2804339795","doi":"10.1002/jgt.20457","title":"Acyclic dominating partitions","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Partition (number theory); Bipartite graph; Mathematics; Graph; Upper and lower bounds; Vertex (graph theory); Conjecture; Mathematical analysis","score_opus":0.016758006590472153,"score_gpt":0.3044405940250349,"score_spread":0.28768258743456276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804339795","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.07289734,0.00090626173,0.91566783,0.0018942324,0.0003229872,0.00008851901,9.305709e-7,0.00005656398,0.008165346],"genre_scores_gemma":[0.9684783,0.000074905794,0.030652002,0.00045173432,0.000110042136,0.0000012495399,1.3720211e-7,0.000006137747,0.00022548361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839777,0.00035334617,0.00040004257,0.00014068937,0.00040900163,0.00029915862],"domain_scores_gemma":[0.99843895,0.00047478377,0.0003077065,0.00037783894,0.00023535799,0.00016535378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023072737,0.00010661279,0.00019979298,0.0004998071,0.00015240944,0.00009386279,0.00111819,0.000041255833,0.000029476863],"category_scores_gemma":[0.00037026824,0.00008522075,0.00022552253,0.00076188985,0.00011291495,0.00095092715,0.00006743295,0.00038790953,0.000016200178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043448046,0.0000939371,0.00008053503,0.0000024150602,0.000021859894,0.00007456845,0.0003697732,0.00013261652,0.0059247487,0.8608562,0.00026665544,0.13213326],"study_design_scores_gemma":[0.00037578907,0.00031281263,0.0021352933,0.00004059002,0.0000071690874,0.00023302561,0.00008408974,0.00012852188,0.003668905,0.99193704,0.000978951,0.00009782099],"about_ca_topic_score_codex":9.804645e-8,"about_ca_topic_score_gemma":1.7285419e-7,"teacher_disagreement_score":0.89558095,"about_ca_system_score_codex":0.000027493881,"about_ca_system_score_gemma":0.00005291889,"threshold_uncertainty_score":0.34752014},"labels":[],"label_agreement":null},{"id":"W2808050500","doi":"10.1002/jgt.22546","title":"Bounds on the localization number","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Optimization and Search Problems","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":"Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Combinatorics; Mathematics; Upper and lower bounds; Conjecture; Chromatic scale; Graph; Discrete mathematics; Constant (computer programming); Hypercube; Computer science","score_opus":0.03417009690688372,"score_gpt":0.2831885300731406,"score_spread":0.24901843316625688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808050500","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.00041750591,0.00011805814,0.9782683,0.011022958,0.0009839295,0.00013546072,0.0000018493231,0.000033519354,0.009018404],"genre_scores_gemma":[0.97084564,0.00081992056,0.016225044,0.010945475,0.0005547196,0.000006243003,0.0000046068694,0.00003672608,0.00056161097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980311,0.00064680754,0.00042418297,0.00018269743,0.0005704379,0.00014477524],"domain_scores_gemma":[0.998244,0.00029919608,0.00057777605,0.00043371797,0.000328847,0.00011646856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018371381,0.00014705937,0.0002208696,0.00014333561,0.0001399138,0.00038898445,0.0015298631,0.00011424405,0.00015273243],"category_scores_gemma":[0.0002574908,0.000089800145,0.00025375382,0.00034636277,0.00009272715,0.00016995276,0.00043857022,0.0009249229,0.000053763266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003333025,0.000053269443,0.00006727811,0.000023931152,0.000086443964,0.000020564998,0.0013059677,0.020785164,0.000010573133,0.960881,0.014183225,0.0025492676],"study_design_scores_gemma":[0.0001730278,0.00009629238,0.0000863132,0.00015350351,0.0000145058375,0.000029351018,0.00006352568,0.02955154,0.00010186288,0.96273714,0.006866904,0.000126054],"about_ca_topic_score_codex":0.0000010654473,"about_ca_topic_score_gemma":3.0048784e-7,"teacher_disagreement_score":0.97042817,"about_ca_system_score_codex":0.000036863054,"about_ca_system_score_gemma":0.00022746346,"threshold_uncertainty_score":0.40183812},"labels":[],"label_agreement":null},{"id":"W2811149033","doi":"10.1002/jgt.22873","title":"A variant of the Erdős–Rényi random graph process","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Stochastic processes and statistical mechanics","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":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Giant component; Random graph; Connected component; Graph; Discrete mathematics; Wheel graph; Graph power; Line graph","score_opus":0.01975029205473686,"score_gpt":0.2877810280227832,"score_spread":0.26803073596804633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811149033","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.08176167,0.0010231495,0.91328347,0.00049535115,0.0013473374,0.0004019373,0.00008760462,0.000019746389,0.0015797222],"genre_scores_gemma":[0.99675393,0.000020542684,0.0028587992,0.00016683398,0.00006519179,0.000013837929,2.6380266e-7,0.000022461727,0.000098152785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800605,0.00031385146,0.00067888,0.00010424499,0.0007047493,0.00019225408],"domain_scores_gemma":[0.9969313,0.0015993338,0.0008809152,0.00023846413,0.0002733002,0.000076651355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023790293,0.00013042343,0.00041719544,0.00015136966,0.00022881535,0.0000139513595,0.00063539157,0.00003737383,0.0003296629],"category_scores_gemma":[0.0021607464,0.000078873076,0.0003291617,0.0005352929,0.00010311339,0.00005849143,0.0001167673,0.0004793493,5.3677553e-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.0009736628,0.00027673473,0.000012862847,0.00016285096,0.00016895845,0.00003983455,0.0012810773,0.00008963015,0.00028854024,0.99486166,0.0007144642,0.0011296938],"study_design_scores_gemma":[0.0015341885,0.00031704383,0.000026868653,0.000084197345,0.00022993634,0.00046479807,0.0014720848,0.0001849942,0.00040994794,0.99505633,0.00012558815,0.000093995055],"about_ca_topic_score_codex":9.716854e-7,"about_ca_topic_score_gemma":7.571666e-7,"teacher_disagreement_score":0.9149922,"about_ca_system_score_codex":0.000022932776,"about_ca_system_score_gemma":0.0001665492,"threshold_uncertainty_score":0.36095774},"labels":[],"label_agreement":null},{"id":"W284364393","doi":"10.1002/jgt.22074","title":"The Game Saturation Number of a Graph","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"State Administration of Foreign Experts Affairs; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Saturation (graph theory); Graph; Mathematics; Upper and lower bounds; Physics; Mathematical analysis","score_opus":0.022195361049930844,"score_gpt":0.31489483409880936,"score_spread":0.2926994730488785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W284364393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96649927,0.0043643424,0.010561952,0.0006052803,0.005816226,0.00057524844,0.0001060813,0.000048643018,0.011422979],"genre_scores_gemma":[0.9954605,0.0016918397,0.0016841821,0.00007269792,0.0006891607,0.000008115062,0.000001889976,0.000042446936,0.00034916613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623036,0.0009596889,0.0014935815,0.00022626683,0.0007670204,0.000323098],"domain_scores_gemma":[0.99165606,0.0034991775,0.003199885,0.0008075864,0.0007183286,0.00011897609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043596854,0.0003958283,0.0008206922,0.0002497571,0.0002495927,0.00007119265,0.0011736782,0.00044817623,0.0001370751],"category_scores_gemma":[0.0010919437,0.00017636476,0.0013054905,0.00018872898,0.00058240927,0.00012844086,0.00043793386,0.0012397643,0.0000021200017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069320214,0.0000688625,0.0003573296,0.00018331525,0.0008972155,0.000015437656,0.0012756183,0.0000031507143,0.0006421167,0.9849343,0.0021154836,0.008813985],"study_design_scores_gemma":[0.00045414013,0.000074594005,0.0008295533,0.0006941287,0.00032995045,0.00020411098,0.000238593,0.0000014671558,0.001139558,0.9944184,0.001376763,0.00023873213],"about_ca_topic_score_codex":0.0000012115446,"about_ca_topic_score_gemma":0.000003192786,"teacher_disagreement_score":0.028961254,"about_ca_system_score_codex":0.000046183097,"about_ca_system_score_gemma":0.00012323061,"threshold_uncertainty_score":0.7191946},"labels":[],"label_agreement":null},{"id":"W2883247096","doi":"10.1002/jgt.22466","title":"Naji's characterization of circle graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics","score_opus":0.009212636301056067,"score_gpt":0.2538532904317289,"score_spread":0.24464065413067282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883247096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8032287,0.0001702115,0.19494136,0.00011767052,0.00054259686,0.00012036089,0.0000026404248,0.0000193893,0.00085708185],"genre_scores_gemma":[0.9969225,0.000112284266,0.0026635956,0.000092948634,0.000033458844,0.0000011981633,7.8823166e-7,0.000012870141,0.0001603476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981971,0.00034798298,0.00050719036,0.00016816804,0.00054061774,0.00023896864],"domain_scores_gemma":[0.9980645,0.00026113298,0.0006345387,0.00051599904,0.0004144614,0.00010932149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020802496,0.00010962161,0.00030339058,0.00074362336,0.00004836326,0.000038600043,0.0011970489,0.000060236656,0.000066355584],"category_scores_gemma":[0.00009101402,0.00009683651,0.00025790965,0.00096630375,0.00012981106,0.0010104453,0.000129512,0.0002802822,0.00002386814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014233384,0.00009335449,0.0027342124,0.000032699932,0.00006551875,0.000013397576,0.00040039778,0.000027275284,0.33116135,0.63829887,0.000011954461,0.027018618],"study_design_scores_gemma":[0.0007077947,0.0004943912,0.034387488,0.000099814446,0.000010562187,0.000101322665,0.000072500756,0.00011724494,0.046702947,0.9167502,0.00040562448,0.00015011177],"about_ca_topic_score_codex":3.892061e-7,"about_ca_topic_score_gemma":1.2094776e-7,"teacher_disagreement_score":0.2844584,"about_ca_system_score_codex":0.000017530927,"about_ca_system_score_gemma":0.000074897616,"threshold_uncertainty_score":0.39488783},"labels":[],"label_agreement":null},{"id":"W2898645613","doi":"10.1002/jgt.22668","title":"An optimal χ‐bound for (P6, diamond)‐free graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph; Discrete mathematics; Chromatic scale; Graph; Clique number; Cograph; Vertex (graph theory); Line graph; Pathwidth","score_opus":0.021355985766179666,"score_gpt":0.31007581000829687,"score_spread":0.28871982424211723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898645613","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.14965309,0.0026604407,0.84546626,0.0005587514,0.0007948236,0.00016072331,0.000016324542,0.00004990687,0.0006397023],"genre_scores_gemma":[0.7379522,0.00034196366,0.26025084,0.00061882834,0.00034007579,0.000020664625,0.000003984971,0.000058349866,0.00041313047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971935,0.0006328221,0.00058421923,0.00037963997,0.00065759674,0.0005522254],"domain_scores_gemma":[0.99600244,0.0009979876,0.00038356904,0.00125923,0.0009766497,0.00038010368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033199124,0.00021857473,0.00040376416,0.00062173075,0.00029458193,0.00029483403,0.0026945083,0.00010310374,0.000058114012],"category_scores_gemma":[0.0006477661,0.00018829247,0.00054941396,0.0010756886,0.00029988654,0.0016370841,0.00027557943,0.00047782864,0.0000047300796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040321168,0.00028013284,0.00019302369,0.000024057277,0.00014737713,0.00027410616,0.0005255954,0.0003947033,0.011984839,0.96001977,0.0008337803,0.024919383],"study_design_scores_gemma":[0.0012222194,0.0007268524,0.00045677126,0.000037972757,0.000026551346,0.00046232285,0.0003159795,0.00046799754,0.02123562,0.9728508,0.0019699254,0.0002270025],"about_ca_topic_score_codex":4.1682674e-7,"about_ca_topic_score_gemma":0.0000027213123,"teacher_disagreement_score":0.5882991,"about_ca_system_score_codex":0.000038842725,"about_ca_system_score_gemma":0.00029616075,"threshold_uncertainty_score":0.76783437},"labels":[],"label_agreement":null},{"id":"W2899312866","doi":"10.1002/jgt.22678","title":"The structure of graphs with no K3,3 immersion","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Robertson–Seymour theorem; 1-planar graph; Planar graph; Minor (academic); Indifference graph; Discrete mathematics; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.0075832166638496725,"score_gpt":0.25330627347158774,"score_spread":0.24572305680773807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899312866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76698864,0.0078744935,0.21923527,0.0017719263,0.0014332859,0.0002292181,0.0000111156005,0.000034264216,0.002421792],"genre_scores_gemma":[0.9863692,0.0004977122,0.012685973,0.00010943341,0.000049564875,3.9711088e-7,3.8599788e-7,0.000013727842,0.0002736309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978488,0.00056625664,0.00039726312,0.00017730492,0.00071981153,0.00029054692],"domain_scores_gemma":[0.9968548,0.00081530906,0.00047800693,0.000648323,0.0010782214,0.00012536706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012661669,0.00013741509,0.00025577296,0.00025018535,0.00023814014,0.0000759977,0.0013131555,0.00005447072,0.000038075963],"category_scores_gemma":[0.00018889818,0.000074561045,0.00023217963,0.0011377728,0.0004046437,0.00045402645,0.000189029,0.00049362413,0.0000028745765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005495475,0.00006119817,0.0007252812,0.00002215317,0.00019886212,0.00015688027,0.00035176592,0.00012613108,0.08349347,0.8969028,0.0004208923,0.016991008],"study_design_scores_gemma":[0.0006363163,0.00045966497,0.0010507911,0.000092696326,0.00002055798,0.00055061677,0.00055647583,0.00003515919,0.0837964,0.91117966,0.001500058,0.0001216152],"about_ca_topic_score_codex":4.834137e-7,"about_ca_topic_score_gemma":0.0000021778433,"teacher_disagreement_score":0.21938054,"about_ca_system_score_codex":0.000017744873,"about_ca_system_score_gemma":0.00019826586,"threshold_uncertainty_score":0.30405113},"labels":[],"label_agreement":null},{"id":"W2899358912","doi":"10.1002/jgt.22677","title":"The structure of graphs with no W4 immersion","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Immersion (mathematics); Structured program theorem; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.01012567712544459,"score_gpt":0.2656434143866309,"score_spread":0.2555177372611863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899358912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6321009,0.015452807,0.34678766,0.0006842922,0.003371556,0.00053016806,0.000027022317,0.00004235134,0.001003264],"genre_scores_gemma":[0.97601646,0.0018324485,0.021801421,0.00008024956,0.00011360873,0.000001860217,0.0000025025317,0.000034837572,0.00011660883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586684,0.0011493436,0.0008126087,0.000412607,0.0013189396,0.00043967454],"domain_scores_gemma":[0.99373883,0.0010938596,0.001652074,0.0015398387,0.00178121,0.00019417847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482399,0.00035488064,0.0006691738,0.00063234364,0.00027560792,0.00024744176,0.0038554422,0.0002331984,0.00003787963],"category_scores_gemma":[0.00023720595,0.00019930734,0.00064656197,0.00093045074,0.0007225382,0.00042907769,0.00135113,0.0021795812,0.0000015206342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020936048,0.0002192007,0.0011404721,0.00037843996,0.001703646,0.00045726923,0.0021100498,0.0029401872,0.034184527,0.92102,0.00061836216,0.033134285],"study_design_scores_gemma":[0.000591503,0.00052071095,0.0008081687,0.00067495025,0.000070658025,0.00035404743,0.0007428653,0.00010912082,0.016003769,0.9795349,0.0002893391,0.00029997327],"about_ca_topic_score_codex":0.0000031012544,"about_ca_topic_score_gemma":0.0000048772936,"teacher_disagreement_score":0.34391558,"about_ca_system_score_codex":0.00004969474,"about_ca_system_score_gemma":0.00054155604,"threshold_uncertainty_score":0.9469317},"labels":[],"label_agreement":null},{"id":"W2901777012","doi":"10.1002/jgt.22420","title":"Fractal graphs","year":2018,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Lexicographical order; Mathematics; Discrete mathematics; Block graph; Line graph; Symmetric graph; Graph; Pathwidth; Voltage graph","score_opus":0.025243409640272066,"score_gpt":0.3099143231061521,"score_spread":0.28467091346588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901777012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88047165,0.0001686206,0.07568107,0.00023009357,0.0006419226,0.00010512967,0.000005638764,0.000029897987,0.042665962],"genre_scores_gemma":[0.9850353,0.000028153396,0.014055003,0.00017760685,0.00029121866,8.6619406e-7,2.0999711e-7,0.000024087134,0.0003875378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987019,0.000117440446,0.0005722802,0.00008285726,0.0003304926,0.00019502938],"domain_scores_gemma":[0.9980211,0.0008114204,0.0005152188,0.00022757113,0.00029130303,0.000133332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019154268,0.00012594064,0.00032734196,0.00022961413,0.00008389734,0.000034288056,0.00028992933,0.000082953644,0.0008228292],"category_scores_gemma":[0.00089271105,0.00008644443,0.00031793505,0.00020370702,0.00023997607,0.00015175942,0.000036268204,0.00025046253,0.00003595641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008381234,0.00017393948,0.000109035456,0.00003062821,0.00010764979,0.00002392382,0.00035828556,7.0777894e-8,0.00078588014,0.99284387,0.0027992006,0.0026836896],"study_design_scores_gemma":[0.0002902234,0.00028547505,0.00022918242,0.00008009598,0.0000669811,0.00017379099,0.0001633657,0.000053368192,0.00047232452,0.997024,0.0010569355,0.00010424998],"about_ca_topic_score_codex":3.7756058e-7,"about_ca_topic_score_gemma":0.0000011389218,"teacher_disagreement_score":0.104563646,"about_ca_system_score_codex":0.000012338054,"about_ca_system_score_gemma":0.000027491553,"threshold_uncertainty_score":0.9009403},"labels":[],"label_agreement":null},{"id":"W2903198428","doi":"10.1002/jgt.22433","title":"On ‐connected graphs","year":2018,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"3v Geomatics (Canada)","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Connectivity; Discrete mathematics; Conjecture; Strongly connected component; 1-planar graph; Graph; Chordal graph","score_opus":0.01663824849721421,"score_gpt":0.29265974451295196,"score_spread":0.2760214960157378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903198428","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.37002552,0.0004552926,0.6150367,0.0006329631,0.0015307044,0.00014747046,0.0000021074966,0.00010856087,0.012060657],"genre_scores_gemma":[0.9901895,0.00004152957,0.008747321,0.00063429005,0.00016846164,0.0000017519814,1.4464351e-7,0.000016744547,0.00020024602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780035,0.0005454527,0.00042013562,0.00023122816,0.00061839796,0.0003844116],"domain_scores_gemma":[0.9972329,0.00093790743,0.00034782325,0.0006510378,0.000608815,0.000221513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025480762,0.00016373486,0.0002588844,0.0010360575,0.00020794748,0.00008828327,0.001768701,0.00006933526,0.00012079392],"category_scores_gemma":[0.0005913825,0.00012245389,0.00027191016,0.0013269315,0.0004608146,0.00061304343,0.00014285075,0.00045625956,0.00008989453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029615228,0.00009141518,0.00007219819,0.00000336047,0.00006473672,0.00006599722,0.00031159725,0.000009895034,0.0033805794,0.9786029,0.001041869,0.016059307],"study_design_scores_gemma":[0.00057121465,0.001417729,0.00069237244,0.00005057817,0.000007356893,0.00017411026,0.000050332972,0.00007471914,0.010497827,0.98542565,0.00089953805,0.00013859574],"about_ca_topic_score_codex":4.2063863e-7,"about_ca_topic_score_gemma":9.249147e-7,"teacher_disagreement_score":0.620164,"about_ca_system_score_codex":0.000028730266,"about_ca_system_score_gemma":0.00007921043,"threshold_uncertainty_score":0.49935248},"labels":[],"label_agreement":null},{"id":"W2913253550","doi":"10.1002/jgt.22452","title":"On the clique number of the square of a line graph and its relation to maximum degree of the line graph","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Line graph; Perfect graph; Discrete mathematics; Graph; Conjecture; Block graph; Clique number; Cubic graph; Split graph; Clique graph; Graph power; Voltage graph; Pathwidth","score_opus":0.025816731673697267,"score_gpt":0.2940536123934432,"score_spread":0.26823688071974594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913253550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819903,0.000499392,0.01419345,0.0018021616,0.00030559488,0.0005708235,0.000016660284,0.000008200975,0.0006134253],"genre_scores_gemma":[0.99862367,0.0001307973,0.0008014441,0.00028838136,0.000031949,0.0000047926824,2.495302e-7,0.000014534177,0.00010418084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656147,0.0011969447,0.00080988865,0.00023366431,0.00092710555,0.00027090684],"domain_scores_gemma":[0.99527055,0.0018197233,0.0011176292,0.0009585673,0.00073433376,0.0000991746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003963013,0.00020521494,0.0004161052,0.00033315914,0.0001405999,0.000023212397,0.001992078,0.00011310471,0.0000437263],"category_scores_gemma":[0.0006807328,0.00009151513,0.000503124,0.001922663,0.00032666262,0.0003022864,0.00043459176,0.00072553253,0.000003357003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007945628,0.0002133822,0.010441961,0.0000873696,0.00016036925,0.0000030383244,0.0013540966,0.0014505212,0.021615854,0.9590884,0.000092315684,0.0046981405],"study_design_scores_gemma":[0.00062252703,0.00062722416,0.03106878,0.0004689719,0.000032885655,0.00006570856,0.0002034553,0.0002197821,0.028312331,0.93819976,0.000058027777,0.00012054501],"about_ca_topic_score_codex":0.0000038771045,"about_ca_topic_score_gemma":0.000008389451,"teacher_disagreement_score":0.020888627,"about_ca_system_score_codex":0.000019649475,"about_ca_system_score_gemma":0.000089684996,"threshold_uncertainty_score":0.37318787},"labels":[],"label_agreement":null},{"id":"W2949221968","doi":"10.1002/jgt.20343","title":"Contractors and connectors of graph algebras","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"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":"Hungarian Scientific Research Fund","keywords":"Mathematics; Homomorphism; Graph homomorphism; Combinatorics; Line graph; Discrete mathematics; Algebra homomorphism; Voltage graph; Graph","score_opus":0.019154664229650918,"score_gpt":0.26516413356009655,"score_spread":0.24600946933044562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949221968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89744085,0.002808691,0.09872049,0.00013253976,0.00031753717,0.00010238072,0.0000030202086,0.00002401544,0.0004504711],"genre_scores_gemma":[0.99414015,0.00075192115,0.0048907106,0.00010222081,0.000049735892,0.0000013276773,1.8409446e-7,0.000014558562,0.00004920883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780226,0.000464752,0.00061749114,0.00021115533,0.00057467615,0.0003296923],"domain_scores_gemma":[0.99709904,0.0012326988,0.00059628836,0.0004137574,0.0004042242,0.00025399734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019790845,0.00017953338,0.00046210707,0.0008550069,0.0001619182,0.000033451703,0.00097122183,0.00008241404,0.000027947468],"category_scores_gemma":[0.00042643625,0.00013972833,0.00027654905,0.0008062639,0.0008330418,0.0007867393,0.00014035436,0.00042657432,0.0000021607962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029521738,0.00015773294,0.018537644,0.000025028463,0.00020308424,0.00024015224,0.0014376865,0.000033487646,0.010164252,0.96278423,0.00024040909,0.0058811028],"study_design_scores_gemma":[0.0012106512,0.0006561922,0.0290483,0.000066698034,0.00002151994,0.0011574767,0.00023237751,0.000036374946,0.013808781,0.9531769,0.000372941,0.00021178571],"about_ca_topic_score_codex":0.0000030127756,"about_ca_topic_score_gemma":0.000001028251,"teacher_disagreement_score":0.096699275,"about_ca_system_score_codex":0.00001661712,"about_ca_system_score_gemma":0.0001083808,"threshold_uncertainty_score":0.5697956},"labels":[],"label_agreement":null},{"id":"W2949911960","doi":"10.1002/jgt.20214","title":"Simultaneous diagonal flips in plane triangulations","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec en Outaouais; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Diagonal; Mathematics; Triangulation; Vertex (graph theory); Plane (geometry); Graph; Geometry","score_opus":0.006922689708773792,"score_gpt":0.22658589550119923,"score_spread":0.21966320579242543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949911960","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.34873253,0.0006178897,0.648835,0.00040838262,0.00048879633,0.00005214301,0.0000020950768,0.000013725134,0.0008494344],"genre_scores_gemma":[0.98795485,0.000009691611,0.011472678,0.00009686616,0.00026601055,7.8093444e-7,0.0000032726964,0.0000030311837,0.00019283767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990593,0.00014026288,0.00036564656,0.00008697315,0.00023997927,0.000107820975],"domain_scores_gemma":[0.9988418,0.00071510347,0.00019168215,0.000097005584,0.00011476472,0.000039646955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079280074,0.00006571281,0.00012023079,0.00046272908,0.000056045774,0.000051913805,0.00025517156,0.00003415779,0.000020604899],"category_scores_gemma":[0.00012184947,0.000056880144,0.000084877465,0.0005326157,0.000022302736,0.00027673112,0.000022211569,0.0001272716,0.0000057397847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009348153,0.00022173858,0.0008935659,0.000004751028,0.000020388185,0.00020027379,0.00024175289,0.29602468,0.0020850676,0.664407,0.0008036907,0.035003588],"study_design_scores_gemma":[0.00118673,0.00016746596,0.025220394,0.000028416638,0.00001088081,0.00037523638,0.000028014183,0.021963142,0.0011551785,0.9463697,0.003339295,0.00015555353],"about_ca_topic_score_codex":0.0000038904386,"about_ca_topic_score_gemma":0.000012451712,"teacher_disagreement_score":0.6392223,"about_ca_system_score_codex":0.000025363457,"about_ca_system_score_gemma":0.00007152311,"threshold_uncertainty_score":0.23195049},"labels":[],"label_agreement":null},{"id":"W2951550992","doi":"10.1002/jgt.20086","title":"Circular chromatic index of graphs of maximum degree 3","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Edge coloring; Bound graph; Graph power; Degree (music); Discrete mathematics; Line graph; Physics","score_opus":0.02337219878357789,"score_gpt":0.27783629775663776,"score_spread":0.2544640989730599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951550992","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.4869697,0.002981599,0.50809616,0.00020317714,0.00020873919,0.00014968334,0.0000031502316,0.000021611257,0.0013661945],"genre_scores_gemma":[0.9787955,0.0001609925,0.020882176,0.00006530682,0.00004606141,0.000001817448,1.772784e-7,0.000016800537,0.000031154374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704224,0.00049258047,0.0009864063,0.00019308421,0.00093726395,0.0003484478],"domain_scores_gemma":[0.99694455,0.00052507024,0.0010483839,0.00076009706,0.00054389046,0.00017803925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032872194,0.0001828673,0.0005466941,0.0012719389,0.00006712934,0.000024141915,0.0019792768,0.00009223527,0.00005989681],"category_scores_gemma":[0.00026414922,0.00014861973,0.00050740154,0.0013277245,0.00049079285,0.0008005518,0.00019655783,0.00041590203,0.000005371094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029010678,0.00051168137,0.004433069,0.00020971573,0.0004202195,0.00007950773,0.0014142941,0.0011381963,0.040255077,0.83280134,0.00014970529,0.11829708],"study_design_scores_gemma":[0.00086992356,0.00039233893,0.0068888785,0.00016213898,0.000026750118,0.0002349501,0.0001471519,0.00046244948,0.020648016,0.9698597,0.00015917465,0.00014850627],"about_ca_topic_score_codex":0.0000017617524,"about_ca_topic_score_gemma":0.0000015165939,"teacher_disagreement_score":0.49182582,"about_ca_system_score_codex":0.00003563712,"about_ca_system_score_gemma":0.0001447447,"threshold_uncertainty_score":0.6060537},"labels":[],"label_agreement":null},{"id":"W2951892290","doi":"10.1002/jgt.20302","title":"A Characterization of the degree sequences of 2‐trees","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Degree (music); Characterization (materials science); Vertex (graph theory); Tree (set theory); Graph; Discrete mathematics","score_opus":0.0482485410025316,"score_gpt":0.2735561371976695,"score_spread":0.22530759619513793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951892290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8803761,0.0003064785,0.1186053,0.00017141236,0.00020285058,0.00006865986,0.000003139453,0.0000065613594,0.00025949022],"genre_scores_gemma":[0.99651355,0.00020107105,0.0031275603,0.00004033901,0.000032051725,9.6235e-7,1.3496194e-7,0.000005757264,0.000078593555],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827355,0.00044236507,0.0004782596,0.00009881436,0.0005568548,0.00015013167],"domain_scores_gemma":[0.9980306,0.00028028293,0.00081617845,0.00040400206,0.0004145852,0.000054321303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012808443,0.000088079054,0.0002376719,0.00030029812,0.00010101234,0.000009372082,0.00146217,0.000040443178,0.0000145416325],"category_scores_gemma":[0.000180343,0.000053297437,0.00023732804,0.00078670727,0.00057526305,0.0005439072,0.00014254301,0.00020584694,9.2670257e-7],"study_design_candidate":"bench_or_experimental","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.00011579188,0.00010111457,0.008074481,0.000020341418,0.000056764537,0.00001999327,0.0014617855,0.00007213547,0.71535397,0.2674574,0.000015556547,0.007250706],"study_design_scores_gemma":[0.00040380686,0.0003345144,0.10546263,0.00014650609,0.000014064128,0.00040853932,0.000109866545,0.00007994434,0.41983366,0.47299954,0.000101713886,0.00010521462],"about_ca_topic_score_codex":0.0000011209153,"about_ca_topic_score_gemma":0.0000015039186,"teacher_disagreement_score":0.29552028,"about_ca_system_score_codex":0.000013016122,"about_ca_system_score_gemma":0.00014361538,"threshold_uncertainty_score":0.27171},"labels":[],"label_agreement":null},{"id":"W2953294211","doi":"10.1002/jgt.22174","title":"Finding a subdivision of a prescribed digraph of order 4","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Digraph; Subdivision; Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Reduction (mathematics); Time complexity; Order (exchange); Graph","score_opus":0.032089115078952526,"score_gpt":0.3273542662692229,"score_spread":0.2952651511902704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953294211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62186193,0.00092823245,0.3746962,0.00016825327,0.00040958408,0.00015186868,0.0000054036736,0.000013964386,0.0017645787],"genre_scores_gemma":[0.98522925,0.00016007807,0.014452247,0.000016181237,0.000034691242,0.0000013870077,1.3992207e-7,0.000012306701,0.00009369382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774206,0.0003549213,0.0006845883,0.00018969385,0.00073436793,0.0002943733],"domain_scores_gemma":[0.9957251,0.0005856333,0.0016561432,0.0011330984,0.0007644814,0.0001355437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003535091,0.00014793161,0.00045723363,0.00080919545,0.00023441378,0.00008409597,0.0029683202,0.0000741571,0.000024516088],"category_scores_gemma":[0.0012588471,0.00011348163,0.00036115744,0.00048916583,0.00056171394,0.0011757734,0.00045655665,0.00035472718,0.000001511986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005989152,0.0002623222,0.010764068,0.00008982464,0.00020375231,0.00005946486,0.0013732755,0.00007710659,0.03650853,0.91750914,0.00014231555,0.032411307],"study_design_scores_gemma":[0.0011349196,0.0006230057,0.023978608,0.00034646443,0.000026408099,0.00007129041,0.00014011814,0.00029165612,0.04149365,0.93158835,0.00015148935,0.00015406797],"about_ca_topic_score_codex":0.0000051156867,"about_ca_topic_score_gemma":0.0000019545184,"teacher_disagreement_score":0.36336735,"about_ca_system_score_codex":0.000013790426,"about_ca_system_score_gemma":0.000111641806,"threshold_uncertainty_score":0.5515927},"labels":[],"label_agreement":null},{"id":"W2962696666","doi":"10.1002/jgt.22121","title":"Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number<sup>*</sup>","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Research Council","keywords":"Mathematics; Combinatorics; Chromatic scale; Corollary; Tree (set theory); Path (computing); Discrete mathematics; Graph; Critical graph; Computer science; Graph power","score_opus":0.027889476077178666,"score_gpt":0.3269516811109861,"score_spread":0.2990622050338074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962696666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5229443,0.00012608706,0.46335855,0.0020662965,0.0006886054,0.0004190723,0.000015051241,0.000096790114,0.010285241],"genre_scores_gemma":[0.9582718,0.000051468418,0.039260432,0.0011453851,0.00029434133,0.000014955387,4.779225e-7,0.000055063978,0.0009060732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950475,0.00082164013,0.0011223612,0.0005276525,0.0015604689,0.0009203601],"domain_scores_gemma":[0.9941688,0.0010981138,0.001115329,0.0023921363,0.0005083516,0.00071724755],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046186103,0.00043782123,0.00082569936,0.0004780161,0.0008970682,0.00078272785,0.005492619,0.00016462957,0.0006254351],"category_scores_gemma":[0.0012601808,0.00035760863,0.0006465845,0.0006053022,0.0005013225,0.0022339146,0.00090949977,0.0008096384,0.0010526399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006529632,0.00064101693,0.0049729994,0.00022673864,0.00063948653,0.0011547916,0.013212019,0.0002297294,0.00399123,0.8442999,0.00894498,0.12103414],"study_design_scores_gemma":[0.0015577412,0.00045050142,0.0036744939,0.00046697183,0.00006037326,0.0010842019,0.0005349929,0.0030413093,0.0028928176,0.98466,0.0010054203,0.00057114096],"about_ca_topic_score_codex":0.000008166126,"about_ca_topic_score_gemma":0.0000026481155,"teacher_disagreement_score":0.4353275,"about_ca_system_score_codex":0.00010187278,"about_ca_system_score_gemma":0.00021617163,"threshold_uncertainty_score":0.9998881},"labels":[],"label_agreement":null},{"id":"W2962878651","doi":"10.1002/jgt.22178","title":"Packing odd<i>T</i>‐joins with at most two terminals","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo","funders":"Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Joins; Mathematics; Bipartite graph; Cardinality (data modeling); Conjecture; Eulerian path; Disjoint sets; Graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.02431626381934828,"score_gpt":0.3199633436365374,"score_spread":0.29564707981718913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962878651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59585816,0.0009404892,0.3895082,0.0011630089,0.00071259664,0.00024709603,0.0000057415614,0.00006745981,0.011497243],"genre_scores_gemma":[0.98387784,0.00009607301,0.014564877,0.00022636063,0.0001776575,0.0000034625198,2.2727872e-7,0.000027170114,0.0010263076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763346,0.00034311748,0.00043689623,0.0002949418,0.0007798874,0.00051170425],"domain_scores_gemma":[0.99630183,0.00044472102,0.0010724874,0.0014713805,0.00041786346,0.00029170595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029815985,0.00022388398,0.00038977808,0.00044715812,0.0010898258,0.00044191582,0.0032052472,0.000054303466,0.000047025245],"category_scores_gemma":[0.00032889706,0.00015506975,0.00021557315,0.0002955861,0.0006212936,0.0018258238,0.0006362885,0.0005141857,0.000022288856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009842898,0.00019133648,0.023313617,0.000037039285,0.00027105966,0.0019872165,0.0012525796,0.00018649896,0.015491526,0.8765359,0.00078993716,0.07895902],"study_design_scores_gemma":[0.0026288074,0.000966351,0.0155611755,0.00038585954,0.000047485286,0.0028625727,0.00016666656,0.0002510843,0.022205004,0.9514586,0.0029778432,0.00048856717],"about_ca_topic_score_codex":0.0000034559014,"about_ca_topic_score_gemma":0.000019728894,"teacher_disagreement_score":0.38801968,"about_ca_system_score_codex":0.00007006035,"about_ca_system_score_gemma":0.00013733607,"threshold_uncertainty_score":0.8382169},"labels":[],"label_agreement":null},{"id":"W2963127852","doi":"10.1002/jgt.22157","title":"Completing orientations of partially oriented graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Danmarks Frie Forskningsfond; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.033180651212065586,"score_gpt":0.3333721953777207,"score_spread":0.30019154416565513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963127852","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.2563466,0.00025805217,0.73959184,0.00041977072,0.0007861626,0.00012272579,0.0000055874198,0.00002486849,0.002444361],"genre_scores_gemma":[0.97014254,0.00005699541,0.029611986,0.00005019052,0.000052199113,0.0000022618044,4.0208266e-7,0.0000113027945,0.00007210184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978672,0.00038344105,0.00064379233,0.00018279628,0.00061760563,0.00030513664],"domain_scores_gemma":[0.99616647,0.0005399762,0.0013781539,0.0009594948,0.0007839891,0.00017191932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002967456,0.00013232359,0.00032637033,0.0005177802,0.00057608,0.00012613412,0.002289536,0.000046232293,0.000029917135],"category_scores_gemma":[0.0010339448,0.00010917975,0.00030206313,0.00040027485,0.0005907413,0.0010869979,0.00030960346,0.00033440904,0.0000049481077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001238832,0.000098914024,0.0066613564,0.000013020761,0.00008636508,0.000042037573,0.0005878382,0.00010399481,0.0049817734,0.97938174,0.00008722381,0.007831828],"study_design_scores_gemma":[0.00086296466,0.00031532848,0.01781965,0.00009593873,0.000021990041,0.00008757507,0.0002585957,0.0002339257,0.0073956945,0.9720987,0.00067501015,0.00013461732],"about_ca_topic_score_codex":0.000003571894,"about_ca_topic_score_gemma":0.0000044553904,"teacher_disagreement_score":0.71379596,"about_ca_system_score_codex":0.000017636843,"about_ca_system_score_gemma":0.00011302391,"threshold_uncertainty_score":0.4452221},"labels":[],"label_agreement":null},{"id":"W2963269633","doi":"10.1002/jgt.22929","title":"A new graph parameter to measure linearity","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Discrete mathematics; Interval graph; Pathwidth; Lexicographical order; Cograph; Split graph; Vertex (graph theory); Conjecture; Maximal independent set; Graph; 1-planar graph; Line graph","score_opus":0.0419654132220377,"score_gpt":0.3163577701094336,"score_spread":0.27439235688739594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963269633","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.0507373,0.00044881325,0.9447865,0.0020790123,0.0009942009,0.0001986372,0.0000027495157,0.00015972588,0.0005930442],"genre_scores_gemma":[0.78762394,0.00024197911,0.2065655,0.0019127047,0.0007057622,0.000014877612,0.0000011459201,0.00008054392,0.0028535728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970373,0.0005687485,0.0005212511,0.0003115148,0.0009923874,0.00056880485],"domain_scores_gemma":[0.9969821,0.0009957748,0.00024114357,0.000744571,0.00041650145,0.000619901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047656754,0.00020192961,0.00036775062,0.0015902865,0.00016203517,0.00016892266,0.0021160727,0.00009403322,0.000043290987],"category_scores_gemma":[0.0011299053,0.00016046896,0.00043434647,0.0038791597,0.000099662815,0.0007057018,0.000364511,0.0006544008,0.00017693276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006592315,0.000119620636,0.0012443241,0.000026301288,0.00028451756,0.0005258242,0.002165152,0.0010298599,0.0067705554,0.73089886,0.023675393,0.23260035],"study_design_scores_gemma":[0.0005406317,0.00041453727,0.0027075878,0.00006913074,0.000013618547,0.00013933632,0.00009125128,0.00014127741,0.0023128511,0.9895991,0.0037651411,0.00020550132],"about_ca_topic_score_codex":0.0000034786572,"about_ca_topic_score_gemma":0.0000035382088,"teacher_disagreement_score":0.73822105,"about_ca_system_score_codex":0.000034223787,"about_ca_system_score_gemma":0.00020398841,"threshold_uncertainty_score":0.65437347},"labels":[],"label_agreement":null},{"id":"W2963622109","doi":"10.1002/jgt.22230","title":"Star chromatic index of subcubic multigraphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"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 Science Foundation of Tianjin City; Simon Fraser University; National Natural Science Foundation of China","keywords":"Multigraph; Mathematics; Edge coloring; Combinatorics; Star (game theory); Graph; Conjecture; Discrete mathematics; Graph power; Line graph","score_opus":0.021040488398955014,"score_gpt":0.3052251601930699,"score_spread":0.2841846717941149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963622109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76103884,0.0012520598,0.23527625,0.00027326072,0.0005953757,0.00016501559,0.0000035747537,0.000026727284,0.0013688954],"genre_scores_gemma":[0.9870769,0.00016207255,0.012551736,0.000043625245,0.000057108722,0.0000020257214,1.1455003e-7,0.000015053101,0.00009139357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976122,0.00039702927,0.00066568976,0.00020258073,0.0007616081,0.00036093476],"domain_scores_gemma":[0.9959053,0.0005370395,0.0014460218,0.0014467486,0.00046116038,0.00020377737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003442812,0.0001772612,0.00045853047,0.00079649827,0.0003401915,0.0001460656,0.003800836,0.0000809759,0.000036260397],"category_scores_gemma":[0.00073336455,0.00013839098,0.00040451376,0.00034912486,0.0007025644,0.0013885563,0.00035239142,0.00045944052,0.000007382302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051101454,0.00037760148,0.019022863,0.00014067031,0.00040451394,0.0002673259,0.0016452996,0.00013019485,0.023714937,0.9052457,0.00024327738,0.04829658],"study_design_scores_gemma":[0.001071781,0.00041676263,0.052675772,0.0001694372,0.00001859829,0.00012724713,0.00014298767,0.00058140024,0.007962479,0.93652123,0.00014269102,0.00016962536],"about_ca_topic_score_codex":0.0000057821208,"about_ca_topic_score_gemma":0.000004131763,"teacher_disagreement_score":0.22603802,"about_ca_system_score_codex":0.000024724446,"about_ca_system_score_gemma":0.0001294341,"threshold_uncertainty_score":0.7062962},"labels":[],"label_agreement":null},{"id":"W2963809247","doi":"10.1002/jgt.22361","title":"Size of the largest induced forest in subcubic graphs of girth at least four and five","year":2018,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Girth (graph theory); Graph; Discrete mathematics","score_opus":0.011680613743914096,"score_gpt":0.21672354184265774,"score_spread":0.20504292809874364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963809247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960879,0.0001560486,0.0019688585,0.00018017636,0.00095678883,0.00007340626,0.0000012946097,0.0000026993318,0.0005728284],"genre_scores_gemma":[0.9995663,0.000026428761,0.0001524088,0.00007196226,0.00008789065,7.295399e-7,1.9369264e-8,0.000005125165,0.00008912662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987501,0.0002904233,0.0004925626,0.000104664854,0.0002242491,0.00013803037],"domain_scores_gemma":[0.99831295,0.00029572798,0.0007781199,0.00031390926,0.00025289308,0.000046384917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015500525,0.000088149805,0.00025855374,0.00016778917,0.000108954984,0.000029556617,0.00064387004,0.000063346735,0.000010224662],"category_scores_gemma":[0.00013046546,0.00005452896,0.00016695051,0.00032687676,0.00020637586,0.00022558386,0.00018334607,0.00017678573,5.795554e-7],"study_design_candidate":"observational","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.0004957575,0.00017551662,0.44404268,0.000071886796,0.00018801511,0.000026733764,0.0056744227,0.0001356567,0.011280025,0.5341238,0.000690139,0.0030954052],"study_design_scores_gemma":[0.0014656995,0.00093850313,0.81270146,0.00050195545,0.000022152022,0.0003837398,0.0005381429,0.0012944421,0.0036005466,0.17827581,0.000120590616,0.00015696534],"about_ca_topic_score_codex":0.00004604099,"about_ca_topic_score_gemma":0.00046169484,"teacher_disagreement_score":0.36865878,"about_ca_system_score_codex":0.00001635743,"about_ca_system_score_gemma":0.000034411765,"threshold_uncertainty_score":0.22236264},"labels":[],"label_agreement":null},{"id":"W2964030595","doi":"10.1002/jgt.22167","title":"Levi's Lemma, pseudolinear drawings of , and empty triangles","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología, Guatemala","keywords":"Lemma (botany); Mathematics; Mathematical proof; Combinatorics; Regular polygon; Graph; Geometry","score_opus":0.012369625081423936,"score_gpt":0.23100893026290978,"score_spread":0.21863930518148583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964030595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99228203,0.0029118126,0.0008625245,0.000041814208,0.0006085436,0.000059592978,0.0000066803073,0.0000195708,0.0032074407],"genre_scores_gemma":[0.9992064,0.00030762027,0.00016793273,0.000012394355,0.00019277024,8.521116e-7,1.993582e-7,0.000021204025,0.00009058522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903756,0.00010603732,0.0004710214,0.00007167853,0.00016172571,0.00015199125],"domain_scores_gemma":[0.9989675,0.00013626298,0.00040411335,0.0003094047,0.00008559578,0.0000971169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016884918,0.00013342596,0.00037642606,0.000209716,0.00014994608,0.00006243709,0.0003509964,0.00008316143,0.000029622284],"category_scores_gemma":[0.00014882983,0.00010609621,0.00022338428,0.000053061285,0.00023037632,0.00031385096,0.000027984894,0.00020745741,0.0000022793406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001998718,0.0002880271,0.04046205,0.0015040226,0.0021765912,0.00035925172,0.009224855,0.0013730638,0.18869641,0.65023327,0.0050673117,0.0986164],"study_design_scores_gemma":[0.0057088383,0.00074677955,0.090763204,0.0014666894,0.00046777955,0.0012447672,0.0025567268,0.00043606904,0.046008077,0.8414638,0.008274099,0.0008631384],"about_ca_topic_score_codex":0.0000030780957,"about_ca_topic_score_gemma":0.0000017549951,"teacher_disagreement_score":0.19123054,"about_ca_system_score_codex":0.000007406186,"about_ca_system_score_gemma":0.00001259419,"threshold_uncertainty_score":0.4326478},"labels":[],"label_agreement":null},{"id":"W2966283154","doi":"10.1002/jgt.22487","title":"On the imaginary parts of chromatic roots","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; The Imaginary; Combinatorics; Graph; Order (exchange); Discrete mathematics","score_opus":0.008522637999256006,"score_gpt":0.22397371537773708,"score_spread":0.21545107737848107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966283154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9385926,0.0010076659,0.049792938,0.0033475375,0.00045072654,0.00007812984,0.000003264387,0.000012593331,0.0067145037],"genre_scores_gemma":[0.99868965,0.00003701419,0.00064658583,0.00042529902,0.000023109085,3.7686266e-7,1.6628302e-7,0.000001967808,0.00017583558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989447,0.00022021821,0.00030072097,0.00009060857,0.0003279016,0.00011586236],"domain_scores_gemma":[0.99814343,0.00093825854,0.0003761926,0.00040906208,0.00008440844,0.000048672704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149308,0.00007058507,0.00021973193,0.00030622722,0.00003785772,0.000031974574,0.0010438483,0.000023556253,0.00029250226],"category_scores_gemma":[0.00021291476,0.00003324844,0.000223352,0.00085754495,0.0000864453,0.00022814663,0.00010732852,0.00015602529,0.000051992818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003316664,0.00015988012,0.0013472461,0.00001027032,0.00013048628,0.00002885575,0.00011305429,0.0001456488,0.0004696981,0.98331,0.0028302069,0.011421527],"study_design_scores_gemma":[0.00019261445,0.00049761316,0.018542558,0.00004441933,0.000030267713,0.00005623437,0.00005720608,0.00032801405,0.0005473635,0.9791038,0.0005332992,0.00006659938],"about_ca_topic_score_codex":0.0000015265617,"about_ca_topic_score_gemma":1.4149884e-7,"teacher_disagreement_score":0.060097,"about_ca_system_score_codex":0.000007174842,"about_ca_system_score_gemma":0.000020423116,"threshold_uncertainty_score":0.32026947},"labels":[],"label_agreement":null},{"id":"W2978598014","doi":"10.1002/jgt.22499","title":"The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"FP7 Ideas: European Research Council; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Split graph; Chordal graph; Induced path; Discrete mathematics; Cograph; Induced subgraph; Independent set; Indifference graph; Pathwidth; Block graph; Perfect graph; Modular decomposition; 1-planar graph; Graph; Longest path problem; Line graph; Vertex (graph theory)","score_opus":0.010213124396099182,"score_gpt":0.2832368930464169,"score_spread":0.27302376865031774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978598014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7129414,0.008484902,0.27244565,0.0017536494,0.0018312688,0.0004750712,0.00001083124,0.000053643616,0.0020035862],"genre_scores_gemma":[0.9872806,0.0009959408,0.011259581,0.00016163393,0.00006629687,0.0000043251744,4.6508814e-7,0.000023034638,0.0002081133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728745,0.00066743785,0.0006562179,0.0002495788,0.0007527268,0.00038658333],"domain_scores_gemma":[0.9959543,0.0016020107,0.0006364158,0.00095695123,0.0006707632,0.00017958567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039789546,0.00018971697,0.0003731655,0.0005210926,0.00029120324,0.00016609202,0.002360195,0.000083225044,0.000013496695],"category_scores_gemma":[0.00021113949,0.0001246186,0.0002659114,0.00086370826,0.00067252584,0.0008468077,0.00041885578,0.00049689156,0.0000058141854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024505955,0.00007551679,0.0016641438,0.00002463743,0.00014106631,0.000020108639,0.00036171783,0.000041137664,0.003303888,0.97656214,0.0002716937,0.017288873],"study_design_scores_gemma":[0.0009887,0.00046461922,0.003476475,0.00008426204,0.000018017417,0.00031130546,0.0003142858,0.00033976795,0.0027606795,0.98973346,0.0013579398,0.00015050254],"about_ca_topic_score_codex":0.0000018972061,"about_ca_topic_score_gemma":0.0000034621385,"teacher_disagreement_score":0.27433923,"about_ca_system_score_codex":0.000030355055,"about_ca_system_score_gemma":0.000118446835,"threshold_uncertainty_score":0.5081799},"labels":[],"label_agreement":null},{"id":"W2983894478","doi":"10.1002/jgt.22705","title":"Edge‐maximal graphs on orientable and some nonorientable surfaces","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Klein bottle; Combinatorics; Mathematics; Torus; Graph; Triangulation; Surface (topology); Projective plane; Discrete mathematics; Geometry","score_opus":0.019268193896181503,"score_gpt":0.2821031157012648,"score_spread":0.2628349218050833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983894478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8866154,0.018969132,0.08555374,0.00050588,0.0057499083,0.00045251095,0.000027823824,0.000099401346,0.0020261952],"genre_scores_gemma":[0.9661826,0.0047969874,0.027445719,0.00042277493,0.00034494,0.00002081467,0.000008119532,0.00007955149,0.00069847517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526674,0.0010126313,0.00092570175,0.0008425896,0.0011985387,0.0007538093],"domain_scores_gemma":[0.99549985,0.0010130587,0.0009996814,0.0013159422,0.000702283,0.00046916492],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004226746,0.0005300181,0.0009817707,0.0013142163,0.0003347662,0.0007399625,0.0024528839,0.0003160575,0.0000612754],"category_scores_gemma":[0.00034711265,0.00045298156,0.00057831395,0.0009172142,0.000495683,0.001522236,0.0021940074,0.0023208812,0.0000072285943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048683275,0.00044534655,0.0014461804,0.00019283652,0.00049021386,0.0005380661,0.0013208139,0.0026721365,0.0013643021,0.9821289,0.0006152694,0.008299113],"study_design_scores_gemma":[0.00082322536,0.0005755994,0.0010208981,0.0005503601,0.000056029687,0.00027091123,0.0005608777,0.00030297032,0.00477975,0.9897216,0.0008389372,0.0004988162],"about_ca_topic_score_codex":0.000008823136,"about_ca_topic_score_gemma":0.000003034557,"teacher_disagreement_score":0.07956721,"about_ca_system_score_codex":0.000113426024,"about_ca_system_score_gemma":0.00048596822,"threshold_uncertainty_score":0.9999808},"labels":[],"label_agreement":null},{"id":"W2985832939","doi":"10.1002/jgt.22736","title":"Matchings in 1‐planar graphs with large minimum degree","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Degree (music); Mathematics; Planar graph; Planar; Matching (statistics); 1-planar graph; Discrete mathematics; Graph; Chordal graph; Computer science; Physics; Statistics","score_opus":0.02410745607518017,"score_gpt":0.28479148291433015,"score_spread":0.26068402683915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985832939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49643245,0.005203693,0.49506906,0.0006201398,0.00092349894,0.00033021386,0.000015550324,0.000059954884,0.0013454616],"genre_scores_gemma":[0.932191,0.0008748334,0.06614899,0.00042098077,0.000112195165,0.000018854795,0.0000063129296,0.00006934565,0.0001574476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994844,0.0013065708,0.0010428514,0.0006985324,0.0012877802,0.00082021824],"domain_scores_gemma":[0.9957478,0.00077861996,0.0011304104,0.0013920869,0.0006230668,0.00032799243],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0057139685,0.00050583127,0.0010258128,0.0022351835,0.00013806904,0.00036978212,0.0037465068,0.00033032117,0.000040819108],"category_scores_gemma":[0.00023064256,0.00039610433,0.0005995567,0.0015135647,0.00027055995,0.0008651686,0.0011524179,0.0032613582,0.0000049076575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001188808,0.00087081344,0.009865828,0.00040512937,0.00076098874,0.008247628,0.0063560847,0.00084606215,0.0012951179,0.9571098,0.0004099268,0.012643818],"study_design_scores_gemma":[0.001380094,0.0003291348,0.005567689,0.0012010542,0.000039955314,0.00085166737,0.0009424733,0.0001302401,0.00059472024,0.9882372,0.00021363594,0.00051212194],"about_ca_topic_score_codex":0.000008830713,"about_ca_topic_score_gemma":0.00007199944,"teacher_disagreement_score":0.4357586,"about_ca_system_score_codex":0.000113367845,"about_ca_system_score_gemma":0.0006481761,"threshold_uncertainty_score":0.9998491},"labels":[],"label_agreement":null},{"id":"W2995958961","doi":"10.1002/jgt.22662","title":"Meyniel's conjecture on graphs of bounded degree","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Bounded function; Mathematics; Combinatorics; Degree (music); Discrete mathematics; Physics; Mathematical analysis","score_opus":0.06019598629361019,"score_gpt":0.3168677870757978,"score_spread":0.25667180078218765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995958961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97809273,0.00496864,0.002569794,0.00015090816,0.004338108,0.0003428432,0.0000662562,0.00003904877,0.009431663],"genre_scores_gemma":[0.99027115,0.00080776017,0.008009925,0.0002705475,0.00036307028,0.000005142647,0.0000068999643,0.000095201794,0.00017027771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995331,0.0011301929,0.0016985873,0.0004021153,0.0010463911,0.00039172423],"domain_scores_gemma":[0.99261504,0.002123109,0.0030526605,0.0012567738,0.0007478959,0.00020452593],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0032445835,0.0006289076,0.0017476091,0.0010415623,0.00019763828,0.00009388489,0.0012995433,0.0008355968,0.00040374266],"category_scores_gemma":[0.0013554718,0.00045380916,0.0021557596,0.00035943318,0.00059300236,0.000102112695,0.00057193724,0.002674364,6.661973e-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.0007806549,0.00030109606,0.00021750419,0.00074493006,0.0019837543,0.00023693238,0.0029630314,0.000059452923,0.00037524037,0.98771036,0.001670491,0.0029565308],"study_design_scores_gemma":[0.00090782373,0.00039776976,0.0006287558,0.0014500241,0.00069234346,0.00029997458,0.00093057,0.000002216749,0.0045719943,0.98946494,0.00024149579,0.00041209752],"about_ca_topic_score_codex":0.000003862426,"about_ca_topic_score_gemma":0.000007521727,"teacher_disagreement_score":0.012178437,"about_ca_system_score_codex":0.00006354475,"about_ca_system_score_gemma":0.0003251635,"threshold_uncertainty_score":0.9997914},"labels":[],"label_agreement":null},{"id":"W2996084168","doi":"10.1002/jgt.22530","title":"Graph homomorphism reconfiguration and frozen H‐colorings","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; National Research Foundation of Korea; Kyungpook National University","keywords":"Combinatorics; Mathematics; Graph coloring; Homomorphism; Discrete mathematics; Edge coloring; Vertex (graph theory); Nondeterministic algorithm; Graph; Fractional coloring; Graph power; Line graph","score_opus":0.012260161328930238,"score_gpt":0.2509191087115379,"score_spread":0.23865894738260765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996084168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82082343,0.0016341527,0.1699344,0.0008418745,0.0008397986,0.00026145575,0.0000021202027,0.000051619474,0.0056111347],"genre_scores_gemma":[0.9908562,0.00035115873,0.007932459,0.00021456389,0.00006557351,0.0000032678197,3.7770283e-7,0.00001549516,0.0005609096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982999,0.00033211883,0.0004183503,0.0002394355,0.00042546305,0.00028475147],"domain_scores_gemma":[0.9982598,0.0004895617,0.0003938501,0.0004163239,0.00026588267,0.00017462637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00242947,0.00014898603,0.00029203593,0.00069935934,0.000111578964,0.00012983722,0.0008417282,0.00007722776,0.00007586267],"category_scores_gemma":[0.0001221584,0.00012139792,0.00016525779,0.0005831197,0.00016350303,0.0013099893,0.00012682771,0.00043368782,0.00003398491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001876244,0.00004903503,0.0018959381,0.000019848207,0.00007836605,0.00004624727,0.000628702,0.00003894924,0.016019244,0.9576519,0.00020281698,0.023181299],"study_design_scores_gemma":[0.00077356416,0.0005026411,0.004883034,0.000060047867,0.000011417997,0.00034382642,0.00017845238,0.0001010155,0.004287489,0.9871918,0.0015006418,0.00016609556],"about_ca_topic_score_codex":0.000001294692,"about_ca_topic_score_gemma":7.1778436e-7,"teacher_disagreement_score":0.17003275,"about_ca_system_score_codex":0.00002623432,"about_ca_system_score_gemma":0.00005999649,"threshold_uncertainty_score":0.49504635},"labels":[],"label_agreement":null},{"id":"W3005130258","doi":"10.1002/jgt.22665","title":"Drawings of complete graphs in the projective plane","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Projective test; Projective plane; Real projective plane; Pencil (optics); Mathematics; Blocking set; Plane (geometry); Combinatorics; Geometry; Art; Computer science; Projective space; Pure mathematics; Collineation; Physics; Optics","score_opus":0.016653585679728317,"score_gpt":0.24803122593837826,"score_spread":0.23137764025864993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005130258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6849951,0.0012453195,0.31020382,0.0012071802,0.0005076479,0.00009916285,0.0000035493013,0.000006618371,0.0017316098],"genre_scores_gemma":[0.9930966,0.000032857275,0.006455531,0.00034774575,0.000043547036,9.475873e-7,0.000001206608,0.0000019219299,0.000019681145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988637,0.00036887804,0.00030166926,0.000084173465,0.00029859575,0.00008301156],"domain_scores_gemma":[0.99887604,0.00046174866,0.00024379483,0.00013904879,0.00025796372,0.000021434867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014569709,0.000056298795,0.0001367718,0.00028466876,0.00004787026,0.000038591614,0.00039181774,0.00002185028,0.000007226581],"category_scores_gemma":[0.00010608593,0.00003819291,0.00011068947,0.00093215297,0.00004405982,0.00022907896,0.000038426722,0.00015822476,7.935829e-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.00005120458,0.00016016614,0.0007036963,0.000013891241,0.000048803366,0.0001028299,0.004485563,0.0011869401,0.0072139255,0.9759008,0.00037576983,0.009756367],"study_design_scores_gemma":[0.00056275947,0.00022864863,0.034201067,0.000060115377,0.000014236935,0.0006104086,0.0007413188,0.00060251175,0.005958569,0.955955,0.0009806633,0.00008469046],"about_ca_topic_score_codex":0.0000019668325,"about_ca_topic_score_gemma":0.0000039089005,"teacher_disagreement_score":0.30810148,"about_ca_system_score_codex":0.000009019017,"about_ca_system_score_gemma":0.0001208468,"threshold_uncertainty_score":0.15574618},"labels":[],"label_agreement":null},{"id":"W3018106679","doi":"10.1002/jgt.22571","title":"Fractional chromatic number of a random subgraph","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Chromatic scale; Combinatorics; Mathematics; Random graph; Graph; Discrete mathematics; Critical graph; Induced subgraph isomorphism problem; Induced subgraph; Windmill graph; Line graph; Graph power; Vertex (graph theory); Voltage graph","score_opus":0.026955815257990026,"score_gpt":0.3007404859135626,"score_spread":0.2737846706555726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018106679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742689,0.00056105223,0.018065657,0.0003809655,0.00055970374,0.00014810353,0.000013217246,0.000026434329,0.005975958],"genre_scores_gemma":[0.9930987,0.00008872006,0.006057133,0.000382333,0.00031027073,0.0000015513597,5.274366e-7,0.000027572669,0.000033222914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789065,0.0003833554,0.00090558815,0.0001157891,0.00052602927,0.00017856309],"domain_scores_gemma":[0.9967284,0.001619269,0.0010271528,0.00020216592,0.00025629057,0.00016672067],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014302197,0.00018062284,0.0006198803,0.00017411321,0.000114416034,0.000015433676,0.0003831343,0.00010538636,0.0010899463],"category_scores_gemma":[0.0011235195,0.00012693563,0.00067593664,0.0003564552,0.00025745638,0.00018822933,0.00005553269,0.0004095187,0.00000497805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018287991,0.00013942039,0.0028317997,0.0002399171,0.00067627034,0.000040742605,0.0032470922,0.000013091009,0.0013026865,0.9859446,0.0028815707,0.00085397635],"study_design_scores_gemma":[0.0021219426,0.00014891155,0.00083518215,0.00009980442,0.00021432228,0.00028278414,0.00051185564,0.000017882001,0.0013240516,0.9937745,0.0005356164,0.00013318345],"about_ca_topic_score_codex":6.5279926e-7,"about_ca_topic_score_gemma":2.2259127e-7,"teacher_disagreement_score":0.018829761,"about_ca_system_score_codex":0.000011725703,"about_ca_system_score_gemma":0.000054167023,"threshold_uncertainty_score":0.9998232},"labels":[],"label_agreement":null},{"id":"W3023596029","doi":"10.1002/jgt.22607","title":"Short rainbow cycles in graphs and matroids","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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":"Douglas College; Simon Fraser University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Matroid; Combinatorics; Rainbow; Conjecture; Mathematics; Generalization; Vertex (graph theory); Binary number; Graph; Graphic matroid; Simple (philosophy); Discrete mathematics; Physics; Arithmetic; Philosophy","score_opus":0.04310353134617261,"score_gpt":0.31715668530282803,"score_spread":0.2740531539566554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023596029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907117,0.0045314496,0.0008478136,0.0003911049,0.0012291427,0.00030204203,0.000031953794,0.000046000416,0.0019087913],"genre_scores_gemma":[0.9909254,0.0016255471,0.0068710158,0.00022561295,0.00023529,0.0000061457827,0.0000021866622,0.0000722558,0.000036549533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690855,0.0006427103,0.0012472022,0.00035672556,0.00051158626,0.00033322448],"domain_scores_gemma":[0.99739176,0.0010000023,0.0007486637,0.0004821959,0.00014650797,0.00023085995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002878834,0.0004670779,0.0011678464,0.00092733826,0.00012232906,0.000086840046,0.0007780938,0.00045640735,0.00004453743],"category_scores_gemma":[0.0006483791,0.00035920503,0.00068986387,0.0002613447,0.00042580956,0.00012056018,0.00074550015,0.0021313622,5.095133e-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.000510186,0.000087516615,0.0053211404,0.00056393945,0.0004994876,0.00029787858,0.0035282609,0.000017623563,0.0002450905,0.98180795,0.0011786727,0.0059422427],"study_design_scores_gemma":[0.000490618,0.000112384725,0.010159173,0.00053158327,0.00023686978,0.00024766257,0.00067768054,0.0000105012,0.00017376375,0.9868883,0.000120666824,0.00035080893],"about_ca_topic_score_codex":0.0000021789635,"about_ca_topic_score_gemma":0.0000039731294,"teacher_disagreement_score":0.006023202,"about_ca_system_score_codex":0.000040655283,"about_ca_system_score_gemma":0.000077758144,"threshold_uncertainty_score":0.999886},"labels":[],"label_agreement":null},{"id":"W3023986409","doi":"10.1002/jgt.22478","title":"Almost all 5‐regular graphs have a 3‐flow","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre of Excellence for Electromaterials Science, Australian Research Council","keywords":"Mathematics; Combinatorics; Conjecture; Discrete mathematics; 1-planar graph; Graph; Chordal graph","score_opus":0.019177075990577764,"score_gpt":0.2784675894635945,"score_spread":0.25929051347301674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023986409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98471516,0.0013461519,0.0012893319,0.00015491979,0.0016307768,0.0002515534,0.000012445147,0.00004138261,0.010558282],"genre_scores_gemma":[0.988771,0.0002996389,0.008673995,0.00063018,0.00023192615,0.0000023534208,0.0000014964638,0.000068639354,0.001320749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753535,0.000427605,0.0008100534,0.0002142936,0.00061121694,0.00040151225],"domain_scores_gemma":[0.99731296,0.00081218436,0.0007750555,0.0006306632,0.00027067278,0.00019847613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026656352,0.0003008749,0.00063540373,0.00042023242,0.0001441779,0.000048664628,0.0006222646,0.00019726473,0.0007421959],"category_scores_gemma":[0.00029823591,0.0002114019,0.00082810345,0.00023650576,0.0002257459,0.00026232147,0.00011917805,0.00060773717,0.000017913275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045177728,0.00012723304,0.0039285272,0.000094300674,0.00063551706,0.00008570121,0.0019080116,0.000023955821,0.0009987816,0.9841703,0.004720687,0.0028551992],"study_design_scores_gemma":[0.0010398586,0.00029789354,0.001303779,0.00013204034,0.00020348263,0.0004071698,0.0004343579,0.00002549267,0.0010222824,0.98854005,0.0063269236,0.00026666542],"about_ca_topic_score_codex":0.0000016018039,"about_ca_topic_score_gemma":0.0000018240733,"teacher_disagreement_score":0.009237533,"about_ca_system_score_codex":0.000030473651,"about_ca_system_score_gemma":0.00004486673,"threshold_uncertainty_score":0.86207193},"labels":[],"label_agreement":null},{"id":"W3026493967","doi":"10.1002/jgt.22855","title":"On the cop number of graphs of high girth","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Girth (graph theory); Odd graph; Ramanujan's sum; Upper and lower bounds; Discrete mathematics; Bounded function; Conjecture; Degree (music); Graph; Exponent; Chordal graph; 1-planar graph","score_opus":0.02201858569347133,"score_gpt":0.2863006391288283,"score_spread":0.264282053435357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026493967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945296,0.000082706036,0.0004858622,0.00037452154,0.00015426023,0.00013527839,0.000044489403,0.000007646964,0.004185659],"genre_scores_gemma":[0.99902433,0.000027516111,0.00055953785,0.00014807183,0.000020194353,0.000012680644,7.3905215e-7,0.000017151067,0.00018976488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817747,0.00058975024,0.00060393766,0.00008004367,0.00042672912,0.0001220964],"domain_scores_gemma":[0.9960197,0.0023744698,0.0010167012,0.00039206984,0.00015366705,0.000043395015],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002818919,0.00010866352,0.00031769238,0.00019273836,0.00019274722,0.000005160093,0.0005326032,0.000031502805,0.0015863463],"category_scores_gemma":[0.00024163748,0.000070317394,0.0003959709,0.000533379,0.0002552268,0.000044304965,0.00006523153,0.00039639487,0.0000029287999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002969174,0.00041864513,0.0002740035,0.000025206746,0.0001728873,0.0000030041174,0.0005664899,0.00003259465,0.001237129,0.9933302,0.003412899,0.00023003541],"study_design_scores_gemma":[0.00037859724,0.00020313042,0.00040953595,0.000032629432,0.00008764329,0.00007033008,0.0012474528,0.0000012100543,0.0037564037,0.9933223,0.00042369773,0.00006703323],"about_ca_topic_score_codex":0.000002201334,"about_ca_topic_score_gemma":5.256606e-7,"teacher_disagreement_score":0.004494768,"about_ca_system_score_codex":0.000011630627,"about_ca_system_score_gemma":0.000037608792,"threshold_uncertainty_score":0.99932635},"labels":[],"label_agreement":null},{"id":"W3034049481","doi":"10.1002/jgt.23000","title":"Clique‐width: Harnessing the power of atoms","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Grantová Agentura České Republiky; Leverhulme Trust; Univerzita Karlova v Praze","keywords":"Combinatorics; Mathematics; Split graph; Induced subgraph; Bounded function; Discrete mathematics; Clique graph; Block graph; Graph; Cograph; Chordal graph; Line graph; Graph power; 1-planar graph","score_opus":0.024456856401062845,"score_gpt":0.3125402169419337,"score_spread":0.28808336054087086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034049481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57530546,0.0015790418,0.41649786,0.0024816764,0.0012674606,0.0001881916,0.000003847031,0.000108093656,0.0025683658],"genre_scores_gemma":[0.99633455,0.00013672138,0.0030112588,0.00018393682,0.00006153872,0.0000021555563,2.0424785e-7,0.000016709893,0.00025294657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752134,0.00071338203,0.0005440127,0.00016736845,0.00069966237,0.00035423826],"domain_scores_gemma":[0.99695253,0.0014099205,0.00052228966,0.00064715056,0.00035555285,0.0001125524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064053945,0.00013047918,0.00027675318,0.0006665094,0.00018975945,0.00007899258,0.0020035217,0.000058814938,0.000031249238],"category_scores_gemma":[0.00044935924,0.000079329715,0.00033558812,0.0019943374,0.00042985892,0.00062545517,0.00032194564,0.00049472036,0.000025418729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011443041,0.000049221144,0.000770813,0.0000138383,0.00009106016,0.000097403165,0.0021782096,0.000150584,0.0033810001,0.9717853,0.0009381778,0.020429952],"study_design_scores_gemma":[0.000310488,0.00017915833,0.0053053224,0.00008041571,0.000009182461,0.00012243867,0.00045920393,0.00021335839,0.004588426,0.9873974,0.0012378653,0.00009676896],"about_ca_topic_score_codex":5.479299e-7,"about_ca_topic_score_gemma":4.600929e-7,"teacher_disagreement_score":0.42102906,"about_ca_system_score_codex":0.00002074325,"about_ca_system_score_gemma":0.00011804231,"threshold_uncertainty_score":0.3723075},"labels":[],"label_agreement":null},{"id":"W3037312983","doi":"10.1002/jgt.22849","title":"Flexible list colorings in graphs with special degeneracy conditions","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission; Univerzita Karlova v Praze","keywords":"Degeneracy (biology); Combinatorics; Treewidth; Mathematics; List coloring; Planar graph; Graph; Discrete mathematics; 1-planar graph; Chordal graph; Degree (music); Indifference graph; Pathwidth; Graph power; Line graph","score_opus":0.015585480340653685,"score_gpt":0.27887344906230044,"score_spread":0.2632879687216467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037312983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9208137,0.0006627328,0.0664089,0.0009609335,0.0009869699,0.00032407956,0.000020669167,0.00006647951,0.009755571],"genre_scores_gemma":[0.9934018,0.000049688875,0.005552005,0.00029916162,0.00017144118,0.00003030517,0.0000015573393,0.000019686478,0.00047434695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747896,0.00064842094,0.00045162372,0.00024231077,0.00078327983,0.0003954096],"domain_scores_gemma":[0.998444,0.0004506091,0.00036271955,0.00039088793,0.00018920776,0.00016253618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024429394,0.00015213696,0.00028473837,0.0014442196,0.00044259278,0.00008769787,0.0015020903,0.000028423494,0.00035397496],"category_scores_gemma":[0.00007672849,0.00013060324,0.00017602045,0.0023835904,0.00027268357,0.00084930105,0.00032520897,0.00085008336,0.0000043544674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047196168,0.00022117909,0.002354102,0.000005480991,0.000046369114,0.00043770994,0.00065129047,0.002611669,0.0012495054,0.9895513,0.0007149824,0.001684471],"study_design_scores_gemma":[0.0012354582,0.0009022611,0.0036371981,0.00002468361,0.000009993067,0.00068927044,0.00063093763,0.00005162282,0.0017936203,0.9854829,0.005352069,0.00019002878],"about_ca_topic_score_codex":0.000004403765,"about_ca_topic_score_gemma":0.000011624302,"teacher_disagreement_score":0.072588146,"about_ca_system_score_codex":0.00012605495,"about_ca_system_score_gemma":0.00023195108,"threshold_uncertainty_score":0.53258455},"labels":[],"label_agreement":null},{"id":"W3081847610","doi":"10.1002/jgt.22827","title":"Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Greedy coloring; Treewidth; Edge coloring; Discrete mathematics; Graph; Complete coloring; Planar graph; List coloring; Graph power; Pathwidth; Line graph","score_opus":0.014007296998877249,"score_gpt":0.24655203865994169,"score_spread":0.23254474166106442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081847610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785784,0.0016716308,0.017032132,0.0009053297,0.00030888923,0.00043156,0.0000139374915,0.0001226871,0.00093542464],"genre_scores_gemma":[0.98906654,0.000492176,0.009645277,0.00033295687,0.000041618958,0.00006374221,0.0000016563644,0.00004706118,0.00030899933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956083,0.0010507238,0.00071486767,0.0005377579,0.0013541759,0.0007341733],"domain_scores_gemma":[0.99658656,0.0010536629,0.0008383971,0.00069404684,0.00039167207,0.00043565483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028489912,0.00034816927,0.0005916024,0.002175521,0.0008445078,0.00019672493,0.00210311,0.00007527397,0.000056462366],"category_scores_gemma":[0.00018753555,0.00028262573,0.0002623696,0.0040019015,0.0006486767,0.0011872415,0.00075549196,0.001284336,0.0000018985701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005370405,0.00061636424,0.011394714,0.000048675618,0.00062332064,0.0012645037,0.0022311965,0.00038934444,0.013177336,0.95595795,0.00085004425,0.008076167],"study_design_scores_gemma":[0.004898251,0.0069243335,0.03516745,0.00007463222,0.00010337516,0.001825353,0.0021091828,0.00012481012,0.0025483884,0.93602306,0.009486512,0.0007146841],"about_ca_topic_score_codex":0.000011713741,"about_ca_topic_score_gemma":0.000008728184,"teacher_disagreement_score":0.023772735,"about_ca_system_score_codex":0.00012336181,"about_ca_system_score_gemma":0.00024445017,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W3082098889","doi":"10.1002/jgt.22786","title":"Graph colorings with restricted bicolored subgraphs: II. The graph coloring game","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Greedy coloring; Cartesian product; Complete coloring; Discrete mathematics; Fractional coloring; Bounded function; List coloring; Edge coloring; Graph; Corollary; Brooks' theorem; Graph power; Line graph","score_opus":0.023175980303014886,"score_gpt":0.262850474724748,"score_spread":0.2396744944217331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082098889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99032646,0.0023231907,0.0013634614,0.000594986,0.0010791093,0.00034701911,0.000015589883,0.000095811105,0.0038543679],"genre_scores_gemma":[0.9944674,0.00092974474,0.0032198993,0.0004926784,0.0002901014,0.000023064218,0.0000025932022,0.00009372059,0.00048080372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956543,0.0009619288,0.0012158949,0.0004139099,0.0010444629,0.000709531],"domain_scores_gemma":[0.99400693,0.0024100267,0.0013422762,0.0009377369,0.0010147054,0.0002883124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024423716,0.00051983685,0.00090899214,0.00088309665,0.00109402,0.00014587118,0.0010808851,0.0002663011,0.00016121032],"category_scores_gemma":[0.0010755309,0.00030319128,0.0008842433,0.0026508458,0.00096103846,0.0003829769,0.00029506074,0.0013229514,0.0000014647104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015278658,0.00032930874,0.0026607607,0.00008600183,0.0013320027,0.00059434114,0.0032618407,0.000049677587,0.0029394638,0.9845014,0.0020234347,0.00069390645],"study_design_scores_gemma":[0.0020047266,0.0008704356,0.0078947665,0.00027755284,0.00062427483,0.0013975473,0.003088139,0.0000028880643,0.0052287453,0.97452575,0.0036502376,0.00043494857],"about_ca_topic_score_codex":0.0000051518145,"about_ca_topic_score_gemma":0.000025212123,"teacher_disagreement_score":0.009975658,"about_ca_system_score_codex":0.000059723072,"about_ca_system_score_gemma":0.00024010116,"threshold_uncertainty_score":0.999942},"labels":[],"label_agreement":null},{"id":"W3088594123","doi":"10.1002/jgt.22621","title":"On the mean subtree order of graphs under edge addition","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Guelph","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Counterexample; Order (exchange); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.05114219761848536,"score_gpt":0.28047953772127177,"score_spread":0.2293373401027864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088594123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97281575,0.00016156922,0.015197448,0.0047565033,0.00013994935,0.00024673739,0.000040142462,0.000030378202,0.00661152],"genre_scores_gemma":[0.9981011,0.000038137827,0.0006157756,0.0010932011,0.0000793713,0.0000058771443,0.0000016471794,0.00002109556,0.000043805554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861526,0.00036136288,0.00049431506,0.000102182945,0.0002942835,0.00013261741],"domain_scores_gemma":[0.9968344,0.0019469914,0.0006052482,0.00027300743,0.00024493242,0.00009542558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012765223,0.00013399553,0.00025908992,0.00014826847,0.0001289886,0.000015098536,0.00039038804,0.00006345429,0.00063962676],"category_scores_gemma":[0.0005126146,0.000081655955,0.0003283167,0.00059283845,0.00022969603,0.00008900996,0.000025527446,0.00034782474,0.000013079976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019999212,0.00016160237,0.000020418307,0.000023659928,0.00014608275,0.0000022289348,0.0008631867,0.00001877782,0.002368956,0.9867988,0.0090329815,0.0003632745],"study_design_scores_gemma":[0.00034550545,0.0002221784,0.00025363016,0.00006445397,0.000117516756,0.000014960137,0.0013277319,0.000007225649,0.0037334287,0.99340945,0.00041855415,0.00008535076],"about_ca_topic_score_codex":4.209147e-7,"about_ca_topic_score_gemma":0.000001921383,"teacher_disagreement_score":0.025285337,"about_ca_system_score_codex":0.000007848199,"about_ca_system_score_gemma":0.000033976572,"threshold_uncertainty_score":0.7003464},"labels":[],"label_agreement":null},{"id":"W3093587179","doi":"10.1002/jgt.22657","title":"Edge clique covers in graphs with independence number two","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","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; Université de Sherbrooke; Université de Montréal; Dawson College; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Independence number; Discrete mathematics; Clique; Conjecture; Chordal graph; Upper and lower bounds; Bounded function; Split graph; Induced subgraph; Graph; 1-planar graph","score_opus":0.01628610299619613,"score_gpt":0.3005152395070341,"score_spread":0.284229136510838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093587179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97577685,0.0004042085,0.0023224177,0.00009548575,0.00053680944,0.000095732204,0.000005579561,0.000017001552,0.020745927],"genre_scores_gemma":[0.9938248,0.00019156025,0.0050941333,0.00037224797,0.00010544645,0.0000024043252,5.8296035e-7,0.00003434216,0.00037448527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977407,0.0005883646,0.00063406635,0.00019648815,0.00053667225,0.0003037068],"domain_scores_gemma":[0.99765664,0.0009754119,0.0004933978,0.00037810404,0.00036636126,0.00013009856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002191702,0.00022006819,0.00048535416,0.0002906717,0.000120157856,0.000041956668,0.00037251884,0.00014090975,0.0005405838],"category_scores_gemma":[0.00047245086,0.0001539551,0.0002867272,0.0006241596,0.0002572226,0.00028075848,0.00008530922,0.00087863556,0.0000027819874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005459957,0.00014426751,0.022696268,0.000041358424,0.00018889547,0.0009169225,0.0014605119,0.000029137918,0.00043910905,0.9721116,0.00043749722,0.0009884732],"study_design_scores_gemma":[0.0016299706,0.0001032724,0.0034213434,0.0002355814,0.00007982878,0.001665861,0.0011139715,0.0000017639723,0.00262194,0.9885118,0.0004075279,0.00020713807],"about_ca_topic_score_codex":0.000004103294,"about_ca_topic_score_gemma":0.000050266302,"teacher_disagreement_score":0.020371443,"about_ca_system_score_codex":0.00004581158,"about_ca_system_score_gemma":0.00019050989,"threshold_uncertainty_score":0.62781066},"labels":[],"label_agreement":null},{"id":"W3094347955","doi":"10.1002/jgt.22633","title":"Good orientations of unions of edge‐disjoint spanning trees","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Centre National de la Recherche Scientifique; Danmarks Frie Forskningsfond; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Disjoint sets; Spanning tree; Enhanced Data Rates for GSM Evolution; Minimum degree spanning tree; Computer science","score_opus":0.03150365119484021,"score_gpt":0.30037943294383507,"score_spread":0.26887578174899485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094347955","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.11991533,0.00078121794,0.8760013,0.0012661227,0.00023222785,0.00010480223,0.000010411551,0.000021646008,0.0016669533],"genre_scores_gemma":[0.96879417,0.000073295705,0.03092352,0.000102135076,0.000058052177,0.0000013116719,4.7620833e-7,0.000010822094,0.000036246627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807847,0.00038975346,0.0006664185,0.00015391405,0.0005043195,0.00020714357],"domain_scores_gemma":[0.9976849,0.000609539,0.0006869761,0.00032778797,0.0004893832,0.00020142278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012470783,0.00011448592,0.0003465392,0.0004675375,0.00008519297,0.000021406258,0.0011016628,0.00004065709,0.000033506734],"category_scores_gemma":[0.00047692246,0.00009442228,0.00030125803,0.0013886538,0.0003134776,0.00056094484,0.00019228371,0.00032506278,0.000002635621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012164475,0.00012063152,0.0014452019,0.000030448551,0.000112614434,0.00002059389,0.0036001764,0.0011829596,0.026140928,0.9598421,0.0001289144,0.0072538177],"study_design_scores_gemma":[0.0010592355,0.0012204696,0.0066929893,0.00016750267,0.000049880244,0.000068924724,0.0025707867,0.0007828578,0.048191056,0.93847257,0.00054190936,0.00018180437],"about_ca_topic_score_codex":0.0000013262269,"about_ca_topic_score_gemma":0.0000010245416,"teacher_disagreement_score":0.8488788,"about_ca_system_score_codex":0.000015109413,"about_ca_system_score_gemma":0.00014778253,"threshold_uncertainty_score":0.38504288},"labels":[],"label_agreement":null},{"id":"W3096569464","doi":"10.1002/jgt.22939","title":"Strong 3‐Flow Conjecture for projective planar graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","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 Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Discrete mathematics; Graph","score_opus":0.028590567937119078,"score_gpt":0.31561184669941855,"score_spread":0.2870212787622995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096569464","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.033563547,0.00061487337,0.9625175,0.00085024146,0.0009635395,0.00057728356,0.000035075907,0.00017135673,0.0007065812],"genre_scores_gemma":[0.92368275,0.0002696639,0.07431705,0.00037154974,0.0004048366,0.00007526963,0.000007724262,0.00008035501,0.00079080876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978337,0.00037653392,0.00042754755,0.00028504108,0.0005399375,0.0005372286],"domain_scores_gemma":[0.99725336,0.0013738318,0.0003627092,0.0004366613,0.00039430545,0.00017913205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032948328,0.00019593629,0.00034935793,0.0012803905,0.0002450164,0.00009871727,0.0014167773,0.00009608501,0.000009735336],"category_scores_gemma":[0.00039851633,0.00015025694,0.00043133856,0.0017350251,0.00020867054,0.000676617,0.000109733504,0.00048358654,0.000012133362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038664736,0.000051129362,0.0002473909,0.00003119878,0.00019923024,0.00010433224,0.0011008945,0.0007070097,0.001132512,0.9703829,0.0026941826,0.022962531],"study_design_scores_gemma":[0.00096170825,0.00071416807,0.0006894136,0.000051770814,0.000018262333,0.00014102556,0.00048118056,0.0014065198,0.0015744041,0.9922836,0.001502054,0.00017591174],"about_ca_topic_score_codex":6.17608e-7,"about_ca_topic_score_gemma":0.0000017555521,"teacher_disagreement_score":0.8901192,"about_ca_system_score_codex":0.000041232448,"about_ca_system_score_gemma":0.00016490862,"threshold_uncertainty_score":0.61273},"labels":[],"label_agreement":null},{"id":"W3107865975","doi":"10.1002/jgt.22904","title":"A density bound for triangle‐free 4‐critical graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","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","keywords":"Klein bottle; Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Disjoint sets; Torus; Chordal graph; Projective plane; Discrete mathematics; Graph","score_opus":0.027147221033866072,"score_gpt":0.31440465452162353,"score_spread":0.28725743348775745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107865975","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.08386403,0.0018940982,0.9088265,0.0026593104,0.0017019018,0.000357129,0.000030540796,0.00006595289,0.00060055143],"genre_scores_gemma":[0.9608771,0.00003776185,0.037857484,0.0007648237,0.00015534366,0.00004543877,9.1694494e-7,0.000030752988,0.00023038412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663377,0.0010611671,0.00057433354,0.0002953314,0.0009183677,0.0005170333],"domain_scores_gemma":[0.9952052,0.0029537773,0.0003098758,0.0008217428,0.00044889393,0.00026048027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072956164,0.0001700521,0.0004129949,0.00086409855,0.00078754255,0.00012961387,0.0028633338,0.000047209065,0.00007697392],"category_scores_gemma":[0.002112957,0.0001525632,0.0006645375,0.0010681156,0.00035351928,0.00066270016,0.0007509216,0.00071524223,0.0000023497448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000867184,0.00020127547,0.00010967466,0.000017114402,0.000084508094,0.00015526106,0.00036626132,0.000049063463,0.0016209469,0.9869627,0.0023728341,0.0071931924],"study_design_scores_gemma":[0.0015278398,0.0010765699,0.00020587945,0.000012148206,0.000027412843,0.0007349076,0.00030645766,0.00018546186,0.0010137978,0.9908265,0.00391226,0.000170792],"about_ca_topic_score_codex":8.689886e-7,"about_ca_topic_score_gemma":0.0000013008193,"teacher_disagreement_score":0.8770131,"about_ca_system_score_codex":0.00009220521,"about_ca_system_score_gemma":0.00021581403,"threshold_uncertainty_score":0.6221346},"labels":[],"label_agreement":null},{"id":"W3118825047","doi":"10.1002/jgt.22821","title":"Covering hypergraphs are Eulerian","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Eulerian path; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Context (archaeology); Euler's formula; Rank (graph theory); Discrete mathematics; Lagrangian; Computer science; Pure mathematics","score_opus":0.004984631025252905,"score_gpt":0.1670494334548476,"score_spread":0.1620648024295947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118825047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983944,0.004292767,0.0015116644,0.000036904956,0.0030368469,0.000077825396,0.000018904408,0.00009959568,0.006981494],"genre_scores_gemma":[0.999461,0.00008249774,0.00005655269,0.00007770838,0.000155478,0.000007516712,7.816483e-7,0.000038119222,0.00012036638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987002,0.00026498575,0.0004249752,0.0000825886,0.0003055325,0.00022173666],"domain_scores_gemma":[0.9993414,0.00010243866,0.00021037692,0.00019671005,0.00004394676,0.000105104526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014263474,0.00014701336,0.00029125705,0.00043290184,0.0002072432,0.000028512135,0.00037233206,0.000036812373,0.00038683604],"category_scores_gemma":[0.000023008935,0.00013910585,0.00032381486,0.0004367883,0.00004833348,0.00016444655,0.00004342905,0.00047002034,0.0000064825317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013976182,0.00045365916,0.01628832,0.0005098569,0.0025759642,0.0015816326,0.00672715,0.24294437,0.10278281,0.58630437,0.022904139,0.01553009],"study_design_scores_gemma":[0.0034054639,0.0009560627,0.01246523,0.00032197626,0.00030229584,0.00471474,0.023146506,0.0006156348,0.0076328805,0.76953185,0.17548633,0.0014210428],"about_ca_topic_score_codex":6.8143396e-7,"about_ca_topic_score_gemma":7.320953e-7,"teacher_disagreement_score":0.24232875,"about_ca_system_score_codex":0.000046497506,"about_ca_system_score_gemma":0.000013922936,"threshold_uncertainty_score":0.5672572},"labels":[],"label_agreement":null},{"id":"W3153914952","doi":"10.1002/jgt.22906","title":"Triangle‐free graphs with large chromatic number and no induced wheel","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Windmill graph; Wheel graph; Vertex (graph theory); Graph; Petersen graph; Discrete mathematics; Line graph; Graph power","score_opus":0.012954920009154278,"score_gpt":0.26245799401051345,"score_spread":0.24950307400135918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153914952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91566724,0.0010958795,0.07414457,0.0006732773,0.0007104509,0.00041687957,0.000018420455,0.000089327856,0.0071839825],"genre_scores_gemma":[0.98977923,0.00005112324,0.009451052,0.00036286464,0.000055734203,0.000019237108,5.3933496e-7,0.000028130538,0.0002520899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674106,0.0010525681,0.00047688928,0.00027751256,0.0009919455,0.00046004387],"domain_scores_gemma":[0.99764377,0.0006242393,0.0004975893,0.00074540364,0.00025175427,0.00023722423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044048657,0.00020248836,0.000418503,0.00062521157,0.0004968252,0.00011326714,0.0018174258,0.00004299007,0.0002179086],"category_scores_gemma":[0.00026882894,0.00015353052,0.00019621689,0.0013097434,0.00016666221,0.0008245018,0.0007270905,0.00083951856,0.0000098930805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088630687,0.0003505774,0.0018548818,0.0000404007,0.00026161052,0.00037450003,0.0015700819,0.00002457668,0.0034930455,0.98465663,0.0017108702,0.004776533],"study_design_scores_gemma":[0.003465052,0.0012991746,0.0016408872,0.000049604278,0.000030470774,0.0017155549,0.0006015802,0.00015971306,0.00043088183,0.98873794,0.0016136047,0.000255558],"about_ca_topic_score_codex":0.0000014425784,"about_ca_topic_score_gemma":0.00000195927,"teacher_disagreement_score":0.07411202,"about_ca_system_score_codex":0.000054217347,"about_ca_system_score_gemma":0.0001480373,"threshold_uncertainty_score":0.62607926},"labels":[],"label_agreement":null},{"id":"W3165244533","doi":"10.1002/jgt.22685","title":"The list linear arboricity of graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Arboricity; Mathematics; Combinatorics; Conjecture; Degeneracy (biology); Dense graph; Graph; Discrete mathematics; Pathwidth; Planar graph; Line graph; Biology","score_opus":0.01652637430472045,"score_gpt":0.2920695333689219,"score_spread":0.27554315906420146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165244533","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.23510496,0.014458458,0.74105185,0.0023897043,0.0018827375,0.00017160998,0.0000070606898,0.000050559738,0.004883064],"genre_scores_gemma":[0.97976553,0.0018626595,0.017653784,0.00018133725,0.00011432683,0.0000020975635,2.5895585e-7,0.000016156811,0.00040387333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974101,0.0008168849,0.00059480243,0.00017483465,0.0006904421,0.00031289505],"domain_scores_gemma":[0.9955105,0.002068804,0.0005285279,0.0007482575,0.0009982615,0.00014561694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037197468,0.000128509,0.0002873016,0.00027449016,0.00025105022,0.00007258436,0.0016997894,0.000055811444,0.000019142464],"category_scores_gemma":[0.0010900297,0.000082554885,0.00041993317,0.0014982425,0.0004479785,0.00041389233,0.00027809266,0.0005188414,0.0000032115104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010929312,0.00010126996,0.00052994274,0.000013865539,0.000104581115,0.00011531821,0.00023040539,0.000067110384,0.0065694535,0.98052514,0.00028474163,0.01134888],"study_design_scores_gemma":[0.000339165,0.00017218453,0.0011067679,0.00004842176,0.00001367091,0.00020298208,0.0001996631,0.00011679087,0.03043209,0.96442276,0.0028516464,0.000093843526],"about_ca_topic_score_codex":0.0000011506112,"about_ca_topic_score_gemma":0.0000050306917,"teacher_disagreement_score":0.74466056,"about_ca_system_score_codex":0.00002086135,"about_ca_system_score_gemma":0.00026976902,"threshold_uncertainty_score":0.33664903},"labels":[],"label_agreement":null},{"id":"W3181935061","doi":"10.1002/jgt.22956","title":"Adaptable and conflict colouring multigraphs with no cycles of length three or four","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Combinatorics; Integer (computer science); Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Graph; Artificial intelligence","score_opus":0.047709428510804466,"score_gpt":0.2921879343224165,"score_spread":0.24447850581161207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181935061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89616466,0.00092549284,0.10153453,0.00016959866,0.00020911967,0.00023244055,0.000005890036,0.000081865765,0.0006764109],"genre_scores_gemma":[0.9766656,0.0007029501,0.02221052,0.000043614204,0.000050553812,0.0000055179567,2.0713067e-7,0.000024402943,0.0002966419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806714,0.00024855076,0.00044803854,0.00023479758,0.00059615506,0.0004053096],"domain_scores_gemma":[0.99727744,0.001226665,0.00044431433,0.0004172162,0.00044125298,0.0001930924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002612514,0.00018028675,0.0004122178,0.0008891538,0.00016550484,0.000067539775,0.0009367769,0.000062677806,0.000018404106],"category_scores_gemma":[0.00028309834,0.00011698113,0.00013755722,0.0013235343,0.00041921143,0.00070279173,0.00022763119,0.00037644533,0.0000062387494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0070787584,0.0003599214,0.04207063,0.00037396603,0.0012141165,0.0016961196,0.0038648744,0.002595964,0.026780806,0.84405017,0.0007826913,0.06913201],"study_design_scores_gemma":[0.0069433725,0.005466376,0.08905209,0.0010554732,0.00011483295,0.0015668647,0.0019068908,0.008325829,0.015017418,0.86711764,0.002542779,0.00089042494],"about_ca_topic_score_codex":0.0000063365524,"about_ca_topic_score_gemma":0.000025731342,"teacher_disagreement_score":0.080500945,"about_ca_system_score_codex":0.00001411869,"about_ca_system_score_gemma":0.00012069574,"threshold_uncertainty_score":0.4770352},"labels":[],"label_agreement":null},{"id":"W3184514170","doi":"10.1002/jgt.22880","title":"Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Joint Information Systems Committee; Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Degeneracy (biology); Combinatorics; Mathematics; Bipartite graph; Complete bipartite graph; Chromatic polynomial; Bounded function; Chromatic scale; Tree (set theory); Discrete mathematics; Induced subgraph; Graph","score_opus":0.049676968357494494,"score_gpt":0.3495251988836877,"score_spread":0.29984823052619325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184514170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996316,0.00021684005,0.0010252383,0.00011151123,0.00078817253,0.00023303049,0.000016745926,0.000025577378,0.0012668888],"genre_scores_gemma":[0.9942925,0.000018977438,0.0048736082,0.00023227293,0.0004151141,0.00002080001,0.0000011732659,0.000046570865,0.00009899686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980684,0.0005438828,0.0006298206,0.00016692665,0.00032131205,0.00026966387],"domain_scores_gemma":[0.9977393,0.0011031004,0.0006502286,0.0002676728,0.000092103444,0.00014755137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034279344,0.00019465899,0.0004552994,0.00031410676,0.0008137758,0.00006139286,0.00040087808,0.000079567515,0.00016621873],"category_scores_gemma":[0.0004185766,0.00015705601,0.0002939777,0.00021099043,0.00013449854,0.00024574588,0.00015462589,0.0004548908,1.8220223e-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.002208596,0.00039751205,0.001283112,0.00024522093,0.00063954183,0.00006468872,0.013264652,0.000007667662,0.016362293,0.9438685,0.0084499065,0.013208306],"study_design_scores_gemma":[0.0015171019,0.0008803579,0.00064556225,0.000037646583,0.00016124672,0.0007820531,0.002523653,0.000043151722,0.0007619686,0.99149793,0.00093866774,0.00021067294],"about_ca_topic_score_codex":0.000002100125,"about_ca_topic_score_gemma":0.000003113881,"teacher_disagreement_score":0.047629416,"about_ca_system_score_codex":0.00006222755,"about_ca_system_score_gemma":0.00007778113,"threshold_uncertainty_score":0.6404558},"labels":[],"label_agreement":null},{"id":"W3186740737","doi":"10.1002/jgt.22829","title":"Polynomial bounds for chromatic number II: Excluding a star‐forest","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Star (game theory); Vertex (graph theory); Clique number; Chromatic scale; Statement (logic); Graph; Clique; Discrete mathematics","score_opus":0.02395129843768923,"score_gpt":0.3024701847071215,"score_spread":0.2785188862694323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186740737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65663403,0.00082212535,0.33890453,0.00071843056,0.0014813408,0.000378238,0.0000197889,0.00006519804,0.000976329],"genre_scores_gemma":[0.9740757,0.000028120054,0.024680875,0.00029070678,0.0002362015,0.000045401062,0.0000013134219,0.000031441676,0.00061025063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973644,0.0005079078,0.0005873622,0.00024862733,0.00077472813,0.0005169618],"domain_scores_gemma":[0.9977045,0.0008746756,0.0005328085,0.00048377068,0.00021281275,0.00019144808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004512319,0.00017963111,0.00035563458,0.00053191674,0.0011622086,0.00012661934,0.0019267455,0.00003907051,0.00017458147],"category_scores_gemma":[0.0002750119,0.00016086383,0.00039803932,0.0009559134,0.00018860969,0.0007703078,0.0007424694,0.00057689747,0.0000045390784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016716034,0.00063611596,0.0019008663,0.00010307942,0.0004620961,0.0002368707,0.004971266,0.002230114,0.0082278885,0.938533,0.024840096,0.016187001],"study_design_scores_gemma":[0.0019338535,0.0014508328,0.0006329241,0.00004478036,0.00003365055,0.0010216879,0.0007796903,0.0020939629,0.0006528466,0.96353596,0.027499598,0.00032022543],"about_ca_topic_score_codex":0.0000017602965,"about_ca_topic_score_gemma":0.0000018270804,"teacher_disagreement_score":0.31744167,"about_ca_system_score_codex":0.0001738169,"about_ca_system_score_gemma":0.00026681,"threshold_uncertainty_score":0.8938886},"labels":[],"label_agreement":null},{"id":"W3193424040","doi":"10.1002/jgt.22862","title":"Polynomial bounds for chromatic number. III. Excluding a double star","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Star (game theory); Conjecture; Chromatic scale; Clique; Stars; Tree (set theory); Polynomial; Function (biology); Chromatic polynomial; Discrete mathematics; Physics; Astrophysics","score_opus":0.03039541251985209,"score_gpt":0.3161732757768858,"score_spread":0.2857778632570337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193424040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52158093,0.0010901344,0.47145212,0.0007553369,0.0020128,0.0005718739,0.000014608188,0.00009254105,0.0024296253],"genre_scores_gemma":[0.97491497,0.000025550444,0.023755884,0.00023910735,0.00023240033,0.000053924025,0.0000011044934,0.00003115059,0.00074592273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745,0.00041584275,0.00059914176,0.00025321537,0.0007707141,0.0005111072],"domain_scores_gemma":[0.9978052,0.00076616596,0.0005468376,0.0004889556,0.0002023042,0.0001905587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004985401,0.00017436003,0.00037450204,0.0005275013,0.0008009619,0.00015122662,0.0020032707,0.000037941143,0.00019783921],"category_scores_gemma":[0.00009877735,0.00015890332,0.00042836028,0.0008950432,0.00016250477,0.00081638317,0.0005249198,0.00055723893,0.000005874285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038599642,0.00045347988,0.000291705,0.000091750546,0.00042076525,0.00019113542,0.004598226,0.0010925482,0.011730014,0.9492121,0.0140536055,0.014004723],"study_design_scores_gemma":[0.005214273,0.0010877621,0.0001279131,0.000047141344,0.000039146835,0.0010107828,0.0012858609,0.001447541,0.002613373,0.9674505,0.01932133,0.00035438777],"about_ca_topic_score_codex":0.0000034407055,"about_ca_topic_score_gemma":0.0000013043751,"teacher_disagreement_score":0.453334,"about_ca_system_score_codex":0.00018603323,"about_ca_system_score_gemma":0.00025258985,"threshold_uncertainty_score":0.6479889},"labels":[],"label_agreement":null},{"id":"W3195612562","doi":"10.1002/jgt.22890","title":"Orientation‐based edge‐colorings and linear arboricity of multigraphs","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Edge coloring; Combinatorics; Mathematics; Arboricity; Multigraph; Conjecture; Simple (philosophy); Upper and lower bounds; Vertex (graph theory); List coloring; Chromatic scale; Discrete mathematics; Graph; Planar graph","score_opus":0.017925671157843062,"score_gpt":0.28816652436230056,"score_spread":0.2702408532044575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195612562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.672607,0.0008764892,0.3253095,0.000263402,0.00043232334,0.00015783348,0.000008281196,0.00002647737,0.00031868575],"genre_scores_gemma":[0.9729142,0.000044063436,0.0268042,0.00014169147,0.000030390735,0.000008275777,4.1938426e-7,0.000010511315,0.00004622308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978245,0.0005919167,0.00046907144,0.0001978282,0.00068873574,0.00022793593],"domain_scores_gemma":[0.99792325,0.00073963095,0.000544298,0.0003386763,0.00031515304,0.00013901116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029715202,0.000119348995,0.00026717453,0.00090347574,0.0002563586,0.000023233124,0.0009421231,0.000028160825,0.000040463663],"category_scores_gemma":[0.00022983016,0.00010651685,0.00018993202,0.0013771537,0.0002611638,0.00042466584,0.0002783003,0.00048600265,6.0286976e-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.0008893045,0.00045384045,0.008919497,0.00005462272,0.00013356801,0.00010111632,0.0018419438,0.0040563513,0.015354882,0.9541409,0.00012452493,0.013929434],"study_design_scores_gemma":[0.0025374594,0.0017975916,0.010526412,0.00003924226,0.000039313793,0.00015511298,0.0009885753,0.0038730819,0.021868827,0.9561237,0.0017639003,0.0002867525],"about_ca_topic_score_codex":0.0000026983446,"about_ca_topic_score_gemma":4.844931e-7,"teacher_disagreement_score":0.30030718,"about_ca_system_score_codex":0.000036238373,"about_ca_system_score_gemma":0.00012338569,"threshold_uncertainty_score":0.4343631},"labels":[],"label_agreement":null},{"id":"W4207028927","doi":"10.1002/jgt.22796","title":"Asymptotically good edge correspondence colourings","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.012935515915053134,"score_gpt":0.26809266483450434,"score_spread":0.2551571489194512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207028927","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.23707223,0.0017191829,0.7496634,0.0017753895,0.0022211948,0.00028737012,0.000008691645,0.000115855204,0.007136673],"genre_scores_gemma":[0.985836,0.000042901127,0.011788526,0.0006757687,0.00009451069,0.000012441949,2.7043066e-7,0.0000219769,0.0015275509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628454,0.0012367096,0.0005320838,0.00027125364,0.0012113509,0.00046405915],"domain_scores_gemma":[0.99712294,0.0012698005,0.00045000153,0.00058322883,0.00031513436,0.00025887918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060692895,0.0001622908,0.00030088492,0.00077058974,0.00048776995,0.000103874576,0.0031874457,0.00004097986,0.00033707605],"category_scores_gemma":[0.00045723672,0.00014542208,0.00029503394,0.0013591339,0.00025143352,0.00069205515,0.0009898514,0.001091165,0.000024343373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004947647,0.00019838293,0.0005872006,0.0000075406247,0.0000625519,0.00043836606,0.0006165785,0.00083486794,0.003301483,0.9847426,0.0008935316,0.007822148],"study_design_scores_gemma":[0.000754897,0.0012768048,0.0016967269,0.000021618564,0.000014158584,0.0014411907,0.00032790462,0.0003112301,0.0017569592,0.9823789,0.009804051,0.00021556641],"about_ca_topic_score_codex":4.9409414e-7,"about_ca_topic_score_gemma":2.8650942e-7,"teacher_disagreement_score":0.7487638,"about_ca_system_score_codex":0.0001196685,"about_ca_system_score_gemma":0.000291197,"threshold_uncertainty_score":0.593014},"labels":[],"label_agreement":null},{"id":"W4213085510","doi":"10.1002/jgt.20435","title":"Crossing numbers of imbalanced graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","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; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Combinatorics; Mathematics; Crossing number (knot theory); Lemma (botany); Upper and lower bounds; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.008208351662810852,"score_gpt":0.25423736050602413,"score_spread":0.24602900884321327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213085510","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.44556224,0.0005313191,0.5522228,0.00025893413,0.00038765272,0.00002542113,4.166823e-7,0.000010532695,0.001000665],"genre_scores_gemma":[0.9730292,0.00002339365,0.026587257,0.0002538294,0.000060457463,1.1825432e-7,2.8851716e-7,0.0000018792883,0.000043559503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912655,0.00009238522,0.00034024607,0.000079387166,0.00026131247,0.000100139056],"domain_scores_gemma":[0.9990971,0.00011120188,0.00037550394,0.00013013322,0.00022923648,0.000056821995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008651477,0.000065064734,0.00014931474,0.00029278852,0.000090315785,0.00007585658,0.00034332697,0.000028852484,0.0000072925573],"category_scores_gemma":[0.000057915015,0.00005416437,0.00016054117,0.0005644254,0.00005700551,0.00041772486,0.00001609921,0.00010348375,0.000001059886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008904433,0.0001328954,0.00042624606,0.00000759133,0.000044287688,0.000018798444,0.0009876747,0.0043441537,0.031852238,0.8388256,0.0005759189,0.12269558],"study_design_scores_gemma":[0.000461707,0.0002824656,0.020561703,0.000044806813,0.000010725154,0.00013154683,0.00003611528,0.0007316565,0.013418184,0.96388716,0.00034743076,0.00008652965],"about_ca_topic_score_codex":4.404729e-7,"about_ca_topic_score_gemma":1.952433e-7,"teacher_disagreement_score":0.52746695,"about_ca_system_score_codex":0.000010418268,"about_ca_system_score_gemma":0.00008455566,"threshold_uncertainty_score":0.2208759},"labels":[],"label_agreement":null},{"id":"W4226093078","doi":"10.1002/jgt.23025","title":"Single-conflict colorings of degenerate graphs","year":2023,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","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; Simon Fraser University; European Commission","keywords":"Combinatorics; Mathematics; Graph; Degenerate energy levels; Simple graph; Discrete mathematics; Physics","score_opus":0.07845420285947077,"score_gpt":0.3152875862785836,"score_spread":0.23683338341911284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226093078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5279897,0.006729892,0.45562238,0.00085316057,0.0048685917,0.00072066084,0.000055820063,0.00028585465,0.0028739313],"genre_scores_gemma":[0.9590287,0.0020212934,0.03734292,0.00016000826,0.00023328725,0.000026551834,0.000004537147,0.00012793425,0.0010547679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510044,0.0009924938,0.0014691813,0.0005732766,0.0012454132,0.00061916886],"domain_scores_gemma":[0.99365765,0.0012728345,0.0022021662,0.0013900634,0.0011597573,0.0003175574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006096254,0.0004502594,0.0010663732,0.00255246,0.00013249974,0.00017385768,0.0044273078,0.0003457338,0.000020626161],"category_scores_gemma":[0.00060315075,0.00039165065,0.0010858569,0.0015587637,0.000583594,0.00049570814,0.0020244261,0.0018345125,0.000015255104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038045106,0.00023849419,0.0004961412,0.0002520869,0.0006498874,0.00031710777,0.0009770001,0.0026168826,0.021259932,0.96432436,0.0005010731,0.007986584],"study_design_scores_gemma":[0.00051248627,0.000512617,0.000600665,0.00047813656,0.000059291884,0.000109394154,0.000100688485,0.0001369522,0.03462335,0.96167654,0.0008414294,0.00034845268],"about_ca_topic_score_codex":0.000006453856,"about_ca_topic_score_gemma":0.0000034360237,"teacher_disagreement_score":0.431039,"about_ca_system_score_codex":0.00009203084,"about_ca_system_score_gemma":0.0003823235,"threshold_uncertainty_score":0.99985355},"labels":[],"label_agreement":null},{"id":"W4226110875","doi":"10.1002/jgt.23171","title":"Variants of the Gyárfás–Sumner conjecture: Oriented trees and rainbow paths","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Rainbow; Vertex (graph theory); Graph; Upper and lower bounds; Integer (computer science); Discrete mathematics; Physics","score_opus":0.013004999097107504,"score_gpt":0.2661607394382084,"score_spread":0.2531557403411009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226110875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98525554,0.006477795,0.0022568735,0.0003768113,0.0026610128,0.00018950699,0.00003467599,0.00003085729,0.002716921],"genre_scores_gemma":[0.9981959,0.00020915466,0.0008892164,0.00012811944,0.00019821853,0.0000011905538,2.367187e-7,0.000029641857,0.0003483315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982941,0.0004269694,0.0005829197,0.0001424288,0.00036768615,0.00018589696],"domain_scores_gemma":[0.9978136,0.0012986858,0.00036276682,0.00032289198,0.00012378719,0.0000782692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019177565,0.00018880295,0.00038427295,0.00025610017,0.00015630662,0.000039451737,0.00034217892,0.00012335832,0.00010986396],"category_scores_gemma":[0.0006109022,0.00009492096,0.00038495945,0.00037193022,0.00044293163,0.00013103116,0.00011588683,0.00046430874,4.127105e-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.00014662374,0.00004428296,0.0005506759,0.00013332767,0.0004164933,0.00004501413,0.003548331,0.0000029226005,0.0014550722,0.986711,0.0018553665,0.005090859],"study_design_scores_gemma":[0.0004468637,0.00013144128,0.0036370854,0.0003368813,0.00025638606,0.000437887,0.000503338,0.00001853892,0.0014947879,0.9905582,0.002062501,0.00011606115],"about_ca_topic_score_codex":0.0000011063863,"about_ca_topic_score_gemma":0.0000021208289,"teacher_disagreement_score":0.012940344,"about_ca_system_score_codex":0.0000148105255,"about_ca_system_score_gemma":0.00006463713,"threshold_uncertainty_score":0.38707644},"labels":[],"label_agreement":null},{"id":"W4229847238","doi":"10.1002/jgt.10047","title":"Convex‐round graphs are circular‐perfect","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Regular polygon; Chordal graph; Discrete mathematics; Graph; Geometry","score_opus":0.028524529176912734,"score_gpt":0.2678457779785755,"score_spread":0.23932124880166278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229847238","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.32584447,0.01843017,0.64261806,0.0016887431,0.0020674446,0.00037858987,0.000006624285,0.00019667462,0.008769243],"genre_scores_gemma":[0.99416786,0.00058835704,0.0042215018,0.00050597964,0.00011715813,0.000004222838,1.816876e-7,0.000027287508,0.00036747122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683976,0.0008051357,0.00060065486,0.00032298258,0.00088206655,0.0005494095],"domain_scores_gemma":[0.99705845,0.0007070706,0.0006186019,0.00082394277,0.00046455892,0.00032740022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028044437,0.00024768335,0.00047230517,0.0010284337,0.0002561331,0.00018741575,0.0020858655,0.000107121974,0.00024277043],"category_scores_gemma":[0.000360677,0.00020148937,0.00055060687,0.0014569148,0.00040599718,0.0012181405,0.00019050416,0.0007661055,0.00008335212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090573514,0.00029796577,0.0034756656,0.000040569135,0.00026000704,0.00075788144,0.0008639242,0.000099890014,0.0035159884,0.9658349,0.0020586138,0.022704035],"study_design_scores_gemma":[0.0009072849,0.000379384,0.0022684047,0.000088116845,0.000024847124,0.0010114321,0.00021021263,0.00044146512,0.0015019514,0.9899345,0.0029458422,0.00028657686],"about_ca_topic_score_codex":7.352115e-7,"about_ca_topic_score_gemma":6.065102e-7,"teacher_disagreement_score":0.66832334,"about_ca_system_score_codex":0.00005491259,"about_ca_system_score_gemma":0.000038292488,"threshold_uncertainty_score":0.8216498},"labels":[],"label_agreement":null},{"id":"W4231986041","doi":"10.1002/1097-0118(200103)36:3<121::aid-jgt1000>3.0.co;2-u","title":"Tree embeddings","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Discrete mathematics; Degree (music); Tree (set theory); Computer science","score_opus":0.017674241947864735,"score_gpt":0.2940075536422283,"score_spread":0.2763333116943636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231986041","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.104986235,0.001213235,0.87592655,0.00079715805,0.0005278474,0.00007529879,4.9425324e-7,0.00005790693,0.016415246],"genre_scores_gemma":[0.9668041,0.00040618412,0.03097451,0.0004261075,0.00019984791,0.000002034167,1.243226e-7,0.000019162566,0.0011679683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982151,0.00030910902,0.00040283252,0.00017164231,0.00054725126,0.0003540784],"domain_scores_gemma":[0.99828243,0.00045621968,0.00031248905,0.00045116857,0.0002885739,0.00020910331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026225466,0.00013169202,0.00024118615,0.0006567222,0.00012325488,0.000095294694,0.0016883723,0.000054153097,0.000091211754],"category_scores_gemma":[0.0002516069,0.00010174258,0.00027173213,0.0009950257,0.00016997145,0.0010265508,0.00016284033,0.00041277288,0.000033431577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017561932,0.00008399591,0.00083744293,0.000004341908,0.000057100602,0.0003553019,0.0004291413,0.000041770574,0.003150051,0.87603384,0.000958941,0.11787247],"study_design_scores_gemma":[0.00050874363,0.00027694905,0.0011408953,0.000032810836,0.000007888673,0.0010505617,0.00015015875,0.0001825536,0.0016184183,0.9887802,0.006121935,0.00012891198],"about_ca_topic_score_codex":4.226926e-7,"about_ca_topic_score_gemma":7.893976e-7,"teacher_disagreement_score":0.86181784,"about_ca_system_score_codex":0.00002638922,"about_ca_system_score_gemma":0.000064207394,"threshold_uncertainty_score":0.41489422},"labels":[],"label_agreement":null},{"id":"W4232636732","doi":"10.1002/jgt.20331","title":"The bond and cycle spaces of an infinite graph","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Vertex (graph theory); Discrete mathematics; Combinatorics; Graph","score_opus":0.011945785772957507,"score_gpt":0.23186238961718064,"score_spread":0.21991660384422312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232636732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9791015,0.0030458323,0.016798731,0.00049709587,0.000096224874,0.000021276986,0.0000038945486,0.000008106272,0.0004273718],"genre_scores_gemma":[0.9952446,0.0016013826,0.0029748427,0.00010852444,0.00003302033,2.8132516e-7,2.7292617e-7,0.0000013549421,0.000035727437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906874,0.00015118434,0.00029540528,0.00009611836,0.00026040478,0.00012817777],"domain_scores_gemma":[0.9986423,0.0005799615,0.00033645888,0.0002312472,0.00010885421,0.000101180085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012004385,0.00007128449,0.0001900946,0.00027620114,0.00019980778,0.00005426677,0.0006995832,0.00003279012,0.000007698997],"category_scores_gemma":[0.00015425528,0.000033314285,0.0001364485,0.001025699,0.00030549584,0.00042633846,0.000107720036,0.0001401728,8.606058e-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.00021191119,0.00040482174,0.016364645,0.000011486439,0.00046484295,0.00025155488,0.001551108,0.00011245599,0.0014227892,0.6563524,0.0011851109,0.32166687],"study_design_scores_gemma":[0.00040314937,0.0006738702,0.114652716,0.000013715031,0.00005125978,0.00051633804,0.00035167826,0.00021747491,0.0007857644,0.8772007,0.0049958467,0.00013746723],"about_ca_topic_score_codex":0.000009191905,"about_ca_topic_score_gemma":0.000004700632,"teacher_disagreement_score":0.3215294,"about_ca_system_score_codex":0.0000025428483,"about_ca_system_score_gemma":0.000016370066,"threshold_uncertainty_score":0.15367801},"labels":[],"label_agreement":null},{"id":"W4233116492","doi":"10.1002/jgt.20244","title":"Tough spiders","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Hamiltonian path; Split graph; Pathwidth; Graph; Spider; Interval graph; Outerplanar graph; Discrete mathematics; 1-planar graph; Line graph; Physics","score_opus":0.017325918051113578,"score_gpt":0.302466478754902,"score_spread":0.28514056070378846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233116492","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.052605253,0.00096204126,0.9383014,0.0003753186,0.0006243551,0.00006228384,3.3235023e-7,0.000035515084,0.0070335134],"genre_scores_gemma":[0.9457645,0.00008639147,0.053064838,0.00052600686,0.00019805123,5.465898e-7,8.620674e-8,0.000014751451,0.00034483717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981294,0.00022150042,0.00048581848,0.00015926998,0.0005816897,0.00042229137],"domain_scores_gemma":[0.99787873,0.0008224817,0.0003278607,0.00044309578,0.00029325057,0.00023456267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069941147,0.0001225811,0.0002168801,0.0007078261,0.00011438607,0.00006259008,0.0014602629,0.000058112128,0.00003887972],"category_scores_gemma":[0.00034959777,0.000095936426,0.00025718004,0.0008883964,0.00020302422,0.0008333026,0.00014259954,0.0004452923,0.00002208962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016302713,0.00005914569,0.0004336571,0.0000056725057,0.00004977129,0.0002875084,0.00040064368,0.0000439224,0.003006985,0.9239888,0.0004999051,0.07106095],"study_design_scores_gemma":[0.00042973686,0.00025376084,0.00206707,0.000027512744,0.000006381478,0.0003813575,0.00023326115,0.00002051818,0.008135534,0.9841091,0.004212261,0.00012349592],"about_ca_topic_score_codex":5.996034e-7,"about_ca_topic_score_gemma":0.0000013070674,"teacher_disagreement_score":0.8931592,"about_ca_system_score_codex":0.000040620223,"about_ca_system_score_gemma":0.000069585294,"threshold_uncertainty_score":0.3912174},"labels":[],"label_agreement":null},{"id":"W4233572056","doi":"10.1002/jgt.20440","title":"Cycles and paths in edge‐colored graphs with given degrees","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College Saint-Jean","funders":"","keywords":"Colored; Multigraph; Combinatorics; Mathematics; Hamiltonian path; Edge coloring; Graph; Hamiltonian (control theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Line graph; Graph power; Computer science","score_opus":0.016158173664898346,"score_gpt":0.2670299673838781,"score_spread":0.2508717937189797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233572056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954816,0.0016468111,0.00040607923,0.00019122285,0.00013990734,0.0001271928,0.0000030616197,0.000017686065,0.0019864293],"genre_scores_gemma":[0.9931274,0.0003117706,0.006272448,0.00016627947,0.000066186345,0.0000013173656,2.5524014e-7,0.000018299585,0.000036021724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985469,0.0002707764,0.00050162536,0.00014752883,0.00028238655,0.00025076984],"domain_scores_gemma":[0.99857557,0.00056304847,0.00041454379,0.00021817037,0.00011086436,0.00011779575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137193,0.0002069299,0.00044976128,0.00054998725,0.00013179713,0.00003541458,0.00027697903,0.00010994082,0.000023931703],"category_scores_gemma":[0.0002056901,0.00012917811,0.00015730922,0.0003006136,0.0002739711,0.00021070927,0.00003255079,0.0003959662,2.604694e-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.0010576986,0.00015772118,0.010596924,0.000035807992,0.0001286417,0.00019937204,0.0031594185,0.00001178448,0.00047551937,0.96817577,0.0003295815,0.015671749],"study_design_scores_gemma":[0.001075226,0.00063481566,0.066667914,0.00017611796,0.000075848024,0.0003514318,0.00088838686,0.000004027324,0.00028195628,0.92960006,0.000079137426,0.00016507815],"about_ca_topic_score_codex":0.0000010517198,"about_ca_topic_score_gemma":0.000009610751,"teacher_disagreement_score":0.056070987,"about_ca_system_score_codex":0.000016279282,"about_ca_system_score_gemma":0.00002926803,"threshold_uncertainty_score":0.52677304},"labels":[],"label_agreement":null},{"id":"W4234861332","doi":"10.1002/jgt.20324","title":"On highly ramsey infinite graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Thompson Rivers University; University of Victoria","keywords":"Combinatorics; Mathematics; Ramsey's theorem; Ramsey theory; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.030808519224349427,"score_gpt":0.2758785608208873,"score_spread":0.24507004159653786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234861332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98234785,0.000490219,0.0011848746,0.00009647191,0.0012086997,0.00010570861,0.000006924033,0.00004515906,0.014514094],"genre_scores_gemma":[0.9957621,0.0003524852,0.002520392,0.00068281643,0.00021936391,0.0000017774457,5.255475e-7,0.000043206506,0.0004173394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977659,0.0004125464,0.0007640143,0.00015973319,0.0005870259,0.00031079716],"domain_scores_gemma":[0.9965232,0.0019000927,0.0007079692,0.0004491735,0.00023595936,0.00018361994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016724156,0.00026183637,0.0005119967,0.00072128186,0.00040871167,0.000019817451,0.00053608685,0.00016042645,0.000208454],"category_scores_gemma":[0.00086157565,0.00017821077,0.00062527816,0.0004025178,0.00041957537,0.00018010283,0.00006340776,0.0006739463,0.000009453048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005907575,0.00014466982,0.0005971529,0.000023174363,0.0002298459,0.00021723838,0.0014803539,0.00001089919,0.00020303558,0.98811054,0.007302884,0.0010894646],"study_design_scores_gemma":[0.0009490551,0.0004945424,0.0018429162,0.00009283068,0.00007907925,0.00081094226,0.00014029322,0.0000013168276,0.00082864356,0.9929857,0.0015652846,0.00020939033],"about_ca_topic_score_codex":7.1038704e-7,"about_ca_topic_score_gemma":4.4064961e-7,"teacher_disagreement_score":0.014096755,"about_ca_system_score_codex":0.000024250281,"about_ca_system_score_gemma":0.000051980773,"threshold_uncertainty_score":0.7267224},"labels":[],"label_agreement":null},{"id":"W4235275672","doi":"10.1002/jgt.20064","title":"The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Foster graph; Discrete mathematics; Critical graph; Edge coloring; Friendship graph; Random graph; Graph; Windmill graph; Brooks' theorem; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Graph power; Line graph; Computer science","score_opus":0.013080081323249617,"score_gpt":0.2844518910577733,"score_spread":0.2713718097345237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235275672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982495,0.004774224,0.0028599405,0.00081274984,0.0009871656,0.00035374923,0.000016380305,0.000039531187,0.0076612495],"genre_scores_gemma":[0.99256945,0.0010718424,0.0046247374,0.0005912663,0.00050831406,0.0000074527375,4.3962586e-7,0.0000618457,0.00056463503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963241,0.00072270934,0.0015319394,0.00018739456,0.0007842373,0.00044961282],"domain_scores_gemma":[0.99396414,0.0031411385,0.0015881464,0.0007834266,0.00034718792,0.00017593586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004691302,0.0003430479,0.00083144463,0.00024155506,0.0005189238,0.000058483023,0.0010720484,0.00017143782,0.00032039508],"category_scores_gemma":[0.00077072,0.00019602808,0.0011599419,0.0004915632,0.0008020496,0.00028832877,0.00013267041,0.000568344,0.000009295339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012391417,0.0002834375,0.00073739816,0.00017297949,0.0011703472,0.000018368426,0.0054692556,0.0000094790485,0.0015755245,0.9580431,0.020001,0.01127998],"study_design_scores_gemma":[0.0025886425,0.000102339516,0.00029185193,0.00019148935,0.00038329716,0.0004646032,0.00052446703,0.0000115064595,0.0062557105,0.97972566,0.009234703,0.00022575018],"about_ca_topic_score_codex":0.0000012455005,"about_ca_topic_score_gemma":0.0000026936698,"teacher_disagreement_score":0.021682551,"about_ca_system_score_codex":0.000034160657,"about_ca_system_score_gemma":0.00007109458,"threshold_uncertainty_score":0.7993793},"labels":[],"label_agreement":null},{"id":"W4235523307","doi":"10.1002/jgt.20146","title":"Roots of cube polynomials of median graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Graph; Regular polygon; Discrete mathematics; Geometry","score_opus":0.01798738066600316,"score_gpt":0.282285436764795,"score_spread":0.26429805609879187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235523307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99096054,0.00067896047,0.0018868359,0.00016230773,0.0001627692,0.00013528811,0.000029201932,0.000012381726,0.0059716906],"genre_scores_gemma":[0.9959476,0.00006324686,0.0037092778,0.000020346839,0.00009203458,0.0000030524336,0.000001199103,0.00002040536,0.00014281819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810576,0.00025189653,0.0010733849,0.00009246492,0.00030685225,0.00016964991],"domain_scores_gemma":[0.9969297,0.0010341306,0.0013955212,0.0002875622,0.00027513254,0.0000779778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153002,0.00014109266,0.00051394955,0.00051955046,0.000057653222,0.0000068980426,0.0003585282,0.000096916614,0.00015049643],"category_scores_gemma":[0.00022663157,0.0001112003,0.0005072479,0.00045979334,0.00033833002,0.00010710669,0.000025375384,0.00019069055,0.0000019704903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001304694,0.00034497076,0.0010885269,0.00006672412,0.00011519415,0.000004841348,0.0001534012,0.0000053881595,0.048791423,0.94700277,0.0015934015,0.0007029117],"study_design_scores_gemma":[0.00049719453,0.000113770075,0.0022455866,0.00010245871,0.00015051776,0.000055367887,0.00029794025,0.0000010674726,0.052923236,0.94318825,0.00033257762,0.00009203046],"about_ca_topic_score_codex":0.0000069258294,"about_ca_topic_score_gemma":0.000009044077,"teacher_disagreement_score":0.0058288723,"about_ca_system_score_codex":0.000008847442,"about_ca_system_score_gemma":0.00005052521,"threshold_uncertainty_score":0.45346168},"labels":[],"label_agreement":null},{"id":"W4236594403","doi":"10.1002/jgt.20484","title":"Large classes of infinite <i>k</i>‐cop‐win graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Université de Montréal; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Vertex (graph theory); Discrete mathematics; Characterization (materials science); Endomorphism; Graph; Transitive relation; Cograph; 1-planar graph; Chordal graph","score_opus":0.01641615458942594,"score_gpt":0.30854294697823503,"score_spread":0.2921267923888091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236594403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789067,0.0004313069,0.011780349,0.00012078195,0.0010539494,0.00008518785,0.00001759957,0.000025275194,0.007578854],"genre_scores_gemma":[0.9912286,0.00013008779,0.007970777,0.00021621046,0.0001346698,0.0000014246579,7.9003445e-7,0.000026652075,0.00029078388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983482,0.0003058124,0.00073166064,0.00010723989,0.00024193371,0.0002651536],"domain_scores_gemma":[0.99648297,0.0019047168,0.00089274277,0.00034288742,0.00026716082,0.00010949652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027656038,0.00016941123,0.0004881412,0.0004077019,0.0001010532,0.000007827053,0.00039021668,0.00020381248,0.0005006717],"category_scores_gemma":[0.0013232069,0.00012860545,0.00038053186,0.00026151733,0.000445324,0.00022827378,0.000051297957,0.0008968018,0.0000074258282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034193648,0.00026837902,0.0014226182,0.00004723842,0.00015412025,0.000034398458,0.00077809184,0.0000014611691,0.014128048,0.98128724,0.0008600783,0.00067637075],"study_design_scores_gemma":[0.00085868756,0.00019072353,0.00062510755,0.00005348579,0.00010357277,0.00020418299,0.00082560605,0.000001111763,0.0091009075,0.9845955,0.0033149028,0.00012623606],"about_ca_topic_score_codex":2.921439e-7,"about_ca_topic_score_gemma":0.000010583324,"teacher_disagreement_score":0.012321908,"about_ca_system_score_codex":0.0000057331044,"about_ca_system_score_gemma":0.0000643171,"threshold_uncertainty_score":0.54820037},"labels":[],"label_agreement":null},{"id":"W4237624345","doi":"10.1002/jgt.10121","title":"Partitioning a graph into two isomorphic pieces","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Cograph; Property (philosophy); Discrete mathematics; Graph; Split graph; Line graph; Pathwidth","score_opus":0.018785615975345,"score_gpt":0.2971040975381128,"score_spread":0.2783184815627678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237624345","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.09386429,0.0036796555,0.89791185,0.00051755615,0.0008260222,0.0001261123,0.0000016304591,0.00006529548,0.0030076061],"genre_scores_gemma":[0.96424425,0.00023099488,0.035025142,0.00030079202,0.000083365965,0.000006577553,4.070327e-7,0.000015062922,0.000093412775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969476,0.0010717746,0.0005815073,0.0002691884,0.0006725473,0.0004573687],"domain_scores_gemma":[0.9977352,0.00056979654,0.000463302,0.00055091525,0.00040707667,0.00027370878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046641706,0.00019610842,0.0003272948,0.00090754364,0.0003358944,0.00017134163,0.0012682419,0.000058875212,0.000101524805],"category_scores_gemma":[0.00055651367,0.00016150266,0.00033663557,0.0014375616,0.00030265882,0.0012198706,0.000105630796,0.0005776149,0.000046536414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062674495,0.00010193115,0.0012005756,0.000011943761,0.000085053594,0.00012320593,0.0007396182,0.00053009327,0.002061608,0.98778635,0.00038298007,0.006913969],"study_design_scores_gemma":[0.00076014776,0.0002788791,0.00022514614,0.00006533698,0.000015184953,0.0004526242,0.00022077504,0.00006380849,0.0051642805,0.9892655,0.003302319,0.0001860086],"about_ca_topic_score_codex":0.00000209946,"about_ca_topic_score_gemma":0.00000596958,"teacher_disagreement_score":0.8703799,"about_ca_system_score_codex":0.00004349735,"about_ca_system_score_gemma":0.00014144454,"threshold_uncertainty_score":0.65858877},"labels":[],"label_agreement":null},{"id":"W4238200461","doi":"10.1002/jgt.20420","title":"Path homomorphisms, graph colorings, and boolean matrices","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Mathematics; Homomorphism; Path (computing); Graph; Constructive; Algebraic number; Chromatic scale; Discrete mathematics; Computer science","score_opus":0.012494258158381146,"score_gpt":0.2634158145642281,"score_spread":0.25092155640584696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238200461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5791227,0.018823477,0.3944772,0.0020786168,0.00063582556,0.0003257409,0.000006586142,0.00015828211,0.004371581],"genre_scores_gemma":[0.9795914,0.0018996643,0.017825034,0.0004551859,0.00009302619,0.0000016155365,2.5102065e-7,0.00001298734,0.00012079695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978854,0.0003503663,0.00049028656,0.00026688655,0.0005856381,0.00042142902],"domain_scores_gemma":[0.9981455,0.00040928947,0.0004616128,0.00043345924,0.0002517136,0.00029839162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025945636,0.00020270664,0.00035618726,0.0008891309,0.00022472098,0.000179946,0.0012569549,0.000076879835,0.000014271933],"category_scores_gemma":[0.00014422361,0.00016107911,0.00020978287,0.0009878011,0.00025689867,0.0011098088,0.00013513755,0.000512516,0.0000059427484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377631,0.00011013146,0.00055448036,0.000014247264,0.00005022753,0.00027053492,0.00031504998,0.000018552935,0.0020882906,0.9558693,0.0003825226,0.040142864],"study_design_scores_gemma":[0.00062944274,0.00093137,0.007455578,0.00007595798,0.000018870918,0.00062323886,0.00014021309,0.000039501316,0.001248231,0.9876849,0.0009591224,0.00019356377],"about_ca_topic_score_codex":7.5646517e-7,"about_ca_topic_score_gemma":3.188854e-7,"teacher_disagreement_score":0.40046874,"about_ca_system_score_codex":0.000027095235,"about_ca_system_score_gemma":0.00006488696,"threshold_uncertainty_score":0.65686154},"labels":[],"label_agreement":null},{"id":"W4238743912","doi":"10.1002/jgt.20167","title":"The generalized acyclic edge chromatic number of random regular graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Edge coloring; Brooks' theorem; Discrete mathematics; Random graph; Graph; Foster graph; Critical graph; Upper and lower bounds; Graph power; Line graph","score_opus":0.01150738133832381,"score_gpt":0.2757262699425528,"score_spread":0.264218888604229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238743912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98832446,0.0029154443,0.0017862006,0.00012311529,0.0008843266,0.00022036425,0.0000060560415,0.000024110597,0.0057159117],"genre_scores_gemma":[0.9944036,0.00038574747,0.00415989,0.00007005984,0.00030612704,0.0000052981623,8.990169e-7,0.000046326615,0.00062202406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966593,0.0009070478,0.0013586198,0.00013872756,0.00060016627,0.0003361488],"domain_scores_gemma":[0.99518126,0.002378299,0.00145663,0.00060690095,0.0002910341,0.000085861706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040202034,0.00026304196,0.0007156021,0.00023049589,0.00043417705,0.00004688439,0.0007393175,0.00014000585,0.00013689422],"category_scores_gemma":[0.0005288308,0.00014495089,0.00094078865,0.00039196628,0.0006694813,0.00015057561,0.0000811002,0.0003616887,0.000002241462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073090236,0.00010883252,0.0007900018,0.00007615485,0.0003808686,0.000019084284,0.0004313747,0.000008665322,0.0024869319,0.9884667,0.0055244057,0.0009761002],"study_design_scores_gemma":[0.0028305233,0.0000684726,0.0011819793,0.00011693714,0.00028424055,0.00031156908,0.00021550778,0.000007461973,0.004189986,0.9892901,0.0013346307,0.00016856696],"about_ca_topic_score_codex":0.0000052194105,"about_ca_topic_score_gemma":0.000004004782,"teacher_disagreement_score":0.0060791573,"about_ca_system_score_codex":0.000022241391,"about_ca_system_score_gemma":0.000045074157,"threshold_uncertainty_score":0.5910925},"labels":[],"label_agreement":null},{"id":"W4238782258","doi":"10.1002/jgt.20369","title":"On the chromatic number of a random 5‐regular graph","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Fractional coloring; Brooks' theorem; Chromatic scale; Discrete mathematics; Vertex (graph theory); Random graph; Critical graph; Graph; Graph power; Line graph; Mathematical analysis","score_opus":0.015165939591184223,"score_gpt":0.2821104125560561,"score_spread":0.2669444729648719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238782258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901327,0.0004177582,0.00168797,0.000371701,0.00031867283,0.00020823299,0.000005378199,0.000017740002,0.0068398598],"genre_scores_gemma":[0.99785316,0.000090179754,0.001276707,0.0005475496,0.00012873074,0.0000017880286,2.9697676e-7,0.000014895405,0.00008666761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753755,0.0006728222,0.0008507897,0.000115580755,0.00058507296,0.00023815571],"domain_scores_gemma":[0.9950504,0.003247835,0.00095978024,0.00045833318,0.00019488716,0.000088783934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033805296,0.00022942641,0.00060144544,0.000199501,0.00020493694,0.000023987779,0.0006192793,0.000112376714,0.0004197131],"category_scores_gemma":[0.0009509418,0.000107562686,0.0007734047,0.00036258,0.0002652296,0.00010409815,0.00003140751,0.00044142056,0.0000027468282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008548443,0.00018622474,0.00006576446,0.00003512187,0.00028874193,0.000022910539,0.0011909717,0.000006499924,0.0012608534,0.9917054,0.0021805353,0.0022021364],"study_design_scores_gemma":[0.0013851626,0.00031465403,0.0008679578,0.0002606708,0.00019462871,0.00025887685,0.00031523238,0.00000451014,0.0025105295,0.993639,0.00011397998,0.00013477566],"about_ca_topic_score_codex":3.689323e-7,"about_ca_topic_score_gemma":2.99993e-7,"teacher_disagreement_score":0.007720498,"about_ca_system_score_codex":0.000015644559,"about_ca_system_score_gemma":0.000026378137,"threshold_uncertainty_score":0.4595564},"labels":[],"label_agreement":null},{"id":"W4240363330","doi":"10.1002/jgt.20352","title":"The <i>n</i>‐ordered graphs: A new graph class","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Mathematics; Discrete mathematics; Countable set; Indifference graph; Chordal graph; 1-planar graph; Pathwidth; Line graph; Graph","score_opus":0.030488311670102068,"score_gpt":0.27358057609240133,"score_spread":0.24309226442229925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240363330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95817584,0.01150443,0.008134457,0.0012928168,0.0039112456,0.00044339203,0.000011022782,0.0001273156,0.016399508],"genre_scores_gemma":[0.9892692,0.0035354926,0.0040482515,0.00066182925,0.0005580466,0.0000041506414,5.6241225e-7,0.00007513039,0.0018473129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968242,0.0006127395,0.0010797093,0.00020702787,0.00076172524,0.00051460456],"domain_scores_gemma":[0.9951721,0.0024678714,0.0010159477,0.0007113811,0.0003246967,0.00030804647],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026059183,0.00034288722,0.0005708582,0.0004476528,0.0013149377,0.00006082784,0.0011248684,0.0001838565,0.00009568797],"category_scores_gemma":[0.0009601443,0.00019443489,0.0010120167,0.0006967425,0.00087091577,0.00024935466,0.00012283142,0.00082909263,0.0000044215726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055999734,0.00007900021,0.000569401,0.00001745768,0.00044936204,0.00011010744,0.0024361897,0.000004764955,0.00021313819,0.9453158,0.046348203,0.0038966117],"study_design_scores_gemma":[0.0011156546,0.00024381395,0.0009219406,0.00006082201,0.00014161645,0.0014870352,0.0007790452,0.0000017608686,0.0004786926,0.9777978,0.01672847,0.00024337036],"about_ca_topic_score_codex":0.000004060562,"about_ca_topic_score_gemma":0.000008807151,"teacher_disagreement_score":0.032482013,"about_ca_system_score_codex":0.00002636854,"about_ca_system_score_gemma":0.00017677339,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W4240422189","doi":"10.1002/jgt.20304","title":"Straight line embeddings of cubic planar graphs with integer edge lengths","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Polyhedral graph; Cubic graph; Embedding; Planar; Planar straight-line graph; Book embedding; Integer (computer science); Enhanced Data Rates for GSM Evolution; Graph; Line (geometry); Discrete mathematics; Line graph; 1-planar graph; Geometry; Computer science; Voltage graph; Telecommunications","score_opus":0.019259993860155224,"score_gpt":0.27004024612303285,"score_spread":0.25078025226287765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240422189","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.47918501,0.001838827,0.5149762,0.00029550455,0.0003544426,0.00019019425,0.000008493546,0.00005595497,0.0030953665],"genre_scores_gemma":[0.9764329,0.00044039314,0.022587288,0.00011602504,0.00007746133,0.0000026808548,6.735428e-7,0.000027411084,0.0003151357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729276,0.00037110617,0.00071897457,0.00028341697,0.00088439224,0.00044933378],"domain_scores_gemma":[0.9970846,0.0006544897,0.0007235236,0.0006208697,0.0006525234,0.00026396345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001907401,0.0002555658,0.00054336054,0.0011942143,0.0001800762,0.000032443524,0.0017636528,0.00009487629,0.00006639827],"category_scores_gemma":[0.00016291528,0.00017560383,0.00034063667,0.0014139442,0.0008141829,0.0010035948,0.000112255235,0.00076544523,0.0000070670962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010420379,0.00036871893,0.0014300977,0.000050718238,0.00033568163,0.00068648753,0.0023701263,0.00042772395,0.0093383705,0.9761242,0.00084047765,0.0069853426],"study_design_scores_gemma":[0.0022760928,0.0029030303,0.002331315,0.00035466877,0.000051642368,0.0028536564,0.0004458575,0.0002908302,0.034386788,0.95244163,0.0011857096,0.0004788025],"about_ca_topic_score_codex":0.0000016534726,"about_ca_topic_score_gemma":0.0000020837572,"teacher_disagreement_score":0.49724793,"about_ca_system_score_codex":0.00003114476,"about_ca_system_score_gemma":0.00020582584,"threshold_uncertainty_score":0.71609163},"labels":[],"label_agreement":null},{"id":"W4240838206","doi":"10.1002/jgt.20291","title":"A better bound for the cop number of general graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Wilfrid Laurier University","keywords":"Combinatorics; Mathematics; Sublinear function; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.032428926191031715,"score_gpt":0.3078512286830073,"score_spread":0.2754223024919756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240838206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895638,0.00083298,0.006367,0.00020890127,0.0008666802,0.00020302058,0.000017997438,0.00001066412,0.0019289586],"genre_scores_gemma":[0.98757946,0.0002892057,0.010662203,0.0005339243,0.00039204257,0.0000070495607,5.064556e-7,0.00003744843,0.00049816136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835634,0.0002136311,0.00070845906,0.000107569205,0.00037054642,0.00024346334],"domain_scores_gemma":[0.9964462,0.0020624301,0.0007275989,0.00036888767,0.0003219688,0.00007294162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017347106,0.00018099643,0.00043612454,0.00016441278,0.0004013801,0.000014896486,0.0005183292,0.00010541821,0.00018391578],"category_scores_gemma":[0.0003440755,0.00009969588,0.0007702326,0.0002068768,0.00064809324,0.00012032506,0.000054551398,0.00030313057,8.8859696e-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.0005034187,0.0000862143,0.002981015,0.000053989377,0.0005522877,0.00001768912,0.0018917173,0.0000042732836,0.00058681716,0.9777148,0.014459301,0.0011484944],"study_design_scores_gemma":[0.0008970712,0.00012627969,0.0021230995,0.00003810352,0.00021208478,0.0007662287,0.00020518898,0.000007554863,0.0017725286,0.99129194,0.0024353138,0.00012463435],"about_ca_topic_score_codex":0.0000019872457,"about_ca_topic_score_gemma":9.823916e-7,"teacher_disagreement_score":0.013577129,"about_ca_system_score_codex":0.0000124856915,"about_ca_system_score_gemma":0.000049404072,"threshold_uncertainty_score":0.406548},"labels":[],"label_agreement":null},{"id":"W4240883746","doi":"10.1002/jgt.20479","title":"A note on the bichromatic numbers of graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Bounded function; Cograph; Chordal graph; Discrete mathematics; Clique number; Upper and lower bounds; 1-planar graph; Vertex (graph theory)","score_opus":0.01658953433219941,"score_gpt":0.28605030470435655,"score_spread":0.26946077037215715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240883746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871025,0.00007699836,0.00054326985,0.00030161717,0.0012675521,0.00013607753,0.0000056136,0.000014350292,0.010552039],"genre_scores_gemma":[0.99641556,0.00003036493,0.003009042,0.0002920993,0.0001325965,0.0000019157594,1.2985e-7,0.000027340522,0.00009092642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981207,0.000352951,0.0007123866,0.0001026959,0.0005033486,0.00020788547],"domain_scores_gemma":[0.99474335,0.003468388,0.0009410369,0.0005650077,0.00019135713,0.00009086932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034864407,0.00018784174,0.00041104853,0.000327714,0.00019725646,0.00001936907,0.00069668813,0.0001297257,0.00039110464],"category_scores_gemma":[0.001600573,0.000096783064,0.0005564565,0.0003304425,0.0005603299,0.00008854459,0.000056241024,0.0008462501,0.000002839533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017876537,0.000101173566,0.00021121107,0.000046793266,0.0001855548,0.000012127427,0.0020747534,0.0000014927213,0.0058263424,0.9884782,0.001565613,0.0013179765],"study_design_scores_gemma":[0.00039245444,0.00019602779,0.00081584754,0.00011503658,0.00012563942,0.00015846147,0.00046440068,0.00000442549,0.0051875873,0.99206406,0.00036494373,0.000111127425],"about_ca_topic_score_codex":0.0000015152402,"about_ca_topic_score_gemma":0.0000048622205,"teacher_disagreement_score":0.010461113,"about_ca_system_score_codex":0.000008170486,"about_ca_system_score_gemma":0.000045564946,"threshold_uncertainty_score":0.42823216},"labels":[],"label_agreement":null},{"id":"W4241301040","doi":"10.1002/jgt.20205","title":"Independent dominating sets and hamiltonian cycles","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Graph; Hamiltonian path problem; Discrete mathematics; Mathematical optimization","score_opus":0.010089306253866797,"score_gpt":0.27225994589591235,"score_spread":0.26217063964204557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241301040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7522586,0.002136934,0.24235554,0.0003759893,0.00025008523,0.000093228875,0.0000016144014,0.00003434186,0.0024936928],"genre_scores_gemma":[0.9756714,0.000064241176,0.023992885,0.00007615115,0.00007425009,0.0000014235517,1.5841418e-7,0.000011294596,0.00010821091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982593,0.0003543236,0.00040620004,0.00018576611,0.00049805304,0.00029637874],"domain_scores_gemma":[0.9985888,0.0004897339,0.00033573405,0.0002794344,0.00018268262,0.00012360772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026808593,0.00013193338,0.00022317002,0.0005329023,0.00017896185,0.00014208013,0.0007626587,0.000057280315,0.00000940125],"category_scores_gemma":[0.00011686716,0.000105184656,0.0001252157,0.0003928494,0.00020755644,0.00072363584,0.00021016994,0.00038177686,0.0000034633024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078755525,0.0000833804,0.005190824,0.000016122947,0.00004042149,0.0002197481,0.00041215526,0.00014152656,0.006962664,0.91478574,0.00012762593,0.07194101],"study_design_scores_gemma":[0.0005910086,0.0001309938,0.032317046,0.000049976115,0.0000074988384,0.00052586634,0.0001343108,0.00022636156,0.0027646092,0.96291953,0.00020663887,0.0001261652],"about_ca_topic_score_codex":0.0000038991902,"about_ca_topic_score_gemma":0.000005511628,"teacher_disagreement_score":0.22341281,"about_ca_system_score_codex":0.000030257399,"about_ca_system_score_gemma":0.000047763817,"threshold_uncertainty_score":0.42893058},"labels":[],"label_agreement":null},{"id":"W4241335985","doi":"10.1002/jgt.20363","title":"Circle graph obstructions under pivoting","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Corollary; Circle graph; Mathematics; Outerplanar graph; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.01817147925094919,"score_gpt":0.2891290677880259,"score_spread":0.2709575885370767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241335985","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.10018756,0.0011005186,0.8939127,0.0013073888,0.00068842847,0.00009090936,0.00000107491,0.000082853454,0.0026285779],"genre_scores_gemma":[0.9738966,0.000095138996,0.025217384,0.0005133809,0.00015229435,0.0000010079368,1.9609563e-7,0.000012062879,0.00011188437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978117,0.00039121907,0.00053125474,0.00023766054,0.00058865064,0.00043954633],"domain_scores_gemma":[0.99802625,0.00043289652,0.00040672097,0.0005453697,0.00034883482,0.00023995111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002080337,0.00015832612,0.00027578097,0.0008973856,0.00031564818,0.00013684771,0.0014245159,0.00007348137,0.000029258466],"category_scores_gemma":[0.00020419226,0.0001431758,0.00036303056,0.0014261142,0.00019693813,0.0011691783,0.00009161051,0.0006182062,0.000013789721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048362308,0.00009264682,0.00013278206,0.0000036901015,0.000052567182,0.00005132855,0.00027883088,0.0007967799,0.005378622,0.91644394,0.0001404018,0.07658006],"study_design_scores_gemma":[0.00043008546,0.00029132701,0.010446049,0.00004205401,0.000012380478,0.0005234028,0.00025125052,0.00007213647,0.0018590513,0.9857232,0.00019356818,0.00015550523],"about_ca_topic_score_codex":5.8889214e-7,"about_ca_topic_score_gemma":6.86992e-7,"teacher_disagreement_score":0.8737091,"about_ca_system_score_codex":0.00004614209,"about_ca_system_score_gemma":0.00008741712,"threshold_uncertainty_score":0.58385396},"labels":[],"label_agreement":null},{"id":"W4241642908","doi":"10.1002/jgt.20428","title":"Subgraph‐avoiding coloring of graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","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 Calgary","funders":"","keywords":"Combinatorics; Monochromatic color; Mathematics; Graph; Chromatic scale; Induced subgraph; Integer (computer science); Discrete mathematics; Physics; Vertex (graph theory); Computer science","score_opus":0.028258918804683928,"score_gpt":0.2992367960539937,"score_spread":0.2709778772493098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241642908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98889536,0.0012694726,0.0026684976,0.000071802286,0.0006797731,0.00010512882,0.000003863818,0.000027571426,0.0062785526],"genre_scores_gemma":[0.99505043,0.00024536776,0.004377527,0.00011083165,0.000131833,6.26579e-7,2.107912e-7,0.000021476735,0.00006170803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977056,0.0004177098,0.0009715399,0.0001371385,0.00047392177,0.00029408935],"domain_scores_gemma":[0.99694914,0.0012089008,0.0010641329,0.00034663774,0.0002988382,0.0001323294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036369967,0.00021945615,0.00060926646,0.0008079172,0.0002473523,0.000020823458,0.0005372438,0.0001315785,0.00006989076],"category_scores_gemma":[0.0007849402,0.00016180096,0.0006995906,0.00056393776,0.00023078558,0.00023299166,0.000043541608,0.0005630513,4.4709074e-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.00038050077,0.000118945805,0.0011899894,0.00004790063,0.00019307683,0.000031999207,0.001649737,0.000007619428,0.0068327542,0.98528874,0.000499042,0.0037596675],"study_design_scores_gemma":[0.0006321267,0.0004966825,0.0034922056,0.00018093857,0.00015479773,0.00017284867,0.0008019251,0.000002019395,0.01076631,0.9829608,0.00017200326,0.0001673148],"about_ca_topic_score_codex":6.2586673e-7,"about_ca_topic_score_gemma":5.315883e-7,"teacher_disagreement_score":0.0062168445,"about_ca_system_score_codex":0.000019330808,"about_ca_system_score_gemma":0.00003453385,"threshold_uncertainty_score":0.6598051},"labels":[],"label_agreement":null},{"id":"W4242606596","doi":"10.1002/jgt.1000","title":"Realizing finite edge‐transitive orientable maps","year":2001,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Transitive relation; Abelian group; Automorphism group; Discrete mathematics","score_opus":0.007512334986247907,"score_gpt":0.20829342766426842,"score_spread":0.20078109267802052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242606596","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.15644863,0.0025402587,0.82080495,0.000044757227,0.0027437336,0.00009749819,0.00002452672,0.000106789965,0.017188828],"genre_scores_gemma":[0.9931681,0.0028523735,0.0033475307,0.000089102665,0.00033169592,0.000001403208,0.0000022762483,0.000035914894,0.00017160467],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993766,0.000034721827,0.00025742222,0.000051057697,0.00010482572,0.00017538514],"domain_scores_gemma":[0.99961865,0.00007268757,0.000079757396,0.0000871155,0.00006687888,0.000074908385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004371486,0.0000959512,0.00018278895,0.000116729025,0.000042875963,0.00001702732,0.00009379562,0.00004625495,0.000081776816],"category_scores_gemma":[0.000028434752,0.00008215486,0.00009018538,0.00013446785,0.000016754151,0.00020929192,0.000008022788,0.0001418514,0.000006763722],"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.0009505804,0.00013288704,0.00007363448,0.0001919617,0.00045114255,0.0008651068,0.0024869044,0.07291358,0.51485616,0.36990708,0.0035861938,0.03358475],"study_design_scores_gemma":[0.0014858796,0.00029242493,0.00007148642,0.00035130835,0.00013131565,0.0006511086,0.0020227316,0.0006038938,0.109961316,0.78646475,0.09752828,0.00043547805],"about_ca_topic_score_codex":6.44213e-7,"about_ca_topic_score_gemma":0.0000010076993,"teacher_disagreement_score":0.83671945,"about_ca_system_score_codex":0.000026542783,"about_ca_system_score_gemma":0.000010244314,"threshold_uncertainty_score":0.3350178},"labels":[],"label_agreement":null},{"id":"W4243040998","doi":"10.1002/jgt.20265","title":"Small cycle double covers of products I: Lexicographic product with paths and cycles","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Dalhousie University","funders":"","keywords":"Cartesian product; Lexicographical order; Combinatorics; Mathematics; Vertex (graph theory); Graph; Product (mathematics); Cartesian coordinate system; Discrete mathematics; Geometry","score_opus":0.022393583621144894,"score_gpt":0.266034926208744,"score_spread":0.24364134258759912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243040998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8919392,0.002458433,0.104093984,0.00030133052,0.00018499169,0.00025931877,0.0000015439252,0.000030969,0.00073020015],"genre_scores_gemma":[0.97481066,0.00023184261,0.024761798,0.000046873516,0.000077721204,0.0000018249085,2.528674e-7,0.000019873016,0.000049183323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787706,0.00020252708,0.00053328567,0.00034552833,0.00059985055,0.0004417232],"domain_scores_gemma":[0.99759376,0.00035913868,0.0006016082,0.0006020233,0.0006380052,0.00020545389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005066737,0.00020096161,0.00037180725,0.0009906406,0.0001298095,0.00006141037,0.00090346613,0.000050950923,0.0000035178336],"category_scores_gemma":[0.00015149332,0.00014353625,0.00012163366,0.0015682357,0.0006973519,0.00074439956,0.00015376248,0.0004207178,8.8425514e-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.0045098355,0.0005347463,0.02465811,0.00019766338,0.0003719298,0.00032119802,0.0022656596,0.00043016498,0.048871405,0.8616407,0.00005463225,0.056143973],"study_design_scores_gemma":[0.0035206878,0.0019923584,0.037916716,0.00030349856,0.000066030305,0.0011894946,0.00071877486,0.000032141445,0.17427312,0.7790168,0.00049792713,0.00047245435],"about_ca_topic_score_codex":0.000004256103,"about_ca_topic_score_gemma":0.000009158566,"teacher_disagreement_score":0.1254017,"about_ca_system_score_codex":0.000018922867,"about_ca_system_score_gemma":0.00013618915,"threshold_uncertainty_score":0.58532387},"labels":[],"label_agreement":null},{"id":"W4243779214","doi":"10.1002/jgt.10097","title":"Crossing numbers of sequences of graphs II: Planar tiles","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Tile; Book embedding; Rational number; 1-planar graph; Planar; Graph; Pathwidth; Discrete mathematics; Sequence (biology); Crossing number (knot theory); Indifference graph; Chordal graph; Line graph; Computer science","score_opus":0.013332105020626376,"score_gpt":0.25113203249037913,"score_spread":0.23779992746975276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243779214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7844809,0.0011878625,0.21291192,0.000054485517,0.00039390824,0.000026603539,0.0000016921077,0.000005174416,0.00093739433],"genre_scores_gemma":[0.96959066,0.00003956636,0.030257633,0.000046821584,0.000022229302,2.444575e-7,3.1143975e-7,0.0000026403761,0.000039878203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890894,0.00017895366,0.000427589,0.00008331913,0.00030682178,0.00009438284],"domain_scores_gemma":[0.99880964,0.00021022027,0.00055451994,0.00012026587,0.00025572226,0.00004964374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012399299,0.000070771326,0.0001815382,0.00033063415,0.0001278796,0.000035617213,0.00030689023,0.000033733784,0.00001759129],"category_scores_gemma":[0.00009736035,0.000057589445,0.0001565751,0.00051200495,0.00016627701,0.00035922742,0.00001702197,0.000090431575,4.5007366e-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.000035321988,0.000104218496,0.0010380462,0.000024229697,0.00006514331,0.000009951711,0.0016497956,0.004395983,0.0413258,0.9440224,0.00023253128,0.007096586],"study_design_scores_gemma":[0.0003774331,0.00033051253,0.002138794,0.00009703669,0.000021694326,0.00019332227,0.00024290658,0.00020211146,0.11805946,0.87752783,0.00070491526,0.00010399883],"about_ca_topic_score_codex":0.0000023509585,"about_ca_topic_score_gemma":0.0000010952137,"teacher_disagreement_score":0.18510972,"about_ca_system_score_codex":0.000008615012,"about_ca_system_score_gemma":0.00017267835,"threshold_uncertainty_score":0.23484294},"labels":[],"label_agreement":null},{"id":"W4245789633","doi":"10.1002/jgt.20328","title":"Cycle spaces in topological spaces","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Hausdorff space; Complement (music); Discrete mathematics; Generalization; Space (punctuation); Zero-dimensional space; Topological space; Topology (electrical circuits); Graph; Line graph; Topological vector space; Computer science; Mathematical analysis","score_opus":0.026632276348587856,"score_gpt":0.2972262758258897,"score_spread":0.27059399947730184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245789633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.903656,0.0017558096,0.090214066,0.0013568372,0.00031292724,0.00007651378,5.762417e-7,0.000032994685,0.0025942533],"genre_scores_gemma":[0.98566544,0.00046192802,0.013394447,0.00021288102,0.00007797077,0.000001856008,6.5464924e-8,0.000007854091,0.00017756652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799275,0.0005544441,0.00039138662,0.0001972622,0.0004927154,0.00037144282],"domain_scores_gemma":[0.9984762,0.00063749397,0.00024588985,0.0003432202,0.00013635926,0.00016080236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020833705,0.0001348445,0.00029903027,0.0006884784,0.00013392825,0.00005618947,0.0012886231,0.000075834294,0.000050982264],"category_scores_gemma":[0.0003273635,0.000098094955,0.00018931915,0.0008966747,0.0004641745,0.0007784462,0.000188774,0.0005277765,0.00001645004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021162647,0.00020113825,0.01160123,0.0000066114244,0.000031778163,0.0012369609,0.001507452,0.00045966357,0.0013747843,0.9782106,0.00030763668,0.0048504844],"study_design_scores_gemma":[0.0005630255,0.00035889779,0.01129615,0.000025877249,0.0000026262362,0.00093382923,0.0002678922,0.00010368895,0.0015185861,0.98371637,0.0010737287,0.00013933716],"about_ca_topic_score_codex":0.0000028624754,"about_ca_topic_score_gemma":0.0000033241363,"teacher_disagreement_score":0.08200941,"about_ca_system_score_codex":0.00003549911,"about_ca_system_score_gemma":0.00008063447,"threshold_uncertainty_score":0.40001962},"labels":[],"label_agreement":null},{"id":"W4245876577","doi":"10.1002/jgt.20300","title":"An improved bound for the strong chromatic number","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Graph; Fractional coloring; Existential quantification; Friendship graph; Degree (music); List coloring; Discrete mathematics; Class (philosophy); Upper and lower bounds; Graph power; Line graph; Computer science; Physics","score_opus":0.018613625486388168,"score_gpt":0.26167220035098676,"score_spread":0.2430585748645986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245876577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.511248,0.0011493508,0.4856942,0.00053466944,0.00094057334,0.00016995912,0.0000013389617,0.000042927997,0.00021900475],"genre_scores_gemma":[0.97887045,0.000067963796,0.02056672,0.00035651374,0.000044510303,0.0000044288163,1.9802738e-7,0.000009573816,0.0000796114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989374,0.0001350955,0.00036956955,0.00012269625,0.0002279396,0.00020724817],"domain_scores_gemma":[0.9984763,0.00044135324,0.00033488593,0.00041712038,0.00022369961,0.00010664386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017430594,0.00010432714,0.00017393683,0.000098599034,0.0003972822,0.00009276498,0.0008345331,0.000041155152,0.000013566018],"category_scores_gemma":[0.00007247682,0.000060334813,0.0002151603,0.000228317,0.00015837135,0.00046031416,0.000035629266,0.00016738713,0.000004666538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001482857,0.0003550746,0.0009607174,0.00003160638,0.00029159788,0.00003706106,0.003167669,0.0005465594,0.015217315,0.96117914,0.0047206013,0.013344384],"study_design_scores_gemma":[0.0010899894,0.0005140368,0.001544888,0.000041608,0.00005034674,0.0008302006,0.00018751212,0.0139569035,0.0015695737,0.97947276,0.00057648687,0.0001656961],"about_ca_topic_score_codex":0.000003818648,"about_ca_topic_score_gemma":0.0000011161114,"teacher_disagreement_score":0.4676225,"about_ca_system_score_codex":0.000010829342,"about_ca_system_score_gemma":0.00009229859,"threshold_uncertainty_score":0.30556136},"labels":[],"label_agreement":null},{"id":"W4247832516","doi":"10.1002/jgt.20271","title":"Maximum acyclic and fragmented sets in regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Bounded function; Graph; Upper and lower bounds; Order (exchange); Discrete mathematics","score_opus":0.01239526032330909,"score_gpt":0.2878449829069343,"score_spread":0.2754497225836252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247832516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7543759,0.0023171618,0.24181175,0.0003202486,0.00025733327,0.00012612091,8.039157e-7,0.000026210297,0.0007644725],"genre_scores_gemma":[0.9830793,0.0003279112,0.016261851,0.00023426235,0.00002875654,0.0000013603424,2.3263266e-7,0.000015317308,0.000050972492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977696,0.00037247027,0.000589127,0.00024487337,0.0005395377,0.00048442185],"domain_scores_gemma":[0.9982451,0.00060811255,0.00031015286,0.000431914,0.00015996114,0.00024475693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066480385,0.00016643938,0.0003008592,0.0015544548,0.000099566,0.000067438334,0.00096599903,0.00008933103,0.000012077913],"category_scores_gemma":[0.00019684741,0.00013818314,0.00015219497,0.0013486351,0.00027951814,0.00077575835,0.00020397523,0.0005718937,0.0000032805094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052242156,0.000194176,0.010730917,0.000025755795,0.00008457512,0.000913966,0.0010791888,0.000034710705,0.011007481,0.8599649,0.00011680097,0.11532509],"study_design_scores_gemma":[0.00096484873,0.0002290527,0.022739677,0.00007670379,0.0000059644835,0.00036358557,0.0002667476,0.000052278723,0.003488147,0.9712794,0.00038882048,0.00014478673],"about_ca_topic_score_codex":0.0000016739922,"about_ca_topic_score_gemma":0.0000065522645,"teacher_disagreement_score":0.22870344,"about_ca_system_score_codex":0.000040226067,"about_ca_system_score_gemma":0.000042364383,"threshold_uncertainty_score":0.56349444},"labels":[],"label_agreement":null},{"id":"W4247937443","doi":"10.1002/jgt.20262","title":"Compatible circuit decompositions of 4‐regular graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Combinatorics; Mathematics; Eulerian path; Conjecture; Vertex (graph theory); Discrete mathematics; Cubic graph; Graph; Line graph; Voltage graph; Pure mathematics; Lagrangian","score_opus":0.020600229845801045,"score_gpt":0.2970902916336,"score_spread":0.27649006178779895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247937443","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.1939235,0.0009994308,0.8018116,0.00007988976,0.00030675795,0.000094778195,0.000002814759,0.000026962573,0.002754286],"genre_scores_gemma":[0.96604824,0.000067331544,0.033685155,0.000090937625,0.000044975037,9.787633e-7,5.3367177e-7,0.000014247255,0.000047607406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975413,0.00033696977,0.00080132013,0.00018684054,0.00071712706,0.00041645832],"domain_scores_gemma":[0.9969568,0.00095144263,0.0006352369,0.0005941258,0.0006133024,0.00024907637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051060715,0.00015786244,0.00038283388,0.0014303867,0.0001620074,0.0000424949,0.0016124746,0.000072152034,0.000045273042],"category_scores_gemma":[0.00011464607,0.00013596623,0.0004165852,0.0015754895,0.00038636528,0.00069544,0.00014099454,0.00041823412,0.0000065194263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011451265,0.00020115805,0.0012608028,0.000018310375,0.00010923417,0.00008362668,0.00044668367,0.00012913103,0.03129669,0.9506061,0.0001251899,0.015608566],"study_design_scores_gemma":[0.00056678214,0.00036976507,0.0066424645,0.000076243436,0.000019229015,0.00028502915,0.0002137623,0.00004664697,0.037688226,0.9537174,0.00023861702,0.00013581793],"about_ca_topic_score_codex":0.0000015570146,"about_ca_topic_score_gemma":0.0000023736857,"teacher_disagreement_score":0.7721247,"about_ca_system_score_codex":0.00003667031,"about_ca_system_score_gemma":0.00007919383,"threshold_uncertainty_score":0.5544542},"labels":[],"label_agreement":null},{"id":"W4248026952","doi":"10.1002/jgt.20314","title":"Hamiltonian threshold for strong products of graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.05477626846595595,"score_gpt":0.2982860674113209,"score_spread":0.24350979894536495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248026952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99151266,0.0015774067,0.0030730069,0.000095695184,0.00087965315,0.00032042226,0.000022044538,0.000020967313,0.0024981291],"genre_scores_gemma":[0.9858664,0.00022918153,0.013321554,0.00006120926,0.00022487223,0.0000043933255,7.697679e-7,0.00004023486,0.00025134184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981476,0.00013861408,0.00085384824,0.00016235985,0.0004083462,0.0002892334],"domain_scores_gemma":[0.9972962,0.00067674875,0.00093385036,0.00043462618,0.00055643695,0.00010211381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018960723,0.00021196187,0.0005794678,0.00046269628,0.00026314403,0.000008969364,0.0004968681,0.0001158577,0.000035691086],"category_scores_gemma":[0.00068703975,0.00014990562,0.000558869,0.00031495123,0.00048645344,0.0001858037,0.000054970864,0.00030654337,3.049815e-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.00057158933,0.00015522593,0.0016439381,0.00017540873,0.00032537148,0.00002086566,0.0018303108,0.000009843605,0.002079191,0.9894866,0.00294733,0.0007543526],"study_design_scores_gemma":[0.00096921885,0.00043119956,0.001964885,0.00009893701,0.00014561224,0.00033047653,0.00034530813,0.0000035822118,0.0081792185,0.98670965,0.000659633,0.00016228129],"about_ca_topic_score_codex":5.9399827e-7,"about_ca_topic_score_gemma":9.157375e-7,"teacher_disagreement_score":0.010248547,"about_ca_system_score_codex":0.000018368393,"about_ca_system_score_gemma":0.000088816,"threshold_uncertainty_score":0.6112974},"labels":[],"label_agreement":null},{"id":"W4248423866","doi":"10.1002/jgt.20310","title":"Disjoint quasi‐kernels in digraphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Combinatorics; Disjoint sets; Mathematics; Vertex (graph theory); Transitive relation; Multipartite; Discrete mathematics; Kernel (algebra); Graph; Physics","score_opus":0.025463151831893203,"score_gpt":0.2833942381524385,"score_spread":0.25793108632054534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248423866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55257934,0.0020653524,0.4421031,0.0004608998,0.00047207114,0.00014530467,0.0000015266572,0.000046143927,0.0021262506],"genre_scores_gemma":[0.9901501,0.0005813822,0.008835644,0.00016986487,0.00006720312,0.0000037288191,1.652634e-7,0.00001580726,0.00017609149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973382,0.00060604216,0.0006700817,0.0002476022,0.00067868776,0.000459406],"domain_scores_gemma":[0.9980184,0.0006139485,0.00036038517,0.00056775054,0.00021401168,0.00022553906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027560838,0.00018131502,0.00038671083,0.0012584276,0.00013864212,0.000044128425,0.0016335641,0.00007275518,0.000029275847],"category_scores_gemma":[0.0003091318,0.00014321988,0.0003444286,0.0015035043,0.0003791862,0.0010725384,0.00019350913,0.0006561544,0.000018829678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027001317,0.0004566732,0.013242186,0.000014137848,0.000064005646,0.0013428695,0.0024434943,0.00020889023,0.0019868375,0.9620948,0.00031038324,0.017565742],"study_design_scores_gemma":[0.0008686811,0.0004141582,0.020716509,0.00006930646,0.00000422541,0.0010758868,0.00016698502,0.00013287613,0.0018466295,0.9739806,0.0005286368,0.00019547965],"about_ca_topic_score_codex":0.0000031613333,"about_ca_topic_score_gemma":0.000003727162,"teacher_disagreement_score":0.43757075,"about_ca_system_score_codex":0.000052586427,"about_ca_system_score_gemma":0.00013380659,"threshold_uncertainty_score":0.5840337},"labels":[],"label_agreement":null},{"id":"W4249553598","doi":"10.1002/jgt.20202","title":"Between ends and fibers","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Equivalence relation; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.01167765994295173,"score_gpt":0.2656986678228765,"score_spread":0.25402100787992477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249553598","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.40140837,0.002267005,0.5897284,0.00066212314,0.00024154173,0.000077052435,0.0000028700936,0.000043537875,0.005569081],"genre_scores_gemma":[0.98200834,0.000055876793,0.017375976,0.0000669253,0.00017596554,7.497517e-7,2.546001e-7,0.000009526343,0.00030639418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986468,0.0002617157,0.00032827753,0.00014707171,0.0003643762,0.00025177238],"domain_scores_gemma":[0.99868006,0.00056894013,0.00022637799,0.00026804334,0.00013290999,0.00012364493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019292,0.00010627868,0.000211783,0.0004798023,0.00010953998,0.000081352475,0.00072303764,0.00004847615,0.000011765609],"category_scores_gemma":[0.00006483551,0.000083635736,0.00012614849,0.00047285383,0.00022033468,0.000603635,0.0001341663,0.00029951736,0.0000040727855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004050042,0.000029919782,0.00808548,0.000008466292,0.000045263827,0.00006835692,0.00015805414,0.000035230743,0.0013429942,0.9463375,0.0005243936,0.04332382],"study_design_scores_gemma":[0.00036783254,0.00016471723,0.017545152,0.000020447413,0.000010053606,0.00012965407,0.00003639455,0.00002011139,0.0018786163,0.9780085,0.0017206335,0.000097900614],"about_ca_topic_score_codex":0.0000018935868,"about_ca_topic_score_gemma":6.50101e-7,"teacher_disagreement_score":0.58059996,"about_ca_system_score_codex":0.000018320592,"about_ca_system_score_gemma":0.000037965663,"threshold_uncertainty_score":0.34105664},"labels":[],"label_agreement":null},{"id":"W4249649555","doi":"10.1002/jgt.20004","title":"Spanning<i>k</i>‐arc‐strong subdigraphs with few arcs in<i>k</i>‐arc‐strong tournaments","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Tournament; Arc (geometry); Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Geometry","score_opus":0.017238159962472115,"score_gpt":0.27887144748304976,"score_spread":0.26163328752057763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249649555","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.4613143,0.002252708,0.53142226,0.0008763335,0.00052571145,0.00040924104,0.0000050638114,0.00009238276,0.0031020285],"genre_scores_gemma":[0.9725305,0.00030349815,0.026543524,0.00028577776,0.00014472925,0.000012913378,0.0000011807352,0.00005862958,0.000119242075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948909,0.0006180955,0.0011062355,0.0005924227,0.0015580344,0.0012342883],"domain_scores_gemma":[0.9966287,0.00045134375,0.0008964287,0.000996079,0.00046147243,0.0005659743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037145165,0.0005006213,0.0007614562,0.0020303654,0.0002956311,0.00028723112,0.0028406344,0.00014662047,0.000030030023],"category_scores_gemma":[0.00014363423,0.00039256067,0.00044219586,0.0025090259,0.00062704086,0.0022454557,0.00035135713,0.0016252826,0.00001991876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014180089,0.0007565553,0.022331303,0.00006382071,0.00036459285,0.0021522352,0.0025848674,0.010166226,0.0033101744,0.94237703,0.00010618708,0.01436897],"study_design_scores_gemma":[0.0072110305,0.002245989,0.017580852,0.001050384,0.00006092429,0.0018722889,0.0012861965,0.00009805291,0.007995432,0.9589945,0.00073345145,0.0008708769],"about_ca_topic_score_codex":0.0000145034,"about_ca_topic_score_gemma":0.00003640504,"teacher_disagreement_score":0.5112162,"about_ca_system_score_codex":0.00027697027,"about_ca_system_score_gemma":0.00047321513,"threshold_uncertainty_score":0.99985266},"labels":[],"label_agreement":null},{"id":"W4249657637","doi":"10.1002/jgt.20375","title":"Circular choosability","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Conseil Régional Provence-Alpes-Côte d'Azur; Commonwealth Scholarship Commission; University of Oxford","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Bounded function; Planar; Generalization; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015441950375016986,"score_gpt":0.28929294776738507,"score_spread":0.27385099739236807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249657637","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.15158862,0.0016825872,0.8413615,0.0014823998,0.00038354786,0.0001124893,7.494934e-7,0.00005915684,0.003328908],"genre_scores_gemma":[0.98414457,0.00006684974,0.015137511,0.0004894176,0.00009671887,6.4302395e-7,9.5396395e-8,0.0000059125323,0.000058289123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979934,0.0005002014,0.0004298745,0.00019596546,0.0005618763,0.0003186727],"domain_scores_gemma":[0.9982339,0.0003155649,0.00026950284,0.0006570397,0.00031149,0.00021248686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038515504,0.00012709788,0.00025640384,0.00040960847,0.00011402631,0.00007826982,0.0016153425,0.000057103676,0.000034009896],"category_scores_gemma":[0.00041103328,0.00009957777,0.0003171924,0.0007786059,0.00015539078,0.0008717224,0.00007530927,0.00045781955,0.000014860975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009148647,0.00016063316,0.0004605238,0.000005924027,0.00003448377,0.00010188051,0.00026440452,0.00008142699,0.0062559727,0.9186892,0.00019186302,0.07366219],"study_design_scores_gemma":[0.00035441376,0.0003518366,0.009442089,0.000019290177,0.000006262122,0.00023506233,0.00003820826,0.000057809484,0.0029862446,0.98547095,0.00092929864,0.000108516084],"about_ca_topic_score_codex":1.9843817e-7,"about_ca_topic_score_gemma":7.474651e-8,"teacher_disagreement_score":0.83255595,"about_ca_system_score_codex":0.00004516591,"about_ca_system_score_gemma":0.00008673444,"threshold_uncertainty_score":0.40606636},"labels":[],"label_agreement":null},{"id":"W4249894547","doi":"10.1002/jgt.10148","title":"Weakening arcs in tournaments","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"","keywords":"Tournament; Arc (geometry); Mathematics; Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.017712551384883285,"score_gpt":0.288039795630729,"score_spread":0.27032724424584575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249894547","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.31218034,0.002003142,0.6743246,0.00023072121,0.0007366479,0.00012253717,4.785125e-7,0.000025228548,0.010376343],"genre_scores_gemma":[0.97009015,0.00013695637,0.029366957,0.00015684596,0.000032473567,0.0000018214593,4.5010655e-8,0.0000119654915,0.00020279697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976413,0.00079388294,0.0005031658,0.00016676587,0.0005123527,0.00038251907],"domain_scores_gemma":[0.9985863,0.0004388831,0.00030373433,0.0003544427,0.0001525831,0.00016405417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045574983,0.00012658218,0.0002488114,0.00089470064,0.000081973165,0.00007755089,0.001041887,0.00005080667,0.000043036278],"category_scores_gemma":[0.00052069593,0.00010437651,0.00017001065,0.0009967443,0.000103301405,0.00081441813,0.00008379377,0.0005684468,0.00001070407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007217936,0.00011295289,0.0055243527,0.0000064412543,0.000035417586,0.00029200615,0.0006253788,0.00027387205,0.0024585351,0.9751052,0.00009795056,0.015395712],"study_design_scores_gemma":[0.00080515275,0.00017449225,0.0016125025,0.00007856469,0.0000036367992,0.00038171228,0.0002287019,0.00008070613,0.0032654307,0.99155855,0.0016851628,0.00012540836],"about_ca_topic_score_codex":5.156732e-7,"about_ca_topic_score_gemma":0.0000012809207,"teacher_disagreement_score":0.6579098,"about_ca_system_score_codex":0.0000644616,"about_ca_system_score_gemma":0.00010557588,"threshold_uncertainty_score":0.42563504},"labels":[],"label_agreement":null},{"id":"W4250341181","doi":"10.1002/jgt.20416","title":"Proof of a conjecture on fractional Ramsey numbers","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Conjecture; Generalization; Ramsey theory; Circulant matrix; Discrete mathematics; Integer (computer science); Circulant graph; Graph; Line graph","score_opus":0.0183920116111076,"score_gpt":0.29888762282226716,"score_spread":0.28049561121115957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250341181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97086495,0.00050720957,0.0063360096,0.000541985,0.0009345504,0.00020830666,0.000014088998,0.000023168399,0.020569716],"genre_scores_gemma":[0.99665153,0.000024521034,0.0023881304,0.0004981706,0.00025284698,6.326194e-7,5.0208445e-7,0.000015727448,0.00016794098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836373,0.00024566945,0.0006085936,0.00011071697,0.00049306906,0.00017821242],"domain_scores_gemma":[0.99774384,0.0008540492,0.00085008226,0.00025470415,0.00020341006,0.00009390321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013372798,0.00017569102,0.00042591145,0.00031874378,0.000114071896,0.000013115476,0.00030558067,0.00014567065,0.00026252188],"category_scores_gemma":[0.0005301257,0.00011721285,0.0004401375,0.00020771693,0.00016542601,0.00011931286,0.00001703477,0.0005429067,8.0215733e-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.0009404092,0.00024393242,0.00015149305,0.000030576135,0.00020292678,0.000028356093,0.0009068834,0.000060095794,0.000556012,0.98785096,0.0032199703,0.0058083762],"study_design_scores_gemma":[0.00075736566,0.0007682878,0.0011669514,0.0001349964,0.00008972154,0.00025308016,0.00022606087,0.000002648642,0.005168052,0.99048483,0.0008270621,0.000120958124],"about_ca_topic_score_codex":3.5894746e-7,"about_ca_topic_score_gemma":3.615579e-7,"teacher_disagreement_score":0.025786564,"about_ca_system_score_codex":0.00002522974,"about_ca_system_score_gemma":0.000053788703,"threshold_uncertainty_score":0.4779801},"labels":[],"label_agreement":null},{"id":"W4250937028","doi":"10.1002/jgt.10140","title":"Steiner type problems for digraphs that are locally semicomplete or extended semicomplete","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Combinatorics; Graph; Polynomial; Directed graph; Discrete mathematics","score_opus":0.05605105297153749,"score_gpt":0.30124318246946197,"score_spread":0.24519212949792446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250937028","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.03437703,0.0030427272,0.95901376,0.00036878046,0.001118546,0.0007949361,0.00001963282,0.000116877396,0.0011477259],"genre_scores_gemma":[0.9257316,0.000498339,0.07113004,0.0008232538,0.00016135181,0.00003855328,0.0000025956726,0.00009540694,0.0015188624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963533,0.00076984795,0.00078431214,0.0004780501,0.0008073022,0.0008071562],"domain_scores_gemma":[0.9956624,0.0012493132,0.0009160909,0.00087831484,0.0009327686,0.00036110336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037542577,0.00037485856,0.0006579058,0.00086391316,0.00030152305,0.00019029732,0.001984733,0.00013537599,0.00006990981],"category_scores_gemma":[0.0006759689,0.00026070775,0.0005118918,0.0013619097,0.00032023422,0.0009592048,0.00015961316,0.00062396214,0.000012160565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017395267,0.00037392695,0.0011749051,0.0001871533,0.00046947302,0.00018477775,0.00068908744,0.0006471144,0.02321108,0.9551472,0.0026179056,0.013557851],"study_design_scores_gemma":[0.002148635,0.0012926175,0.00050257327,0.00027533923,0.000042825955,0.0007759578,0.00033236705,0.00035940186,0.005216573,0.9649348,0.02365999,0.00045886435],"about_ca_topic_score_codex":6.9182033e-7,"about_ca_topic_score_gemma":0.0000062546733,"teacher_disagreement_score":0.89135456,"about_ca_system_score_codex":0.000071138486,"about_ca_system_score_gemma":0.00023991238,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W4251499002","doi":"10.1002/jgt.20036","title":"Graphs with independent perfect matchings","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph theorem; Strong perfect graph theorem; Perfect graph; Trivially perfect graph; Matching (statistics); Discrete mathematics; Line graph; Graph; Pathwidth","score_opus":0.009461830976999132,"score_gpt":0.2545278158753462,"score_spread":0.24506598489834705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251499002","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.42068866,0.000593255,0.5768531,0.0004722705,0.0002231542,0.0001119319,8.1897434e-7,0.00004916851,0.0010076185],"genre_scores_gemma":[0.97042525,0.00009551882,0.029075697,0.00025965492,0.00004883105,0.0000032825753,1.594335e-7,0.000021755583,0.00006987912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976788,0.00029335162,0.00040627227,0.00025677818,0.0009416797,0.0004230963],"domain_scores_gemma":[0.99823284,0.0002569706,0.00039375262,0.00053597137,0.0003234078,0.000257055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00266372,0.00020569409,0.00031423874,0.00084723765,0.00019557757,0.00014059326,0.0016637356,0.00006695413,0.000021879492],"category_scores_gemma":[0.000084595435,0.00013913785,0.00026440204,0.0010265714,0.00026616844,0.0011798453,0.0001651146,0.0007361675,0.00001634973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032710622,0.0001415922,0.0007481507,0.000012975829,0.00011939086,0.00041956163,0.0010922776,0.0010607856,0.0028509477,0.986265,0.00002516734,0.006937024],"study_design_scores_gemma":[0.0014067987,0.00091144105,0.001971515,0.000105748324,0.000016143213,0.001574988,0.0002163398,0.000008040547,0.005354081,0.98810947,0.00013687812,0.00018853619],"about_ca_topic_score_codex":0.0000035112653,"about_ca_topic_score_gemma":0.0000037185077,"teacher_disagreement_score":0.54973656,"about_ca_system_score_codex":0.00007372459,"about_ca_system_score_gemma":0.00020629216,"threshold_uncertainty_score":0.5673877},"labels":[],"label_agreement":null},{"id":"W4251896413","doi":"10.1002/jgt.20248","title":"On the chromatic spectrum of acyclic decompositions of graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Partition (number theory); Bipartite graph; Spectrum (functional analysis); Graph; Chromatic polynomial; Discrete mathematics","score_opus":0.00556956968964261,"score_gpt":0.2045617445571517,"score_spread":0.1989921748675091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251896413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868899,0.00079247454,0.0054997453,0.000041913852,0.0004690838,0.00009454638,0.000005477578,0.0000181161,0.006188736],"genre_scores_gemma":[0.9997434,0.000059763093,0.00009230522,0.000027495296,0.00004533854,0.0000010005655,3.4379224e-7,0.000018540524,0.000011796739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986589,0.00015639176,0.00071071304,0.00005159242,0.00024523554,0.00017715734],"domain_scores_gemma":[0.998351,0.0009288301,0.00034760492,0.00025315065,0.000054419215,0.00006501912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023096516,0.000127174,0.00031506555,0.00048757158,0.000057496105,0.000007391331,0.00031848368,0.00005912951,0.00009606159],"category_scores_gemma":[0.000050504597,0.00008303861,0.0003815388,0.0004566059,0.00016432902,0.000078609126,0.000009671164,0.00025450205,0.0000040214177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015427444,0.0001206161,0.00037662897,0.00011574763,0.00039412055,0.000015006859,0.0008105455,0.0012022447,0.06103774,0.9350051,0.0003410417,0.00042687592],"study_design_scores_gemma":[0.0003586763,0.00029393687,0.0074960412,0.00038475782,0.000087097564,0.00013501303,0.00083163934,0.0000388607,0.09013326,0.9000824,0.000050494105,0.00010783556],"about_ca_topic_score_codex":0.0000011533884,"about_ca_topic_score_gemma":0.0000030307592,"teacher_disagreement_score":0.034922764,"about_ca_system_score_codex":0.00001512525,"about_ca_system_score_gemma":0.000009834527,"threshold_uncertainty_score":0.33862165},"labels":[],"label_agreement":null},{"id":"W4253190912","doi":"10.1002/jgt.10041","title":"Projectivity and independent sets in powers of graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Champlain Regional College; Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02923283402548195,"score_gpt":0.2822847666308228,"score_spread":0.25305193260534087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253190912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99485254,0.0012323892,0.00015991347,0.000045070643,0.00025584773,0.00012573859,0.0000046143537,0.000007099203,0.003316759],"genre_scores_gemma":[0.9983903,0.00033825435,0.0011495575,0.00004197362,0.00002099953,0.0000011322221,6.843755e-8,0.000015594098,0.00004211975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984178,0.00036278373,0.0005814889,0.000118945,0.00033507252,0.00018393046],"domain_scores_gemma":[0.9984342,0.0006291782,0.000551454,0.0002065281,0.000102899205,0.00007574838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021371914,0.00014818336,0.00042119884,0.00065692654,0.000063030566,0.00001183489,0.00021917096,0.000112495596,0.000099257166],"category_scores_gemma":[0.0004058779,0.00010697973,0.00020336518,0.0003069463,0.00025648222,0.00017059785,0.0000651523,0.00040750133,2.275552e-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.0003165372,0.00033801503,0.026122963,0.00014460739,0.00020138777,0.00007881418,0.0074425233,0.000004076188,0.0007027854,0.95545304,0.0004104468,0.008784823],"study_design_scores_gemma":[0.0008550936,0.00021818186,0.0151707055,0.00011033842,0.000048605063,0.00022459983,0.0007946384,0.000010473136,0.0005965905,0.9818168,0.000041160423,0.00011277216],"about_ca_topic_score_codex":0.0000029009877,"about_ca_topic_score_gemma":0.0000069048,"teacher_disagreement_score":0.02636382,"about_ca_system_score_codex":0.00001849343,"about_ca_system_score_gemma":0.0000133734975,"threshold_uncertainty_score":0.4362507},"labels":[],"label_agreement":null},{"id":"W4253689634","doi":"10.1002/jgt.20334","title":"Bounding χ in terms of ω and Δ for quasi‐line graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"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; McGill University","keywords":"Combinatorics; Mathematics; Line graph; Conjecture; Cubic graph; Graph; Discrete mathematics; Omega; Vertex (graph theory); Vertex-transitive graph; Graph power; Voltage graph; Physics","score_opus":0.04185691599901831,"score_gpt":0.3278837972455143,"score_spread":0.286026881246496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253689634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61491495,0.0008810238,0.3834916,0.00014464215,0.00019641258,0.00013973154,0.0000023179673,0.0000091325555,0.00022020162],"genre_scores_gemma":[0.97552687,0.00044413735,0.02388853,0.00004794232,0.00003710237,0.0000035466405,1.6183301e-7,0.000009898354,0.00004182686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985532,0.0002129597,0.0005168265,0.00015710152,0.0002999967,0.00025992768],"domain_scores_gemma":[0.99832594,0.0008195139,0.00035645178,0.00025246144,0.00013896658,0.000106680665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026036096,0.000110446475,0.0003289789,0.0009965919,0.00010388194,0.000020317086,0.00065145094,0.000050059683,0.0000029153841],"category_scores_gemma":[0.00030708243,0.00008823667,0.00017373518,0.00066943443,0.00036491646,0.00056573894,0.000093117786,0.00024365148,2.781362e-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.0003830427,0.000165044,0.011844054,0.00004586663,0.00004330856,0.00007609963,0.0013017327,0.0000594811,0.00556461,0.96752596,0.00004598981,0.01294484],"study_design_scores_gemma":[0.0010654539,0.0006746533,0.004539714,0.000082514,0.0000052811747,0.00036904064,0.00008349929,0.0003805802,0.0029851373,0.9895996,0.00011909736,0.00009541808],"about_ca_topic_score_codex":9.996614e-7,"about_ca_topic_score_gemma":0.0000023375653,"teacher_disagreement_score":0.36061192,"about_ca_system_score_codex":0.00001774529,"about_ca_system_score_gemma":0.000045426827,"threshold_uncertainty_score":0.35981873},"labels":[],"label_agreement":null},{"id":"W4255025375","doi":"10.1002/jgt.20480","title":"Cycle and cocycle coverings of graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Cover (algebra); Discrete mathematics; Simple graph","score_opus":0.006994280001931636,"score_gpt":0.2609395767562744,"score_spread":0.25394529675434274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255025375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92640287,0.00046903637,0.07113025,0.00019328127,0.00038988152,0.00006664175,0.00000217507,0.000018465502,0.0013274145],"genre_scores_gemma":[0.98433757,0.00013310245,0.015358746,0.00009115526,0.000031009324,9.543392e-7,7.1119906e-8,0.000010148973,0.00003725769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986837,0.00015459889,0.0003843223,0.00015299188,0.0003943633,0.00023004887],"domain_scores_gemma":[0.99831194,0.00048007927,0.00037539308,0.00040017528,0.00025622567,0.00017620453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021776382,0.00011301728,0.00026329805,0.0005010052,0.000074758536,0.00004738864,0.0009292215,0.00006410361,0.000028681186],"category_scores_gemma":[0.00023675773,0.000091280024,0.00016157776,0.00051169086,0.00046740336,0.0006919643,0.00019542177,0.0005210181,0.0000020890159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010345022,0.00006478331,0.0017120324,0.000016995355,0.000043588752,0.00002550241,0.00037536529,0.000017687755,0.08604925,0.8965266,0.000072422634,0.014992351],"study_design_scores_gemma":[0.0005076618,0.00023076184,0.0054901494,0.000021782962,0.000008559998,0.00026299077,0.000059456517,0.000088735964,0.019624244,0.9730149,0.0005916515,0.00009912064],"about_ca_topic_score_codex":0.0000020124153,"about_ca_topic_score_gemma":0.000001978054,"teacher_disagreement_score":0.076488316,"about_ca_system_score_codex":0.000005519035,"about_ca_system_score_gemma":0.000048951206,"threshold_uncertainty_score":0.37222913},"labels":[],"label_agreement":null},{"id":"W4255327711","doi":"10.1002/jgt.20307","title":"Odd‐angulated graphs and cancelling factors in box products","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Homomorphism; Mathematics; Graph; Graph homomorphism; Girth (graph theory); Discrete mathematics; Path (computing); Connectivity; Graph power; Line graph; Computer science","score_opus":0.025640238291251068,"score_gpt":0.2670994768727819,"score_spread":0.24145923858153084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255327711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9777198,0.0032119877,0.018284198,0.00016164091,0.00029110693,0.00012223913,9.911524e-7,0.000031875614,0.00017619829],"genre_scores_gemma":[0.9929811,0.00094141474,0.0058880686,0.000053453412,0.000029166518,0.0000015119696,2.6672075e-7,0.000014615878,0.00009043559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980432,0.0003685193,0.00047494523,0.00027365898,0.00044976026,0.00038995128],"domain_scores_gemma":[0.9985454,0.00036351502,0.00029516214,0.00036213765,0.00026202315,0.00017177491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016738008,0.0001757969,0.0003300496,0.0010638495,0.00016714269,0.000041255844,0.0007730962,0.000067776695,0.000007344882],"category_scores_gemma":[0.00026791508,0.000138112,0.000110316876,0.0015493243,0.00034596075,0.00081032387,0.00011653531,0.0005424806,0.0000014269974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000654971,0.00045053943,0.123596266,0.0001057935,0.00024045078,0.0018185591,0.015335565,0.0013714076,0.045413427,0.79646844,0.0003379815,0.014206625],"study_design_scores_gemma":[0.0009682118,0.00030759038,0.04367033,0.000114563845,0.000009090744,0.00069400435,0.00030474493,0.0001586519,0.026232589,0.92700565,0.00024317333,0.00029141255],"about_ca_topic_score_codex":0.000009434852,"about_ca_topic_score_gemma":0.000005326867,"teacher_disagreement_score":0.13053723,"about_ca_system_score_codex":0.00003914433,"about_ca_system_score_gemma":0.00013240414,"threshold_uncertainty_score":0.56320435},"labels":[],"label_agreement":null},{"id":"W4255798272","doi":"10.1002/jgt.20006","title":"Interval bigraphs and circular arc graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":78,"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; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Interval graph; Chordal graph; Indifference graph; Bipartite graph; Cograph; Conjecture; Discrete mathematics; Split graph; Permutation graph; Vertex (graph theory); Interval (graph theory); Graph; 1-planar graph","score_opus":0.015949460529420006,"score_gpt":0.2725096860002505,"score_spread":0.25656022547083046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255798272","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.47934455,0.0043243705,0.51427037,0.0007052481,0.0004746357,0.00012528032,0.0000018316694,0.000057107904,0.00069658016],"genre_scores_gemma":[0.98037034,0.00052790146,0.01868665,0.000310762,0.000052322855,0.0000026968526,1.9570332e-7,0.000018430192,0.000030704196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978137,0.0003616153,0.00051812513,0.0002902567,0.00059855345,0.00041776057],"domain_scores_gemma":[0.9982344,0.00028288484,0.000338901,0.00053216756,0.0002824128,0.00032924872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027767795,0.00020813632,0.00035649486,0.0012287477,0.0001738268,0.00014217637,0.0013537067,0.000084317086,0.000012611037],"category_scores_gemma":[0.00021069526,0.0001668371,0.00036980063,0.0011251896,0.000506126,0.0010043342,0.00024584142,0.00061273685,0.000006912717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011082998,0.00010790374,0.00073475926,0.000022750204,0.00013254558,0.0002752341,0.0008292059,0.00009943292,0.0050913393,0.9709149,0.000027363294,0.02165373],"study_design_scores_gemma":[0.0010719011,0.00044862018,0.002491829,0.00009877181,0.000017604189,0.0010415195,0.00019336835,0.000015972644,0.0038061526,0.99043256,0.00019906629,0.00018262524],"about_ca_topic_score_codex":0.0000020096854,"about_ca_topic_score_gemma":0.000001419948,"teacher_disagreement_score":0.5010258,"about_ca_system_score_codex":0.000036593963,"about_ca_system_score_gemma":0.00010329421,"threshold_uncertainty_score":0.6803419},"labels":[],"label_agreement":null},{"id":"W4256250877","doi":"10.1002/jgt.20203","title":"Closure for the property of having a hamiltonian prism","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Quartic graph; Graph; Hamiltonian (control theory); Prism; Graph power; Discrete mathematics; Line graph; Physics; Optics","score_opus":0.016521925811267636,"score_gpt":0.27070374401507796,"score_spread":0.2541818182038103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256250877","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.041295804,0.0026650869,0.95306915,0.0012794973,0.00036977348,0.0003786336,0.0000028702575,0.000023032284,0.0009161678],"genre_scores_gemma":[0.96152645,0.00006743298,0.037222233,0.00010907596,0.00017287825,0.000012080169,2.0879106e-7,0.00001914701,0.0008704672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824286,0.0002896405,0.00052708073,0.00015728286,0.00048106434,0.00030206423],"domain_scores_gemma":[0.99743664,0.0010887706,0.0005164543,0.00051466184,0.00038014268,0.00006333368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038732719,0.00012868359,0.0002587415,0.0002978301,0.00021105545,0.00006573346,0.0016263061,0.00005770169,0.000005694],"category_scores_gemma":[0.0002410494,0.00006231091,0.00037005634,0.0005301111,0.00030595213,0.00045023582,0.00013071523,0.00033033357,0.0000011636786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003507813,0.00018082283,0.0019710204,0.000045297737,0.0001284786,0.000023728982,0.0006205535,0.00040707528,0.012371001,0.92951894,0.0014789011,0.052903406],"study_design_scores_gemma":[0.00073454995,0.0003872263,0.00525956,0.00008271595,0.000028065348,0.00013121495,0.00011762045,0.00067532616,0.0069763116,0.97884387,0.006642288,0.000121269586],"about_ca_topic_score_codex":0.000005632626,"about_ca_topic_score_gemma":0.0000043538707,"teacher_disagreement_score":0.9202307,"about_ca_system_score_codex":0.000024068102,"about_ca_system_score_gemma":0.0001196792,"threshold_uncertainty_score":0.30221084},"labels":[],"label_agreement":null},{"id":"W4256470456","doi":"10.1002/jgt.10105","title":"Large families of mutually embeddable vertex‐transitive graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Transitive relation; Vertex (graph theory); Pairwise comparison; Discrete mathematics; Transitive reduction; Cograph; Symmetric graph; Indifference graph; Graph; Chordal graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.014956704986095042,"score_gpt":0.2893921467029325,"score_spread":0.2744354417168375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256470456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91510576,0.0018637755,0.051822096,0.00004010464,0.0006051362,0.0001367576,0.000018661447,0.000023937857,0.030383795],"genre_scores_gemma":[0.9942844,0.0003085351,0.0048419414,0.00012972459,0.000021607244,0.0000015554749,5.0377434e-7,0.000025068914,0.00038664282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805754,0.000663149,0.0006369178,0.0001160265,0.00024024956,0.0002861074],"domain_scores_gemma":[0.9974916,0.0013593156,0.00054526253,0.00023764781,0.00027922657,0.00008692419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025180604,0.00017646313,0.00052962016,0.00035138114,0.00010019344,0.0000048575257,0.00022696206,0.00014180737,0.00023597862],"category_scores_gemma":[0.0009500641,0.00013848963,0.00035539633,0.0002671183,0.00036337966,0.00016768317,0.000015276246,0.00039082806,0.0000027577214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040930146,0.00030336087,0.00030364093,0.00005302743,0.00028927124,0.000053168165,0.0036580039,0.000009929556,0.001939372,0.99254435,0.0001946008,0.00024194465],"study_design_scores_gemma":[0.0011233324,0.00029321492,0.0001194076,0.000092295275,0.00013998331,0.00017880491,0.008969223,0.0000023882678,0.011014577,0.97749954,0.0004322362,0.00013500974],"about_ca_topic_score_codex":4.0939105e-7,"about_ca_topic_score_gemma":0.000004308211,"teacher_disagreement_score":0.07917869,"about_ca_system_score_codex":0.000015500867,"about_ca_system_score_gemma":0.000079455334,"threshold_uncertainty_score":0.56474435},"labels":[],"label_agreement":null},{"id":"W4256731050","doi":"10.1002/jgt.20161","title":"The <i>k</i>‐piece packing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Degree (music); Discrete mathematics; Matching (statistics); Time complexity","score_opus":0.0032558662240646835,"score_gpt":0.17592902342813926,"score_spread":0.17267315720407458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256731050","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.10963771,0.03379799,0.43693662,0.0019787524,0.006442237,0.0006049149,0.000010684621,0.0007155335,0.40987557],"genre_scores_gemma":[0.996023,0.0005300508,0.0025939497,0.00006233081,0.00024366209,0.0000014655988,6.965511e-7,0.000028734103,0.00051610096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928194,0.000057897214,0.00031892877,0.000037923855,0.00015096988,0.00015235755],"domain_scores_gemma":[0.9995003,0.00015970923,0.000120450604,0.00010082583,0.00008406216,0.00003469663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086055684,0.000083360945,0.00010380337,0.00008831951,0.00012017042,0.0000787409,0.00016841033,0.00003832669,0.00002562346],"category_scores_gemma":[0.000016419444,0.000053383203,0.00010567624,0.00018801063,0.000048625618,0.000116196075,0.0000082872675,0.0002038328,0.0000071177888],"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.00006396219,0.00004941298,0.0018456207,0.000064714775,0.00017797817,0.000023319566,0.0004923462,0.57402736,0.0032847056,0.36196938,0.034583658,0.023417557],"study_design_scores_gemma":[0.0010684375,0.000118494914,0.0019195462,0.00023499994,0.00007875309,0.00028614988,0.00027142177,0.003285674,0.0040081292,0.76838845,0.21994567,0.00039429136],"about_ca_topic_score_codex":9.2906305e-7,"about_ca_topic_score_gemma":0.0000036729386,"teacher_disagreement_score":0.8863853,"about_ca_system_score_codex":0.000016708926,"about_ca_system_score_gemma":0.000011813926,"threshold_uncertainty_score":0.21769038},"labels":[],"label_agreement":null},{"id":"W4289885984","doi":"10.1002/jgt.22870","title":"Characterizing circular colouring mixing for pq&lt;4 $\\frac{p}{q}\\lt 4$","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Homomorphism; Conjecture; Bipartite graph; Vertex (graph theory); Mixing (physics); Graph; Planar graph; Discrete mathematics; Physics","score_opus":0.022589676475499584,"score_gpt":0.28187799252581675,"score_spread":0.25928831605031716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289885984","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.29217976,0.0015688676,0.70317626,0.0008160057,0.0013006631,0.00041081276,0.00001173731,0.000073445444,0.00046247817],"genre_scores_gemma":[0.9795678,0.000057054876,0.019250838,0.0005946707,0.00023469128,0.00006123838,0.0000015583726,0.000042620213,0.00018950601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968045,0.0007397266,0.0006574824,0.00033618,0.000854053,0.0006080623],"domain_scores_gemma":[0.9972402,0.0010105293,0.00068055117,0.0005551337,0.00030179234,0.00021181292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067539364,0.00020506827,0.0004081232,0.0009223257,0.0008927473,0.00015700769,0.0022085574,0.000049506652,0.00006687573],"category_scores_gemma":[0.0003523378,0.00019924341,0.00051176414,0.0009242031,0.00012408037,0.00093442673,0.00062302133,0.0007571375,0.0000036325728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073327526,0.00028573943,0.0005377569,0.00010079463,0.0003225865,0.00043265795,0.0028552094,0.0014310523,0.21085852,0.7355015,0.000439558,0.046501316],"study_design_scores_gemma":[0.0015959325,0.0009341041,0.00087698566,0.0000809082,0.000038117098,0.0010217893,0.00072952785,0.0014142956,0.014195366,0.9529391,0.025746336,0.0004275182],"about_ca_topic_score_codex":4.109373e-7,"about_ca_topic_score_gemma":2.443674e-7,"teacher_disagreement_score":0.68738806,"about_ca_system_score_codex":0.00015998355,"about_ca_system_score_gemma":0.00016361363,"threshold_uncertainty_score":0.81249106},"labels":[],"label_agreement":null},{"id":"W4300427120","doi":"10.1002/jgt.22899","title":"Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Victoria","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Degree (music); Vertex connectivity; Minimum degree spanning tree; Graph; Discrete mathematics","score_opus":0.02316656221824536,"score_gpt":0.24907062528834673,"score_spread":0.22590406307010136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300427120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99608517,0.0005162276,0.00031539184,0.000112942274,0.00037995997,0.00013433416,0.000024726893,0.00001502199,0.0024162447],"genre_scores_gemma":[0.9963468,0.000044033743,0.0032275748,0.00006832694,0.000036875113,0.000003308027,0.0000012586689,0.00003499091,0.00023687414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975108,0.00060952926,0.00075081456,0.00018394786,0.00065286556,0.00029206282],"domain_scores_gemma":[0.9975735,0.00088899897,0.0009228413,0.0003635441,0.00015564206,0.000095475756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020388798,0.00022362814,0.0006069961,0.0011000072,0.00035385982,0.000011583711,0.00063618197,0.00007447171,0.00021843161],"category_scores_gemma":[0.000211427,0.00016147051,0.0003047939,0.00083735754,0.0003275573,0.00017601406,0.00023250598,0.0007069824,1.3465025e-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.0043299524,0.0003164621,0.002344049,0.000042207696,0.00038159764,0.0003612703,0.008753038,0.0002466014,0.0009520607,0.97969264,0.0010210841,0.0015590566],"study_design_scores_gemma":[0.0028590902,0.0014732714,0.0057311403,0.00017510475,0.0001670401,0.00033807068,0.0054291137,0.000017229662,0.0005465474,0.98271394,0.00033827062,0.00021117255],"about_ca_topic_score_codex":0.000016841701,"about_ca_topic_score_gemma":0.000032028835,"teacher_disagreement_score":0.0033870912,"about_ca_system_score_codex":0.000065066255,"about_ca_system_score_gemma":0.00011339102,"threshold_uncertainty_score":0.65845764},"labels":[],"label_agreement":null},{"id":"W4303438707","doi":"10.1002/jgt.22897","title":"Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Victoria","funders":"Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Degree (music); Minimum degree spanning tree; Graph; Discrete mathematics; Spanning tree","score_opus":0.02759842679262543,"score_gpt":0.26144774214522915,"score_spread":0.23384931535260373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303438707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974306,0.00030256508,0.0004282417,0.000053204185,0.00035632477,0.00012791093,0.000020145759,0.000016172267,0.0012647884],"genre_scores_gemma":[0.9962459,0.000028459843,0.0035065974,0.00006059712,0.000037371123,0.0000025457646,0.0000017192568,0.000038653114,0.000078157645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727196,0.0008605799,0.0007357908,0.00019488664,0.0006435895,0.00029318244],"domain_scores_gemma":[0.997534,0.0009080105,0.0008717186,0.0004103408,0.00015784171,0.000118094154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023120765,0.00022230226,0.0005878174,0.0010777748,0.00024401964,0.000016053338,0.0006778599,0.00007254867,0.00015444546],"category_scores_gemma":[0.00020748886,0.00016566986,0.0002491925,0.0007503765,0.00031900342,0.00025841035,0.00013970876,0.00066647277,1.3462368e-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.004049492,0.0003752592,0.004738246,0.000042869397,0.00031743123,0.0003365977,0.0072236075,0.00073175726,0.0008605832,0.9789914,0.00021618458,0.002116567],"study_design_scores_gemma":[0.0025790217,0.0018163176,0.014180219,0.00013664432,0.00017222334,0.000350026,0.008853506,0.000040168678,0.00033094603,0.97127473,0.000052572716,0.00021362181],"about_ca_topic_score_codex":0.000020338006,"about_ca_topic_score_gemma":0.00004414013,"teacher_disagreement_score":0.009441973,"about_ca_system_score_codex":0.00006511801,"about_ca_system_score_gemma":0.00011039549,"threshold_uncertainty_score":0.67558205},"labels":[],"label_agreement":null},{"id":"W4381798257","doi":"10.1002/jgt.22987","title":"Polynomial bounds for chromatic number VII. Disjoint holes","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Disjoint sets; Chromatic scale; Bounded function; Graph; Chromatic polynomial; Discrete mathematics; Integer (computer science); Constant (computer programming)","score_opus":0.02322918043151791,"score_gpt":0.31729970638571847,"score_spread":0.2940705259542006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381798257","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.35630623,0.00035172259,0.63828593,0.0015592492,0.0015354985,0.00034246736,0.000012957886,0.000180783,0.0014251951],"genre_scores_gemma":[0.9830956,0.0000938126,0.015348718,0.00019686508,0.00036046698,0.000020286381,0.0000015537393,0.000035430225,0.0008472887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792945,0.00028846788,0.0005359683,0.00022260158,0.00052409037,0.00049940904],"domain_scores_gemma":[0.9976461,0.0010761293,0.00035541126,0.00047987103,0.00023806436,0.00020441414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034374732,0.00017121295,0.0003431906,0.00059382897,0.00024905958,0.00017488809,0.0013771458,0.00006972328,0.000035939214],"category_scores_gemma":[0.0004127957,0.0001347557,0.00044424998,0.0011028924,0.00032878452,0.0007520693,0.00022537628,0.00030158777,0.00008876887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057491707,0.000205465,0.0008656632,0.00013193113,0.00032694868,0.00019161274,0.002054594,0.00027524112,0.012607171,0.9066915,0.029969314,0.046105634],"study_design_scores_gemma":[0.0010021896,0.00031698876,0.0020251728,0.000087696855,0.000019679377,0.0002241842,0.0002531691,0.0008414034,0.0028339766,0.98749954,0.004689919,0.00020607474],"about_ca_topic_score_codex":5.880769e-7,"about_ca_topic_score_gemma":8.328681e-7,"teacher_disagreement_score":0.6267894,"about_ca_system_score_codex":0.00005275433,"about_ca_system_score_gemma":0.00013392161,"threshold_uncertainty_score":0.5495178},"labels":[],"label_agreement":null},{"id":"W4386606114","doi":"10.1002/jgt.23029","title":"On Stahl's conjectures about the region distributions of bouquets","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Conjecture; Mathematics; Combinatorics; Vertex (graph theory); Sequence (biology); Graph; Set (abstract data type); Surface (topology); Mode (computer interface); Discrete mathematics; Geometry; Computer science","score_opus":0.041273728764694505,"score_gpt":0.3318132162235318,"score_spread":0.29053948745883734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386606114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9267576,0.0003681487,0.06779352,0.000954146,0.0015634301,0.0003584146,0.0000313695,0.000089466266,0.0020839567],"genre_scores_gemma":[0.998864,0.00011400968,0.0006659574,0.00004470351,0.000118290765,0.0000041082017,0.0000010272356,0.00002426692,0.00016364633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847543,0.00025940285,0.0005960461,0.0000771708,0.00040714096,0.00018479337],"domain_scores_gemma":[0.99460906,0.003793445,0.0008836316,0.00038483675,0.00027095462,0.000058048743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012180028,0.00013342776,0.00033501344,0.00019403324,0.00013241566,0.000017308043,0.00038748112,0.00007145017,0.000020268448],"category_scores_gemma":[0.0033707172,0.00007887374,0.00027373663,0.0004706924,0.00020502319,0.00007680567,0.000048772927,0.00034108077,0.0000064020737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012303231,0.000105931984,0.000015427133,0.000058502308,0.000096144584,0.00002468995,0.0007504229,0.00005098487,0.00036362436,0.98932874,0.008684121,0.00039837408],"study_design_scores_gemma":[0.00042942277,0.00022682615,0.0002474527,0.00024054167,0.0000805419,0.00006028685,0.00057929335,0.000008703898,0.0022970045,0.9952227,0.0005293922,0.00007782394],"about_ca_topic_score_codex":4.2508003e-7,"about_ca_topic_score_gemma":6.437694e-7,"teacher_disagreement_score":0.072106436,"about_ca_system_score_codex":0.000038911578,"about_ca_system_score_gemma":0.000053600434,"threshold_uncertainty_score":0.40353066},"labels":[],"label_agreement":null},{"id":"W4387172124","doi":"10.1002/jgt.23035","title":"The edge‐connectivity of vertex‐transitive hypergraphs","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Hypergraph; Discrete mathematics; Transitive reduction; Automorphism; Graph; Line graph; Voltage graph","score_opus":0.01647421525668126,"score_gpt":0.2826238086771157,"score_spread":0.2661495934204344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387172124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8146431,0.0024311915,0.17507955,0.0017949314,0.0017053264,0.00027548563,0.0000075618204,0.000118403106,0.003944454],"genre_scores_gemma":[0.9984439,0.0006117111,0.00068742957,0.00005334727,0.000048104717,0.0000039665692,1.668108e-7,0.000014803811,0.00013654462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732226,0.00090513634,0.00048576645,0.00019650855,0.0006753015,0.0004150422],"domain_scores_gemma":[0.9947167,0.0036452604,0.0003840346,0.000595885,0.0005195751,0.0001385321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005891709,0.00015082718,0.00031674007,0.00067389366,0.0002831811,0.00005584565,0.0017273516,0.00006281004,0.000005113762],"category_scores_gemma":[0.0006823951,0.000097250006,0.00040175222,0.0023351256,0.0005826305,0.0004583808,0.00019040155,0.0004847111,0.000009078048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031992435,0.00007397101,0.0007064046,0.000015520256,0.00021126057,0.0000842007,0.001063199,0.00013254644,0.011155414,0.9324096,0.00029233453,0.053535637],"study_design_scores_gemma":[0.0004670177,0.00033598221,0.007553786,0.000052634794,0.00001585032,0.000091547736,0.000545616,0.00048543132,0.010609926,0.9792909,0.00043544662,0.00011583609],"about_ca_topic_score_codex":0.0000017403829,"about_ca_topic_score_gemma":0.0000036357058,"teacher_disagreement_score":0.18380083,"about_ca_system_score_codex":0.000022688528,"about_ca_system_score_gemma":0.00013257399,"threshold_uncertainty_score":0.39657402},"labels":[],"label_agreement":null},{"id":"W4388850666","doi":"10.1002/jgt.23055","title":"Induced subgraphs and tree decompositions V. one neighbor in a hole","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; 1-planar graph; Mathematics; Tree-depth; Clique-sum; Partial k-tree; Tree decomposition; Vertex (graph theory); Discrete mathematics; Bounded function; Pathwidth; Chordal graph; Graph; Line graph","score_opus":0.031559004045184,"score_gpt":0.30382379051584285,"score_spread":0.2722647864706589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388850666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492087,0.00058634277,0.0479014,0.0011012114,0.00020583603,0.0001405083,0.0000027042684,0.00006596939,0.000787342],"genre_scores_gemma":[0.993001,0.0003531554,0.0064115175,0.00012323319,0.000041470033,0.0000068344552,5.5693613e-7,0.000014077904,0.000048153237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981466,0.00043970032,0.0004256175,0.0002170915,0.00040041647,0.0003705948],"domain_scores_gemma":[0.9983543,0.00076122425,0.00019861023,0.00035222218,0.00014280409,0.00019081001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991767,0.00013190141,0.0002807009,0.0020178761,0.00012995432,0.00009313912,0.00080544275,0.0000689347,0.000010193938],"category_scores_gemma":[0.00016849939,0.00011748595,0.00014381985,0.0027218782,0.00015887427,0.00074525847,0.00021163409,0.000491888,0.00001264544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019155865,0.00019111739,0.004027156,0.000017875802,0.00007843533,0.0002995819,0.0012456344,0.00009089769,0.051114287,0.89138806,0.00012588539,0.05122949],"study_design_scores_gemma":[0.0009126943,0.0003193659,0.049904875,0.00008722598,0.000008198983,0.000090170906,0.00021313256,0.00037931727,0.0026179883,0.9452761,0.000050009032,0.00014096456],"about_ca_topic_score_codex":0.0000037402542,"about_ca_topic_score_gemma":0.000023137618,"teacher_disagreement_score":0.05388798,"about_ca_system_score_codex":0.00002734904,"about_ca_system_score_gemma":0.00007129553,"threshold_uncertainty_score":0.47909382},"labels":[],"label_agreement":null},{"id":"W4388938474","doi":"10.1002/jgt.23060","title":"A graph polynomial from chromatic symmetric functions","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chromatic polynomial; Mathematics; Tutte polynomial; Combinatorics; Chromatic scale; Symmetric function; Discrete mathematics; Elementary symmetric polynomial; Graph; Symmetric polynomial; Polynomial; Matrix polynomial; Voltage graph; Line graph; Orthogonal polynomials; Mathematical analysis; Difference polynomials","score_opus":0.03316427340480621,"score_gpt":0.29863891765580686,"score_spread":0.26547464425100065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388938474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9534953,0.0005132621,0.0380713,0.0002611572,0.0043842746,0.0002790967,0.000031670163,0.00025845438,0.002705464],"genre_scores_gemma":[0.9867956,0.00011492433,0.011375266,0.000051673323,0.0008560941,0.000012360126,0.00000365536,0.00009109275,0.0006993134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771905,0.00025981068,0.0009482845,0.0001568985,0.0005872562,0.00032871283],"domain_scores_gemma":[0.9944173,0.003827656,0.00091493555,0.00045068574,0.00021489887,0.00017453649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013005713,0.00023181312,0.00059612095,0.0013038954,0.00016594236,0.000049268438,0.0004666433,0.00012711652,0.00015492507],"category_scores_gemma":[0.002835991,0.00018915394,0.00048699474,0.0021655466,0.000114646304,0.000267939,0.00008776122,0.00043925073,0.0001411699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033581725,0.00065780623,0.0002488681,0.00021204114,0.001049227,0.0002754321,0.0019807445,0.000053813746,0.004212304,0.9423951,0.04384691,0.004731949],"study_design_scores_gemma":[0.0010449999,0.00020051401,0.00033505613,0.00017088949,0.00027051815,0.00008981561,0.0009641874,0.000043436597,0.0004802878,0.9957433,0.0004678108,0.00018918923],"about_ca_topic_score_codex":0.000002445351,"about_ca_topic_score_gemma":0.0000015267785,"teacher_disagreement_score":0.053348206,"about_ca_system_score_codex":0.00007633254,"about_ca_system_score_gemma":0.00008155984,"threshold_uncertainty_score":0.7713474},"labels":[],"label_agreement":null},{"id":"W4391821761","doi":"10.1002/jgt.23085","title":"Degree criteria and stability for independent transversals","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Bounded function; Vertex (graph theory); Partition (number theory); Transversal (combinatorics); Independent set; Discrete mathematics; Existential quantification; Degree (music); Social connectedness; Graph","score_opus":0.07414025603468731,"score_gpt":0.3427614761729238,"score_spread":0.26862122013823647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391821761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9534292,0.0047320584,0.038499698,0.00024714792,0.0015087145,0.00025837935,0.000053139836,0.000039291062,0.0012323296],"genre_scores_gemma":[0.9941516,0.00014487337,0.005338013,0.000068583606,0.00021430878,0.0000040593777,3.9905638e-7,0.000026809788,0.000051343377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987243,0.0002135986,0.00050004653,0.0001506039,0.0002284006,0.00018308467],"domain_scores_gemma":[0.9976968,0.0017472786,0.0001378803,0.00018337637,0.00013148542,0.00010317996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034600238,0.00015198597,0.00032630115,0.00023320549,0.00012822328,0.000078677374,0.00020047207,0.00010541908,0.00019349407],"category_scores_gemma":[0.000376521,0.0001021763,0.00034147556,0.00011057583,0.00018835581,0.0002046725,0.000033054974,0.00027201508,3.0314737e-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.0004712963,0.000044219738,0.00011932168,0.0004932049,0.00029549169,0.000028297058,0.0039882003,1.8178473e-7,0.0025895745,0.97925395,0.001079319,0.01163693],"study_design_scores_gemma":[0.00046085284,0.00022671207,0.000409768,0.00013234129,0.0002074246,0.00019404014,0.0007301383,0.000016401553,0.002521545,0.9934929,0.0014887786,0.00011909436],"about_ca_topic_score_codex":4.4656232e-7,"about_ca_topic_score_gemma":0.000002066388,"teacher_disagreement_score":0.04072237,"about_ca_system_score_codex":0.000022818997,"about_ca_system_score_gemma":0.00004200603,"threshold_uncertainty_score":0.41666287},"labels":[],"label_agreement":null},{"id":"W4392595156","doi":"10.1002/jgt.23089","title":"Finding triangle‐free 2‐factors in general graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Carnegie Mellon University","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029967797853744167,"score_gpt":0.31226156345549816,"score_spread":0.282293765601754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392595156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80873805,0.0067983624,0.1795198,0.0006074215,0.0022135556,0.00017033638,0.000006270959,0.00010833995,0.0018378373],"genre_scores_gemma":[0.9914464,0.00026034555,0.007682533,0.00007971534,0.00013848585,0.0000033762024,4.830371e-7,0.000027070371,0.00036162505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973649,0.0005945917,0.0006444377,0.00029050306,0.0006345724,0.0004710126],"domain_scores_gemma":[0.9978019,0.0011531325,0.0001819049,0.0005660465,0.000106560256,0.00019046088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042030443,0.00020193183,0.00037728206,0.0025236937,0.0000938551,0.0002461932,0.0020650423,0.00009276241,0.000047535297],"category_scores_gemma":[0.0004741498,0.00015202614,0.00047292834,0.0023657829,0.0001638917,0.0013168134,0.00026326763,0.0008236737,0.000009504353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088442604,0.0000536144,0.0017819601,0.000027175653,0.00008194543,0.00065443775,0.0010751974,0.00014085002,0.0032822588,0.978518,0.000533946,0.013762178],"study_design_scores_gemma":[0.0005719744,0.00020067614,0.0027080495,0.00016796529,0.000010527527,0.00017991733,0.00014586646,0.00045449284,0.0031686898,0.991317,0.000900294,0.0001745473],"about_ca_topic_score_codex":0.000003303319,"about_ca_topic_score_gemma":0.0000056872072,"teacher_disagreement_score":0.1827083,"about_ca_system_score_codex":0.00008884434,"about_ca_system_score_gemma":0.00015664115,"threshold_uncertainty_score":0.61994463},"labels":[],"label_agreement":null},{"id":"W4395452445","doi":"10.1002/jgt.23091","title":"Another proof of Seymour's 6‐flow theorem","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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","keywords":"Mathematics; Mathematical proof; Combinatorial proof; Generalization; Combinatorics; Robertson–Seymour theorem; Graph; Discrete mathematics; Flow (mathematics); Graph minor; Voltage graph; 1-planar graph; Line graph; Mathematical analysis; Geometry","score_opus":0.016249949979179206,"score_gpt":0.2863374115613792,"score_spread":0.2700874615822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395452445","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.012252812,0.0070650363,0.9747042,0.00064773246,0.0007940627,0.0001482975,0.0000055691507,0.0000613035,0.00432098],"genre_scores_gemma":[0.96378744,0.0001389556,0.034831233,0.00015800985,0.00018861215,0.000003845994,2.455352e-7,0.000038444163,0.0008532375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976608,0.000522828,0.0005679977,0.00023686113,0.0006813753,0.0003301188],"domain_scores_gemma":[0.99799395,0.00076276984,0.00026556363,0.0005432998,0.00031713216,0.00011729162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040860013,0.00017446373,0.00033911224,0.00089734176,0.00006565249,0.00011196735,0.0015063626,0.000077703495,0.000115939845],"category_scores_gemma":[0.00018132677,0.00012223682,0.0004162219,0.0012092763,0.00035377996,0.00086937717,0.0001771477,0.00050013256,0.00001293335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013921781,0.000087971945,0.000052527103,0.00007531089,0.00017120682,0.00016846853,0.0010269659,0.00034489483,0.0051772757,0.8587099,0.0005603968,0.13348588],"study_design_scores_gemma":[0.00026719057,0.0003595532,0.00007928284,0.00023724102,0.000019357312,0.0003049695,0.000095697935,0.0015921642,0.025998907,0.967843,0.0030697212,0.000132893],"about_ca_topic_score_codex":4.3871896e-7,"about_ca_topic_score_gemma":4.1208088e-7,"teacher_disagreement_score":0.9515346,"about_ca_system_score_codex":0.00003564568,"about_ca_system_score_gemma":0.00019003879,"threshold_uncertainty_score":0.49846724},"labels":[],"label_agreement":null},{"id":"W4395462958","doi":"10.1002/jgt.23104","title":"Tree independence number I. (Even hole, diamond, pyramid)‐free graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Alexander von Humboldt-Stiftung","keywords":"Treewidth; Combinatorics; Mathematics; Bounded function; Clique-sum; Partial k-tree; Tree-depth; Discrete mathematics; Chordal graph; Independent set; Tree decomposition; Conjecture; 1-planar graph; Graph; Pathwidth; Line graph","score_opus":0.014898540024867096,"score_gpt":0.2909779846108253,"score_spread":0.27607944458595823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395462958","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.12603205,0.011634615,0.8324231,0.0021624104,0.0040282714,0.00041159874,0.000025368592,0.00046204546,0.022820553],"genre_scores_gemma":[0.98421466,0.000618222,0.013511697,0.00022541116,0.00022422553,0.000010292191,6.5116734e-7,0.000053280288,0.001141562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959677,0.000639694,0.0007487345,0.00049257337,0.0014884134,0.0006628845],"domain_scores_gemma":[0.9966073,0.001109918,0.0002947088,0.0012072315,0.00039956818,0.0003812995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0046120966,0.00032392252,0.00044766683,0.0011495806,0.0001926129,0.00046058474,0.004042409,0.00018176805,0.00016089756],"category_scores_gemma":[0.00045934314,0.0002542937,0.0006443473,0.0023971733,0.0005199139,0.0022910773,0.0006319416,0.0014757769,0.00014584744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011813933,0.00009456605,0.0008226453,0.000045730972,0.0001960975,0.0010331322,0.0006865003,0.00006180566,0.0017239638,0.92277485,0.003324879,0.069117695],"study_design_scores_gemma":[0.00051052397,0.00022483087,0.001171127,0.00021203581,0.00003191011,0.0007799085,0.00017772886,0.0004332803,0.0021039972,0.99137247,0.0026863704,0.0002958031],"about_ca_topic_score_codex":0.0000031463665,"about_ca_topic_score_gemma":0.000006993225,"teacher_disagreement_score":0.8581826,"about_ca_system_score_codex":0.00006314513,"about_ca_system_score_gemma":0.00027269352,"threshold_uncertainty_score":0.99999094},"labels":[],"label_agreement":null},{"id":"W4396700657","doi":"10.1002/jgt.23113","title":"Gallai‐like characterization of strong cocomparability graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Characterization (materials science); Combinatorics; Discrete mathematics; Physics","score_opus":0.0202377984288647,"score_gpt":0.29752501998863096,"score_spread":0.27728722155976626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396700657","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.4236257,0.0009683916,0.5734885,0.00019083546,0.00089902786,0.00014002777,0.000007946364,0.00005733892,0.0006222473],"genre_scores_gemma":[0.99621123,0.00015121317,0.003416493,0.000037644837,0.000060778395,0.0000031147406,0.0000014259383,0.000015109932,0.00010299659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975919,0.0005616156,0.00069083256,0.00024977818,0.000625647,0.0002802157],"domain_scores_gemma":[0.9981107,0.0005157503,0.00033734075,0.0005010109,0.00038624633,0.00014892062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033588503,0.00015870009,0.0003515001,0.0008693178,0.00007601573,0.000114135975,0.0011335793,0.000065051565,0.000054388165],"category_scores_gemma":[0.00009243798,0.00012510114,0.00036717462,0.0012849515,0.0003027845,0.001181121,0.00014255718,0.0004527964,0.000007676317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012906638,0.00010200139,0.00089841307,0.00009720576,0.000118514705,0.000043600212,0.00054090115,0.0000500397,0.05598611,0.92414665,0.000055954326,0.01783155],"study_design_scores_gemma":[0.0002981285,0.00034783926,0.008278202,0.00020827807,0.0000250573,0.00013299122,0.00006740046,0.0009932,0.010652172,0.97772163,0.0011133567,0.00016177085],"about_ca_topic_score_codex":5.833299e-7,"about_ca_topic_score_gemma":5.1322786e-7,"teacher_disagreement_score":0.5725855,"about_ca_system_score_codex":0.00004040887,"about_ca_system_score_gemma":0.00014511064,"threshold_uncertainty_score":0.51014763},"labels":[],"label_agreement":null},{"id":"W4396811638","doi":"10.1002/jgt.23106","title":"Sharp threshold for embedding balanced spanning trees in random geometric graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Spanning tree; Embedding; Random graph; Discrete mathematics; Graph; Computer science","score_opus":0.013372051844963158,"score_gpt":0.29692687222800784,"score_spread":0.2835548203830447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396811638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598809,0.007554951,0.4281752,0.00012253117,0.0004045163,0.00028534525,0.000015956095,0.0000646324,0.0034959784],"genre_scores_gemma":[0.9971885,0.000057074503,0.00221413,0.000022151433,0.00037886304,0.000016762246,0.0000047430126,0.000024966514,0.0000928249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987665,0.0000744582,0.00055534986,0.00016321588,0.00018644513,0.00025402312],"domain_scores_gemma":[0.99880224,0.00068475265,0.00022479024,0.00014268866,0.000083201114,0.0000623364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017901213,0.00015752288,0.0004432023,0.0016536391,0.000067731475,0.00012211034,0.00026856712,0.000035489036,0.00016839149],"category_scores_gemma":[0.000024773863,0.00012546116,0.00069722236,0.0014474767,0.000041667143,0.00023621188,0.000034149856,0.00032704262,0.0000013542232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010346931,0.0002716187,0.06584121,0.000079671954,0.0016713728,0.0000570176,0.00088185497,0.0074122753,0.00451968,0.7712541,0.008935052,0.13804142],"study_design_scores_gemma":[0.0015339861,0.0001286791,0.0024208785,0.0005154616,0.00021762724,0.000007880489,0.00038362533,0.008740707,0.0012210881,0.9826842,0.0019147389,0.00023114703],"about_ca_topic_score_codex":0.000006602384,"about_ca_topic_score_gemma":0.000002571323,"teacher_disagreement_score":0.4373076,"about_ca_system_score_codex":0.000029568735,"about_ca_system_score_gemma":0.000042221156,"threshold_uncertainty_score":0.51161575},"labels":[],"label_agreement":null},{"id":"W4396867382","doi":"10.1002/jgt.23117","title":"Density of 3‐critical signed graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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; University of Waterloo","funders":"Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Indo-French Centre for Applied Mathematics; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Signed graph; Discrete mathematics; Graph","score_opus":0.01684958187808392,"score_gpt":0.3136223571510856,"score_spread":0.29677277527300167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396867382","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.10905311,0.0044304114,0.8833614,0.0007615609,0.0010805528,0.00008061857,0.0000033011836,0.00006830187,0.0011607651],"genre_scores_gemma":[0.98488045,0.00008459366,0.014805024,0.000079055695,0.0000654451,0.000001138215,1.2212669e-7,0.000014098044,0.000070104536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771583,0.00053440314,0.00054059894,0.00022104479,0.00067122275,0.00031690995],"domain_scores_gemma":[0.9968258,0.0019654203,0.00013178335,0.00043632384,0.00044196247,0.0001986932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035005314,0.00014296867,0.00032629297,0.0009558774,0.00008292902,0.00009564001,0.00118813,0.00007502739,0.000045972167],"category_scores_gemma":[0.0006239074,0.00010981646,0.0004413605,0.0012846638,0.0005856924,0.0008439507,0.00018776403,0.000520231,0.000013267872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009664279,0.000090502566,0.00012681188,0.000081038605,0.000080214566,0.00033961982,0.0004194863,0.000012730385,0.014226541,0.97108084,0.00022740384,0.013218184],"study_design_scores_gemma":[0.0001690106,0.00035957704,0.00040161095,0.0001376074,0.000024750489,0.00039526809,0.00009137524,0.00026806875,0.016058523,0.98179865,0.00018527338,0.00011029783],"about_ca_topic_score_codex":7.07785e-7,"about_ca_topic_score_gemma":4.5441743e-7,"teacher_disagreement_score":0.8758273,"about_ca_system_score_codex":0.000025328287,"about_ca_system_score_gemma":0.00014997038,"threshold_uncertainty_score":0.44781852},"labels":[],"label_agreement":null},{"id":"W4399739735","doi":"10.1002/jgt.23143","title":"A tight upper bound on the average order of dominating sets of a graph","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Order (exchange); Discrete mathematics","score_opus":0.016489319360998834,"score_gpt":0.2957467529953223,"score_spread":0.2792574336343235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399739735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82802904,0.004297855,0.1613744,0.0014548316,0.0007587729,0.00029924698,0.00001543211,0.000041114767,0.0037292852],"genre_scores_gemma":[0.99543524,0.00016675775,0.004039452,0.00013882144,0.000051534196,0.000004309925,2.7247125e-7,0.000015488555,0.00014811933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971876,0.00074561854,0.00066688604,0.00022851893,0.0008553468,0.00031599085],"domain_scores_gemma":[0.9955133,0.0030013504,0.000425467,0.00051397504,0.00044681662,0.00009907798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004877963,0.00018521909,0.00036165642,0.0007880866,0.00013690829,0.00010415499,0.0014457422,0.00007017438,0.000099025645],"category_scores_gemma":[0.00045275892,0.00010031338,0.00044524178,0.0018485879,0.00040031128,0.0004989637,0.00020020235,0.0006933884,0.000006341074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021224993,0.00012668337,0.00011554997,0.00008996578,0.00024991093,0.00011225801,0.0021671404,0.00018623687,0.017235557,0.9527295,0.00030428864,0.02647066],"study_design_scores_gemma":[0.00034357837,0.00050769676,0.00051534467,0.0005771522,0.000025100562,0.00016754703,0.00023767215,0.0009269977,0.020284366,0.9756257,0.00065259234,0.00013626905],"about_ca_topic_score_codex":0.0000016376711,"about_ca_topic_score_gemma":0.0000012777075,"teacher_disagreement_score":0.16740619,"about_ca_system_score_codex":0.00002906008,"about_ca_system_score_gemma":0.00014485524,"threshold_uncertainty_score":0.4090661},"labels":[],"label_agreement":null},{"id":"W4399973719","doi":"10.1002/jgt.23146","title":"Attainable bounds for algebraic connectivity and maximally connected regular graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Algebraic number; Algebraic connectivity; Discrete mathematics; Graph; Line graph","score_opus":0.008902518721699832,"score_gpt":0.23630028197731293,"score_spread":0.2273977632556131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399973719","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.24183317,0.0058451863,0.74770445,0.0008819162,0.0026765878,0.00021699947,0.0000035379283,0.00009855469,0.00073962036],"genre_scores_gemma":[0.9968006,0.000115252806,0.0021719448,0.00021699852,0.00024009185,0.000010236596,5.1262765e-7,0.000017898687,0.00042644187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847835,0.00028307486,0.00046855662,0.00026578695,0.00021954073,0.0002846614],"domain_scores_gemma":[0.9981707,0.00088968215,0.00021895701,0.00024837497,0.000347109,0.00012521657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033437307,0.00016427043,0.00033789687,0.00053443364,0.00020904223,0.0005206658,0.00041747052,0.00010007197,0.000013753476],"category_scores_gemma":[0.00015186622,0.00012748153,0.00031562135,0.0005612532,0.00011014082,0.0007662627,0.0000658679,0.000250902,0.0000020285274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085709005,0.000029621335,0.00008433945,0.000098578945,0.00020185095,0.000068822614,0.00053633936,0.00003336001,0.0011241175,0.9857531,0.00360164,0.008382478],"study_design_scores_gemma":[0.0005783875,0.0007160833,0.00050882075,0.0002607142,0.000042584332,0.0012394717,0.0002487758,0.00970914,0.0005404827,0.96720815,0.018740034,0.00020738646],"about_ca_topic_score_codex":0.0000050794974,"about_ca_topic_score_gemma":0.000005572169,"teacher_disagreement_score":0.75496745,"about_ca_system_score_codex":0.00004188314,"about_ca_system_score_gemma":0.000108516644,"threshold_uncertainty_score":0.51985455},"labels":[],"label_agreement":null},{"id":"W4400869467","doi":"10.1002/jgt.23152","title":"Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Claw; Planar straight-line graph; Chordal graph; Planar; Outerplanar graph; 1-planar graph; Pathwidth; Discrete mathematics; Graph; Computer science; Line graph; Biology","score_opus":0.017210814976967793,"score_gpt":0.28433814695748216,"score_spread":0.26712733198051436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400869467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9376929,0.019364499,0.037767753,0.0019337746,0.0011326094,0.00047206468,0.0000460311,0.00041016837,0.0011802164],"genre_scores_gemma":[0.9879427,0.0016583274,0.0098763835,0.0002814233,0.00008597053,0.000014618884,0.0000037145326,0.00006675217,0.00007012438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530745,0.0011321717,0.0010792303,0.0007203875,0.0009120551,0.0008486896],"domain_scores_gemma":[0.99580455,0.0021740685,0.00037061697,0.00095932843,0.0002534634,0.00043798034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036930088,0.0004862863,0.0007969959,0.003694593,0.00024664236,0.0004358255,0.0023415352,0.00023762355,0.000031019386],"category_scores_gemma":[0.00060043065,0.00039537225,0.0003999056,0.0029669781,0.00068630127,0.0016754955,0.00025281272,0.0013806834,0.000011039003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051522744,0.00012820389,0.0073875207,0.0001108464,0.00031887324,0.0012021704,0.0014107482,0.000045447654,0.005965472,0.96942765,0.00090037036,0.012587448],"study_design_scores_gemma":[0.0013871994,0.0004427808,0.015603722,0.00056181697,0.000047516914,0.0010310372,0.0005070027,0.00066343474,0.0012596167,0.9775597,0.00047819677,0.00045797208],"about_ca_topic_score_codex":0.000018520943,"about_ca_topic_score_gemma":0.00009952483,"teacher_disagreement_score":0.050249804,"about_ca_system_score_codex":0.000068347006,"about_ca_system_score_gemma":0.00019131333,"threshold_uncertainty_score":0.9998498},"labels":[],"label_agreement":null},{"id":"W4400869481","doi":"10.1002/jgt.23154","title":"Defective acyclic colorings of planar graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Dawson College","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Discrete mathematics; Graph; Computer science","score_opus":0.009394072168464702,"score_gpt":0.24578520217700098,"score_spread":0.2363911300085363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400869481","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.39075842,0.0032811982,0.60269654,0.0002786152,0.00094501383,0.00005430796,0.000002186574,0.000027983117,0.001955738],"genre_scores_gemma":[0.9927137,0.00009325842,0.00697497,0.000076709744,0.00006363152,9.972812e-7,4.3190488e-7,0.0000041241583,0.000072181196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915665,0.00011338018,0.00028513663,0.000103257305,0.00025206487,0.00008953437],"domain_scores_gemma":[0.99911886,0.00042016886,0.00015735584,0.00010117962,0.00014929782,0.000053154254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804576,0.000069381866,0.00013786906,0.0005927915,0.00004349775,0.00005556474,0.0003066561,0.000031592193,0.000009842928],"category_scores_gemma":[0.00005722494,0.000055169454,0.00019199598,0.0007947593,0.000043991753,0.00043223894,0.000028217311,0.00014877063,0.0000046740483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032737174,0.000034922297,0.000103614824,0.00002171084,0.00010058562,0.00003273573,0.00051285344,0.00045063355,0.004470615,0.978492,0.00047229847,0.015275282],"study_design_scores_gemma":[0.00016820866,0.00030129778,0.003534891,0.000086929766,0.000026948283,0.00019880457,0.000052495136,0.0005889844,0.007597705,0.98494345,0.0024263784,0.00007387905],"about_ca_topic_score_codex":9.812193e-7,"about_ca_topic_score_gemma":5.242466e-7,"teacher_disagreement_score":0.60195524,"about_ca_system_score_codex":0.000017391265,"about_ca_system_score_gemma":0.00008930041,"threshold_uncertainty_score":0.22497451},"labels":[],"label_agreement":null},{"id":"W4401741676","doi":"10.1002/jgt.23166","title":"On vertex‐transitive graphs with a unique hamiltonian cycle","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian path; Cayley graph; Hamiltonian path problem; Discrete mathematics; Pancyclic graph; Vertex-transitive graph; Symmetric graph; Indifference graph; Vertex (graph theory); Transitive relation; Hamiltonian (control theory); Chordal graph; Graph; 1-planar graph; Voltage graph; Line graph","score_opus":0.010948259799427781,"score_gpt":0.26747416958913867,"score_spread":0.2565259097897109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401741676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97129244,0.00093688373,0.014449507,0.000769462,0.0004791922,0.000110799025,0.0000062817653,0.000058310252,0.011897147],"genre_scores_gemma":[0.99816126,0.00007525075,0.0010831727,0.00023643537,0.00004854805,0.000001995924,2.8478263e-7,0.000029220135,0.000363837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887985,0.0002062159,0.0003108723,0.00013217384,0.0002610702,0.00020980024],"domain_scores_gemma":[0.99804175,0.0014587275,0.00013598402,0.0001586124,0.00009990675,0.00010501022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009869491,0.00015420293,0.00030390784,0.0008681426,0.00005659068,0.000030444686,0.00017801358,0.00008814415,0.00014386424],"category_scores_gemma":[0.00018640744,0.00009739393,0.00021380112,0.0007599246,0.00018754351,0.00008621937,0.00001123355,0.00048793005,0.000008974507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028510726,0.0001160081,0.00005688172,0.000053208747,0.00034778033,0.00053321524,0.0011243918,0.000007391592,0.0001261748,0.9932634,0.00078583555,0.003300581],"study_design_scores_gemma":[0.00044812832,0.00093470415,0.00049180124,0.00032823675,0.00013445737,0.00063390634,0.00056453276,0.000017080865,0.000489141,0.99555516,0.00028120689,0.00012165863],"about_ca_topic_score_codex":0.0000028488312,"about_ca_topic_score_gemma":0.0000054182715,"teacher_disagreement_score":0.026868837,"about_ca_system_score_codex":0.000027562033,"about_ca_system_score_gemma":0.00009390098,"threshold_uncertainty_score":0.39716095},"labels":[],"label_agreement":null},{"id":"W4402811414","doi":"10.1002/jgt.23169","title":"Finding dense minors using average degree","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.08344911252887244,"score_gpt":0.3362640378418241,"score_spread":0.2528149253129517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710374,0.003420971,0.02000588,0.00003555649,0.0022564377,0.00007760881,0.0000062331615,0.000045996032,0.0031139466],"genre_scores_gemma":[0.9898477,0.00009755511,0.0090307,0.00008582263,0.00048455087,5.3999344e-7,2.2352698e-7,0.000047880763,0.0004050224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983165,0.0002862535,0.0006008209,0.00015034627,0.00037189285,0.0002741422],"domain_scores_gemma":[0.99798775,0.0012551,0.00028128957,0.0002505553,0.000106405714,0.000118915894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023475143,0.00020478567,0.0003506311,0.0006438287,0.00023231111,0.00009874698,0.0003416238,0.0001256328,0.00027399842],"category_scores_gemma":[0.00042986393,0.00014321513,0.00052160997,0.0003520121,0.00014900621,0.00025776483,0.00008112177,0.0005430519,0.0000038598796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013826594,0.000034459263,0.0002450603,0.00018775271,0.00042359202,0.0006754859,0.0035053585,0.00003891465,0.002278913,0.98233235,0.0012050713,0.008934794],"study_design_scores_gemma":[0.0002298282,0.00007624729,0.0001539035,0.00040704943,0.00022225031,0.001435086,0.00045012994,0.00013597263,0.0015010121,0.9944411,0.0007704364,0.00017698025],"about_ca_topic_score_codex":8.363972e-7,"about_ca_topic_score_gemma":0.0000010479608,"teacher_disagreement_score":0.018810336,"about_ca_system_score_codex":0.00005793634,"about_ca_system_score_gemma":0.00006771743,"threshold_uncertainty_score":0.5840144},"labels":[],"label_agreement":null},{"id":"W4403214649","doi":"10.1002/jgt.23192","title":"Towards Nash‐Williams orientation conjecture for infinite graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Combinatorics; Orientation (vector space); Nash equilibrium; Discrete mathematics; Mathematical economics; Geometry","score_opus":0.019004085473819626,"score_gpt":0.31852215968629016,"score_spread":0.29951807421247056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403214649","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.028448073,0.0039925654,0.96344006,0.0008544394,0.0021162322,0.0002588933,0.000014248445,0.00010274271,0.00077275344],"genre_scores_gemma":[0.94741416,0.00048900687,0.050662607,0.00046863113,0.00033748118,0.000027922888,0.000004025469,0.000048717367,0.0005474718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997985,0.00027769402,0.0005150253,0.00029091162,0.0005642344,0.00036713236],"domain_scores_gemma":[0.9978372,0.0009873445,0.0002194842,0.00037140446,0.00040611654,0.00017843841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029564078,0.00019368646,0.00028352806,0.0010752474,0.00015650065,0.00029505053,0.0010427891,0.00010053783,0.00003010425],"category_scores_gemma":[0.00030544648,0.0001445593,0.00048390884,0.0014410706,0.00019589714,0.0011545981,0.00009793446,0.0004914847,0.000010575982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001420582,0.000031301766,0.000047642417,0.000066451124,0.0001343919,0.00007008309,0.0009111188,0.00012599348,0.0017110273,0.9114187,0.0008144494,0.08452682],"study_design_scores_gemma":[0.000502722,0.0005642131,0.00017250402,0.0001296565,0.000029266284,0.000238947,0.00014853166,0.00060191646,0.0040520323,0.981083,0.012308946,0.00016829283],"about_ca_topic_score_codex":7.236936e-7,"about_ca_topic_score_gemma":9.189214e-7,"teacher_disagreement_score":0.91896605,"about_ca_system_score_codex":0.000049909242,"about_ca_system_score_gemma":0.0002212789,"threshold_uncertainty_score":0.58949566},"labels":[],"label_agreement":null},{"id":"W4403377234","doi":"10.1002/jgt.23194","title":"Improved bounds on the cop number when forbidding a minor","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Minor (academic); Combinatorics; Mathematics; Law; Political science","score_opus":0.011344092198821881,"score_gpt":0.22676961264497078,"score_spread":0.2154255204461489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403377234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38725287,0.01263797,0.26579827,0.005970757,0.01773884,0.0007474873,0.000039502116,0.0010418578,0.30877241],"genre_scores_gemma":[0.99755514,0.00015336831,0.00075478037,0.00023145271,0.00020346242,0.0000022889128,5.5055045e-7,0.00003232573,0.001066626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994579,0.000045882873,0.00021069133,0.0000497786,0.00011547171,0.00012025121],"domain_scores_gemma":[0.9995419,0.00024345693,0.000041388328,0.00009721585,0.00003289112,0.00004315988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070817623,0.00008904844,0.00010323553,0.00011068045,0.00005492384,0.00013992882,0.00013354355,0.000044426866,0.0005257558],"category_scores_gemma":[0.000035351553,0.000054577944,0.00014025661,0.00014878923,0.00003054656,0.00011271653,0.000008266979,0.00029119098,0.00002984602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022248352,0.000079815094,0.00037526648,0.00041074044,0.0013344059,0.00010606939,0.010135749,0.034787554,0.009589608,0.7604494,0.14868943,0.033819485],"study_design_scores_gemma":[0.0012543491,0.00039329118,0.0002264792,0.0018060362,0.0002910255,0.00065417285,0.0012259402,0.10249498,0.007074789,0.6085212,0.27529946,0.00075826305],"about_ca_topic_score_codex":6.3016716e-7,"about_ca_topic_score_gemma":7.961471e-7,"teacher_disagreement_score":0.61030227,"about_ca_system_score_codex":0.00002664714,"about_ca_system_score_gemma":0.00001727781,"threshold_uncertainty_score":0.5756657},"labels":[],"label_agreement":null},{"id":"W4405323689","doi":"10.1002/jgt.23202","title":"On the Pre‐ and Post‐Positional Semi‐Random Graph Processes","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Graph; Random graph; Discrete mathematics","score_opus":0.011973159110112075,"score_gpt":0.2689495744866855,"score_spread":0.2569764153765734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405323689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832784,0.007786995,0.0027226785,0.0011772227,0.0007950807,0.00021255382,0.00003553687,0.00004993257,0.003941636],"genre_scores_gemma":[0.99796164,0.00046931268,0.00034205997,0.00061799504,0.00028593512,0.0000059328086,8.893786e-7,0.000030886324,0.000285349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848765,0.00030511554,0.00043510692,0.00015453725,0.00043071192,0.00018690407],"domain_scores_gemma":[0.99364614,0.0056180153,0.00020694986,0.00020035198,0.00024234755,0.00008621558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020459788,0.00019944782,0.00027553653,0.00034009645,0.00032306998,0.00013308565,0.0003051263,0.00009178154,0.00017586871],"category_scores_gemma":[0.0010131844,0.000100636134,0.00027270787,0.00033320763,0.0003342371,0.00019126506,0.00005413782,0.0005331138,0.0000018499505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066376675,0.000054582448,0.00003478311,0.00025562302,0.00036730806,0.000047378526,0.0021258625,0.0000059832696,0.00059435656,0.9914057,0.0034990986,0.0009455054],"study_design_scores_gemma":[0.00039351688,0.00028461136,0.00049733405,0.00051905104,0.00018090759,0.00064023916,0.00036130345,0.000006546784,0.0007509106,0.99573636,0.0004990336,0.00013017206],"about_ca_topic_score_codex":4.7821976e-7,"about_ca_topic_score_gemma":7.7558644e-7,"teacher_disagreement_score":0.0146832755,"about_ca_system_score_codex":0.000013453872,"about_ca_system_score_gemma":0.0000810342,"threshold_uncertainty_score":0.41038224},"labels":[],"label_agreement":null},{"id":"W4408330939","doi":"10.1002/jgt.23218","title":"Eigenvalue Approach to Dense Clusters in Hypergraphs","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Minimax; Eigenvalues and eigenvectors; Combinatorics; Decomposition; Matrix (chemical analysis); Discrete mathematics; Mathematical optimization","score_opus":0.007853695029531156,"score_gpt":0.23326014608860496,"score_spread":0.2254064510590738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408330939","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.19905156,0.0008765166,0.78762496,0.00052753644,0.0010390512,0.00015466566,9.2173013e-7,0.000030147796,0.010694664],"genre_scores_gemma":[0.9624063,0.00004465488,0.035532147,0.0016934279,0.00004421785,0.0000054886946,1.8064749e-7,0.000008282224,0.0002653151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816847,0.0004978284,0.000522206,0.00023776559,0.00027057625,0.00030316837],"domain_scores_gemma":[0.99887526,0.00026281207,0.00017238477,0.00042150344,0.00012244574,0.00014558533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029906102,0.00016341674,0.00031734118,0.0016419952,0.00009728841,0.000090952766,0.001369283,0.00007601765,0.0000036815288],"category_scores_gemma":[0.00012115698,0.00013316439,0.00027760625,0.002030153,0.000091577676,0.00037619343,0.0001682648,0.00035952128,0.0000057873335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013945083,0.00024719,0.00096777064,0.000019368419,0.00007841407,0.00005666078,0.0013312991,0.0014976893,0.0005358487,0.9723395,0.0005356831,0.022251137],"study_design_scores_gemma":[0.0009133285,0.00017141669,0.005411326,0.00014237463,0.000024135785,0.00014961365,0.0006516919,0.0011081175,0.00086478604,0.9895174,0.00082588056,0.00021994582],"about_ca_topic_score_codex":0.0000017752,"about_ca_topic_score_gemma":0.0000011653404,"teacher_disagreement_score":0.7633547,"about_ca_system_score_codex":0.000034013294,"about_ca_system_score_gemma":0.00009407383,"threshold_uncertainty_score":0.5430286},"labels":[],"label_agreement":null},{"id":"W4410070236","doi":"10.1002/jgt.23253","title":"A Nordhaus–Gaddum Problem for the Spectral Gap of a Graph","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.03388345908459915,"score_gpt":0.3225049509430111,"score_spread":0.28862149185841196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410070236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74782026,0.00366886,0.22469394,0.0051675197,0.00077996927,0.002473405,0.0001214802,0.00008232417,0.015192265],"genre_scores_gemma":[0.9886421,0.00016323,0.010181495,0.00018821906,0.00010470621,0.00006223279,0.0000010779329,0.000015657908,0.0006412662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859583,0.00016728265,0.00071023405,0.00011484255,0.00019404195,0.00021775629],"domain_scores_gemma":[0.9957768,0.0028933098,0.0006540194,0.00032797275,0.00029443044,0.000053494583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026249671,0.00015477315,0.0003604346,0.00027593403,0.00020768106,0.000024338595,0.0005558465,0.00007831542,0.00005265771],"category_scores_gemma":[0.00027962506,0.00008776483,0.00065285305,0.00064147415,0.00023368817,0.000086471424,0.000036062007,0.0002950943,8.962504e-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.00035996657,0.00026796188,0.00012981406,0.00013401215,0.00041574182,0.00000121911,0.00042321775,0.000008698895,0.0036371371,0.9876059,0.0042204326,0.0027958592],"study_design_scores_gemma":[0.0006477579,0.00015836545,0.00044979653,0.00016783246,0.00041070188,0.00002749153,0.0007488532,0.000008224468,0.0044169594,0.9897495,0.0031238673,0.00009068343],"about_ca_topic_score_codex":0.0000013035223,"about_ca_topic_score_gemma":0.000008978216,"teacher_disagreement_score":0.24082188,"about_ca_system_score_codex":0.00001410125,"about_ca_system_score_gemma":0.00007402207,"threshold_uncertainty_score":0.3578946},"labels":[],"label_agreement":null},{"id":"W4411004437","doi":"10.1002/jgt.23265","title":"A Dichotomy Theorem for Γ‐Switchable H‐Colouring on m‐Edge‐Coloured Graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.015777773108179422,"score_gpt":0.3045510545709746,"score_spread":0.2887732814627952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411004437","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.076450214,0.0014618693,0.90997106,0.0015728452,0.001551511,0.0007868118,0.000006362353,0.00011750444,0.0080818],"genre_scores_gemma":[0.9709224,0.0001553816,0.02602491,0.0010826568,0.00011574347,0.00007203213,6.31177e-7,0.000035397206,0.0015908327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971546,0.000528722,0.0007012228,0.00040518012,0.00055404287,0.0006562327],"domain_scores_gemma":[0.99547917,0.0024457544,0.00048860325,0.0007928607,0.0005793004,0.00021430205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005041452,0.000286876,0.0005250202,0.0017923205,0.00041645893,0.00018183392,0.0023703105,0.0001384449,0.000018633382],"category_scores_gemma":[0.00076409295,0.00022624669,0.0006398102,0.0016625572,0.00027738448,0.0006382424,0.00023672749,0.0006717475,0.00000732924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010508971,0.00021090676,0.00023511177,0.00004689945,0.00023482658,0.000043083386,0.00028655244,0.00022027487,0.0032032693,0.9736644,0.0013037561,0.01950003],"study_design_scores_gemma":[0.0017523702,0.00074097345,0.0004958475,0.00023792133,0.000037512287,0.000043610515,0.00018888415,0.00035444915,0.011568261,0.97963804,0.004734589,0.0002075144],"about_ca_topic_score_codex":6.6191564e-7,"about_ca_topic_score_gemma":0.0000012927871,"teacher_disagreement_score":0.8944722,"about_ca_system_score_codex":0.000092211274,"about_ca_system_score_gemma":0.00024955109,"threshold_uncertainty_score":0.92260724},"labels":[],"label_agreement":null},{"id":"W4412133525","doi":"10.1002/jgt.23276","title":"Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Chordal graph; Combinatorics; Mathematics; Clique-sum; Partial k-tree; 1-planar graph; Pathwidth; Indifference graph; Bounded function; Discrete mathematics; Graph; Line graph","score_opus":0.014522849603426218,"score_gpt":0.28703737638345067,"score_spread":0.27251452678002447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412133525","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.48459274,0.0035743015,0.50030655,0.0039831838,0.0019114801,0.0005276573,0.000023701155,0.00016700427,0.0049133515],"genre_scores_gemma":[0.9350921,0.00049336045,0.06260798,0.0008550785,0.00007020155,0.00002042954,8.933645e-7,0.000030824187,0.00082914834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705327,0.000558996,0.0007129543,0.00044856383,0.0006459967,0.0005801944],"domain_scores_gemma":[0.9970077,0.0006841565,0.00031435263,0.001120173,0.0004421011,0.0004314623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023762656,0.00029519096,0.00048641925,0.0025505254,0.00046640402,0.00027026606,0.0022981423,0.00011581315,0.000020202626],"category_scores_gemma":[0.0006122589,0.00025462435,0.00037790844,0.0031059943,0.00050615927,0.0009539143,0.00059309177,0.00071715174,0.0000058310793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026222598,0.000104210434,0.0014845557,0.000019203359,0.00018529683,0.00006110115,0.00033123823,0.00007167714,0.0027690702,0.9658025,0.001651324,0.027257599],"study_design_scores_gemma":[0.001137126,0.00033577564,0.01013458,0.00011449798,0.000042561176,0.000200687,0.0003216958,0.000050935534,0.0013188148,0.9835993,0.0025106033,0.00023341241],"about_ca_topic_score_codex":0.0000053772465,"about_ca_topic_score_gemma":0.000023759876,"teacher_disagreement_score":0.45049933,"about_ca_system_score_codex":0.0000630928,"about_ca_system_score_gemma":0.00019597904,"threshold_uncertainty_score":0.9999906},"labels":[],"label_agreement":null}]}