{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63531023,0.00047697703,0.343952,0.002237389,0.00006294602,0.00006756936,0.00017901903,0.00022725157,0.017486645],"genre_scores_gemma":[0.9828971,0.00011199019,0.014302199,0.0002206561,0.00007235659,0.00008147429,0.0001101081,0.000034646822,0.002169359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971535,0.0013109451,0.00013994874,0.00056052336,0.0006039637,0.00023109256],"domain_scores_gemma":[0.98428833,0.010858228,0.0014578355,0.0012407321,0.001222614,0.0009322906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004426808,0.00047125792,0.00075414364,0.0017371988,0.0011910541,0.0023417783,0.0016079381,0.0014515616,0.0036702866],"category_scores_gemma":[0.016023824,0.000480794,0.0011307627,0.00082864356,0.0067796465,0.005985809,0.0029465954,0.0025507475,0.0003879694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001929817,0.000017406948,0.00044489582,0.00001338364,0.000006848967,0.000065220775,0.00013778037,0.0031187923,0.0006600103,0.9945675,0.0001280855,0.00082075835],"study_design_scores_gemma":[0.000016488111,0.000033307595,0.00027910247,0.000009912126,0.0000035147623,0.00012001908,0.00008290652,0.04679274,0.00078439986,0.9512935,0.0005700443,0.000014075873],"about_ca_topic_score_codex":0.00088679336,"about_ca_topic_score_gemma":0.00058844325,"teacher_disagreement_score":0.004426808,"about_ca_system_score_codex":0.0015172998,"about_ca_system_score_gemma":0.000633881,"threshold_uncertainty_score":0.023411453},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4331191,0.0049546123,0.47835994,0.00427933,0.00052106165,0.0001827691,0.0019136447,0.0041834214,0.07248617],"genre_scores_gemma":[0.948733,0.0007451484,0.04365332,0.00055590476,0.00024502733,0.00013895195,0.00050894247,0.00035256793,0.00506705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967558,0.0004952852,0.00010472721,0.000994034,0.0009426546,0.0007075738],"domain_scores_gemma":[0.9820354,0.010427017,0.00087062304,0.0042527867,0.0011975651,0.0012165812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024955345,0.0011585652,0.0012770394,0.0019517683,0.0020102742,0.0032137334,0.0030013807,0.0014731431,0.008852186],"category_scores_gemma":[0.016578121,0.00071138865,0.0007044143,0.002271146,0.002655151,0.0057204585,0.003861993,0.004107391,0.0012328558],"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.0028949198,0.00039581544,0.011849848,0.0007540397,0.00025185331,0.0006638112,0.00069243944,0.4017532,0.07191129,0.38988125,0.025136257,0.09381536],"study_design_scores_gemma":[0.00011082162,0.00023300126,0.004251236,0.00012474872,0.00010992858,0.00056520157,0.00016709707,0.6233099,0.012195199,0.34610936,0.012702326,0.00012116466],"about_ca_topic_score_codex":0.0042840648,"about_ca_topic_score_gemma":0.0049301097,"teacher_disagreement_score":0.008852186,"about_ca_system_score_codex":0.0035509516,"about_ca_system_score_gemma":0.0017223574,"threshold_uncertainty_score":0.029613495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37051237,0.0028914483,0.46534425,0.0032244765,0.00058147084,0.00011407943,0.0012283598,0.0007128047,0.1553908],"genre_scores_gemma":[0.96224725,0.0003441243,0.031088568,0.00051135244,0.00019217294,0.00010123586,0.00023967109,0.00006592596,0.0052097547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985341,0.00023732928,0.00006440075,0.00043231054,0.00051422894,0.00021761388],"domain_scores_gemma":[0.99441624,0.0028283251,0.0005737245,0.0006808506,0.0010438863,0.00045696873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014729797,0.0003765449,0.000538733,0.0016390972,0.0011798402,0.001684398,0.0012750524,0.00065602106,0.0065537044],"category_scores_gemma":[0.008169776,0.00026650226,0.00037958878,0.0012507382,0.0027561975,0.0027721373,0.0016147816,0.001553355,0.00066124735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010424239,0.000017772292,0.0016098308,0.00007482237,0.000013429247,0.00007989768,0.00018181792,0.0030796782,0.0033589278,0.97604465,0.00399449,0.011440368],"study_design_scores_gemma":[0.000036915742,0.00004376935,0.0015230185,0.0000326065,0.000016507647,0.0003689403,0.00009817309,0.016412497,0.0026629623,0.9701067,0.008673053,0.0000249043],"about_ca_topic_score_codex":0.0019199427,"about_ca_topic_score_gemma":0.0011558915,"teacher_disagreement_score":0.0065537044,"about_ca_system_score_codex":0.0014004803,"about_ca_system_score_gemma":0.00061595923,"threshold_uncertainty_score":0.021924317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93861127,0.0001762368,0.049480453,0.0002469251,0.000015298283,0.00003340592,0.00013009406,0.00008397952,0.01122238],"genre_scores_gemma":[0.99329185,0.000088911234,0.004878647,0.000043708853,0.00001704961,0.000031371113,0.00009034368,0.0000178692,0.0015402245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997508,0.000082862396,0.000011437579,0.000051113322,0.000055896657,0.000047866786],"domain_scores_gemma":[0.9968874,0.0019641465,0.00053980143,0.00013315218,0.00023492168,0.00024058696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002952303,0.00017657063,0.00026405902,0.00096209336,0.0005475422,0.0008322991,0.00052931975,0.00042951774,0.004210113],"category_scores_gemma":[0.0020363203,0.00024444246,0.00018117263,0.00047387168,0.001688908,0.0012858846,0.0006559376,0.00047813813,0.00019657772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023581223,0.00007732925,0.004465842,0.00016090262,0.000047427744,0.0012295072,0.0013129315,0.028961506,0.024390226,0.9228836,0.0016616355,0.014573215],"study_design_scores_gemma":[0.00009090444,0.00012470405,0.003304527,0.000045186178,0.00003560436,0.00046008176,0.00075859827,0.082288094,0.0051333024,0.9047211,0.0029976089,0.00004031341],"about_ca_topic_score_codex":0.0013169051,"about_ca_topic_score_gemma":0.0016834065,"teacher_disagreement_score":0.004210113,"about_ca_system_score_codex":0.00046145738,"about_ca_system_score_gemma":0.00023907654,"threshold_uncertainty_score":0.01408422},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6369666,0.0021131225,0.33679384,0.002034626,0.00014849612,0.00017881398,0.0021690966,0.000442514,0.019152896],"genre_scores_gemma":[0.9516909,0.000584384,0.04253423,0.00029016752,0.00030756043,0.0002818215,0.0014791113,0.00009847402,0.0027333894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818426,0.00040312766,0.00011927095,0.0007038323,0.00037513828,0.00021428886],"domain_scores_gemma":[0.982485,0.011503677,0.0027161483,0.001403534,0.00081154396,0.001080128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551265,0.00082295475,0.00095794996,0.0031659491,0.0014900764,0.002115483,0.0016970573,0.0012735892,0.006464718],"category_scores_gemma":[0.013147181,0.00063662365,0.001307347,0.002099953,0.003176899,0.005024329,0.0024556967,0.002370254,0.00037322947],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043351168,0.00019700076,0.012006167,0.0006498382,0.00020977663,0.00082641846,0.0019566398,0.07267633,0.011401236,0.85865045,0.0067443587,0.034248143],"study_design_scores_gemma":[0.000036570065,0.00008334154,0.0035993024,0.000067166366,0.000055626933,0.0007925317,0.00029874346,0.101216815,0.0018836543,0.88819903,0.0037127808,0.000054513817],"about_ca_topic_score_codex":0.0008748661,"about_ca_topic_score_gemma":0.00054717826,"teacher_disagreement_score":0.006464718,"about_ca_system_score_codex":0.0010593482,"about_ca_system_score_gemma":0.0004149094,"threshold_uncertainty_score":0.021626651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75406736,0.0010963805,0.16135456,0.0008875103,0.0002504171,0.00007562868,0.0005834631,0.00045760025,0.08122705],"genre_scores_gemma":[0.9759143,0.0003242745,0.016862493,0.00009169796,0.00008121301,0.00005388687,0.00022830686,0.00007360393,0.0063702962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955887,0.00006080568,0.000017617867,0.00008927966,0.00015695869,0.00011646728],"domain_scores_gemma":[0.99893755,0.00034309062,0.00012894777,0.000091826536,0.00025072004,0.00024787796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060427526,0.00033902988,0.000317336,0.0017758615,0.001235632,0.0023863977,0.00066143484,0.0005185147,0.0046338467],"category_scores_gemma":[0.002233901,0.00023553344,0.00029480335,0.0009953926,0.0017548717,0.0028804974,0.0008351742,0.0010346663,0.00023711426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050824798,0.000015029857,0.0006276411,0.000026380661,0.0000034615944,0.00005256307,0.00013585463,0.003010328,0.0031925447,0.98576933,0.0011670566,0.0059490805],"study_design_scores_gemma":[0.00002168982,0.000035632536,0.0017598665,0.000036146892,0.000010631334,0.00022568423,0.00019879958,0.036182396,0.003535457,0.94503194,0.012929451,0.000032452303],"about_ca_topic_score_codex":0.0028685657,"about_ca_topic_score_gemma":0.0024006274,"teacher_disagreement_score":0.0046338467,"about_ca_system_score_codex":0.0018456595,"about_ca_system_score_gemma":0.00048202198,"threshold_uncertainty_score":0.015501738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858719,0.0004988371,0.09513496,0.00023856299,0.000037797803,0.000036610996,0.00049748074,0.00019245165,0.017491342],"genre_scores_gemma":[0.9819725,0.0002794784,0.014797865,0.000052280386,0.000040696515,0.0000290461,0.00047296684,0.000049714883,0.0023054355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996648,0.000059859496,0.000018904551,0.000084831045,0.000098083525,0.00007351275],"domain_scores_gemma":[0.99692804,0.0013922502,0.0007135708,0.00023969535,0.0003634133,0.00036312765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025062772,0.00036377646,0.0002848768,0.0018684906,0.0006031926,0.0012208226,0.00057436747,0.00036589825,0.0017847924],"category_scores_gemma":[0.0019249328,0.00017428324,0.0002513564,0.0016167783,0.00091540307,0.0015852503,0.0005419062,0.0006429964,0.0002112046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003208199,0.0001176062,0.009588505,0.00017961371,0.00002765766,0.00067302975,0.0010749206,0.034870263,0.035875533,0.87890005,0.0026331916,0.035738736],"study_design_scores_gemma":[0.00003085536,0.00013462335,0.0070979213,0.000049055707,0.00003702682,0.0010103331,0.00087491586,0.090776384,0.012741472,0.8745661,0.01263,0.000051284776],"about_ca_topic_score_codex":0.0010077308,"about_ca_topic_score_gemma":0.0010844882,"teacher_disagreement_score":0.0018684906,"about_ca_system_score_codex":0.00081824546,"about_ca_system_score_gemma":0.00032765552,"threshold_uncertainty_score":0.005970776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7173813,0.00043970262,0.24382971,0.00045969393,0.0000712017,0.00005318109,0.00010039518,0.00044882268,0.03721595],"genre_scores_gemma":[0.9724185,0.00013042623,0.023331968,0.00008314703,0.00003600258,0.000025939798,0.000057051202,0.000031658135,0.0038852836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993875,0.00013136271,0.00002763124,0.0002117235,0.00011806189,0.00012364466],"domain_scores_gemma":[0.9974782,0.00097443594,0.00028937205,0.0006594062,0.00027328904,0.00032527465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008891124,0.00021057382,0.00018960692,0.00071033556,0.00079087145,0.00095384475,0.0006261712,0.00036416628,0.0037126266],"category_scores_gemma":[0.0022953793,0.00025389023,0.00039790155,0.00044011322,0.0017892409,0.0025420927,0.0018784452,0.0011157714,0.00028597182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014922406,0.0000704081,0.0023692609,0.00007703258,0.0000141090695,0.00020411961,0.00087460625,0.0036857342,0.01729086,0.9458685,0.00062609394,0.02877016],"study_design_scores_gemma":[0.000033244716,0.00021443218,0.0035096882,0.000035866597,0.000036972706,0.0008235149,0.0007294539,0.030750064,0.03320533,0.9090756,0.021540545,0.000045157652],"about_ca_topic_score_codex":0.000572909,"about_ca_topic_score_gemma":0.0005194328,"teacher_disagreement_score":0.0037126266,"about_ca_system_score_codex":0.0005275586,"about_ca_system_score_gemma":0.00025803444,"threshold_uncertainty_score":0.012419939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8320849,0.0008023336,0.11484478,0.006219226,0.00018795254,0.000065968925,0.0004094831,0.0003540585,0.045031287],"genre_scores_gemma":[0.9889698,0.00015784288,0.007434226,0.00037835952,0.00008260519,0.000030081033,0.00023118113,0.000031474727,0.0026845091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988708,0.00025513332,0.000051533305,0.00038802158,0.00022050635,0.00021392149],"domain_scores_gemma":[0.99275196,0.003960542,0.000877411,0.0010697978,0.00058897404,0.00075128925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002081442,0.00053887273,0.0007045976,0.0013242093,0.0020125236,0.00230378,0.0013182077,0.0013077641,0.005937072],"category_scores_gemma":[0.0059055295,0.00050138525,0.0006809994,0.0015414417,0.0041437815,0.0047201025,0.0021698982,0.0028872793,0.0003512527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001712321,0.00014906684,0.0045676176,0.0001377431,0.000027683493,0.00035075858,0.00071768754,0.006563165,0.0039929007,0.9662021,0.0039535565,0.013166512],"study_design_scores_gemma":[0.00003800199,0.0000581449,0.0012554143,0.000028908431,0.00002019158,0.0001956478,0.00069115515,0.010375765,0.002178238,0.9822295,0.002906308,0.000022704386],"about_ca_topic_score_codex":0.0027543826,"about_ca_topic_score_gemma":0.003243365,"teacher_disagreement_score":0.005937072,"about_ca_system_score_codex":0.0010825163,"about_ca_system_score_gemma":0.0006804966,"threshold_uncertainty_score":0.01986146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9374087,0.00027214157,0.013261709,0.00024598886,0.00008244436,0.000016922462,0.00044740902,0.00022464861,0.04804001],"genre_scores_gemma":[0.9875888,0.00017620435,0.0075499252,0.000056276574,0.000014579885,0.00001819655,0.00056446536,0.00010747289,0.003924088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931204,0.000080053665,0.000041850955,0.00017225195,0.00021471539,0.00017920579],"domain_scores_gemma":[0.9977697,0.0006219426,0.00057213294,0.0003811053,0.00027825465,0.00037697828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041279948,0.00032698805,0.0002753702,0.0010675397,0.0008353442,0.0021319005,0.0005504403,0.0005170994,0.00948527],"category_scores_gemma":[0.0025721814,0.00033773688,0.00029590857,0.0010468983,0.00097206683,0.0012005355,0.00047206832,0.00079108553,0.0012135775],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016483922,0.00036418703,0.05159509,0.0005045471,0.00020493209,0.0019156501,0.0008153121,0.048553627,0.28576267,0.43511048,0.02776196,0.14576317],"study_design_scores_gemma":[0.00007798819,0.00038779477,0.11143484,0.00015763672,0.00024301298,0.0067211497,0.0018505076,0.1386405,0.310111,0.34653324,0.0836139,0.00022842808],"about_ca_topic_score_codex":0.00077622937,"about_ca_topic_score_gemma":0.0010271994,"teacher_disagreement_score":0.00948527,"about_ca_system_score_codex":0.0011819111,"about_ca_system_score_gemma":0.00041950512,"threshold_uncertainty_score":0.031731427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87873083,0.0008757486,0.10482389,0.0010496859,0.000052535543,0.0000273055,0.00020172648,0.00020968715,0.014028545],"genre_scores_gemma":[0.9947589,0.00024685686,0.0038681456,0.000046004872,0.000053008986,0.000021822501,0.00006587556,0.000041876334,0.00089750165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950254,0.00017906706,0.00002037032,0.00009801945,0.00013253067,0.00006747586],"domain_scores_gemma":[0.990217,0.006805696,0.0011217337,0.00072474795,0.00054575474,0.0005851513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017379689,0.0002640477,0.00049017405,0.0017389852,0.00064533734,0.001304708,0.0007137188,0.00067405205,0.0016414822],"category_scores_gemma":[0.010446633,0.00026654496,0.00040817072,0.00068795733,0.0030058715,0.0028354053,0.001032204,0.0007679529,0.00013382366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007891297,0.000049105256,0.0055959895,0.00009878996,0.000032441927,0.00024043252,0.0003388518,0.08064444,0.008471426,0.89662564,0.0010855006,0.0067385896],"study_design_scores_gemma":[0.000010871044,0.000035318953,0.0037199256,0.000028535327,0.000012655147,0.000266943,0.000100452395,0.24938211,0.0025038894,0.7429252,0.000989734,0.000024391948],"about_ca_topic_score_codex":0.0009628834,"about_ca_topic_score_gemma":0.00064052024,"teacher_disagreement_score":0.0017389852,"about_ca_system_score_codex":0.0012012641,"about_ca_system_score_gemma":0.00028363365,"threshold_uncertainty_score":0.009191334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.747344,0.00065916707,0.23685482,0.0009317602,0.00007433654,0.00036959036,0.0014204137,0.0007223379,0.011623518],"genre_scores_gemma":[0.85037374,0.00032320837,0.13740593,0.00029331355,0.000054083248,0.00013691775,0.0035752181,0.00014580518,0.0076916157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888283,0.00014699226,0.00008063919,0.00045225665,0.00022415866,0.00021316142],"domain_scores_gemma":[0.99631894,0.0016599913,0.0005847197,0.00051659683,0.00043140724,0.0004883941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438464,0.00059047487,0.00091016834,0.0011799717,0.001021803,0.0015608766,0.0017230618,0.0011438091,0.0036855708],"category_scores_gemma":[0.0045172786,0.0006140671,0.00082857994,0.0015650287,0.0008091508,0.0035004616,0.002073861,0.0011923517,0.00053740107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024003985,0.0016796313,0.015233864,0.001869983,0.00045944413,0.0034771203,0.002768255,0.17696643,0.11386825,0.4329033,0.01785875,0.23051459],"study_design_scores_gemma":[0.00022973109,0.00027217562,0.0028430878,0.000102659134,0.00015288466,0.0015758733,0.00070345995,0.32783118,0.030684575,0.6189525,0.016597841,0.0000538863],"about_ca_topic_score_codex":0.001564566,"about_ca_topic_score_gemma":0.0022551054,"teacher_disagreement_score":0.0036855708,"about_ca_system_score_codex":0.0012317266,"about_ca_system_score_gemma":0.00090828806,"threshold_uncertainty_score":0.012329459},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5474955,0.0027679235,0.3938018,0.0026237445,0.00021067115,0.00007610766,0.0009982811,0.00035896807,0.051666923],"genre_scores_gemma":[0.97949296,0.0008849829,0.015405765,0.00012450722,0.00015610317,0.000047072022,0.00018123987,0.000071437134,0.003635906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836963,0.0003889533,0.00008460487,0.00046308187,0.00038837895,0.000305326],"domain_scores_gemma":[0.98873925,0.0075356583,0.0010778059,0.0010930299,0.0007797354,0.000774639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013681706,0.0005374001,0.0010468285,0.002172727,0.0012608514,0.0026598827,0.0015996416,0.0009255996,0.0050089722],"category_scores_gemma":[0.01359008,0.0004921823,0.00066310685,0.0021361825,0.0020210354,0.005867624,0.0018539549,0.0011847392,0.0005932107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048154301,0.000068426176,0.0089184195,0.00039057786,0.000115143186,0.00041249266,0.0009963032,0.14722395,0.006553895,0.77497333,0.0055621285,0.05430376],"study_design_scores_gemma":[0.000040354567,0.00010087214,0.002600165,0.00006256792,0.00005596418,0.000627432,0.00031228116,0.16778871,0.003181497,0.81646705,0.008732754,0.000030413736],"about_ca_topic_score_codex":0.0009417632,"about_ca_topic_score_gemma":0.0010892012,"teacher_disagreement_score":0.0050089722,"about_ca_system_score_codex":0.0012513013,"about_ca_system_score_gemma":0.0003860947,"threshold_uncertainty_score":0.016756654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94665563,0.000346987,0.038622722,0.0010277866,0.00004279136,0.000074853975,0.00032109485,0.00008772365,0.012820475],"genre_scores_gemma":[0.9863491,0.00016974859,0.010481447,0.00009359784,0.00004955636,0.0000550417,0.00036257884,0.000018556078,0.0024204196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.000165075,0.000029608515,0.00021070933,0.00013590217,0.00013096047],"domain_scores_gemma":[0.99295455,0.004606405,0.0009924578,0.00049113494,0.0003479757,0.0006075446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008920052,0.00038304683,0.0005127623,0.0011604324,0.0018881604,0.0018155341,0.000979514,0.00065619615,0.0047847335],"category_scores_gemma":[0.004398244,0.0005826459,0.0009019515,0.0010953471,0.0032476627,0.0033842432,0.0021864302,0.0010948495,0.0002296709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001000358,0.000240409,0.0125074405,0.00042094782,0.0001803151,0.0012605677,0.0023871143,0.020508656,0.025486883,0.9058258,0.007753063,0.022428533],"study_design_scores_gemma":[0.00019721485,0.00016173683,0.006058252,0.000052223,0.00010937463,0.00076205836,0.00083844573,0.061050706,0.009367688,0.9153929,0.0059367763,0.00007270408],"about_ca_topic_score_codex":0.0022605138,"about_ca_topic_score_gemma":0.002918907,"teacher_disagreement_score":0.0047847335,"about_ca_system_score_codex":0.0010149523,"about_ca_system_score_gemma":0.0007248952,"threshold_uncertainty_score":0.01600653},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6092007,0.0008150975,0.34765077,0.0032773302,0.00011610869,0.00007789172,0.000683091,0.0003708617,0.03780805],"genre_scores_gemma":[0.99282646,0.00019325399,0.004886098,0.00007113716,0.000109472625,0.000034127494,0.00010068888,0.000035410503,0.0017435316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976526,0.00086010684,0.000054423756,0.00037152646,0.0007222967,0.00033911335],"domain_scores_gemma":[0.95529014,0.037804186,0.002340387,0.0018878628,0.0015347257,0.0011427808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033595294,0.00050432223,0.0009934921,0.0017145681,0.0006971765,0.0018455418,0.0014876674,0.0009690302,0.005503545],"category_scores_gemma":[0.05981376,0.0004873967,0.00045799563,0.0012310669,0.0036532518,0.004618183,0.0015391874,0.0031390244,0.00044669333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014822905,0.00007839272,0.0020956993,0.00009889223,0.000021777092,0.00021859021,0.00017978699,0.038800478,0.0011715617,0.94540566,0.00221052,0.009570379],"study_design_scores_gemma":[0.000034981356,0.000029997198,0.0013517227,0.000024703606,0.000008524451,0.00018608294,0.00005797628,0.11071419,0.0007018539,0.88608044,0.00078153785,0.00002794383],"about_ca_topic_score_codex":0.0008254184,"about_ca_topic_score_gemma":0.00059519114,"teacher_disagreement_score":0.005503545,"about_ca_system_score_codex":0.0016905891,"about_ca_system_score_gemma":0.00074273854,"threshold_uncertainty_score":0.01841116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6254746,0.0008093484,0.33228263,0.00054137065,0.00012819334,0.00021841677,0.0014143841,0.0005319601,0.03859905],"genre_scores_gemma":[0.94123214,0.00028798758,0.047851782,0.00016726454,0.00008401354,0.0001388686,0.00090714206,0.000120022465,0.009210642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991197,0.00021892754,0.000042896827,0.00019772777,0.00017817822,0.0002425545],"domain_scores_gemma":[0.99816316,0.0006219682,0.0003355167,0.00029448027,0.00026683277,0.00031813135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070001767,0.0006449484,0.0005848765,0.0012594488,0.0010370333,0.0014042873,0.00037916453,0.00054092496,0.0086084595],"category_scores_gemma":[0.0021271654,0.00052190234,0.000777599,0.00069850823,0.0009526722,0.0018020014,0.00095636444,0.0007875706,0.0010766463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006832396,0.00018193609,0.002336343,0.00024676215,0.00007051848,0.00079740625,0.0011551857,0.052755535,0.022043087,0.88124,0.008472587,0.030017354],"study_design_scores_gemma":[0.00007183648,0.00013980195,0.001744454,0.00007552129,0.000027312068,0.00052147266,0.00035587692,0.107547194,0.0043389406,0.87098247,0.014131595,0.00006366229],"about_ca_topic_score_codex":0.0015763959,"about_ca_topic_score_gemma":0.0018612932,"teacher_disagreement_score":0.0086084595,"about_ca_system_score_codex":0.0006217986,"about_ca_system_score_gemma":0.0004009618,"threshold_uncertainty_score":0.028798163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47895136,0.0016798555,0.46539965,0.00079280796,0.00028076416,0.00007919076,0.00073645246,0.00040687606,0.051673137],"genre_scores_gemma":[0.9585103,0.0003608906,0.034301914,0.00015032498,0.000102962455,0.000058338963,0.00021439191,0.00004314077,0.0062577296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961674,0.00010562586,0.000025707408,0.00010136399,0.00009546889,0.000054993987],"domain_scores_gemma":[0.999008,0.00038144906,0.00018064679,0.00009988687,0.00016906646,0.00016096812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027857782,0.00034139998,0.00027880553,0.0020646753,0.00061501976,0.0011440008,0.00041790854,0.000413079,0.0050524636],"category_scores_gemma":[0.0014877015,0.00020561415,0.0002080808,0.00096568366,0.0010072255,0.0012302012,0.00070055784,0.00053608115,0.0005376317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025711652,0.000014753897,0.00040492546,0.000042167572,0.000008316307,0.000118321426,0.00016480028,0.0026515333,0.0035721601,0.981698,0.0009502069,0.010349106],"study_design_scores_gemma":[0.0000092010705,0.000029939536,0.00087782665,0.000020091982,0.0000070685583,0.0003199236,0.00013845474,0.03420577,0.0016765427,0.9565681,0.0061265873,0.000020384363],"about_ca_topic_score_codex":0.0006752634,"about_ca_topic_score_gemma":0.0006043294,"teacher_disagreement_score":0.0050524636,"about_ca_system_score_codex":0.0005815246,"about_ca_system_score_gemma":0.00023455454,"threshold_uncertainty_score":0.016902208},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87344813,0.00008889136,0.10360888,0.00021814479,0.000031909887,0.00005563336,0.00073155505,0.0002908743,0.021526005],"genre_scores_gemma":[0.9783999,0.000086535874,0.016475054,0.00007459901,0.000021410247,0.00005224545,0.0009412377,0.00004864956,0.003900219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969125,0.000041639712,0.00001840249,0.00009560119,0.000080093814,0.000073132964],"domain_scores_gemma":[0.9990121,0.00031741933,0.00012174095,0.00019292119,0.00019035363,0.00016556057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020283954,0.00040051734,0.0002799071,0.0006633306,0.0005413871,0.0007847348,0.0004325053,0.0003241783,0.0029856479],"category_scores_gemma":[0.0008193104,0.00023297785,0.0003141443,0.0005013109,0.0009151759,0.0011826116,0.0009232998,0.0007301578,0.0003046336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000510193,0.00016259153,0.008032164,0.00020836867,0.000055522203,0.0013819378,0.0006896726,0.018509762,0.089016855,0.80709267,0.0030975747,0.071242675],"study_design_scores_gemma":[0.00004187517,0.00011283513,0.0038183834,0.000034479755,0.000041246487,0.0008169184,0.0004048469,0.033601504,0.039878976,0.9078405,0.013382672,0.000025712648],"about_ca_topic_score_codex":0.0004902084,"about_ca_topic_score_gemma":0.00070057355,"teacher_disagreement_score":0.0029856479,"about_ca_system_score_codex":0.00038881172,"about_ca_system_score_gemma":0.0003820631,"threshold_uncertainty_score":0.00998801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7436688,0.0004914654,0.20816481,0.00079708215,0.00009026746,0.00011405523,0.0010253544,0.0008439855,0.04480412],"genre_scores_gemma":[0.9467067,0.00015221206,0.047031328,0.000090176996,0.000056998637,0.000119305696,0.00084800174,0.00013121926,0.0048639877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846566,0.00027087555,0.000093746,0.00031001613,0.00052028464,0.00033939],"domain_scores_gemma":[0.9966097,0.0016087331,0.00041788068,0.0006266059,0.00037709592,0.00036002617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006760113,0.00044945424,0.00055232807,0.0014155633,0.0011113294,0.002075648,0.00089886336,0.00068373134,0.008572374],"category_scores_gemma":[0.0042799925,0.00040066973,0.0003772414,0.0015760801,0.0013495166,0.0037957935,0.0023234312,0.00077486434,0.00074204244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001943339,0.00023782157,0.008624942,0.00039312348,0.000054783635,0.0005098708,0.0009540041,0.057448175,0.029939234,0.7096241,0.008696975,0.18157364],"study_design_scores_gemma":[0.00012956678,0.00041834402,0.0047161835,0.00010206424,0.00008605439,0.0013501529,0.00078679365,0.20202559,0.036909625,0.7157106,0.037700083,0.00006492227],"about_ca_topic_score_codex":0.00056556344,"about_ca_topic_score_gemma":0.00064336514,"teacher_disagreement_score":0.008572374,"about_ca_system_score_codex":0.0010106431,"about_ca_system_score_gemma":0.0004915827,"threshold_uncertainty_score":0.028677464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8326295,0.00034771956,0.108787805,0.00045936098,0.000052192237,0.00010631205,0.0015929504,0.00041064023,0.055613596],"genre_scores_gemma":[0.96155745,0.00017825203,0.026600389,0.0001203774,0.000021027763,0.000059491987,0.0018786237,0.00006514604,0.009519268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996074,0.00003762466,0.000028547847,0.000099863144,0.00010570247,0.0001208849],"domain_scores_gemma":[0.99932766,0.00017272362,0.00015329372,0.00012395009,0.00012327202,0.00009911725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017220025,0.00036024867,0.00038514167,0.0008718179,0.0007915089,0.0011674038,0.0007830235,0.00041255538,0.008001586],"category_scores_gemma":[0.0007836721,0.00032587544,0.0005043494,0.00088580616,0.00072164496,0.0015215897,0.0014436892,0.00054141675,0.00076242245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072022434,0.00020613815,0.013353595,0.00062347495,0.00013949415,0.0012587485,0.0006905811,0.040332086,0.06470325,0.7501072,0.017050393,0.110814914],"study_design_scores_gemma":[0.00012400423,0.00024432383,0.024269419,0.0001253723,0.00029877824,0.002967172,0.0014413793,0.11032759,0.0695308,0.7039514,0.08656419,0.00015562815],"about_ca_topic_score_codex":0.0019392605,"about_ca_topic_score_gemma":0.0021164415,"teacher_disagreement_score":0.008001586,"about_ca_system_score_codex":0.0007385018,"about_ca_system_score_gemma":0.0003621132,"threshold_uncertainty_score":0.026768029},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74579924,0.0012654631,0.19170807,0.0036707297,0.0003223744,0.000083922365,0.00033897953,0.00038747635,0.056423686],"genre_scores_gemma":[0.9832767,0.00024275387,0.013498693,0.00017281761,0.00016406324,0.000031650612,0.0001080297,0.000039276543,0.0024659268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992399,0.0002288273,0.000031138334,0.0001631207,0.00022420031,0.000112854395],"domain_scores_gemma":[0.9943402,0.0040441942,0.00038346212,0.0004137066,0.0002834946,0.0005348822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012393721,0.00037850058,0.00066399755,0.0012354808,0.001984654,0.0015469239,0.0009993336,0.0009949972,0.005996753],"category_scores_gemma":[0.0049187797,0.00039226588,0.0009094814,0.0011714351,0.0026114327,0.0026003171,0.0025960046,0.0019248145,0.00023184023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107716354,0.00002703201,0.0013159583,0.00008091769,0.000035048375,0.0004945091,0.0005595858,0.00525077,0.0053283307,0.9794574,0.0023161785,0.005026441],"study_design_scores_gemma":[0.000036811503,0.00008537889,0.00088986405,0.000022328219,0.00003096406,0.00032292333,0.00023570427,0.028843498,0.0037287113,0.96136546,0.0044200183,0.000018301875],"about_ca_topic_score_codex":0.00087283604,"about_ca_topic_score_gemma":0.0010578295,"teacher_disagreement_score":0.005996753,"about_ca_system_score_codex":0.0008117943,"about_ca_system_score_gemma":0.0002941646,"threshold_uncertainty_score":0.020061195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8006296,0.0028858897,0.06954774,0.014064597,0.00056007213,0.00009263448,0.00084271375,0.00095271296,0.11042397],"genre_scores_gemma":[0.97908247,0.00079938915,0.010785334,0.001357231,0.00022149681,0.00009537168,0.0006025885,0.00008121213,0.0069749067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986046,0.00029124648,0.000064580345,0.00038696636,0.000289437,0.00036334989],"domain_scores_gemma":[0.99052775,0.005251309,0.0007665399,0.0017395386,0.00070069224,0.0010141605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016034257,0.0007834574,0.0013514394,0.002257566,0.002387977,0.0032362938,0.0013321432,0.0022609518,0.00637219],"category_scores_gemma":[0.010408299,0.00088023714,0.0017184935,0.0020965151,0.005371304,0.0060781213,0.004775304,0.0033913995,0.0012097475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064279715,0.000068833906,0.004710332,0.0002827737,0.00008842141,0.0005678627,0.0020500252,0.010320326,0.005363291,0.94229746,0.017607464,0.016000396],"study_design_scores_gemma":[0.00003944886,0.000025657086,0.0008546354,0.000038029026,0.00002290066,0.00025065645,0.00022791927,0.007214247,0.0012020895,0.98253375,0.007571484,0.0000191843],"about_ca_topic_score_codex":0.001568716,"about_ca_topic_score_gemma":0.0011333319,"teacher_disagreement_score":0.00637219,"about_ca_system_score_codex":0.0016427095,"about_ca_system_score_gemma":0.00064910465,"threshold_uncertainty_score":0.021317065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57518667,0.0016352562,0.407123,0.0017204805,0.00010497212,0.00008587435,0.0004852984,0.00054386957,0.013114612],"genre_scores_gemma":[0.97632617,0.0008258277,0.017522583,0.00016999486,0.00006690758,0.000091061054,0.00022054448,0.000058654547,0.0047183456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990181,0.00039760306,0.00004175777,0.0002237535,0.00016034035,0.00015845735],"domain_scores_gemma":[0.9928033,0.004360918,0.0009936892,0.0004876689,0.00047916194,0.00087527506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025184914,0.00054861937,0.0011867072,0.0016300372,0.0010774913,0.0015194591,0.0013953728,0.0012355372,0.0026035889],"category_scores_gemma":[0.011909964,0.00054131594,0.0008724714,0.0009152632,0.002177848,0.002880262,0.0017644782,0.0014631164,0.00036349113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012590626,0.000051427436,0.0023812714,0.00009852466,0.000051435578,0.0005891351,0.00031166375,0.0789523,0.001955056,0.90939,0.0013016666,0.0047916793],"study_design_scores_gemma":[0.00006861832,0.00005595995,0.0007581461,0.000036060857,0.000027106133,0.00021695226,0.00010795146,0.42630923,0.00051569496,0.5700624,0.0018087385,0.000033081837],"about_ca_topic_score_codex":0.0031929458,"about_ca_topic_score_gemma":0.0037265914,"teacher_disagreement_score":0.0031929458,"about_ca_system_score_codex":0.0021509225,"about_ca_system_score_gemma":0.00069974945,"threshold_uncertainty_score":0.015606105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8161948,0.0016649726,0.103281714,0.0037799007,0.00046511844,0.000030824594,0.0002882171,0.00024358521,0.07405093],"genre_scores_gemma":[0.989632,0.0003837993,0.0036566914,0.00016930369,0.00025283766,0.000009138865,0.000062326784,0.000038244376,0.0057956693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936837,0.00013640904,0.000016348065,0.00013653634,0.00017304145,0.00016939316],"domain_scores_gemma":[0.9963405,0.0022622792,0.00031537356,0.00028724896,0.00041641106,0.00037816886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087090995,0.00036551352,0.00060487766,0.0015751139,0.0012709681,0.001854307,0.0006207275,0.00065785804,0.004950421],"category_scores_gemma":[0.0074671754,0.00027367653,0.00042471755,0.0011140625,0.003924961,0.0030250237,0.0014062526,0.002625054,0.0008236859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010633103,0.000019669826,0.00083853345,0.00003859905,0.000005678362,0.00012888148,0.00027826295,0.0033958016,0.0019244325,0.9825119,0.0014362406,0.009315666],"study_design_scores_gemma":[0.000018317476,0.000021440721,0.00046497944,0.000016506567,0.0000044753406,0.000111143556,0.00010360529,0.009623623,0.0009804649,0.9858878,0.0027526258,0.000014916394],"about_ca_topic_score_codex":0.0018278821,"about_ca_topic_score_gemma":0.00109847,"teacher_disagreement_score":0.004950421,"about_ca_system_score_codex":0.0015096817,"about_ca_system_score_gemma":0.0005872286,"threshold_uncertainty_score":0.016560853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9006599,0.00029258622,0.048872527,0.0055111465,0.00016181693,0.00008071999,0.0004939663,0.0006203293,0.043306917],"genre_scores_gemma":[0.99075806,0.000106565014,0.0057525747,0.00036895188,0.00009712558,0.00004807973,0.00025115456,0.000051189592,0.002566207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998684,0.00033421506,0.000053116535,0.0003094163,0.0003286553,0.00029062093],"domain_scores_gemma":[0.9814228,0.013098101,0.0011096857,0.0026301504,0.0008967939,0.00084257004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015973297,0.0005022206,0.000760775,0.0011135394,0.0015608832,0.0015304434,0.0011053529,0.0013164793,0.008322887],"category_scores_gemma":[0.012550344,0.0004544933,0.0009362596,0.0009179588,0.003145957,0.004377982,0.0020429369,0.001594889,0.0005744671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018137957,0.0002049161,0.0076284274,0.00026554507,0.000101134516,0.0009972956,0.0012256707,0.050616235,0.01617293,0.8850866,0.013575215,0.022312226],"study_design_scores_gemma":[0.00015935664,0.00009263447,0.001389278,0.00002326556,0.0000264013,0.0002027296,0.00026963864,0.07763334,0.00532963,0.9115798,0.0032649762,0.000028915054],"about_ca_topic_score_codex":0.0026054843,"about_ca_topic_score_gemma":0.0023817897,"teacher_disagreement_score":0.008322887,"about_ca_system_score_codex":0.0014117655,"about_ca_system_score_gemma":0.0008207819,"threshold_uncertainty_score":0.02784288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5568699,0.0029905927,0.41806847,0.0017341472,0.00015477622,0.00025380586,0.0024715213,0.0014778487,0.015979009],"genre_scores_gemma":[0.8210892,0.001885298,0.16375604,0.00046133282,0.0002646007,0.00035859388,0.0028152864,0.0004829685,0.008886692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995808,0.0012026355,0.0003745639,0.0008877197,0.0009997716,0.00072734995],"domain_scores_gemma":[0.96034294,0.024387348,0.004317061,0.0057021026,0.002764222,0.0024861824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037130322,0.0007363282,0.0013100561,0.0028181712,0.0024234636,0.003441489,0.0014462906,0.0014667622,0.006439564],"category_scores_gemma":[0.023706945,0.0012063328,0.0013080898,0.0027635496,0.0031521297,0.007421688,0.003359004,0.0026596866,0.0011006834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080699736,0.0001947932,0.019023687,0.0005805997,0.000120481294,0.0006651335,0.0023457431,0.032819342,0.015174873,0.8446819,0.010232964,0.07335347],"study_design_scores_gemma":[0.00008840632,0.00039114297,0.003861779,0.00014844406,0.0000895939,0.0028095376,0.0009446497,0.09559735,0.0071920045,0.8651041,0.023707177,0.00006576783],"about_ca_topic_score_codex":0.0015390195,"about_ca_topic_score_gemma":0.0022420017,"teacher_disagreement_score":0.006439564,"about_ca_system_score_codex":0.0021325257,"about_ca_system_score_gemma":0.0011124663,"threshold_uncertainty_score":0.02154249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59085786,0.0010720291,0.33364505,0.002176265,0.00016832772,0.00019791322,0.0024193602,0.000992177,0.06847098],"genre_scores_gemma":[0.9540023,0.00031109375,0.040836386,0.00031379063,0.0000898708,0.00006410856,0.0009599832,0.00007954189,0.0033430234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999134,0.00014809224,0.00006111696,0.0003012416,0.00018530608,0.00017027897],"domain_scores_gemma":[0.9968143,0.0011176557,0.00069606066,0.00050407054,0.00042279618,0.00044508596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005066014,0.00046021925,0.00045414252,0.0014507336,0.0012857958,0.0023400367,0.0007876783,0.00075775204,0.006290838],"category_scores_gemma":[0.0031159043,0.000616774,0.00035744722,0.0015975883,0.0018059467,0.0034701251,0.0016110559,0.0009353814,0.0006478056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038445264,0.00008739035,0.00607332,0.00024538836,0.00003628298,0.00037286867,0.0005228653,0.016104879,0.013956451,0.91430724,0.009247292,0.038661547],"study_design_scores_gemma":[0.000056137644,0.00014047367,0.0040483763,0.000081283644,0.000040216528,0.0010629576,0.0006662583,0.07142125,0.008733663,0.88588893,0.027812654,0.000047823807],"about_ca_topic_score_codex":0.0017742553,"about_ca_topic_score_gemma":0.0011191831,"teacher_disagreement_score":0.006290838,"about_ca_system_score_codex":0.0010652539,"about_ca_system_score_gemma":0.0006926925,"threshold_uncertainty_score":0.02104491},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50282884,0.0007346613,0.4788396,0.0018675611,0.00007129116,0.00021273564,0.00051543355,0.00060650875,0.01432337],"genre_scores_gemma":[0.92550856,0.00055922335,0.06646727,0.00027130643,0.00007262944,0.00018314933,0.0003769797,0.0001499257,0.006410889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979791,0.00072414835,0.000064600856,0.00050616194,0.00021915967,0.00050686963],"domain_scores_gemma":[0.9899766,0.006830267,0.0012197501,0.00085429935,0.00027690534,0.0008422418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016153067,0.0018458473,0.0021502073,0.0011104911,0.0013656438,0.0018425225,0.0028273573,0.0022633432,0.0047554527],"category_scores_gemma":[0.012565231,0.00079186534,0.0012008883,0.0013661152,0.0030533469,0.0059537776,0.0026430415,0.0020067664,0.00052924006],"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.000597661,0.00015687656,0.0012012833,0.00021894026,0.00012556552,0.00061121327,0.0002337028,0.7196965,0.005436018,0.25818366,0.0026518453,0.010886655],"study_design_scores_gemma":[0.00008935373,0.00013508425,0.00044532618,0.000019537607,0.00003385277,0.00024869313,0.00013354231,0.8671801,0.0015157704,0.12873162,0.0014288098,0.000038199698],"about_ca_topic_score_codex":0.0044319173,"about_ca_topic_score_gemma":0.004108405,"teacher_disagreement_score":0.0047554527,"about_ca_system_score_codex":0.0019653873,"about_ca_system_score_gemma":0.001013373,"threshold_uncertainty_score":0.015908599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80272555,0.0006399363,0.18814512,0.00038775842,0.000024332749,0.000029263862,0.00018050714,0.00014274103,0.0077248644],"genre_scores_gemma":[0.9754847,0.00015491586,0.022869268,0.00007007435,0.000019543097,0.000013473046,0.00017024488,0.000014811561,0.0012028476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997998,0.000040027335,0.000010865776,0.000048503105,0.00004944512,0.0000513436],"domain_scores_gemma":[0.999121,0.0003752317,0.0001957038,0.00009209574,0.00009341792,0.0001226006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024027238,0.00023205981,0.00028122694,0.00093019294,0.0003602942,0.00064742414,0.00023068547,0.00028596527,0.0016589012],"category_scores_gemma":[0.0011100819,0.00020732608,0.00028831218,0.0005410353,0.0005540306,0.0010651544,0.00066365337,0.00041076555,0.00012798951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075128593,0.00019776169,0.015597149,0.0003888416,0.000106675485,0.002031339,0.001054276,0.16200279,0.10815718,0.62842226,0.0048915064,0.07639893],"study_design_scores_gemma":[0.00005205451,0.00010167237,0.006173496,0.00007081,0.000054613716,0.0013406764,0.00055498554,0.40503356,0.012708292,0.5674939,0.0063936706,0.000022298402],"about_ca_topic_score_codex":0.0009814337,"about_ca_topic_score_gemma":0.0017297948,"teacher_disagreement_score":0.0016589012,"about_ca_system_score_codex":0.0004094722,"about_ca_system_score_gemma":0.00020105591,"threshold_uncertainty_score":0.00554955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88907564,0.00044326307,0.09383875,0.0002655788,0.00005107664,0.00003367959,0.00021982427,0.00028777847,0.01578442],"genre_scores_gemma":[0.9905906,0.00008099996,0.007256613,0.00003617758,0.000050725237,0.000023319337,0.00011254959,0.00003559496,0.001813508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00012708239,0.00002419452,0.0001001472,0.00012563501,0.000095276846],"domain_scores_gemma":[0.9979126,0.00079810456,0.00044703716,0.00015796805,0.00027916374,0.00040511694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005360403,0.0003085098,0.0004333501,0.0013676136,0.0006834287,0.0011222509,0.0006841762,0.0004504347,0.0030678732],"category_scores_gemma":[0.0029412492,0.00030413363,0.00036226565,0.0005621784,0.0011961882,0.0012018037,0.000849151,0.0006252349,0.00023243406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002868729,0.00008679246,0.003019398,0.00012620764,0.000035462013,0.00039714095,0.0005966268,0.015356964,0.019395374,0.9450895,0.003066274,0.01254346],"study_design_scores_gemma":[0.000031804597,0.00008135946,0.0023512365,0.000021842747,0.000012323099,0.00055517425,0.0002271192,0.06903127,0.0038899845,0.92035645,0.003413042,0.000028403023],"about_ca_topic_score_codex":0.0005673311,"about_ca_topic_score_gemma":0.0004620025,"teacher_disagreement_score":0.0030678732,"about_ca_system_score_codex":0.0005422496,"about_ca_system_score_gemma":0.00017876748,"threshold_uncertainty_score":0.010263085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8328247,0.0007720864,0.12919065,0.000979476,0.000067787754,0.00006873106,0.00041045007,0.00032940012,0.035356652],"genre_scores_gemma":[0.9862942,0.000147975,0.011773398,0.00009119719,0.00005282132,0.000050657858,0.00010626412,0.00006312282,0.0014202715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990158,0.00028514102,0.000059111757,0.0002888485,0.0002081756,0.00014296788],"domain_scores_gemma":[0.9840831,0.009995642,0.0020294883,0.0014069657,0.0010005906,0.0014841604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018411769,0.00043048838,0.00040357042,0.0026421656,0.0011134614,0.0027714649,0.0010531151,0.00053352857,0.004063907],"category_scores_gemma":[0.012982382,0.00024798574,0.00026625211,0.0015253085,0.0030542284,0.0033757156,0.0014142859,0.0013106632,0.00032601345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006082347,0.00017124174,0.013725011,0.00017007238,0.00006172992,0.00042887116,0.00045194093,0.028372955,0.020120727,0.90509826,0.0023836414,0.02840733],"study_design_scores_gemma":[0.00006642208,0.0001649053,0.006529842,0.00007520638,0.00006835992,0.0009692309,0.00032349196,0.08511689,0.011079399,0.89108175,0.00442702,0.000097551856],"about_ca_topic_score_codex":0.00087173644,"about_ca_topic_score_gemma":0.00081315154,"teacher_disagreement_score":0.004063907,"about_ca_system_score_codex":0.0015613493,"about_ca_system_score_gemma":0.00044156137,"threshold_uncertainty_score":0.013595104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9267549,0.0006011929,0.060214326,0.00045769595,0.00003123411,0.000050438994,0.00089898147,0.0001735431,0.010817644],"genre_scores_gemma":[0.9779213,0.00043808078,0.01872002,0.00012886751,0.00006567856,0.000069960755,0.0011709001,0.000050759045,0.0014344314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996352,0.000057923997,0.000020125364,0.00009121122,0.00010672636,0.00008874529],"domain_scores_gemma":[0.9972256,0.0012771436,0.0006258474,0.00035659707,0.00023565468,0.00027908594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031020952,0.00049341563,0.00053143874,0.0015965392,0.0007072503,0.0011870645,0.000622536,0.0006090991,0.0024284036],"category_scores_gemma":[0.0022013288,0.00035860259,0.00045386248,0.0011540024,0.0009049562,0.0021853351,0.0011446074,0.00082686805,0.00032863847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087325653,0.00019070703,0.035118,0.00071736146,0.00018610657,0.0013831797,0.0021620914,0.06283174,0.13437368,0.646509,0.010504233,0.10515069],"study_design_scores_gemma":[0.00006746352,0.00025284698,0.023961747,0.00013708536,0.00012721574,0.0036805568,0.0009989454,0.14589357,0.03497503,0.7694811,0.020327192,0.00009729359],"about_ca_topic_score_codex":0.0002837976,"about_ca_topic_score_gemma":0.00035107695,"teacher_disagreement_score":0.0024284036,"about_ca_system_score_codex":0.00049046986,"about_ca_system_score_gemma":0.00023284506,"threshold_uncertainty_score":0.008123875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7642308,0.0007499678,0.17927933,0.00075681607,0.00019440714,0.0005652185,0.0016169515,0.0007522797,0.05185428],"genre_scores_gemma":[0.9535525,0.00024178503,0.03653653,0.00024510894,0.000049021044,0.00038904708,0.0010916267,0.000064383006,0.007830061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989348,0.00018692159,0.00012706795,0.00027295825,0.00018757928,0.00029071112],"domain_scores_gemma":[0.99641466,0.0011286566,0.00075390656,0.00045030352,0.00071232434,0.0005401051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752552,0.0005328915,0.0008811838,0.0013124463,0.0016897041,0.001464693,0.0010939992,0.0011172668,0.008054754],"category_scores_gemma":[0.0053490982,0.0006816799,0.0005993736,0.00094392494,0.0012548713,0.0018558857,0.0023075598,0.00074356893,0.0012861645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020419008,0.0003688939,0.011036505,0.0012699796,0.0002686294,0.004429584,0.0016134412,0.040337294,0.07590088,0.7807196,0.013324616,0.06868867],"study_design_scores_gemma":[0.00052094087,0.00048733616,0.004593634,0.00030818282,0.00017418757,0.002895274,0.0009420498,0.108235754,0.051584832,0.77074456,0.059344344,0.00016879843],"about_ca_topic_score_codex":0.0018217622,"about_ca_topic_score_gemma":0.00278689,"teacher_disagreement_score":0.008054754,"about_ca_system_score_codex":0.00071072055,"about_ca_system_score_gemma":0.0010059922,"threshold_uncertainty_score":0.026945889},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8536658,0.00023339178,0.14073025,0.00044284738,0.000023551353,0.00007358749,0.00019997108,0.00038285286,0.004247811],"genre_scores_gemma":[0.98401004,0.00013680803,0.014230254,0.000052668038,0.000014461255,0.000068441565,0.0002412235,0.00005480089,0.0011913779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941945,0.00025501015,0.000019049256,0.00013383914,0.00010694896,0.000065659384],"domain_scores_gemma":[0.9924148,0.005181216,0.0010591238,0.00048660836,0.00043833218,0.00042008137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008441343,0.00040032974,0.0005930292,0.0015872613,0.0006158286,0.001009886,0.0013517109,0.0012599629,0.0019246524],"category_scores_gemma":[0.011821368,0.0004561513,0.00040430858,0.0007015206,0.001663229,0.0015709829,0.0010632763,0.0008675424,0.00021975405],"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.0004080113,0.000097908705,0.006730386,0.00013374342,0.00007366056,0.00085564563,0.00056113995,0.5828999,0.0102631515,0.38096815,0.0029890074,0.014019265],"study_design_scores_gemma":[0.00006329574,0.000045800254,0.0012091647,0.000014216035,0.000015875296,0.00017599462,0.00007315594,0.8994175,0.0017429601,0.096340515,0.000883461,0.000018014302],"about_ca_topic_score_codex":0.0015855868,"about_ca_topic_score_gemma":0.0011631547,"teacher_disagreement_score":0.0019246524,"about_ca_system_score_codex":0.00090010266,"about_ca_system_score_gemma":0.00033830118,"threshold_uncertainty_score":0.0065307617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121215776,0.0007526377,0.8635197,0.0013669608,0.00019940422,0.00028502793,0.00023835695,0.00039803542,0.012024008],"genre_scores_gemma":[0.40532517,0.00086726714,0.5865731,0.0003599654,0.0002003185,0.00027045654,0.00032578362,0.0001417289,0.0059362124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917513,0.0002916748,0.00005708192,0.00017051445,0.00017890496,0.00012670095],"domain_scores_gemma":[0.9971597,0.0016824558,0.00033333182,0.0003370572,0.00028262514,0.00020482855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011517829,0.0007062249,0.00084413186,0.00062747294,0.0014915002,0.0010808422,0.0011377243,0.0006778955,0.0022909194],"category_scores_gemma":[0.0029120427,0.00037740526,0.0006980328,0.0012131869,0.0014549902,0.0020189332,0.0013766511,0.0010606913,0.0002874761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005141137,0.00047768131,0.0015727798,0.00085970014,0.00009824813,0.0006007057,0.000638062,0.23265766,0.038969588,0.48108622,0.014567458,0.22795783],"study_design_scores_gemma":[0.000118823176,0.00025630216,0.0004761413,0.000040161824,0.00006438273,0.00051668705,0.00018974674,0.58741474,0.011477362,0.3829499,0.016467568,0.000028215227],"about_ca_topic_score_codex":0.0019666895,"about_ca_topic_score_gemma":0.0031670958,"teacher_disagreement_score":0.0022909194,"about_ca_system_score_codex":0.0014296984,"about_ca_system_score_gemma":0.0013829245,"threshold_uncertainty_score":0.010373175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9583868,0.00018453364,0.01850351,0.00017956182,0.000048813476,0.00004487543,0.0001317264,0.00014895826,0.022371389],"genre_scores_gemma":[0.9887517,0.0001231532,0.0071614645,0.000045235458,0.000035355457,0.00001807589,0.00023823242,0.00001505111,0.0036117462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973947,0.00003159909,0.000012215877,0.00007845861,0.00007388655,0.00006429895],"domain_scores_gemma":[0.99900645,0.0001897177,0.00027109022,0.00016335,0.0001438864,0.00022555591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020278711,0.00027971718,0.00025295274,0.00084855,0.00075889635,0.0012777323,0.00045812334,0.00034647022,0.0028693024],"category_scores_gemma":[0.0010113895,0.00015960618,0.00025553725,0.00048059007,0.0011723958,0.0011232595,0.000616829,0.0004871329,0.00028208946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018508664,0.00008860624,0.006029719,0.00009002888,0.00002457917,0.0008002304,0.00069314655,0.0056193406,0.027760558,0.93326783,0.0021359785,0.023304963],"study_design_scores_gemma":[0.00009716678,0.00026285995,0.008902297,0.000054556334,0.000084956155,0.0021052936,0.0009857038,0.04996469,0.027978577,0.8715377,0.03796045,0.000065700326],"about_ca_topic_score_codex":0.0021344502,"about_ca_topic_score_gemma":0.003027281,"teacher_disagreement_score":0.0028693024,"about_ca_system_score_codex":0.0009880988,"about_ca_system_score_gemma":0.0004963547,"threshold_uncertainty_score":0.009598792},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06490338,0.73636883,0.08383117,0.01892742,0.0020525178,0.000067146946,0.00046529816,0.00036509166,0.09301918],"genre_scores_gemma":[0.5163074,0.42658362,0.034163386,0.0034258384,0.009512418,0.0001055323,0.0013835764,0.00014865091,0.008369502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977628,0.0003794753,0.0001641309,0.00076482916,0.0006691568,0.0002596236],"domain_scores_gemma":[0.98836875,0.008532593,0.0006035116,0.00077020813,0.0013343899,0.0003905541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004226734,0.0008901974,0.0016071581,0.0037939798,0.0017440262,0.004268723,0.0023212424,0.0019118357,0.0035523267],"category_scores_gemma":[0.009887331,0.0007035999,0.00078532123,0.008204582,0.0051369593,0.009532583,0.0021927936,0.003571281,0.0009611795],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030266272,0.0002038991,0.0059438585,0.003717203,0.0001373792,0.00041417766,0.00063968136,0.007192086,0.001713395,0.6476235,0.026923921,0.30518833],"study_design_scores_gemma":[0.00004067917,0.00013279573,0.0029687334,0.0008722086,0.00010392963,0.0012939064,0.00076375285,0.011360231,0.002287525,0.7699436,0.2101368,0.000095868905],"about_ca_topic_score_codex":0.0019535888,"about_ca_topic_score_gemma":0.0009139429,"teacher_disagreement_score":0.004268723,"about_ca_system_score_codex":0.0024244622,"about_ca_system_score_gemma":0.00147973,"threshold_uncertainty_score":0.022353351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.971083,0.00018406835,0.014853373,0.00032838667,0.000055695604,0.000017719405,0.000032260774,0.0001356487,0.013309825],"genre_scores_gemma":[0.9937263,0.00006552807,0.004077608,0.00004398742,0.000022157805,0.000017359615,0.000042553558,0.000025767024,0.0019786998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993218,0.00011088362,0.000031111023,0.00018268336,0.00016507058,0.00018837617],"domain_scores_gemma":[0.9985185,0.0004893769,0.00024641785,0.00027755223,0.00011240442,0.00035583938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005732928,0.00064275105,0.0006705943,0.0011267521,0.0014916649,0.0027583346,0.0006175752,0.0017498403,0.003108568],"category_scores_gemma":[0.0031181774,0.0005536922,0.0006249767,0.0006764296,0.0024432414,0.002728324,0.002485702,0.001453606,0.000383096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010378994,0.00031368493,0.006423559,0.00021084999,0.00010689241,0.0035896515,0.0031946695,0.021662097,0.1143079,0.82301587,0.0023112267,0.023825767],"study_design_scores_gemma":[0.00023579242,0.0006227753,0.0070337513,0.000087780834,0.00026202068,0.0040781065,0.0024408705,0.11185738,0.075724445,0.77420545,0.023265017,0.00018657609],"about_ca_topic_score_codex":0.00042247004,"about_ca_topic_score_gemma":0.00033067248,"teacher_disagreement_score":0.003108568,"about_ca_system_score_codex":0.0010424088,"about_ca_system_score_gemma":0.00030221554,"threshold_uncertainty_score":0.010399163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9317793,0.00010247421,0.04742724,0.0001382863,0.000048180085,0.000025555108,0.0000641797,0.00009640875,0.020318242],"genre_scores_gemma":[0.989224,0.00004053004,0.006115076,0.000029268238,0.000019354,0.000016158368,0.000066768334,0.00001532899,0.0044734995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964976,0.000058527876,0.000019152953,0.00008934127,0.00009899443,0.00008411546],"domain_scores_gemma":[0.99923956,0.00017527965,0.00013051096,0.0001453121,0.00012380639,0.00018550867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033405048,0.0002089558,0.00024090482,0.000814827,0.00074934366,0.0013490797,0.00036646146,0.0004216153,0.0026557597],"category_scores_gemma":[0.0012863514,0.000259055,0.0003680833,0.00022287828,0.0016952705,0.0013106331,0.0011403104,0.0005395246,0.00032155638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023457802,0.00007386043,0.001923037,0.00005572014,0.000018184988,0.00058836624,0.00075631565,0.0063277297,0.017432608,0.9617613,0.0005916004,0.010236649],"study_design_scores_gemma":[0.000056856043,0.00014852302,0.0016686881,0.0000239078,0.000036621397,0.0011268739,0.0007654222,0.046507895,0.022821791,0.9174453,0.009354059,0.000043932265],"about_ca_topic_score_codex":0.0004029667,"about_ca_topic_score_gemma":0.00040705747,"teacher_disagreement_score":0.0026557597,"about_ca_system_score_codex":0.000497154,"about_ca_system_score_gemma":0.00026155365,"threshold_uncertainty_score":0.00888443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7381399,0.0004437239,0.1538155,0.0015862919,0.00014796574,0.00014839308,0.0005198502,0.00066705124,0.10453137],"genre_scores_gemma":[0.9684172,0.0002675724,0.023269488,0.0002814337,0.000049566635,0.000048067293,0.00023183708,0.00004567686,0.007389078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996026,0.00006017911,0.000011696609,0.00007744266,0.00014451798,0.000103550694],"domain_scores_gemma":[0.9985683,0.0004883057,0.00023645473,0.00036457615,0.00017760094,0.00016482675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022797503,0.000208508,0.00024200983,0.00053113414,0.0010702708,0.00089874654,0.00044732014,0.0003985304,0.004663476],"category_scores_gemma":[0.0013509304,0.00031433452,0.0003743125,0.0006968294,0.0015180532,0.0013954126,0.0013835318,0.001606775,0.0004282413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014644368,0.000059791368,0.002227888,0.00009453492,0.000012398579,0.0006240703,0.0007042609,0.0060953847,0.0072709173,0.94789153,0.0041708713,0.030701848],"study_design_scores_gemma":[0.000051772542,0.00010134851,0.0042956467,0.000021293334,0.000029846946,0.0013787334,0.0005497955,0.025984107,0.010311328,0.9341117,0.023116678,0.00004785899],"about_ca_topic_score_codex":0.004324984,"about_ca_topic_score_gemma":0.004932524,"teacher_disagreement_score":0.004663476,"about_ca_system_score_codex":0.0007751114,"about_ca_system_score_gemma":0.00095632527,"threshold_uncertainty_score":0.01560086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9551487,0.00006640875,0.03875627,0.000070715345,0.0000047749813,0.0000355554,0.00019449179,0.00011397808,0.0056089438],"genre_scores_gemma":[0.9878878,0.000034188506,0.010471245,0.00001978581,0.000007538124,0.00002068451,0.00045113984,0.000018032064,0.0010895664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976605,0.000048964965,0.000018488377,0.0000739633,0.000053576827,0.000038956827],"domain_scores_gemma":[0.9992943,0.0002531151,0.00016159759,0.00013409897,0.00007967614,0.000077145705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013200106,0.00014247803,0.00022845047,0.0006599114,0.00058156875,0.00045537294,0.00029570243,0.00024690732,0.001862641],"category_scores_gemma":[0.0009232369,0.00020568594,0.00024284543,0.00067114155,0.0005866924,0.00090104144,0.0006891579,0.00018825835,0.00012170668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005115916,0.00014470765,0.02118608,0.00035764067,0.00016439315,0.002630254,0.0031505954,0.03884465,0.13974765,0.6999862,0.004323305,0.08895288],"study_design_scores_gemma":[0.0000727593,0.00018258138,0.024197405,0.000046763005,0.00019667507,0.0030101675,0.0017723256,0.17503156,0.04380588,0.73585325,0.0157877,0.000043050288],"about_ca_topic_score_codex":0.0015638318,"about_ca_topic_score_gemma":0.0014652789,"teacher_disagreement_score":0.001862641,"about_ca_system_score_codex":0.00035933987,"about_ca_system_score_gemma":0.00017769785,"threshold_uncertainty_score":0.006231189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526653,0.00016985148,0.036916997,0.00042228607,0.00002911067,0.000054161774,0.0002230887,0.00013786025,0.009381223],"genre_scores_gemma":[0.9907012,0.000085739826,0.0066867,0.00007750839,0.000026503443,0.000033120457,0.00022514547,0.000040714083,0.0021234488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948055,0.00014278702,0.000021952068,0.000114266,0.00011473336,0.00012574668],"domain_scores_gemma":[0.9970074,0.0016025489,0.00053722964,0.00032642414,0.00022382445,0.00030254666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861908,0.00043532276,0.00063301984,0.00094947487,0.0009575165,0.0019790235,0.0012320898,0.0010844747,0.0053027547],"category_scores_gemma":[0.0030153422,0.00050814636,0.0007755185,0.00065382494,0.0018184729,0.0022599064,0.0009927966,0.0009773071,0.00022017895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014617906,0.0003551767,0.015449761,0.00046847097,0.00021590611,0.0020487474,0.0020062288,0.20156115,0.052747164,0.663988,0.0058542155,0.053843487],"study_design_scores_gemma":[0.0001920583,0.00009341572,0.0028122948,0.00003611381,0.000065249886,0.0007544232,0.0005507923,0.23007388,0.016322616,0.7446772,0.0043728864,0.000049136666],"about_ca_topic_score_codex":0.0037478749,"about_ca_topic_score_gemma":0.0029780539,"teacher_disagreement_score":0.0053027547,"about_ca_system_score_codex":0.0010643131,"about_ca_system_score_gemma":0.000514896,"threshold_uncertainty_score":0.017739475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8097314,0.00091721286,0.16473724,0.0046226354,0.00009111419,0.00031194324,0.0045512607,0.0017889543,0.013248253],"genre_scores_gemma":[0.94536495,0.0005611283,0.047097504,0.0003034891,0.00011686728,0.0001951895,0.0031370409,0.00018090509,0.003042907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706984,0.00084733055,0.00023509265,0.00079563056,0.00052708556,0.0005249192],"domain_scores_gemma":[0.97248435,0.020844523,0.0021094782,0.0020266501,0.0012299668,0.0013050728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015426449,0.0006947857,0.0010469396,0.0016807561,0.0013400051,0.0046293447,0.0025508783,0.0018627535,0.0088619515],"category_scores_gemma":[0.012552986,0.00073397043,0.0013334088,0.0026627672,0.0020083457,0.0123412665,0.0025544746,0.0025606905,0.00066301203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022854067,0.0013443414,0.016613381,0.0022711079,0.00042940676,0.0009856003,0.0030151405,0.3876023,0.018068826,0.42181683,0.020319141,0.12524861],"study_design_scores_gemma":[0.00020989758,0.00013400406,0.0023608422,0.000066222914,0.00011262052,0.0004577214,0.00072342565,0.38876823,0.0053931996,0.5965469,0.0051470394,0.0000799785],"about_ca_topic_score_codex":0.0036584102,"about_ca_topic_score_gemma":0.002609501,"teacher_disagreement_score":0.0088619515,"about_ca_system_score_codex":0.0031774035,"about_ca_system_score_gemma":0.0017176414,"threshold_uncertainty_score":0.029646218},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6545975,0.0009981381,0.32708436,0.0017645238,0.00010136862,0.0001623618,0.00032633875,0.0002687981,0.014696551],"genre_scores_gemma":[0.9488953,0.0005851085,0.043932762,0.00031819017,0.000099420395,0.00021872562,0.00024317231,0.000064726424,0.005642571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900573,0.00041536445,0.000031326887,0.0002246468,0.0001738771,0.00014909489],"domain_scores_gemma":[0.99629277,0.0016722666,0.00086470664,0.000396487,0.00032181706,0.00045182923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012149845,0.0005593158,0.00064878835,0.001573363,0.0010099164,0.0012508199,0.0012299604,0.0009004257,0.0022586347],"category_scores_gemma":[0.007014877,0.00047605415,0.00059322704,0.00088117784,0.0027546224,0.002624487,0.0015825507,0.0009885645,0.00028640754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014035002,0.000036117573,0.0012758758,0.000065897075,0.000035754743,0.0003062236,0.00025901047,0.05576259,0.0025597059,0.9293511,0.0014224832,0.0087849405],"study_design_scores_gemma":[0.0000796712,0.00007012102,0.00063769124,0.000020084413,0.000023597253,0.00016884129,0.00010829549,0.25196466,0.0013387586,0.7428639,0.0026830873,0.00004122324],"about_ca_topic_score_codex":0.0022532865,"about_ca_topic_score_gemma":0.0022363407,"teacher_disagreement_score":0.0022586347,"about_ca_system_score_codex":0.0015525867,"about_ca_system_score_gemma":0.0007373977,"threshold_uncertainty_score":0.011264801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8794162,0.0013154785,0.07335105,0.0013752119,0.0000781263,0.000062787745,0.0005584418,0.00059782784,0.043244768],"genre_scores_gemma":[0.98723316,0.0002481539,0.009491448,0.00009945499,0.000046456604,0.000049505128,0.00015202232,0.00002907399,0.002650803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920565,0.00023400996,0.000035397607,0.00018211563,0.00018497312,0.00015789016],"domain_scores_gemma":[0.99545115,0.00249054,0.0006449249,0.00039894666,0.0004369179,0.0005774421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090387004,0.00032840198,0.0004685518,0.0017199854,0.00079686625,0.0015453625,0.0006437273,0.00058454485,0.005523759],"category_scores_gemma":[0.0063479203,0.00037464828,0.000367728,0.0007286324,0.0016056938,0.0034820114,0.0013526041,0.00096494873,0.00046747082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037093452,0.000068883,0.0027167203,0.00024426664,0.00003196908,0.00019313207,0.0006537479,0.020891396,0.0097159045,0.9327403,0.004600336,0.027772514],"study_design_scores_gemma":[0.000039840474,0.00006497087,0.0013513543,0.000037884307,0.000020853615,0.0003826581,0.00020613465,0.07045459,0.0032986137,0.9198188,0.0042983587,0.000025847767],"about_ca_topic_score_codex":0.0008954586,"about_ca_topic_score_gemma":0.00092754624,"teacher_disagreement_score":0.005523759,"about_ca_system_score_codex":0.0012044166,"about_ca_system_score_gemma":0.00038346686,"threshold_uncertainty_score":0.01847887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87944996,0.00082601106,0.106457666,0.0011636437,0.00004918816,0.000046923895,0.0003494747,0.00014306416,0.011514077],"genre_scores_gemma":[0.9773842,0.00027849482,0.020288976,0.000090528345,0.00005771743,0.0000504043,0.00018786751,0.000059881077,0.0016019462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993148,0.00029010174,0.00002580259,0.00016284085,0.00011702295,0.000089418114],"domain_scores_gemma":[0.9958781,0.0027219893,0.0004672585,0.00024234835,0.0003201113,0.00037019636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013801366,0.00044563072,0.00089533324,0.0013080586,0.0007669327,0.0012455566,0.0012237955,0.00092054333,0.003151487],"category_scores_gemma":[0.0074664573,0.0005218648,0.0003398915,0.0007268258,0.0012481825,0.002518411,0.0009545566,0.0008627746,0.00025008325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078059186,0.00018652128,0.007323499,0.00063644437,0.00012549179,0.0002834496,0.00086134975,0.11387925,0.028382022,0.81271243,0.0064048492,0.028424127],"study_design_scores_gemma":[0.00009752325,0.000115839335,0.003265044,0.00008104801,0.00004290681,0.00050108327,0.000410748,0.28452113,0.007834562,0.6997913,0.0032852162,0.000053533866],"about_ca_topic_score_codex":0.00080534926,"about_ca_topic_score_gemma":0.0009136142,"teacher_disagreement_score":0.003151487,"about_ca_system_score_codex":0.0008712532,"about_ca_system_score_gemma":0.0003584877,"threshold_uncertainty_score":0.01054275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9185014,0.00026565802,0.06745741,0.00018731563,0.000012500106,0.00002881608,0.00026151392,0.0001843887,0.013101106],"genre_scores_gemma":[0.9876446,0.00017713747,0.008472314,0.000022749446,0.000013553904,0.000030874784,0.00032380773,0.000021459804,0.0032935077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996755,0.00004796769,0.000026035994,0.00007880257,0.00008720304,0.000084490915],"domain_scores_gemma":[0.998887,0.00035587512,0.00025976993,0.00012481764,0.00018589919,0.00018663798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018568072,0.0005129451,0.00054949516,0.0018257328,0.0009423389,0.0019906047,0.000643847,0.0004374228,0.0023729333],"category_scores_gemma":[0.0010674471,0.00034293855,0.00047160374,0.0010050179,0.0016849033,0.0027300008,0.0014965929,0.0007299741,0.00041774186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067229127,0.00009703171,0.006444877,0.00016766488,0.000084152,0.0014617557,0.0010737907,0.041359786,0.03598677,0.8808314,0.001688024,0.030132422],"study_design_scores_gemma":[0.000052563177,0.00013656572,0.003951519,0.0000597942,0.000069148235,0.0011221314,0.000668198,0.077683814,0.019855749,0.8873376,0.009012491,0.00005042029],"about_ca_topic_score_codex":0.0014256584,"about_ca_topic_score_gemma":0.001232733,"teacher_disagreement_score":0.0023729333,"about_ca_system_score_codex":0.00081017416,"about_ca_system_score_gemma":0.00026208686,"threshold_uncertainty_score":0.007938206},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024329236,0.012869662,0.0809918,0.10972621,0.5938009,0.0002876999,0.007299011,0.0019857094,0.16870971],"genre_scores_gemma":[0.2603838,0.019103985,0.11726167,0.034074597,0.075918585,0.00052912085,0.016417973,0.004108794,0.4722014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998329,0.0002658227,0.0002652299,0.00031724526,0.0007265161,0.00009610645],"domain_scores_gemma":[0.98633933,0.0061469935,0.0006210197,0.0011784226,0.005399361,0.0003149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532625,0.0010802246,0.0009357063,0.0026486863,0.002479585,0.0028205211,0.0011982082,0.0016350329,0.04446899],"category_scores_gemma":[0.022712935,0.000588256,0.000843197,0.0024707948,0.0022036415,0.004416252,0.001111996,0.0045649675,0.0125041455],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021756628,0.000048088823,0.00060614303,0.000398642,0.000023670362,0.0008384237,0.00035442977,0.0004970448,0.0011459471,0.082163885,0.864562,0.049144235],"study_design_scores_gemma":[0.000070559974,0.000078988916,0.0026660287,0.00047870833,0.00007362872,0.0029383216,0.00064385124,0.0027279807,0.0034409838,0.09623681,0.89052033,0.00012379623],"about_ca_topic_score_codex":0.0020973384,"about_ca_topic_score_gemma":0.0030404546,"teacher_disagreement_score":0.04446899,"about_ca_system_score_codex":0.0020801658,"about_ca_system_score_gemma":0.0010526673,"threshold_uncertainty_score":0.1487636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94902056,0.000154286,0.039589874,0.0003186823,0.00002101208,0.000021708329,0.00008714815,0.00008024055,0.010706446],"genre_scores_gemma":[0.99282515,0.00009696245,0.0055849813,0.000041746367,0.000021361482,0.000025297737,0.00008263834,0.000021311487,0.0013005332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995221,0.00012679948,0.000021254518,0.00009227005,0.00011389279,0.00012378731],"domain_scores_gemma":[0.9972856,0.001514561,0.00058692694,0.00023840003,0.00014068902,0.00023384558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000503558,0.00048358532,0.00046164083,0.0011876939,0.0013254313,0.0015880823,0.00052211306,0.00072412123,0.0025995392],"category_scores_gemma":[0.0030070893,0.00034610313,0.00051707035,0.0007149261,0.002131867,0.0025361534,0.0010989734,0.0007068035,0.00015029272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032553577,0.00013245693,0.0041022706,0.00011770317,0.000038043185,0.0012247899,0.0011952219,0.028204605,0.02378554,0.9283019,0.001410526,0.0111614205],"study_design_scores_gemma":[0.000052970263,0.00006725014,0.001408945,0.000029410332,0.00002067928,0.0003645396,0.0007365086,0.062471487,0.0049869516,0.9279743,0.0018537088,0.000033224755],"about_ca_topic_score_codex":0.000819886,"about_ca_topic_score_gemma":0.0011584625,"teacher_disagreement_score":0.0025995392,"about_ca_system_score_codex":0.00086951157,"about_ca_system_score_gemma":0.0003121054,"threshold_uncertainty_score":0.008696318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8702848,0.0009948241,0.10309489,0.0005379572,0.000032282478,0.00004039194,0.00020931587,0.00010933797,0.02469623],"genre_scores_gemma":[0.97502565,0.0005452531,0.021452608,0.00007382852,0.000047338654,0.000048591945,0.0001901882,0.000050819515,0.0025657418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997491,0.00007032415,0.000008546686,0.00007215646,0.000046581226,0.000053262967],"domain_scores_gemma":[0.9984604,0.0008400244,0.00027747414,0.0001263728,0.00011950026,0.00017624047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049714337,0.0005259479,0.0004065572,0.001902935,0.0010040036,0.0011630196,0.00070125394,0.0006069139,0.0030658946],"category_scores_gemma":[0.0021848965,0.00023582013,0.00030752606,0.0015745373,0.0019731629,0.002239262,0.00089763314,0.0007979129,0.00029204588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000146774,0.000050531617,0.0030738784,0.00013930954,0.00002373314,0.00016644412,0.00037663218,0.03490758,0.011071012,0.9305,0.0017063655,0.017837692],"study_design_scores_gemma":[0.000030598938,0.000065261665,0.002064881,0.000037401216,0.000023910561,0.00032346888,0.00033866012,0.09073763,0.0042379857,0.89863193,0.003473783,0.000034391927],"about_ca_topic_score_codex":0.0009944784,"about_ca_topic_score_gemma":0.0015226252,"teacher_disagreement_score":0.0030658946,"about_ca_system_score_codex":0.0011544906,"about_ca_system_score_gemma":0.00027678444,"threshold_uncertainty_score":0.01025641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5575203,0.0045258943,0.38679373,0.0015667528,0.00017620019,0.00010644574,0.0021681585,0.0005873284,0.0465553],"genre_scores_gemma":[0.9126681,0.0020962593,0.07744002,0.0002698841,0.00025290935,0.00010511087,0.0009029934,0.00024203194,0.0060226326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999215,0.00017513768,0.000046753983,0.00029234844,0.00013868292,0.00013200621],"domain_scores_gemma":[0.99601245,0.0018989478,0.00066780444,0.0006122222,0.00035000767,0.00045864913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006558498,0.000584614,0.00053115614,0.0015735846,0.0007953949,0.0027530496,0.0011539765,0.0008914571,0.0037249206],"category_scores_gemma":[0.0051454613,0.00048091248,0.00046847315,0.0019422717,0.0023008534,0.0050944597,0.0016077138,0.0013970708,0.0006788504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005198033,0.000067955174,0.0037682054,0.00032446484,0.0000750077,0.00019346079,0.00079635327,0.039148334,0.015452146,0.8674626,0.00680329,0.06538833],"study_design_scores_gemma":[0.000052019943,0.000120959216,0.0025668559,0.00008261802,0.00005936457,0.00085944426,0.00048798823,0.061331835,0.0076264422,0.9001761,0.026585808,0.000050554943],"about_ca_topic_score_codex":0.0009855279,"about_ca_topic_score_gemma":0.00064523803,"teacher_disagreement_score":0.0037249206,"about_ca_system_score_codex":0.0010278975,"about_ca_system_score_gemma":0.0003751799,"threshold_uncertainty_score":0.012461126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.709662,0.0015707919,0.2394908,0.0022770064,0.00012593022,0.00007401666,0.0004589275,0.0006070529,0.045733403],"genre_scores_gemma":[0.9844899,0.00022590214,0.0134878,0.00025194595,0.00004043306,0.000028026208,0.00014169824,0.00007881733,0.0012553531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705577,0.0007978745,0.000113149305,0.0007410381,0.00049375836,0.0007984493],"domain_scores_gemma":[0.9710724,0.019871699,0.0016259716,0.0045399014,0.0014082963,0.0014816271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048050736,0.0006803851,0.00095629983,0.0022124809,0.0014543016,0.0025960046,0.0030741566,0.0018960428,0.0051379143],"category_scores_gemma":[0.029639555,0.0005962728,0.0007894544,0.0023519113,0.0040823584,0.0065954556,0.0033482462,0.0025495756,0.0004601221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087667885,0.000090939626,0.015427179,0.00024495463,0.000065239336,0.0003012788,0.0006739822,0.05281001,0.014767591,0.882658,0.004391759,0.027692404],"study_design_scores_gemma":[0.000040911138,0.0001232873,0.005158978,0.000083206796,0.000064267435,0.00047299676,0.00029452157,0.19479586,0.012947079,0.7811474,0.004812635,0.00005882519],"about_ca_topic_score_codex":0.0017021252,"about_ca_topic_score_gemma":0.0013933125,"teacher_disagreement_score":0.0051379143,"about_ca_system_score_codex":0.0026725854,"about_ca_system_score_gemma":0.00062958786,"threshold_uncertainty_score":0.025411963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25484112,0.0012380122,0.68462485,0.00048379324,0.00009378188,0.00021054588,0.00065020274,0.0008954175,0.056962293],"genre_scores_gemma":[0.74292076,0.0007034673,0.23957437,0.00022662217,0.00006759907,0.00022952302,0.0018036743,0.00030003843,0.0141739985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990914,0.00024955865,0.00006762458,0.00020519794,0.00024344955,0.00014282565],"domain_scores_gemma":[0.9975701,0.0010155537,0.00023454243,0.00059631706,0.00036554757,0.00021794041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005744852,0.0003822205,0.000421003,0.0009779027,0.0013190769,0.0016077658,0.001260963,0.00061954634,0.005252998],"category_scores_gemma":[0.0035055554,0.0004375483,0.00047693646,0.0009660333,0.0014298,0.0029910125,0.0026509394,0.0010337721,0.0010633067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037742476,0.000102793834,0.0022864512,0.00037075175,0.000040302195,0.0005038544,0.0018924638,0.028341852,0.032650717,0.84409124,0.0038839132,0.0854583],"study_design_scores_gemma":[0.000038585276,0.00011695909,0.0010367888,0.000099657525,0.00004611381,0.000727897,0.0007855251,0.057842594,0.012545959,0.87872773,0.047996923,0.00003523759],"about_ca_topic_score_codex":0.0010648541,"about_ca_topic_score_gemma":0.0018106772,"teacher_disagreement_score":0.005252998,"about_ca_system_score_codex":0.0008083219,"about_ca_system_score_gemma":0.00051100965,"threshold_uncertainty_score":0.017572999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82600427,0.0008533674,0.1328089,0.00062153314,0.00014676718,0.00010232417,0.0008788526,0.00039761642,0.038186233],"genre_scores_gemma":[0.9343252,0.00046312052,0.057882164,0.000109357905,0.00007796927,0.00012781919,0.0013367892,0.0000980565,0.00557944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858105,0.00024795288,0.00008598246,0.0002631294,0.0005723525,0.0002496368],"domain_scores_gemma":[0.9961442,0.0016548631,0.00072752853,0.00051202404,0.00067288824,0.00028844617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005847859,0.00027708782,0.0005398299,0.0027090118,0.0010816286,0.001631687,0.0012462029,0.0009408914,0.008702885],"category_scores_gemma":[0.0080769155,0.0003968278,0.00048811972,0.0024084786,0.0011933004,0.002433752,0.0017866427,0.00062083546,0.00063721946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006322171,0.00008950982,0.03436799,0.0007811228,0.00017608803,0.00082379143,0.0011871357,0.072477564,0.03007382,0.6685793,0.012335713,0.17847575],"study_design_scores_gemma":[0.00010005506,0.00013110977,0.015074385,0.00022579238,0.00015527557,0.0024287023,0.0009606408,0.327345,0.023252472,0.600553,0.029668715,0.000105012725],"about_ca_topic_score_codex":0.0016138187,"about_ca_topic_score_gemma":0.0018903526,"teacher_disagreement_score":0.008702885,"about_ca_system_score_codex":0.0010977591,"about_ca_system_score_gemma":0.0004547074,"threshold_uncertainty_score":0.029114008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87439954,0.0008280553,0.023911789,0.0005075156,0.000094508876,0.000028775185,0.00012103165,0.00013585716,0.09997294],"genre_scores_gemma":[0.99104214,0.00046301968,0.00355524,0.000039654926,0.00003638337,0.000022713522,0.000055698125,0.00005136856,0.004733706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999603,0.00006658034,0.000020436664,0.000097818614,0.00010851972,0.00010359726],"domain_scores_gemma":[0.99931824,0.00028807667,0.000100619574,0.00012772529,0.00005292382,0.000112404574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036566338,0.000480232,0.00037649772,0.0015301025,0.0017321621,0.002128664,0.0004943372,0.0006686823,0.00459683],"category_scores_gemma":[0.0024923424,0.0005010759,0.0005557241,0.0006716932,0.0034611418,0.0038346306,0.0025299909,0.0010221014,0.0006085908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014025594,0.00002232813,0.0031942572,0.000090318004,0.00002414173,0.0005414847,0.0007548637,0.0050546876,0.00602386,0.96346253,0.0012203739,0.019470949],"study_design_scores_gemma":[0.000019975101,0.000051609033,0.002465313,0.00006113133,0.000041770083,0.00077733595,0.00051887846,0.007916964,0.0068419916,0.9721901,0.009087462,0.000027612392],"about_ca_topic_score_codex":0.0002853957,"about_ca_topic_score_gemma":0.00037377924,"teacher_disagreement_score":0.00459683,"about_ca_system_score_codex":0.0006322333,"about_ca_system_score_gemma":0.0002438326,"threshold_uncertainty_score":0.015377939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8076625,0.00019523995,0.18368515,0.00043797557,0.000023986187,0.00012881002,0.0010121578,0.00037149453,0.006482667],"genre_scores_gemma":[0.954824,0.00010267981,0.041446764,0.000089748384,0.0000131806455,0.00006309363,0.0007741046,0.00003701468,0.0026493594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935406,0.0001131722,0.000058315145,0.0002220816,0.0001307044,0.00012171435],"domain_scores_gemma":[0.99428636,0.0037017912,0.00069583656,0.00042241527,0.00039447082,0.00049911457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267449,0.0002680268,0.0005921016,0.000695948,0.0010907239,0.0015366313,0.0007717568,0.00063218025,0.0033797398],"category_scores_gemma":[0.002993485,0.00043261767,0.0004559876,0.00095439114,0.0012556998,0.002139455,0.0008541071,0.0010335402,0.00020654395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012632508,0.0006383365,0.034176525,0.0010264723,0.00024272557,0.0039060512,0.00264166,0.14275917,0.05927892,0.6757528,0.0049424204,0.07337165],"study_design_scores_gemma":[0.00014943819,0.00020700104,0.0065977657,0.0001273573,0.00013988277,0.0015747757,0.0018227326,0.25563318,0.027710203,0.6974155,0.008554284,0.00006790116],"about_ca_topic_score_codex":0.003111893,"about_ca_topic_score_gemma":0.005000436,"teacher_disagreement_score":0.0033797398,"about_ca_system_score_codex":0.0014807365,"about_ca_system_score_gemma":0.00097314315,"threshold_uncertainty_score":0.011306345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63606244,0.0012494198,0.29902682,0.00081908325,0.00019597105,0.00022485653,0.0010535216,0.0006783468,0.060689427],"genre_scores_gemma":[0.9602941,0.00028413875,0.033951275,0.00009028278,0.00017489295,0.00005681496,0.00083215244,0.00007180289,0.0042445688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823844,0.00022690164,0.00016165378,0.0004990204,0.0006150269,0.0002589954],"domain_scores_gemma":[0.9949529,0.0020718814,0.00086532446,0.0009147958,0.00078110857,0.0004139734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011353289,0.0005162686,0.0005195576,0.0022804432,0.0012537851,0.0021731278,0.0006396643,0.0005382272,0.005675247],"category_scores_gemma":[0.005831999,0.0004647871,0.0011833649,0.0014401857,0.0023367417,0.004044434,0.0013115797,0.0014290703,0.00048296392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012988856,0.00016779406,0.005552262,0.00011214384,0.000038528167,0.0005108982,0.000980822,0.0037799363,0.005583157,0.9486915,0.0026873203,0.03176569],"study_design_scores_gemma":[0.00003392903,0.000083649604,0.0035971312,0.00006609219,0.00006621886,0.001388626,0.0003821057,0.030295651,0.0065073324,0.94414115,0.013394612,0.00004357243],"about_ca_topic_score_codex":0.0009903503,"about_ca_topic_score_gemma":0.0009961264,"teacher_disagreement_score":0.005675247,"about_ca_system_score_codex":0.0012496832,"about_ca_system_score_gemma":0.00042081744,"threshold_uncertainty_score":0.01898563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87073016,0.00063014025,0.11672,0.00029819843,0.00003108025,0.00003478885,0.00045244594,0.00016573297,0.010937516],"genre_scores_gemma":[0.97869146,0.00029703364,0.01811657,0.00006907796,0.000028681334,0.000035503566,0.0003551161,0.000047539837,0.002359016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996443,0.00009433855,0.000020615684,0.00009124016,0.00007458809,0.00007489988],"domain_scores_gemma":[0.9965636,0.0017623191,0.0006262669,0.000359934,0.00031891486,0.00036894114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337392,0.00034893776,0.00039170875,0.0011415961,0.0007197343,0.0010104914,0.00047816985,0.00063238334,0.003436753],"category_scores_gemma":[0.0026847927,0.00043301767,0.000519726,0.00088641327,0.0009775334,0.0015606025,0.0010456538,0.0008599734,0.00036284892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062217057,0.00013245424,0.013538268,0.0005495765,0.00010708534,0.0012804483,0.0014592598,0.11894978,0.0831667,0.74156195,0.0041773245,0.034455016],"study_design_scores_gemma":[0.000044982862,0.0001815143,0.0060078995,0.0000945732,0.000054009757,0.0015424227,0.0007770693,0.19851881,0.016215185,0.7697978,0.006715076,0.000050723353],"about_ca_topic_score_codex":0.0006675269,"about_ca_topic_score_gemma":0.0011343029,"teacher_disagreement_score":0.003436753,"about_ca_system_score_codex":0.000355875,"about_ca_system_score_gemma":0.00017143958,"threshold_uncertainty_score":0.01149708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68517137,0.00032914922,0.29275173,0.0004260092,0.000064788226,0.000043480213,0.00032972006,0.00029087788,0.020592859],"genre_scores_gemma":[0.9729614,0.000120578225,0.024608908,0.00006285182,0.00005626773,0.000066971676,0.00012678509,0.00011108048,0.0018851715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991333,0.00026793245,0.000066217326,0.00020617501,0.00018872917,0.00013763692],"domain_scores_gemma":[0.9893504,0.0068567386,0.0010718805,0.0009969219,0.00076332706,0.00096084946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017513894,0.0004125882,0.00043792615,0.001922545,0.0009369878,0.0021236907,0.0009941747,0.0008648266,0.0034469196],"category_scores_gemma":[0.009235154,0.00033796945,0.0004584446,0.00069793034,0.0030598291,0.0034734143,0.0017014552,0.0014108085,0.00031744948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001525289,0.000043985965,0.004945216,0.00007588397,0.000016124395,0.00014162465,0.00039413088,0.011984931,0.01751662,0.95201623,0.0009329246,0.011779779],"study_design_scores_gemma":[0.000027316148,0.00010472259,0.0028792836,0.00004996852,0.000016843505,0.00045010628,0.00031071942,0.06794512,0.010678129,0.9148034,0.002673722,0.00006081902],"about_ca_topic_score_codex":0.00045455978,"about_ca_topic_score_gemma":0.00063741446,"teacher_disagreement_score":0.0034469196,"about_ca_system_score_codex":0.0007165485,"about_ca_system_score_gemma":0.0003728397,"threshold_uncertainty_score":0.011531055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9169358,0.0015583744,0.051670033,0.0017573779,0.0000882388,0.00006295657,0.000412109,0.00051810546,0.02699705],"genre_scores_gemma":[0.9902435,0.00036633256,0.0075991014,0.00014984174,0.000056735316,0.000072500545,0.0001600239,0.00005285288,0.0012990058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800867,0.0004411835,0.000106847394,0.00048078073,0.00064391457,0.00031873255],"domain_scores_gemma":[0.98663133,0.008011619,0.0016294395,0.001337958,0.0009170161,0.0014725345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156229,0.00043038247,0.0007844868,0.0019340382,0.0017351675,0.0027090323,0.0016073519,0.0012716947,0.0039915466],"category_scores_gemma":[0.014609051,0.0008048161,0.0005554892,0.0014548738,0.0028026523,0.0039749327,0.002813326,0.0017617457,0.0003118466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046883384,0.000100134836,0.009204932,0.00036859038,0.000079301535,0.00048054958,0.0011925587,0.032480564,0.011857725,0.91743386,0.0040913653,0.022241585],"study_design_scores_gemma":[0.000067817295,0.00008797386,0.0018690883,0.0000718043,0.00004452715,0.00069214596,0.00034763213,0.046425216,0.0070989793,0.9360816,0.0071712774,0.000042020907],"about_ca_topic_score_codex":0.0011369213,"about_ca_topic_score_gemma":0.0014430776,"teacher_disagreement_score":0.0039915466,"about_ca_system_score_codex":0.0022480793,"about_ca_system_score_gemma":0.00088536233,"threshold_uncertainty_score":0.01631105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37588158,0.0037922864,0.31270623,0.12062004,0.007966127,0.00044137935,0.0026460583,0.0029019348,0.17304441],"genre_scores_gemma":[0.9453357,0.0009232246,0.0348279,0.008007078,0.0023106823,0.0002136556,0.0012918332,0.0002589018,0.0068310914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947307,0.0012239257,0.00024045371,0.0015658346,0.0011082231,0.001130733],"domain_scores_gemma":[0.9458393,0.03641411,0.002047609,0.0067982674,0.0055711744,0.0033295236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004960157,0.0013611666,0.0020819998,0.0017590048,0.004075027,0.0033434615,0.0036958577,0.0037615127,0.02142763],"category_scores_gemma":[0.038014386,0.0010664546,0.0030385356,0.0028026337,0.008511939,0.012401467,0.0075780624,0.009903209,0.0018810137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075444125,0.00061453035,0.006209044,0.0010356177,0.00018680721,0.0009593446,0.0018454749,0.010416607,0.0048425538,0.8845728,0.069377795,0.019184882],"study_design_scores_gemma":[0.00022619436,0.00016470291,0.0016602536,0.00011401841,0.000092509,0.0003995114,0.0005242244,0.019752972,0.0017927369,0.95637184,0.018854557,0.000046475427],"about_ca_topic_score_codex":0.004261022,"about_ca_topic_score_gemma":0.0021396168,"teacher_disagreement_score":0.02142763,"about_ca_system_score_codex":0.0025006735,"about_ca_system_score_gemma":0.0016831831,"threshold_uncertainty_score":0.07168257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8791441,0.00027999072,0.05889173,0.00040693287,0.00013543016,0.000100989855,0.0002665188,0.00022395389,0.060550407],"genre_scores_gemma":[0.98471236,0.00016565982,0.009812494,0.000186497,0.00005536508,0.000038937484,0.00022973938,0.000050779596,0.0047482345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886024,0.00023636129,0.00006540446,0.00027008113,0.0003129129,0.0002550306],"domain_scores_gemma":[0.99654156,0.0019321821,0.00033460863,0.00049696513,0.0003584982,0.00033604834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076430803,0.00027831263,0.00047819084,0.0013899774,0.0014771685,0.0015632921,0.0007686086,0.0006434329,0.0070603844],"category_scores_gemma":[0.004356194,0.00033495965,0.00064422964,0.00073404,0.0020037747,0.0021613385,0.0016536635,0.0016443977,0.00053164345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006834705,0.00014413458,0.0031439837,0.00019770388,0.000050527913,0.0007322736,0.0016606671,0.013723108,0.015809312,0.9275639,0.0027189977,0.033571985],"study_design_scores_gemma":[0.000034969566,0.000072666924,0.0019248319,0.000019404613,0.000019535815,0.00031260433,0.00038537133,0.011302286,0.005888949,0.9761187,0.0038901274,0.000030626714],"about_ca_topic_score_codex":0.001456513,"about_ca_topic_score_gemma":0.0013897755,"teacher_disagreement_score":0.0070603844,"about_ca_system_score_codex":0.0008138271,"about_ca_system_score_gemma":0.00050479453,"threshold_uncertainty_score":0.023619294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97104686,0.00047986044,0.009825385,0.00045489173,0.00001838439,0.00001594194,0.0004107328,0.00014272291,0.017605122],"genre_scores_gemma":[0.9970054,0.00010203809,0.0016027008,0.000029085539,0.000009992093,0.00001208218,0.00013576557,0.000014216179,0.001088714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995734,0.000073086274,0.00001126814,0.00007221054,0.00013408565,0.000135954],"domain_scores_gemma":[0.99555165,0.0028623566,0.0004814689,0.0003807367,0.00031721249,0.00040654594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003635565,0.00020439911,0.00033230442,0.0010338968,0.00088652264,0.0009859927,0.0006110362,0.0003014136,0.0036373623],"category_scores_gemma":[0.004206055,0.00022363757,0.00020099476,0.00089399656,0.0006981695,0.0008946033,0.000847575,0.0005038958,0.0001741917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026387975,0.0002494367,0.08012803,0.0009150044,0.0002044053,0.0021526827,0.0021211526,0.27516672,0.12820794,0.36176986,0.021865452,0.12458046],"study_design_scores_gemma":[0.00024506394,0.00018632978,0.048457723,0.00008302398,0.00009702572,0.0022243536,0.00067571475,0.527388,0.03244014,0.36896437,0.019125482,0.00011281799],"about_ca_topic_score_codex":0.0044728406,"about_ca_topic_score_gemma":0.0065407734,"teacher_disagreement_score":0.0044728406,"about_ca_system_score_codex":0.0013351172,"about_ca_system_score_gemma":0.00061835203,"threshold_uncertainty_score":0.012168229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.474082,0.0026619723,0.40641537,0.0028550841,0.00028607313,0.0006992622,0.0060637393,0.0018533367,0.105083175],"genre_scores_gemma":[0.78909117,0.0019539217,0.18007539,0.000698743,0.000109595916,0.00042034007,0.005294287,0.00017933022,0.02217725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991678,0.0001802358,0.0000656078,0.000250884,0.00012414898,0.00021137617],"domain_scores_gemma":[0.99817586,0.00097246486,0.0002221585,0.00025447775,0.00014567967,0.00022942247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048159555,0.00070143736,0.0006340137,0.0018866541,0.0016164173,0.0020744652,0.00085203967,0.00096694357,0.011157926],"category_scores_gemma":[0.002927347,0.0008240706,0.0008389805,0.003419573,0.0010422107,0.003229235,0.0016156397,0.0012615126,0.0010893807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003527988,0.00030618385,0.004102148,0.0006072816,0.00013696615,0.0014225373,0.0010476626,0.11943762,0.00644867,0.68988585,0.02503836,0.15121385],"study_design_scores_gemma":[0.00008471761,0.00016974291,0.0019443951,0.0001779749,0.00007256474,0.0011357554,0.00062492175,0.18732734,0.0031897782,0.7510764,0.05414019,0.000056181707],"about_ca_topic_score_codex":0.0051363157,"about_ca_topic_score_gemma":0.0062508755,"teacher_disagreement_score":0.011157926,"about_ca_system_score_codex":0.0022564984,"about_ca_system_score_gemma":0.0010709051,"threshold_uncertainty_score":0.03732699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477985,0.00015337275,0.11111306,0.0006335662,0.00012941394,0.000040860625,0.00012882902,0.00041038217,0.039591942],"genre_scores_gemma":[0.96195185,0.00007906892,0.029902631,0.00009188851,0.000030247218,0.000025902085,0.00011409631,0.000096484204,0.007707744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965596,0.000046648678,0.000014158082,0.000091525595,0.00012912089,0.00006250009],"domain_scores_gemma":[0.9995751,0.00010190428,0.00006785247,0.00007918033,0.00007016795,0.00010584057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876127,0.0003806948,0.0004379416,0.0009952395,0.0011815712,0.0018698117,0.00053848734,0.0009486263,0.0043695974],"category_scores_gemma":[0.0009445538,0.00033269625,0.00035194505,0.00053491537,0.0021664423,0.002198875,0.0022115042,0.0010572285,0.00086701795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018501347,0.00011569924,0.0024686987,0.00011784512,0.000030458608,0.0021299564,0.0012997525,0.019093229,0.04798521,0.9072318,0.0018682848,0.017474104],"study_design_scores_gemma":[0.00005353239,0.00018009845,0.0020015547,0.000064634674,0.000028792894,0.0016180674,0.001797455,0.092726015,0.01133771,0.8670285,0.023108406,0.000055300574],"about_ca_topic_score_codex":0.00047470312,"about_ca_topic_score_gemma":0.00037363422,"teacher_disagreement_score":0.0043695974,"about_ca_system_score_codex":0.00044721717,"about_ca_system_score_gemma":0.00020437494,"threshold_uncertainty_score":0.014617741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49051183,0.0010583136,0.45918313,0.0034819331,0.0001720865,0.00029117466,0.0015246288,0.0009897971,0.042787135],"genre_scores_gemma":[0.938817,0.00087371137,0.054141693,0.0004780832,0.00015332349,0.00008421537,0.0014641271,0.000101045334,0.0038868366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992761,0.00014355566,0.000039642524,0.00021231675,0.00021123825,0.00011721645],"domain_scores_gemma":[0.99439406,0.0037974115,0.00046017155,0.00049198774,0.00057976955,0.00027651625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040141676,0.00036117717,0.00033091972,0.001358938,0.0007892239,0.0023078409,0.00077362335,0.00069342036,0.0047309077],"category_scores_gemma":[0.0051620686,0.00039365422,0.0004644098,0.0011866563,0.0016012638,0.0038659924,0.001341979,0.0013146701,0.0006942165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006170607,0.00018337315,0.00852618,0.0008133965,0.000069295005,0.0011680053,0.0015823048,0.06423938,0.05073035,0.64732635,0.015088518,0.20965572],"study_design_scores_gemma":[0.00004098838,0.00006956962,0.0021126939,0.00007363885,0.000030497937,0.0008021918,0.00055204943,0.110400416,0.014717506,0.8598031,0.011356317,0.000040980794],"about_ca_topic_score_codex":0.0016388382,"about_ca_topic_score_gemma":0.001230032,"teacher_disagreement_score":0.0047309077,"about_ca_system_score_codex":0.00066081074,"about_ca_system_score_gemma":0.0004313212,"threshold_uncertainty_score":0.015826464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9429086,0.0009293862,0.04030203,0.0008302423,0.00008129076,0.000040371575,0.00045513333,0.00036216385,0.0140908165],"genre_scores_gemma":[0.99123514,0.0004065067,0.0063242987,0.00007495746,0.00012820892,0.00003396515,0.00025517796,0.00006382705,0.0014778967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928004,0.00013186128,0.00004071171,0.00026326563,0.00013399697,0.00015010654],"domain_scores_gemma":[0.9891656,0.0065830755,0.001577958,0.0010287601,0.00047534623,0.0011692675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008593594,0.0005421315,0.0007830417,0.0023250775,0.00080519577,0.002273689,0.0007453142,0.0008436044,0.002845689],"category_scores_gemma":[0.0063324915,0.00047722954,0.00045826833,0.0008122184,0.0018983786,0.002289688,0.0013585052,0.0010749159,0.00046415618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017814231,0.00031844148,0.055836413,0.00056421227,0.00016690558,0.0012631731,0.0034425363,0.07830417,0.18865895,0.62225723,0.008611813,0.03879464],"study_design_scores_gemma":[0.00019884693,0.0006483147,0.030634267,0.0001797373,0.00016840149,0.0028548136,0.00089119264,0.17889626,0.07086232,0.6943397,0.020191025,0.00013521248],"about_ca_topic_score_codex":0.0006088365,"about_ca_topic_score_gemma":0.0005513871,"teacher_disagreement_score":0.002845689,"about_ca_system_score_codex":0.0011962525,"about_ca_system_score_gemma":0.00040505175,"threshold_uncertainty_score":0.009519756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8770649,0.00040012744,0.07927136,0.00039933604,0.0001140356,0.00006016129,0.00010232717,0.00054199074,0.042045653],"genre_scores_gemma":[0.9827877,0.00011252208,0.012387562,0.000093830124,0.000035308858,0.00002684128,0.000070877984,0.00005544405,0.004429988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997532,0.000060579183,0.000010843149,0.000050322444,0.000059218375,0.00006585178],"domain_scores_gemma":[0.99923146,0.00032434118,0.00012674145,0.000106460975,0.000101763995,0.000109280576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023748422,0.0003570297,0.00032016242,0.0012603159,0.0012838641,0.001205899,0.00047144436,0.00078037125,0.003730042],"category_scores_gemma":[0.001568527,0.0002504493,0.00045059895,0.0005088467,0.0011231788,0.0014644754,0.0011053565,0.0009601713,0.00028250556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012503186,0.000040576146,0.0010236378,0.00010709698,0.000029210187,0.0005729845,0.00070789043,0.0053889686,0.013831961,0.96293265,0.0012247469,0.014015282],"study_design_scores_gemma":[0.00004127497,0.00009018069,0.0008831781,0.000035506608,0.000035537298,0.00060870947,0.0004069306,0.025403494,0.015216478,0.94935125,0.007899159,0.0000282987],"about_ca_topic_score_codex":0.0006145399,"about_ca_topic_score_gemma":0.00082488527,"teacher_disagreement_score":0.003730042,"about_ca_system_score_codex":0.000530116,"about_ca_system_score_gemma":0.00022998336,"threshold_uncertainty_score":0.012478173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617173,0.000405272,0.022169195,0.00025178888,0.00003788469,0.000019801555,0.00020261502,0.000059164635,0.015137006],"genre_scores_gemma":[0.9918824,0.00013949948,0.0053863353,0.000037165726,0.000012439406,0.000019721407,0.000105109495,0.00001546216,0.002401801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996389,0.000068940506,0.000018586043,0.00009409742,0.000058301288,0.00012119149],"domain_scores_gemma":[0.9987863,0.00047614123,0.00019378857,0.00014525975,0.00015160834,0.00024687915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069100526,0.00022615193,0.00039972967,0.0009174926,0.0009997269,0.0013062728,0.00060439104,0.00033626475,0.0042726565],"category_scores_gemma":[0.001628745,0.00026901605,0.0003217416,0.00038016585,0.0013816357,0.0020204114,0.0011318227,0.0005716951,0.00021412793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011402996,0.000098086646,0.020136926,0.0002836237,0.00010499152,0.00033897744,0.0010401529,0.025749663,0.03289706,0.89045876,0.004158269,0.023593191],"study_design_scores_gemma":[0.00010346363,0.00016549074,0.011696561,0.00009411662,0.00012160804,0.0005631648,0.0007995649,0.10690563,0.015069795,0.8451862,0.01920337,0.00009089999],"about_ca_topic_score_codex":0.0023733126,"about_ca_topic_score_gemma":0.0032716296,"teacher_disagreement_score":0.0042726565,"about_ca_system_score_codex":0.0010166536,"about_ca_system_score_gemma":0.0005548177,"threshold_uncertainty_score":0.014293492},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9187351,0.0004640356,0.04936309,0.00027977658,0.000091510075,0.000026090045,0.00026076802,0.00048378337,0.030295782],"genre_scores_gemma":[0.99117416,0.00015802206,0.0067201117,0.000030627372,0.00003433631,0.000021589469,0.00014009702,0.00006339788,0.0016576261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995732,0.00007330614,0.000021028834,0.00011642997,0.00013904642,0.000077016004],"domain_scores_gemma":[0.99742377,0.0013029379,0.0003700801,0.0002693393,0.0002243022,0.00040964468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695595,0.0002613632,0.0003764821,0.0026274358,0.0006763158,0.0015996516,0.0006147077,0.0006667446,0.004975688],"category_scores_gemma":[0.004711929,0.0002920943,0.0002858734,0.0009971894,0.0015452191,0.001936081,0.000703261,0.0007858262,0.00029332668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026566104,0.00008013234,0.0045482726,0.00014955182,0.000024347168,0.00047234306,0.0004907255,0.048960492,0.013140413,0.90426904,0.0033057432,0.024293348],"study_design_scores_gemma":[0.000028083912,0.000077140765,0.0023926308,0.000048872313,0.00001897715,0.00047588296,0.00018667258,0.114213854,0.00537637,0.8737696,0.0033801214,0.00003175618],"about_ca_topic_score_codex":0.00046625594,"about_ca_topic_score_gemma":0.00042447817,"teacher_disagreement_score":0.004975688,"about_ca_system_score_codex":0.0009574513,"about_ca_system_score_gemma":0.00026965237,"threshold_uncertainty_score":0.016645312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58309,0.003911124,0.39260307,0.0021300125,0.00008295286,0.0002232747,0.00080317474,0.00041104117,0.016745416],"genre_scores_gemma":[0.939332,0.0022854472,0.048430126,0.00036936396,0.00016833271,0.00040930958,0.0009124965,0.0001825745,0.007910363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983607,0.00072153384,0.00008600842,0.0003571763,0.00028363528,0.00019098479],"domain_scores_gemma":[0.99006873,0.005448458,0.0017124439,0.0009723009,0.0007510178,0.001047075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019360246,0.0008396339,0.0012202273,0.003454666,0.0016166391,0.0020482254,0.0016465419,0.0016774391,0.004150193],"category_scores_gemma":[0.016774751,0.00090253225,0.0011277415,0.0022268817,0.0035730852,0.004930313,0.0025807042,0.0015730199,0.00056488847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014748696,0.000030844418,0.0023156323,0.0001439773,0.000048715283,0.00024106119,0.00047478816,0.035749592,0.0017165688,0.9452743,0.0021714966,0.011685464],"study_design_scores_gemma":[0.000041788895,0.00005038881,0.0009606689,0.000041903226,0.00001860681,0.00036747952,0.000119874974,0.12330215,0.0005405678,0.8706441,0.0038802451,0.000032293865],"about_ca_topic_score_codex":0.0018125717,"about_ca_topic_score_gemma":0.0014995142,"teacher_disagreement_score":0.004150193,"about_ca_system_score_codex":0.0021744913,"about_ca_system_score_gemma":0.00058791746,"threshold_uncertainty_score":0.01577717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49011183,0.0021752142,0.26276255,0.0015289249,0.00050888397,0.00020768486,0.005790653,0.0016049125,0.23530932],"genre_scores_gemma":[0.93134224,0.00093997567,0.05019743,0.00024376751,0.00019635075,0.00007873487,0.0022253946,0.00025479222,0.014521244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.00009885915,0.000059416067,0.00029527853,0.00031439133,0.0002455057],"domain_scores_gemma":[0.9970085,0.0010653057,0.00032013253,0.0004672144,0.00063992967,0.0004988949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961242,0.0004987978,0.0005895262,0.0025228206,0.0010160321,0.0022183224,0.00095274614,0.00052520947,0.013277811],"category_scores_gemma":[0.0022535631,0.00027647032,0.00038168376,0.0025058042,0.0015712498,0.002589037,0.000980763,0.0012545323,0.0018781403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006346046,0.00019295224,0.009340783,0.00043832444,0.00007031789,0.000116547846,0.00046939272,0.050899576,0.058241278,0.7858546,0.024018524,0.06972306],"study_design_scores_gemma":[0.000056234643,0.0002713013,0.009240938,0.00008507835,0.00006402012,0.00050775596,0.0003431559,0.11853128,0.048190977,0.7574326,0.06516843,0.00010830511],"about_ca_topic_score_codex":0.0017743803,"about_ca_topic_score_gemma":0.00232503,"teacher_disagreement_score":0.013277811,"about_ca_system_score_codex":0.0017773551,"about_ca_system_score_gemma":0.0012245814,"threshold_uncertainty_score":0.044418633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7142399,0.0020107382,0.22156824,0.0013287303,0.0001418137,0.000061113606,0.0007230357,0.00029576407,0.059630617],"genre_scores_gemma":[0.9692984,0.0005915995,0.022776881,0.00012227467,0.00007331098,0.00008507362,0.0002843828,0.00012375801,0.0066443807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994758,0.00012606282,0.000027936923,0.00015102558,0.00011799972,0.00010130563],"domain_scores_gemma":[0.9939148,0.003624609,0.00083904545,0.00047029371,0.00057051255,0.00058075984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015748177,0.0004998925,0.0004082546,0.002323934,0.0009073366,0.0038097515,0.0012062099,0.0006532827,0.0037044943],"category_scores_gemma":[0.0073763058,0.00043624893,0.00046184746,0.0015297796,0.002861149,0.0047644996,0.0014515906,0.0012657824,0.0005064626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016328272,0.00001892005,0.0026955258,0.00006355492,0.000017017159,0.000102823025,0.0003129975,0.013417841,0.0020836769,0.96541923,0.0018337793,0.0138713755],"study_design_scores_gemma":[0.00003146954,0.000046742232,0.003238895,0.000069223584,0.000042570126,0.0003954363,0.00021782322,0.08678574,0.0031291717,0.89591134,0.010069394,0.000062106854],"about_ca_topic_score_codex":0.0020940336,"about_ca_topic_score_gemma":0.0016882063,"teacher_disagreement_score":0.0038097515,"about_ca_system_score_codex":0.002471266,"about_ca_system_score_gemma":0.00066465343,"threshold_uncertainty_score":0.017930388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1100194,0.006608908,0.632017,0.0045021907,0.0018935886,0.00019057612,0.0017025444,0.0039645014,0.23910137],"genre_scores_gemma":[0.5613182,0.0038789373,0.3870924,0.001480041,0.00083487097,0.0004599291,0.0023067668,0.0024212364,0.04020758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970733,0.0006072437,0.00016611871,0.0006601441,0.0009774928,0.0005156713],"domain_scores_gemma":[0.9856614,0.0073478515,0.000895745,0.004293367,0.0010378929,0.0007638808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015863238,0.002047101,0.0012354131,0.0017232635,0.0012447573,0.0041945586,0.0029706992,0.002337511,0.047675148],"category_scores_gemma":[0.014540744,0.0010065626,0.0013775011,0.0022483242,0.002023034,0.007978369,0.003322382,0.004642527,0.007440611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010534326,0.00028493462,0.0026927176,0.0012284684,0.0001182259,0.0006492736,0.00046458063,0.08110344,0.029760543,0.56952,0.066551976,0.24657245],"study_design_scores_gemma":[0.00019155728,0.00041133858,0.003197265,0.00044375157,0.00023373862,0.0030225608,0.00027863393,0.2077183,0.06763316,0.5636278,0.15299526,0.00024663247],"about_ca_topic_score_codex":0.0006275277,"about_ca_topic_score_gemma":0.0008145226,"teacher_disagreement_score":0.047675148,"about_ca_system_score_codex":0.0013182856,"about_ca_system_score_gemma":0.00072573393,"threshold_uncertainty_score":0.15948933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8876788,0.0008177971,0.08379375,0.0015840081,0.000059624857,0.000043082284,0.00037064718,0.00019070404,0.02546164],"genre_scores_gemma":[0.988699,0.00021446841,0.008185677,0.00008431261,0.00004038602,0.000025263986,0.00017604565,0.00002954744,0.0025451793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994893,0.0000998303,0.0000215337,0.00017226132,0.00012489672,0.00009209464],"domain_scores_gemma":[0.9967347,0.0015638877,0.00039649874,0.00038302134,0.00042060507,0.00050127826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004076938,0.0003701122,0.0005882094,0.00096716377,0.00092153024,0.0013403172,0.0007925614,0.00087330525,0.004751929],"category_scores_gemma":[0.0038235898,0.00045490873,0.00056861766,0.0006976045,0.0019283647,0.003328517,0.0020131136,0.0013187313,0.0003614551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003430629,0.00011803162,0.00733233,0.00040260065,0.00007527996,0.0004197052,0.0017759389,0.021991828,0.021208342,0.91660607,0.0041508535,0.025576035],"study_design_scores_gemma":[0.00003626621,0.00007273487,0.002385891,0.000041468065,0.000021672322,0.00033354433,0.00040164695,0.024301546,0.004727348,0.9610147,0.006641864,0.00002128594],"about_ca_topic_score_codex":0.0008436651,"about_ca_topic_score_gemma":0.00076880597,"teacher_disagreement_score":0.004751929,"about_ca_system_score_codex":0.00096856826,"about_ca_system_score_gemma":0.0002744162,"threshold_uncertainty_score":0.015896738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85931903,0.00028448037,0.13020168,0.0005018985,0.00002761856,0.00010421853,0.0009518358,0.00044491046,0.008164229],"genre_scores_gemma":[0.9492033,0.00014451992,0.046150897,0.00018280532,0.000024470815,0.00005362328,0.0011932575,0.000119987766,0.0029271413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997316,0.000036984668,0.000011883198,0.0001005873,0.000051453913,0.0000674407],"domain_scores_gemma":[0.99804085,0.00088303944,0.00036755926,0.0002710574,0.0001964319,0.00024112505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028956475,0.00028204158,0.00036735728,0.0012514181,0.00083711435,0.001279218,0.0006687208,0.000559564,0.003846558],"category_scores_gemma":[0.0018707382,0.0004831771,0.00032705974,0.0011010513,0.0010461111,0.0023369542,0.00094620034,0.00094112946,0.00029659973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011424633,0.0003276821,0.019809673,0.00068466127,0.00011423406,0.0011044625,0.0031417187,0.08591263,0.106794596,0.67495817,0.011698599,0.094311036],"study_design_scores_gemma":[0.00017666239,0.0002819226,0.015578743,0.00009752921,0.0001298732,0.0012273295,0.0013417592,0.18805064,0.029795516,0.7415537,0.021695485,0.00007083813],"about_ca_topic_score_codex":0.0022007036,"about_ca_topic_score_gemma":0.0037136076,"teacher_disagreement_score":0.003846558,"about_ca_system_score_codex":0.0007985393,"about_ca_system_score_gemma":0.00043364722,"threshold_uncertainty_score":0.012867987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5120608,0.009694366,0.358491,0.0038541486,0.00052914175,0.00023459448,0.0022415784,0.0013466361,0.111547716],"genre_scores_gemma":[0.9222323,0.002233484,0.063136615,0.0007111789,0.00046009038,0.0003618185,0.001442538,0.0004954499,0.008926611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970515,0.0005701383,0.00015142067,0.0008040538,0.0009257383,0.00049712294],"domain_scores_gemma":[0.9893332,0.00717226,0.0009662268,0.0010753708,0.00067521265,0.00077767065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028019315,0.0015636032,0.0020904746,0.0041332673,0.0017591362,0.0042379834,0.0032789926,0.0017842072,0.00970491],"category_scores_gemma":[0.015366547,0.0006335435,0.0011233744,0.0032606435,0.0022149065,0.0063837636,0.0029828036,0.0034400763,0.001716069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011422853,0.00020216465,0.0031953433,0.000776501,0.00014869585,0.0003868724,0.00048038346,0.030859489,0.017614277,0.88972354,0.009287072,0.046183255],"study_design_scores_gemma":[0.000040190233,0.00008789622,0.0012879237,0.00012345768,0.000069323396,0.0004671591,0.00012642096,0.113050476,0.0066863457,0.86734545,0.010666464,0.00004897959],"about_ca_topic_score_codex":0.00054106954,"about_ca_topic_score_gemma":0.00039143735,"teacher_disagreement_score":0.00970491,"about_ca_system_score_codex":0.0022491363,"about_ca_system_score_gemma":0.0006516348,"threshold_uncertainty_score":0.032466173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.943856,0.0008531187,0.041902967,0.000733336,0.000047338905,0.000043639597,0.00021759144,0.00014072345,0.012205332],"genre_scores_gemma":[0.99077356,0.00036521326,0.0074369824,0.00010366721,0.00005181752,0.00005094785,0.00017018463,0.00004875462,0.000998815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950206,0.00016404879,0.000016589556,0.00009866136,0.000096483,0.0001221331],"domain_scores_gemma":[0.99377877,0.0040233145,0.0006146728,0.00025833576,0.00049249287,0.0008323226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084383355,0.00059358514,0.0009943604,0.0028407478,0.0014912268,0.0016580746,0.0015772998,0.0009961729,0.0038259407],"category_scores_gemma":[0.0081662,0.0007431435,0.0004351004,0.00094799517,0.0027241055,0.002240319,0.0018988241,0.00097538106,0.00029226454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006479614,0.00010342955,0.010688622,0.00043394585,0.00010977516,0.000585961,0.0009425557,0.041427284,0.01786845,0.90658075,0.00543821,0.015173068],"study_design_scores_gemma":[0.000091503556,0.0001034916,0.005946947,0.00013330611,0.00008026659,0.00072965556,0.0005842597,0.15412302,0.007433471,0.8270042,0.003705036,0.000064831125],"about_ca_topic_score_codex":0.001338836,"about_ca_topic_score_gemma":0.0010330097,"teacher_disagreement_score":0.0038259407,"about_ca_system_score_codex":0.0013358078,"about_ca_system_score_gemma":0.00046077697,"threshold_uncertainty_score":0.012799025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89852494,0.00020352687,0.090403005,0.0003135062,0.000020187204,0.00007211633,0.0006239928,0.00025157057,0.009587175],"genre_scores_gemma":[0.96752083,0.000110355526,0.027678723,0.00009338727,0.000020162544,0.000033120774,0.00084070873,0.000047515765,0.003655118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997098,0.000044877233,0.000016017686,0.000104958075,0.000057796045,0.00006652887],"domain_scores_gemma":[0.998302,0.0006325816,0.00040042546,0.00030015918,0.00016184145,0.00020290216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002638743,0.00027486763,0.00031917013,0.0009559349,0.0008364023,0.00091794075,0.0005824269,0.0003702911,0.0037839243],"category_scores_gemma":[0.0014179001,0.00037709431,0.00025890238,0.0008596641,0.0011258706,0.0022389926,0.0011288836,0.0005553452,0.00028600154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010633024,0.00020154018,0.014039135,0.0003907426,0.000070883,0.0008896561,0.0021211128,0.052712318,0.068517126,0.78080857,0.0046598045,0.07452587],"study_design_scores_gemma":[0.00011025029,0.00026630174,0.0065171607,0.00005692272,0.000052795946,0.00071226765,0.00072968757,0.067423284,0.02028343,0.8864912,0.017303769,0.000052998745],"about_ca_topic_score_codex":0.0013521932,"about_ca_topic_score_gemma":0.002053808,"teacher_disagreement_score":0.0037839243,"about_ca_system_score_codex":0.00056551764,"about_ca_system_score_gemma":0.0003183317,"threshold_uncertainty_score":0.012658417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88870525,0.0009551364,0.07596768,0.002661988,0.00016471601,0.000092130795,0.0006336449,0.00081210403,0.03000734],"genre_scores_gemma":[0.9680187,0.00034662537,0.020693094,0.0005489072,0.00013439271,0.0001269158,0.00065738335,0.0002925352,0.0091814445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846905,0.00030499115,0.00006709607,0.00035294634,0.0003706459,0.00043521624],"domain_scores_gemma":[0.9813137,0.01277118,0.0014007255,0.0016808978,0.0013840145,0.0014494542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014387901,0.00088749285,0.0010003018,0.001827014,0.002484845,0.0028718754,0.0021214918,0.001511296,0.00980602],"category_scores_gemma":[0.017222734,0.0011125342,0.0014636186,0.001455137,0.0028188278,0.0058595636,0.0023977924,0.0030212554,0.0009208425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020653065,0.00035414312,0.018843027,0.00089537515,0.0002170243,0.0011456507,0.0038119315,0.083236106,0.025771465,0.7991391,0.018511215,0.04600972],"study_design_scores_gemma":[0.00022807553,0.00012175493,0.0047452203,0.00009757976,0.000144907,0.0006511046,0.0007519056,0.14714089,0.0073550413,0.82812834,0.010541711,0.00009346419],"about_ca_topic_score_codex":0.0032133074,"about_ca_topic_score_gemma":0.004322379,"teacher_disagreement_score":0.00980602,"about_ca_system_score_codex":0.0036324991,"about_ca_system_score_gemma":0.00091763603,"threshold_uncertainty_score":0.03280437},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47528848,0.0010961207,0.4215625,0.0018816415,0.00050230866,0.00012438366,0.0019294099,0.0011006952,0.09651442],"genre_scores_gemma":[0.9286381,0.0005551418,0.051222034,0.00042348183,0.0002893417,0.00008811431,0.001409501,0.000091561065,0.017282777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961144,0.00006486085,0.000022658003,0.00012224389,0.00010906441,0.00006982312],"domain_scores_gemma":[0.9993407,0.00012935979,0.00014388513,0.00011723611,0.00015954436,0.00010928148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028193727,0.00040394568,0.00030164586,0.00090398063,0.0005246556,0.0019009137,0.00054580776,0.00060933514,0.007919154],"category_scores_gemma":[0.0007382304,0.0002879468,0.0006555092,0.0008169701,0.0008974864,0.0016449468,0.0008251935,0.0011734674,0.0009290613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006736249,0.000025487263,0.00096288114,0.00007642749,0.000018516772,0.0002668327,0.0001850199,0.0053123594,0.006293044,0.96167034,0.0046275714,0.020494154],"study_design_scores_gemma":[0.000034072465,0.00010117776,0.0025957625,0.000048711507,0.000030846528,0.0010805693,0.00024067225,0.045829777,0.0048277588,0.90039253,0.044777397,0.000040671195],"about_ca_topic_score_codex":0.0014284627,"about_ca_topic_score_gemma":0.0012129673,"teacher_disagreement_score":0.007919154,"about_ca_system_score_codex":0.000774538,"about_ca_system_score_gemma":0.0003353268,"threshold_uncertainty_score":0.026492238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97316736,0.00009887506,0.018933501,0.00018523276,0.00002269596,0.00001964048,0.00007492706,0.00004679667,0.007450841],"genre_scores_gemma":[0.99411494,0.000054084347,0.00404323,0.00003516947,0.000015404958,0.00001707663,0.00009134576,0.000016106764,0.0016126437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950635,0.000108596396,0.000030286923,0.00009113131,0.00012638317,0.00013723002],"domain_scores_gemma":[0.9972127,0.0009630421,0.0007317779,0.0003532973,0.00034869826,0.00039048516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049305573,0.00028008758,0.000366131,0.001653613,0.001154985,0.0022845077,0.0006155728,0.00076563837,0.0033157836],"category_scores_gemma":[0.002725392,0.00032664157,0.00035560844,0.0008404961,0.0027879623,0.0031964504,0.0019988718,0.00077678135,0.00022436073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025501195,0.00006483797,0.011638442,0.00007824414,0.000024884403,0.0006305287,0.0013474678,0.006755228,0.01756105,0.9484316,0.0006315136,0.012581264],"study_design_scores_gemma":[0.000033171513,0.00006498471,0.0055673765,0.00003867646,0.000035724435,0.0006280171,0.0009908694,0.02325205,0.010396549,0.94964117,0.00929649,0.00005486747],"about_ca_topic_score_codex":0.0011958446,"about_ca_topic_score_gemma":0.001374555,"teacher_disagreement_score":0.0033157836,"about_ca_system_score_codex":0.0009982507,"about_ca_system_score_gemma":0.00067009527,"threshold_uncertainty_score":0.011092365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88981175,0.0010548963,0.08958423,0.0016845487,0.00016541475,0.00022248845,0.0021967848,0.0005232482,0.014756676],"genre_scores_gemma":[0.95118296,0.00055396213,0.04365563,0.00023675332,0.000116396724,0.00008718593,0.0014478067,0.0001381763,0.0025811223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00025008392,0.000065963744,0.0003801498,0.00016248335,0.00033117502],"domain_scores_gemma":[0.98654467,0.00688817,0.0015425206,0.0021861235,0.00079213333,0.0020463201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012615187,0.00065924256,0.001298776,0.00080283644,0.001214332,0.0020179122,0.0018366947,0.0012300418,0.00746065],"category_scores_gemma":[0.009024167,0.00093555334,0.0008646494,0.0009824188,0.0011946794,0.003794014,0.002249756,0.0017138484,0.0008378876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0077286246,0.0010364598,0.023028478,0.0024266466,0.0005335785,0.0017929799,0.0021222648,0.11520069,0.20761783,0.501706,0.03462996,0.102176405],"study_design_scores_gemma":[0.00075510936,0.000833597,0.0074915662,0.00020362023,0.00024540146,0.002792665,0.0018384128,0.26233524,0.038645923,0.66685575,0.017886074,0.000116629904],"about_ca_topic_score_codex":0.0010421457,"about_ca_topic_score_gemma":0.0017140493,"teacher_disagreement_score":0.00746065,"about_ca_system_score_codex":0.00094867917,"about_ca_system_score_gemma":0.00080540916,"threshold_uncertainty_score":0.024958372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60946625,0.00046775513,0.38209286,0.0008141838,0.00004431842,0.00034333827,0.0004958796,0.00057272887,0.0057026027],"genre_scores_gemma":[0.9359481,0.00014454017,0.062109392,0.0001201814,0.000017603843,0.00012697621,0.00023447293,0.00006701931,0.0012317442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998403,0.0005295425,0.000059598253,0.00031702252,0.00042773422,0.00026306868],"domain_scores_gemma":[0.98271376,0.0133161135,0.0011807383,0.0012611026,0.0008647789,0.0006635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025297776,0.000567359,0.0010754357,0.0015070273,0.00077621016,0.0011613457,0.002203953,0.00062278024,0.0020918925],"category_scores_gemma":[0.0218682,0.00048582058,0.00065779564,0.001357477,0.0012673163,0.0015403171,0.0014387121,0.0008438725,0.0002060866],"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.00107136,0.00021388812,0.0080804685,0.00054019137,0.00016191212,0.00023211094,0.00042912527,0.82635695,0.025236698,0.07841351,0.0034682972,0.055795517],"study_design_scores_gemma":[0.00004398879,0.0000704422,0.000826231,0.000010408472,0.000013888722,0.00008419964,0.00004551101,0.96884745,0.003680905,0.025716508,0.00064782816,0.000012551303],"about_ca_topic_score_codex":0.0035309754,"about_ca_topic_score_gemma":0.0033732492,"teacher_disagreement_score":0.0035309754,"about_ca_system_score_codex":0.0026535392,"about_ca_system_score_gemma":0.0014675879,"threshold_uncertainty_score":0.019252837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45898187,0.0013612878,0.33063525,0.01985049,0.0018712424,0.00017246527,0.001664308,0.0013116251,0.1841515],"genre_scores_gemma":[0.96722245,0.00049753947,0.020451887,0.001470566,0.00078075635,0.000080866565,0.0005770629,0.000080618614,0.008838249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965701,0.000897981,0.00023765373,0.0010244454,0.00086681853,0.0004030531],"domain_scores_gemma":[0.98556155,0.00569255,0.0014920364,0.003656178,0.0023582364,0.0012395786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044050077,0.0005936533,0.0011655111,0.0016738129,0.0017133157,0.0028935352,0.001993997,0.0016383326,0.0102681415],"category_scores_gemma":[0.016069908,0.00045160326,0.0010823569,0.0017370031,0.004602399,0.00849576,0.0038142349,0.003641261,0.0011112642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019272896,0.000054902404,0.0016847658,0.0000917167,0.000023143415,0.00022163366,0.00025719052,0.007491084,0.0024527265,0.9733853,0.0060255094,0.008119426],"study_design_scores_gemma":[0.000048631628,0.000050775525,0.000569394,0.00002930898,0.00001594321,0.00019611727,0.00017649149,0.030580742,0.001195596,0.9571869,0.009929683,0.000020299685],"about_ca_topic_score_codex":0.001910977,"about_ca_topic_score_gemma":0.0015415421,"teacher_disagreement_score":0.0102681415,"about_ca_system_score_codex":0.0015055242,"about_ca_system_score_gemma":0.00075224665,"threshold_uncertainty_score":0.034350395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7471394,0.0015047048,0.19122653,0.0009677478,0.000084916195,0.00008075898,0.0012887341,0.00061065744,0.057096526],"genre_scores_gemma":[0.98034346,0.00039764796,0.015929634,0.00015341007,0.00006383049,0.000052097028,0.00052742363,0.00006755385,0.0024649564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993272,0.00010754967,0.000036050744,0.0002187987,0.00017394814,0.00013641476],"domain_scores_gemma":[0.99696404,0.0014808092,0.00042387913,0.00044501998,0.00034432192,0.0003418666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038854883,0.0003904447,0.00056440756,0.0011236742,0.00073229225,0.0011164166,0.00076858146,0.0005044097,0.004487967],"category_scores_gemma":[0.0026720276,0.00032777706,0.0004492816,0.00093318213,0.0010724094,0.0022263094,0.0017497122,0.00096759695,0.00042748387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046637192,0.00010757523,0.020819288,0.00051921076,0.00011181435,0.001136902,0.0010847655,0.058780592,0.08473152,0.7692207,0.009115258,0.053906012],"study_design_scores_gemma":[0.000060149898,0.00026513272,0.015976083,0.00015239221,0.00009591506,0.0029807326,0.00064801687,0.13805836,0.022823492,0.78158134,0.03730652,0.00005173573],"about_ca_topic_score_codex":0.0006356548,"about_ca_topic_score_gemma":0.00067617756,"teacher_disagreement_score":0.004487967,"about_ca_system_score_codex":0.00058235443,"about_ca_system_score_gemma":0.00026603616,"threshold_uncertainty_score":0.015013754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86842996,0.0006391786,0.106054865,0.00076686183,0.000041902586,0.000043208067,0.00065496314,0.00022889243,0.023140086],"genre_scores_gemma":[0.97750264,0.0002998995,0.01746993,0.00009791305,0.00003737658,0.000042944714,0.00046559508,0.000045000696,0.004038609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990669,0.00015460305,0.00005296155,0.00037360532,0.00018036565,0.00017161964],"domain_scores_gemma":[0.99591273,0.0019690827,0.00064985454,0.00061763974,0.00043714218,0.00041348694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006257697,0.0003760936,0.0005457813,0.0013378909,0.0012559156,0.0025402762,0.0009883384,0.0005836608,0.0038623419],"category_scores_gemma":[0.0029288519,0.00052682095,0.0006925328,0.0013253386,0.0026011223,0.0043783644,0.0014500045,0.001314513,0.00029321542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022326378,0.00005885839,0.009813391,0.00014937762,0.000029856952,0.00030629197,0.0009201673,0.010308531,0.008963996,0.957296,0.0011867519,0.010743441],"study_design_scores_gemma":[0.000032001415,0.000039538034,0.0034607428,0.000043581105,0.000035507772,0.00046532066,0.00065238547,0.025471246,0.0077788886,0.95322543,0.008760394,0.000034919358],"about_ca_topic_score_codex":0.0027424162,"about_ca_topic_score_gemma":0.002882994,"teacher_disagreement_score":0.0038623419,"about_ca_system_score_codex":0.0023833502,"about_ca_system_score_gemma":0.00047940755,"threshold_uncertainty_score":0.0172925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89452505,0.00041043718,0.07417001,0.00045049982,0.00009895654,0.000068445894,0.00045587865,0.00039912816,0.029421695],"genre_scores_gemma":[0.95707923,0.00033063485,0.03733216,0.00017807381,0.000035494184,0.000053080115,0.0005557247,0.00008919767,0.004346341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948585,0.00010257896,0.000020480195,0.00012972364,0.000102180406,0.00015912806],"domain_scores_gemma":[0.99840206,0.0005757484,0.00034826383,0.00029719068,0.00019373102,0.00018296504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026492853,0.00061644433,0.00048805945,0.0007226883,0.0009751823,0.0016760207,0.0008730757,0.00061333715,0.008488084],"category_scores_gemma":[0.0015399181,0.0004736071,0.0006728256,0.0009147871,0.0009906283,0.0014313482,0.0011028649,0.0009498196,0.00077028177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025924388,0.00056816987,0.018212805,0.00062548934,0.0003696819,0.0017957264,0.001638703,0.15540358,0.17611551,0.45179108,0.02040952,0.17047736],"study_design_scores_gemma":[0.00048423596,0.0005639901,0.0125220325,0.00015353327,0.0003473242,0.0019606396,0.0015415163,0.19777827,0.10917251,0.6174245,0.057898533,0.00015294507],"about_ca_topic_score_codex":0.0036272337,"about_ca_topic_score_gemma":0.0032897226,"teacher_disagreement_score":0.008488084,"about_ca_system_score_codex":0.000883508,"about_ca_system_score_gemma":0.0005648529,"threshold_uncertainty_score":0.028395474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53659534,0.00045685645,0.44037408,0.0009037239,0.00008308001,0.00036178116,0.0010145572,0.00068654295,0.019524142],"genre_scores_gemma":[0.79953945,0.0002570088,0.18976432,0.00021491754,0.000048931517,0.00020672045,0.0020807253,0.00015888306,0.007729049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00013017579,0.00003697139,0.00020618862,0.0002116057,0.00014726714],"domain_scores_gemma":[0.9978416,0.0008909899,0.00036367506,0.00037577673,0.00028095357,0.0002470357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052874215,0.00045041132,0.00056790485,0.0012345121,0.0011695661,0.0014112332,0.0009201737,0.00077802263,0.0058092894],"category_scores_gemma":[0.003376399,0.00069433625,0.00053421553,0.0013777851,0.0011494878,0.0026927255,0.001830033,0.0009939872,0.00056993886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009941206,0.0002650373,0.0044924035,0.0004755778,0.00012316648,0.0008496529,0.0011573764,0.11257778,0.017647302,0.6835885,0.015738439,0.1620907],"study_design_scores_gemma":[0.00015204273,0.000110228975,0.0022012915,0.00006664234,0.000049961953,0.0006689612,0.00061588234,0.25558484,0.008153911,0.71607625,0.016282447,0.000037452835],"about_ca_topic_score_codex":0.0037754618,"about_ca_topic_score_gemma":0.0047151074,"teacher_disagreement_score":0.0058092894,"about_ca_system_score_codex":0.00092751934,"about_ca_system_score_gemma":0.000707985,"threshold_uncertainty_score":0.019433975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46661666,0.0016374008,0.4834154,0.0021088691,0.0001510698,0.00013500007,0.00042684592,0.00045954745,0.04504906],"genre_scores_gemma":[0.9537793,0.0005242,0.040568348,0.00024219822,0.00012714938,0.00011422102,0.0001980172,0.00009734611,0.0043493547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976708,0.0009555044,0.00008236024,0.0004209128,0.0004996086,0.00037071286],"domain_scores_gemma":[0.9892074,0.006593171,0.0010968333,0.0012160629,0.0007222288,0.001164275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026567753,0.0007209452,0.0008968026,0.0013984685,0.0013586566,0.0031811104,0.0015917349,0.0010201173,0.0056979535],"category_scores_gemma":[0.0089400755,0.0007373133,0.0005892271,0.0015063522,0.0044861776,0.0063409046,0.0033621392,0.0023106819,0.00045269588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014150287,0.000038713923,0.00060401764,0.00008216829,0.000023753846,0.00012339652,0.00033957706,0.027983543,0.0015126817,0.95874846,0.0016694043,0.008732663],"study_design_scores_gemma":[0.000020654143,0.000029079716,0.00026876328,0.000027556578,0.000010076937,0.0000996471,0.0001752038,0.081329934,0.00085394306,0.9154823,0.00169078,0.000012194896],"about_ca_topic_score_codex":0.0011272534,"about_ca_topic_score_gemma":0.0013136612,"teacher_disagreement_score":0.0056979535,"about_ca_system_score_codex":0.002269065,"about_ca_system_score_gemma":0.00067510124,"threshold_uncertainty_score":0.019061565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12180204,0.0006207887,0.8476753,0.0005937605,0.0001819261,0.00014383758,0.0010712793,0.0013612938,0.026549742],"genre_scores_gemma":[0.75126845,0.00067507644,0.22892468,0.0007466748,0.00011667751,0.00021716703,0.0029691355,0.00057227735,0.014509844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00006273586,0.000033259934,0.00016613421,0.00015342279,0.00018003743],"domain_scores_gemma":[0.99890816,0.00038325245,0.00011483903,0.00021851243,0.00019501272,0.00018016939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062985,0.0007490031,0.00045101772,0.00080906134,0.00063959754,0.002034328,0.0008783609,0.00059557304,0.010765858],"category_scores_gemma":[0.0014743275,0.00047900763,0.00084492535,0.0006631062,0.0011135362,0.003094241,0.0015668762,0.0014815052,0.0023785252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003973675,0.00024098925,0.0040391027,0.0006008321,0.000095210344,0.0006596503,0.0009773454,0.024531176,0.057424653,0.70343924,0.029671125,0.17792325],"study_design_scores_gemma":[0.00007323586,0.00012875818,0.0025578495,0.000131379,0.000080008336,0.0015118091,0.0004968937,0.07233701,0.051898897,0.8226266,0.048098065,0.00005947881],"about_ca_topic_score_codex":0.0010428578,"about_ca_topic_score_gemma":0.0010615902,"teacher_disagreement_score":0.010765858,"about_ca_system_score_codex":0.00080029864,"about_ca_system_score_gemma":0.00058890675,"threshold_uncertainty_score":0.03601533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6950106,0.0024807751,0.21964322,0.0037916242,0.00023216534,0.000120610865,0.00076877297,0.00045066842,0.07750146],"genre_scores_gemma":[0.96224594,0.0005595181,0.029078554,0.00018888933,0.0001790341,0.00013011278,0.0005116833,0.00011035337,0.006995872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886453,0.00034309173,0.000049501723,0.00024152528,0.00030447854,0.00019680729],"domain_scores_gemma":[0.9941162,0.00420186,0.000474401,0.00035333115,0.00032075585,0.0005333821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014968272,0.00051846675,0.0010022613,0.0025713218,0.0030857786,0.0031752083,0.0017647562,0.0017529924,0.008856526],"category_scores_gemma":[0.013262245,0.0006832096,0.0007123143,0.001412142,0.002612466,0.0040585683,0.003125869,0.0021982924,0.0005464728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012646495,0.000040737803,0.001027371,0.00009173072,0.000028099987,0.000104356426,0.00030163722,0.014684869,0.0009280914,0.9699514,0.0036796469,0.009035578],"study_design_scores_gemma":[0.00002955156,0.000022721975,0.00046919668,0.00003403953,0.000015771659,0.00016303224,0.00017086577,0.059569843,0.0007982945,0.9354587,0.00325072,0.000017263395],"about_ca_topic_score_codex":0.0012441534,"about_ca_topic_score_gemma":0.0012846256,"teacher_disagreement_score":0.008856526,"about_ca_system_score_codex":0.0025704622,"about_ca_system_score_gemma":0.00052086223,"threshold_uncertainty_score":0.029628038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63069856,0.005690614,0.19594169,0.012025453,0.00042758865,0.0001581367,0.0005836518,0.0010932472,0.15338106],"genre_scores_gemma":[0.9550588,0.0009902667,0.03371658,0.0006720083,0.0002673062,0.00017083141,0.00024339248,0.00013866182,0.008742119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859947,0.00076453225,0.000045107983,0.00021315989,0.00017052205,0.00020730922],"domain_scores_gemma":[0.98552644,0.010907887,0.0010808863,0.00095708,0.00052442955,0.001003302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035210352,0.0006176823,0.0010177575,0.0011971324,0.0022424734,0.0034054306,0.001646364,0.0015186425,0.006409731],"category_scores_gemma":[0.016594656,0.0006579245,0.0005813739,0.0009088594,0.0028794198,0.0070777284,0.0023039335,0.0024733641,0.0009092444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046132773,0.00011155962,0.0009684258,0.00021476892,0.000033352957,0.00011655123,0.00037346507,0.033487484,0.002575834,0.92725706,0.0146285845,0.019771667],"study_design_scores_gemma":[0.000066641376,0.00008455699,0.0009497659,0.00006165601,0.00002970883,0.00034951366,0.00017992107,0.17742704,0.0021611368,0.8097532,0.008888471,0.000048425656],"about_ca_topic_score_codex":0.0011979652,"about_ca_topic_score_gemma":0.0013483269,"teacher_disagreement_score":0.006409731,"about_ca_system_score_codex":0.0021596279,"about_ca_system_score_gemma":0.0010132868,"threshold_uncertainty_score":0.021442711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23451006,0.00033105083,0.71785015,0.00055092014,0.00016544414,0.0003315385,0.00045167626,0.00085802196,0.044951208],"genre_scores_gemma":[0.75436354,0.00019783733,0.21985635,0.000278378,0.000042859898,0.00028815295,0.0007814306,0.0003758897,0.023815483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937147,0.00020831387,0.000017942499,0.00012780372,0.00019551237,0.00007894022],"domain_scores_gemma":[0.99874204,0.0005601961,0.00009636487,0.00030333415,0.00020149641,0.00009663111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064321613,0.00034346056,0.00032007362,0.000827777,0.00077745155,0.0005752367,0.0007892445,0.00065138587,0.010565303],"category_scores_gemma":[0.0029058852,0.00044435897,0.00070972013,0.00043934322,0.0010221316,0.001005138,0.00226989,0.00094529387,0.0013715533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019948492,0.00013076964,0.0019832128,0.00035508213,0.000052480456,0.0005243497,0.0008355575,0.036121067,0.038409613,0.83481336,0.009353116,0.07722197],"study_design_scores_gemma":[0.00013426665,0.0002445771,0.0015604731,0.00012955914,0.000055951827,0.00069471495,0.00041328967,0.16299175,0.026143165,0.772746,0.03482872,0.000057402376],"about_ca_topic_score_codex":0.0004079434,"about_ca_topic_score_gemma":0.0008512942,"teacher_disagreement_score":0.010565303,"about_ca_system_score_codex":0.00040857578,"about_ca_system_score_gemma":0.00023871008,"threshold_uncertainty_score":0.03534448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94490343,0.00039765373,0.039460145,0.00050811144,0.00008822531,0.00003929068,0.00055449945,0.00024482294,0.013803855],"genre_scores_gemma":[0.98984843,0.00015151256,0.008231871,0.0001267057,0.000057771485,0.000019977975,0.0005939027,0.000032224973,0.0009376259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946004,0.00008985291,0.000031430478,0.00021045847,0.00009141938,0.00011682908],"domain_scores_gemma":[0.99642366,0.0016062316,0.00092474034,0.00029552772,0.00037268456,0.0003771248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004538123,0.0007006076,0.0005189256,0.0022304018,0.0006791377,0.0017300583,0.0005789503,0.0009353582,0.0043097744],"category_scores_gemma":[0.0041485713,0.0003740956,0.00040069222,0.0018077476,0.0009316538,0.002035797,0.0008256028,0.00069816085,0.00040074953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014307321,0.00043638775,0.07424206,0.0009553918,0.00026313946,0.0056057484,0.0021227768,0.11751662,0.14265372,0.52812475,0.018365953,0.10828278],"study_design_scores_gemma":[0.00013615625,0.0003215415,0.024608865,0.00010908039,0.00017902914,0.0052921376,0.0014245742,0.12770604,0.02619109,0.79638976,0.017508293,0.00013348035],"about_ca_topic_score_codex":0.00034994265,"about_ca_topic_score_gemma":0.0003089669,"teacher_disagreement_score":0.0043097744,"about_ca_system_score_codex":0.000658212,"about_ca_system_score_gemma":0.0002826783,"threshold_uncertainty_score":0.014417648},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23631638,0.0005822186,0.69331235,0.006778584,0.0005048273,0.00039638294,0.0024038895,0.0024659801,0.057239477],"genre_scores_gemma":[0.83533925,0.00037279786,0.14437321,0.0008256559,0.0002910644,0.00022006322,0.0013587648,0.00045913647,0.01676001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666876,0.0015100462,0.0001516563,0.00051896775,0.0004579794,0.00069261994],"domain_scores_gemma":[0.98280454,0.008426067,0.0010074162,0.004778525,0.0016333385,0.0013501239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00249614,0.000841367,0.0011511736,0.00082460826,0.0018338645,0.00414558,0.0023317968,0.0016545375,0.018474504],"category_scores_gemma":[0.014094669,0.00059007143,0.00066301867,0.0025715982,0.0014213563,0.008206483,0.0021709597,0.0019369324,0.0017966733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016124872,0.0005287074,0.003979865,0.00054143014,0.00009487441,0.00031426942,0.0006025126,0.08590338,0.0066386643,0.7616841,0.04040188,0.09769771],"study_design_scores_gemma":[0.000119196695,0.00009739236,0.0005422131,0.000039943756,0.0000563653,0.0002940585,0.00048139042,0.21489438,0.0056527546,0.7582294,0.019547494,0.00004543866],"about_ca_topic_score_codex":0.0022094366,"about_ca_topic_score_gemma":0.0026773429,"teacher_disagreement_score":0.018474504,"about_ca_system_score_codex":0.0025315857,"about_ca_system_score_gemma":0.0018548444,"threshold_uncertainty_score":0.06180334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9142917,0.00017432569,0.066884875,0.00020545228,0.000103069055,0.00002294966,0.00012434517,0.00022580837,0.017967427],"genre_scores_gemma":[0.9765787,0.00009753518,0.019007506,0.000057660076,0.000030233552,0.000026387983,0.00013327054,0.00006977388,0.003998902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994344,0.00013168222,0.00002976749,0.00011073769,0.000115082665,0.00017830134],"domain_scores_gemma":[0.99834824,0.0006279858,0.00022824664,0.00036239222,0.00021600275,0.00021713394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039236012,0.00033391739,0.0003498199,0.00076178665,0.0012478759,0.0011067673,0.0004612221,0.00056127354,0.0043915086],"category_scores_gemma":[0.002274485,0.00034251442,0.0005762582,0.000513823,0.001420071,0.0016496982,0.0012901685,0.00083461375,0.0004150067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028224604,0.000070992486,0.009167912,0.00010513684,0.000028859436,0.00076519145,0.0012790889,0.023347605,0.029278832,0.90808237,0.0024312213,0.02516042],"study_design_scores_gemma":[0.000039046052,0.00015644063,0.005007731,0.000053765183,0.000034171288,0.00071174646,0.001119485,0.06051645,0.014903041,0.90511036,0.012291532,0.00005612796],"about_ca_topic_score_codex":0.0011048244,"about_ca_topic_score_gemma":0.0017974227,"teacher_disagreement_score":0.0043915086,"about_ca_system_score_codex":0.0008033583,"about_ca_system_score_gemma":0.00030232215,"threshold_uncertainty_score":0.014691114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8787428,0.00052631367,0.09047834,0.000787289,0.00005116142,0.000026690232,0.00021315755,0.00040723,0.02876715],"genre_scores_gemma":[0.98903006,0.00011982679,0.009066562,0.00008453959,0.00003926495,0.000018182134,0.00011398297,0.000047171892,0.0014804178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907887,0.000270325,0.000032836328,0.00023400504,0.0002447004,0.0001391222],"domain_scores_gemma":[0.99387854,0.004272138,0.00041807423,0.0004374241,0.00035799725,0.0006357871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014273735,0.00039273137,0.0007563845,0.0012678046,0.0011444188,0.0015807863,0.0012054627,0.0004832487,0.0034334587],"category_scores_gemma":[0.005216415,0.00042085355,0.000666702,0.0004872458,0.003115577,0.0029366715,0.001921324,0.0019352518,0.00026703792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018031686,0.00007534308,0.0021591177,0.00012540155,0.000021421723,0.0003343208,0.0006232817,0.0076182107,0.007119024,0.97339183,0.000808311,0.007543464],"study_design_scores_gemma":[0.000021026248,0.00004905796,0.0011148894,0.000025707708,0.000014869428,0.00022029823,0.00016473005,0.043347076,0.0048855618,0.94862133,0.0015181311,0.000017326392],"about_ca_topic_score_codex":0.0005160265,"about_ca_topic_score_gemma":0.0003974434,"teacher_disagreement_score":0.0034334587,"about_ca_system_score_codex":0.000962654,"about_ca_system_score_gemma":0.0003479102,"threshold_uncertainty_score":0.011486113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7512182,0.00012309282,0.22575898,0.00028741462,0.000020786161,0.00009953446,0.00038922258,0.00034627283,0.021756524],"genre_scores_gemma":[0.938422,0.00019835835,0.054461863,0.00005684379,0.000012822736,0.000091651724,0.00059129985,0.000085676584,0.006079524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966717,0.00006461774,0.000016036567,0.00009142402,0.00008249364,0.0000782147],"domain_scores_gemma":[0.9987764,0.00044466127,0.00021736402,0.00031677654,0.00013416719,0.00011062394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002049215,0.00056703214,0.00046405732,0.0005101806,0.00066287274,0.0009291132,0.0006737977,0.0005151446,0.0049091503],"category_scores_gemma":[0.0014437421,0.00040580792,0.0005328209,0.0005448647,0.00079582655,0.0028144685,0.0017592921,0.0011010293,0.0005828231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083115057,0.00034274696,0.0062063253,0.00043128777,0.00013754057,0.0015426652,0.0014251982,0.1228181,0.09285533,0.671676,0.0040046773,0.097729],"study_design_scores_gemma":[0.00010718695,0.00038793875,0.0057899673,0.00007142301,0.00013041859,0.0016897816,0.0013327787,0.25353554,0.07131562,0.637399,0.028185531,0.0000547696],"about_ca_topic_score_codex":0.0008849132,"about_ca_topic_score_gemma":0.0010120296,"teacher_disagreement_score":0.0049091503,"about_ca_system_score_codex":0.00041570453,"about_ca_system_score_gemma":0.0002337475,"threshold_uncertainty_score":0.016422749},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89696014,0.0004816462,0.08392877,0.00067393295,0.000030900646,0.000056005738,0.0011698256,0.0003377874,0.016360978],"genre_scores_gemma":[0.98667395,0.00012694311,0.011445611,0.00008337026,0.000040696876,0.00003180052,0.0004963006,0.00005975143,0.001041628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937457,0.00010147464,0.000027399888,0.00020701771,0.00012426828,0.00016534525],"domain_scores_gemma":[0.99293876,0.0048316866,0.0005803091,0.0007131235,0.00036211894,0.00057397014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064944994,0.00039793964,0.000434709,0.0011805181,0.00085864286,0.0015639673,0.0014812301,0.00054491195,0.0032515824],"category_scores_gemma":[0.0045792647,0.00038989424,0.0005116067,0.00088331307,0.0011715847,0.002468463,0.0011552959,0.0010348093,0.00023292235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012753916,0.00035672114,0.046262544,0.0008382333,0.0002723931,0.0008067167,0.0019553392,0.10303418,0.09598836,0.67310894,0.011586732,0.06451444],"study_design_scores_gemma":[0.00007984451,0.00011290547,0.019857163,0.000075990494,0.00009583406,0.00070784404,0.0005386984,0.23687461,0.027839439,0.7064529,0.0072897184,0.00007505434],"about_ca_topic_score_codex":0.0021016323,"about_ca_topic_score_gemma":0.0023420914,"teacher_disagreement_score":0.0032515824,"about_ca_system_score_codex":0.001088905,"about_ca_system_score_gemma":0.00047090944,"threshold_uncertainty_score":0.010877609},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.789491,0.0013826645,0.18365972,0.0007578436,0.000054213273,0.000050371476,0.00090595544,0.00044612552,0.023252143],"genre_scores_gemma":[0.97591054,0.0002235377,0.021299476,0.00006820571,0.00005139754,0.00003471442,0.0004200666,0.00006437112,0.0019276993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.0001678949,0.000032440847,0.00023674766,0.00018912432,0.00016710261],"domain_scores_gemma":[0.99205434,0.0045622024,0.0010765889,0.00069071027,0.00074210035,0.00087407854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007055121,0.00035354894,0.0006717847,0.0019027123,0.0010976294,0.0011579142,0.001352224,0.00069789874,0.0040746653],"category_scores_gemma":[0.0066130366,0.0003307554,0.00034231026,0.001588387,0.0012869549,0.002819092,0.0010300006,0.00090761494,0.0005148781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010137543,0.00030459938,0.023580734,0.0005954793,0.00015416808,0.00041272474,0.00082725805,0.19310203,0.020455444,0.657397,0.010947752,0.091208994],"study_design_scores_gemma":[0.00006180978,0.00021934211,0.008030124,0.000040097224,0.00005808485,0.0010067879,0.0002487867,0.22717875,0.008335516,0.7474336,0.0073417593,0.000045346234],"about_ca_topic_score_codex":0.0009910407,"about_ca_topic_score_gemma":0.0012788756,"teacher_disagreement_score":0.0040746653,"about_ca_system_score_codex":0.0014079992,"about_ca_system_score_gemma":0.0004164806,"threshold_uncertainty_score":0.013631105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.859616,0.00029029165,0.082767114,0.00020723647,0.00010879025,0.00005531175,0.00032967373,0.00053106394,0.056094605],"genre_scores_gemma":[0.9824019,0.000088693196,0.010598981,0.000060850663,0.00002621671,0.000023526787,0.00040283,0.000057805097,0.0063392916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976665,0.00003129435,0.000011035795,0.000054897897,0.00006885568,0.000067245506],"domain_scores_gemma":[0.9995491,0.00007714595,0.00009469461,0.00013027502,0.000055112174,0.00009356568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011250735,0.00026664181,0.00028439186,0.00051376695,0.0005645391,0.00083091634,0.00038651322,0.0005041098,0.0071563353],"category_scores_gemma":[0.00090899365,0.00021446015,0.0003807024,0.00039253675,0.0007521943,0.0008558423,0.0012039692,0.0004364307,0.00083008455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064257695,0.0001279853,0.01260423,0.0002594263,0.00006388518,0.0017077487,0.0018365309,0.049610563,0.06724523,0.6959185,0.011915712,0.1580676],"study_design_scores_gemma":[0.00009097287,0.00043318773,0.020659374,0.0001302259,0.0000827677,0.004448558,0.0019633647,0.29539502,0.04795203,0.5319865,0.096770145,0.00008787994],"about_ca_topic_score_codex":0.00091420166,"about_ca_topic_score_gemma":0.0011016757,"teacher_disagreement_score":0.0071563353,"about_ca_system_score_codex":0.00048312687,"about_ca_system_score_gemma":0.00013160982,"threshold_uncertainty_score":0.023940325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.540695,0.00021100591,0.42565858,0.00022795671,0.00008766491,0.00015681915,0.00017373003,0.00033277192,0.032456405],"genre_scores_gemma":[0.9192324,0.00008423893,0.07158641,0.00007288708,0.000017003309,0.00009862891,0.00021183543,0.00008369593,0.008612824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966323,0.00009180862,0.000012952877,0.000058480295,0.00012425806,0.000049259485],"domain_scores_gemma":[0.9992162,0.00031060207,0.00008757851,0.00018042838,0.00012836418,0.000076844946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043754812,0.00018488537,0.0002475605,0.00065473345,0.0004796823,0.0004950556,0.000543299,0.00045168592,0.0051576067],"category_scores_gemma":[0.0017905077,0.000315748,0.00038134845,0.0003310898,0.0008046512,0.0007752743,0.0015672147,0.0004871285,0.00053744105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012676379,0.00009787337,0.0021948852,0.00018791051,0.000027948814,0.00047516453,0.0007197471,0.02034229,0.040549975,0.8909265,0.002972815,0.041378163],"study_design_scores_gemma":[0.0001088124,0.00024237258,0.0025366407,0.00011532384,0.000042041913,0.0011111362,0.0005985068,0.17242302,0.044393536,0.7518092,0.026569566,0.00004983976],"about_ca_topic_score_codex":0.00019993643,"about_ca_topic_score_gemma":0.00040468358,"teacher_disagreement_score":0.0051576067,"about_ca_system_score_codex":0.0002770157,"about_ca_system_score_gemma":0.00017062547,"threshold_uncertainty_score":0.017253935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.727538,0.0011116753,0.21614186,0.0008818106,0.00006252449,0.00009985926,0.0020806524,0.00028540162,0.05179828],"genre_scores_gemma":[0.9607301,0.0004766981,0.031851154,0.00021779294,0.00010323693,0.00009714171,0.0016432585,0.000095638214,0.0047851433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931586,0.00008769815,0.000048501315,0.00024519302,0.00014839563,0.0001543082],"domain_scores_gemma":[0.9966787,0.0014047092,0.00077157066,0.00025638708,0.00043695845,0.0004516716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005661937,0.00037462972,0.00038742903,0.0017606885,0.000994161,0.0037228225,0.0008617164,0.0006805472,0.0027784084],"category_scores_gemma":[0.004189849,0.0003043323,0.00031380937,0.0022347048,0.0013570937,0.0030559986,0.0009926955,0.00076703617,0.00052880234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045944806,0.00013834082,0.01801765,0.00029530615,0.000072412,0.0006588232,0.0021383413,0.018824654,0.05017917,0.8198098,0.010335309,0.07907078],"study_design_scores_gemma":[0.000055008997,0.00016392625,0.013012798,0.00011399543,0.00008181697,0.0035725334,0.0013953627,0.0704379,0.016046494,0.8515251,0.043533076,0.000061962994],"about_ca_topic_score_codex":0.0008695123,"about_ca_topic_score_gemma":0.00085530506,"teacher_disagreement_score":0.0037228225,"about_ca_system_score_codex":0.0009809784,"about_ca_system_score_gemma":0.0004051018,"threshold_uncertainty_score":0.009294689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9104568,0.00017479957,0.053875413,0.0002562118,0.00004102313,0.00006193659,0.0007924768,0.00034461575,0.03399684],"genre_scores_gemma":[0.97656983,0.00008270612,0.017709037,0.00006707776,0.00002482244,0.000045314766,0.0006897014,0.00007462434,0.004736859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994905,0.00010536736,0.000029182156,0.0001366892,0.000080699625,0.0001575505],"domain_scores_gemma":[0.9983596,0.00055354426,0.00030742076,0.00020805812,0.0002661647,0.0003051925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024376893,0.00040249847,0.00057033065,0.0011961386,0.0012410879,0.0014971708,0.00092406856,0.00069658103,0.0094908215],"category_scores_gemma":[0.001966842,0.0004409567,0.00030092947,0.0011027593,0.0009467076,0.0019527021,0.0009150848,0.00069160905,0.0009143528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037209117,0.00040710354,0.023304533,0.001205615,0.00022564273,0.0040099826,0.0009854259,0.19417578,0.11273453,0.59425145,0.009133857,0.055845197],"study_design_scores_gemma":[0.0002655233,0.00080337963,0.014034392,0.00017993512,0.0001711931,0.0031981342,0.0025543578,0.46679974,0.0916812,0.40389675,0.016209299,0.00020605115],"about_ca_topic_score_codex":0.0015486091,"about_ca_topic_score_gemma":0.0015751483,"teacher_disagreement_score":0.0094908215,"about_ca_system_score_codex":0.00076543307,"about_ca_system_score_gemma":0.00039373338,"threshold_uncertainty_score":0.031749964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7148369,0.0008351019,0.26389882,0.00054502033,0.000038813367,0.000028486056,0.0004212151,0.0003488424,0.019046882],"genre_scores_gemma":[0.95598733,0.00026451467,0.04119577,0.00008236591,0.00004514592,0.00003522398,0.00023353782,0.00013151683,0.0020246403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993273,0.00015775494,0.000031214528,0.00019855483,0.00014769632,0.00013752941],"domain_scores_gemma":[0.9953448,0.002722912,0.00047658678,0.0006622478,0.00044478773,0.00034858988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010559955,0.0002534341,0.00092774286,0.0009742341,0.0009262856,0.0015950568,0.00088377733,0.0009751195,0.0038440153],"category_scores_gemma":[0.009481811,0.00041775938,0.000452533,0.0008920757,0.0010441645,0.0028897363,0.0009559637,0.00078729336,0.00046892083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034706417,0.000118467826,0.013781594,0.00043086894,0.00008223011,0.0003790833,0.00076405937,0.08533734,0.033560324,0.8032013,0.0060723014,0.05592535],"study_design_scores_gemma":[0.000025226884,0.00012826611,0.007210712,0.00005890461,0.00005345856,0.00086867483,0.000309736,0.24257082,0.008482563,0.73366666,0.0065890746,0.0000359517],"about_ca_topic_score_codex":0.0005580056,"about_ca_topic_score_gemma":0.000951902,"teacher_disagreement_score":0.0038440153,"about_ca_system_score_codex":0.0012355626,"about_ca_system_score_gemma":0.00057353545,"threshold_uncertainty_score":0.012859523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7993744,0.000274593,0.193004,0.0003450737,0.00002308556,0.000050956067,0.0008676124,0.0003493868,0.0057109366],"genre_scores_gemma":[0.95050544,0.00015377677,0.045713365,0.0000626348,0.000033081502,0.000050309856,0.00083321147,0.00019024078,0.0024579214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993087,0.00010000846,0.000039014834,0.00021446458,0.0001510041,0.00018674633],"domain_scores_gemma":[0.99011314,0.0059183952,0.0013154391,0.0009833006,0.0009118386,0.0007579187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087727304,0.00024732033,0.0007646249,0.0010067391,0.00085894356,0.0020567128,0.0011080755,0.000555047,0.0034024282],"category_scores_gemma":[0.006303161,0.00042294673,0.0006407675,0.00088371633,0.001165324,0.0025453907,0.0008414777,0.0011441321,0.0004898254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018312251,0.00034941192,0.09789637,0.0008093904,0.0002126946,0.00072573626,0.0019361189,0.23949462,0.09619321,0.38991103,0.009161507,0.16147862],"study_design_scores_gemma":[0.00004881275,0.00025407656,0.028470356,0.00006925158,0.00010050172,0.0012011693,0.0007333926,0.50035274,0.031667314,0.43058425,0.006438336,0.00007988509],"about_ca_topic_score_codex":0.0013533186,"about_ca_topic_score_gemma":0.0020330565,"teacher_disagreement_score":0.0034024282,"about_ca_system_score_codex":0.0015241448,"about_ca_system_score_gemma":0.0011272293,"threshold_uncertainty_score":0.011382282},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08023674,0.02464798,0.14520791,0.3457172,0.008957719,0.00014362088,0.0012656956,0.0010430617,0.39278007],"genre_scores_gemma":[0.8125574,0.01355237,0.02338397,0.07205741,0.016222956,0.0002264028,0.0007067201,0.0004843589,0.06080843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664426,0.00091476523,0.00014462828,0.00084625435,0.0008802431,0.0005699229],"domain_scores_gemma":[0.98281866,0.011174944,0.0008189502,0.0017028782,0.0023522836,0.0011322981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00473197,0.0008590303,0.0010384173,0.0018285557,0.0029203282,0.002854245,0.0027826736,0.002667628,0.022575455],"category_scores_gemma":[0.017453553,0.0003715161,0.0015932877,0.002162497,0.006433044,0.01002213,0.003528101,0.0058082896,0.0024532217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011900047,0.000048610982,0.0017186888,0.00021112044,0.000036382953,0.00032523103,0.0008162739,0.0026295683,0.0010120815,0.9273851,0.049376756,0.016321156],"study_design_scores_gemma":[0.00003540935,0.000041725198,0.0010364233,0.000121592886,0.00002083346,0.00029219262,0.0005087609,0.0031991468,0.0005757366,0.91055864,0.08358393,0.000025669964],"about_ca_topic_score_codex":0.0045958636,"about_ca_topic_score_gemma":0.0023995086,"teacher_disagreement_score":0.022575455,"about_ca_system_score_codex":0.0019852547,"about_ca_system_score_gemma":0.0005798902,"threshold_uncertainty_score":0.07552248},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87020147,0.0006741201,0.067367785,0.0017800395,0.00017947645,0.00018106533,0.0026650743,0.000816099,0.056134924],"genre_scores_gemma":[0.9766722,0.00041520494,0.012437489,0.00050572015,0.000041987794,0.00007845737,0.0018750536,0.000045339486,0.007928498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939203,0.0000847324,0.000040034178,0.00018573916,0.00009146138,0.00020599566],"domain_scores_gemma":[0.9967051,0.0016657977,0.0005078565,0.0003943904,0.00035153408,0.00037529363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033909967,0.0005460555,0.00062832783,0.00077695464,0.0013055508,0.0024466491,0.0008654807,0.0007132952,0.009572085],"category_scores_gemma":[0.0025043706,0.0007817794,0.0008318396,0.0010732291,0.0014068579,0.0021641396,0.0012397475,0.0014069552,0.00070854457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001926041,0.0003897103,0.016662475,0.0018637751,0.00034509925,0.0020079352,0.002048803,0.05961591,0.045998495,0.7691825,0.019864991,0.080094256],"study_design_scores_gemma":[0.00044493016,0.00031729884,0.010790054,0.00017190966,0.00032629346,0.001708896,0.001409692,0.047444023,0.027418308,0.8673717,0.04240724,0.0001897734],"about_ca_topic_score_codex":0.004126842,"about_ca_topic_score_gemma":0.005698362,"teacher_disagreement_score":0.009572085,"about_ca_system_score_codex":0.0016494218,"about_ca_system_score_gemma":0.0007802604,"threshold_uncertainty_score":0.03202182},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036646635,0.0037042813,0.004133555,0.11508958,0.8711075,0.000030219264,0.00087578915,0.0003415806,0.0043509994],"genre_scores_gemma":[0.03249668,0.026781263,0.021898488,0.14817859,0.6021518,0.00039561072,0.006002814,0.0032592162,0.15883559],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9903464,0.0025704768,0.0015730882,0.0016800301,0.003290444,0.0005395807],"domain_scores_gemma":[0.9518265,0.019379664,0.002207524,0.0033931907,0.02137235,0.0018207463],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0071125976,0.0036718673,0.002216162,0.003795501,0.0039722756,0.005832408,0.0042755217,0.007949222,0.046131887],"category_scores_gemma":[0.10765904,0.0013205317,0.0025427565,0.0030668075,0.00472058,0.0068331105,0.0035310509,0.013853196,0.028732968],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022686192,0.0000038613503,0.000022357937,0.00017003858,0.000016847534,0.000084570995,0.0000803344,0.000052713433,0.00008960702,0.00482797,0.9888721,0.005756919],"study_design_scores_gemma":[0.000018824065,0.000022442926,0.00027319894,0.00027106382,0.000034500703,0.00059850636,0.00011413656,0.00028497603,0.0002732578,0.0060315994,0.9920387,0.00003880398],"about_ca_topic_score_codex":0.0044493047,"about_ca_topic_score_gemma":0.0031841055,"teacher_disagreement_score":0.99205077,"about_ca_system_score_codex":0.005059768,"about_ca_system_score_gemma":0.0047138524,"threshold_uncertainty_score":0.1543265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79613054,0.001988806,0.119255826,0.005616685,0.00028436922,0.0000685385,0.00039306964,0.00034122352,0.07592095],"genre_scores_gemma":[0.98246217,0.00030788744,0.013029839,0.00029173223,0.000110023175,0.000047451387,0.000163693,0.00003572127,0.0035514578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998931,0.00021239449,0.00003742634,0.00032730322,0.0002362624,0.00025566065],"domain_scores_gemma":[0.9959319,0.002225953,0.00047616032,0.0005998566,0.0003167477,0.00044936698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104929,0.0002650205,0.00068618683,0.001097757,0.0017216408,0.0017766969,0.0013673434,0.001737442,0.0071660313],"category_scores_gemma":[0.007952524,0.00046151833,0.00051474926,0.0010402467,0.002451894,0.003791288,0.002051209,0.0017899155,0.00044505228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028017093,0.00007880773,0.0030611258,0.000098768076,0.000020628439,0.00037509756,0.00050989405,0.015110493,0.0027346697,0.9539668,0.007071567,0.016691914],"study_design_scores_gemma":[0.000052080224,0.00003180177,0.00081402407,0.000028805709,0.0000103338525,0.00032351093,0.0002966283,0.036196973,0.0012259086,0.95630753,0.0046969396,0.000015486094],"about_ca_topic_score_codex":0.0017066436,"about_ca_topic_score_gemma":0.0014843132,"teacher_disagreement_score":0.0071660313,"about_ca_system_score_codex":0.00109674,"about_ca_system_score_gemma":0.00043797458,"threshold_uncertainty_score":0.02397275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8818331,0.00036138255,0.092248045,0.0042906133,0.00008649854,0.00012383233,0.0011099818,0.00093744346,0.019009179],"genre_scores_gemma":[0.98387766,0.0001666716,0.011930844,0.00026277595,0.00008190187,0.000094406394,0.0011082373,0.000108854845,0.0023686371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971219,0.0005444559,0.00020227535,0.00070367043,0.0008207099,0.0006069884],"domain_scores_gemma":[0.9749713,0.019059105,0.0018614642,0.0017897243,0.0008552187,0.0014632469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308969,0.00078960444,0.0013507406,0.0011272781,0.0022540123,0.0032086235,0.0024925012,0.002389577,0.0067575085],"category_scores_gemma":[0.014191613,0.0011755157,0.002149832,0.00094516505,0.004905962,0.006260898,0.004867295,0.004006623,0.0004342561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018700863,0.0008889185,0.01994791,0.0013513048,0.00025587156,0.0024375306,0.0032163667,0.107461594,0.023984268,0.78050655,0.012736145,0.045343447],"study_design_scores_gemma":[0.00018869738,0.00016905642,0.003560879,0.000065915665,0.00008414886,0.0009130437,0.0006339103,0.07745346,0.007153325,0.90506583,0.0046233903,0.00008824513],"about_ca_topic_score_codex":0.0019223528,"about_ca_topic_score_gemma":0.0014144395,"teacher_disagreement_score":0.0067575085,"about_ca_system_score_codex":0.0020072334,"about_ca_system_score_gemma":0.0010519685,"threshold_uncertainty_score":0.022606075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38354796,0.0045516156,0.34254327,0.0051470646,0.00070986926,0.001553315,0.031289924,0.0019275353,0.22872943],"genre_scores_gemma":[0.7347211,0.0027457476,0.16373244,0.0018374718,0.0005049143,0.0010843788,0.03356227,0.00073777256,0.061073888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977301,0.00060832035,0.000117488235,0.00066699693,0.00041370216,0.000463507],"domain_scores_gemma":[0.9941882,0.003065988,0.00038016972,0.0007013318,0.0008347096,0.0008296131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013802219,0.0014699489,0.0012509533,0.0028230853,0.0031971128,0.0037723728,0.0014284627,0.0011087438,0.013742282],"category_scores_gemma":[0.0054850616,0.00093989103,0.0011105229,0.0038032169,0.0017436949,0.0042929747,0.0023214843,0.001955346,0.0025421348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008169968,0.000277424,0.0028501798,0.0013506957,0.00017412292,0.0010498402,0.0022145945,0.03519839,0.0076851887,0.8129922,0.07071848,0.06467187],"study_design_scores_gemma":[0.00019812761,0.00009610833,0.0014971911,0.00018135927,0.0001171893,0.0009723743,0.000712069,0.05308748,0.003724858,0.8689856,0.07037113,0.00005649023],"about_ca_topic_score_codex":0.0030258275,"about_ca_topic_score_gemma":0.004249461,"teacher_disagreement_score":0.013742282,"about_ca_system_score_codex":0.0026949432,"about_ca_system_score_gemma":0.0014379156,"threshold_uncertainty_score":0.045972466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33540222,0.002599847,0.55802673,0.007521045,0.00020959042,0.00024442826,0.0011223751,0.0012727012,0.093601145],"genre_scores_gemma":[0.9503212,0.0007385451,0.03812309,0.00054856465,0.00010834309,0.00026104573,0.00032889057,0.00036857277,0.009201714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967133,0.0008750785,0.000100728736,0.0008527628,0.0006756114,0.00078254956],"domain_scores_gemma":[0.9784566,0.01499017,0.0014553516,0.002531953,0.00091649324,0.0016494235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030683212,0.0016096176,0.001677098,0.001706378,0.0019388943,0.0030664515,0.0035891933,0.0024919834,0.01555383],"category_scores_gemma":[0.019524043,0.00080244103,0.0010236859,0.001502981,0.005791528,0.0098795565,0.005618446,0.0047886614,0.0017449379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012348914,0.00032392776,0.005710731,0.0005603424,0.00012759787,0.0004040364,0.00079718523,0.2807363,0.02107675,0.63891226,0.009891098,0.040224902],"study_design_scores_gemma":[0.000119669705,0.00024181278,0.0017252442,0.00016369847,0.00005864803,0.00032441056,0.00022128799,0.51392454,0.00780438,0.46856213,0.0067622457,0.00009193412],"about_ca_topic_score_codex":0.0015818148,"about_ca_topic_score_gemma":0.0013514522,"teacher_disagreement_score":0.01555383,"about_ca_system_score_codex":0.003918129,"about_ca_system_score_gemma":0.0015538514,"threshold_uncertainty_score":0.05203277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22483513,0.0007885503,0.747438,0.0030749652,0.00047878674,0.00018699557,0.00055745436,0.00035636677,0.022283792],"genre_scores_gemma":[0.9474187,0.00062186667,0.038595047,0.00045512465,0.00026573846,0.00017092071,0.00020853557,0.000054084616,0.012209925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867636,0.0005391635,0.00005356066,0.0003413849,0.00023264269,0.0001568904],"domain_scores_gemma":[0.9970958,0.0012515683,0.0005190431,0.00043573198,0.00037713975,0.00032070756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029247012,0.0006503056,0.0012307492,0.0011153383,0.00068218523,0.0019784546,0.0023826973,0.002373997,0.0044234428],"category_scores_gemma":[0.0059214984,0.00035735662,0.00095462124,0.0010994273,0.0032060107,0.003428001,0.001233405,0.0027685093,0.0005431465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037327416,0.00002205569,0.00042549154,0.000024107427,0.000019545927,0.00021173939,0.000059985723,0.02597596,0.0016132682,0.9691771,0.000799247,0.0016339802],"study_design_scores_gemma":[0.00008359913,0.00005560868,0.0006250711,0.000018454322,0.000028023174,0.0002769626,0.00006212904,0.40781555,0.00090115884,0.5865802,0.003497091,0.00005614176],"about_ca_topic_score_codex":0.001749518,"about_ca_topic_score_gemma":0.0012811531,"teacher_disagreement_score":0.0044234428,"about_ca_system_score_codex":0.0011279763,"about_ca_system_score_gemma":0.0005390995,"threshold_uncertainty_score":0.015467465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5962045,0.00062645617,0.22524121,0.004340976,0.00018472785,0.00034848155,0.0007523039,0.0006320036,0.17166933],"genre_scores_gemma":[0.97296053,0.00018051598,0.016279783,0.00031429777,0.000062328276,0.00018896382,0.00018312906,0.00008476492,0.009745678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985298,0.0005778398,0.000054817694,0.0002892382,0.00025012367,0.00029814054],"domain_scores_gemma":[0.99164563,0.005625109,0.00042871985,0.00044318242,0.0004188227,0.0014384495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015961295,0.0007509309,0.0008187637,0.00089092937,0.0015184792,0.0023315204,0.0011321283,0.001083546,0.011846883],"category_scores_gemma":[0.009976592,0.0005212185,0.0005446167,0.00046739663,0.003030748,0.005439466,0.0021072177,0.001643293,0.00075654057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777049,0.00012150459,0.0018522124,0.00018181613,0.00003735646,0.00022436054,0.0007212877,0.030741304,0.006161924,0.9403021,0.0050028153,0.014075572],"study_design_scores_gemma":[0.0000921252,0.00013899947,0.0006105869,0.00004545964,0.000023034441,0.00014897797,0.0002510818,0.17790967,0.0024522224,0.81153506,0.006762181,0.000030567087],"about_ca_topic_score_codex":0.002361583,"about_ca_topic_score_gemma":0.002072683,"teacher_disagreement_score":0.011846883,"about_ca_system_score_codex":0.0030341838,"about_ca_system_score_gemma":0.0016499056,"threshold_uncertainty_score":0.039631724},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22513236,0.0011892718,0.3524395,0.006640855,0.00096139155,0.00017129049,0.0010945924,0.0012475983,0.41112313],"genre_scores_gemma":[0.9180332,0.0008266979,0.046043914,0.0014749842,0.00052824215,0.00020404994,0.00045645755,0.00027938557,0.032153077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856853,0.00027742505,0.00006735485,0.00039517952,0.00046906047,0.00022249125],"domain_scores_gemma":[0.99465203,0.0021770687,0.00040969628,0.00074259104,0.001519452,0.0004991029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092266925,0.0004904386,0.00070900825,0.0021183325,0.0025079395,0.0021680384,0.0014264033,0.0010892157,0.014140929],"category_scores_gemma":[0.00630821,0.00049388665,0.0007781494,0.0018044602,0.0028290018,0.005784663,0.0031071731,0.0026807333,0.0016473589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046114015,0.000018462686,0.0005485793,0.000096301614,0.000009513154,0.00013317623,0.00061916164,0.0007350676,0.00301003,0.9811864,0.0063289306,0.0072682127],"study_design_scores_gemma":[0.000019976955,0.000040614785,0.0022257932,0.000045943383,0.00003829287,0.0007056782,0.0005397975,0.010233352,0.0051807286,0.91202193,0.06888451,0.000063237254],"about_ca_topic_score_codex":0.0020747287,"about_ca_topic_score_gemma":0.0013010814,"teacher_disagreement_score":0.014140929,"about_ca_system_score_codex":0.0010432046,"about_ca_system_score_gemma":0.0005957161,"threshold_uncertainty_score":0.04730612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43692437,0.0012454977,0.45370877,0.006851228,0.0004193001,0.00017169291,0.0016721154,0.001994437,0.09701254],"genre_scores_gemma":[0.8901623,0.0004018561,0.09792643,0.0010274597,0.00011801056,0.00009799154,0.0008449893,0.0003230606,0.009097973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857354,0.0002768511,0.000047268557,0.00037224212,0.00033128166,0.00039886712],"domain_scores_gemma":[0.9909779,0.0063361027,0.00029874092,0.0010073108,0.0005377419,0.0008422467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713598,0.0007776405,0.00082397874,0.0009127429,0.0017056534,0.0027053002,0.0022194933,0.0013337351,0.014076453],"category_scores_gemma":[0.009783197,0.0005196265,0.00057839573,0.0010453928,0.0018984012,0.0050689485,0.0025563342,0.0030295858,0.0013555572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013125004,0.00045350782,0.004172893,0.0006682826,0.00009021686,0.00042337942,0.00047059724,0.10033476,0.022310462,0.7529202,0.037230037,0.07961309],"study_design_scores_gemma":[0.00013883293,0.00025456116,0.0020944255,0.000114580274,0.0000737391,0.00043395083,0.0003276467,0.30785504,0.015040281,0.6540454,0.01954287,0.0000786622],"about_ca_topic_score_codex":0.00322042,"about_ca_topic_score_gemma":0.004431049,"teacher_disagreement_score":0.014076453,"about_ca_system_score_codex":0.0023096204,"about_ca_system_score_gemma":0.0026424783,"threshold_uncertainty_score":0.04709041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91002905,0.0004131277,0.06254904,0.00089431746,0.000057289362,0.000052690233,0.00061215047,0.00029465652,0.025097672],"genre_scores_gemma":[0.9826251,0.00023954936,0.011073888,0.00018317314,0.00005234672,0.000036035988,0.0005081794,0.00009035597,0.005191333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.00004356268,0.000018455083,0.00010276823,0.00007122431,0.00008363544],"domain_scores_gemma":[0.99891245,0.00029678762,0.00022664186,0.00015152631,0.00018884767,0.00022374562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002670374,0.00038151426,0.0004827446,0.0015308674,0.0011530261,0.0019229943,0.00072416576,0.0007892291,0.0043264274],"category_scores_gemma":[0.001372557,0.0004562835,0.0006401315,0.00087014766,0.0023282997,0.0029015157,0.0016884377,0.0010699986,0.00061674224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022263786,0.000047192232,0.0026885823,0.00013561487,0.000029404187,0.00050895143,0.0014871322,0.006047196,0.013839689,0.96118045,0.0022048287,0.011608291],"study_design_scores_gemma":[0.000040005485,0.00005952551,0.0029260295,0.000040899857,0.00003376474,0.00044976675,0.0007403363,0.015191664,0.004718782,0.96612465,0.009637314,0.000037221565],"about_ca_topic_score_codex":0.0016528387,"about_ca_topic_score_gemma":0.0010133296,"teacher_disagreement_score":0.0043264274,"about_ca_system_score_codex":0.00087677705,"about_ca_system_score_gemma":0.0003528612,"threshold_uncertainty_score":0.014473379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82955354,0.0004630709,0.12739374,0.0012715391,0.00009696658,0.000068438516,0.000630236,0.00045172698,0.0400706],"genre_scores_gemma":[0.97982657,0.0001759657,0.01157417,0.00015507046,0.000054341643,0.000034624132,0.00044303297,0.00008893557,0.0076473528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993523,0.00010993943,0.000030026802,0.00020155938,0.0001499766,0.00015623664],"domain_scores_gemma":[0.9980579,0.000607728,0.00028097426,0.00031563832,0.00037645834,0.00036120255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005704625,0.00040452697,0.00059109647,0.0016925314,0.00133656,0.0024876192,0.00092680723,0.001134484,0.005316601],"category_scores_gemma":[0.0026714606,0.00047978907,0.0006070898,0.0009339547,0.003073651,0.004628991,0.0023926196,0.0014806462,0.0006720645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000896286,0.000026648002,0.0013444041,0.00005820792,0.000013673762,0.00025939223,0.00075012556,0.0029945232,0.0043241135,0.98368615,0.0009200587,0.0055331783],"study_design_scores_gemma":[0.000017846396,0.00003695571,0.0008199691,0.000030394533,0.000015680704,0.0001562208,0.0004151741,0.011083876,0.0026510847,0.9787982,0.005957602,0.000016938058],"about_ca_topic_score_codex":0.0015909667,"about_ca_topic_score_gemma":0.0009586644,"teacher_disagreement_score":0.005316601,"about_ca_system_score_codex":0.0011575829,"about_ca_system_score_gemma":0.00037790622,"threshold_uncertainty_score":0.017785847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28414285,0.0043250234,0.48893073,0.0029322708,0.0010987,0.00015759154,0.0017412954,0.00084928086,0.21582234],"genre_scores_gemma":[0.8512122,0.0016481227,0.10658087,0.00093076215,0.0008512396,0.00015561082,0.0016522522,0.00028780152,0.036681153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992661,0.00015241055,0.0000512311,0.00018126838,0.00026765573,0.00008136193],"domain_scores_gemma":[0.9987901,0.0003497031,0.00019233406,0.00022981051,0.0002531293,0.0001849812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035680155,0.0003762374,0.00058631256,0.0025107039,0.00089947047,0.0019346053,0.00044632156,0.0005105566,0.0063779326],"category_scores_gemma":[0.0015055155,0.0002677344,0.0006521567,0.0012406476,0.0017030986,0.0022645472,0.0015619491,0.0010276983,0.00075065973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019160938,0.000008096378,0.00023160351,0.00004154779,0.000012528716,0.0001043891,0.000113665694,0.002036011,0.0013210543,0.98435736,0.0023486416,0.009405944],"study_design_scores_gemma":[0.000008176631,0.000018466802,0.00037773603,0.000019988674,0.00000999643,0.0004127905,0.00006771801,0.00900499,0.00072705885,0.9644113,0.024928909,0.00001262418],"about_ca_topic_score_codex":0.0005027209,"about_ca_topic_score_gemma":0.0005181577,"teacher_disagreement_score":0.0063779326,"about_ca_system_score_codex":0.0007493079,"about_ca_system_score_gemma":0.00028690603,"threshold_uncertainty_score":0.021336317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911511,0.0012253975,0.2830282,0.0023880084,0.00022494349,0.00023102896,0.0012688859,0.0004185808,0.12006387],"genre_scores_gemma":[0.89517826,0.00094053353,0.08579011,0.00053444935,0.00023366696,0.00023727471,0.0018611134,0.00014127613,0.015083272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933726,0.00018514608,0.000024861094,0.00019999297,0.00015808619,0.0000945953],"domain_scores_gemma":[0.99827015,0.0008600009,0.00020630575,0.00025901254,0.00016739716,0.00023703632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037338657,0.00055376976,0.0004260078,0.0010848638,0.0010132877,0.001001274,0.0007327725,0.00070326263,0.0072543835],"category_scores_gemma":[0.0019380223,0.00032214768,0.00055800745,0.0011753517,0.0015584915,0.002860398,0.0016245077,0.0011801663,0.0006054874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013423272,0.00004897288,0.0010944003,0.00017374751,0.000021184043,0.00023914195,0.00033579118,0.022999287,0.0050799567,0.9267242,0.0055489046,0.037600227],"study_design_scores_gemma":[0.00001888721,0.000033367567,0.0005942071,0.000051553794,0.000013574192,0.00022998605,0.00014385175,0.03454852,0.0015653255,0.9466276,0.016161576,0.000011513655],"about_ca_topic_score_codex":0.0007304167,"about_ca_topic_score_gemma":0.00082675024,"teacher_disagreement_score":0.0072543835,"about_ca_system_score_codex":0.00072524307,"about_ca_system_score_gemma":0.00037516077,"threshold_uncertainty_score":0.02426833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8127904,0.0033389516,0.13312921,0.0073628984,0.00043850282,0.0000782209,0.0009667318,0.00024689388,0.041648094],"genre_scores_gemma":[0.9857115,0.00092150253,0.009963922,0.00030520352,0.0006694832,0.00007392451,0.00029155458,0.00007689198,0.001986107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987105,0.00046024387,0.000030322955,0.00041024276,0.0001822609,0.00020637944],"domain_scores_gemma":[0.9573355,0.03439975,0.003329254,0.0011576541,0.0014297083,0.002348162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017885689,0.0006015615,0.0012072572,0.0024827868,0.0015982349,0.002418124,0.0018049611,0.0012006686,0.006344297],"category_scores_gemma":[0.016891276,0.0005949433,0.0005619378,0.0022634498,0.004173109,0.0046188184,0.0018260524,0.0023276983,0.0005649377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092925737,0.00040229614,0.019520214,0.00045125466,0.00017491062,0.0007610911,0.0011115298,0.055357665,0.013243572,0.8710926,0.014873573,0.022082036],"study_design_scores_gemma":[0.00012857237,0.00013853444,0.008206563,0.000109110886,0.00008576717,0.00068958034,0.00038456876,0.2992004,0.0030176414,0.6823325,0.005598159,0.000108661865],"about_ca_topic_score_codex":0.0023263122,"about_ca_topic_score_gemma":0.0016526483,"teacher_disagreement_score":0.006344297,"about_ca_system_score_codex":0.0013550435,"about_ca_system_score_gemma":0.00052756513,"threshold_uncertainty_score":0.021223783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7287352,0.0004588496,0.24033305,0.000616771,0.00014406143,0.00011282769,0.00014002011,0.0003415594,0.029117675],"genre_scores_gemma":[0.9805188,0.000189052,0.013967281,0.000100703095,0.00012318531,0.00006661517,0.00009330814,0.00008072543,0.004860372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788636,0.00063347444,0.000120680226,0.00045404898,0.000581545,0.00032389903],"domain_scores_gemma":[0.99576783,0.0015005568,0.0006128299,0.0006695301,0.0006016833,0.0008474557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026829536,0.00046394893,0.00060777756,0.0016865564,0.0017368434,0.003367278,0.0011524179,0.001036146,0.0046340222],"category_scores_gemma":[0.006995447,0.00043235836,0.00093314133,0.0013053176,0.005177035,0.010186419,0.0026945844,0.002049955,0.000526464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020683165,0.00001477153,0.00021979533,0.000009275862,0.000003425983,0.00004839806,0.00018954302,0.0006560957,0.0009171083,0.9958902,0.00011215581,0.0019185385],"study_design_scores_gemma":[0.000022988632,0.000054601984,0.00033431093,0.000012092204,0.0000122209,0.00027206438,0.0003120263,0.012753116,0.0025875808,0.9799953,0.0036144252,0.000029341873],"about_ca_topic_score_codex":0.0009610408,"about_ca_topic_score_gemma":0.00062376214,"teacher_disagreement_score":0.0046340222,"about_ca_system_score_codex":0.0012609354,"about_ca_system_score_gemma":0.0010103346,"threshold_uncertainty_score":0.015502334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4507158,0.00073670084,0.5253701,0.00034807678,0.000100867335,0.00020588713,0.00052807224,0.00052399427,0.021470511],"genre_scores_gemma":[0.84640497,0.0004505989,0.14658013,0.0000738925,0.000037474867,0.00013658918,0.00051603856,0.00012964038,0.005670648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903834,0.00019211088,0.000058464753,0.00014142325,0.00034025768,0.00022943092],"domain_scores_gemma":[0.99764985,0.0008297315,0.00047187493,0.0005145557,0.00036893843,0.00016503551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059278455,0.0004629075,0.00055385585,0.0012601502,0.0012794817,0.00095093163,0.0007595866,0.00091055,0.009950915],"category_scores_gemma":[0.0040293843,0.00059315754,0.0008223448,0.0014305101,0.0014157372,0.002133778,0.0025635774,0.001005686,0.0010419819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014347119,0.00019197102,0.008390157,0.0005160598,0.00015355946,0.0018930974,0.0014324056,0.3089246,0.06987001,0.32944217,0.007393166,0.27035812],"study_design_scores_gemma":[0.00018529664,0.00038298158,0.0033398515,0.0001623925,0.000098664306,0.0014300363,0.0016373743,0.54403347,0.041369803,0.38082623,0.026447602,0.00008628598],"about_ca_topic_score_codex":0.0025837892,"about_ca_topic_score_gemma":0.002716746,"teacher_disagreement_score":0.009950915,"about_ca_system_score_codex":0.00064504315,"about_ca_system_score_gemma":0.0004193166,"threshold_uncertainty_score":0.033289075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538952,0.00025210137,0.016834889,0.0003998501,0.000038799808,0.00003479037,0.00036955462,0.0001939502,0.02798085],"genre_scores_gemma":[0.99457836,0.000096426236,0.0031185464,0.000044417975,0.000021030124,0.000018280665,0.00019950961,0.00003063164,0.0018928656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995142,0.00005869914,0.000018226092,0.00009053164,0.00013358734,0.00018476328],"domain_scores_gemma":[0.99655366,0.001368072,0.00068566063,0.0003938105,0.00047160377,0.0005270976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043665833,0.00023017595,0.00037994428,0.0020182896,0.0012872956,0.0019291735,0.0006561786,0.00045205877,0.006232499],"category_scores_gemma":[0.0025728447,0.0002841051,0.00030886885,0.0016636844,0.0014697193,0.0011938972,0.0008204577,0.00057056826,0.0003665607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020565856,0.00013885243,0.029959438,0.0004183628,0.0001096483,0.0005478932,0.0019516667,0.07075572,0.049837377,0.78477305,0.010698913,0.04875253],"study_design_scores_gemma":[0.00022865215,0.00022659362,0.031095283,0.00009994037,0.00011862147,0.00092789903,0.0012871004,0.25283176,0.024602868,0.6633193,0.025133338,0.00012858275],"about_ca_topic_score_codex":0.006559028,"about_ca_topic_score_gemma":0.007369142,"teacher_disagreement_score":0.006559028,"about_ca_system_score_codex":0.0025304132,"about_ca_system_score_gemma":0.00094714784,"threshold_uncertainty_score":0.020849764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.774646,0.00032592306,0.20962481,0.00029205374,0.00007269147,0.00012261687,0.0014125106,0.0005744819,0.012928962],"genre_scores_gemma":[0.9183945,0.00015854483,0.076992154,0.000085200125,0.000034894903,0.00007702564,0.0013530508,0.00007489671,0.0028297643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996555,0.000047854148,0.000028370738,0.0001028247,0.00010484093,0.000060644994],"domain_scores_gemma":[0.9988588,0.00041838663,0.00023125476,0.00012609066,0.00021435617,0.00015117755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019413744,0.00024945172,0.00023629078,0.0011244403,0.0003784791,0.0010000303,0.00036186422,0.00038444137,0.0026439342],"category_scores_gemma":[0.0017988639,0.00022389894,0.00018576573,0.0008706694,0.00041648737,0.0015306525,0.00062546885,0.00054814003,0.00050444965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010564544,0.0003079396,0.02344328,0.00043045986,0.00003535088,0.0007535399,0.0016898796,0.060377844,0.18128215,0.47981563,0.007615704,0.24319175],"study_design_scores_gemma":[0.00007660093,0.000381474,0.014482218,0.00013961931,0.00003092609,0.002091299,0.0007335454,0.3028299,0.07217271,0.551495,0.055451952,0.00011469864],"about_ca_topic_score_codex":0.00047583843,"about_ca_topic_score_gemma":0.0007855806,"teacher_disagreement_score":0.0026439342,"about_ca_system_score_codex":0.00039642383,"about_ca_system_score_gemma":0.00028615425,"threshold_uncertainty_score":0.008844852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8444136,0.0002259556,0.13956352,0.00058211095,0.000050115126,0.000151305,0.00069642824,0.00040003972,0.013916893],"genre_scores_gemma":[0.9231479,0.00010675866,0.07014188,0.000081593775,0.000014573676,0.000030970685,0.001095347,0.000033875378,0.0053471224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.000042695803,0.000027998694,0.00012280013,0.000055033703,0.00009562544],"domain_scores_gemma":[0.9986721,0.00057782466,0.00015641557,0.00027118617,0.00012057339,0.0002018385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027866894,0.00022099479,0.00059904973,0.00056268094,0.0008822924,0.00119022,0.0007409962,0.00077814306,0.003949828],"category_scores_gemma":[0.002025257,0.00031921818,0.00062934787,0.00055000425,0.0008897006,0.0017867254,0.0007923364,0.0008142351,0.00033711843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010623184,0.0004904273,0.046383798,0.00093261135,0.00018253367,0.0020119178,0.002819088,0.20050251,0.089483924,0.4402466,0.010776953,0.2051073],"study_design_scores_gemma":[0.00010259146,0.00042406673,0.01095892,0.0001851095,0.00013618512,0.0014199959,0.0021341206,0.4191115,0.035445366,0.49783894,0.03216091,0.0000822672],"about_ca_topic_score_codex":0.003988274,"about_ca_topic_score_gemma":0.005238891,"teacher_disagreement_score":0.003988274,"about_ca_system_score_codex":0.0011681486,"about_ca_system_score_gemma":0.00089619274,"threshold_uncertainty_score":0.013213456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7645404,0.0009068906,0.123745605,0.004079835,0.000530431,0.000031935553,0.0006123921,0.0005448206,0.10500772],"genre_scores_gemma":[0.9699922,0.00034371103,0.020895302,0.00041387568,0.00014183654,0.000043674372,0.0003088708,0.0002633038,0.007597297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.00012137334,0.000040172596,0.0003116238,0.00019658853,0.00017350365],"domain_scores_gemma":[0.9941169,0.0035906641,0.0005645972,0.0006193895,0.00059267547,0.0005157545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007747754,0.00031704662,0.00037415553,0.00085888425,0.0019222897,0.0025802082,0.00079536345,0.00063209987,0.0067920736],"category_scores_gemma":[0.0034120528,0.00034277284,0.0005207376,0.001009408,0.0037703845,0.004736338,0.0013288928,0.002401948,0.0006341756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028677314,0.000033780067,0.0023244158,0.00008958038,0.000024887817,0.00016336929,0.0002719937,0.0038423284,0.011797713,0.96312183,0.0054910732,0.012552242],"study_design_scores_gemma":[0.000025211684,0.000060669114,0.0035147602,0.000045380948,0.000048480146,0.00088145974,0.00034713247,0.023429282,0.008931736,0.9442396,0.018425943,0.000050239127],"about_ca_topic_score_codex":0.0017898235,"about_ca_topic_score_gemma":0.0022665262,"teacher_disagreement_score":0.0067920736,"about_ca_system_score_codex":0.0017984932,"about_ca_system_score_gemma":0.0009420845,"threshold_uncertainty_score":0.022721708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94497794,0.00007600427,0.04854684,0.00010418237,0.00003354884,0.00003989738,0.00016191759,0.000255959,0.0058036647],"genre_scores_gemma":[0.97114146,0.00007553294,0.026008517,0.000072712784,0.000019666079,0.000027606347,0.00028588218,0.00010148047,0.0022671598],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994005,0.00007394332,0.000056817444,0.0001188208,0.00010433748,0.00024557323],"domain_scores_gemma":[0.99725574,0.0006133063,0.0006350199,0.000706855,0.00018874153,0.00060023594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045194692,0.00046184042,0.0007070724,0.00059694465,0.0013195436,0.0021184685,0.00069001125,0.0005984281,0.0050705047],"category_scores_gemma":[0.0023478812,0.0005156182,0.0005205875,0.0010273536,0.001030241,0.0030770982,0.0023409186,0.0006102572,0.0007556753],"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.0045249853,0.00093579205,0.10043535,0.0005574079,0.00026791746,0.0039770612,0.0033731929,0.16527379,0.2638505,0.2619524,0.012987782,0.18186392],"study_design_scores_gemma":[0.00015535604,0.0021602586,0.024426214,0.0001933206,0.00023180888,0.0060229013,0.0051677753,0.4077729,0.23091479,0.28109634,0.041667916,0.00019041829],"about_ca_topic_score_codex":0.00069346564,"about_ca_topic_score_gemma":0.0007294633,"teacher_disagreement_score":0.0050705047,"about_ca_system_score_codex":0.0006508171,"about_ca_system_score_gemma":0.0005524052,"threshold_uncertainty_score":0.016962528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6159974,0.00033111015,0.36246845,0.0008193777,0.000092663526,0.0003220122,0.0015530486,0.0009028847,0.017513096],"genre_scores_gemma":[0.88770413,0.00037498976,0.10082535,0.00012542197,0.00011072398,0.000155212,0.0034815113,0.00021795936,0.0070046717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989593,0.00023524633,0.000066352884,0.0003163473,0.0002350212,0.00018771399],"domain_scores_gemma":[0.9959766,0.0017638732,0.0005918626,0.000728111,0.0004354887,0.00050399196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085930707,0.0005437225,0.0005956968,0.00055660616,0.00048663004,0.0013390809,0.0008461673,0.0005680204,0.0047152666],"category_scores_gemma":[0.004159932,0.00038704232,0.0009320688,0.00082143635,0.001234408,0.0032361506,0.0013120732,0.0017304857,0.0005766472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076961005,0.0007801571,0.005884177,0.00060473644,0.00007906058,0.00093224697,0.0016859213,0.26606098,0.019612446,0.55412805,0.012098854,0.13736378],"study_design_scores_gemma":[0.00012831972,0.00018872553,0.0018397269,0.00007203632,0.000035908906,0.00032523007,0.00091561856,0.24313323,0.012460978,0.72432303,0.016523136,0.000054082993],"about_ca_topic_score_codex":0.0028117222,"about_ca_topic_score_gemma":0.0022248756,"teacher_disagreement_score":0.0047152666,"about_ca_system_score_codex":0.0009225251,"about_ca_system_score_gemma":0.000994948,"threshold_uncertainty_score":0.01577413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26796624,0.0014583791,0.677394,0.0026058815,0.0005711835,0.00025849105,0.0010351521,0.001958301,0.046752382],"genre_scores_gemma":[0.9176161,0.00026236824,0.077459894,0.00041009355,0.00041744576,0.0002700163,0.00034137294,0.00042892224,0.0027937866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948447,0.001860289,0.00029628148,0.0016386101,0.0009938849,0.00036619665],"domain_scores_gemma":[0.96201277,0.020819234,0.004963411,0.007188285,0.0030125044,0.0020037724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033194085,0.0009247014,0.0010630591,0.004856012,0.001371667,0.0042127785,0.002364191,0.0022028165,0.0065463595],"category_scores_gemma":[0.025735943,0.0006063597,0.00069923286,0.003402902,0.0063557606,0.0133113945,0.0033034976,0.0034957377,0.00079051737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022768373,0.00015232335,0.0069649457,0.00015005936,0.00006935219,0.00012984339,0.0007012932,0.019405292,0.01298613,0.930551,0.002363348,0.026298858],"study_design_scores_gemma":[0.00007521863,0.00037391766,0.0058482895,0.00016732316,0.0000968647,0.00059749646,0.00081140955,0.18700442,0.02188641,0.76015496,0.02269105,0.00029268663],"about_ca_topic_score_codex":0.0010996273,"about_ca_topic_score_gemma":0.00081994967,"teacher_disagreement_score":0.0065463595,"about_ca_system_score_codex":0.003297153,"about_ca_system_score_gemma":0.00088269927,"threshold_uncertainty_score":0.023922622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8883927,0.00034497213,0.08902398,0.00041577726,0.000043184216,0.000095449774,0.000824815,0.00019702407,0.020662088],"genre_scores_gemma":[0.9607993,0.00024706952,0.033775683,0.00012576053,0.000037063448,0.0000644681,0.00073984376,0.00007189947,0.004138875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.000069668655,0.000034575656,0.00016289287,0.00016024332,0.00012931487],"domain_scores_gemma":[0.9972241,0.0008895126,0.00037004467,0.00052595604,0.00046419978,0.000526221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728685,0.00035845186,0.00051960663,0.0013823577,0.0013109159,0.0016390269,0.00083128584,0.00035591537,0.004918735],"category_scores_gemma":[0.0017542946,0.0003949013,0.0004920226,0.0017746245,0.0008250095,0.0022601923,0.0013059891,0.0010525153,0.00031508403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010096154,0.00032294352,0.023593212,0.00050184823,0.000120484176,0.0006633936,0.0017515755,0.07482697,0.06154895,0.74166316,0.0078106956,0.086187124],"study_design_scores_gemma":[0.0000658739,0.00019218917,0.010528446,0.00006626638,0.00008702506,0.00079884165,0.0009074067,0.24296379,0.023630887,0.70515865,0.015544604,0.000056095992],"about_ca_topic_score_codex":0.002549503,"about_ca_topic_score_gemma":0.0036522904,"teacher_disagreement_score":0.004918735,"about_ca_system_score_codex":0.0015293726,"about_ca_system_score_gemma":0.00088513206,"threshold_uncertainty_score":0.016454756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97309136,0.00020106406,0.021110443,0.00012856802,0.000013224103,0.000015129284,0.00022866478,0.00010620491,0.0051053744],"genre_scores_gemma":[0.99463296,0.00007466226,0.0047128303,0.00002649195,0.000009680492,0.000017284949,0.00016620151,0.000016057795,0.0003439036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996294,0.00008175707,0.000020180194,0.000094321855,0.000060290615,0.000114074384],"domain_scores_gemma":[0.99561226,0.0029165251,0.0004967485,0.0002997487,0.0002684863,0.0004063172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034719615,0.00026110566,0.00041882385,0.00064003724,0.00057084643,0.0009088433,0.0006407782,0.00036595704,0.0018246303],"category_scores_gemma":[0.0025401902,0.0002502006,0.0002891363,0.00038053567,0.00068704237,0.001016892,0.00067551027,0.00047213378,0.000121169855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022153088,0.0004639317,0.071080916,0.0009973826,0.00025570323,0.0021815442,0.001858207,0.19285354,0.21125668,0.37175667,0.008718279,0.13636181],"study_design_scores_gemma":[0.00009983878,0.00032894447,0.03255224,0.00011096769,0.000207811,0.0024369024,0.0010783917,0.39187947,0.082988344,0.4818878,0.0063546514,0.000074617645],"about_ca_topic_score_codex":0.000569156,"about_ca_topic_score_gemma":0.0008448726,"teacher_disagreement_score":0.0018246303,"about_ca_system_score_codex":0.00038402324,"about_ca_system_score_gemma":0.00030636048,"threshold_uncertainty_score":0.006103933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25007567,0.00078364776,0.58100605,0.0014474511,0.00019403562,0.00006752358,0.00036865447,0.0006891741,0.16536784],"genre_scores_gemma":[0.92188585,0.0005316836,0.05980751,0.00028935852,0.00011816154,0.00008332308,0.00026294007,0.00014867607,0.016872548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940896,0.0001683556,0.00003143412,0.00009797887,0.00019049118,0.00010279826],"domain_scores_gemma":[0.99791175,0.0010509217,0.000259003,0.00029568918,0.00033919237,0.00014351588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003277061,0.00027498454,0.00024107643,0.00060993276,0.00054096954,0.0014119612,0.00066420797,0.00035826155,0.01400148],"category_scores_gemma":[0.002660823,0.00026773644,0.0002981747,0.00068124576,0.0013167163,0.0032777102,0.0012303324,0.0013421298,0.0011100459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006225476,0.000013113031,0.00037628022,0.00004670348,0.0000039560955,0.0002243174,0.00019510103,0.003165053,0.003988618,0.96791536,0.0027610902,0.02124812],"study_design_scores_gemma":[0.000042856627,0.00008965098,0.0013649572,0.00003771297,0.00001136837,0.0011020836,0.0005512528,0.03412656,0.013080902,0.914588,0.03496484,0.000039932143],"about_ca_topic_score_codex":0.00059852813,"about_ca_topic_score_gemma":0.0005602433,"teacher_disagreement_score":0.01400148,"about_ca_system_score_codex":0.00045559008,"about_ca_system_score_gemma":0.00020038358,"threshold_uncertainty_score":0.046839654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79028374,0.0013720425,0.16633408,0.0026266864,0.00013256726,0.000040130373,0.00030565233,0.0003207233,0.038584355],"genre_scores_gemma":[0.99075246,0.00029749097,0.0058533656,0.00009256852,0.00010373295,0.00002643353,0.00007312222,0.000076656564,0.0027242557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993155,0.00021911436,0.000019429559,0.00017743897,0.00016148793,0.00010704925],"domain_scores_gemma":[0.98493737,0.011355341,0.0014769966,0.00086075003,0.0006767596,0.0006928445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015821974,0.00043251395,0.0006437786,0.0023838696,0.00077878253,0.0019051324,0.0009842161,0.0007242626,0.0077588027],"category_scores_gemma":[0.017785937,0.0003412666,0.00033172267,0.0009540375,0.004282523,0.0049364013,0.001616158,0.0018273479,0.0005721884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019456033,0.000031792886,0.0019149744,0.00011553104,0.00001644512,0.00013948814,0.00027708273,0.016381374,0.0072569405,0.9639293,0.0014771685,0.008265369],"study_design_scores_gemma":[0.000029094303,0.000047107493,0.0014243572,0.00003859592,0.0000115079465,0.00021852653,0.000146549,0.04983461,0.0020512121,0.9445364,0.0016316224,0.000030480653],"about_ca_topic_score_codex":0.00043290047,"about_ca_topic_score_gemma":0.00035904007,"teacher_disagreement_score":0.0077588027,"about_ca_system_score_codex":0.0011253688,"about_ca_system_score_gemma":0.00035695327,"threshold_uncertainty_score":0.025955737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42547488,0.0004485003,0.556089,0.0016405381,0.00006341529,0.00017947447,0.0012444082,0.0012511767,0.013608655],"genre_scores_gemma":[0.7963875,0.00027378518,0.19180515,0.0003774915,0.000096172,0.00022067275,0.0028772783,0.00037524028,0.0075867414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990558,0.0001778258,0.000041981963,0.000304385,0.00018934748,0.00023058942],"domain_scores_gemma":[0.9941869,0.0035851768,0.000518708,0.00064514385,0.00044422323,0.000619856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011197728,0.0008283368,0.0006509961,0.0019922054,0.0012832694,0.002442054,0.0018022629,0.0010521449,0.0051005366],"category_scores_gemma":[0.0047751293,0.0006029969,0.0010750106,0.0017295575,0.0015530458,0.00317127,0.0016610617,0.0018968658,0.0005431579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009951593,0.00055392995,0.0071514524,0.00041479172,0.0001425807,0.00037644088,0.00065622665,0.14674674,0.018551353,0.6581945,0.022470158,0.14374673],"study_design_scores_gemma":[0.00010463902,0.000057841964,0.0011199021,0.0000376578,0.000027839771,0.00019740478,0.00010548768,0.3001732,0.0054693813,0.6885839,0.0040918794,0.000030815994],"about_ca_topic_score_codex":0.0044408008,"about_ca_topic_score_gemma":0.0031897922,"teacher_disagreement_score":0.0051005366,"about_ca_system_score_codex":0.0020130905,"about_ca_system_score_gemma":0.0013262344,"threshold_uncertainty_score":0.017063022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97528875,0.0002532018,0.013457064,0.0003418233,0.000019751176,0.0000103916045,0.00008576215,0.00005702452,0.01048616],"genre_scores_gemma":[0.9932595,0.00018868262,0.0045071165,0.00004709128,0.000018734154,0.000010514061,0.00016005393,0.000034213528,0.0017740609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997619,0.000059603095,0.000009528495,0.00005823955,0.0000584102,0.000052339543],"domain_scores_gemma":[0.99886036,0.0005024712,0.0002187576,0.000095357,0.00010557353,0.00021749057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703873,0.00044060985,0.00035500363,0.0011110716,0.0010171216,0.0014268626,0.0005848266,0.00076001236,0.002097097],"category_scores_gemma":[0.001922867,0.00034029648,0.0003348342,0.00067883387,0.0017203351,0.0016224417,0.00089803606,0.0007270582,0.00009868722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106443054,0.00006949281,0.0046280916,0.00014987176,0.000030814936,0.0010725089,0.0009811032,0.016536487,0.011994532,0.9542388,0.0017687525,0.00842313],"study_design_scores_gemma":[0.000050540693,0.000120429315,0.012152577,0.00011889185,0.000082559294,0.0013757435,0.0034838277,0.06423418,0.009039274,0.8984517,0.010842698,0.000047697245],"about_ca_topic_score_codex":0.0010392551,"about_ca_topic_score_gemma":0.0015656352,"teacher_disagreement_score":0.002097097,"about_ca_system_score_codex":0.00078651274,"about_ca_system_score_gemma":0.00028535846,"threshold_uncertainty_score":0.0070155263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84144175,0.0016414468,0.13216735,0.0023962646,0.0000707299,0.00014234464,0.00068755785,0.00048543434,0.020967098],"genre_scores_gemma":[0.95239687,0.00096181495,0.042235374,0.0003446401,0.00007163082,0.000090503476,0.0003852071,0.00008973822,0.0034242559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894506,0.00020421002,0.000058413483,0.00033331363,0.00023595568,0.0002230824],"domain_scores_gemma":[0.992939,0.0043107257,0.0015115167,0.0004178774,0.0003913312,0.00042947123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090613693,0.0006106092,0.0009404522,0.0018294341,0.0011823716,0.0016353879,0.0015697873,0.0015491608,0.006342292],"category_scores_gemma":[0.008257782,0.0007765242,0.0006251885,0.0021862295,0.0012650063,0.004250363,0.0021781318,0.001145191,0.00063109514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012493083,0.0004016196,0.012925046,0.001275781,0.00025440223,0.0015419516,0.001219331,0.24316975,0.061854083,0.5865275,0.008970058,0.08061115],"study_design_scores_gemma":[0.0001860297,0.00021387784,0.0051258137,0.00011198668,0.00014548846,0.0011985321,0.0005921864,0.20926923,0.01870954,0.75325125,0.011117281,0.00007887713],"about_ca_topic_score_codex":0.0013890842,"about_ca_topic_score_gemma":0.0019484626,"teacher_disagreement_score":0.006342292,"about_ca_system_score_codex":0.0011399363,"about_ca_system_score_gemma":0.0004746547,"threshold_uncertainty_score":0.021217108},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8782135,0.00084463035,0.059959587,0.006883617,0.00008733591,0.000049784147,0.00042966433,0.00031607406,0.053215753],"genre_scores_gemma":[0.9927785,0.00023506625,0.003886293,0.0004031257,0.00003128119,0.00005702699,0.00014998156,0.000037756217,0.0024211046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885035,0.00028157115,0.000042441134,0.00027910937,0.00023506438,0.00031151334],"domain_scores_gemma":[0.9905896,0.0062945373,0.00068344636,0.0009725156,0.00067592185,0.00078391033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013683098,0.0004719133,0.0011166591,0.0014033929,0.0018005128,0.0026416164,0.0012582858,0.0015261772,0.0058809905],"category_scores_gemma":[0.01133715,0.000490969,0.0005657619,0.0011452258,0.00335816,0.006676741,0.0027844778,0.0019162646,0.00041037393],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020453996,0.000047257374,0.0019346838,0.000098400065,0.000016579219,0.00020725201,0.0007045046,0.01250512,0.00243757,0.9724887,0.0038795285,0.0054757707],"study_design_scores_gemma":[0.000041564323,0.000023135266,0.00087723014,0.000029661314,0.000009009634,0.00014119873,0.0004402402,0.03357045,0.001672249,0.9589998,0.004178677,0.000016819053],"about_ca_topic_score_codex":0.0031747627,"about_ca_topic_score_gemma":0.0025625254,"teacher_disagreement_score":0.0058809905,"about_ca_system_score_codex":0.0017459017,"about_ca_system_score_gemma":0.00064748555,"threshold_uncertainty_score":0.019673824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5895427,0.00026191736,0.39521745,0.002063797,0.00011317268,0.0002753433,0.0006562992,0.0009111798,0.010958083],"genre_scores_gemma":[0.9508264,0.00008768364,0.044966236,0.0002592328,0.00004114795,0.00009226663,0.0004457702,0.00005364939,0.0032275966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985417,0.00041989042,0.000074829106,0.0004772704,0.0001719023,0.00031440062],"domain_scores_gemma":[0.9928451,0.0046152007,0.00066050113,0.0011324283,0.00029725116,0.00044954746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012595796,0.00036612523,0.00047623776,0.0003502576,0.0009601979,0.001506373,0.0012146074,0.0008486656,0.0032628665],"category_scores_gemma":[0.0046727653,0.00037690692,0.00078980235,0.0005402744,0.0025115397,0.0035307424,0.0014209341,0.0020769255,0.00024333144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014671957,0.00071359554,0.009107129,0.0005200059,0.00014200795,0.001381481,0.00162357,0.34781608,0.029431092,0.48475245,0.009175926,0.11386949],"study_design_scores_gemma":[0.0001570242,0.00025562104,0.002253169,0.00004768787,0.00004987871,0.00042269606,0.00084749697,0.39521486,0.0183946,0.57482916,0.007463182,0.00006479356],"about_ca_topic_score_codex":0.003334396,"about_ca_topic_score_gemma":0.0022356203,"teacher_disagreement_score":0.003334396,"about_ca_system_score_codex":0.0017684241,"about_ca_system_score_gemma":0.0011315293,"threshold_uncertainty_score":0.012830853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.607539,0.0009114018,0.34854922,0.00070504984,0.00010779441,0.00016352709,0.0014203843,0.0006047991,0.03999882],"genre_scores_gemma":[0.9355602,0.0007083762,0.056563888,0.000105980085,0.000054346834,0.00008725137,0.0010997104,0.00007765998,0.0057425825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990226,0.00037162492,0.00003641982,0.00015662455,0.00032430122,0.00008835498],"domain_scores_gemma":[0.99739933,0.0010435735,0.0005042332,0.0004971326,0.00035998292,0.00019564644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005878306,0.00048032057,0.00042659385,0.001126296,0.0005377162,0.001497327,0.0006138585,0.0005960396,0.0041102706],"category_scores_gemma":[0.0047163093,0.00044792946,0.00033486166,0.0017943325,0.0008462967,0.0013435731,0.0006915501,0.0007205142,0.0003902337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019217197,0.00006982166,0.0035867412,0.00016422156,0.00006903171,0.00072574004,0.0004549815,0.17258988,0.00898132,0.76621825,0.007199261,0.039748646],"study_design_scores_gemma":[0.00013427273,0.00019850262,0.005882606,0.000083492865,0.000067754976,0.0009922638,0.00034821787,0.35790226,0.007993445,0.5942871,0.032053724,0.000056411885],"about_ca_topic_score_codex":0.0014355137,"about_ca_topic_score_gemma":0.0018239322,"teacher_disagreement_score":0.0041102706,"about_ca_system_score_codex":0.0008512991,"about_ca_system_score_gemma":0.00024438027,"threshold_uncertainty_score":0.013750255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8645391,0.00046498945,0.10120373,0.0019788276,0.00010960297,0.00005349646,0.00053065096,0.00030953935,0.030810107],"genre_scores_gemma":[0.99284947,0.00009639982,0.0040805405,0.00013178177,0.000046800003,0.0000308013,0.0001258123,0.000031531974,0.0026068068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911875,0.00024504203,0.000024864145,0.00024486147,0.00020615627,0.00016023406],"domain_scores_gemma":[0.9939534,0.0034606413,0.00060265814,0.0008983688,0.00052523636,0.00055973546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259426,0.0002506184,0.00054160727,0.0013170782,0.0012409284,0.0015294593,0.00080435333,0.0006967278,0.006291368],"category_scores_gemma":[0.0074936454,0.0002582737,0.000435061,0.000682393,0.0026832677,0.0024093622,0.0011756608,0.00090992165,0.00026098348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004291553,0.000043329925,0.004508466,0.000111621266,0.00004715343,0.00016944674,0.00024174637,0.038459335,0.014968061,0.9303495,0.002843617,0.0078284275],"study_design_scores_gemma":[0.000049940056,0.00008178754,0.0039695785,0.000028230046,0.000031204097,0.0003817994,0.0001556583,0.131003,0.0068331677,0.8527251,0.0046931887,0.00004739245],"about_ca_topic_score_codex":0.0024578972,"about_ca_topic_score_gemma":0.0018503001,"teacher_disagreement_score":0.006291368,"about_ca_system_score_codex":0.0020906606,"about_ca_system_score_gemma":0.00065445673,"threshold_uncertainty_score":0.021046698},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80826926,0.0032403907,0.12185196,0.0039904476,0.0002850721,0.00008040867,0.00037492186,0.0003800398,0.06152749],"genre_scores_gemma":[0.98135835,0.00060164795,0.01311656,0.00023295266,0.00016420243,0.00004500344,0.0001271625,0.00003094218,0.004323108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993616,0.0001464092,0.000043829157,0.0001577539,0.00020087312,0.00008956014],"domain_scores_gemma":[0.99697924,0.0014491868,0.0005786149,0.00036103194,0.00035978376,0.0002722333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073257665,0.00033097022,0.00040044976,0.0012818999,0.0010292395,0.0020826824,0.00083074934,0.0010775616,0.0051899445],"category_scores_gemma":[0.0045069316,0.00039659467,0.00038766363,0.0013843918,0.0019508656,0.0042590173,0.0014637705,0.0010924252,0.0003303221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006623116,0.000038424547,0.0012330166,0.00013386171,0.00001929331,0.00017842892,0.000351579,0.005006101,0.0033342736,0.97692525,0.002131672,0.010581884],"study_design_scores_gemma":[0.000016060889,0.000021530164,0.0005188463,0.000028749584,0.00000983959,0.00018522472,0.00015196859,0.014290772,0.0018310138,0.9779574,0.004979229,0.000009309817],"about_ca_topic_score_codex":0.0008866223,"about_ca_topic_score_gemma":0.0009850557,"teacher_disagreement_score":0.0051899445,"about_ca_system_score_codex":0.001240936,"about_ca_system_score_gemma":0.00042128866,"threshold_uncertainty_score":0.017362118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9511895,0.0003104683,0.034387447,0.0009352604,0.00003608569,0.000021102725,0.00023464944,0.00022754545,0.012657893],"genre_scores_gemma":[0.99650097,0.00008207834,0.0021789141,0.00014746735,0.000022669201,0.000020829466,0.000111635476,0.000019145828,0.00091627066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993261,0.0002128545,0.00003145088,0.00015886489,0.0001294501,0.00014121787],"domain_scores_gemma":[0.99389124,0.0035809537,0.001009156,0.00053960725,0.0005031353,0.0004758729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008710091,0.00031054564,0.0005832193,0.0012306707,0.0012812713,0.0013867862,0.0006960811,0.00085403793,0.003418684],"category_scores_gemma":[0.0070183324,0.00040745735,0.0006644812,0.00070732506,0.0025437316,0.0018506742,0.0012142493,0.0009919887,0.00027242873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068298663,0.00014246824,0.01717488,0.00024272922,0.00012021573,0.0005974761,0.000943473,0.033680633,0.012320566,0.9067345,0.006619446,0.020740567],"study_design_scores_gemma":[0.000083361905,0.00011740641,0.0067013777,0.00006208966,0.000064471846,0.0007103224,0.00044057626,0.08932359,0.0057773404,0.89211696,0.0045509282,0.00005164786],"about_ca_topic_score_codex":0.0016545824,"about_ca_topic_score_gemma":0.0014185004,"teacher_disagreement_score":0.003418684,"about_ca_system_score_codex":0.00091720204,"about_ca_system_score_gemma":0.00045063486,"threshold_uncertainty_score":0.011436641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81325907,0.0014872001,0.12517744,0.0025020377,0.0002445455,0.000111811474,0.0006560911,0.00034607403,0.056215834],"genre_scores_gemma":[0.98308575,0.0006382748,0.011863303,0.00022732056,0.00018584159,0.00009662488,0.00036391293,0.00013975608,0.0033992275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998987,0.00025140456,0.000026807737,0.00023399558,0.00023809973,0.00026268844],"domain_scores_gemma":[0.9889338,0.0071803606,0.0009998912,0.00093756884,0.00076938135,0.0011790365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012139948,0.0006373546,0.0011855334,0.0025318458,0.0016881067,0.002257364,0.0013293662,0.0009766184,0.006353252],"category_scores_gemma":[0.009645633,0.0005036384,0.0005604102,0.0010307167,0.0025749907,0.0033116767,0.0020060493,0.0021399588,0.0007989294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080132997,0.00015034569,0.011884123,0.00045550955,0.000084603416,0.0010654444,0.0009012495,0.032601316,0.031439103,0.8702115,0.01516304,0.035242487],"study_design_scores_gemma":[0.00007227709,0.00020968553,0.009525713,0.00015300332,0.00007249704,0.001884811,0.00044794168,0.20650473,0.028064243,0.73586625,0.01710885,0.00009008044],"about_ca_topic_score_codex":0.00049600855,"about_ca_topic_score_gemma":0.00041412146,"teacher_disagreement_score":0.006353252,"about_ca_system_score_codex":0.0011468414,"about_ca_system_score_gemma":0.0003950958,"threshold_uncertainty_score":0.021253765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35999414,0.0011325858,0.61523426,0.0026733996,0.00013611036,0.0001399454,0.0004699188,0.0010783396,0.019141369],"genre_scores_gemma":[0.9221533,0.0003242022,0.07435153,0.0002846438,0.00012518399,0.000097548254,0.0002591353,0.00028704022,0.002117479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777067,0.0007526289,0.00007605492,0.00052519876,0.00057183404,0.0003036443],"domain_scores_gemma":[0.9815885,0.013065222,0.0008990341,0.0030393186,0.0006883562,0.0007195168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002306109,0.00055690494,0.0007704745,0.0012747293,0.0011658975,0.0021252432,0.0024299184,0.0009257698,0.0046348497],"category_scores_gemma":[0.01452101,0.0007161891,0.00088773645,0.001182941,0.003574773,0.006852401,0.003953636,0.002532383,0.00039331638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056750997,0.00018536214,0.0045538894,0.00033668973,0.00011446226,0.00022267077,0.0006811237,0.08493803,0.02459407,0.82464856,0.005016361,0.054141305],"study_design_scores_gemma":[0.000045490706,0.00007796735,0.000619678,0.00003985587,0.00003750863,0.00012307313,0.000115722956,0.26583928,0.006876161,0.72158384,0.0046135797,0.000027914299],"about_ca_topic_score_codex":0.0017668103,"about_ca_topic_score_gemma":0.0020887444,"teacher_disagreement_score":0.0046348497,"about_ca_system_score_codex":0.0011251636,"about_ca_system_score_gemma":0.0009175189,"threshold_uncertainty_score":0.015505135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8202022,0.00042539064,0.15706326,0.0013086988,0.000057081423,0.000105409374,0.0010538319,0.00057055004,0.019213479],"genre_scores_gemma":[0.97181183,0.00014634508,0.024823181,0.00024111939,0.000041937325,0.00007673716,0.0006366851,0.00012478212,0.0020972833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975325,0.0005429883,0.0002263635,0.00070842134,0.0005451665,0.00044445196],"domain_scores_gemma":[0.98724014,0.006584877,0.0016908154,0.0025853259,0.00066792703,0.0012309892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014844503,0.000513219,0.0009176767,0.0012401238,0.0016761683,0.0018374614,0.0014216793,0.0010517807,0.006190232],"category_scores_gemma":[0.011173346,0.0007433107,0.0009157381,0.0014944259,0.0026681633,0.005664134,0.002964142,0.0024616367,0.0005009307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016386497,0.00030294908,0.014015515,0.0004964924,0.00010401806,0.0014661717,0.0022334263,0.09875208,0.033244886,0.7893531,0.0050028735,0.053389918],"study_design_scores_gemma":[0.00011021228,0.00012162018,0.0028870718,0.00006711548,0.000044945125,0.0010302155,0.0005116866,0.107772715,0.008911242,0.8724741,0.006009051,0.00006002067],"about_ca_topic_score_codex":0.0011081124,"about_ca_topic_score_gemma":0.0010215952,"teacher_disagreement_score":0.006190232,"about_ca_system_score_codex":0.0017696704,"about_ca_system_score_gemma":0.0005725365,"threshold_uncertainty_score":0.020708442},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33645338,0.0010600646,0.6331859,0.0010490613,0.00014211291,0.00017582826,0.0005981143,0.00093752315,0.026397983],"genre_scores_gemma":[0.803402,0.0009640036,0.19099765,0.00038816532,0.000087441455,0.00014302421,0.0004146814,0.00022333812,0.003379603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985801,0.00033272794,0.000095129355,0.00037314932,0.00029681536,0.00032221092],"domain_scores_gemma":[0.99145997,0.004358458,0.0009503633,0.0018251281,0.00077492156,0.00063112285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014071206,0.0005502525,0.0005471829,0.0009331146,0.0009789617,0.0013825308,0.001220855,0.00056401663,0.0043918006],"category_scores_gemma":[0.007580799,0.0006161865,0.0007658748,0.0013532863,0.0017372114,0.0029726771,0.0016221954,0.0013058952,0.00045774333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011166875,0.0003533148,0.012528351,0.0009335667,0.00012696402,0.0005137411,0.0009253763,0.11885312,0.072038956,0.68401825,0.010082539,0.098509125],"study_design_scores_gemma":[0.00016511527,0.00028899396,0.0037063863,0.00013680132,0.00017351491,0.0010766775,0.00039564882,0.33344087,0.0399754,0.60137194,0.019172037,0.000096630865],"about_ca_topic_score_codex":0.002555065,"about_ca_topic_score_gemma":0.004723054,"teacher_disagreement_score":0.0043918006,"about_ca_system_score_codex":0.0012041264,"about_ca_system_score_gemma":0.0010194941,"threshold_uncertainty_score":0.0146920085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4623529,0.0003724005,0.49979225,0.0010915294,0.00010985214,0.0002514766,0.00019901556,0.00026814308,0.03556248],"genre_scores_gemma":[0.91978604,0.00023118519,0.07294935,0.00018298703,0.000041659812,0.00021893266,0.00012905049,0.000073273695,0.006387521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981623,0.00077988184,0.00006868522,0.00034491744,0.00034024214,0.00030405913],"domain_scores_gemma":[0.99522215,0.0027210943,0.00034457791,0.0006845643,0.00037026807,0.0006574425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528707,0.0006263106,0.00075810234,0.00054148334,0.0011629255,0.0023001288,0.0015134125,0.0009591203,0.0038495648],"category_scores_gemma":[0.005560333,0.00055637065,0.0006302591,0.00072204776,0.0036372358,0.004574963,0.002246282,0.0022788804,0.0003065869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027032677,0.0001124412,0.0011037618,0.00008914108,0.000030045216,0.0001445307,0.0005216975,0.04409649,0.0053174105,0.93752867,0.0014105001,0.009375022],"study_design_scores_gemma":[0.00010307511,0.00010412069,0.00054147874,0.000032910684,0.000035127046,0.00018793666,0.00022810971,0.2546786,0.0035151022,0.7347448,0.005796168,0.000032539236],"about_ca_topic_score_codex":0.00369072,"about_ca_topic_score_gemma":0.0031578136,"teacher_disagreement_score":0.0038495648,"about_ca_system_score_codex":0.0017175621,"about_ca_system_score_gemma":0.0012613396,"threshold_uncertainty_score":0.01287806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350215,0.00033000123,0.053050667,0.0005050235,0.00005142615,0.00002023634,0.00030158286,0.00027653904,0.01044315],"genre_scores_gemma":[0.98923254,0.00017045504,0.009257596,0.00011549227,0.00008387471,0.000026772046,0.00018623561,0.000065401226,0.0008616557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921334,0.00019237537,0.00003288732,0.00017662904,0.00021527542,0.00016945896],"domain_scores_gemma":[0.9880987,0.0071105957,0.001335314,0.0014633576,0.0008905193,0.0011015737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011029936,0.0002565232,0.0010440999,0.0017703361,0.0010542343,0.001969397,0.00094594795,0.0008192569,0.00283706],"category_scores_gemma":[0.010108783,0.0003386193,0.0005512665,0.0013805361,0.0020190245,0.0029329124,0.0010090874,0.0011963106,0.0002620419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011355149,0.0002205582,0.015590618,0.00035909135,0.000107090695,0.00079982076,0.0010156266,0.08860174,0.05431972,0.7838855,0.005054126,0.048910614],"study_design_scores_gemma":[0.00006520644,0.00017380575,0.009632211,0.000040326217,0.000073062096,0.0007396405,0.00029071877,0.14100522,0.009516108,0.835108,0.0033040133,0.00005166032],"about_ca_topic_score_codex":0.00076019776,"about_ca_topic_score_gemma":0.0010669194,"teacher_disagreement_score":0.00283706,"about_ca_system_score_codex":0.0009874937,"about_ca_system_score_gemma":0.0005577437,"threshold_uncertainty_score":0.009490907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9542077,0.00041737774,0.029674536,0.00055854087,0.000023216538,0.00003883447,0.0008672045,0.00016657854,0.014046068],"genre_scores_gemma":[0.9900231,0.00015364544,0.0076447614,0.000062039784,0.000047454727,0.000034600947,0.00060384755,0.000029519255,0.0014010465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901617,0.00017535097,0.000034881803,0.0002423578,0.00026480443,0.00026636562],"domain_scores_gemma":[0.9921312,0.005433524,0.00083229016,0.0005376345,0.0003209585,0.00074438995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070684194,0.00051842106,0.0007099684,0.0018647051,0.0014984858,0.0018287565,0.001091879,0.0009109795,0.005017516],"category_scores_gemma":[0.005099823,0.0006161753,0.0006113773,0.0019395578,0.0016251002,0.0024916811,0.001263431,0.0009963342,0.0002511281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025538674,0.00065591687,0.050436508,0.0009156559,0.00042253642,0.0023960967,0.0019829918,0.19802243,0.06222633,0.5951726,0.016914435,0.06830067],"study_design_scores_gemma":[0.00013872456,0.00019736036,0.028338024,0.000099520985,0.00013439223,0.0020144058,0.00051677186,0.4212068,0.02264531,0.51480514,0.009827393,0.00007613035],"about_ca_topic_score_codex":0.0024096854,"about_ca_topic_score_gemma":0.0025298789,"teacher_disagreement_score":0.005017516,"about_ca_system_score_codex":0.001368985,"about_ca_system_score_gemma":0.0005264851,"threshold_uncertainty_score":0.016785264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90049344,0.00019994061,0.08126292,0.00014100135,0.000043726443,0.000047649606,0.00022529032,0.00021271533,0.01737332],"genre_scores_gemma":[0.9680958,0.000105356514,0.028431738,0.000065570115,0.000030297391,0.000030238882,0.00034647717,0.00006427405,0.0028302006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930036,0.00013965665,0.000049555874,0.00014667022,0.00018181928,0.00018198755],"domain_scores_gemma":[0.99802446,0.00063451414,0.0004894388,0.00025634473,0.0001954633,0.00039980427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037264056,0.00026787457,0.0004550031,0.0008255702,0.0009043403,0.0015059478,0.00043657882,0.0005595445,0.0047062566],"category_scores_gemma":[0.001967048,0.0006222074,0.00046220535,0.0007677997,0.0013092185,0.0015849121,0.0012713548,0.00069018616,0.00037280167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050670037,0.0001160533,0.0101615945,0.00016030605,0.000053347594,0.0010721952,0.0010301457,0.02714284,0.029620962,0.89669055,0.0025006877,0.030944709],"study_design_scores_gemma":[0.000107254804,0.00026262985,0.00919573,0.00007744881,0.00007498117,0.0016857617,0.0013767253,0.09078972,0.023493897,0.8540212,0.018850246,0.00006444749],"about_ca_topic_score_codex":0.00069520395,"about_ca_topic_score_gemma":0.0011905523,"teacher_disagreement_score":0.0047062566,"about_ca_system_score_codex":0.000698253,"about_ca_system_score_gemma":0.00028747175,"threshold_uncertainty_score":0.01574403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665841,0.001400042,0.3279877,0.009581617,0.00050483964,0.00018245218,0.0016690599,0.0011571498,0.09093314],"genre_scores_gemma":[0.9753947,0.00052313745,0.015239501,0.001005774,0.0002336017,0.00011577011,0.0008383737,0.000070432674,0.006578786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00021019788,0.000037868373,0.00021062024,0.00019509511,0.00021905197],"domain_scores_gemma":[0.9967098,0.0017285771,0.0003325361,0.00033890986,0.0005373703,0.0003527521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013393448,0.0006515699,0.00048500992,0.0013395024,0.0015025809,0.0017820275,0.0009139381,0.001114933,0.010293401],"category_scores_gemma":[0.0054302285,0.00050312525,0.0011472999,0.0009879081,0.0027761857,0.0043691327,0.002673788,0.0019425757,0.00071885996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013472029,0.00004703373,0.0025938577,0.00013549415,0.0000308924,0.00025560276,0.00036938454,0.012499056,0.0033759265,0.9604294,0.007880132,0.012248584],"study_design_scores_gemma":[0.000046170837,0.000050870814,0.0014006617,0.00004864888,0.000026156773,0.00023310122,0.00024089709,0.02386796,0.0029201426,0.9590728,0.012062046,0.000030412204],"about_ca_topic_score_codex":0.00235743,"about_ca_topic_score_gemma":0.0015069233,"teacher_disagreement_score":0.010293401,"about_ca_system_score_codex":0.0012611035,"about_ca_system_score_gemma":0.00066509127,"threshold_uncertainty_score":0.034434855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65580624,0.0019273735,0.23456106,0.0028517714,0.00020030898,0.00016405858,0.0007234964,0.0006722727,0.10309347],"genre_scores_gemma":[0.9836137,0.000462253,0.011223663,0.00033818942,0.0000821843,0.00007263884,0.00030497598,0.000108926775,0.003793416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923337,0.00010906059,0.000017922746,0.00012858484,0.00029671824,0.00021444882],"domain_scores_gemma":[0.9928296,0.004702832,0.00041820714,0.00046310847,0.00074396766,0.00084226637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006892367,0.0006587747,0.0006553106,0.0019055116,0.0014329391,0.0014623104,0.0017332623,0.0011608668,0.013327405],"category_scores_gemma":[0.007997443,0.0006146403,0.0005266159,0.0009827282,0.0020504654,0.0029624188,0.0024191698,0.0016376948,0.00091933116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032201596,0.00012715407,0.0066856765,0.0003637684,0.00005910129,0.00069571135,0.00097273657,0.03411756,0.020081317,0.9054093,0.010468045,0.020697625],"study_design_scores_gemma":[0.000058662445,0.00011871043,0.003662234,0.00013399696,0.00006265618,0.0010065436,0.0005275559,0.2071103,0.012216094,0.76145,0.013596863,0.000056384844],"about_ca_topic_score_codex":0.0027892457,"about_ca_topic_score_gemma":0.0021742159,"teacher_disagreement_score":0.013327405,"about_ca_system_score_codex":0.0015902157,"about_ca_system_score_gemma":0.00049645576,"threshold_uncertainty_score":0.044584572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68227786,0.00066353043,0.26762578,0.0004892301,0.00007211851,0.00007833132,0.0006793867,0.0004213925,0.047692455],"genre_scores_gemma":[0.96095216,0.00036271705,0.030286983,0.00017659111,0.000040546176,0.000072751915,0.00039069427,0.000053817246,0.007663698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995596,0.000107868495,0.000023889608,0.00011081368,0.000087153356,0.00011076434],"domain_scores_gemma":[0.998448,0.0007149668,0.0002423778,0.00018334831,0.00021697224,0.00019428892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026857655,0.00027610734,0.00028956807,0.000852066,0.0006158101,0.0010860282,0.00025202087,0.000495888,0.005663833],"category_scores_gemma":[0.0020318253,0.00036470042,0.00025171542,0.0007515853,0.0010238102,0.0020959359,0.0009833233,0.0004981532,0.0004323128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018281516,0.000036766287,0.0034981994,0.0001338617,0.00002634586,0.00050668884,0.00067293044,0.025504384,0.011690723,0.91350734,0.0029018146,0.041338086],"study_design_scores_gemma":[0.000030674964,0.000094754265,0.0029491077,0.000102677004,0.000026200782,0.00088154443,0.00056722015,0.08182913,0.008466206,0.8725029,0.03251094,0.0000385135],"about_ca_topic_score_codex":0.0010284607,"about_ca_topic_score_gemma":0.0013425141,"teacher_disagreement_score":0.005663833,"about_ca_system_score_codex":0.0006947205,"about_ca_system_score_gemma":0.00037732537,"threshold_uncertainty_score":0.018947423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9335681,0.00025455127,0.036463987,0.000762247,0.00007893275,0.00003410861,0.00042273698,0.000260925,0.02815441],"genre_scores_gemma":[0.9863905,0.00012968686,0.008294655,0.00013935825,0.00002455755,0.000027208876,0.0003345139,0.000049040988,0.004610489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961215,0.00007173521,0.00001488762,0.00008890546,0.00009374334,0.000118578886],"domain_scores_gemma":[0.99637336,0.0018791775,0.00040155026,0.00043238787,0.00044074672,0.0004727341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034536034,0.000287988,0.00034969285,0.0011075273,0.0010843916,0.0013402981,0.00083010324,0.0005997462,0.005979916],"category_scores_gemma":[0.0018179457,0.0004497416,0.00030618618,0.00090692384,0.0013267884,0.0015874616,0.0011202391,0.0009196987,0.0004243831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009866549,0.00024683448,0.016231563,0.00034030929,0.000094144576,0.001513145,0.00094538555,0.03634791,0.08285063,0.82135284,0.012830559,0.026260003],"study_design_scores_gemma":[0.00030549802,0.00021090443,0.016648488,0.00009417748,0.00011299487,0.0014632911,0.0011038046,0.10495466,0.044511355,0.8072132,0.023269627,0.000111869675],"about_ca_topic_score_codex":0.0045329547,"about_ca_topic_score_gemma":0.0081102615,"teacher_disagreement_score":0.005979916,"about_ca_system_score_codex":0.0011020981,"about_ca_system_score_gemma":0.00043824504,"threshold_uncertainty_score":0.020004869},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7820522,0.0012315303,0.1451225,0.0031099324,0.00009811105,0.0000688322,0.0015395554,0.0013897745,0.0653876],"genre_scores_gemma":[0.9880602,0.00030177567,0.0077477023,0.00021597603,0.00007725815,0.000035867983,0.0006308534,0.00007050573,0.0028598236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993315,0.0001641477,0.000034028562,0.00017145125,0.00015051538,0.00014844154],"domain_scores_gemma":[0.9924475,0.004697708,0.00079835625,0.00057706825,0.0010393207,0.00044002745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004647574,0.00022170751,0.00032412919,0.0012535905,0.00113017,0.0016733373,0.0006093149,0.0004635385,0.006502002],"category_scores_gemma":[0.0050722295,0.00026623585,0.0003233437,0.0011568365,0.0011389154,0.0030249776,0.0012403877,0.0010239147,0.0007529692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009161358,0.00023552764,0.029042892,0.0006892542,0.00010712456,0.0014354116,0.002219356,0.05208425,0.029621942,0.76563734,0.02762344,0.09038728],"study_design_scores_gemma":[0.000077879035,0.00015071307,0.0047963457,0.000093529474,0.00006870802,0.0008081027,0.00066840806,0.101213805,0.009512791,0.8660315,0.016540667,0.000037499678],"about_ca_topic_score_codex":0.0018165385,"about_ca_topic_score_gemma":0.0022580128,"teacher_disagreement_score":0.006502002,"about_ca_system_score_codex":0.0011227343,"about_ca_system_score_gemma":0.00045123554,"threshold_uncertainty_score":0.021751344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8866116,0.00025472787,0.10145025,0.00026926957,0.000037626723,0.00010192599,0.00045249166,0.0002908149,0.010531282],"genre_scores_gemma":[0.9746106,0.000082473634,0.02335315,0.00009538366,0.000021934624,0.000076205186,0.00027587864,0.000048620852,0.0014357488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895966,0.00022482999,0.00010059114,0.0002857007,0.00021659849,0.0002126069],"domain_scores_gemma":[0.99262404,0.004113378,0.001018198,0.0011081491,0.00031917184,0.00081710255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089953863,0.00044127228,0.0005147907,0.0007640914,0.0005858654,0.001385226,0.0010573816,0.0006483581,0.0034363775],"category_scores_gemma":[0.0044950712,0.0004910429,0.00070243474,0.0010522782,0.0012332851,0.0020085224,0.0017150333,0.0011474245,0.00025767062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033162395,0.0006237054,0.0334926,0.00081178354,0.00030476495,0.0036648917,0.0018624337,0.2794922,0.18901744,0.3624965,0.0040659886,0.12085152],"study_design_scores_gemma":[0.00039175016,0.0006766548,0.020244421,0.00011369174,0.00023754913,0.0022836043,0.00093947485,0.4426916,0.06355884,0.4582021,0.010471701,0.00018866167],"about_ca_topic_score_codex":0.0010717859,"about_ca_topic_score_gemma":0.0013421106,"teacher_disagreement_score":0.0034363775,"about_ca_system_score_codex":0.00080700667,"about_ca_system_score_gemma":0.00037288162,"threshold_uncertainty_score":0.011495829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47470972,0.0071841003,0.26383603,0.017996052,0.00044411304,0.00017770969,0.002517218,0.0012514705,0.2318836],"genre_scores_gemma":[0.9467706,0.0018668448,0.0350768,0.0008835511,0.0003741344,0.00013232409,0.0009356283,0.0003866551,0.01357361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841595,0.00021311583,0.000051379728,0.00040546973,0.00042378457,0.0004902321],"domain_scores_gemma":[0.9860249,0.009834797,0.0007730802,0.0013513139,0.00080392807,0.0012119641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221684,0.00081735663,0.001100374,0.0020180927,0.0026289595,0.0035060265,0.0030746008,0.0013665915,0.010857365],"category_scores_gemma":[0.01122301,0.0005524823,0.0012926174,0.002283733,0.0043829484,0.008777922,0.0033284603,0.0055218916,0.0012926876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011582015,0.00031046852,0.0077461703,0.0007087751,0.00007826081,0.0004006275,0.0009580777,0.04462103,0.014414477,0.8673538,0.018966194,0.043283828],"study_design_scores_gemma":[0.00009379375,0.0001039391,0.0024936465,0.00013149562,0.000087965156,0.00037007665,0.00018432598,0.114134766,0.0059573357,0.8658967,0.010497742,0.000048303544],"about_ca_topic_score_codex":0.005767351,"about_ca_topic_score_gemma":0.009689831,"teacher_disagreement_score":0.010857365,"about_ca_system_score_codex":0.0056508775,"about_ca_system_score_gemma":0.0017005516,"threshold_uncertainty_score":0.041000187},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2501619,0.018458711,0.29448456,0.03356585,0.003201459,0.00028409608,0.0031270515,0.0025525987,0.39416388],"genre_scores_gemma":[0.9359565,0.004210396,0.031196805,0.0027507935,0.0031852117,0.0002249291,0.0014617577,0.0006320552,0.020381564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963882,0.00040627262,0.00007636993,0.0010594166,0.0007785076,0.0012913238],"domain_scores_gemma":[0.97151136,0.01983908,0.0013611022,0.0026421298,0.0017899022,0.0028564176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036888078,0.002277231,0.0020410283,0.0033660128,0.0029335609,0.0061880997,0.0046493514,0.0022241129,0.015979623],"category_scores_gemma":[0.019020593,0.0008392108,0.002423934,0.0028850273,0.005741399,0.01078029,0.005789445,0.009838641,0.0033029232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027867286,0.00077569456,0.012521905,0.0014621812,0.00028671903,0.0008736635,0.0009299422,0.09305696,0.018365178,0.72019815,0.08772231,0.061020635],"study_design_scores_gemma":[0.00020552598,0.00030101452,0.0045804586,0.0004704321,0.0002681679,0.0005639358,0.00027692452,0.22896168,0.0084511675,0.7301538,0.025623884,0.00014302041],"about_ca_topic_score_codex":0.007093694,"about_ca_topic_score_gemma":0.007151634,"teacher_disagreement_score":0.015979623,"about_ca_system_score_codex":0.0072591687,"about_ca_system_score_gemma":0.002654805,"threshold_uncertainty_score":0.05345714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21579804,0.015756225,0.4044952,0.028247377,0.0022272188,0.0002811492,0.0025696433,0.0019387476,0.32868633],"genre_scores_gemma":[0.91918546,0.0043406384,0.045899983,0.002536308,0.0023289844,0.00022465245,0.0011922877,0.0006136221,0.023678096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971929,0.00032007115,0.00006639619,0.0008060013,0.0006142697,0.0010003488],"domain_scores_gemma":[0.9828198,0.010989259,0.0009772012,0.0021452315,0.0012617109,0.001806697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034416968,0.0019217957,0.0017311554,0.0026502046,0.0028561756,0.005421878,0.004361941,0.0021719807,0.015619481],"category_scores_gemma":[0.01567983,0.0006349924,0.0019620012,0.0029725034,0.005171289,0.009019866,0.0051310263,0.0070803063,0.0031338986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017615183,0.0005595414,0.0068148295,0.0013277759,0.00017644532,0.0006190686,0.0007505422,0.068888344,0.017642278,0.7741796,0.055003617,0.072276466],"study_design_scores_gemma":[0.00012978907,0.00017491014,0.0029269275,0.0003501572,0.00017595176,0.00064098317,0.00022148808,0.18867013,0.009636752,0.7711752,0.025792344,0.0001054018],"about_ca_topic_score_codex":0.0047533475,"about_ca_topic_score_gemma":0.005017354,"teacher_disagreement_score":0.015619481,"about_ca_system_score_codex":0.005603257,"about_ca_system_score_gemma":0.0023288557,"threshold_uncertainty_score":0.05225241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93441874,0.00017896498,0.04923608,0.0001972836,0.000022964212,0.000020144375,0.0001505403,0.00012813773,0.015647097],"genre_scores_gemma":[0.9926801,0.000066390865,0.0059314785,0.000037927173,0.00001621541,0.000011058697,0.00008253003,0.000015768583,0.0011586908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998018,0.000036257894,0.000012189488,0.000048945287,0.000048490947,0.000052306958],"domain_scores_gemma":[0.9982291,0.0007483062,0.00045417526,0.00019525649,0.00016214278,0.00021093605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023408537,0.00022367682,0.00020739784,0.00081315776,0.0005283061,0.0009255123,0.00041371325,0.00027792787,0.0022318284],"category_scores_gemma":[0.0014935511,0.0001995525,0.00021536073,0.00092835614,0.00083035516,0.00093074335,0.00062295055,0.0005474279,0.00015173946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040372834,0.00019057897,0.029263755,0.00023096283,0.00006498169,0.0007221999,0.0010422138,0.068346985,0.05946514,0.7848006,0.0042314646,0.051237486],"study_design_scores_gemma":[0.000060660313,0.00012686598,0.019959142,0.000058722155,0.000049898197,0.00069600047,0.0005024816,0.23518409,0.017670097,0.7194516,0.00618968,0.000050817416],"about_ca_topic_score_codex":0.0015208957,"about_ca_topic_score_gemma":0.0028555265,"teacher_disagreement_score":0.0022318284,"about_ca_system_score_codex":0.0007831939,"about_ca_system_score_gemma":0.00021994163,"threshold_uncertainty_score":0.0074662566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83511657,0.00026066732,0.083156124,0.0013484634,0.00011706114,0.000067873116,0.00048152823,0.00097165455,0.07848005],"genre_scores_gemma":[0.979055,0.00009702663,0.015350687,0.00017727207,0.0000442974,0.0000325533,0.00017461313,0.00008157934,0.0049869455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874014,0.00043451937,0.000044089316,0.00025169912,0.00029206488,0.0002375386],"domain_scores_gemma":[0.99105483,0.0053933193,0.0005793887,0.00170062,0.0006153232,0.0006565942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089734787,0.00050110713,0.00072065083,0.001090938,0.0014699167,0.0024594879,0.0008208202,0.0013885809,0.012218666],"category_scores_gemma":[0.007842346,0.0005387284,0.0004865899,0.0011677275,0.001924765,0.0032276993,0.0019987205,0.0013234598,0.0009858251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007900493,0.00016401606,0.006447239,0.00028781264,0.000061857616,0.0005756692,0.0006669717,0.03304605,0.02269727,0.9009841,0.009333,0.024946004],"study_design_scores_gemma":[0.00011600899,0.00012168969,0.0022193552,0.000029759323,0.000051619518,0.0005924371,0.00032387112,0.05832294,0.009839444,0.9198149,0.0085394,0.000028504748],"about_ca_topic_score_codex":0.00048579188,"about_ca_topic_score_gemma":0.0010454162,"teacher_disagreement_score":0.012218666,"about_ca_system_score_codex":0.0010336062,"about_ca_system_score_gemma":0.00047973832,"threshold_uncertainty_score":0.040875494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9109339,0.0011010831,0.07016785,0.0004897225,0.00014241853,0.000046471574,0.0007024025,0.00040292522,0.01601321],"genre_scores_gemma":[0.99137986,0.00024909546,0.006623221,0.00005616845,0.000059890932,0.000027702175,0.00027418905,0.00005863488,0.0012712206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989812,0.00015792742,0.00005595007,0.00029003425,0.00029670302,0.00021818044],"domain_scores_gemma":[0.99367505,0.0028649783,0.0013845882,0.0007792562,0.0005070504,0.00078890333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146213,0.0004826654,0.00058031594,0.0037109319,0.0009583873,0.0022843317,0.00077962835,0.00068176474,0.0042323065],"category_scores_gemma":[0.010148703,0.00045380456,0.00025920742,0.0020945848,0.0012612195,0.0021866872,0.0011171763,0.00083688897,0.0003846795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014518186,0.00019556432,0.029311845,0.00032215103,0.00010463172,0.00097618543,0.0008126574,0.27389002,0.029426118,0.56276625,0.011154354,0.08958841],"study_design_scores_gemma":[0.00008695448,0.00015674793,0.009033829,0.000073010124,0.00006035316,0.0015520948,0.00031429055,0.4416343,0.010299386,0.52601177,0.0107200155,0.000057269703],"about_ca_topic_score_codex":0.0007619268,"about_ca_topic_score_gemma":0.00063449057,"teacher_disagreement_score":0.0042323065,"about_ca_system_score_codex":0.0019474085,"about_ca_system_score_gemma":0.00036926634,"threshold_uncertainty_score":0.014158487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68489873,0.0005331257,0.2916992,0.000748115,0.00015721263,0.000109720495,0.00055898994,0.00043383506,0.020861154],"genre_scores_gemma":[0.9557611,0.00013178625,0.041209232,0.00016134564,0.000037837628,0.000054528915,0.0003938384,0.000072780385,0.0021776939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800414,0.000679023,0.00011756556,0.0004491804,0.00041504102,0.00033498564],"domain_scores_gemma":[0.99357444,0.0024680772,0.00085782004,0.0012511841,0.0007940135,0.0010545034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015978485,0.0004703689,0.0008843641,0.0011015272,0.0014577842,0.0014297339,0.0013252161,0.0006473236,0.0034948194],"category_scores_gemma":[0.007649778,0.000566,0.00055873924,0.0014148112,0.0021115257,0.0020527665,0.0018017739,0.0010942656,0.00034145304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010337228,0.00027013026,0.008482454,0.00040525643,0.00011908508,0.0012108695,0.0013678398,0.1438397,0.016156089,0.76609796,0.008280906,0.052735988],"study_design_scores_gemma":[0.00008159809,0.00006321241,0.0010422923,0.00003494108,0.000026185537,0.0005542086,0.0003968819,0.19931531,0.0042735413,0.78873986,0.0054414165,0.000030547733],"about_ca_topic_score_codex":0.0011881855,"about_ca_topic_score_gemma":0.0007372972,"teacher_disagreement_score":0.0034948194,"about_ca_system_score_codex":0.0009987901,"about_ca_system_score_gemma":0.00055702304,"threshold_uncertainty_score":0.0116913915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7941623,0.0008776564,0.14624897,0.0016335095,0.00020087311,0.000043148575,0.000341887,0.00027073696,0.056220837],"genre_scores_gemma":[0.98106486,0.00034004537,0.013753942,0.00028837266,0.00008793351,0.000032793738,0.0002914107,0.000048064856,0.004092482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993179,0.00011656719,0.000032687884,0.00018177739,0.00018884885,0.00016229284],"domain_scores_gemma":[0.99754924,0.0010591793,0.0003738746,0.0005141781,0.00024260991,0.00026090775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008279213,0.0003100008,0.00035585024,0.00088314683,0.00094038364,0.0014009433,0.00087223493,0.0007373485,0.0038888443],"category_scores_gemma":[0.0028550378,0.00027098792,0.000642323,0.0010168246,0.0017488085,0.003211269,0.0014555667,0.001084025,0.00031239088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014926394,0.00006214277,0.006168996,0.00007248091,0.00003270571,0.0003995878,0.00044251137,0.016555024,0.0044067064,0.9585711,0.003108287,0.010031118],"study_design_scores_gemma":[0.00003546934,0.000035320347,0.0028660754,0.000033582495,0.00003083805,0.00034007322,0.00039590857,0.035095308,0.0029791428,0.9507346,0.007420176,0.000033419143],"about_ca_topic_score_codex":0.0019174532,"about_ca_topic_score_gemma":0.0022959197,"teacher_disagreement_score":0.0038888443,"about_ca_system_score_codex":0.00086453866,"about_ca_system_score_gemma":0.00041105694,"threshold_uncertainty_score":0.013009489},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6791118,0.00046197805,0.21078643,0.0012978216,0.00009876833,0.00018294393,0.0009028682,0.0006703263,0.10648714],"genre_scores_gemma":[0.98498225,0.00014577151,0.010369029,0.00013154648,0.000022781394,0.00003845385,0.00027224666,0.0000443299,0.0039936183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993443,0.00014316678,0.000030293277,0.00018645971,0.000149439,0.00014647734],"domain_scores_gemma":[0.9964424,0.0012519138,0.0008585942,0.0005276787,0.0005340704,0.0003853903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054141495,0.00033933544,0.00042088848,0.0007304146,0.001048277,0.0019246953,0.0006841114,0.00039937813,0.009507431],"category_scores_gemma":[0.0027556967,0.0005338992,0.00038979814,0.00063701486,0.002372773,0.002767717,0.0013944834,0.0006702055,0.00077214406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002588736,0.000028493578,0.0021478822,0.00016541009,0.000034980647,0.00042154052,0.0005517415,0.0074985255,0.0063535646,0.9635101,0.0035050677,0.015523852],"study_design_scores_gemma":[0.00008043425,0.0000880677,0.0046695946,0.000060327784,0.00008766096,0.0010939887,0.0010452351,0.046512,0.015432268,0.9054652,0.025401136,0.00006402401],"about_ca_topic_score_codex":0.0017165304,"about_ca_topic_score_gemma":0.0021173581,"teacher_disagreement_score":0.009507431,"about_ca_system_score_codex":0.00078802556,"about_ca_system_score_gemma":0.00057619996,"threshold_uncertainty_score":0.031805456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050310917,0.0027501942,0.8297011,0.0019376818,0.0011926127,0.00017432102,0.0021671369,0.0018339409,0.109931916],"genre_scores_gemma":[0.4705122,0.0070613413,0.42323413,0.0014975456,0.001143387,0.0004757457,0.006168755,0.0016541309,0.08825278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992092,0.0001103937,0.00006402956,0.00027909226,0.0002036585,0.0001335611],"domain_scores_gemma":[0.99819404,0.0005461096,0.0002259277,0.00043192992,0.00039474154,0.00020729087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609454,0.00069258723,0.0006185781,0.0012270708,0.0012268826,0.0027307398,0.0010626267,0.0010627315,0.021029297],"category_scores_gemma":[0.0036859682,0.00046616525,0.00094808417,0.0019208374,0.0008762443,0.007559395,0.0034048834,0.0021901962,0.006136818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724832,0.000044602395,0.00052134617,0.00024724944,0.000023621222,0.00029261332,0.00053540105,0.0028690728,0.0036885662,0.8750918,0.015983293,0.10063513],"study_design_scores_gemma":[0.000018077584,0.000057713598,0.00045955429,0.0000674083,0.000037500376,0.0010275044,0.0002771402,0.011895487,0.0041942713,0.8385085,0.14343145,0.000025458885],"about_ca_topic_score_codex":0.00036499,"about_ca_topic_score_gemma":0.0004946683,"teacher_disagreement_score":0.021029297,"about_ca_system_score_codex":0.00055622694,"about_ca_system_score_gemma":0.00029576587,"threshold_uncertainty_score":0.07034999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83819973,0.0014294552,0.129261,0.00069118105,0.00008007505,0.000049249935,0.00038293953,0.00018344962,0.029722983],"genre_scores_gemma":[0.9767948,0.00036978384,0.014347213,0.00007702066,0.000051542327,0.000049270897,0.00030707158,0.000059454156,0.007943841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994615,0.00013751614,0.000024970164,0.00014857331,0.00013269114,0.00009468658],"domain_scores_gemma":[0.9988587,0.0003189675,0.00020864747,0.00015897893,0.00017975904,0.00027492573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390648,0.0003893666,0.00042648017,0.0023053545,0.0010172606,0.0020191532,0.0007367009,0.00066899654,0.0056991535],"category_scores_gemma":[0.002121072,0.00021598236,0.00048715822,0.00096312567,0.0022443014,0.0031836636,0.0014898301,0.0010010106,0.00039859422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033092776,0.000010850864,0.00038454632,0.000016167662,0.0000066804155,0.000049976225,0.00026596815,0.0012650656,0.0011988811,0.9913005,0.00030533242,0.0051629343],"study_design_scores_gemma":[0.000011427591,0.000049550985,0.0006028687,0.000021846547,0.000011173756,0.00015147773,0.00025882636,0.0174979,0.0012886766,0.9738591,0.006225244,0.000021885042],"about_ca_topic_score_codex":0.001697101,"about_ca_topic_score_gemma":0.00086494896,"teacher_disagreement_score":0.0056991535,"about_ca_system_score_codex":0.0008018616,"about_ca_system_score_gemma":0.00028740978,"threshold_uncertainty_score":0.019065559},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6498385,0.0009632934,0.20332196,0.0008795102,0.00029951404,0.00024855204,0.0010088992,0.0010789068,0.14236084],"genre_scores_gemma":[0.94318455,0.00037374778,0.036249723,0.00028247444,0.00007728706,0.000096155956,0.0008400924,0.00016763293,0.018728353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941325,0.000079060235,0.000029841898,0.00015784001,0.00018168207,0.0001383528],"domain_scores_gemma":[0.99818426,0.0004932968,0.00029852267,0.0003105015,0.00024363294,0.0004697899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027787036,0.0003672281,0.00047661332,0.0011766305,0.0018529817,0.0016614991,0.0007956264,0.0006950546,0.018647874],"category_scores_gemma":[0.0020867912,0.0004731879,0.0005403236,0.00074777426,0.0015572883,0.002421668,0.0029739817,0.0008754998,0.001737815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003429632,0.00009243785,0.0049819592,0.0003524322,0.00010224408,0.0011902417,0.0013350596,0.009219034,0.0237107,0.8693504,0.013073751,0.07624874],"study_design_scores_gemma":[0.00004307726,0.0001374686,0.003853664,0.00009304129,0.000065297114,0.0018894644,0.0010413206,0.02622714,0.008289344,0.89135426,0.06695202,0.000053837077],"about_ca_topic_score_codex":0.0010748222,"about_ca_topic_score_gemma":0.0014492528,"teacher_disagreement_score":0.018647874,"about_ca_system_score_codex":0.0004720141,"about_ca_system_score_gemma":0.00035452016,"threshold_uncertainty_score":0.062383354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8362709,0.000774265,0.15098894,0.00048565003,0.000040409726,0.00007043503,0.00043959846,0.0001636736,0.010766076],"genre_scores_gemma":[0.96573913,0.0003698481,0.03193467,0.00007924891,0.000034594123,0.0000955958,0.00022999042,0.000034439934,0.0014825857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893826,0.000310304,0.00008570657,0.00025442208,0.00023492705,0.00017627538],"domain_scores_gemma":[0.992015,0.00485885,0.0012328204,0.0005406794,0.0007166989,0.00063597783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009049191,0.0004457998,0.0006262968,0.001975776,0.0009641195,0.0015257819,0.00075908226,0.00070867996,0.0027088572],"category_scores_gemma":[0.008175049,0.000685094,0.00047659356,0.0013718023,0.0021146857,0.0030696793,0.0015340472,0.00075086835,0.00018724528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003338159,0.00005726209,0.004240411,0.00020076027,0.000055255532,0.0006211895,0.00078741345,0.028629981,0.010241874,0.94027364,0.0010976505,0.013460655],"study_design_scores_gemma":[0.000064964726,0.000056873625,0.0012408133,0.000058547404,0.000030395175,0.00049346284,0.00029966448,0.062443748,0.005033141,0.9267138,0.0035318185,0.00003267797],"about_ca_topic_score_codex":0.0011636385,"about_ca_topic_score_gemma":0.0013564528,"teacher_disagreement_score":0.0027088572,"about_ca_system_score_codex":0.0010324287,"about_ca_system_score_gemma":0.0006842633,"threshold_uncertainty_score":0.009061992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9298268,0.0007292501,0.047954686,0.000545446,0.000045096775,0.0000342946,0.00010135305,0.00022410862,0.020538915],"genre_scores_gemma":[0.990195,0.00016515503,0.0069763516,0.000083378305,0.000026909443,0.000029518695,0.00009850822,0.000025188696,0.0023999603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992712,0.00030620064,0.00003202918,0.00015246453,0.00013781157,0.00010027899],"domain_scores_gemma":[0.9970804,0.0014938228,0.00040071298,0.0003811023,0.00023332391,0.00041068945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007308268,0.00045428754,0.00064757443,0.0011218196,0.0012347597,0.0012694437,0.00089715683,0.00078379194,0.0037862773],"category_scores_gemma":[0.0040849843,0.00039450475,0.00044964493,0.0005364302,0.002061474,0.0035150591,0.0019830454,0.0010672093,0.00035219442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040132596,0.00013641971,0.0025830073,0.00027039737,0.000049666123,0.00074347836,0.001225453,0.015953196,0.020116573,0.944008,0.0024181965,0.012094298],"study_design_scores_gemma":[0.000048860016,0.000084207284,0.0009144067,0.000035524594,0.000024579043,0.00063495536,0.0003214282,0.04305366,0.0044952417,0.94754946,0.0028135802,0.000024071529],"about_ca_topic_score_codex":0.00068376295,"about_ca_topic_score_gemma":0.0009961966,"teacher_disagreement_score":0.0037862773,"about_ca_system_score_codex":0.0007821375,"about_ca_system_score_gemma":0.00034717514,"threshold_uncertainty_score":0.012666345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772391,0.0006375115,0.09782911,0.001434433,0.000075156466,0.000061332794,0.0005426692,0.00040852337,0.02177215],"genre_scores_gemma":[0.98970383,0.0003222941,0.007102263,0.00017400048,0.000044647062,0.00007754506,0.00022132134,0.000063256266,0.0022908247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992267,0.00016974364,0.00003066845,0.0003075839,0.00013356395,0.00013184722],"domain_scores_gemma":[0.98906684,0.0061419923,0.001509302,0.0016119607,0.0008177773,0.0008520703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333758,0.00034873787,0.0004578402,0.0019445932,0.0012543077,0.0018658832,0.0014215817,0.00067750184,0.0037606445],"category_scores_gemma":[0.010985523,0.0004213499,0.00033200553,0.0010829283,0.0031450507,0.0022174856,0.0010637657,0.0011399492,0.00034984326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054349005,0.00012186876,0.033890765,0.0003244015,0.0001115992,0.00026259315,0.0005497518,0.06162089,0.029019522,0.8279403,0.0058515677,0.03976317],"study_design_scores_gemma":[0.00010304555,0.00017450031,0.020563437,0.000104763356,0.000105057705,0.0012729774,0.00035701346,0.21372083,0.0229341,0.7295286,0.010979504,0.00015611034],"about_ca_topic_score_codex":0.0022213124,"about_ca_topic_score_gemma":0.0020217039,"teacher_disagreement_score":0.0037606445,"about_ca_system_score_codex":0.0025242392,"about_ca_system_score_gemma":0.00079355063,"threshold_uncertainty_score":0.01831472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86933213,0.0005040531,0.0903351,0.0005650618,0.00011621282,0.000058286198,0.0007085584,0.0003323069,0.038048483],"genre_scores_gemma":[0.9833066,0.00017817353,0.009606111,0.0000612804,0.00007375589,0.00002935791,0.00025071946,0.000066738205,0.0064272294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959534,0.00005543533,0.000010809371,0.000077875426,0.0001308103,0.00012968839],"domain_scores_gemma":[0.9988086,0.00042018332,0.00024744356,0.00007984091,0.00019341144,0.00025053998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032080497,0.00034061747,0.0005478014,0.0013679411,0.0008691202,0.0013347276,0.0005404552,0.0003344635,0.010098116],"category_scores_gemma":[0.002739283,0.00025663228,0.00040637163,0.0010244743,0.001730872,0.0013994704,0.001207793,0.001123928,0.0010350597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004169947,0.000057186513,0.0026371193,0.00014946538,0.000016712907,0.00032048748,0.0004575094,0.016268583,0.0089767855,0.9242734,0.0057396796,0.040686082],"study_design_scores_gemma":[0.00006929297,0.00013127516,0.003527764,0.00003805569,0.000017846824,0.00063743413,0.00034952268,0.057429265,0.006656018,0.9208606,0.01022631,0.00005664304],"about_ca_topic_score_codex":0.0026014042,"about_ca_topic_score_gemma":0.003400306,"teacher_disagreement_score":0.010098116,"about_ca_system_score_codex":0.0016982033,"about_ca_system_score_gemma":0.0006444704,"threshold_uncertainty_score":0.033781588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94471043,0.000118836775,0.03865207,0.00034050233,0.000020208776,0.000034470926,0.00019722377,0.00022722756,0.015699238],"genre_scores_gemma":[0.9944061,0.000044024437,0.0039422214,0.000050045517,0.000010362776,0.00002436743,0.00022532117,0.000031546642,0.0012660817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954873,0.000063425585,0.000020837973,0.00015298394,0.00009154824,0.00012244073],"domain_scores_gemma":[0.997442,0.0011339491,0.00035453314,0.00038325952,0.00022317519,0.00046301333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004300806,0.00034158982,0.0005683597,0.0011014758,0.0011862693,0.002514783,0.00079882314,0.0005511459,0.0041156383],"category_scores_gemma":[0.0023367272,0.00039725285,0.00052951585,0.00049302075,0.002506667,0.0025461041,0.0013988281,0.0013993345,0.00019247105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031452157,0.00008859609,0.008968495,0.00014083133,0.00004767619,0.00072886475,0.0012039724,0.008509192,0.0130605865,0.95223224,0.0020658297,0.012639242],"study_design_scores_gemma":[0.00006455029,0.00007350505,0.0065890155,0.00006319235,0.00007051283,0.0011900978,0.0010650391,0.037628457,0.009757316,0.93729,0.0061545456,0.00005373673],"about_ca_topic_score_codex":0.0008200767,"about_ca_topic_score_gemma":0.00097215903,"teacher_disagreement_score":0.0041156383,"about_ca_system_score_codex":0.00116836,"about_ca_system_score_gemma":0.00047042384,"threshold_uncertainty_score":0.013768196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6620252,0.00065626483,0.27111447,0.0005128427,0.00019736786,0.0006851937,0.00067785475,0.00084759085,0.06328321],"genre_scores_gemma":[0.8670878,0.0002800635,0.11525708,0.00018352237,0.000057400583,0.00016266019,0.0014967544,0.00020831855,0.015266339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944454,0.0000876108,0.000035775764,0.00018578293,0.00013951225,0.00010680496],"domain_scores_gemma":[0.9992053,0.00016846518,0.00009522269,0.00033296196,0.000108463304,0.000089622336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017988062,0.000438041,0.00051624374,0.0011236361,0.0011478695,0.0016382018,0.0007522857,0.000698443,0.012034033],"category_scores_gemma":[0.0014619604,0.00036313388,0.00059217744,0.0013382528,0.0014197654,0.0026400727,0.002003752,0.0005333046,0.0012622494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014124066,0.00040519476,0.0062961164,0.000991053,0.0002436622,0.0020196263,0.0030921313,0.043035645,0.117877625,0.5143897,0.0107127465,0.29952416],"study_design_scores_gemma":[0.00016573335,0.0005020188,0.007579686,0.00021100866,0.00026429087,0.0018093707,0.0033549934,0.084679976,0.03835325,0.76982754,0.09314085,0.000111353555],"about_ca_topic_score_codex":0.0019593635,"about_ca_topic_score_gemma":0.0015753771,"teacher_disagreement_score":0.012034033,"about_ca_system_score_codex":0.0005872591,"about_ca_system_score_gemma":0.00043096364,"threshold_uncertainty_score":0.04025781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4686398,0.0008330299,0.46512207,0.0018580004,0.00015917627,0.00015459662,0.0005934059,0.00074034213,0.061899718],"genre_scores_gemma":[0.90712523,0.00053655327,0.08504912,0.00030766413,0.00012461354,0.0001435834,0.00045206858,0.0003178327,0.005943398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981982,0.0005874027,0.000067758876,0.00038669232,0.00036100417,0.00039901276],"domain_scores_gemma":[0.9738966,0.021808371,0.0013808621,0.0016375349,0.0006545372,0.00062203984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035804,0.0009969492,0.00062369613,0.0019295609,0.0014579784,0.0027231276,0.0016454393,0.0010938399,0.010774031],"category_scores_gemma":[0.017149424,0.000658085,0.0008989619,0.0017000644,0.003610633,0.0061928025,0.001972011,0.002773109,0.0008027259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034740768,0.000113054586,0.0011187517,0.00020611194,0.000029566258,0.00015903542,0.0002910114,0.05804053,0.0057187267,0.91275436,0.002815981,0.018405402],"study_design_scores_gemma":[0.000054237586,0.00008389657,0.00051900145,0.000051759296,0.00003310927,0.00013013775,0.00011715776,0.15426584,0.004943888,0.8369505,0.0028137567,0.000036784837],"about_ca_topic_score_codex":0.0025215044,"about_ca_topic_score_gemma":0.0035490454,"teacher_disagreement_score":0.010774031,"about_ca_system_score_codex":0.003958794,"about_ca_system_score_gemma":0.0016033287,"threshold_uncertainty_score":0.03604275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8075803,0.00089018827,0.17402895,0.00079547125,0.00007192651,0.000106587766,0.00057305396,0.00048159092,0.015471933],"genre_scores_gemma":[0.9852347,0.00030165544,0.012239127,0.00009582408,0.000047341815,0.00009008778,0.00016385964,0.00006127736,0.0017662185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990702,0.00035919956,0.00003269303,0.00022736115,0.00016534078,0.00014521445],"domain_scores_gemma":[0.99112856,0.0049836356,0.0012187721,0.001232532,0.0007009748,0.00073554134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015778248,0.00037262612,0.00045275,0.0018525796,0.00085285184,0.0012912515,0.0011363021,0.0005809524,0.0026093605],"category_scores_gemma":[0.010642445,0.0003433237,0.0003259317,0.00096108014,0.0022767023,0.0016686193,0.0009932063,0.00072750944,0.00020481211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044464975,0.00006133174,0.006421666,0.00018489381,0.000060027258,0.00020597105,0.00028361077,0.12656645,0.01602576,0.8280367,0.0035636004,0.018145327],"study_design_scores_gemma":[0.0000615431,0.00007690613,0.0041309847,0.000046283763,0.000031546173,0.00033222703,0.000097217344,0.4017112,0.004857702,0.5843278,0.004262283,0.000064398395],"about_ca_topic_score_codex":0.0022514306,"about_ca_topic_score_gemma":0.0022293578,"teacher_disagreement_score":0.0026093605,"about_ca_system_score_codex":0.0019246158,"about_ca_system_score_gemma":0.00069347525,"threshold_uncertainty_score":0.013964176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87842387,0.00021660587,0.112755604,0.00074924337,0.000028804092,0.000038689457,0.00015435116,0.00019902003,0.0074338256],"genre_scores_gemma":[0.99094766,0.00011349735,0.0072554434,0.00006664871,0.0000148100535,0.000035772016,0.00007922281,0.000043847984,0.0014431248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994746,0.00018947781,0.000010812311,0.000117194126,0.00011389292,0.00009407683],"domain_scores_gemma":[0.9943112,0.003420488,0.00072102493,0.0005795439,0.00045751611,0.0005101886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713434,0.00025403552,0.00040486897,0.0015725371,0.0008658849,0.0009230535,0.0011088612,0.0005669708,0.0027453548],"category_scores_gemma":[0.008579071,0.00028342172,0.00031488133,0.0005504096,0.0032325261,0.001638821,0.0010061407,0.00075322366,0.00018697392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039315608,0.000051082938,0.0076754084,0.00008265581,0.000052537223,0.00015123542,0.00023710856,0.27337593,0.01669079,0.6904032,0.0020360143,0.008850895],"study_design_scores_gemma":[0.000046896097,0.000057252906,0.0030907786,0.000027280706,0.00001666914,0.00012332239,0.000077306424,0.7482586,0.00476426,0.24217227,0.0013217387,0.00004363662],"about_ca_topic_score_codex":0.0034549285,"about_ca_topic_score_gemma":0.0026491496,"teacher_disagreement_score":0.0034549285,"about_ca_system_score_codex":0.0024074467,"about_ca_system_score_gemma":0.0008697962,"threshold_uncertainty_score":0.01746732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62269336,0.0009687875,0.266997,0.002047429,0.00033869306,0.00012779358,0.0005545478,0.00042213508,0.105850264],"genre_scores_gemma":[0.962935,0.00033235777,0.028134767,0.0003232552,0.00018807268,0.00009445027,0.0002818076,0.0000763845,0.0076339287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996333,0.00006676039,0.000018867178,0.000119056866,0.000095901916,0.00006607209],"domain_scores_gemma":[0.9991167,0.00024861144,0.00017923143,0.0001799748,0.00008640978,0.00018907066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036019113,0.00024792354,0.00028178707,0.0010338874,0.0009419071,0.0016612104,0.0005088169,0.00058074313,0.0024013116],"category_scores_gemma":[0.0008762234,0.00013719573,0.00048235478,0.00048190737,0.002467457,0.002506516,0.0009466814,0.0010230795,0.00019040369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020429039,0.000021852502,0.00070981093,0.000017675846,0.000004256253,0.0000965882,0.00015315162,0.0015653849,0.001795362,0.9879787,0.00088238425,0.006754348],"study_design_scores_gemma":[0.000010811806,0.000020989977,0.0011434576,0.000021232052,0.000006869112,0.00034481304,0.00016669848,0.018824076,0.0012155761,0.9625107,0.015716892,0.000017909422],"about_ca_topic_score_codex":0.001179679,"about_ca_topic_score_gemma":0.0009955538,"teacher_disagreement_score":0.0024013116,"about_ca_system_score_codex":0.0011729521,"about_ca_system_score_gemma":0.00042067067,"threshold_uncertainty_score":0.008510351},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8579838,0.00018176337,0.10754433,0.00032643383,0.00006932788,0.00008701852,0.0003974399,0.000728338,0.032681562],"genre_scores_gemma":[0.9575503,0.00021889442,0.03372477,0.00005330128,0.000025154604,0.000050858154,0.0004135778,0.000093978015,0.007869253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997429,0.000029127457,0.000013348054,0.000053825504,0.00010230158,0.000058461537],"domain_scores_gemma":[0.9988269,0.0002426988,0.0004079056,0.00015213885,0.00021447611,0.00015588639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011483401,0.0007347532,0.00026255805,0.0007019165,0.00061672705,0.0010213207,0.0006199781,0.0005046146,0.009638717],"category_scores_gemma":[0.0012561323,0.0004922023,0.0003173345,0.00075735315,0.0009640515,0.0018907946,0.0018636208,0.0011147939,0.0015653536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018182303,0.00050408114,0.009289874,0.0010794743,0.00012799534,0.003332685,0.002817351,0.08038965,0.25063795,0.44160804,0.010170131,0.19822448],"study_design_scores_gemma":[0.0004627259,0.001532888,0.010158999,0.00017296708,0.00023899549,0.0031802976,0.003952923,0.22728947,0.16957887,0.49810398,0.085077494,0.00025037507],"about_ca_topic_score_codex":0.0008981653,"about_ca_topic_score_gemma":0.0012081647,"teacher_disagreement_score":0.009638717,"about_ca_system_score_codex":0.0004450296,"about_ca_system_score_gemma":0.00029179984,"threshold_uncertainty_score":0.032244742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42181784,0.008005936,0.2995629,0.011588758,0.0012217779,0.00020896464,0.0013410328,0.0015637175,0.2546891],"genre_scores_gemma":[0.94501096,0.0017502987,0.03831734,0.0013840768,0.0008968608,0.000185735,0.00067178684,0.0007024951,0.011080458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772996,0.00058896636,0.000059396138,0.0005916229,0.00060106226,0.00042903825],"domain_scores_gemma":[0.98791784,0.00722468,0.00069104676,0.0019318716,0.00096366176,0.0012708725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024220357,0.0011336651,0.0019443829,0.0033832109,0.0021471893,0.0030403042,0.0033705425,0.0014452471,0.012945503],"category_scores_gemma":[0.012929725,0.00074428035,0.0011889231,0.0022827662,0.0037263667,0.008536998,0.0031575495,0.005470074,0.0018123336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025719142,0.00015061635,0.0016268847,0.00022860682,0.00005297013,0.00031402102,0.00024966933,0.013849424,0.0040739877,0.9396361,0.022073815,0.017486624],"study_design_scores_gemma":[0.00003965141,0.000065762564,0.0013469714,0.00008405418,0.000041639454,0.00042048426,0.00007831993,0.11882388,0.0038572152,0.86020416,0.014986281,0.000051497165],"about_ca_topic_score_codex":0.0013426315,"about_ca_topic_score_gemma":0.0010345845,"teacher_disagreement_score":0.012945503,"about_ca_system_score_codex":0.003549919,"about_ca_system_score_gemma":0.0009954339,"threshold_uncertainty_score":0.043307006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59733695,0.011874659,0.25525728,0.0040839235,0.0013034362,0.00011439313,0.0010518965,0.0006270837,0.1283503],"genre_scores_gemma":[0.934809,0.0016612731,0.056875985,0.00073168654,0.000525331,0.000073102005,0.00029706632,0.00013714602,0.004889491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990683,0.00022392334,0.0000411872,0.00026699807,0.00025993702,0.00013953637],"domain_scores_gemma":[0.9963403,0.0020076903,0.0004508375,0.00045507037,0.00039266876,0.00035349742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244073,0.0005210057,0.00046630035,0.002224048,0.0008176792,0.0016437115,0.0007824301,0.0006193701,0.0032209344],"category_scores_gemma":[0.004149803,0.00036161454,0.00030636718,0.0022783882,0.0017055357,0.0021306502,0.0009094974,0.0018889839,0.00037990592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002618568,0.00004314846,0.0032034223,0.00020078848,0.000020853933,0.00023671551,0.00040919168,0.012076366,0.010073115,0.9150347,0.008499143,0.049940724],"study_design_scores_gemma":[0.000046521385,0.00017816674,0.004820162,0.00008890085,0.000032191863,0.00096281315,0.00024523758,0.0489686,0.005293279,0.89287984,0.04642621,0.000057983998],"about_ca_topic_score_codex":0.0024386367,"about_ca_topic_score_gemma":0.002131662,"teacher_disagreement_score":0.0032209344,"about_ca_system_score_codex":0.0012145675,"about_ca_system_score_gemma":0.00040821082,"threshold_uncertainty_score":0.010775149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562782,0.004359505,0.14311196,0.0023355065,0.000283559,0.00011230617,0.00082553306,0.00017176298,0.092521615],"genre_scores_gemma":[0.9807586,0.00057959935,0.012432528,0.00024988645,0.00010857103,0.000046263376,0.0002814628,0.000021205857,0.005521796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991146,0.00023205172,0.00004783628,0.0002561575,0.00020954871,0.00013987084],"domain_scores_gemma":[0.99612695,0.0022716387,0.0005760127,0.00031971865,0.00033226082,0.0003734533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007001564,0.0003584674,0.00069844234,0.001396129,0.0012900862,0.0015888694,0.0008456007,0.0006329076,0.0034870214],"category_scores_gemma":[0.004355646,0.00048043916,0.00034249696,0.0010661519,0.0018110039,0.0017240044,0.001520688,0.00081513997,0.00028742186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011809968,0.00005300414,0.0033409838,0.00030799635,0.00007733718,0.00055434613,0.0007565042,0.016314503,0.0051193465,0.9320225,0.0070492364,0.03428615],"study_design_scores_gemma":[0.000027891048,0.000048596812,0.0016577566,0.000053378957,0.000050311828,0.00092792884,0.00034520726,0.028005663,0.0030314932,0.9546098,0.011215028,0.000027001472],"about_ca_topic_score_codex":0.00068225386,"about_ca_topic_score_gemma":0.00079117937,"teacher_disagreement_score":0.0034870214,"about_ca_system_score_codex":0.0008480771,"about_ca_system_score_gemma":0.00042148368,"threshold_uncertainty_score":0.011665225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9435661,0.00013249606,0.029374966,0.00027427,0.000049475326,0.00005643453,0.00016834152,0.00041978818,0.025958076],"genre_scores_gemma":[0.99357754,0.00006567646,0.0033415041,0.00005513671,0.000020993259,0.000030184317,0.0002309251,0.00005315194,0.0026249036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990471,0.00013768308,0.000035984696,0.00018090488,0.00024272152,0.0003555954],"domain_scores_gemma":[0.9967878,0.001292498,0.00046137013,0.00052183773,0.0003735751,0.0005628867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042622047,0.00030223024,0.0006652466,0.0010458615,0.002065475,0.0017281767,0.0006154323,0.0007826605,0.0061773174],"category_scores_gemma":[0.0037251294,0.0002933513,0.0005340243,0.00081521604,0.0029623457,0.0019624562,0.0029155228,0.001043307,0.00072732265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008234367,0.0001559481,0.009352752,0.00019821635,0.000033883374,0.0018442963,0.0018733193,0.01048711,0.01809401,0.9263568,0.0054558497,0.025324482],"study_design_scores_gemma":[0.00012538723,0.00023164914,0.007492004,0.000053317533,0.00007366469,0.00189937,0.001910968,0.029171593,0.02114702,0.9177728,0.020039251,0.000082955135],"about_ca_topic_score_codex":0.0016182099,"about_ca_topic_score_gemma":0.0012938435,"teacher_disagreement_score":0.0061773174,"about_ca_system_score_codex":0.0007296813,"about_ca_system_score_gemma":0.00074825867,"threshold_uncertainty_score":0.020665169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73686695,0.0006267789,0.17775358,0.0007880358,0.00013851795,0.000092609975,0.0006193987,0.0011923664,0.08192174],"genre_scores_gemma":[0.9582159,0.000324914,0.03217739,0.0002378465,0.00008396764,0.000055828405,0.00093274657,0.00018522197,0.007786238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934953,0.000119394594,0.000023633896,0.000169038,0.00015519686,0.00018326516],"domain_scores_gemma":[0.9972134,0.0012987811,0.00041301147,0.00048645757,0.00030208007,0.00028630657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039458578,0.0006086569,0.00032950874,0.0009553945,0.0010943167,0.0013928986,0.0006448943,0.0003906798,0.004470986],"category_scores_gemma":[0.002360824,0.00033076108,0.00050349155,0.00090563507,0.0011768719,0.0010652128,0.001013825,0.0010205329,0.00059261644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003810622,0.00013541114,0.0075412667,0.00029820396,0.000059041093,0.00057822186,0.0006798298,0.06457923,0.03802225,0.8112611,0.012955534,0.06350883],"study_design_scores_gemma":[0.00006063582,0.00017471585,0.005413743,0.000059587393,0.00007500273,0.0013791879,0.00033070552,0.1855592,0.024507966,0.75297815,0.029396564,0.00006456004],"about_ca_topic_score_codex":0.004037217,"about_ca_topic_score_gemma":0.005054849,"teacher_disagreement_score":0.004470986,"about_ca_system_score_codex":0.0014846376,"about_ca_system_score_gemma":0.00089251436,"threshold_uncertainty_score":0.014956892},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9384446,0.00023714031,0.019540966,0.00009506264,0.00008570872,0.000030541825,0.00004470406,0.00013790358,0.04138347],"genre_scores_gemma":[0.9899569,0.00013758469,0.0048127733,0.000027503058,0.00002119865,0.000018592968,0.000052243926,0.000018968216,0.0049541164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999833,0.000023800936,0.000010221448,0.00002606258,0.000048366186,0.000058516838],"domain_scores_gemma":[0.9998481,0.000035991812,0.000038176277,0.000025744668,0.000018493105,0.00003350582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012958734,0.0003375098,0.00020600192,0.00055107,0.00047610546,0.0009948722,0.00022428182,0.000276983,0.0019469878],"category_scores_gemma":[0.0004410847,0.00019121039,0.00034533846,0.00020705424,0.0007360763,0.00085205666,0.00076443766,0.00035118993,0.0002854779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017660674,0.00006497941,0.0016483703,0.000091434624,0.000026936235,0.0011938751,0.0015907619,0.0067379684,0.075654626,0.88862437,0.001129278,0.023060862],"study_design_scores_gemma":[0.00008077515,0.00027158417,0.0026117184,0.0000401467,0.00006326465,0.00085647975,0.0010394297,0.031657934,0.07953904,0.8555725,0.028210495,0.00005658203],"about_ca_topic_score_codex":0.00074476533,"about_ca_topic_score_gemma":0.0010208689,"teacher_disagreement_score":0.0019469878,"about_ca_system_score_codex":0.0006117302,"about_ca_system_score_gemma":0.0002542742,"threshold_uncertainty_score":0.0065132976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9104769,0.00051361695,0.064039886,0.000399082,0.00004691822,0.000061125764,0.00021717057,0.00016470088,0.024080664],"genre_scores_gemma":[0.97780365,0.00029221844,0.016729314,0.000075847296,0.000044378583,0.00004299401,0.00032107602,0.00003490258,0.0046555735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948823,0.000079554775,0.00004468056,0.00013560653,0.00015299905,0.000098886536],"domain_scores_gemma":[0.9984937,0.0005744659,0.00030318784,0.0002633569,0.00016267262,0.00020265834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048103285,0.00034985977,0.0005743708,0.0011119393,0.00120772,0.0020052257,0.00041858671,0.0005453289,0.0040467014],"category_scores_gemma":[0.0019819443,0.0005655616,0.00053015567,0.0010821274,0.0015386605,0.0028802291,0.0018818993,0.00063369866,0.0003734957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006917493,0.00012470805,0.016755521,0.00034566282,0.00008544176,0.0018353077,0.002351859,0.015274479,0.027519904,0.87893504,0.0042737424,0.05180658],"study_design_scores_gemma":[0.0000784478,0.0002890215,0.0055580814,0.000088116234,0.000130996,0.0033652077,0.0011154792,0.04637549,0.029229764,0.8854866,0.028232403,0.000050410497],"about_ca_topic_score_codex":0.00076481036,"about_ca_topic_score_gemma":0.0009221547,"teacher_disagreement_score":0.0040467014,"about_ca_system_score_codex":0.00066511065,"about_ca_system_score_gemma":0.00033931748,"threshold_uncertainty_score":0.013537586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91074383,0.00032952204,0.06718491,0.000113429094,0.0000680965,0.000035732028,0.000106059786,0.00025754704,0.02116096],"genre_scores_gemma":[0.9861979,0.00014198647,0.01123409,0.000028720935,0.000020660731,0.000044145254,0.0001597565,0.000054844226,0.0021179137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995883,0.00006663571,0.000025568706,0.00009389795,0.00013126375,0.00009426465],"domain_scores_gemma":[0.99824655,0.0006118821,0.00032549136,0.00016577405,0.0002637021,0.00038664468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005187757,0.0003270507,0.00029812838,0.0019399602,0.00090548064,0.001313829,0.00051503244,0.00043906772,0.0029486988],"category_scores_gemma":[0.0035980395,0.00028017786,0.00030769847,0.0006279818,0.0012333427,0.000962352,0.0007924768,0.0007667529,0.00026437166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004739969,0.000098643264,0.006745359,0.00019374494,0.000037264075,0.000971238,0.0012377435,0.04944775,0.06181704,0.84461343,0.0025127481,0.03185098],"study_design_scores_gemma":[0.000066645356,0.00045261567,0.010225851,0.00015708472,0.00008183076,0.0020584094,0.0010801734,0.20403601,0.048862033,0.7143509,0.018531995,0.000096424425],"about_ca_topic_score_codex":0.00045183173,"about_ca_topic_score_gemma":0.00040933272,"teacher_disagreement_score":0.0029486988,"about_ca_system_score_codex":0.00086634327,"about_ca_system_score_gemma":0.00027901906,"threshold_uncertainty_score":0.00986439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45078608,0.0018681791,0.4459221,0.0018979912,0.00028598134,0.00014071265,0.00033943474,0.00028041223,0.09847911],"genre_scores_gemma":[0.96162724,0.00039919923,0.0269036,0.00014794535,0.00013782528,0.000089820554,0.00012074981,0.000045459492,0.010528192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995253,0.00015863945,0.000021377371,0.000088402485,0.00012602027,0.00008025576],"domain_scores_gemma":[0.99931693,0.00021099561,0.00008369774,0.00011115337,0.00012524013,0.00015199995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005954088,0.00042970586,0.0003301559,0.0014719954,0.000870474,0.002257611,0.00073899416,0.00079966895,0.0047981604],"category_scores_gemma":[0.0014759958,0.00015985355,0.00044605977,0.0009635864,0.003114832,0.0037072918,0.0020492577,0.0010673607,0.00037029252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035979767,0.0000034903762,0.00006698117,0.0000055547957,0.0000012127958,0.000017916074,0.00006877923,0.0007728614,0.00024485955,0.99774736,0.00011802528,0.00094927143],"study_design_scores_gemma":[0.0000045248885,0.000017586424,0.000091965245,0.0000084930225,0.0000028633035,0.00006381825,0.00007025874,0.011431135,0.00032246302,0.9815716,0.006409541,0.0000058201535],"about_ca_topic_score_codex":0.0007951387,"about_ca_topic_score_gemma":0.0005949008,"teacher_disagreement_score":0.0047981604,"about_ca_system_score_codex":0.00089560624,"about_ca_system_score_gemma":0.0004215281,"threshold_uncertainty_score":0.016051471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1278629,0.0052882973,0.6952292,0.008568705,0.0018499959,0.00035667166,0.002758155,0.003393586,0.15469255],"genre_scores_gemma":[0.7661882,0.0017512873,0.20077752,0.0015650006,0.0015641009,0.00049575197,0.0013655686,0.0010287465,0.025263792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964954,0.0008077029,0.00010972451,0.0009554552,0.0010344292,0.00059728045],"domain_scores_gemma":[0.98482496,0.009247877,0.0005187893,0.0031908462,0.0013142391,0.0009032852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004356492,0.0018507104,0.0013691501,0.0033322258,0.002039211,0.0035507712,0.0044199075,0.0018577741,0.022965983],"category_scores_gemma":[0.017177813,0.0008208542,0.0014053214,0.0025101856,0.003146286,0.008008876,0.0052637756,0.005371918,0.0028590478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015731198,0.00034043868,0.005087152,0.00067908206,0.0001801288,0.00026615968,0.00030624174,0.09917441,0.0170231,0.72171783,0.05345022,0.10020206],"study_design_scores_gemma":[0.000121741075,0.00019267885,0.0024610485,0.00014963046,0.00013435434,0.000280368,0.00009421868,0.47833213,0.0072258506,0.48787433,0.023034792,0.00009883982],"about_ca_topic_score_codex":0.0027276753,"about_ca_topic_score_gemma":0.0046912218,"teacher_disagreement_score":0.022965983,"about_ca_system_score_codex":0.005179644,"about_ca_system_score_gemma":0.0022971074,"threshold_uncertainty_score":0.0768289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8790044,0.0008011271,0.10553804,0.00053219794,0.000018398978,0.000049680224,0.0007518726,0.0003055593,0.012998748],"genre_scores_gemma":[0.973417,0.00015523797,0.023764528,0.00007514317,0.000022651306,0.000039694572,0.0006604171,0.000035558172,0.0018297036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989441,0.00023063555,0.000068075424,0.00028398866,0.00033470945,0.00013843169],"domain_scores_gemma":[0.9910858,0.0055371365,0.0011870563,0.0010508244,0.0005028873,0.0006363351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228253,0.00025543055,0.00064372213,0.0019259361,0.0011165348,0.0016490184,0.0012599372,0.0008066549,0.0041814],"category_scores_gemma":[0.007337827,0.00068562693,0.0005177132,0.0017470116,0.0020666176,0.0031892965,0.0013161064,0.0007973637,0.00026065175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011480217,0.00015408498,0.015076472,0.00057681196,0.0001322683,0.0013286629,0.0024816953,0.046301715,0.01668841,0.8464091,0.0036351418,0.06606768],"study_design_scores_gemma":[0.00008018582,0.00009591167,0.0060867076,0.00009015087,0.00008424072,0.0019293,0.0006275083,0.077467225,0.0063630636,0.8995748,0.0075670043,0.000033851582],"about_ca_topic_score_codex":0.0014015303,"about_ca_topic_score_gemma":0.001994516,"teacher_disagreement_score":0.0041814,"about_ca_system_score_codex":0.0009305434,"about_ca_system_score_gemma":0.00031731575,"threshold_uncertainty_score":0.013988197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9503687,0.00008454382,0.043886613,0.000096793614,0.00001650586,0.00005151791,0.00026285148,0.00023235995,0.0050000446],"genre_scores_gemma":[0.9905267,0.000027779908,0.008269839,0.000026791453,0.000008070017,0.00003205126,0.00027664943,0.00002569692,0.0008064359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999524,0.0000564402,0.000031686544,0.00015707436,0.000101370344,0.00012942731],"domain_scores_gemma":[0.9990195,0.00027871985,0.00022183139,0.00016469,0.000109486034,0.00020576223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002635354,0.0002723802,0.0003039287,0.0009832521,0.0006435206,0.0010527099,0.00046246644,0.00043252367,0.003204431],"category_scores_gemma":[0.001257656,0.00038487389,0.0005183042,0.0005263554,0.00081827276,0.0012824343,0.00083626044,0.0005384837,0.0002082227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010701348,0.0002367662,0.019648157,0.00024199016,0.00010513494,0.0022706622,0.0016058774,0.041897543,0.10017863,0.79057115,0.0025227163,0.03965124],"study_design_scores_gemma":[0.00020385791,0.00032462183,0.01119341,0.00007635338,0.00014783868,0.0015674386,0.0008268341,0.17005554,0.055240586,0.7473035,0.012992857,0.000067113295],"about_ca_topic_score_codex":0.00078155263,"about_ca_topic_score_gemma":0.0010724263,"teacher_disagreement_score":0.003204431,"about_ca_system_score_codex":0.0006270784,"about_ca_system_score_gemma":0.00033709162,"threshold_uncertainty_score":0.010719895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92632526,0.00036668993,0.052077003,0.00037952405,0.00003948338,0.000040544168,0.00022056152,0.00018626427,0.020364601],"genre_scores_gemma":[0.9924084,0.00009613532,0.00527015,0.000049955986,0.00002496274,0.000026966816,0.00010130071,0.000024471654,0.0019975535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993463,0.00013948603,0.000037497215,0.00015905758,0.00020372549,0.000113906],"domain_scores_gemma":[0.99555016,0.0021259433,0.00056785805,0.0005629057,0.00047550845,0.0007175873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136872,0.0002701014,0.0005184979,0.0008237063,0.0008598022,0.0014180723,0.000750033,0.00053235993,0.0070091034],"category_scores_gemma":[0.0051817424,0.00040525358,0.0003534238,0.00056890957,0.001482656,0.0028851826,0.0018595719,0.0009153586,0.00046407167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035858745,0.000100392535,0.0045898687,0.0003140792,0.000047581943,0.0005821931,0.0007085887,0.015552037,0.019681275,0.9411143,0.0031526412,0.013798455],"study_design_scores_gemma":[0.00005557115,0.0002702175,0.0021284183,0.00003173105,0.000042216074,0.0010476916,0.00020476842,0.08961102,0.0087277545,0.893948,0.0039066207,0.000025973568],"about_ca_topic_score_codex":0.0002640467,"about_ca_topic_score_gemma":0.00032412424,"teacher_disagreement_score":0.0070091034,"about_ca_system_score_codex":0.00061350694,"about_ca_system_score_gemma":0.00030177474,"threshold_uncertainty_score":0.023447752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60309005,0.00082627696,0.36834568,0.0006956407,0.00010931645,0.00022721621,0.0012749407,0.0007932259,0.024637586],"genre_scores_gemma":[0.9505676,0.00030428832,0.04267464,0.00014540442,0.00004686705,0.00011029488,0.0007591786,0.00007074015,0.0053208414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988966,0.00020998168,0.000119625925,0.00038740173,0.00017763476,0.00020862176],"domain_scores_gemma":[0.99369735,0.002714887,0.00094426837,0.001067326,0.0006609893,0.0009152635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083195505,0.00038434006,0.00073517906,0.0017354748,0.0015451697,0.0020980341,0.0007799315,0.00075821363,0.005301256],"category_scores_gemma":[0.0042290003,0.0007105011,0.00075809006,0.0010701682,0.0019149102,0.0052301288,0.0018532297,0.00088554627,0.0006780929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022183589,0.0001244763,0.0038173783,0.00025491795,0.00006256196,0.00081042113,0.0008662186,0.00974548,0.005626519,0.95564806,0.0019189081,0.020903112],"study_design_scores_gemma":[0.00007619245,0.00010750854,0.0019566002,0.00006977624,0.00007963227,0.0010971938,0.0003886645,0.05237285,0.0045499937,0.92656344,0.012684055,0.000054221484],"about_ca_topic_score_codex":0.0017237115,"about_ca_topic_score_gemma":0.001858113,"teacher_disagreement_score":0.005301256,"about_ca_system_score_codex":0.0013299418,"about_ca_system_score_gemma":0.0007594502,"threshold_uncertainty_score":0.017734528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35780123,0.0038566925,0.3133703,0.0025771095,0.001013103,0.00010508651,0.00081032625,0.00068691693,0.3197793],"genre_scores_gemma":[0.88383204,0.0013814478,0.058301985,0.0008093278,0.0006939489,0.00015095675,0.000906119,0.00032034304,0.053603858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842936,0.00028393327,0.00009570259,0.00059728255,0.0003481751,0.0002455408],"domain_scores_gemma":[0.99639845,0.0014725622,0.0004857662,0.0005358901,0.00060012157,0.0005071471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010236937,0.0005472993,0.0005676643,0.0020416393,0.002975352,0.0042023873,0.0008523173,0.0015469504,0.011036161],"category_scores_gemma":[0.0037830146,0.0004917624,0.0006322294,0.0008014189,0.004266184,0.009119991,0.003873424,0.002961967,0.0019515379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006851978,0.000013149225,0.0007022946,0.00003190467,0.000008221859,0.00014865995,0.00043019606,0.0006611893,0.000789104,0.9885132,0.00076118973,0.007872242],"study_design_scores_gemma":[0.000009483757,0.000029254097,0.00040002947,0.00004059078,0.000008913372,0.00017196227,0.00033131678,0.0015702016,0.0010075863,0.98170483,0.014714635,0.000011163359],"about_ca_topic_score_codex":0.0006635313,"about_ca_topic_score_gemma":0.00058176334,"teacher_disagreement_score":0.011036161,"about_ca_system_score_codex":0.00092938583,"about_ca_system_score_gemma":0.00038515983,"threshold_uncertainty_score":0.036919653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93760294,0.00013996591,0.053476367,0.00020625893,0.000023614382,0.000065734224,0.0002739796,0.00019372723,0.008017401],"genre_scores_gemma":[0.97321725,0.00006263077,0.024450248,0.000061920226,0.000016310469,0.00005778286,0.00040103402,0.000030236219,0.0017024906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992945,0.00012019342,0.00006187847,0.00018726979,0.00010073941,0.00023534456],"domain_scores_gemma":[0.9978157,0.000713769,0.0004902314,0.00030170754,0.00017248337,0.00050613604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047658058,0.0004176459,0.000423226,0.00044806334,0.00081082614,0.0012854682,0.00062909216,0.00035378025,0.0039122696],"category_scores_gemma":[0.0021264642,0.00028617666,0.0007662621,0.00059306057,0.0006802169,0.0011305603,0.0010192484,0.00078157795,0.00029511435],"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.003715364,0.0013939852,0.12306674,0.0011710322,0.0005646195,0.0015848484,0.0017202736,0.25120696,0.21688889,0.23246063,0.014002047,0.15222462],"study_design_scores_gemma":[0.0004340253,0.001866248,0.06645706,0.00016055217,0.00036750897,0.0026244842,0.001403798,0.6252252,0.06552838,0.20981446,0.02601267,0.00010562578],"about_ca_topic_score_codex":0.0013142519,"about_ca_topic_score_gemma":0.0016564771,"teacher_disagreement_score":0.0039122696,"about_ca_system_score_codex":0.00071087125,"about_ca_system_score_gemma":0.00035893437,"threshold_uncertainty_score":0.013087869},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77754027,0.0010786767,0.17748718,0.0016266784,0.0001362984,0.000116357165,0.0005514953,0.00031761642,0.04114555],"genre_scores_gemma":[0.9854629,0.00028456468,0.009944036,0.00018643794,0.00007514313,0.000047581474,0.00021121996,0.00005496671,0.0037331143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881387,0.00020477446,0.000054221447,0.00033532476,0.0003569925,0.0002349547],"domain_scores_gemma":[0.9905516,0.005227788,0.0013756478,0.0014208716,0.0005576277,0.00086645706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010586673,0.00027754842,0.0004988513,0.0007459124,0.0010782912,0.0012567976,0.0011072535,0.0007881431,0.008444021],"category_scores_gemma":[0.007436745,0.00037638628,0.00063757395,0.0009121956,0.0027854948,0.002709916,0.001999259,0.0011792874,0.00045194585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009715918,0.000100990874,0.01680845,0.00038831233,0.00010012873,0.0007809338,0.0007913937,0.05092501,0.022216704,0.85208637,0.0070733665,0.047756746],"study_design_scores_gemma":[0.00017384149,0.00042396708,0.01039425,0.00008544363,0.00010285514,0.002933444,0.00069549266,0.18527289,0.024953296,0.74934417,0.025521457,0.00009893643],"about_ca_topic_score_codex":0.0011759244,"about_ca_topic_score_gemma":0.0007474362,"teacher_disagreement_score":0.008444021,"about_ca_system_score_codex":0.0010499606,"about_ca_system_score_gemma":0.00051011227,"threshold_uncertainty_score":0.028248012},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9256703,0.00045455425,0.06245014,0.00019693334,0.00004188768,0.0000688887,0.00034425518,0.00031863624,0.010454309],"genre_scores_gemma":[0.97752476,0.0001347094,0.018705944,0.000039862993,0.00004641977,0.00003698684,0.00033308435,0.00003594562,0.0031424053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896455,0.00014634294,0.00011293288,0.0002614748,0.00027244963,0.00024223299],"domain_scores_gemma":[0.99396557,0.0029785084,0.0011515743,0.000699232,0.00060867035,0.0005964264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008829314,0.00035944575,0.0006434068,0.0020911023,0.00096125685,0.0019457355,0.0007920008,0.0005243029,0.0041804886],"category_scores_gemma":[0.007434468,0.0003077208,0.0005805013,0.0013495885,0.0010353018,0.0021975604,0.00094823405,0.0011322146,0.00037211744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096172263,0.0003241525,0.04511288,0.00058319856,0.00013728453,0.00057906855,0.0013070412,0.06745164,0.027747693,0.6424856,0.0040693926,0.20924027],"study_design_scores_gemma":[0.000070503644,0.00038361386,0.013691461,0.00009893037,0.00018413115,0.0012342273,0.00040429406,0.21254808,0.01873222,0.7399742,0.012599051,0.00007925857],"about_ca_topic_score_codex":0.0009442196,"about_ca_topic_score_gemma":0.0011402908,"teacher_disagreement_score":0.0041804886,"about_ca_system_score_codex":0.0007105281,"about_ca_system_score_gemma":0.00031915613,"threshold_uncertainty_score":0.013985157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4415412,0.0023779252,0.31595707,0.026055476,0.0021838585,0.000085949,0.00083249353,0.0011216119,0.20984434],"genre_scores_gemma":[0.96164644,0.0004590633,0.027463734,0.0014125508,0.0006670044,0.00006793927,0.0002206009,0.00007603454,0.007986775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935097,0.00015276838,0.0000276908,0.00017369997,0.00020057579,0.00009432302],"domain_scores_gemma":[0.9948027,0.0034014832,0.00033242092,0.0006743883,0.0005313814,0.00025765123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016404557,0.00034886258,0.00047779395,0.0010337721,0.0011895932,0.0012486546,0.00087156374,0.0010874843,0.011873808],"category_scores_gemma":[0.009373492,0.00026308652,0.00058975373,0.0007187558,0.0034074571,0.0042268764,0.0027810626,0.0029825382,0.0005100009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000325048,0.000018426717,0.00030908178,0.000038746934,0.0000045007855,0.00007549661,0.00014017726,0.0011268584,0.0006922314,0.9910659,0.003391417,0.0031046406],"study_design_scores_gemma":[0.000019331683,0.00001635906,0.00033229074,0.000022158938,0.0000038647217,0.00014233892,0.000063317995,0.010197604,0.0007932092,0.98060995,0.007789814,0.000009782068],"about_ca_topic_score_codex":0.0008815373,"about_ca_topic_score_gemma":0.00061847694,"teacher_disagreement_score":0.011873808,"about_ca_system_score_codex":0.0012497052,"about_ca_system_score_gemma":0.0005507379,"threshold_uncertainty_score":0.039721847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7668024,0.00092363055,0.22132811,0.00088042975,0.00007832269,0.00028025304,0.0013865986,0.00029804913,0.008022212],"genre_scores_gemma":[0.8387117,0.0006376536,0.15208213,0.00016319728,0.00007290175,0.00014974581,0.002894645,0.000056611785,0.005231517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959964,0.00011024132,0.000047170386,0.00010892165,0.00006814082,0.0000658453],"domain_scores_gemma":[0.9977709,0.001465302,0.00033611525,0.00017629722,0.000086135275,0.00016527843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006400241,0.00058458,0.0008868002,0.00073195976,0.00065536273,0.0010657761,0.0006119151,0.0010197515,0.00456417],"category_scores_gemma":[0.0028486485,0.0005771426,0.00090958056,0.0014007424,0.000810114,0.0023015374,0.0010639247,0.00078238273,0.0002789789],"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.0015813109,0.0005326437,0.009107899,0.001724474,0.00039489925,0.0023808887,0.00092553376,0.49148384,0.018722478,0.31467474,0.015152127,0.14331914],"study_design_scores_gemma":[0.0004565228,0.00038350522,0.0038416304,0.00015022041,0.0002067046,0.0018829816,0.0007449002,0.46264064,0.008075943,0.5110291,0.010532255,0.000055577788],"about_ca_topic_score_codex":0.0010688311,"about_ca_topic_score_gemma":0.0020521854,"teacher_disagreement_score":0.00456417,"about_ca_system_score_codex":0.0009462797,"about_ca_system_score_gemma":0.00055272726,"threshold_uncertainty_score":0.015268683},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8704271,0.0007835833,0.09474597,0.00059522747,0.000050857856,0.0000734242,0.0013114276,0.00042763495,0.031584855],"genre_scores_gemma":[0.97873014,0.0002650223,0.017069925,0.0000736092,0.000048311995,0.00005519808,0.0008000485,0.00003811936,0.0029196874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991177,0.0001316278,0.000049295464,0.00025070284,0.0002218536,0.00022881327],"domain_scores_gemma":[0.99821234,0.00059604493,0.0004654914,0.00035387027,0.00016713224,0.00020505473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339235,0.00037453277,0.0006556398,0.0012232536,0.001120166,0.0014817894,0.00077550113,0.00062366313,0.004395453],"category_scores_gemma":[0.002979256,0.0005167755,0.00052739977,0.0018042034,0.0010323668,0.0021625194,0.0016145909,0.00065692107,0.00044382812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006500469,0.00011569737,0.009677125,0.00035380237,0.00017580339,0.001080628,0.00084113097,0.03357557,0.0166198,0.8548868,0.0083956225,0.07362807],"study_design_scores_gemma":[0.0000729778,0.000094047966,0.0067830686,0.00005353354,0.00010255141,0.0017666228,0.0005285204,0.07099489,0.0071348078,0.89383507,0.01859114,0.000042769974],"about_ca_topic_score_codex":0.000782998,"about_ca_topic_score_gemma":0.0008113304,"teacher_disagreement_score":0.004395453,"about_ca_system_score_codex":0.0006108324,"about_ca_system_score_gemma":0.0003548211,"threshold_uncertainty_score":0.014704287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86878586,0.0004955229,0.108838834,0.0003398499,0.000033140237,0.000074813914,0.00078047154,0.00028932662,0.020362215],"genre_scores_gemma":[0.96998703,0.00026588276,0.02669999,0.000079934565,0.000053070307,0.00006982191,0.0006757146,0.00008752076,0.0020810051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999382,0.00015108156,0.000029981567,0.00014017551,0.00015170343,0.00014497965],"domain_scores_gemma":[0.996548,0.0017826551,0.000536239,0.00032181139,0.00037884887,0.0004324424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077761716,0.00047308864,0.00042568834,0.0037075733,0.0011439512,0.0017427083,0.0005588532,0.00043282102,0.0044382215],"category_scores_gemma":[0.0036539189,0.0004485635,0.00036447938,0.0016189644,0.0017820649,0.0020151993,0.0010581007,0.0007595913,0.0003428034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079339585,0.00018374219,0.008017677,0.00014173928,0.000056039644,0.0002845095,0.0009850091,0.06679831,0.027391331,0.8421845,0.0063781734,0.046785545],"study_design_scores_gemma":[0.00007406667,0.00008656688,0.0033081577,0.000067614994,0.000027609522,0.00031526797,0.00036081488,0.19871426,0.004762866,0.787275,0.0049684662,0.00003940019],"about_ca_topic_score_codex":0.0028505616,"about_ca_topic_score_gemma":0.002349138,"teacher_disagreement_score":0.0044382215,"about_ca_system_score_codex":0.0017399348,"about_ca_system_score_gemma":0.00058147364,"threshold_uncertainty_score":0.014847338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82458735,0.00066312595,0.13736388,0.00070015417,0.000060044313,0.000056146702,0.00024786108,0.00011085868,0.036210533],"genre_scores_gemma":[0.98587835,0.0003333507,0.010267827,0.000044339984,0.00008072274,0.000059886017,0.00014141985,0.00004358725,0.00315056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976507,0.0007448838,0.00015818283,0.00043701744,0.0007375805,0.00027162305],"domain_scores_gemma":[0.986272,0.008285183,0.0017867456,0.0011193737,0.0013298985,0.0012069157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024253284,0.00052684004,0.00093061925,0.003100886,0.0017409845,0.0039070104,0.0010719881,0.0007561233,0.0053293738],"category_scores_gemma":[0.012602607,0.00077628816,0.00090704695,0.00204186,0.006784728,0.008790955,0.0036611003,0.0016145748,0.0004792968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058287198,0.000017389422,0.00094311865,0.000046575802,0.000022365608,0.00014303488,0.000578762,0.0019549509,0.0010976621,0.9917532,0.00020913279,0.0031754717],"study_design_scores_gemma":[0.000009644057,0.000019313138,0.00035389088,0.000017849728,0.000010818934,0.00020548624,0.0002071698,0.004675583,0.00071028806,0.9928947,0.00088433333,0.000010989244],"about_ca_topic_score_codex":0.00050128915,"about_ca_topic_score_gemma":0.00037646573,"teacher_disagreement_score":0.0053293738,"about_ca_system_score_codex":0.00081031857,"about_ca_system_score_gemma":0.00037076513,"threshold_uncertainty_score":0.017828524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32864684,0.0018627318,0.642128,0.0037128616,0.00016997526,0.00006164722,0.0005091234,0.0013591383,0.021549674],"genre_scores_gemma":[0.9261735,0.00040247675,0.06912845,0.0004907462,0.00013513373,0.000082672734,0.0002340196,0.00029124346,0.0030617549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972723,0.0012069083,0.00006438947,0.0005990384,0.00041453302,0.00044271856],"domain_scores_gemma":[0.93669784,0.052942973,0.0034388453,0.0038196822,0.0013919529,0.0017086162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037970846,0.0009985127,0.00085182773,0.0019616578,0.0012475573,0.002450877,0.003262127,0.0013177013,0.005284674],"category_scores_gemma":[0.029680658,0.00089857273,0.0006160467,0.0013285651,0.0028722684,0.008448199,0.0027159527,0.0023154048,0.0007145641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001064191,0.0002656112,0.013476532,0.00036761328,0.00011965277,0.00037975275,0.00054126524,0.29428416,0.010213048,0.6242972,0.014196452,0.040794514],"study_design_scores_gemma":[0.000018780556,0.000041098705,0.0009780817,0.000037940626,0.000016159387,0.00007748994,0.000098445606,0.7271854,0.0016364948,0.26790538,0.0019786959,0.000026014884],"about_ca_topic_score_codex":0.0037543792,"about_ca_topic_score_gemma":0.0041008443,"teacher_disagreement_score":0.005284674,"about_ca_system_score_codex":0.0032436794,"about_ca_system_score_gemma":0.0008057139,"threshold_uncertainty_score":0.023534715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94443166,0.0008124022,0.041553147,0.00015206105,0.00005747139,0.000031092404,0.00020328892,0.00021406896,0.01254487],"genre_scores_gemma":[0.99208003,0.0002255799,0.0050014146,0.00004759538,0.000031655898,0.000026269105,0.0002749359,0.000038304737,0.0022741735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947315,0.0000801341,0.000020910727,0.00015391227,0.0001281199,0.00014378555],"domain_scores_gemma":[0.99821764,0.000615591,0.00032976113,0.00023561977,0.00021622407,0.00038521487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022579536,0.0003854274,0.0005033418,0.0014418447,0.00095460255,0.0010390086,0.0004946337,0.00057964236,0.0040596593],"category_scores_gemma":[0.0023366893,0.00032622856,0.00040567332,0.0011149612,0.0008947264,0.0012566168,0.0012987389,0.00044602255,0.00030074047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014640148,0.0003021093,0.036372144,0.0006166816,0.00025040007,0.0037264703,0.0035427958,0.094023064,0.07122456,0.6354256,0.01084398,0.14220826],"study_design_scores_gemma":[0.00010547032,0.00046922237,0.019178854,0.0001340757,0.00012792813,0.0036321424,0.00093967206,0.3421393,0.019739162,0.5786346,0.034827773,0.00007176788],"about_ca_topic_score_codex":0.002233492,"about_ca_topic_score_gemma":0.0016137157,"teacher_disagreement_score":0.0040596593,"about_ca_system_score_codex":0.0006601564,"about_ca_system_score_gemma":0.00025181766,"threshold_uncertainty_score":0.013580978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7785076,0.000564043,0.19222082,0.0003991555,0.00012157071,0.000058819318,0.00013895122,0.00042828164,0.027560774],"genre_scores_gemma":[0.9744444,0.00015306579,0.019309208,0.00012038151,0.00005305282,0.000031606618,0.00011556151,0.000068435154,0.0057042926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989704,0.00023061082,0.00006362121,0.0003042136,0.00025640085,0.0001748345],"domain_scores_gemma":[0.9970958,0.0014989148,0.0004111261,0.00031761517,0.00039398888,0.00028242354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787417,0.00028032187,0.000451236,0.00070563314,0.0008798443,0.0011885524,0.00050045893,0.0004255417,0.004450327],"category_scores_gemma":[0.0035239425,0.00028451442,0.00044560095,0.00040250883,0.002063639,0.0032242874,0.0010678906,0.0008171351,0.00040790878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030449635,0.000052628588,0.003078952,0.000112366215,0.000028204784,0.0007303304,0.00083979056,0.0024225859,0.013186523,0.9594206,0.00093262875,0.018890733],"study_design_scores_gemma":[0.000054860026,0.00012082087,0.0017871398,0.00003602079,0.000057614223,0.0012142424,0.0005279398,0.017024165,0.013327447,0.9522782,0.013525065,0.00004654418],"about_ca_topic_score_codex":0.0010663728,"about_ca_topic_score_gemma":0.0010471481,"teacher_disagreement_score":0.004450327,"about_ca_system_score_codex":0.00061006297,"about_ca_system_score_gemma":0.00041662293,"threshold_uncertainty_score":0.01488781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.799122,0.00046388482,0.1500355,0.00031868156,0.00008866417,0.00007025415,0.00039119236,0.000377315,0.049132507],"genre_scores_gemma":[0.9774908,0.000103956525,0.019401334,0.00005452366,0.000022694036,0.000026531281,0.00028820662,0.00002428493,0.0025876926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996278,0.00007137602,0.00001736158,0.000116960626,0.00009300153,0.00007349945],"domain_scores_gemma":[0.9983291,0.000702011,0.00032786932,0.00022177218,0.00021524107,0.00020395471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026093394,0.00017127194,0.00023724364,0.0008531734,0.00086451514,0.0013702131,0.00044462507,0.00042176346,0.0055999216],"category_scores_gemma":[0.0017857933,0.00021153089,0.0003130256,0.00081503583,0.0015158642,0.0022676534,0.00083736796,0.00051623216,0.00034708463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027705883,0.0000568661,0.0044198297,0.00014191755,0.000022990951,0.0004952692,0.0011235301,0.00438908,0.010476223,0.94096214,0.0014614149,0.03617361],"study_design_scores_gemma":[0.000048682272,0.0001559267,0.0094419,0.00009410701,0.00007714486,0.0018370718,0.0017087088,0.044595256,0.014975288,0.89459926,0.032410655,0.000056016437],"about_ca_topic_score_codex":0.0016900613,"about_ca_topic_score_gemma":0.0015459262,"teacher_disagreement_score":0.0055999216,"about_ca_system_score_codex":0.00046215465,"about_ca_system_score_gemma":0.0003445957,"threshold_uncertainty_score":0.018733561},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7260802,0.00039963587,0.20666698,0.0012651709,0.0004064832,0.00021631809,0.00100184,0.0009681529,0.06299525],"genre_scores_gemma":[0.9648061,0.00011803745,0.028369693,0.00022817937,0.00006132626,0.00008949935,0.00044890773,0.00006884867,0.0058094617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.00014635299,0.00009168193,0.0003301993,0.00022307721,0.00023544847],"domain_scores_gemma":[0.9957755,0.0014229083,0.0008126549,0.00077497645,0.0005307164,0.0006832259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009206052,0.0002573198,0.00054070714,0.00043676782,0.0014015336,0.0013561171,0.0009071248,0.0007040405,0.009762178],"category_scores_gemma":[0.0036842541,0.0004801283,0.00081106374,0.00034833932,0.0024015936,0.0031171606,0.0024586655,0.0015177028,0.00073070807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010801806,0.00038117624,0.006452972,0.0005900933,0.0001129515,0.0033916584,0.0014020965,0.0075105997,0.051520668,0.87456894,0.007987134,0.04500158],"study_design_scores_gemma":[0.00036310634,0.000611853,0.0043944903,0.00013172692,0.00012106609,0.0053265784,0.0020119902,0.0385573,0.042635188,0.87091535,0.034821622,0.000109785644],"about_ca_topic_score_codex":0.0007531949,"about_ca_topic_score_gemma":0.0006271964,"teacher_disagreement_score":0.009762178,"about_ca_system_score_codex":0.00047537807,"about_ca_system_score_gemma":0.0008831894,"threshold_uncertainty_score":0.032657683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94764066,0.00032567035,0.03853229,0.00030252888,0.00002059,0.000027563157,0.00019028032,0.00026385929,0.012696538],"genre_scores_gemma":[0.99364954,0.00008201928,0.004736688,0.0000322579,0.000012447137,0.00003664632,0.00016849564,0.000022330145,0.0012595595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991366,0.00025361302,0.000038797865,0.00019312526,0.00024504992,0.00013285881],"domain_scores_gemma":[0.9960824,0.0023367063,0.00047306414,0.0005158598,0.000264378,0.00032761227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005819754,0.00035562756,0.0004543259,0.0013645549,0.0015682366,0.0015189765,0.00069296424,0.00059511204,0.0024019354],"category_scores_gemma":[0.003773264,0.0006805145,0.0005066195,0.00073353335,0.0019664753,0.002091373,0.0017259924,0.0008270729,0.0001379278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026311926,0.00007423318,0.011183673,0.00017786164,0.00009673471,0.0033664943,0.0033046252,0.015418184,0.011001029,0.93830615,0.002897466,0.013910345],"study_design_scores_gemma":[0.0001152986,0.00011048532,0.012626837,0.00009773318,0.0001250228,0.00515399,0.0017452467,0.062078103,0.007954344,0.8958946,0.014016265,0.00008197014],"about_ca_topic_score_codex":0.00065398443,"about_ca_topic_score_gemma":0.0009859814,"teacher_disagreement_score":0.0024019354,"about_ca_system_score_codex":0.0008796691,"about_ca_system_score_gemma":0.00020841816,"threshold_uncertainty_score":0.008035302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53696275,0.0017724754,0.42217034,0.0024176668,0.00019553716,0.00033999459,0.0015728306,0.0007606438,0.03380779],"genre_scores_gemma":[0.82052135,0.0010504364,0.1643798,0.00024442843,0.00019921968,0.00022777132,0.0018339348,0.00026248314,0.011280596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913967,0.00022586797,0.00006677918,0.0002009036,0.00010685887,0.00025991048],"domain_scores_gemma":[0.9981483,0.0009276829,0.0002921213,0.00030713857,0.00008443927,0.0002402867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009324223,0.0009999713,0.0015817846,0.00074478023,0.0012482016,0.0028624334,0.0018259047,0.002417197,0.009318509],"category_scores_gemma":[0.004586987,0.0009770868,0.0009610028,0.00201202,0.0011953759,0.0053184726,0.0021013361,0.0011756602,0.0010745714],"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.0028631652,0.0006985126,0.0057316166,0.0017223686,0.00037761338,0.0012353536,0.0014420891,0.44816992,0.025245192,0.23679559,0.036116205,0.23960225],"study_design_scores_gemma":[0.00022625322,0.00090911926,0.0042270976,0.00019494334,0.00024648636,0.002601495,0.0015042385,0.62759036,0.019900152,0.3123445,0.03014369,0.00011175039],"about_ca_topic_score_codex":0.0013950844,"about_ca_topic_score_gemma":0.0007577055,"teacher_disagreement_score":0.009318509,"about_ca_system_score_codex":0.00090471614,"about_ca_system_score_gemma":0.00055054,"threshold_uncertainty_score":0.031173468},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75253004,0.0001744521,0.23536246,0.0011120769,0.00003284429,0.00023099183,0.00081355346,0.0008670153,0.008876564],"genre_scores_gemma":[0.94993544,0.0000679541,0.046188667,0.00014042413,0.000030693293,0.000098620825,0.00088525505,0.00014747244,0.0025055283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985323,0.00029228828,0.00009502995,0.0006011,0.00020813815,0.00027117945],"domain_scores_gemma":[0.9907985,0.0056938613,0.00096085377,0.001272281,0.0005468789,0.0007276967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014675509,0.0006062213,0.00063246745,0.00069712463,0.0013329587,0.0026491547,0.0012816272,0.0012462788,0.0053677573],"category_scores_gemma":[0.0065131215,0.00048959267,0.00096997974,0.0009975276,0.00205469,0.0049123843,0.002174241,0.0017267969,0.0004269561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002296071,0.00088874367,0.02135191,0.0005409534,0.00019515493,0.0006802077,0.0020788515,0.20741493,0.057908244,0.60242325,0.009588112,0.094633594],"study_design_scores_gemma":[0.000104536564,0.00020239159,0.0027558361,0.000046048426,0.00006156662,0.00040030372,0.0005915415,0.3848211,0.02576817,0.5799723,0.0052032494,0.00007296799],"about_ca_topic_score_codex":0.002518435,"about_ca_topic_score_gemma":0.002473909,"teacher_disagreement_score":0.0053677573,"about_ca_system_score_codex":0.0018862609,"about_ca_system_score_gemma":0.0012605068,"threshold_uncertainty_score":0.017956913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7657896,0.0024147283,0.20020288,0.0017237553,0.000113853595,0.00004970643,0.0004351865,0.0006913843,0.028578911],"genre_scores_gemma":[0.9839684,0.0005407285,0.013528364,0.00023645333,0.00010332344,0.000032944034,0.00015719779,0.00007959182,0.0013530144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881387,0.0001974745,0.000060037364,0.0004100474,0.0002102496,0.00030834446],"domain_scores_gemma":[0.9904265,0.006074713,0.0008799617,0.00089960475,0.0006268815,0.0010924825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017842377,0.00063823117,0.0017374975,0.0018054148,0.0018835984,0.0029184823,0.0014896068,0.0011633697,0.0047562514],"category_scores_gemma":[0.012553624,0.0009290844,0.0007533212,0.0019227802,0.0023505646,0.006533292,0.003340458,0.0018501125,0.0005007185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005114675,0.0002129978,0.011039937,0.000671505,0.00015928382,0.0011463834,0.0022228707,0.038940296,0.02339871,0.88618475,0.0063928477,0.029118901],"study_design_scores_gemma":[0.00006458046,0.00014872635,0.003644955,0.00011607113,0.00015476055,0.001407712,0.0007986294,0.08778218,0.0074906535,0.89161944,0.006724316,0.000047999813],"about_ca_topic_score_codex":0.0011237657,"about_ca_topic_score_gemma":0.0010917297,"teacher_disagreement_score":0.0047562514,"about_ca_system_score_codex":0.0010736668,"about_ca_system_score_gemma":0.00041733528,"threshold_uncertainty_score":0.015911222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75889665,0.0025946537,0.19908544,0.0026061805,0.00013075031,0.000036538106,0.00034675217,0.0009976709,0.035305373],"genre_scores_gemma":[0.9871296,0.0005229457,0.010570611,0.0002360715,0.00012458295,0.00002676915,0.00012853838,0.00008961691,0.0011712176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993703,0.00013574566,0.000025869713,0.00018610037,0.00014300716,0.00013909831],"domain_scores_gemma":[0.9874692,0.00883935,0.0008696663,0.0010801259,0.00077212154,0.0009696176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001528542,0.00043306992,0.00094787276,0.0013406613,0.0011469016,0.0017811642,0.0014821006,0.0009838528,0.0039052872],"category_scores_gemma":[0.018042434,0.00044038938,0.0005415146,0.0011336618,0.002158114,0.0051335557,0.0021168897,0.0017531535,0.00036393394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043243793,0.00020203831,0.018090513,0.0006586004,0.00013766388,0.001073242,0.0013681193,0.06437512,0.024873858,0.8396676,0.010429301,0.03869158],"study_design_scores_gemma":[0.00004273447,0.00011234899,0.0057995655,0.00011746326,0.00011591456,0.0015846355,0.0005620341,0.2419919,0.0078266775,0.7370671,0.004739929,0.000039620438],"about_ca_topic_score_codex":0.00078162935,"about_ca_topic_score_gemma":0.0009224249,"teacher_disagreement_score":0.0039052872,"about_ca_system_score_codex":0.0010577111,"about_ca_system_score_gemma":0.0003994672,"threshold_uncertainty_score":0.013064504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53314614,0.007226721,0.23876677,0.014824755,0.0006262869,0.00027822933,0.0030797184,0.0018482336,0.20020309],"genre_scores_gemma":[0.95723265,0.0015097394,0.026379768,0.0007152827,0.0005143031,0.00011367481,0.00074014877,0.00034682767,0.012447585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738044,0.00027958886,0.000051723076,0.0006135953,0.0006454004,0.0010292392],"domain_scores_gemma":[0.98134124,0.013592522,0.0011868884,0.001481807,0.0010425546,0.0013548726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017958304,0.0012582007,0.0011400692,0.0021300358,0.0020532452,0.0045238556,0.0026457692,0.0012694811,0.012416533],"category_scores_gemma":[0.010466385,0.0005464189,0.0013485915,0.001837715,0.0037996594,0.0059292167,0.0033041257,0.004588653,0.0013885028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022741107,0.0005210287,0.012727442,0.0008847668,0.00017216327,0.0004908038,0.0010117319,0.10748524,0.0402472,0.7149823,0.032263033,0.08694021],"study_design_scores_gemma":[0.00019510217,0.00022219768,0.006084708,0.00018653552,0.00015780987,0.00043397615,0.0003229404,0.25259897,0.016669758,0.70392776,0.019088361,0.00011181604],"about_ca_topic_score_codex":0.007805077,"about_ca_topic_score_gemma":0.0092817405,"teacher_disagreement_score":0.012416533,"about_ca_system_score_codex":0.008226397,"about_ca_system_score_gemma":0.0018478524,"threshold_uncertainty_score":0.05968696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8321688,0.00081078673,0.10999912,0.005450422,0.00018672315,0.00004536157,0.00035949564,0.00029308515,0.05068621],"genre_scores_gemma":[0.991659,0.00017970754,0.005118559,0.0003324669,0.00018027864,0.000056304845,0.00011064421,0.000038999446,0.0023239632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976253,0.00078733894,0.0000891929,0.00044624702,0.00051383814,0.00053801644],"domain_scores_gemma":[0.97536033,0.016228084,0.0018203664,0.0022950836,0.0022711144,0.002025031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005326998,0.0003475813,0.0011456895,0.0025841712,0.0025571682,0.0034131065,0.002211842,0.0020229656,0.0055443617],"category_scores_gemma":[0.039024685,0.00058756175,0.0006849506,0.0014745425,0.0068373443,0.006293306,0.0031890285,0.0027378702,0.0006658777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020346855,0.000029032959,0.002199383,0.000025362295,0.0000068233376,0.00006570541,0.0004667824,0.0047716736,0.00076912076,0.98541313,0.0016603784,0.0043892344],"study_design_scores_gemma":[0.000044645418,0.000040983785,0.0012706707,0.000022072101,0.000004859893,0.000090238966,0.00040168385,0.024295187,0.00066572026,0.97129405,0.0018453641,0.000024592466],"about_ca_topic_score_codex":0.0022952731,"about_ca_topic_score_gemma":0.0014915862,"teacher_disagreement_score":0.0055443617,"about_ca_system_score_codex":0.0023614462,"about_ca_system_score_gemma":0.0006692028,"threshold_uncertainty_score":0.028172195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89375466,0.00042665933,0.06887153,0.0004930613,0.000029838204,0.000050480277,0.00056950905,0.00012552437,0.035678748],"genre_scores_gemma":[0.9914238,0.00018886018,0.0069224737,0.00004796864,0.000023616203,0.000043307875,0.00024427997,0.00001934736,0.0010863153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00022196968,0.000035067926,0.00012371416,0.00012274638,0.000071512986],"domain_scores_gemma":[0.9962339,0.002451285,0.000494947,0.0002501111,0.0002971038,0.0002726458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004042446,0.00022595063,0.00030492592,0.0017315289,0.0009155174,0.001599986,0.0005681958,0.00064203993,0.0043728016],"category_scores_gemma":[0.0035041694,0.00032359746,0.00022124988,0.0017141226,0.0016673267,0.0023616494,0.0010228349,0.00054268003,0.00020588959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022773808,0.000055712622,0.0072098523,0.00027010054,0.000071930874,0.00077223906,0.0012110252,0.019752506,0.012946151,0.9296679,0.0023017847,0.025513122],"study_design_scores_gemma":[0.000042807907,0.00004825671,0.0056418027,0.00009174647,0.000078578414,0.0006625077,0.0006315185,0.05908872,0.0074362606,0.91960585,0.0066400208,0.00003191061],"about_ca_topic_score_codex":0.0010669194,"about_ca_topic_score_gemma":0.0009058426,"teacher_disagreement_score":0.0043728016,"about_ca_system_score_codex":0.00049821805,"about_ca_system_score_gemma":0.00021285935,"threshold_uncertainty_score":0.01462847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86065686,0.00064272404,0.11049107,0.00078134326,0.00006268257,0.00007270398,0.0006144741,0.00029093603,0.026387231],"genre_scores_gemma":[0.96884346,0.00030359463,0.024500823,0.00018483268,0.000034626508,0.000047342728,0.00089985115,0.00005994341,0.0051254155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996233,0.000060286737,0.000018773426,0.00009429582,0.00011664286,0.00008664756],"domain_scores_gemma":[0.9986424,0.00052495324,0.00027454374,0.00019949152,0.00016330731,0.0001953027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247506,0.00025279025,0.0003936718,0.0007135525,0.0007270586,0.0007764461,0.00047722246,0.000410415,0.0031216387],"category_scores_gemma":[0.0012732648,0.0003002669,0.0004891122,0.00078419765,0.00077259674,0.0016022605,0.0011723175,0.000874137,0.00033614217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003248179,0.00017462582,0.007884507,0.00028541576,0.00006556548,0.0018988183,0.0016917173,0.013467579,0.025101691,0.9003253,0.005863315,0.042916734],"study_design_scores_gemma":[0.00005375411,0.000097007054,0.0057614306,0.000073685216,0.000085423206,0.0010901695,0.0007321185,0.031580858,0.008383644,0.93113375,0.020981299,0.000026878888],"about_ca_topic_score_codex":0.0012746863,"about_ca_topic_score_gemma":0.0016247126,"teacher_disagreement_score":0.0031216387,"about_ca_system_score_codex":0.000586386,"about_ca_system_score_gemma":0.00023787942,"threshold_uncertainty_score":0.010442913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59045225,0.00062988675,0.2975665,0.0014564752,0.00034560598,0.00007676046,0.00055169535,0.0002692251,0.108651556],"genre_scores_gemma":[0.96162534,0.00040647565,0.02240735,0.0001461838,0.00020820128,0.00002583809,0.00023767537,0.00010027777,0.0148426695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997162,0.000050674353,0.0000073846113,0.00004893974,0.00010931806,0.00006748591],"domain_scores_gemma":[0.9992487,0.00033278152,0.00009469775,0.00007605224,0.00016096607,0.00008677102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036349357,0.00034076557,0.0002314515,0.001091738,0.00051072065,0.00097437983,0.00043327987,0.00034094497,0.005124779],"category_scores_gemma":[0.0016349653,0.0001047905,0.0004282566,0.0010785721,0.0014307935,0.0017402413,0.0007180859,0.0014577737,0.0005283935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003193905,0.000020155197,0.00031490772,0.000031898748,0.000003853711,0.00006040055,0.0001348677,0.0056553427,0.0040996945,0.97489244,0.001698854,0.013055631],"study_design_scores_gemma":[0.000018484678,0.000053446856,0.001328108,0.000022626118,0.000010363379,0.00027372866,0.00016068998,0.054993466,0.0053744284,0.919214,0.018522125,0.000028504199],"about_ca_topic_score_codex":0.0020894294,"about_ca_topic_score_gemma":0.0018646892,"teacher_disagreement_score":0.005124779,"about_ca_system_score_codex":0.0012068506,"about_ca_system_score_gemma":0.0007228498,"threshold_uncertainty_score":0.017144084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8694395,0.0005642734,0.10169343,0.00044757375,0.000040823077,0.000048047797,0.00026068295,0.0000867301,0.02741897],"genre_scores_gemma":[0.9912934,0.00011143613,0.006789293,0.000036993417,0.00003968405,0.000026634787,0.00011380926,0.000022103473,0.0015666963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991454,0.00020659083,0.000059258113,0.00018969504,0.00027531327,0.0001237749],"domain_scores_gemma":[0.991839,0.004280982,0.0011583618,0.0004435769,0.0011883584,0.0010896736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014718454,0.0003585573,0.00048114653,0.0029380233,0.0012558043,0.0015618132,0.0006455385,0.00085137045,0.004986309],"category_scores_gemma":[0.008990114,0.00041937298,0.0004905407,0.0010777937,0.0022171459,0.0026571557,0.0018860966,0.0010974904,0.0003753375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002780774,0.000049555332,0.0080010975,0.00010745415,0.000035494144,0.00031455953,0.0007808452,0.013712731,0.014283408,0.9512906,0.0010999182,0.0100461785],"study_design_scores_gemma":[0.00005762684,0.0002070383,0.006371715,0.000074052994,0.000039943407,0.0011482121,0.0008393108,0.110638246,0.012050897,0.8630124,0.00550873,0.00005183031],"about_ca_topic_score_codex":0.0004866709,"about_ca_topic_score_gemma":0.00042391242,"teacher_disagreement_score":0.004986309,"about_ca_system_score_codex":0.0008029156,"about_ca_system_score_gemma":0.00018178085,"threshold_uncertainty_score":0.016680896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37050474,0.001248531,0.6017892,0.0010352127,0.000097995464,0.00048551612,0.0020500321,0.001767029,0.021021793],"genre_scores_gemma":[0.70282394,0.000668985,0.28453687,0.00025179362,0.00006724567,0.00016289734,0.0022041786,0.00040289594,0.008881074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991559,0.000120477285,0.00005329257,0.00033744477,0.00012833891,0.00020465594],"domain_scores_gemma":[0.9973748,0.0014249082,0.00033259235,0.00041396325,0.00026683896,0.00018704697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005374802,0.0009857143,0.0009968522,0.0009361315,0.0010188081,0.0013600372,0.0010683445,0.0010386265,0.01034052],"category_scores_gemma":[0.0039212047,0.0006431291,0.0010926182,0.0012630492,0.0010037768,0.004756342,0.0014258737,0.00095747085,0.001088833],"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.0022011911,0.0006833408,0.011200901,0.002093569,0.0002651492,0.0015680795,0.0014361126,0.36181948,0.046851516,0.29992032,0.031106954,0.24085346],"study_design_scores_gemma":[0.00024710235,0.0003977222,0.002516314,0.00014586508,0.00010375808,0.0015184075,0.00088067877,0.406232,0.028662572,0.5277607,0.031447,0.00008794537],"about_ca_topic_score_codex":0.005085409,"about_ca_topic_score_gemma":0.0051266295,"teacher_disagreement_score":0.01034052,"about_ca_system_score_codex":0.000936604,"about_ca_system_score_gemma":0.0008852189,"threshold_uncertainty_score":0.03459245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07935363,0.0047178264,0.60859144,0.01665849,0.004494521,0.00018321344,0.000773279,0.0010826378,0.2841449],"genre_scores_gemma":[0.7529641,0.003859098,0.16128984,0.007949248,0.0024427567,0.00036862388,0.0006949186,0.00061597675,0.06981546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940896,0.00012752146,0.0000246979,0.00013074388,0.00017681245,0.00013133998],"domain_scores_gemma":[0.99889046,0.00049216405,0.000085234526,0.000103612896,0.00026679604,0.00016165388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009873238,0.0007465681,0.0004961804,0.0015376769,0.0014606321,0.0012344862,0.0013833967,0.0014715553,0.0164508],"category_scores_gemma":[0.002822327,0.0003890071,0.0013908036,0.0009985261,0.0025315362,0.004126521,0.0027515434,0.004305514,0.0017183479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037748847,0.000024763265,0.000093924406,0.00006491439,0.000014596734,0.00018054264,0.00017842733,0.0006809743,0.0020921472,0.97717005,0.008780429,0.010681385],"study_design_scores_gemma":[0.00003604455,0.00003779645,0.00035714134,0.000059518614,0.000012482409,0.0001898767,0.00005731393,0.0036735388,0.0024262934,0.9425045,0.050623994,0.000021476926],"about_ca_topic_score_codex":0.0013542352,"about_ca_topic_score_gemma":0.00080074335,"teacher_disagreement_score":0.0164508,"about_ca_system_score_codex":0.0010806739,"about_ca_system_score_gemma":0.0007802024,"threshold_uncertainty_score":0.055033386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7267811,0.00048301773,0.23065239,0.001282419,0.000052172876,0.000085920154,0.00089269027,0.000572715,0.03919763],"genre_scores_gemma":[0.97245854,0.0001812242,0.024237206,0.000092606446,0.00004694149,0.000036199897,0.0003640327,0.000049118084,0.0025341446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950445,0.000069197595,0.000015222223,0.0001540165,0.00014367996,0.00011336403],"domain_scores_gemma":[0.99617565,0.0024889747,0.00043373855,0.00030815005,0.00019146121,0.00040209398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056438654,0.0002357091,0.00040246968,0.00068711577,0.00073001586,0.0014212291,0.0009880974,0.00046216106,0.00332797],"category_scores_gemma":[0.0034734441,0.00029556573,0.00036653766,0.0009441922,0.0011692345,0.001961824,0.00093266484,0.0013868145,0.00020871309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040049353,0.00021651197,0.009267811,0.0002330325,0.000060493014,0.0003608132,0.0004400734,0.062390756,0.021738654,0.8422849,0.012089562,0.05051697],"study_design_scores_gemma":[0.00007397671,0.000076529504,0.0060938844,0.000031824817,0.000048638296,0.0004890558,0.00012441278,0.35468835,0.013411669,0.6168762,0.008048359,0.000037093818],"about_ca_topic_score_codex":0.0029765337,"about_ca_topic_score_gemma":0.0031227162,"teacher_disagreement_score":0.00332797,"about_ca_system_score_codex":0.00141686,"about_ca_system_score_gemma":0.00072586123,"threshold_uncertainty_score":0.011133134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32847592,0.00036771322,0.62694186,0.0011127273,0.000113392576,0.0002993831,0.0014511585,0.0019179395,0.039319873],"genre_scores_gemma":[0.92944866,0.00013790753,0.062510714,0.00020389477,0.00007124467,0.00014318712,0.0012972008,0.00012301689,0.0060642343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990976,0.00011871116,0.00005420624,0.000370008,0.0002257116,0.00013384708],"domain_scores_gemma":[0.996084,0.0015401517,0.00071453286,0.00064669125,0.0006795834,0.00033501763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003279252,0.00065462454,0.0003678942,0.0016771029,0.000869058,0.0016877274,0.00094473385,0.0006260575,0.0070141563],"category_scores_gemma":[0.0030667782,0.00032981957,0.00060887856,0.0014129067,0.0014700147,0.0027317929,0.0014504222,0.0016278682,0.0009112856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004891523,0.00024216862,0.007487978,0.00045661515,0.00008756925,0.0010006314,0.0011925085,0.05052755,0.070047244,0.7400251,0.013385963,0.11505749],"study_design_scores_gemma":[0.000035593104,0.00014676999,0.00412919,0.000054632677,0.00005410247,0.0010521121,0.00049808243,0.19791117,0.04425156,0.7276127,0.024185384,0.000068755144],"about_ca_topic_score_codex":0.0014444642,"about_ca_topic_score_gemma":0.0010305061,"teacher_disagreement_score":0.0070141563,"about_ca_system_score_codex":0.0008845903,"about_ca_system_score_gemma":0.0003373932,"threshold_uncertainty_score":0.02346468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6444945,0.00092597876,0.34890524,0.0004602812,0.000042943637,0.00006625265,0.00043147538,0.0005052915,0.004168081],"genre_scores_gemma":[0.98049986,0.00022990108,0.018181045,0.00009705545,0.000023982437,0.000039597788,0.00025363002,0.000046209814,0.0006287004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993741,0.00013015498,0.000036403046,0.00016234888,0.00014731046,0.00014965297],"domain_scores_gemma":[0.9913765,0.0049626594,0.0013392557,0.0005437434,0.0007744065,0.0010033231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016345326,0.0004285047,0.0008031038,0.0021833729,0.00061177014,0.0015713164,0.001047653,0.0009954021,0.0024505183],"category_scores_gemma":[0.017343884,0.0006444388,0.00043071122,0.0008502225,0.0014176037,0.0030448574,0.0013534043,0.001262779,0.00034979422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001375899,0.0002110752,0.024925113,0.0006189543,0.00017057109,0.0014740954,0.0010397136,0.22825724,0.08228042,0.6077587,0.004690003,0.047198337],"study_design_scores_gemma":[0.000051427738,0.00021694836,0.007164078,0.00008699509,0.00004946097,0.00088263274,0.0003134772,0.5844698,0.011884657,0.3927762,0.0020414253,0.00006290881],"about_ca_topic_score_codex":0.0006603156,"about_ca_topic_score_gemma":0.00063052523,"teacher_disagreement_score":0.0024505183,"about_ca_system_score_codex":0.0012749832,"about_ca_system_score_gemma":0.00026466773,"threshold_uncertainty_score":0.0092507005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89619744,0.00033294148,0.08607482,0.00049063645,0.000045803845,0.000055984263,0.0002656059,0.0003414105,0.016195275],"genre_scores_gemma":[0.9947044,0.00009203037,0.003948268,0.000057908972,0.000017045808,0.00003067356,0.00013078931,0.00003412481,0.0009847273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993761,0.00014425859,0.00002242068,0.000121656,0.00020536881,0.00013017945],"domain_scores_gemma":[0.9942545,0.0033021073,0.00063088903,0.00039265436,0.00070112257,0.0007187527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393804,0.00028007154,0.00043288208,0.0013889419,0.0009039979,0.0014997415,0.00092746934,0.000592995,0.006019962],"category_scores_gemma":[0.0090438295,0.0003734042,0.00028515095,0.00066739146,0.0017884431,0.0018964706,0.0014346635,0.00068148476,0.00034869832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052673864,0.00011014968,0.016989095,0.0003023888,0.000042266933,0.00073693437,0.001127645,0.03457739,0.032403957,0.88142544,0.0045120325,0.027245969],"study_design_scores_gemma":[0.000080745354,0.0001642308,0.009168751,0.00010448567,0.000054120963,0.0013444007,0.0008186292,0.2548462,0.021702494,0.702559,0.00908119,0.000075739605],"about_ca_topic_score_codex":0.002132623,"about_ca_topic_score_gemma":0.0014570563,"teacher_disagreement_score":0.006019962,"about_ca_system_score_codex":0.001243336,"about_ca_system_score_gemma":0.00053325424,"threshold_uncertainty_score":0.02013874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.618271,0.0046102596,0.33315563,0.0022116692,0.00027271092,0.00006528175,0.0032825975,0.0014018515,0.036728997],"genre_scores_gemma":[0.97306865,0.000940005,0.022644596,0.0002125083,0.00022693604,0.0000359687,0.0008323989,0.00017879826,0.0018601816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728465,0.00033456192,0.00012739828,0.00084123656,0.0007307671,0.0006813357],"domain_scores_gemma":[0.97546935,0.01655481,0.0015581094,0.0026207992,0.0018916338,0.001905365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024557493,0.0010984208,0.0020224198,0.0032440326,0.001798399,0.0056051943,0.0028173458,0.001509379,0.005219829],"category_scores_gemma":[0.016671434,0.00097443035,0.00082658994,0.0033943614,0.00209221,0.0079756705,0.0018780571,0.002595522,0.00062331994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019833834,0.0004129008,0.03130303,0.0009204811,0.00035101673,0.0005302343,0.0010763566,0.3112169,0.04893289,0.5139715,0.013431304,0.075870045],"study_design_scores_gemma":[0.000054962344,0.0002913945,0.009596643,0.00013834487,0.00012991825,0.00075043086,0.00034375157,0.5244259,0.017652983,0.43594503,0.010573348,0.00009732738],"about_ca_topic_score_codex":0.0018467773,"about_ca_topic_score_gemma":0.0023375766,"teacher_disagreement_score":0.0056051943,"about_ca_system_score_codex":0.0027506785,"about_ca_system_score_gemma":0.0007654804,"threshold_uncertainty_score":0.019957662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6230211,0.002019575,0.30075893,0.0014950308,0.00010705499,0.00009547091,0.0010355243,0.0013101493,0.07015718],"genre_scores_gemma":[0.9729734,0.0004479212,0.02502295,0.00012865436,0.00008267272,0.000066036446,0.0003369926,0.000088529414,0.00085271324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983425,0.00032203563,0.000069720925,0.0003755964,0.0005381307,0.0003518803],"domain_scores_gemma":[0.9859774,0.010202135,0.00096915144,0.0012814766,0.0008040319,0.0007657945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015915859,0.0008836902,0.00092503615,0.0022918284,0.000969442,0.0018184226,0.0016184788,0.0010163898,0.0044619446],"category_scores_gemma":[0.01603837,0.00048072985,0.0006754948,0.0016446406,0.0019552184,0.0040316735,0.0024084533,0.0019838882,0.0004577315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004111369,0.0002448166,0.005935055,0.00053220516,0.00008660918,0.00047651798,0.00078176294,0.16185881,0.030005898,0.7469605,0.004843919,0.047862764],"study_design_scores_gemma":[0.00004085739,0.00024115648,0.0036447018,0.00013612366,0.000058527017,0.00076230755,0.00034519023,0.3004687,0.023448655,0.6623619,0.008421648,0.00007019901],"about_ca_topic_score_codex":0.00053060584,"about_ca_topic_score_gemma":0.0008398732,"teacher_disagreement_score":0.0044619446,"about_ca_system_score_codex":0.001264263,"about_ca_system_score_gemma":0.0004972798,"threshold_uncertainty_score":0.014926672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95700806,0.00030799513,0.023407284,0.00020592134,0.000020926818,0.00003772986,0.00029110993,0.00008091691,0.018640121],"genre_scores_gemma":[0.99133486,0.0001812584,0.0060250955,0.000056802826,0.000013027238,0.000038742553,0.00029460673,0.000022906643,0.0020326953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999699,0.000039384307,0.000017167313,0.00006293271,0.00010352009,0.00007799916],"domain_scores_gemma":[0.9987764,0.0004990784,0.00025591624,0.00006595774,0.00021364645,0.00018906774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022207329,0.00043838393,0.0003012843,0.0025369725,0.0009102047,0.0012551377,0.00054579764,0.00054399465,0.004937674],"category_scores_gemma":[0.0014716345,0.00032550225,0.00033083803,0.0013606513,0.0011885874,0.001576026,0.0011315369,0.00055272673,0.0003652622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036335012,0.00012813145,0.010286873,0.00019850952,0.000052536518,0.0005832545,0.0010452769,0.026597561,0.024255037,0.8902484,0.0030568452,0.04318418],"study_design_scores_gemma":[0.00004912502,0.00008872093,0.008144209,0.00009630484,0.0000436807,0.0007076138,0.0010794279,0.07588165,0.01578236,0.8885457,0.00952007,0.00006115172],"about_ca_topic_score_codex":0.001709442,"about_ca_topic_score_gemma":0.0018191256,"teacher_disagreement_score":0.004937674,"about_ca_system_score_codex":0.0008601872,"about_ca_system_score_gemma":0.00042916098,"threshold_uncertainty_score":0.016518176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6225799,0.0009249913,0.34235662,0.00065425213,0.00017450328,0.00010413311,0.00095886004,0.00062354887,0.03162324],"genre_scores_gemma":[0.9377997,0.00042182932,0.055853736,0.00017322128,0.000050728275,0.00006033434,0.0007098842,0.00009471714,0.0048358226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934465,0.00014150981,0.000036903846,0.00011349907,0.00019159555,0.00017184278],"domain_scores_gemma":[0.9961863,0.0017973415,0.0005546041,0.00061651634,0.00046935963,0.00037590778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056934543,0.00035311157,0.0003247905,0.0009683541,0.0005968209,0.0008555065,0.00071801065,0.0003703382,0.00319948],"category_scores_gemma":[0.0031658723,0.00037182064,0.00046234878,0.00090508856,0.00097263005,0.0011433422,0.0009440217,0.00082738814,0.00018999964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040443396,0.00008815565,0.007780492,0.0003105512,0.00005421181,0.0005934697,0.00042691774,0.17553535,0.0239251,0.7288698,0.006146153,0.055865314],"study_design_scores_gemma":[0.000097970005,0.0001691929,0.004464574,0.000077075136,0.00007029165,0.0011572457,0.0005028793,0.33981928,0.018840224,0.595706,0.03902678,0.00006847384],"about_ca_topic_score_codex":0.0036456145,"about_ca_topic_score_gemma":0.0041516204,"teacher_disagreement_score":0.0036456145,"about_ca_system_score_codex":0.0010623281,"about_ca_system_score_gemma":0.00051956705,"threshold_uncertainty_score":0.010703325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9299085,0.00022597236,0.041145466,0.00024030305,0.00006478904,0.000023706772,0.0001315211,0.000096286414,0.028163547],"genre_scores_gemma":[0.99170375,0.00009598226,0.0052444087,0.000043995664,0.000032239775,0.000011544621,0.00007482816,0.00001587917,0.0027773175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969447,0.000071141694,0.000013722122,0.000075482974,0.000070368005,0.00007494229],"domain_scores_gemma":[0.9990815,0.00031645838,0.00020036515,0.000115013725,0.00010007462,0.00018660507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020433344,0.00025225958,0.00032033797,0.0008776873,0.0010771326,0.0010029834,0.00038221138,0.00055113406,0.0033006023],"category_scores_gemma":[0.0010492246,0.00028435118,0.0002699106,0.00052979396,0.0014596921,0.0013906737,0.0010512122,0.00042136398,0.0002363915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007625897,0.000036013567,0.0013807893,0.00008103208,0.000024125298,0.0009909779,0.00072736054,0.007175184,0.011735423,0.9660701,0.0013202475,0.010382373],"study_design_scores_gemma":[0.000023974799,0.000053847543,0.001608277,0.000026437852,0.000023743665,0.0005542172,0.0004562794,0.018518455,0.004472323,0.9686701,0.005566268,0.00002605211],"about_ca_topic_score_codex":0.0009449274,"about_ca_topic_score_gemma":0.0016393502,"teacher_disagreement_score":0.0033006023,"about_ca_system_score_codex":0.00048300234,"about_ca_system_score_gemma":0.0002066925,"threshold_uncertainty_score":0.011041641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.721262,0.00036249222,0.27198014,0.00067010813,0.000035758683,0.00008646348,0.000398127,0.0005390672,0.004665845],"genre_scores_gemma":[0.9393922,0.00013322326,0.058262244,0.00007794521,0.00004796325,0.000051919582,0.0004526173,0.00008429518,0.0014976294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.00022620775,0.000053670152,0.00030211857,0.00019735309,0.00015514134],"domain_scores_gemma":[0.98995066,0.006107581,0.0012038199,0.0013595662,0.0006682921,0.000710147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360889,0.0006009507,0.0009151537,0.0016881557,0.0011749391,0.0014002069,0.001337905,0.00075470516,0.0027159925],"category_scores_gemma":[0.010006308,0.0007113144,0.0007304908,0.0009907627,0.0018386241,0.0032871268,0.0019529001,0.0008437841,0.0003348556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014986591,0.0006036383,0.035772815,0.0008982193,0.00030101574,0.0013153652,0.0027138104,0.21725541,0.074912965,0.51508856,0.012632938,0.13700657],"study_design_scores_gemma":[0.00008954102,0.0002801819,0.0034486095,0.000054475466,0.000050341994,0.00091711775,0.0004495716,0.2993877,0.013923512,0.6774296,0.003920125,0.000049254442],"about_ca_topic_score_codex":0.0015570801,"about_ca_topic_score_gemma":0.0014109483,"teacher_disagreement_score":0.0027159925,"about_ca_system_score_codex":0.0007838267,"about_ca_system_score_gemma":0.0005345346,"threshold_uncertainty_score":0.009085953},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62678564,0.00097299914,0.20576131,0.0056032944,0.0005243588,0.000056967947,0.0002611756,0.00034617406,0.15968803],"genre_scores_gemma":[0.9790244,0.00038421075,0.012987287,0.0005933115,0.0002686004,0.000035658657,0.00019907496,0.000051894327,0.006455592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993722,0.00016099778,0.000018838664,0.000165114,0.00015092167,0.00013195434],"domain_scores_gemma":[0.99686784,0.001653582,0.000268285,0.00031801863,0.00042460815,0.0004676388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010492536,0.00033597878,0.0004081458,0.0009959617,0.0010355094,0.0020340667,0.0007120652,0.0009805434,0.0066467305],"category_scores_gemma":[0.0043623676,0.00031596844,0.00053797255,0.0006099691,0.0034648245,0.003537676,0.0021203142,0.0023358692,0.00061627803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003873951,0.000025704881,0.00095002557,0.000031586922,0.000005266847,0.00013361798,0.00016788932,0.0021214832,0.0010601899,0.9903036,0.0016745159,0.0034874491],"study_design_scores_gemma":[0.000009439125,0.000013041059,0.00042817908,0.000019155921,0.0000052776986,0.000076647724,0.00018022432,0.0073265526,0.0005540357,0.9882395,0.0031392947,0.000008532454],"about_ca_topic_score_codex":0.0018134596,"about_ca_topic_score_gemma":0.0013078868,"teacher_disagreement_score":0.0066467305,"about_ca_system_score_codex":0.0010688534,"about_ca_system_score_gemma":0.00048972055,"threshold_uncertainty_score":0.022235513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24319004,0.009205233,0.5525436,0.005101473,0.001564011,0.00026244335,0.0013011078,0.0015134003,0.18531871],"genre_scores_gemma":[0.8522373,0.0031038385,0.12525378,0.0008855253,0.0008207245,0.00026062966,0.0009309132,0.00082347053,0.015683986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779105,0.0005321023,0.00006640093,0.00043567063,0.0007004456,0.00047431665],"domain_scores_gemma":[0.9897021,0.0063759075,0.0005357385,0.0015295822,0.0011141476,0.0007425986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001963424,0.0015868647,0.0015564738,0.0025568886,0.0014396056,0.002132912,0.0026001427,0.0013572294,0.008158123],"category_scores_gemma":[0.014584874,0.000705372,0.00097384205,0.0017874525,0.002239979,0.006026768,0.003468966,0.0046572667,0.0018248404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001482738,0.00042453635,0.004855532,0.0008156709,0.00016220655,0.0010065105,0.00056005944,0.14484625,0.032566644,0.6440611,0.047232367,0.12198643],"study_design_scores_gemma":[0.000060527786,0.00026502556,0.0032603831,0.00022944363,0.000098983524,0.0006091334,0.0001817919,0.46514922,0.022593584,0.47085407,0.03659304,0.000104729355],"about_ca_topic_score_codex":0.0017924987,"about_ca_topic_score_gemma":0.0021075476,"teacher_disagreement_score":0.008158123,"about_ca_system_score_codex":0.0017148139,"about_ca_system_score_gemma":0.0006419998,"threshold_uncertainty_score":0.027291596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65494335,0.00048602736,0.32533708,0.0021334332,0.000083527906,0.00010806203,0.00014449062,0.00024012121,0.016523883],"genre_scores_gemma":[0.97800475,0.00023856695,0.017490856,0.00019706294,0.00005897073,0.00012198667,0.000074753014,0.00005053847,0.003762508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985066,0.0007679558,0.00004280073,0.00025107377,0.00026008018,0.00017139553],"domain_scores_gemma":[0.97032374,0.023547197,0.0017101604,0.0019729175,0.0013857929,0.0010601785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005165565,0.00037163726,0.00088296545,0.0012377511,0.00092749717,0.0016788578,0.001783487,0.0015825733,0.0039267605],"category_scores_gemma":[0.029134803,0.00034395108,0.00073945423,0.0006569627,0.0043780426,0.004029549,0.0017746026,0.0017408927,0.0003691048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008317869,0.000029260518,0.00093800423,0.00003453204,0.000015118438,0.000074718846,0.0001682021,0.03454301,0.0016621958,0.9588394,0.0005172111,0.0030950825],"study_design_scores_gemma":[0.000054416145,0.00007285686,0.0008905025,0.000023848133,0.000017993792,0.00012570698,0.00013081558,0.4087405,0.0014427517,0.5875412,0.0009207844,0.00003861598],"about_ca_topic_score_codex":0.00160605,"about_ca_topic_score_gemma":0.001112123,"teacher_disagreement_score":0.005165565,"about_ca_system_score_codex":0.0014437035,"about_ca_system_score_gemma":0.0007748304,"threshold_uncertainty_score":0.027318418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05425598,0.00040038826,0.9395542,0.0005302823,0.00003258862,0.000049862327,0.00009629087,0.00014005108,0.004940256],"genre_scores_gemma":[0.6886499,0.00079828524,0.29985628,0.00025700845,0.00023108328,0.00025487394,0.00026878933,0.00019327625,0.009490524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.0003363273,0.000026805248,0.00015291279,0.00019001741,0.00008239049],"domain_scores_gemma":[0.9967462,0.0020930485,0.00027231814,0.0002434697,0.00040649378,0.00023842178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401148,0.00055063656,0.0008753906,0.0024432566,0.00095306494,0.0017514945,0.001064847,0.0011026574,0.0048878845],"category_scores_gemma":[0.0060768593,0.0006543339,0.0006409795,0.001646567,0.0016789641,0.0026266037,0.0019235179,0.0013983406,0.00055213727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009672592,0.000066661465,0.0011752077,0.00018319259,0.000070064045,0.00023343394,0.00054597505,0.17129718,0.0046716137,0.79183227,0.0028484205,0.026979236],"study_design_scores_gemma":[0.000013470111,0.000016322698,0.00030205847,0.000023369546,0.00000977074,0.00007838212,0.00012565136,0.4865157,0.0007543085,0.5107038,0.0014448026,0.000012295757],"about_ca_topic_score_codex":0.0017437745,"about_ca_topic_score_gemma":0.0015721635,"teacher_disagreement_score":0.0048878845,"about_ca_system_score_codex":0.0012291811,"about_ca_system_score_gemma":0.00061834673,"threshold_uncertainty_score":0.01635158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59094703,0.0022773237,0.37599263,0.004782951,0.0002810204,0.00012443936,0.0005071167,0.00025950448,0.024827965],"genre_scores_gemma":[0.9498317,0.0006361172,0.043913644,0.0003171073,0.00022441392,0.00015486429,0.00029185417,0.000107908534,0.0045224046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989844,0.00045065183,0.00004680386,0.0002436704,0.00010659474,0.00016781963],"domain_scores_gemma":[0.98572725,0.011972473,0.0005798663,0.0004239998,0.0004120447,0.0008842133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030691016,0.0008132264,0.0018930888,0.0021216816,0.0019712923,0.002503781,0.0019144209,0.0029059045,0.0066660517],"category_scores_gemma":[0.016210893,0.0006517504,0.0008491214,0.0012114224,0.0036723854,0.0058659473,0.002768683,0.0024444808,0.0004798746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024820416,0.00010482579,0.0006482334,0.00019602422,0.000034427827,0.00016442307,0.00046740196,0.03951458,0.0012272142,0.9439341,0.003146844,0.010313775],"study_design_scores_gemma":[0.000040574265,0.000049076512,0.0002190084,0.000040200004,0.000010915657,0.00010333934,0.00023164965,0.17085715,0.00057587423,0.8267164,0.0011335409,0.000022154254],"about_ca_topic_score_codex":0.0014337746,"about_ca_topic_score_gemma":0.00065636315,"teacher_disagreement_score":0.0066660517,"about_ca_system_score_codex":0.0022017728,"about_ca_system_score_gemma":0.0010865093,"threshold_uncertainty_score":0.022300184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90767854,0.00017860408,0.07515937,0.002052544,0.00004386969,0.00008502569,0.0005320491,0.00029162838,0.013978378],"genre_scores_gemma":[0.9848625,0.00008609937,0.012337448,0.0002555267,0.00004096283,0.000093055045,0.00041949697,0.000035723,0.0018690553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798703,0.00040087904,0.00012285075,0.00056087953,0.00045934675,0.0004690035],"domain_scores_gemma":[0.9879638,0.009136071,0.0008238823,0.00088144204,0.00042685703,0.00076803064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018487595,0.00032698523,0.0009286268,0.0010169036,0.0016590701,0.0040294817,0.0012162206,0.00174594,0.006676896],"category_scores_gemma":[0.007207812,0.0004916724,0.0011323587,0.0007912785,0.0041631,0.006429979,0.0025917534,0.0031777872,0.00041575986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054629694,0.00022812399,0.0039123725,0.00017935138,0.00005031614,0.00030068372,0.0010368598,0.014815898,0.010606101,0.949911,0.0026521676,0.015760848],"study_design_scores_gemma":[0.000094795076,0.00008007485,0.001255569,0.00001759872,0.000020378147,0.00012940033,0.00024318435,0.04549438,0.0032873848,0.9481878,0.0011611384,0.000028387336],"about_ca_topic_score_codex":0.0010733089,"about_ca_topic_score_gemma":0.0005457677,"teacher_disagreement_score":0.006676896,"about_ca_system_score_codex":0.00261567,"about_ca_system_score_gemma":0.00093023764,"threshold_uncertainty_score":0.022336423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8711943,0.0008828997,0.10140166,0.002661651,0.000099880795,0.000032866217,0.00033528238,0.00035806044,0.023033379],"genre_scores_gemma":[0.992702,0.00018566567,0.005737033,0.00019466951,0.000054231165,0.00001462499,0.00013828248,0.000022203742,0.00095134287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994709,0.000100878715,0.000023569015,0.00012266939,0.00014181086,0.00014017423],"domain_scores_gemma":[0.99399817,0.0037806535,0.0007621643,0.00060711167,0.00029622394,0.00055572164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056787074,0.00025057612,0.00034047576,0.0006860273,0.0005857337,0.0013999068,0.0008067941,0.0006126185,0.0031325403],"category_scores_gemma":[0.0042843577,0.00025485063,0.00032316925,0.0006484449,0.0019750078,0.0029795226,0.0016628538,0.001170448,0.00022051761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018388942,0.00011731047,0.007952206,0.00019503002,0.00003605725,0.00041958666,0.00065575924,0.016030299,0.0062255226,0.9458094,0.0041149035,0.018260008],"study_design_scores_gemma":[0.000034853623,0.00003480934,0.0024494936,0.000029969493,0.000016745773,0.00022392567,0.00034305546,0.03247229,0.0023581772,0.9573006,0.004718471,0.000017601698],"about_ca_topic_score_codex":0.0014931728,"about_ca_topic_score_gemma":0.0016396537,"teacher_disagreement_score":0.0031325403,"about_ca_system_score_codex":0.00073263806,"about_ca_system_score_gemma":0.00038973388,"threshold_uncertainty_score":0.01047945},"labels":[],"label_agreement":null}]}