{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":240,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":240,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"383180bb94b5","filters":{"venue":"Journal of Graph Theory"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01983445087669783,"gpt":0.291133383142799,"spread":0.2712989322661011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001671371,0.0001675033,0.0004018682,0.0004653766,0.00009333948,0.00001250431,0.0003038762,0.0000928345,0.000116688],"category_scores_gemma":[0.0003063547,0.0001018256,0.0003625162,0.0003677304,0.0004303483,0.0002005053,0.00003734199,0.0001542573,0.000002870929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007424198,"about_ca_system_score_gemma":0.00002963403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.727452e-7,"about_ca_topic_score_gemma":0.000002360425,"domain_scores_codex":[0.9984385,0.0002807823,0.0007024696,0.0001333857,0.0002432523,0.000201597],"domain_scores_gemma":[0.9973019,0.001258689,0.0007598809,0.0003248139,0.0002064362,0.0001482171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000146274,0.0001623657,0.001908656,0.00005654022,0.0001474621,0.000007047422,0.0002525225,8.329993e-8,0.02258279,0.9643288,0.0006491457,0.009758319],"study_design_scores_gemma":[0.0007972067,0.0001683352,0.003420675,0.0002284959,0.0001427437,0.0001388848,0.0003795004,1.360282e-7,0.01221446,0.9818894,0.0004902221,0.0001299969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9940233,0.001164594,0.002701401,0.0003430775,0.000150255,0.000137064,0.00002499531,0.00002219062,0.001433139],"genre_scores_gemma":[0.9967138,0.0005739019,0.002347733,0.00002667736,0.0000393258,0.000004846281,2.499133e-7,0.00002346191,0.0002699887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01756055,"threshold_uncertainty_score":0.4152329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06090426272339177,"gpt":0.294004860554233,"spread":0.2331005978308412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007399147,0.0001433705,0.0002626558,0.0004483958,0.0001152806,0.00006363274,0.0009976504,0.00006742127,0.00002377541],"category_scores_gemma":[0.0009736096,0.0001064327,0.00009856641,0.0006942261,0.0002712455,0.0005350364,0.000208825,0.0004395926,0.000005549225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002083029,"about_ca_system_score_gemma":0.00008691379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006220008,"about_ca_topic_score_gemma":0.000009592071,"domain_scores_codex":[0.997497,0.001099385,0.0004839502,0.0002313238,0.0003837231,0.0003046533],"domain_scores_gemma":[0.9976615,0.0008541974,0.0004058132,0.000456069,0.0003937112,0.0002287178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003087395,0.0002312887,0.004338917,0.00001696067,0.0002126569,0.0003487841,0.004669136,0.000008753976,0.001257224,0.8628891,0.001121807,0.121818],"study_design_scores_gemma":[0.001152199,0.0006607418,0.03817677,0.0000359783,0.000008084482,0.0004390677,0.00008568075,0.00002503276,0.002929938,0.9547783,0.001536804,0.0001714497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3307824,0.007551708,0.6483178,0.0008577589,0.001679631,0.0003741046,0.00002771713,0.0001125559,0.01029628],"genre_scores_gemma":[0.9788031,0.001134912,0.01968615,0.0002116032,0.00005134655,0.000001328219,5.364737e-7,0.00001477287,0.00009623586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6480207,"threshold_uncertainty_score":0.4340201,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics; Graph; Graph theory; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01082726201572983,"gpt":0.250184958751659,"spread":0.2393576967359291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009040711,0.00008283841,0.0002703129,0.0006247319,0.00005557142,0.00003178128,0.000651851,0.00004528937,0.0005428653],"category_scores_gemma":[0.0001870971,0.00005513354,0.00032116,0.00154434,0.0001372892,0.0005075315,0.00006549303,0.0001480692,0.000009892611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001046384,"about_ca_system_score_gemma":0.00002859215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001291646,"about_ca_topic_score_gemma":0.000001599053,"domain_scores_codex":[0.9987901,0.0001316574,0.0004346902,0.0001026188,0.0004084655,0.0001324305],"domain_scores_gemma":[0.9985694,0.0004594823,0.0005160705,0.0002202915,0.0001446544,0.00009008446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009742851,0.0004143498,0.02521883,0.00001442813,0.0005298824,0.0001409531,0.000182899,0.0001758787,0.0007236792,0.9473434,0.002733951,0.02242434],"study_design_scores_gemma":[0.000416417,0.0001943259,0.06837199,0.0000240738,0.00006453588,0.0003082392,0.00009412634,0.00016896,0.0001847014,0.9270217,0.00304927,0.0001015911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6793921,0.001087315,0.3155761,0.0005708907,0.0004587876,0.00003374548,0.00000532665,0.00001773197,0.002857941],"genre_scores_gemma":[0.9958401,0.0002958865,0.003474486,0.0002225938,0.00004541588,3.915769e-7,6.22867e-7,0.000002418287,0.0001180439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.316448,"threshold_uncertainty_score":0.5943994,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01925852887274516,"gpt":0.2874328338617217,"spread":0.2681743049889766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004935176,0.0002174259,0.0004746895,0.0007954995,0.0001262402,0.0000523776,0.001042318,0.0001089194,0.0000149583],"category_scores_gemma":[0.0003945954,0.0001587499,0.0003226076,0.00127748,0.0003019483,0.001071853,0.0002752402,0.0005002187,0.000004969872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003520467,"about_ca_system_score_gemma":0.00004099298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003340949,"about_ca_topic_score_gemma":0.000001722247,"domain_scores_codex":[0.9971753,0.0006491643,0.0007391621,0.0002408594,0.0006091575,0.0005863174],"domain_scores_gemma":[0.9973047,0.0008071942,0.0005518761,0.0005340837,0.0002736319,0.0005284786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001331865,0.0005090404,0.02783326,0.00008306419,0.0004566425,0.00005113257,0.005169808,0.0001832305,0.02101053,0.7177491,0.0004193976,0.225203],"study_design_scores_gemma":[0.0006409065,0.0005772345,0.01553546,0.00009184111,0.00003161827,0.0002618918,0.0001455059,0.00003811,0.007200575,0.9750273,0.0002520405,0.0001974774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7789274,0.001745874,0.2179404,0.0002460812,0.0003632026,0.0001995927,0.000004007361,0.00002886809,0.0005446142],"genre_scores_gemma":[0.9648575,0.0001501298,0.03474698,0.0001506838,0.00001824495,0.000004159952,3.420521e-7,0.00001380083,0.00005821317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2572783,"threshold_uncertainty_score":0.6473634,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0487071365618233,"gpt":0.2748106614581519,"spread":0.2261035248963286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003983254,0.0001594503,0.0004320975,0.0005226178,0.0002276303,0.0000790503,0.001581321,0.0000542616,0.00008926597],"category_scores_gemma":[0.0003015385,0.00009637835,0.0003208532,0.0009474717,0.004097895,0.0005068326,0.0002719474,0.000514711,0.000003815684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001282757,"about_ca_system_score_gemma":0.00002135776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003999555,"about_ca_topic_score_gemma":0.000002157489,"domain_scores_codex":[0.9973715,0.0009596737,0.0005730355,0.0001840191,0.0006180585,0.0002936936],"domain_scores_gemma":[0.9972312,0.001097384,0.0005705381,0.0006027347,0.0003344554,0.0001636357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002075766,0.00009064998,0.0002673029,0.00001523659,0.00008187283,0.00003004153,0.0008199528,0.00001069466,0.000566686,0.9893486,0.0002758231,0.008285597],"study_design_scores_gemma":[0.001574702,0.0002287191,0.001049115,0.00004323839,0.00002041041,0.0003684611,0.0001407839,0.0006985355,0.0009346327,0.9945567,0.0002792408,0.0001055032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5284723,0.02699076,0.4194351,0.009487778,0.001235071,0.0007886961,0.0000242912,0.0001162265,0.0134498],"genre_scores_gemma":[0.99172,0.0009531116,0.006926532,0.0002134147,0.00003234343,0.000002318686,1.157632e-7,0.00001119648,0.0001410188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4632476,"threshold_uncertainty_score":0.9986124,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03773873636701931,"gpt":0.2706385605727584,"spread":0.2328998242057391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542916,0.00004617882,0.0001023951,0.0001875346,0.0001145288,0.00001787778,0.0001297401,0.00002344121,0.00000271456],"category_scores_gemma":[0.0003142182,0.00003909744,0.00006410651,0.0002594093,0.00003963412,0.0004249364,0.00003076448,0.00006156968,2.171403e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006704391,"about_ca_system_score_gemma":0.00004923046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.679949e-7,"about_ca_topic_score_gemma":2.895889e-7,"domain_scores_codex":[0.9994648,0.00005788072,0.0002187834,0.00005201717,0.0001122383,0.00009435836],"domain_scores_gemma":[0.9987882,0.0006116323,0.0002293805,0.00006653318,0.000231266,0.0000729233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009783405,0.0002432849,0.01680957,0.00007548551,0.0001238905,0.000001964863,0.001606782,0.000776921,0.01948908,0.8717525,0.001109181,0.08791354],"study_design_scores_gemma":[0.001898412,0.0008988437,0.3313382,0.0001802873,0.0001938867,0.001408303,0.0009629801,0.007850714,0.02012137,0.6310739,0.00368165,0.0003915043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4389106,0.0005499132,0.5595706,0.0001461832,0.0006654885,0.00003922836,0.000003473457,0.000004236668,0.0001102399],"genre_scores_gemma":[0.8887986,0.000008835479,0.1109879,0.00003629525,0.0001426296,9.380003e-7,5.466287e-7,0.000001968335,0.00002230659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.449888,"threshold_uncertainty_score":0.1594348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01594946052942001,"gpt":0.2725096860002505,"spread":0.2565602254708305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002776779,0.0002081363,0.0003564949,0.001228748,0.0001738268,0.0001421764,0.001353707,0.00008431709,0.00001261104],"category_scores_gemma":[0.0002106953,0.0001668371,0.0003698006,0.00112519,0.000506126,0.001004334,0.0002458414,0.0006127369,0.000006912717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003659396,"about_ca_system_score_gemma":0.0001032942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002009685,"about_ca_topic_score_gemma":0.000001419948,"domain_scores_codex":[0.9978137,0.0003616153,0.0005181251,0.0002902567,0.0005985535,0.0004177606],"domain_scores_gemma":[0.9982344,0.0002828848,0.000338901,0.0005321676,0.0002824128,0.0003292487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00011083,0.0001079037,0.0007347593,0.0000227502,0.0001325456,0.0002752341,0.0008292059,0.00009943292,0.005091339,0.9709149,0.00002736329,0.02165373],"study_design_scores_gemma":[0.001071901,0.0004486202,0.002491829,0.00009877181,0.00001760419,0.001041519,0.0001933684,0.00001597264,0.003806153,0.9904326,0.0001990663,0.0001826252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4793445,0.004324371,0.5142704,0.0007052481,0.0004746357,0.0001252803,0.000001831669,0.0000571079,0.0006965802],"genre_scores_gemma":[0.9803703,0.0005279015,0.01868665,0.000310762,0.00005232286,0.000002696853,1.957033e-7,0.00001843019,0.0000307042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5010258,"threshold_uncertainty_score":0.6803419,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01240967132841389,"gpt":0.2852600797355756,"spread":0.2728504084071617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002702885,0.0001175362,0.0001918866,0.0007268639,0.0001226035,0.00007130029,0.001072037,0.00005839741,0.00001067414],"category_scores_gemma":[0.0003142526,0.00009047083,0.0002063896,0.0005456003,0.0001362386,0.001069844,0.00008599539,0.0004333915,0.00002814685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009157212,"about_ca_system_score_gemma":0.0000973947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.706012e-7,"about_ca_topic_score_gemma":3.020342e-7,"domain_scores_codex":[0.9983561,0.0002821498,0.0003473694,0.0001647313,0.0005983531,0.0002512634],"domain_scores_gemma":[0.9985335,0.0003806275,0.0003081026,0.0004071541,0.0002310397,0.0001396134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001739162,0.0001030035,0.0000130738,0.000004762479,0.00002714053,0.0000932644,0.0002638673,0.0008147978,0.002753859,0.9764733,0.00007775999,0.01920124],"study_design_scores_gemma":[0.0009222422,0.0005081182,0.00060139,0.0000734159,0.000004881595,0.0001477112,0.00004871628,0.00002272556,0.01076867,0.9865122,0.0002919817,0.00009788625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1090351,0.001166191,0.883321,0.002333592,0.00102959,0.0001503385,0.000001108891,0.00005367677,0.002909316],"genre_scores_gemma":[0.9783883,0.0001973874,0.02047061,0.0005369378,0.0002449173,0.000002165835,2.076103e-7,0.00001359719,0.0001458524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8693532,"threshold_uncertainty_score":0.3689293,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01016406726067491,"gpt":0.2722684164393138,"spread":0.2621043491786389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003446831,0.00007892036,0.0001258974,0.0001501544,0.0003117144,0.0001610465,0.0004698681,0.00003920931,0.000007791412],"category_scores_gemma":[0.00009328272,0.00005363489,0.0001775341,0.0005708489,0.0001409632,0.0003632575,0.00005848865,0.0001435053,0.000006027399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001907174,"about_ca_system_score_gemma":0.0001179069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.576251e-7,"about_ca_topic_score_gemma":0.000002180245,"domain_scores_codex":[0.9987574,0.0001077639,0.0004753109,0.00009189983,0.0004023435,0.0001652435],"domain_scores_gemma":[0.9982809,0.0006274137,0.0004674677,0.0001880241,0.0003652872,0.00007086163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001735731,0.0001518712,0.0026667,0.00001621,0.0001052513,0.00003715693,0.00260317,0.0008781923,0.05758531,0.5880839,0.003801198,0.3438975],"study_design_scores_gemma":[0.0006315168,0.0001314935,0.01406149,0.00007752315,0.0000264492,0.0005366863,0.000176621,0.0007609952,0.3455251,0.6267068,0.0111883,0.0001770023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5233305,0.0004437082,0.4748372,0.0002309061,0.0005423738,0.00002387077,4.35098e-7,0.00000589048,0.0005850947],"genre_scores_gemma":[0.9927611,0.00004232707,0.006421863,0.0004832534,0.0002145595,2.409935e-7,1.558657e-7,0.000004729395,0.00007172136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4694307,"threshold_uncertainty_score":0.2397487,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01846631093283506,"gpt":0.2994444635044387,"spread":0.2809781525716036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004191638,0.0002551648,0.0003918376,0.001011072,0.0002843923,0.0001603973,0.002971133,0.0001091666,0.000111897],"category_scores_gemma":[0.0003072766,0.0002046974,0.0005061461,0.001467921,0.0003554434,0.001419766,0.0003282357,0.0006579448,0.00003455995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005839813,"about_ca_system_score_gemma":0.00009630707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.921107e-7,"about_ca_topic_score_gemma":0.000002214161,"domain_scores_codex":[0.9965494,0.0009410711,0.0007204508,0.0003211726,0.0008942619,0.0005736211],"domain_scores_gemma":[0.9967396,0.000768889,0.0005587679,0.001121982,0.0004790126,0.0003317426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003724126,0.0001774124,0.0006935346,0.000007881063,0.0001053477,0.0003174382,0.0002485122,0.000172607,0.002876887,0.9671648,0.001296941,0.02656619],"study_design_scores_gemma":[0.0009727423,0.0004459059,0.001095308,0.0000916905,0.00002225861,0.001022217,0.0001614669,0.0001330105,0.002369819,0.9891744,0.004278603,0.0002325299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1790166,0.002351232,0.8037664,0.001675001,0.001161631,0.0002438362,0.000007074742,0.0001398031,0.01163836],"genre_scores_gemma":[0.9811466,0.0009006363,0.01683121,0.0005035892,0.0002611924,0.000007690986,0.000001465704,0.00003428507,0.0003133844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8021299,"threshold_uncertainty_score":0.8347319,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0181218222648927,"gpt":0.2882157888555911,"spread":0.2700939665906983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004024155,0.0001309785,0.0002459344,0.0005781066,0.0001119237,0.00006050299,0.001319217,0.00005504514,0.00007613389],"category_scores_gemma":[0.0002445222,0.00009850667,0.0002107656,0.000709442,0.0001656865,0.001683667,0.0001803029,0.0004169354,0.00004306855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004414939,"about_ca_system_score_gemma":0.00006896524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.237373e-7,"about_ca_topic_score_gemma":1.939118e-7,"domain_scores_codex":[0.9979103,0.0004919344,0.0004129627,0.0001065807,0.0006054427,0.0004728127],"domain_scores_gemma":[0.9981806,0.000503568,0.0003463479,0.0004728672,0.0001882395,0.000308342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008619467,0.0001871946,0.004579586,0.00002244979,0.0001016061,0.00003733347,0.001269704,0.00003363028,0.002528114,0.9717501,0.0004483384,0.01895576],"study_design_scores_gemma":[0.0004768031,0.000202672,0.01219182,0.00004994387,0.00001158908,0.0003945649,0.0001994336,0.0001567416,0.002011591,0.9825075,0.001638798,0.0001585427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2960118,0.003049356,0.6978287,0.0002292954,0.0007933139,0.000096222,8.155532e-7,0.00004323281,0.001947266],"genre_scores_gemma":[0.9821605,0.0000668524,0.01723805,0.0001906079,0.0001976569,0.000001821727,9.222437e-8,0.00001319541,0.0001312339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6861486,"threshold_uncertainty_score":0.4016986,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Discrete mathematics; Degree (music); Tree (set theory); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01767424194786473,"gpt":0.2940075536422283,"spread":0.2763333116943636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002622547,0.000131692,0.0002411861,0.0006567222,0.0001232549,0.00009529469,0.001688372,0.0000541531,0.00009121175],"category_scores_gemma":[0.0002516069,0.0001017426,0.0002717321,0.0009950257,0.0001699714,0.001026551,0.0001628403,0.0004127729,0.00003343158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002638922,"about_ca_system_score_gemma":0.00006420739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.226926e-7,"about_ca_topic_score_gemma":7.893976e-7,"domain_scores_codex":[0.9982151,0.000309109,0.0004028325,0.0001716423,0.0005472513,0.0003540784],"domain_scores_gemma":[0.9982824,0.0004562197,0.000312489,0.0004511686,0.0002885739,0.0002091033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001756193,0.00008399591,0.0008374429,0.000004341908,0.0000571006,0.0003553019,0.0004291413,0.00004177057,0.003150051,0.8760338,0.000958941,0.1178725],"study_design_scores_gemma":[0.0005087436,0.0002769491,0.001140895,0.00003281084,0.000007888673,0.001050562,0.0001501588,0.0001825536,0.001618418,0.9887802,0.006121935,0.000128912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1049862,0.001213235,0.8759266,0.000797158,0.0005278474,0.00007529879,4.942532e-7,0.00005790693,0.01641525],"genre_scores_gemma":[0.9668041,0.0004061841,0.03097451,0.0004261075,0.0001998479,0.000002034167,1.243226e-7,0.00001916257,0.001167968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8618178,"threshold_uncertainty_score":0.4148942,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multipartite; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03695414308635255,"gpt":0.2891885994670018,"spread":0.2522344563806492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003725596,0.0001682222,0.0003610183,0.0002096085,0.0002984197,0.00003932028,0.000668961,0.0001019371,0.0001406441],"category_scores_gemma":[0.001748539,0.00008461224,0.000460554,0.0002429023,0.000490988,0.000185457,0.00007202878,0.0004559679,0.000003204189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001587024,"about_ca_system_score_gemma":0.00003427065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003730553,"about_ca_topic_score_gemma":0.000002351593,"domain_scores_codex":[0.9977788,0.0005871104,0.0007933463,0.000127513,0.0004795272,0.0002337016],"domain_scores_gemma":[0.9944842,0.003555194,0.0008642792,0.0006141685,0.0003819645,0.0001001501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002784306,0.0001015226,0.001305061,0.00003805631,0.0002394756,0.000003834657,0.0008485988,0.000002733334,0.0008179429,0.9852557,0.001691703,0.009416942],"study_design_scores_gemma":[0.000363927,0.0003314913,0.0117036,0.00007362196,0.00007393814,0.00003470844,0.000738429,0.000002976358,0.002876566,0.9834331,0.0002729298,0.00009468408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9932665,0.0005201106,0.0001544265,0.0002547532,0.0007486463,0.0001743085,0.000002508303,0.00001124887,0.004867521],"genre_scores_gemma":[0.9988002,0.0001482302,0.0006881992,0.0001393715,0.00009142698,0.000003587655,7.415048e-8,0.00001831969,0.0001105543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01039854,"threshold_uncertainty_score":0.3450387,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01308008132324962,"gpt":0.2844518910577733,"spread":0.2713718097345237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004691302,0.0003430479,0.0008314446,0.0002415551,0.0005189238,0.00005848302,0.001072048,0.0001714378,0.0003203951],"category_scores_gemma":[0.00077072,0.0001960281,0.001159942,0.0004915632,0.0008020496,0.0002883288,0.0001326704,0.000568344,0.000009295339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003416066,"about_ca_system_score_gemma":0.00007109458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000012455,"about_ca_topic_score_gemma":0.00000269367,"domain_scores_codex":[0.9963241,0.0007227093,0.001531939,0.0001873946,0.0007842373,0.0004496128],"domain_scores_gemma":[0.9939641,0.003141138,0.001588146,0.0007834266,0.0003471879,0.0001759359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001239142,0.0002834375,0.0007373982,0.0001729795,0.001170347,0.00001836843,0.005469256,0.000009479048,0.001575524,0.9580431,0.020001,0.01127998],"study_design_scores_gemma":[0.002588643,0.0001023395,0.0002918519,0.0001914894,0.0003832972,0.0004646032,0.000524467,0.00001150646,0.00625571,0.9797257,0.009234703,0.0002257502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.982495,0.004774224,0.002859941,0.0008127498,0.0009871656,0.0003537492,0.00001638031,0.00003953119,0.007661249],"genre_scores_gemma":[0.9925694,0.001071842,0.004624737,0.0005912663,0.0005083141,0.000007452737,4.396259e-7,0.0000618457,0.000564635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02168255,"threshold_uncertainty_score":0.7993793,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0131842502653088,"gpt":0.271164064961363,"spread":0.2579798146960542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002317952,0.0001909171,0.0003166142,0.0007608854,0.00025302,0.0002504839,0.001464945,0.00006963539,0.00001638537],"category_scores_gemma":[0.00008434783,0.0001349835,0.000175751,0.0009819337,0.0002524136,0.00115228,0.00008370263,0.0006481104,0.000006253983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004654638,"about_ca_system_score_gemma":0.0001304287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.802532e-7,"about_ca_topic_score_gemma":0.000001321683,"domain_scores_codex":[0.9977866,0.0002475474,0.0004299626,0.0002431986,0.0008421805,0.0004505113],"domain_scores_gemma":[0.9982393,0.0002976659,0.0004368918,0.0004561949,0.0003172645,0.0002526458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009063311,0.0001782675,0.001449347,0.000008887542,0.00009290435,0.0006947861,0.001005902,0.0002861464,0.006625244,0.9537409,0.0001629628,0.03484834],"study_design_scores_gemma":[0.0011637,0.001626192,0.01048328,0.0001059882,0.00001498751,0.00129774,0.0001525368,0.00003771741,0.005832572,0.9783725,0.0006943244,0.0002185161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6022644,0.0009545804,0.3922083,0.0005856836,0.0003150908,0.0001504288,0.000001355741,0.00007833996,0.003441841],"genre_scores_gemma":[0.9821249,0.00006534081,0.01720815,0.0003451389,0.00006083332,0.000001383469,2.091419e-7,0.00001177766,0.0001823124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3798605,"threshold_uncertainty_score":0.5504466,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Transitive relation; Abelian group; Automorphism group; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007512334986247907,"gpt":0.2082934276642684,"spread":0.2007810926780205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004371486,0.0000959512,0.000182789,0.000116729,0.00004287596,0.00001702732,0.00009379562,0.00004625495,0.00008177682],"category_scores_gemma":[0.00002843475,0.00008215486,0.00009018538,0.0001344678,0.00001675415,0.0002092919,0.000008022788,0.0001418514,0.000006763722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002654278,"about_ca_system_score_gemma":0.00001024431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.44213e-7,"about_ca_topic_score_gemma":0.000001007699,"domain_scores_codex":[0.9993766,0.00003472183,0.0002574222,0.0000510577,0.0001048257,0.0001753851],"domain_scores_gemma":[0.9996186,0.00007268757,0.0000797574,0.0000871155,0.00006687888,0.00007490838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009505804,0.000132887,0.00007363448,0.0001919617,0.0004511426,0.0008651068,0.002486904,0.07291358,0.5148562,0.3699071,0.003586194,0.03358475],"study_design_scores_gemma":[0.00148588,0.0002924249,0.00007148642,0.0003513084,0.0001313157,0.0006511086,0.002022732,0.0006038938,0.1099613,0.7864648,0.09752828,0.0004354781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1564486,0.002540259,0.820805,0.00004475723,0.002743734,0.00009749819,0.00002452672,0.00010679,0.01718883],"genre_scores_gemma":[0.9931681,0.002852374,0.003347531,0.00008910266,0.0003316959,0.000001403208,0.000002276248,0.00003591489,0.0001716047],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8367195,"threshold_uncertainty_score":0.3350178,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01095251187521541,"gpt":0.2700981083827483,"spread":0.2591455965075329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003468588,0.000117998,0.0004145131,0.000575088,0.00003957204,0.00001510944,0.001351861,0.00006570338,0.00002287662],"category_scores_gemma":[0.0004990177,0.00008516224,0.0002916906,0.0007024012,0.0003504225,0.00033848,0.0001469426,0.0003313413,0.000001049486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001175648,"about_ca_system_score_gemma":0.00009754498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.367477e-7,"about_ca_topic_score_gemma":6.589024e-7,"domain_scores_codex":[0.9979236,0.0005858038,0.0005796268,0.0001381027,0.0005533171,0.0002195424],"domain_scores_gemma":[0.9973667,0.000741313,0.0007937789,0.0005115435,0.0004734618,0.0001132567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000226937,0.0001338721,0.0004267511,0.00007097056,0.00009175289,0.00001106578,0.0007262278,0.0002692076,0.01521137,0.9459678,0.0001131057,0.03675092],"study_design_scores_gemma":[0.000636277,0.0008816076,0.0005541168,0.0001118823,0.00001353421,0.0001253154,0.00006096426,0.0002372961,0.07322563,0.9235719,0.000497433,0.00008407213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1499761,0.0008573583,0.8467849,0.0002449264,0.00021635,0.0001190023,0.000002375381,0.00001139953,0.001787557],"genre_scores_gemma":[0.9841846,0.0000214101,0.01560634,0.00006337136,0.00004857179,0.000001236025,9.569587e-8,0.000009722477,0.0000646581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8342085,"threshold_uncertainty_score":0.3472815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03242892619103172,"gpt":0.3078512286830073,"spread":0.2754223024919756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001734711,0.0001809964,0.0004361245,0.0001644128,0.0004013801,0.00001489649,0.0005183292,0.0001054182,0.0001839158],"category_scores_gemma":[0.0003440755,0.00009969588,0.0007702326,0.0002068768,0.0006480932,0.0001203251,0.0000545514,0.0003031306,8.88597e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001248569,"about_ca_system_score_gemma":0.00004940407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001987246,"about_ca_topic_score_gemma":9.823916e-7,"domain_scores_codex":[0.9983563,0.0002136311,0.0007084591,0.0001075692,0.0003705464,0.0002434633],"domain_scores_gemma":[0.9964462,0.00206243,0.0007275989,0.0003688877,0.0003219688,0.00007294162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005034187,0.0000862143,0.002981015,0.00005398938,0.0005522877,0.00001768912,0.001891717,0.000004273284,0.0005868172,0.9777148,0.0144593,0.001148494],"study_design_scores_gemma":[0.0008970712,0.0001262797,0.0021231,0.00003810352,0.0002120848,0.0007662287,0.000205189,0.000007554863,0.001772529,0.9912919,0.002435314,0.0001246343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895638,0.00083298,0.006367,0.0002089013,0.0008666802,0.0002030206,0.00001799744,0.00001066412,0.001928959],"genre_scores_gemma":[0.9875795,0.0002892057,0.0106622,0.0005339243,0.0003920426,0.000007049561,5.064556e-7,0.00003744843,0.0004981614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01357713,"threshold_uncertainty_score":0.406548,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01817147925094919,"gpt":0.2891290677880259,"spread":0.2709575885370767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002080337,0.0001583261,0.000275781,0.0008973856,0.0003156482,0.0001368477,0.001424516,0.00007348137,0.00002925847],"category_scores_gemma":[0.0002041923,0.0001431758,0.0003630306,0.001426114,0.0001969381,0.001169178,0.00009161051,0.0006182062,0.00001378972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004614209,"about_ca_system_score_gemma":0.00008741712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.888921e-7,"about_ca_topic_score_gemma":6.86992e-7,"domain_scores_codex":[0.9978117,0.0003912191,0.0005312547,0.0002376605,0.0005886506,0.0004395463],"domain_scores_gemma":[0.9980263,0.0004328965,0.000406721,0.0005453697,0.0003488348,0.0002399511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004836231,0.00009264682,0.0001327821,0.000003690101,0.00005256718,0.00005132855,0.0002788309,0.0007967799,0.005378622,0.9164439,0.0001404018,0.07658006],"study_design_scores_gemma":[0.0004300855,0.000291327,0.01044605,0.00004205401,0.00001238048,0.0005234028,0.0002512505,0.00007213647,0.001859051,0.9857232,0.0001935682,0.0001555052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1001876,0.001100519,0.8939127,0.001307389,0.0006884285,0.00009090936,0.00000107491,0.00008285345,0.002628578],"genre_scores_gemma":[0.9738966,0.000095139,0.02521738,0.0005133809,0.0001522943,0.000001007937,1.960956e-7,0.00001206288,0.0001118844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8737091,"threshold_uncertainty_score":0.583854,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01759353469542376,"gpt":0.2805384940187399,"spread":0.2629449593233162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460814,0.0002071312,0.0003905081,0.001108016,0.0001687347,0.0001283248,0.0009195047,0.00007489444,0.00002024891],"category_scores_gemma":[0.00007785499,0.0001468662,0.0001912626,0.001029704,0.0006911968,0.001506858,0.0001594976,0.000364275,0.000003572116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002323774,"about_ca_system_score_gemma":0.00008269234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001719152,"about_ca_topic_score_gemma":0.00003282943,"domain_scores_codex":[0.9978836,0.0003953533,0.0005341579,0.0002477117,0.0005967492,0.0003424166],"domain_scores_gemma":[0.9975763,0.0004732669,0.000578594,0.0004859851,0.0006185013,0.0002673794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005744467,0.0002130987,0.01441865,0.00007074006,0.0002516951,0.00007566465,0.001225904,0.00006909024,0.0103545,0.9355187,0.0001357384,0.0370918],"study_design_scores_gemma":[0.0009839339,0.001047742,0.03125157,0.0001411356,0.00002523757,0.000450396,0.0001680615,0.0001462365,0.004793189,0.9608077,0.00001901334,0.0001658157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7111957,0.0008693216,0.2871786,0.0001939286,0.00008747351,0.0001962823,7.942747e-7,0.00002002101,0.0002578807],"genre_scores_gemma":[0.9415484,0.0001520233,0.05815819,0.0000764834,0.00002066077,0.000009624964,4.122523e-7,0.0000168937,0.00001727623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2303527,"threshold_uncertainty_score":0.5989029,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02104048839895501,"gpt":0.3052251601930699,"spread":0.2841846717941149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003442812,0.0001772612,0.0004585305,0.0007964983,0.0003401915,0.0001460656,0.003800836,0.0000809759,0.0000362604],"category_scores_gemma":[0.0007333645,0.000138391,0.0004045138,0.0003491249,0.0007025644,0.001388556,0.0003523914,0.0004594405,0.000007382302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002472445,"about_ca_system_score_gemma":0.0001294341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005782121,"about_ca_topic_score_gemma":0.000004131763,"domain_scores_codex":[0.9976122,0.0003970293,0.0006656898,0.0002025807,0.0007616081,0.0003609348],"domain_scores_gemma":[0.9959053,0.0005370395,0.001446022,0.001446749,0.0004611604,0.0002037774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005110145,0.0003776015,0.01902286,0.0001406703,0.0004045139,0.0002673259,0.0016453,0.0001301949,0.02371494,0.9052457,0.0002432774,0.04829658],"study_design_scores_gemma":[0.001071781,0.0004167626,0.05267577,0.0001694372,0.00001859829,0.0001272471,0.0001429877,0.0005814002,0.007962479,0.9365212,0.000142691,0.0001696254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7610388,0.00125206,0.2352763,0.0002732607,0.0005953757,0.0001650156,0.000003574754,0.00002672728,0.001368895],"genre_scores_gemma":[0.9870769,0.0001620726,0.01255174,0.00004362524,0.00005710872,0.000002025721,1.1455e-7,0.0000150531,0.00009139357],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.226038,"threshold_uncertainty_score":0.7062962,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04185691599901831,"gpt":0.3278837972455143,"spread":0.286026881246496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00260361,0.0001104465,0.0003289789,0.0009965919,0.0001038819,0.00002031709,0.0006514509,0.00005005968,0.000002915384],"category_scores_gemma":[0.0003070824,0.00008823667,0.0001737352,0.0006694344,0.0003649165,0.0005657389,0.00009311779,0.0002436515,2.781362e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001774529,"about_ca_system_score_gemma":0.00004542683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.996614e-7,"about_ca_topic_score_gemma":0.000002337565,"domain_scores_codex":[0.9985532,0.0002129597,0.0005168265,0.0001571015,0.0002999967,0.0002599277],"domain_scores_gemma":[0.9983259,0.0008195139,0.0003564518,0.0002524614,0.0001389666,0.0001066807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003830427,0.000165044,0.01184405,0.00004586663,0.00004330856,0.00007609963,0.001301733,0.0000594811,0.00556461,0.967526,0.00004598981,0.01294484],"study_design_scores_gemma":[0.001065454,0.0006746533,0.004539714,0.000082514,0.000005281175,0.0003690406,0.00008349929,0.0003805802,0.002985137,0.9895996,0.0001190974,0.00009541808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.614915,0.0008810238,0.3834916,0.0001446422,0.0001964126,0.0001397315,0.000002317967,0.000009132556,0.0002202016],"genre_scores_gemma":[0.9755269,0.0004441373,0.02388853,0.00004794232,0.00003710237,0.000003546641,1.61833e-7,0.000009898354,0.00004182686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3606119,"threshold_uncertainty_score":0.3598187,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009461830976999132,"gpt":0.2545278158753462,"spread":0.2450659848983471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00266372,0.0002056941,0.0003142387,0.0008472377,0.0001955776,0.0001405933,0.001663736,0.00006695413,0.00002187949],"category_scores_gemma":[0.00008459543,0.0001391378,0.000264402,0.001026571,0.0002661684,0.001179845,0.0001651146,0.0007361675,0.00001634973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007372459,"about_ca_system_score_gemma":0.0002062922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003511265,"about_ca_topic_score_gemma":0.000003718508,"domain_scores_codex":[0.9976788,0.0002933516,0.0004062723,0.0002567782,0.0009416797,0.0004230963],"domain_scores_gemma":[0.9982328,0.0002569706,0.0003937526,0.0005359714,0.0003234078,0.000257055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003271062,0.0001415922,0.0007481507,0.00001297583,0.0001193909,0.0004195616,0.001092278,0.001060786,0.002850948,0.986265,0.00002516734,0.006937024],"study_design_scores_gemma":[0.001406799,0.000911441,0.001971515,0.0001057483,0.00001614321,0.001574988,0.0002163398,0.000008040547,0.005354081,0.9881095,0.0001368781,0.0001885362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4206887,0.000593255,0.5768531,0.0004722705,0.0002231542,0.0001119319,8.189743e-7,0.00004916851,0.001007618],"genre_scores_gemma":[0.9704252,0.00009551882,0.0290757,0.0002596549,0.00004883105,0.000003282575,1.594335e-7,0.00002175558,0.00006987912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5497366,"threshold_uncertainty_score":0.5673877,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01250663770375848,"gpt":0.2608837992795954,"spread":0.2483771615758369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540387,0.0002575461,0.0004779752,0.00129353,0.0002966063,0.0001739963,0.001080264,0.00009318999,0.00001397255],"category_scores_gemma":[0.0003555477,0.0001937549,0.0003220569,0.0008357507,0.000389462,0.0007011428,0.0001120259,0.0006527264,0.000008652813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002025538,"about_ca_system_score_gemma":0.00003903047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000127971,"about_ca_topic_score_gemma":0.000001634584,"domain_scores_codex":[0.9970443,0.0009329435,0.0005302069,0.00033762,0.0006771782,0.0004778105],"domain_scores_gemma":[0.99703,0.001444279,0.0004353016,0.0005590862,0.0002094086,0.0003218966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007156309,0.00008234575,0.0004639476,0.00001558369,0.00009452089,0.00005147685,0.0005498093,0.00008421292,0.001941367,0.939418,0.000175381,0.05640771],"study_design_scores_gemma":[0.002528764,0.0007236075,0.001290783,0.0001355573,0.00001996109,0.0003822936,0.0001156972,0.0003536494,0.001098778,0.9922121,0.0009155179,0.0002233124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.319178,0.001412588,0.6729334,0.0008937671,0.0007809349,0.000253553,0.000003426035,0.00009981919,0.004444544],"genre_scores_gemma":[0.9899546,0.0002755476,0.008969414,0.0005904651,0.00007401191,0.000003948946,3.983286e-7,0.00002699498,0.0001046272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6707766,"threshold_uncertainty_score":0.7901096,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01615817366489835,"gpt":0.2670299673838781,"spread":0.2508717937189797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137193,0.0002069299,0.0004497613,0.0005499872,0.0001317971,0.00003541458,0.000276979,0.0001099408,0.0000239317],"category_scores_gemma":[0.0002056901,0.0001291781,0.0001573092,0.0003006136,0.0002739711,0.0002107093,0.00003255079,0.0003959662,2.604694e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001627928,"about_ca_system_score_gemma":0.00002926803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000105172,"about_ca_topic_score_gemma":0.000009610751,"domain_scores_codex":[0.9985469,0.0002707764,0.0005016254,0.0001475288,0.0002823866,0.0002507698],"domain_scores_gemma":[0.9985756,0.0005630485,0.0004145438,0.0002181704,0.0001108644,0.0001177958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001057699,0.0001577212,0.01059692,0.00003580799,0.0001286417,0.000199372,0.003159418,0.00001178448,0.0004755194,0.9681758,0.0003295815,0.01567175],"study_design_scores_gemma":[0.001075226,0.0006348157,0.06666791,0.000176118,0.00007584802,0.0003514318,0.0008883869,0.000004027324,0.0002819563,0.9296001,0.00007913743,0.0001650781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9954816,0.001646811,0.0004060792,0.0001912228,0.0001399073,0.0001271928,0.00000306162,0.00001768606,0.001986429],"genre_scores_gemma":[0.9931274,0.0003117706,0.006272448,0.0001662795,0.00006618635,0.000001317366,2.552401e-7,0.00001829958,0.00003602172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05607099,"threshold_uncertainty_score":0.526773,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02557476282706089,"gpt":0.2294983793032437,"spread":0.2039236164761828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003928259,0.0001095932,0.0001943885,0.0008570942,0.00007317564,0.0001256594,0.001873777,0.00002752379,0.00002193702],"category_scores_gemma":[0.00006644569,0.00005613522,0.0002039394,0.001532829,0.0000671127,0.0008745242,0.0001174614,0.0002416552,0.000008225667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009035116,"about_ca_system_score_gemma":0.00001133068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008716017,"about_ca_topic_score_gemma":0.000004871712,"domain_scores_codex":[0.9985845,0.0003226079,0.0003858263,0.0001288343,0.0003735237,0.0002047182],"domain_scores_gemma":[0.998974,0.0002908887,0.0002862138,0.000348768,0.00005009238,0.00005000056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004034909,0.0009352038,0.005894489,0.00003137443,0.0002484029,0.0007451278,0.009217599,0.00002158886,0.0001579566,0.5460187,0.005077603,0.4312485],"study_design_scores_gemma":[0.002739763,0.0004158965,0.145001,0.00008501671,0.00006014503,0.0001590305,0.0009180658,0.0001972041,0.0004724792,0.8448657,0.004800291,0.0002853583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2929801,0.002533081,0.6924496,0.0004943372,0.001603655,0.000284034,0.000004420145,0.00004084653,0.009609882],"genre_scores_gemma":[0.9921153,0.0006340301,0.006644797,0.0004372166,0.0001177332,0.000003324316,8.261456e-7,0.000004525014,0.00004226937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6991352,"threshold_uncertainty_score":0.3481975,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01333210502062638,"gpt":0.2511320324903791,"spread":0.2377999274697528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123993,0.00007077133,0.0001815382,0.0003306342,0.0001278796,0.00003561721,0.0003068902,0.00003373378,0.00001759129],"category_scores_gemma":[0.00009736035,0.00005758944,0.0001565751,0.0005120049,0.000166277,0.0003592274,0.00001702197,0.00009043157,4.500737e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008615012,"about_ca_system_score_gemma":0.0001726784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002350959,"about_ca_topic_score_gemma":0.000001095214,"domain_scores_codex":[0.9989089,0.0001789537,0.000427589,0.00008331913,0.0003068218,0.00009438284],"domain_scores_gemma":[0.9988096,0.0002102203,0.0005545199,0.0001202659,0.0002557223,0.00004964374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003532199,0.0001042185,0.001038046,0.0000242297,0.00006514331,0.000009951711,0.001649796,0.004395983,0.0413258,0.9440224,0.0002325313,0.007096586],"study_design_scores_gemma":[0.0003774331,0.0003305125,0.002138794,0.00009703669,0.00002169433,0.0001933223,0.0002429066,0.0002021115,0.1180595,0.8775278,0.0007049153,0.0001039988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7844809,0.001187862,0.2129119,0.00005448552,0.0003939082,0.00002660354,0.000001692108,0.000005174416,0.0009373943],"genre_scores_gemma":[0.9695907,0.00003956636,0.03025763,0.00004682158,0.0000222293,2.444575e-7,3.114397e-7,0.000002640376,0.0000398782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1851097,"threshold_uncertainty_score":0.2348429,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01800886521061376,"gpt":0.2067521056339043,"spread":0.1887432404232905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381659,0.00008755729,0.0002035382,0.0004849925,0.00004621518,0.00001682999,0.000514481,0.0000466343,0.00002748752],"category_scores_gemma":[0.00004495851,0.00006483428,0.0002024382,0.0005145997,0.00008862394,0.000393184,0.00004827356,0.00012944,0.000003598612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003863965,"about_ca_system_score_gemma":0.00003960526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002558914,"about_ca_topic_score_gemma":2.071953e-7,"domain_scores_codex":[0.9989167,0.0001743359,0.0004498486,0.0001010795,0.0002317655,0.000126274],"domain_scores_gemma":[0.9987447,0.00005558732,0.0005769089,0.0002621993,0.0002811415,0.00007944911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000600474,0.0001369243,0.001466064,0.00001283444,0.00005818238,0.00001311679,0.001557223,0.000001653691,0.2062361,0.7846569,0.00003377496,0.005767209],"study_design_scores_gemma":[0.0003765186,0.0004123832,0.009780096,0.00008175543,0.00002519544,0.0001009118,0.00002973857,0.00004897242,0.08445002,0.9045473,0.00005307491,0.00009407274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9232814,0.0002564169,0.07489482,0.00004543119,0.0005565814,0.00004472645,9.125801e-7,0.0000231077,0.0008966423],"genre_scores_gemma":[0.9922417,0.00009300301,0.007502632,0.0001236581,0.000006177678,6.516034e-7,2.777044e-7,0.000005945103,0.00002596745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1217861,"threshold_uncertainty_score":0.2643865,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Champlain Regional College; Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02923283402548195,"gpt":0.2822847666308228,"spread":0.2530519326053409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002137191,0.0001481834,0.0004211988,0.0006569265,0.00006303057,0.00001183489,0.000219171,0.0001124956,0.00009925717],"category_scores_gemma":[0.0004058779,0.0001069797,0.0002033652,0.0003069463,0.0002564822,0.0001705979,0.0000651523,0.0004075013,2.275552e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001849343,"about_ca_system_score_gemma":0.0000133735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002900988,"about_ca_topic_score_gemma":0.0000069048,"domain_scores_codex":[0.9984178,0.0003627837,0.0005814889,0.000118945,0.0003350725,0.0001839305],"domain_scores_gemma":[0.9984342,0.0006291782,0.000551454,0.0002065281,0.0001028992,0.00007574838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003165372,0.000338015,0.02612296,0.0001446074,0.0002013878,0.00007881418,0.007442523,0.000004076188,0.0007027854,0.955453,0.0004104468,0.008784823],"study_design_scores_gemma":[0.0008550936,0.0002181819,0.01517071,0.0001103384,0.00004860506,0.0002245998,0.0007946384,0.00001047314,0.0005965905,0.9818168,0.00004116042,0.0001127722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9948525,0.001232389,0.0001599135,0.00004507064,0.0002558477,0.0001257386,0.000004614354,0.000007099203,0.003316759],"genre_scores_gemma":[0.9983903,0.0003382544,0.001149558,0.00004197362,0.00002099953,0.000001132222,6.843755e-8,0.0000155941,0.00004211975],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02636382,"threshold_uncertainty_score":0.4362507,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03657459361179385,"gpt":0.2746048405043239,"spread":0.23803024689253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003440556,0.0001561358,0.0003693443,0.001165409,0.00005856767,0.00002610773,0.001206578,0.00006711295,0.00002780777],"category_scores_gemma":[0.0002544832,0.0001294434,0.0001654604,0.001216016,0.0005306245,0.0009397883,0.000223321,0.0004240306,0.000002893603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002228095,"about_ca_system_score_gemma":0.00007912252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006339498,"about_ca_topic_score_gemma":0.000004186994,"domain_scores_codex":[0.9978802,0.0004307668,0.0006403564,0.0002306012,0.0004318671,0.0003861641],"domain_scores_gemma":[0.9981849,0.0005236182,0.0004423574,0.0004292115,0.0002399299,0.0001800348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004032056,0.0001727182,0.02712091,0.00005193075,0.00004278058,0.0001334662,0.002908009,0.000007733747,0.009477856,0.9504262,0.00001069181,0.009244537],"study_design_scores_gemma":[0.0006138945,0.0007233779,0.05100743,0.0001234705,0.00001097734,0.0001451089,0.0002835866,0.00004150629,0.01361323,0.9332899,0.00001571714,0.0001317751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9683851,0.002007007,0.02797012,0.00005918262,0.0002056966,0.000115445,7.922949e-7,0.00001590324,0.001240745],"genre_scores_gemma":[0.9922523,0.0004208048,0.007223186,0.00004118056,0.00001285475,0.000003331362,4.031254e-8,0.00001126177,0.00003503921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02388652,"threshold_uncertainty_score":0.5278549,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02432364321713661,"gpt":0.3075562901536715,"spread":0.2832326469365349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165816,0.0002358086,0.0003813461,0.0005565459,0.0002322592,0.00005913577,0.0004905044,0.0001065708,0.0003655882],"category_scores_gemma":[0.0004294752,0.0001719788,0.0004991213,0.0003379367,0.0002192438,0.0002418099,0.00003512451,0.000480281,0.00005787308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003351433,"about_ca_system_score_gemma":0.0000313042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.500498e-7,"about_ca_topic_score_gemma":0.000009376056,"domain_scores_codex":[0.9981605,0.0003303097,0.0006995694,0.0001708048,0.0003700273,0.0002688272],"domain_scores_gemma":[0.9971018,0.00146687,0.0006963515,0.0003875749,0.0001786025,0.000168816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002706145,0.0004203965,0.0004194955,0.00002460974,0.0001438281,0.00001302469,0.0007929889,0.00001330304,0.0002653919,0.9875217,0.004843303,0.005271314],"study_design_scores_gemma":[0.0004611087,0.0001994206,0.0006649034,0.0001343509,0.0001505717,0.00008784581,0.0006424566,0.000009851013,0.001685876,0.9917911,0.003980233,0.0001923014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9799148,0.0007503701,0.004347352,0.0006134512,0.0002067091,0.0001940714,0.00002107828,0.00006142294,0.01389069],"genre_scores_gemma":[0.9957781,0.0001162047,0.002902902,0.0002890262,0.0002252121,0.000009243113,0.000001514586,0.0000364692,0.0006412934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01586328,"threshold_uncertainty_score":0.7013091,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02511845915547385,"gpt":0.3149270744807101,"spread":0.2898086153252363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.007977569,0.0001940971,0.0004033648,0.0004958907,0.0009079562,0.000335592,0.00800689,0.0000795913,0.00001945131],"category_scores_gemma":[0.001537622,0.0001216251,0.0005235448,0.0004058607,0.001179245,0.001413858,0.0008639756,0.000757319,0.000003985951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000284466,"about_ca_system_score_gemma":0.0001518824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004959654,"about_ca_topic_score_gemma":0.000005751346,"domain_scores_codex":[0.9970994,0.000688644,0.0006693685,0.0002296116,0.0008732007,0.0004397721],"domain_scores_gemma":[0.994491,0.000998126,0.001489913,0.002377115,0.0004676782,0.0001761882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001908641,0.00006924412,0.002423551,0.00001647575,0.000121063,0.00005485776,0.0006002462,0.0000203678,0.004418572,0.9727404,0.0004968239,0.0188475],"study_design_scores_gemma":[0.0007020911,0.0002905297,0.007000995,0.00009272435,0.00002134505,0.0001897415,0.0001241337,0.00004531495,0.007798333,0.9825237,0.001076862,0.0001342469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4302604,0.003427238,0.5446255,0.004755511,0.002988619,0.0004401307,0.00001213417,0.00006722962,0.01342321],"genre_scores_gemma":[0.9875202,0.0003694217,0.01164007,0.0001732746,0.0001351121,0.000003347716,1.092627e-7,0.00001950388,0.0001389984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5572597,"threshold_uncertainty_score":0.9973603,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04026935918545071,"gpt":0.2881943755700647,"spread":0.247925016384614,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002971503,0.0002365866,0.0005061635,0.0004067557,0.000204032,0.00002241591,0.0007838939,0.0001361613,0.0002045043],"category_scores_gemma":[0.001201341,0.0001262802,0.0007087154,0.0003555746,0.0003730131,0.0001038219,0.00004212092,0.0005413996,0.000001631942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001425803,"about_ca_system_score_gemma":0.00004025627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.284758e-7,"about_ca_topic_score_gemma":4.584548e-7,"domain_scores_codex":[0.9976686,0.0005036913,0.0008490773,0.0001341789,0.0005719902,0.000272463],"domain_scores_gemma":[0.9952603,0.002897571,0.0009821497,0.000515526,0.0002401629,0.0001042656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008614885,0.000188423,0.0001044691,0.0000191229,0.0001877767,0.00002538515,0.001216492,0.000002610978,0.001381374,0.9856521,0.005331331,0.005029402],"study_design_scores_gemma":[0.0006143682,0.0009851656,0.002660909,0.0001410494,0.0001345331,0.0001228705,0.0005901766,0.000002551266,0.003169113,0.9912556,0.0001823205,0.0001413831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9839441,0.0005732601,0.0005398743,0.0005333882,0.0005175851,0.0001487129,0.000007481992,0.00001543604,0.01372012],"genre_scores_gemma":[0.997328,0.00008215741,0.001568852,0.0007367472,0.0001307097,9.600363e-7,2.207872e-7,0.00002066492,0.0001316712],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01358845,"threshold_uncertainty_score":0.5149556,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04279535364240605,"gpt":0.2992597116122812,"spread":0.2564643579698752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007147487,0.0002657294,0.0004417539,0.0007519357,0.0001792312,0.0001110627,0.001546913,0.00006985478,0.00006926603],"category_scores_gemma":[0.0001776298,0.0001471981,0.0001201155,0.001079273,0.0002910418,0.0009420526,0.0002929095,0.0007721106,0.000008704124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004797065,"about_ca_system_score_gemma":0.0001459038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002029632,"about_ca_topic_score_gemma":0.0001506501,"domain_scores_codex":[0.996277,0.001414729,0.0006397348,0.0003429004,0.0006418201,0.0006838638],"domain_scores_gemma":[0.9977221,0.0007469628,0.0004009608,0.0005984426,0.0003613351,0.0001701713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003647711,0.001177004,0.04679994,0.0001169021,0.0001176963,0.001727164,0.02333839,0.00001213564,0.0003364992,0.916242,0.001567016,0.004917533],"study_design_scores_gemma":[0.003946994,0.003548828,0.04895768,0.00046735,0.00002132849,0.0004626287,0.003375062,0.0004535153,0.0002363869,0.9353852,0.002690707,0.0004542988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9167255,0.001799079,0.07142038,0.0002617502,0.0003911133,0.001050086,0.0000399583,0.00005461743,0.00825755],"genre_scores_gemma":[0.9821242,0.0006906844,0.01649455,0.0005102502,0.00003477516,0.0000233482,0.000001050564,0.00002303733,0.00009807881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06539876,"threshold_uncertainty_score":0.6002564,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Characterization (materials science); Mathematics; Combinatorics; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01670190763608695,"gpt":0.2648895667963944,"spread":0.2481876591603075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215868,0.00008072395,0.0002196795,0.0001485424,0.00005173844,0.000008622516,0.0002016403,0.00004646728,0.0006909342],"category_scores_gemma":[0.00006163141,0.00006300919,0.0001985556,0.0002551347,0.0001032153,0.0001400632,0.000007054264,0.000119809,0.000007860607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004971573,"about_ca_system_score_gemma":0.00001850782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.964666e-7,"about_ca_topic_score_gemma":5.470721e-7,"domain_scores_codex":[0.9990686,0.0001490488,0.0004741962,0.00005778306,0.0001583036,0.00009202882],"domain_scores_gemma":[0.9989604,0.0002598742,0.0004301812,0.0001842606,0.0001160943,0.00004920975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001624194,0.0002151843,0.000159742,0.00002119826,0.0000663385,0.000002351264,0.0004732837,0.000001853523,0.1295919,0.8607627,0.0001588121,0.008384289],"study_design_scores_gemma":[0.0002687569,0.00008137331,0.001749279,0.00006438648,0.00007023607,0.00004664797,0.00008556736,0.000001593137,0.02450372,0.97085,0.002215719,0.00006270245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9934005,0.00005694202,0.002379381,0.0001060021,0.00005047248,0.00007325657,0.00001063314,0.00001210425,0.003910758],"genre_scores_gemma":[0.9980739,0.0001239713,0.001082632,0.00007904026,0.00006893618,0.000002551196,0.000001458961,0.00001261805,0.0005548516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1100874,"threshold_uncertainty_score":0.7565244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04184398416111462,"gpt":0.2771186155277397,"spread":0.2352746313666251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002468826,0.0002436927,0.0005611461,0.0005657073,0.0003175299,0.00002528266,0.0003249377,0.0001422271,0.00008812998],"category_scores_gemma":[0.0004549934,0.0001686235,0.0006349905,0.000214407,0.0004142728,0.0001834717,0.00006113121,0.0002948912,4.193247e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000871138,"about_ca_system_score_gemma":0.0000271477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001558245,"about_ca_topic_score_gemma":0.000002099474,"domain_scores_codex":[0.9983121,0.0003008255,0.0006773012,0.0001738724,0.0002345251,0.0003013934],"domain_scores_gemma":[0.9970286,0.001673448,0.0005814839,0.000282687,0.0002557451,0.0001780134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002535702,0.0001126189,0.0006117783,0.0000777373,0.0004732539,0.00001783828,0.004244628,1.436963e-7,0.0004946253,0.9874488,0.001195241,0.002787606],"study_design_scores_gemma":[0.003017101,0.000504137,0.00110376,0.00009599863,0.000366156,0.000468578,0.001197709,0.000002208176,0.001715557,0.9908939,0.0004268624,0.0002080463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9596924,0.003075106,0.0233635,0.00008554001,0.001258715,0.0005629001,0.00003135135,0.00004876277,0.01188172],"genre_scores_gemma":[0.9787424,0.0004129099,0.02035886,0.000145431,0.0001173425,0.000008974234,4.720254e-7,0.00004511113,0.0001684767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01905002,"threshold_uncertainty_score":0.6876266,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0100893062538668,"gpt":0.2722599458959123,"spread":0.2621706396420456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002680859,0.0001319334,0.00022317,0.0005329023,0.0001789619,0.0001420801,0.0007626587,0.00005728031,0.00000940125],"category_scores_gemma":[0.0001168672,0.0001051847,0.0001252157,0.0003928494,0.0002075564,0.0007236358,0.0002101699,0.0003817769,0.000003463302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000302574,"about_ca_system_score_gemma":0.00004776382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000389919,"about_ca_topic_score_gemma":0.000005511628,"domain_scores_codex":[0.9982593,0.0003543236,0.0004062,0.0001857661,0.000498053,0.0002963787],"domain_scores_gemma":[0.9985888,0.0004897339,0.000335734,0.0002794344,0.0001826826,0.0001236077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007875553,0.0000833804,0.005190824,0.00001612295,0.00004042149,0.0002197481,0.0004121553,0.0001415266,0.006962664,0.9147857,0.0001276259,0.07194101],"study_design_scores_gemma":[0.0005910086,0.0001309938,0.03231705,0.00004997612,0.000007498838,0.0005258663,0.0001343108,0.0002263616,0.002764609,0.9629195,0.0002066389,0.0001261652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7522586,0.002136934,0.2423555,0.0003759893,0.0002500852,0.00009322887,0.000001614401,0.00003434186,0.002493693],"genre_scores_gemma":[0.9756714,0.00006424118,0.02399288,0.00007615115,0.00007425009,0.000001423552,1.584142e-7,0.0000112946,0.0001082109],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2234128,"threshold_uncertainty_score":0.4289306,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Degree (music); Discrete mathematics; Matching (statistics); Time complexity","retraction":null,"screen_n_in":null,"score":{"opus":0.003255866224064684,"gpt":0.1759290234281393,"spread":0.1726731572040746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008605568,0.00008336094,0.0001038034,0.00008831951,0.0001201704,0.0000787409,0.0001684103,0.00003832669,0.00002562346],"category_scores_gemma":[0.00001641944,0.0000533832,0.0001056762,0.0001880106,0.00004862562,0.0001161961,0.000008287268,0.0002038328,0.000007117789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001670893,"about_ca_system_score_gemma":0.00001181393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.29063e-7,"about_ca_topic_score_gemma":0.000003672939,"domain_scores_codex":[0.9992819,0.00005789721,0.0003189288,0.00003792386,0.0001509699,0.0001523575],"domain_scores_gemma":[0.9995003,0.0001597092,0.0001204506,0.0001008258,0.00008406216,0.00003469663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006396219,0.00004941298,0.001845621,0.00006471478,0.0001779782,0.00002331957,0.0004923462,0.5740274,0.003284706,0.3619694,0.03458366,0.02341756],"study_design_scores_gemma":[0.001068437,0.0001184949,0.001919546,0.0002349999,0.00007875309,0.0002861499,0.0002714218,0.003285674,0.004008129,0.7683885,0.2199457,0.0003942914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1096377,0.03379799,0.4369366,0.001978752,0.006442237,0.0006049149,0.00001068462,0.0007155335,0.4098756],"genre_scores_gemma":[0.996023,0.0005300508,0.00259395,0.00006233081,0.0002436621,0.000001465599,6.965511e-7,0.0000287341,0.000516101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8863853,"threshold_uncertainty_score":0.2176904,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02135598576617967,"gpt":0.3100758100082969,"spread":0.2887198242421172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003319912,0.0002185747,0.0004037642,0.0006217308,0.0002945819,0.000294834,0.002694508,0.0001031037,0.00005811401],"category_scores_gemma":[0.0006477661,0.0001882925,0.000549414,0.001075689,0.0002998865,0.001637084,0.0002755794,0.0004778286,0.00000473008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003884273,"about_ca_system_score_gemma":0.0002961608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.168267e-7,"about_ca_topic_score_gemma":0.000002721312,"domain_scores_codex":[0.9971935,0.0006328221,0.0005842192,0.00037964,0.0006575967,0.0005522254],"domain_scores_gemma":[0.9960024,0.0009979876,0.000383569,0.00125923,0.0009766497,0.0003801037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004032117,0.0002801328,0.0001930237,0.00002405728,0.0001473771,0.0002741062,0.0005255954,0.0003947033,0.01198484,0.9600198,0.0008337803,0.02491938],"study_design_scores_gemma":[0.001222219,0.0007268524,0.0004567713,0.00003797276,0.00002655135,0.0004623228,0.0003159795,0.0004679975,0.02123562,0.9728508,0.001969925,0.0002270025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1496531,0.002660441,0.8454663,0.0005587514,0.0007948236,0.0001607233,0.00001632454,0.00004990687,0.0006397023],"genre_scores_gemma":[0.7379522,0.0003419637,0.2602508,0.0006188283,0.0003400758,0.00002066463,0.000003984971,0.00005834987,0.0004131305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5882991,"threshold_uncertainty_score":0.7678344,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01915466422965092,"gpt":0.2651641335600965,"spread":0.2460094693304456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979084,0.0001795334,0.0004621071,0.0008550069,0.0001619182,0.0000334517,0.0009712218,0.00008241404,0.00002794747],"category_scores_gemma":[0.0004264363,0.0001397283,0.000276549,0.0008062639,0.0008330418,0.0007867393,0.0001403544,0.0004265743,0.000002160796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001661712,"about_ca_system_score_gemma":0.0001083808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003012776,"about_ca_topic_score_gemma":0.000001028251,"domain_scores_codex":[0.9978023,0.000464752,0.0006174911,0.0002111553,0.0005746761,0.0003296923],"domain_scores_gemma":[0.997099,0.001232699,0.0005962884,0.0004137574,0.0004042242,0.0002539973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002952174,0.0001577329,0.01853764,0.00002502846,0.0002030842,0.0002401522,0.001437687,0.00003348765,0.01016425,0.9627842,0.0002404091,0.005881103],"study_design_scores_gemma":[0.001210651,0.0006561922,0.0290483,0.00006669803,0.00002151994,0.001157477,0.0002323775,0.00003637495,0.01380878,0.9531769,0.000372941,0.0002117857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8974409,0.002808691,0.09872049,0.0001325398,0.0003175372,0.0001023807,0.000003020209,0.00002401544,0.0004504711],"genre_scores_gemma":[0.9941401,0.0007519212,0.004890711,0.0001022208,0.00004973589,0.000001327677,1.840945e-7,0.00001455856,0.00004920883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09669928,"threshold_uncertainty_score":0.5697956,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006922689708773792,"gpt":0.2265858955011992,"spread":0.2196632057924254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007928007,0.00006571281,0.0001202308,0.0004627291,0.00005604577,0.0000519138,0.0002551716,0.00003415779,0.0000206049],"category_scores_gemma":[0.0001218495,0.00005688014,0.00008487747,0.0005326157,0.00002230274,0.0002767311,0.00002221157,0.0001272716,0.000005739785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002536346,"about_ca_system_score_gemma":0.00007152311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003890439,"about_ca_topic_score_gemma":0.00001245171,"domain_scores_codex":[0.9990593,0.0001402629,0.0003656466,0.00008697315,0.0002399793,0.000107821],"domain_scores_gemma":[0.9988418,0.0007151035,0.0001916821,0.00009700558,0.0001147647,0.00003964695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009348153,0.0002217386,0.0008935659,0.000004751028,0.00002038818,0.0002002738,0.0002417529,0.2960247,0.002085068,0.664407,0.0008036907,0.03500359],"study_design_scores_gemma":[0.00118673,0.000167466,0.02522039,0.00002841664,0.00001088081,0.0003752364,0.00002801418,0.02196314,0.001155179,0.9463697,0.003339295,0.0001555535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3487325,0.0006178897,0.648835,0.0004083826,0.0004887963,0.00005214301,0.000002095077,0.00001372513,0.0008494344],"genre_scores_gemma":[0.9879549,0.000009691611,0.01147268,0.00009686616,0.0002660106,7.809344e-7,0.000003272696,0.000003031184,0.0001928377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6392223,"threshold_uncertainty_score":0.2319505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04967696835749449,"gpt":0.3495251988836877,"spread":0.2998482305261932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003427934,0.000194659,0.0004552994,0.0003141068,0.0008137758,0.00006139286,0.0004008781,0.00007956752,0.0001662187],"category_scores_gemma":[0.0004185766,0.000157056,0.0002939777,0.0002109904,0.0001344985,0.0002457459,0.0001546259,0.0004548908,1.822022e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006222755,"about_ca_system_score_gemma":0.00007778113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002100125,"about_ca_topic_score_gemma":0.000003113881,"domain_scores_codex":[0.9980684,0.0005438828,0.0006298206,0.0001669266,0.0003213121,0.0002696639],"domain_scores_gemma":[0.9977393,0.0011031,0.0006502286,0.0002676728,0.00009210344,0.0001475514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002208596,0.000397512,0.001283112,0.0002452209,0.0006395418,0.00006468872,0.01326465,0.000007667662,0.01636229,0.9438685,0.008449906,0.01320831],"study_design_scores_gemma":[0.001517102,0.0008803579,0.0006455622,0.00003764658,0.0001612467,0.0007820531,0.002523653,0.00004315172,0.0007619686,0.9914979,0.0009386677,0.0002106729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.996316,0.0002168401,0.001025238,0.0001115112,0.0007881725,0.0002330305,0.00001674593,0.00002557738,0.001266889],"genre_scores_gemma":[0.9942925,0.00001897744,0.004873608,0.0002322729,0.0004151141,0.00002080001,0.000001173266,0.00004657087,0.00009899686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04762942,"threshold_uncertainty_score":0.6404558,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02663227634858786,"gpt":0.2972262758258897,"spread":0.2705939994773018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208337,0.0001348445,0.0002990303,0.0006884784,0.0001339282,0.00005618947,0.001288623,0.00007583429,0.00005098226],"category_scores_gemma":[0.0003273635,0.00009809496,0.0001893192,0.0008966747,0.0004641745,0.0007784462,0.000188774,0.0005277765,0.00001645004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003549911,"about_ca_system_score_gemma":0.00008063447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002862475,"about_ca_topic_score_gemma":0.000003324136,"domain_scores_codex":[0.9979928,0.0005544441,0.0003913866,0.0001972622,0.0004927154,0.0003714428],"domain_scores_gemma":[0.9984762,0.000637494,0.0002458899,0.0003432202,0.0001363593,0.0001608024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002116265,0.0002011382,0.01160123,0.000006611424,0.00003177816,0.001236961,0.001507452,0.0004596636,0.001374784,0.9782106,0.0003076367,0.004850484],"study_design_scores_gemma":[0.0005630255,0.0003588978,0.01129615,0.00002587725,0.000002626236,0.0009338292,0.0002678922,0.000103689,0.001518586,0.9837164,0.001073729,0.0001393372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.903656,0.00175581,0.09021407,0.001356837,0.0003129272,0.00007651378,5.762417e-7,0.00003299469,0.002594253],"genre_scores_gemma":[0.9856654,0.000461928,0.01339445,0.000212881,0.00007797077,0.000001856008,6.546492e-8,0.000007854091,0.0001775665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08200941,"threshold_uncertainty_score":0.4000196,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01236962508142394,"gpt":0.2310089302629098,"spread":0.2186393051814858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001688492,0.000133426,0.0003764261,0.000209716,0.0001499461,0.00006243709,0.0003509964,0.00008316143,0.00002962228],"category_scores_gemma":[0.0001488298,0.0001060962,0.0002233843,0.00005306129,0.0002303763,0.000313851,0.00002798489,0.0002074574,0.000002279341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007406186,"about_ca_system_score_gemma":0.00001259419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003078096,"about_ca_topic_score_gemma":0.000001754995,"domain_scores_codex":[0.9990376,0.0001060373,0.0004710214,0.00007167853,0.0001617257,0.0001519912],"domain_scores_gemma":[0.9989675,0.000136263,0.0004041134,0.0003094047,0.00008559578,0.0000971169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001998718,0.0002880271,0.04046205,0.001504023,0.002176591,0.0003592517,0.009224855,0.001373064,0.1886964,0.6502333,0.005067312,0.0986164],"study_design_scores_gemma":[0.005708838,0.0007467796,0.0907632,0.001466689,0.0004677796,0.001244767,0.002556727,0.000436069,0.04600808,0.8414638,0.008274099,0.0008631384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.992282,0.002911813,0.0008625245,0.00004181421,0.0006085436,0.00005959298,0.000006680307,0.0000195708,0.003207441],"genre_scores_gemma":[0.9992064,0.0003076203,0.0001679327,0.00001239435,0.0001927702,8.521116e-7,1.993582e-7,0.00002120402,0.00009058522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1912305,"threshold_uncertainty_score":0.4326478,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05114219761848536,"gpt":0.2804795377212718,"spread":0.2293373401027864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276522,0.0001339955,0.0002590899,0.0001482685,0.0001289886,0.00001509854,0.000390388,0.00006345429,0.0006396268],"category_scores_gemma":[0.0005126146,0.00008165596,0.0003283167,0.0005928384,0.000229696,0.00008900996,0.00002552745,0.0003478247,0.00001307998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007848199,"about_ca_system_score_gemma":0.00003397657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.209147e-7,"about_ca_topic_score_gemma":0.000001921383,"domain_scores_codex":[0.9986153,0.0003613629,0.0004943151,0.0001021829,0.0002942835,0.0001326174],"domain_scores_gemma":[0.9968344,0.001946991,0.0006052482,0.0002730074,0.0002449324,0.00009542558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001999921,0.0001616024,0.00002041831,0.00002365993,0.0001460827,0.000002228935,0.0008631867,0.00001877782,0.002368956,0.9867988,0.009032981,0.0003632745],"study_design_scores_gemma":[0.0003455055,0.0002221784,0.0002536302,0.00006445397,0.0001175168,0.00001496014,0.001327732,0.000007225649,0.003733429,0.9934095,0.0004185541,0.00008535076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9728158,0.0001615692,0.01519745,0.004756503,0.0001399493,0.0002467374,0.00004014246,0.0000303782,0.00661152],"genre_scores_gemma":[0.9981011,0.00003813783,0.0006157756,0.001093201,0.0000793713,0.000005877144,0.000001647179,0.00002109556,0.00004380555],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02528534,"threshold_uncertainty_score":0.7003464,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009481002985737785,"gpt":0.1954505032521271,"spread":0.1859695002663893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206911,0.0001505519,0.0003725297,0.0004482595,0.00006137133,0.00001759268,0.0002628616,0.00007182032,0.00006552952],"category_scores_gemma":[0.00009606306,0.0001262546,0.0003088159,0.000430981,0.0001303416,0.0001916219,0.00001262083,0.0002042498,0.00001103899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009679389,"about_ca_system_score_gemma":0.000008817609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001185186,"about_ca_topic_score_gemma":0.000002201421,"domain_scores_codex":[0.9985846,0.0002525988,0.0006704606,0.00007451974,0.0002212976,0.000196532],"domain_scores_gemma":[0.9988967,0.0002969863,0.0002839424,0.0002404156,0.0001591008,0.0001229011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001280482,0.0001064904,0.00911431,0.0002186402,0.0005133658,0.000006632394,0.001396554,0.01807451,0.1393575,0.8273786,0.000876948,0.002828403],"study_design_scores_gemma":[0.002439035,0.0006096325,0.02138809,0.0006198522,0.0003235883,0.0001723909,0.0007063432,0.004199853,0.03919179,0.8969505,0.03267119,0.0007277205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9284651,0.001001666,0.06507312,0.00001884162,0.001586408,0.0001010493,0.0000231115,0.00007464577,0.003656046],"genre_scores_gemma":[0.9993963,0.00007820562,0.0003348793,0.00002187164,0.0001057368,0.000002163116,0.000001922016,0.00002765394,0.0000313075],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1001657,"threshold_uncertainty_score":0.5148512,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Girth (graph theory); Simple graph; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02800441050562604,"gpt":0.2720074911521995,"spread":0.2440030806465734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461016,0.0002604471,0.0006632955,0.0004172414,0.000216713,0.00002537355,0.0005272697,0.0001868051,0.0006041999],"category_scores_gemma":[0.0005713165,0.000172695,0.0008653281,0.0002172174,0.0003467129,0.0001873909,0.00009446447,0.0003149206,0.000002672197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002862502,"about_ca_system_score_gemma":0.0000414473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002067696,"about_ca_topic_score_gemma":0.000003924411,"domain_scores_codex":[0.9979945,0.0002442118,0.0008802795,0.0001598034,0.0003958908,0.0003253347],"domain_scores_gemma":[0.9962827,0.00148637,0.001142846,0.0003960803,0.0005323272,0.0001596755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004829868,0.00009154109,0.001440631,0.0002251924,0.0004924348,0.000008675265,0.00108866,0.00000932636,0.003356506,0.9789581,0.01130708,0.002538899],"study_design_scores_gemma":[0.001257384,0.000436914,0.001786318,0.0001119422,0.0001833612,0.0002854579,0.0003898433,0.000006561205,0.003382189,0.9909194,0.001047502,0.0001932036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9901707,0.0008871184,0.004689545,0.0002470436,0.0008791043,0.0004678521,0.00003207725,0.00002257558,0.002603955],"genre_scores_gemma":[0.9909521,0.00009667506,0.007889308,0.0001796714,0.0001964182,0.00001021687,0.000001045376,0.00004869647,0.0006258347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01196126,"threshold_uncertainty_score":0.70423,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03318065121206559,"gpt":0.3333721953777207,"spread":0.3001915441656551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002967456,0.0001323236,0.0003263703,0.0005177802,0.00057608,0.0001261341,0.002289536,0.00004623229,0.00002991714],"category_scores_gemma":[0.001033945,0.0001091798,0.0003020631,0.0004002748,0.0005907413,0.001086998,0.0003096035,0.000334409,0.000004948108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001763684,"about_ca_system_score_gemma":0.0001130239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003571894,"about_ca_topic_score_gemma":0.00000445539,"domain_scores_codex":[0.9978672,0.000383441,0.0006437923,0.0001827963,0.0006176056,0.0003051366],"domain_scores_gemma":[0.9961665,0.0005399762,0.001378154,0.0009594948,0.0007839891,0.0001719193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001238832,0.00009891402,0.006661356,0.00001302076,0.00008636508,0.00004203757,0.0005878382,0.0001039948,0.004981773,0.9793817,0.00008722381,0.007831828],"study_design_scores_gemma":[0.0008629647,0.0003153285,0.01781965,0.00009593873,0.00002199004,0.00008757507,0.0002585957,0.0002339257,0.007395694,0.9720987,0.0006750101,0.0001346173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2563466,0.0002580522,0.7395918,0.0004197707,0.0007861626,0.0001227258,0.00000558742,0.00002486849,0.002444361],"genre_scores_gemma":[0.9701425,0.00005699541,0.02961199,0.00005019052,0.00005219911,0.000002261804,4.020827e-7,0.00001130279,0.00007210184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.713796,"threshold_uncertainty_score":0.4452221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02247292266172958,"gpt":0.2810760398639245,"spread":0.258603117202195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003821374,0.0001592019,0.0004042166,0.000272429,0.0002070387,0.00002101295,0.0002118442,0.0001198629,0.0001239406],"category_scores_gemma":[0.001588985,0.0001333679,0.0001549229,0.0001194532,0.0002470989,0.0002726425,0.00005480502,0.000428888,0.000005241136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325292,"about_ca_system_score_gemma":0.00001859589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.802092e-7,"about_ca_topic_score_gemma":4.712567e-7,"domain_scores_codex":[0.9985712,0.0003844154,0.0004782821,0.0001487246,0.0001599207,0.0002574829],"domain_scores_gemma":[0.9972571,0.001785582,0.000541949,0.0001897419,0.0001019656,0.0001236235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001601101,0.00005870758,0.0008727544,0.00007084996,0.0001209868,0.00004109428,0.0005811345,0.000007133797,0.001675509,0.9867036,0.000154537,0.009553615],"study_design_scores_gemma":[0.0005687703,0.0002177714,0.0009717426,0.0001134801,0.0001018593,0.0005844393,0.0004112853,0.00001092454,0.001603082,0.9929464,0.002320992,0.0001491973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9254766,0.001079874,0.06826527,0.0001270939,0.0007221664,0.00009923589,0.000001066108,0.00003870736,0.004189946],"genre_scores_gemma":[0.9854769,0.000185945,0.01354926,0.0001287495,0.0002367312,0.000003310842,2.345124e-7,0.00002980188,0.0003890673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06000026,"threshold_uncertainty_score":0.5438583,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01066090488613492,"gpt":0.2508092513133372,"spread":0.2401483464272023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001916439,0.0001628028,0.0004433923,0.0001682815,0.0001043312,0.00001443506,0.0007006448,0.0001291981,0.0004377332],"category_scores_gemma":[0.0004281109,0.00008189696,0.0005916281,0.0002613091,0.0002225483,0.00009212339,0.0001224634,0.0004872372,0.000002270768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001677495,"about_ca_system_score_gemma":0.00006977837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.231763e-7,"about_ca_topic_score_gemma":8.622593e-7,"domain_scores_codex":[0.9982424,0.0004285083,0.0006126216,0.0001035486,0.0004242485,0.0001886973],"domain_scores_gemma":[0.9973278,0.0009565399,0.0009325326,0.000540582,0.0001807974,0.00006175567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002108194,0.00005923053,0.001469283,0.00008272803,0.0002627867,0.00001282454,0.001662532,0.00001519196,0.001750693,0.9927827,0.001087648,0.0006036146],"study_design_scores_gemma":[0.0006859191,0.0001624609,0.00241277,0.0001562904,0.0001367898,0.000416699,0.000423772,0.000003678795,0.002558311,0.9917917,0.001146975,0.000104588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9873172,0.0006465527,0.0008842591,0.0001880294,0.001854331,0.0001969991,0.000009964951,0.000009998558,0.008892635],"genre_scores_gemma":[0.9978406,0.00003523561,0.001181933,0.0002340292,0.0001441802,6.076887e-7,1.051041e-7,0.00002344148,0.0005398143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01052342,"threshold_uncertainty_score":0.4792871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}